\nauto prev_itr(set<T>& st, T val) {\n\tauto res = st.lower_bound(val);\n\tif (res == st.begin())return st.end();\n\tres--; return res;\n}\n\n//[val,)\ntemplate<typename T>\nauto next_itr(set<T>& st, T val) {\n\tauto res = st.lower_bound(val);\n\treturn res;\n}\nusing mP = pair<modint, modint>;\n\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n//-----------------------------------------\n\ntypedef modint Data;\ntypedef vector<Data> Array;\ntypedef vector<Array> mat;\n\nbool is_zero(Data dat) { return abs(dat) < eps; }\nmat operator-(mat a) {\n\trep(i, a.size())rep(j, a[0].size())a[i][j] = -a[i][j];\n\treturn a;\n}\nmat operator+(mat lhs, mat& rhs) {\n\trep(i, lhs.size())rep(j, lhs[0].size())lhs[i][j] += rhs[i][j];\n\treturn lhs;\n}\nmat operator-(mat lhs, mat& rhs) {\n\trep(i, lhs.size())rep(j, lhs[0].size())lhs[i][j] -= rhs[i][j];\n\treturn lhs;\n}\nmat operator*(const mat& lhs, const mat& rhs) {\n\tmat ret(lhs.size(), Array(rhs[0].size(), 0));\n\trep(i, lhs.size())rep(j, rhs[0].size())rep(k, rhs.size()) {\n\t\tret[i][j] += lhs[i][k] * rhs[k][j];\n\t}\n\treturn ret;\n}\n\n\nData det(mat a) {\n\tconst int n = a.size();\n\tData D = Data(1);\n\tfor (int i = 0; i < n; ++i) {\n\t\tint pivot = i;\n\t\tfor (int j = i + 1; j < n; ++j) {\n\t\t\tif (abs(a[j][i]) > abs(a[pivot][i]))pivot = j;\n\t\t}\n\t\tswap(a[pivot], a[i]);\n\t\tD = D * a[i][i] * Data(i != pivot ? -1 : 1);\n\t\tif (is_zero(a[i][i]))break;\n\t\tData coef = (Data)1 / a[i][i];\n\t\tfor (int j = i + 1; j < n; ++j) {\n\t\t\tif (a[j][i] == (Data)0)continue;\n\t\t\tfor (int k = n - 1; k >= i; --k) {\n\t\t\t\ta[j][k] = a[j][k] - a[i][k] * a[j][i] * coef;\n\t\t\t}\n\t\t}\n\t}\n\treturn D;\n}\n\nint tmp = 0;\n\nint h, w;\nvoid solve() {\n\tvector<string> s(h);\n\trep(i, h)cin >> s[i];\n\ttmp++;\n\tcout << \"Case \" << tmp << \": \";\n\trep(_,h*w) {\n\t\tint i = _ / w;\n\t\tint j = _ % w;\n\t\tif (s[i][j] == '.') {\n\t\t\tvector<vector<bool>> used(h, vector<bool>(w));\n\t\t\tused[i][j] = true;\n\t\t\tqueue<P> q;\n\t\t\tq.push({ i,j });\n\t\t\twhile (!q.empty()) {\n\t\t\t\tP p = q.front(); q.pop();\n\t\t\t\trep(d, 4) {\n\t\t\t\t\tint nx = p.first + dx[d];\n\t\t\t\t\tint ny = p.second + dy[d];\n\t\t\t\t\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\n\t\t\t\t\tif (s[nx][ny] == '.') {\n\t\t\t\t\t\tif (!used[nx][ny]) {\n\t\t\t\t\t\t\tused[nx][ny] = true;\n\t\t\t\t\t\t\tq.push({ nx,ny });\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\trep(x, h)rep(y, w) {\n\t\t\t\tif (s[x][y] == '.') {\n\t\t\t\t\tif (!used[x][y]) {\n\t\t\t\t\t\tcout << 0 << \"\\n\"; return;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\twhile (true) {\n\t\tbool exi = false;\n\t\trep(j, w)if (s[h - 1][j] == '.')exi = true;\n\t\tif (!exi) {\n\t\t\th--;\n\t\t}\n\t\telse break;\n\t}\n\tvector<vector<int>> trans(h, vector<int>(w));\n\tint c = 0;\n\trep(i, h)rep(j, w) {\n\t\tif (s[i][j] == '.') {\n\t\t\ttrans[i][j] = c; c++;\n\t\t}\n\t}\n\tusing speP = pair<int, modint>;\n\tvector<vector<speP>> A(c-1);\n\trep(i, h)rep(j, w)if (s[i][j] == '.') {\n\t\trep(d, 4) {\n\t\t\tint nx = i + dx[d];\n\t\t\tint ny = j + dy[d];\n\t\t\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\n\t\t\tif (s[nx][ny] == '.') {\n\t\t\t\tint fr = trans[i][j];\n\t\t\t\tint to = trans[nx][ny];\n\t\t\t\tif (fr != c - 1) {\n\t\t\t\t\tA[fr].push_back({ fr,1 });\n\t\t\t\t}\n\t\t\t\tif (fr!=c-1&&to != c - 1) {\n\t\t\t\t\tA[fr].push_back({ to,-1 });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tauto refl = [&](vector<speP>& p) {\n\t\tauto cop = p; p.clear();\n\t\tsort(all(cop));\n\t\trep(i, cop.size()) {\n\t\t\tmodint num = cop[i].second;\n\t\t\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\n\t\t\t\ti++;\n\t\t\t\tnum += cop[i].second;\n\t\t\t}\n\t\t\tif (num != (modint)0)p.push_back({ cop[i].first,num });\n\t\t}\n\t};\n\tif (c == 1) {\n\t\tcout << 1 << \"\\n\"; return;\n\t}\n\telse {\n\t\tmodint ans = 1;\n\t\trep(i, A.size())refl(A[i]);\n\t\trep(i, c-1) {\n\t\t\tRep(j, i, A.size()) {\n\t\t\t\tif (A[j].size() && A[j][0].first == i) {\n\t\t\t\t\tif(i!=j)ans *= -1;\n\t\t\t\t\tswap(A[i], A[j]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (A[i].empty() || A[i][0].first != i) {\n\t\t\t\tans = 0; break;\n\t\t\t}\n\t\t\tans *= A[i][0].second;\n\t\t\tmodint coef = (modint)1 / A[i][0].second;\n\t\t\tRep(j, i + 1, A.size()) {\n\t\t\t\tif (A[j].size() && A[j][0].first == i) {\n\t\t\t\t\tmodint cc = coef * A[j][0].second;\n\t\t\t\t\tfor (auto p : A[i]) {\n\t\t\t\t\t\tA[j].push_back({ p.first,(modint)-cc * p.second });\n\t\t\t\t\t}\n\t\t\t\t\trefl(A[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << \"\\n\";\n\t}\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << 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\twhile(cin>>h>>w,h)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":570,"memory_kb":15128,"score_of_the_acc":-0.9459,"final_rank":7},{"submission_id":"aoj_2393_3850822","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\ntypedef vector<ll> V;\ntypedef vector<V> MATRIX;\n\n\nint H,W;\nint height,width;\nint num_case;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nll table[505][20];\nchar base_map[505][20];\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nll gcd(ll x,ll y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\nll lcm(ll x,ll y){\n\n\treturn (x*y)/gcd(x,y);\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll determinant(MATRIX A){\n\n\tMATRIX C(height,V(width));\n\n\tfor(int row = 0; row < height; row++){\n\t\tfor(int col = 0; col < width; col++){\n\t\t\tC[row][col] = A[row][col];\n\t\t}\n\t}\n\n\tint RANGE = W;\n\n\tll mult = 1;\n\n\tfor(int base = 0; base < height-1; base++){\n\n\t\tint row = -1;\n\n\t\tif(C[base][W] != 0){\n\n\t\t\trow = base;\n\t\t}else{\n\n\t\t\tfor(int k = 1; k <= RANGE && base+k < height; k++){\n\n\t\t\t\tif(C[base+k][W-k] != 0){\n\n\t\t\t\t\trow = base+k;\n\n\t\t\t\t\tfor(int a = 0; a < 2*W+1; a++){\n\n\t\t\t\t\t\tswap(C[base+k][W-k+a],C[base][W+a]);\n\t\t\t\t\t}\n\n\t\t\t\t\tmult *= (-1+MOD);\n\t\t\t\t\tmult %= MOD;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(row == -1)return 0;\n\t\t}\n\n\t\tfor(int k = 1; k <= RANGE && base+k < height; k++){\n\n\t\t\tif(C[base+k][W-k] == 0)continue;\n\n\t\t\tll LCM = lcm(C[base][W],C[base+k][W-k]);\n\n\t\t\tll mult_base = LCM/C[base][W];\n\t\t\tll mult_k = LCM/C[base+k][W-k];\n\n\t\t\tmult *= mult_k;\n\t\t\tmult %= MOD;\n\n\t\t\tfor(int a = 0; a < 2*W+1; a++){\n\n\t\t\t\tC[base+k][W-k+a] *= mult_k;\n\t\t\t\tC[base+k][W-k+a] %= MOD;\n\t\t\t}\n\n\t\t\tfor(int a = 0; a < 2*W+1; a++){\n\n\t\t\t\tC[base+k][W-k+a] -= C[base][W+a]*mult_base;\n\n\t\t\t\tif(C[base+k][W-k+a] < 0){\n\t\t\t\t\tC[base+k][W-k+a] = abs(C[base+k][W-k+a])%MOD;\n\t\t\t\t\tC[base+k][W-k+a] *= -1;\n\t\t\t\t\tC[base+k][W-k+a] += MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll ret = 1;\n\tfor(int i = 0; i < height; i++){\n\n\t\tret *= C[i][W];\n\t\tret %= MOD;\n\t}\n\n\tret *= mod_inverse(mult,MOD);\n\n\treturn ret%MOD;\n}\n\n\nvoid func(){\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",base_map[row]);\n\t}\n\n\tint index = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tif(base_map[row][col] == '#')continue;\n\n\t\t\ttable[row][col] = index++;\n\t\t}\n\t}\n\n\theight = index-1;\n\twidth = 3*W+1;\n\n\tMATRIX A(height,V(width));\n\n\tfor(int row = 0; row < height; row++){\n\t\tfor(int col = 0; col < width; col++){\n\n\t\t\tA[row][col] = 0;\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tif(base_map[row][col] == '#' || table[row][col] == index-1)continue;\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = row+diff_row[i];\n\t\t\t\tint adj_col = col+diff_col[i];\n\n\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || base_map[adj_row][adj_col] == '#')continue;\n\n\t\t\t\tif(table[adj_row][adj_col] != index-1){\n\n\t\t\t\t\tA[table[row][col]][table[adj_row][adj_col]-table[row][col]+W] = -1+MOD;\n\t\t\t\t}\n\n\t\t\t\tA[table[row][col]][W]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"Case %d: %lld\\n\",num_case++,abs(determinant(A)));\n}\n\n\nint main(){\n\n\tnum_case = 1;\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&H,&W);\n\t\tif(H == 0 && W == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":390,"memory_kb":11868,"score_of_the_acc":-0.6783,"final_rank":4},{"submission_id":"aoj_2393_1605296","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n\nusing namespace std;\n\nconst int N = 500 + 5;\nconst int M = 20;\nconst int V = 500 * 15 + 5;\nconst int MOD = (int)1e9 + 7;\n\nstruct Matrix\n{\n\tlong long a[V][M * 3];\n\tlong long& getEntry(int x, int y) {\n\t\treturn a[x][y - x + M];\n\t}\n\tbool haveEntry(int x, int y) {\n\t\treturn 0 <= y - x + M && y - x + M < M * 3;\n\t}\n\tvoid clear() {\n\t\tmemset(a, 0, sizeof a);\n\t}\n} a;\n\nint n, m;\nchar c[N][M];\nint id[N][M];\n\n#define getId(x,y) (id[x][y])\n\nlong long modPow(long long a, long long p, long long MOD)\n{\n\tlong long ret = 1;\n\tfor( ; p; p >>= 1, a = a * a % MOD) {\n\t\tif (p & 1) {\n\t\t\tret = ret * a % MOD;\n\t\t}\n\t}\n\treturn ret;\n}\n\n\nvoid solve()\n{\n\ta.clear();\n\tint v = 0;\n\tfor(int i = 0; i < n; ++ i) {\n\t\tscanf(\"%s\", c[i]);\n\t\tfor(int j = 0; j < m; ++ j) {\n\t\t\tif (c[i][j] == '.') {\n\t\t\t\tid[i][j] = v ++;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0; i < n; ++ i) {\n\t\tfor(int j = 0; j < m; ++ j) {\n\t\t\tif (c[i][j] == '.') {\n\t\t\t\tif (i + 1 < n && c[i + 1][j] == '.') {\n\t\t\t\t\ta.getEntry(getId(i, j), getId(i, j)) ++;\n\t\t\t\t\ta.getEntry(getId(i + 1, j), getId(i + 1, j)) ++;\n\t\t\t\t\ta.getEntry(getId(i, j), getId(i + 1, j)) --;\n\t\t\t\t\ta.getEntry(getId(i + 1, j), getId(i, j)) --;\n\t\t\t\t}\n\t\t\t\tif (j + 1 < m && c[i][j + 1] == '.') {\n\t\t\t\t\ta.getEntry(getId(i, j), getId(i, j)) ++;\n\t\t\t\t\ta.getEntry(getId(i, j + 1), getId(i, j + 1)) ++;\n\t\t\t\t\ta.getEntry(getId(i, j), getId(i, j + 1)) --;\n\t\t\t\t\ta.getEntry(getId(i, j + 1), getId(i, j)) --;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t--v;\n\tlong long ret = 1;\n\tfor(int col = 0; col < v; ++ col) {\n\t\tif (a.getEntry(col, col) == 0) {\n\t\t\tfor(int i = col + 1; a.haveEntry(i, col) && i < v; ++ i) {\n\t\t\t\tif (a.getEntry(i, col)) {\n\t\t\t\t\tfor(int j = col; a.haveEntry(col, j) && a.haveEntry(i, j) && j < v; ++ j) {\n\t\t\t\t\t\tswap(a.getEntry(col, j), a.getEntry(i, j));\n\t\t\t\t\t}\n\t\t\t\t\tret = -ret;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (a.getEntry(col, col)) {\n\t\t\tret = ret * a.getEntry(col, col) % MOD;\n\t\t\tlong long inv = modPow(a.getEntry(col, col), MOD - 2, MOD);\n\t\t\tfor(int i = col + 1; a.haveEntry(i, col) && i < v; ++ i) {\n\t\t\t\tif (a.getEntry(i, col)) {\n\t\t\t\t\tlong long by = -a.getEntry(i, col) * inv % MOD;\n\t\t\t\t\tfor(int j = col; a.haveEntry(col, j) && a.haveEntry(i, j) && j < v; ++ j) {\n\t\t\t\t\t\t(a.getEntry(i, j) += a.getEntry(col, j) * by) %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tret = 0;\n\t\t\tbreak;\n\t\t}\n\t}\n\tcout << (ret + MOD) % MOD << endl;\n}\n\nint main()\n{\n\tint t = 0;\n\tfor( ; scanf(\"%d%d\", &n, &m) == 2 && (n || m); ) {\n\t\tprintf(\"Case %d: \", ++ t);\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":4820,"score_of_the_acc":-0.1567,"final_rank":1},{"submission_id":"aoj_2393_1452367","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <unordered_map>\n#include <iterator>\n#include <functional>\n#include <cassert>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) (container).begin(), (container).end()\n#define RALL(container) (container).rbegin(), (container).rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define pb push_back\n#define eb emplace_back\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\n\nconst int INF = 1<<28;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\ntypedef unordered_map<int, int> Array;\ntypedef vector<Array> Matrix;\nostream& operator<<(ostream &os, const Array &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\nostream& operator<<(ostream &os, const Matrix &t) {\nFOR(it,t)os<<*it<<endl;return os;\n}\n\nint T, n, m;\n\ninline ll mod_inv(ll a, ll m){\n ll b = m, u = 1, v = 0;\n while (b) {\n ll t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u % m + m) % m;\n}\n\n\nint det(Matrix mat){\n\tint n = mat.size();\n\tll ans = 1;\n\tREP(i, n){\n\t\tans = ans * mat[i][i] % MOD;\n\t\tif(!ans) return ans;\n\t\tll inv = mod_inv(mat[i][i], MOD);\n\t\tfor(int j=i+1;j<n;j++)if(mat[j].count(i)){\n\t\t\tll coef = (MOD - mat[j][i] * inv % MOD) % MOD;\n\t\t\tfor(auto it : mat[i]){\n\t\t\t\tauto &jt = mat[j][it.first];\n\t\t\t\tjt = (jt + coef*it.second) % MOD;\n\t\t\t\tif(jt == 0) mat[j].erase(it.first);\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\tint T = 1;\n\twhile(cin >> n >> m, n){\n\t\tvector<string> s(n);\n\t\tREP(i, n) cin >> s[i];\n\t\tvi to(n*m);\n\t\tint c = 0;\n\t\tMatrix mat;\n\t\tREP(i, n*m){\n\t\t\tint x = i%m;\n\t\t\tint y = i/m;\n\t\t\tif(s[y][x] == '#') continue;\n\t\t\tmat.eb();\n\t\t\tif(x && s[y][x-1] != '#'){\n\t\t\t\tmat[c][c] ++; mat[c-1][c-1] ++;\n\t\t\t\tmat[c][c-1] = mat[c-1][c] = MOD-1;\n\t\t\t}\n\t\t\tif(y && s[y-1][x] != '#'){\n\t\t\t\tmat[c][c] ++; mat[to[i-m]][to[i-m]] ++;\n\t\t\t\tmat[c][to[i-m]] = mat[to[i-m]][c] = MOD-1;\n\t\t\t}\n\t\t\tto[i] = c++;\n\t\t}\n\t\tREP(i, c-1) mat[i].erase(c-1);\n\t\tmat.pop_back();\n\t\tcout << \"Case \" << T++ << \": \" << det(mat) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2830,"memory_kb":9312,"score_of_the_acc":-1.3936,"final_rank":9},{"submission_id":"aoj_2393_1433201","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;\n/*\nuse under a[i][j]!=0 -> abs(i-j)<=B\n(??????+-B?????????????????????????????????)\n??????????????????swap?????±?????§,-B~+2B?????§???3B+1??????vi??????????????£??????\n?????????0????????????B-th value(0-indexed) ???a[i][i]??????????????????????????????\ntime O(NB^2)\nspace O(NB)\n*/\ntypedef long long ll;\nll mod=1e9+7;\ntypedef vector<ll> vi;\ntypedef vector<vi> bmat;\nll ex(ll x,ll p){\n\tll a=1;\n\twhile(p){\n\t\tif(p%2) a=a*x%mod;\n\t\tx=x*x%mod;\n\t\tp/=2;\n\t}\n\treturn a;\n}\nll inv(ll a){\n\treturn ex(a,mod-2);\n}\nll det(bmat a){\n\tint N=a.size();\n\tif(N==0) return 1;\n\tint B=a[0].size()/3;\n\tll ans=1;\n\trep(i,N){\n\t\tif(a[i][B]==0){\n\t\t\tfor(int j=i+1;j<N;j++){\n\t\t\t\tif(B-(j-i)<0) break;\n\t\t\t\tif(a[j][B-(j-i)]!=0){\n\t\t\t\t\tint d=j-i;\n\t\t\t\t\tfor(int k=d;k<=2*B+d;k++){\n\t\t\t\t\t\tswap(a[i][k],a[j][k-d]);\n\t\t\t\t\t}\n\t\t\t\t\tans*=-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(a[i][B]==0) return 0;\n\t\t}\n\t\tfor(int j=i+1;j<N;j++){\n\t\t\tif(B-(j-i)<0) break;\n\t\t\tint d=j-i;\n\t\t\tll c=a[j][B-d]*inv(a[i][B])%mod;\n\t\t\tfor(int k=B;k<=3*B;k++){\n\t\t\t\ta[j][k-d]=(a[j][k-d]-c*a[i][k])%mod;\n\t\t\t}\n\t\t}\n\t\tans=ans*a[i][B]%mod;\n\t}\n\tif(ans<0) ans+=mod;\n\treturn ans;\n}\nint H,W;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nstring s[500];\nbool is(int x,int y){\n\treturn 0<=x&&x<H&&0<=y&&y<W&&s[x][y]=='.';\n}\nint n[500][15];\nint main(){\n\tint tt=0;\n\twhile(true){\n\t\ttt++;\n\t\tcin>>H>>W;\n\t\tif(H==0) break;\n\t\trep(i,H) cin>>s[i];\n\t\tint N=0;\n\t\trep(i,H) rep(j,W){\n\t\t\tif(s[i][j]=='#') n[i][j]=-1;\n\t\t\telse n[i][j]=N++;\n\t\t}\n\t\tbmat a(N-1,vi(3*W+1,0));\n\t\trep(i,H) rep(j,W){\n\t\t\tif(!is(i,j)) continue;\n\t\t\tif(n[i][j]==N-1) break;\n\t\t\trep(d,4){\n\t\t\t\tint x=i+dx[d],y=j+dy[d];\n\t\t\t\tif(!is(x,y)) continue;\n\t\t\t\tif(n[x][y]!=N-1) a[n[i][j]][n[x][y]-n[i][j]+W]++;\n\t\t\t\ta[n[i][j]][W]++;\n\t\t\t}\n\t\t}\n\t\tcout<<\"Case \"<<tt<<\": \"<<det(a)<<endl;\n\t}\n}","accuracy":1,"time_ms":900,"memory_kb":7084,"score_of_the_acc":-0.563,"final_rank":3},{"submission_id":"aoj_2393_1157193","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<map>\n#include<vector>\nusing namespace std;\nchar str[600][20];\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\nint num[600][20];\nlong long mod=1000000007;\nlong long pow(long long a,long long b){\n\tlong long ret=1;\n\twhile(b){\n\t\tif(b%2)ret=ret*a%mod;\n\t\ta=a*a%mod;\n\t\tb/=2;\n\t}\n\treturn ret;\n}\ntypedef map<int,long long> vec;\ntypedef vector<vec> mat;\nlong long det(mat A){\n\tint n=A.size();\n\tlong long val=1;\n\tfor(int i=0;i<n;i++){\n\t\tint at=-1;\n\t\tfor(int j=i;j<n;j++){\n\t\t\tif(A[j].count(i)&&A[j][i]){\n\t\t\t\tat=j;break;\n\t\t\t}\n\t\t}\n\t\tif(!~at)return 0;\n\t\tif(at!=i){\n\t\t\tswap(A[at],A[i]);\n\t\t\tval=(mod-val);\n\t\t}\n\t\tval=val*A[i][i]%mod;\n\t\tlong long t=pow(A[i][i],mod-2);\n\t\tfor(map<int,long long>::iterator it=A[i].begin();it!=A[i].end();it++){\n\t\t\tA[i][(*it).first]=(*it).second*t%mod;\n\t\t}\n\t\tfor(int j=i+1;j<n;j++){\n\t\t\tif(A[j].count(i)&&A[j][i]){\n\t\t\t\tlong long div=mod-A[j][i];\n\t\t\t\tfor(map<int,long long>::iterator it=A[i].begin();it!=A[i].end();it++){\n\t\t\t\t\tif((*it).second==0){continue;}\n\t\t\t\t\tif(!A[j].count((*it).first))A[j][(*it).first]=(*it).second*div%mod;\n\t\t\t\t\telse A[j][(*it).first]=(A[j][(*it).first]+(*it).second*div)%mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++)val=val*A[i][i]%mod;\n\treturn val;\n}\nint main(){\n\tint a,b;\n\tint T=0;\n\twhile(scanf(\"%d%d\",&a,&b),a){\n\t\tT++;\n\t\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\t\tint at=0;\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\t\tnum[i][j]=-1;\n\t\t}\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\t\tif(str[i][j]!='#')num[i][j]=at++;\n\t\t}\n\t\tmat A(at-1);\n\t\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\t\tif(str[i][j]!='#'){\n\t\t\t\tint deg=0;\n\t\t\t\tfor(int k=0;k<4;k++){\n\t\t\t\t\tif(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&~num[i+dx[k]][j+dy[k]]){\n\t\t\t\t\t\tdeg++;\n\t\t\t\t\t\tif(num[i][j]<at-1&&num[i+dx[k]][j+dy[k]]<at-1){\n\t\t\t\t\t\t\tA[num[i][j]][num[i+dx[k]][j+dy[k]]]=mod-1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(num[i][j]<at-1)A[num[i][j]][num[i][j]]=deg;\n\t\t\t}\n\t\t}\n\t//\tfor(int i=0;i<at-1;i++,printf(\"\\n\"))for(int j=0;j<at-1;j++)printf(\"%lld \",A[i][j]);\n\t\tprintf(\"Case %d: %lld\\n\",T,det(A));\n\t}\n}","accuracy":1,"time_ms":2950,"memory_kb":18356,"score_of_the_acc":-2,"final_rank":11},{"submission_id":"aoj_2393_382943","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n#include <deque>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\ntypedef vector<int> Array;\ntypedef vector<Array> Matrix;\nconst ll MOD = 1e+9 + 7;\n\nvoid PrintMatrix(const Matrix &mat) {\n REP(y, mat.size()) {\n REP(x, mat[0].size()) {\n printf(\"%d \", mat[y][x]);\n }\n puts(\"\");\n }\n puts(\"\");\n}\n\n//a x + b y = gcd(a, b)\nlong long extgcd(long long a, long long b, long long &x, long long &y) {\n long long g = a; x = 1; y = 0;\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\n return g;\n}\n\nlong long InvMod(long long a, long long mod) {\n long long x, y;\n if (extgcd(a, mod, x, y) == 1) { return (x + mod) % mod; }\n return 0;\n}\n\n\nvoid BandGaussElimination(Matrix &mat) {\n int h = mat.size();\n if (h == 0) { return; }\n int w = mat[0].size() / 2;\n REP(fy, h) {\n if (mat[fy][w] == 0) { return; }\n FOR(ty, fy + 1, min(h, fy + w + 1)) {\n ll ratio = (MOD - mat[ty][w - (ty - fy)]) * InvMod(mat[fy][w], MOD) % MOD;\n FOR(dx, 0, w + 1) {\n int fx = w + dx;\n int tx = w - (ty - fy) + dx;\n mat[ty][tx] = (mat[ty][tx] + mat[fy][fx] * ratio) % MOD;\n }\n }\n }\n}\n\nchar field[600][600];\nint indexes[600][20];\nint main() {\n int w, h;\n int test_case = 0;\n while (scanf(\"%d %d\", &h, &w), h|w) {\n MEMSET(indexes, -1);\n test_case++;\n REP(y, h) {\n scanf(\"%s\", field[y]);\n }\n int m = 0;\n REP(y, h) {\n REP(x, w) {\n if (field[y][x] == '#' && m == 0) { continue; }\n indexes[y][x] = m++;\n }\n }\n Matrix mat(m, Array(2 * w + 1, 0));\n REP(y, h) {\n REP(x, w) {\n if (indexes[y][x] == -1) { continue; }\n if (field[y][x] == '#') {\n mat[indexes[y][x]][w] = 1;\n continue;\n }\n REP(dir, 4) {\n const int dx[4] = { 1, 0, -1, 0 };\n const int dy[4] = { 0, 1, 0, -1 };\n int nx = x + dx[dir];\n int ny = y + dy[dir];\n if (nx < 0 || nx >= w || ny < 0 || ny >= h) { continue; }\n if (field[ny][nx] == '#') { continue; }\n mat[indexes[y][x]][w]++;\n int offset = ny * w + nx - y * w - x;\n mat[indexes[y][x]][w + offset] = MOD - 1;\n assert(abs(offset) <= w);\n }\n }\n }\n mat.erase(mat.begin());\n REP(dx, min(w, (int)mat.size())) {\n mat[dx][w - dx - 1] = 0;\n }\n BandGaussElimination(mat);\n REP(y, mat.size() / 2) REP(x, w * 2 + 1) { swap(mat[y][x], mat[mat.size() - y - 1][x]); }\n REP(y, mat.size()) REP(x, w) { swap(mat[y][x], mat[y][2 * w - x]); }\n BandGaussElimination(mat);\n ll ans = 1;\n REP(i, mat.size()) { ans = (ans * mat[i][w]) % MOD; }\n printf(\"Case %d: %lld\\n\", test_case, ans);\n }\n}","accuracy":1,"time_ms":2410,"memory_kb":2304,"score_of_the_acc":-0.8065,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2393_10854038\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <climits>\\n\\nusing namespace std;\\n\\ntypedef long long LL;\\nconst int dir[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};\\nconst int maxn = 512;\\nconst int mod = 1000000007;\\nchar s[maxn][maxn];\\nint idx[maxn][maxn];\\nvector<vector<int> > g;\\n\\nLL exgcd(LL a, LL b, LL& x, LL& y) {\\n LL g = a; x = 1; y = 0;\\n if (b != 0) {\\n g = exgcd(b, a % b, y, x), y -= (a / b) * x;\\n }\\n return g;\\n}\\n\\nLL inv(LL a, LL mod) {\\n LL x, y;\\n if (exgcd(a, mod, x, y) == 1) {\\n return (x % mod + mod) % mod;\\n }\\n return 0;\\n}\\nint H, W, cas = 0;\\nbool invalid(int x, int y) {\\n return x >= 0 && y >= 0 && x < H && y < W;\\n}\\n\\nvoid guass(vector<vector<int> >& mat) {\\n int h = mat.size();\\n if (h == 0) return;\\n int w = mat[0].size() / 2;\\n for (int i = 0; i < h; ++i) {\\n if (mat[i][w] == 0) return;\\n for (int j = i + 1; j < min(h, i + w + 1); ++j) {\\n LL r = (mod - mat[j][w - (j - i)]) * inv(mat[i][w], mod) % mod;\\n for (int dx = 0; dx < w + 1; ++dx) {\\n int fx = w + dx;\\n int tx = w - (j - i) + dx;\\n g[j][tx] = (g[j][tx] + g[i][fx] * r) % mod;\\n }\\n }\\n }\\n}\\n\\nvoid print(vector<vector<int> >& g) {\\n for (int i = 0; i < g.size(); ++i) {\\n for (int j = 0; j < g[i].size(); ++j) {\\n cout << g[i][j] << ' ';\\n }\\n cout << endl;\\n }\\n}\\n\\nint main() {\\n \\n while (scanf(\\\"%d %d\\\", &H, &W), H + W) {\\n for (int i = 0; i < H; ++i) {\\n scanf(\\\"%s\\\", s[i]);\\n }\\n //printf(\\\"Case %d: \\\", ++cas);\\n memset(idx, -1, sizeof(idx));\\n int cid = 0;\\n for (int i = 0; i < H; ++i) {\\n for (int j = 0; j < W; ++j) {\\n if (s[i][j] == '#' && cid == 0) continue;\\n idx[i][j] = cid++;\\n }\\n }\\n g = vector<vector<int> >(cid, vector<int>(2 * W + 1, 0));\\n for (int i = 0; i < H; ++i) {\\n for (int j = 0; j < W; ++j) {\\n if (idx[i][j] == -1) continue;\\n if (s[i][j] == '#') {\\n g[idx[i][j]][W] = 1; continue;\\n }\\n for (int k = 0; k < 4; ++k) {\\n int tx = i + dir[k][0];\\n int ty = j + dir[k][1];\\n if (!invalid(tx, ty) || s[tx][ty] == '#') continue;\\n ++g[idx[i][j]][W];\\n int offset = tx * W + ty - i * W - j;\\n g[idx[i][j]][W + offset] = mod - 1;\\n }\\n }\\n }\\n g.erase(g.begin());\\n for (int dx = 0; dx < min(W, (int)g.size()); ++dx) {\\n g[dx][W - dx - 1] = 0;\\n }\\n //print(g);\\n guass(g);\\n //print(g);\\n for (int i = 0; i < g.size() / 2; ++i) {\\n for (int j = 0; j < W * 2 + 1; ++j) {\\n swap(g[i][j], g[g.size() - i - 1][j]);\\n }\\n }\\n for (int i = 0; i < g.size(); ++i) {\\n for (int j = 0; j < W; ++j) {\\n swap(g[i][j], g[i][2 * W - j]);\\n }\\n }\\n //print(g);\\n guass(g);\\n //print(g);\\n LL ans = 1;\\n for (int i = 0; i < g.size(); ++i) {\\n ans = (ans * g[i][W]) % mod;\\n }\\n printf(\\\"Case %d: \\\", ++cas);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 7132,\n \"score_of_the_acc\": -0.4585,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2393_7118625\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n// cSpell:disable\\n/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.11.22 08:22:44 */\\n\\n#line 2 \\\"SPJ-Library/template/kuma.hpp\\\"\\n\\n#line 2 \\\"SPJ-Library/template/basic_func.hpp\\\"\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <vector>\\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 &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {\\n\\tos << p.first << ' ' << p.second;\\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 1 \\\"atcoder/modint.hpp\\\"\\n\\n\\n\\n#line 6 \\\"atcoder/modint.hpp\\\"\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n#line 1 \\\"atcoder/internal_math.hpp\\\"\\n\\n\\n\\n#line 5 \\\"atcoder/internal_math.hpp\\\"\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n// @param n `n < 2^32`\\n// @param m `1 <= m < 2^32`\\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n // y_max < m * (n + 1)\\n // floor(y_max / m) <= n\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 1 \\\"atcoder/internal_type_traits.hpp\\\"\\n\\n\\n\\n#line 7 \\\"atcoder/internal_type_traits.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 14 \\\"atcoder/modint.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 7 \\\"a.cpp\\\"\\nusing mint = atcoder::modint1000000007;\\nstd::ostream &operator<<(std::ostream &os, const mint &p) {\\n\\tos << p.val();\\n\\treturn os;\\n}\\n// vector<vector<mint>> lap(1500, vector<mint>(1500, 0));\\nvector<vector<int>> ids(502, vi(15, -1));\\nmint solve(int h, int w) {\\n\\tint vertex_id = 0;\\n\\tvector<vector<int>> walls(h, vi(w));\\n\\trep(i, h) rep(j, w) {\\n\\t\\tint &cell = ids[i][j];\\n\\t\\tchar c;\\n\\t\\tcin >> c;\\n\\t\\tif(c == '#') {\\n\\t\\t\\tcell = -1;\\n\\t\\t} else {\\n\\t\\t\\tcell = vertex_id++;\\n\\t\\t}\\n\\t}\\n\\tassert(vertex_id > 0);\\n\\tif(vertex_id == 1) return 1;\\n\\tconst int sz = vertex_id - 1;\\n\\t// vector<vector<mint>> lap(sz, vector<mint>(sz));\\n\\tvector<map<int, mint>> lap(sz);\\n\\t// rep(i, sz) rep(j, sz) lap[i][j] = 0;\\n\\n\\tauto add_map = [&](int row, int key, mint value) -> void {\\n\\t\\tif(lap[row].count(key))\\n\\t\\t\\tlap[row][key] += value;\\n\\t\\telse\\n\\t\\t\\tlap[row][key] = value;\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto add_wall = [&](int x, int y) -> void {\\n\\t\\tdebug(x, y);\\n\\t\\tif(x > y) swap(x, y);\\n\\t\\t// x < y\\n\\t\\tif(x == -1 || y == -1) return;\\n\\t\\tdebug(lap);\\n\\t\\tadd_map(x, x, 1);\\n\\t\\tdebug(lap);\\n\\t\\t// exit(0);\\n\\t\\tif(y == sz) return;\\n\\t\\tadd_map(y, y, 1);\\n\\t\\tadd_map(x, y, -1);\\n\\t\\tadd_map(y, x, -1);\\n\\t\\treturn;\\n\\t};\\n\\tdebug(lap);\\n\\trep(i, h) rep(j, w) {\\n\\t\\tif(i < h - 1) add_wall(ids[i][j], ids[i + 1][j]);\\n\\t\\tif(j < w - 1) add_wall(ids[i][j], ids[i][j + 1]);\\n\\t}\\n\\tdebug(lap);\\n\\tconstexpr int band = 100;\\n\\tmint ans = 1;\\n\\n\\trep(col, sz) {\\n\\t\\tdebug(lap);\\n\\t\\tint nonzero_row = -1;\\n\\t\\trep(row, col, sz) {\\n\\t\\t\\tif(lap[row].count(col) && lap[row][col] != 0) {\\n\\t\\t\\t\\tnonzero_row = row;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(nonzero_row == -1) return mint(0);\\n\\t\\tif(nonzero_row > col) {\\n\\t\\t\\tans *= -1;\\n\\t\\t\\tswap(lap[nonzero_row], lap[col]);\\n\\t\\t}\\n\\t\\tdebug(lap);\\n\\t\\tconst mint diag = lap[col][col];\\n\\t\\tans *= diag;\\n\\t\\tdebug(diag);\\n\\t\\trep(i, col, sz) {\\n\\t\\t\\tif(lap[col].count(i)) lap[col][i] /= diag;\\n\\t\\t}\\n\\t\\tdebug(lap);\\n\\t\\trep(row, col + 1, min(sz, col + band)) {\\n\\t\\t\\tif(lap[row].count(col) && lap[row][col] != 0) {\\n\\t\\t\\t\\tconst mint mult = lap[row][col];\\n\\t\\t\\t\\trep(j, col, min(sz, col + band)) {\\n\\t\\t\\t\\t\\tif(lap[col].count(j)) add_map(row, j, -mult * lap[col][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\nint main() {\\n\\tint h, w;\\n\\tint case_id = 0;\\n\\twhile(cin >> h >> w && h + w) {\\n\\t\\tcase_id++;\\n\\t\\tcout << \\\"Case \\\" << case_id << \\\": \\\" << solve(h, w) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1990,\n \"memory_kb\": 14276,\n \"score_of_the_acc\": -1.4017,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2393_6402419\",\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;\\n//constexpr ll mod = 998244353;\\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;\\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\\t//if (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; }\\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);\\ntemplate<typename T>\\nvoid addv(vector<T>& v, int loc, T val) {\\n\\tif (loc >= v.size())v.resize(loc + 1, 0);\\n\\tv[loc] += val;\\n}\\n/*const int mn = 100005;\\nbool isp[mn];\\nvector<int> ps;\\nvoid init() {\\n\\tfill(isp + 2, isp + mn, true);\\n\\tfor (int i = 2; i < mn; i++) {\\n\\t\\tif (!isp[i])continue;\\n\\t\\tps.push_back(i);\\n\\t\\tfor (int j = 2 * i; j < mn; j += i) {\\n\\t\\t\\tisp[j] = false;\\n\\t\\t}\\n\\t}\\n}*/\\n\\n//[,val)\\ntemplate<typename T>\\nauto prev_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\tif (res == st.begin())return st.end();\\n\\tres--; return res;\\n}\\n\\n//[val,)\\ntemplate<typename T>\\nauto next_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\treturn res;\\n}\\nusing mP = pair<modint, modint>;\\n\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n//-----------------------------------------\\nusing Data = modint;\\nusing pD = pair<int, Data>;\\nvoid refl(vector<pD>& p) {\\n\\tauto cop = p; p.clear();\\n\\tsort(all(cop));\\n\\trep(i, cop.size()) {\\n\\t\\tData num = cop[i].second;\\n\\t\\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\\n\\t\\t\\ti++;\\n\\t\\t\\tnum += cop[i].second;\\n\\t\\t}\\n\\t\\tif (num != (Data)0)p.push_back({ cop[i].first,num });\\n\\t}\\n}\\nvoid merge(vector<pD>& p, vector<pD>& q) {\\n\\tvector<pD> res;\\n\\tint idp = 0, idq = 0;\\n\\twhile (idp < p.size() && idq < q.size()) {\\n\\t\\tif (p[idp].first < q[idq].first) {\\n\\t\\t\\tres.push_back(p[idp]); idp++;\\n\\t\\t}\\n\\t\\telse if (p[idp].first > q[idq].first) {\\n\\t\\t\\tres.push_back(q[idq]); idq++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tData val = p[idp].second + q[idq].second;\\n\\t\\t\\tif (val != (Data)0) {\\n\\t\\t\\t\\tres.push_back({ p[idp].first,val });\\n\\t\\t\\t}\\n\\t\\t\\tidp++; idq++;\\n\\t\\t}\\n\\t}\\n\\twhile (idp < p.size()) {\\n\\t\\tres.push_back(p[idp]); idp++;\\n\\t}\\n\\twhile (idq < q.size()) {\\n\\t\\tres.push_back(q[idq]); idq++;\\n\\t}\\n\\tswap(p, res);\\n}\\nData det(vector<vector<pD>> A) {\\n\\trep(i, A.size())refl(A[i]);\\n\\tint n = A.size();\\n\\tData ans = 1;\\n\\trep(i, n) {\\n\\t\\tRep(j, i, A.size()) {\\n\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\tif (i != j)ans *= -1;\\n\\t\\t\\t\\tswap(A[i], A[j]);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (A[i].empty() || A[i][0].first != i) {\\n\\t\\t\\tans = 0; break;\\n\\t\\t}\\n\\t\\tans *= A[i][0].second;\\n\\t\\tData coef = (Data)1 / A[i][0].second;\\n\\t\\tRep(j, i + 1, A.size()) {\\n\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\tData cc = coef * A[j][0].second;\\n\\t\\t\\t\\tvector<pD> nw(A[i].size());\\n\\t\\t\\t\\trep(k, A[i].size())nw[k] = { A[i][k].first,A[i][k].second * (modint)-cc };\\n\\t\\t\\t\\tmerge(A[j], nw);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint tmp = 0;\\n\\nint h, w;\\nvoid solve() {\\n\\tvector<string> s(h);\\n\\trep(i, h)cin >> s[i];\\n\\ttmp++;\\n\\tcout << \\\"Case \\\" << tmp << \\\": \\\";\\n\\trep(_, h * w) {\\n\\t\\tint i = _ / w;\\n\\t\\tint j = _ % w;\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\tvector<vector<bool>> used(h, vector<bool>(w));\\n\\t\\t\\tused[i][j] = true;\\n\\t\\t\\tqueue<P> q;\\n\\t\\t\\tq.push({ i,j });\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tP p = q.front(); q.pop();\\n\\t\\t\\t\\trep(d, 4) {\\n\\t\\t\\t\\t\\tint nx = p.first + dx[d];\\n\\t\\t\\t\\t\\tint ny = p.second + dy[d];\\n\\t\\t\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\t\\t\\tif (!used[nx][ny]) {\\n\\t\\t\\t\\t\\t\\t\\tused[nx][ny] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push({ nx,ny });\\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\\trep(x, h)rep(y, w) {\\n\\t\\t\\t\\tif (s[x][y] == '.') {\\n\\t\\t\\t\\t\\tif (!used[x][y]) {\\n\\t\\t\\t\\t\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tbool exi = false;\\n\\t\\trep(j, w)if (s[h - 1][j] == '.')exi = true;\\n\\t\\tif (!exi) {\\n\\t\\t\\th--;\\n\\t\\t}\\n\\t\\telse break;\\n\\t}\\n\\tvector<vector<int>> trans(h, vector<int>(w));\\n\\tint c = 0;\\n\\trep(i, h)rep(j, w) {\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\ttrans[i][j] = c; c++;\\n\\t\\t}\\n\\t}\\n\\tusing speP = pair<int, modint>;\\n\\tvector<vector<speP>> A(c - 1);\\n\\trep(i, h)rep(j, w)if (s[i][j] == '.') {\\n\\t\\trep(d, 4) {\\n\\t\\t\\tint nx = i + dx[d];\\n\\t\\t\\tint ny = j + dy[d];\\n\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\tint fr = trans[i][j];\\n\\t\\t\\t\\tint to = trans[nx][ny];\\n\\t\\t\\t\\tif (fr != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ fr,1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (fr != c - 1 && to != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ to,-1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto refl = [&](vector<speP>& p) {\\n\\t\\tauto cop = p; p.clear();\\n\\t\\tsort(all(cop));\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tmodint num = cop[i].second;\\n\\t\\t\\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t\\tnum += cop[i].second;\\n\\t\\t\\t}\\n\\t\\t\\tif (num != (modint)0)p.push_back({ cop[i].first,num });\\n\\t\\t}\\n\\t};\\n\\tif (c == 1) {\\n\\t\\tcout << 1 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\telse {\\n\\t\\tmodint ans = det(A);\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << 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\\twhile (cin >> h >> w, h)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 13428,\n \"score_of_the_acc\": -0.779,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2393_6402399\",\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;\\n//constexpr ll mod = 998244353;\\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;\\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\\t//if (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; }\\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);\\ntemplate<typename T>\\nvoid addv(vector<T>& v, int loc, T val) {\\n\\tif (loc >= v.size())v.resize(loc + 1, 0);\\n\\tv[loc] += val;\\n}\\n/*const int mn = 100005;\\nbool isp[mn];\\nvector<int> ps;\\nvoid init() {\\n\\tfill(isp + 2, isp + mn, true);\\n\\tfor (int i = 2; i < mn; i++) {\\n\\t\\tif (!isp[i])continue;\\n\\t\\tps.push_back(i);\\n\\t\\tfor (int j = 2 * i; j < mn; j += i) {\\n\\t\\t\\tisp[j] = false;\\n\\t\\t}\\n\\t}\\n}*/\\n\\n//[,val)\\ntemplate<typename T>\\nauto prev_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\tif (res == st.begin())return st.end();\\n\\tres--; return res;\\n}\\n\\n//[val,)\\ntemplate<typename T>\\nauto next_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\treturn res;\\n}\\nusing mP = pair<modint, modint>;\\n\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n//-----------------------------------------\\n\\nusing Data = modint;\\nusing pD = pair<int, Data>;\\nvoid refl(vector<pD>& p) {\\n\\tauto cop = p; p.clear();\\n\\tsort(all(cop));\\n\\trep(i, cop.size()) {\\n\\t\\tData num = cop[i].second;\\n\\t\\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\\n\\t\\t\\ti++;\\n\\t\\t\\tnum += cop[i].second;\\n\\t\\t}\\n\\t\\tif (num != (Data)0)p.push_back({ cop[i].first,num });\\n\\t}\\n}\\nData det(vector<vector<pD>> A) {\\n\\trep(i, A.size())refl(A[i]);\\n\\tint n = A.size();\\n\\tData ans = 1;\\n\\trep(i, n) {\\n\\t\\tRep(j, i, A.size()) {\\n\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\tif (i != j)ans *= -1;\\n\\t\\t\\t\\tswap(A[i], A[j]);\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (A[i].empty() || A[i][0].first != i) {\\n\\t\\t\\tans = 0; break;\\n\\t\\t}\\n\\t\\tans *= A[i][0].second;\\n\\t\\tData coef = (Data)1 / A[i][0].second;\\n\\t\\tRep(j, i + 1, A.size()) {\\n\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\tData cc = coef * A[j][0].second;\\n\\t\\t\\t\\tfor (auto p : A[i]) {\\n\\t\\t\\t\\t\\tA[j].push_back({ p.first,(Data)-cc * p.second });\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trefl(A[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint tmp = 0;\\n\\nint h, w;\\nvoid solve() {\\n\\tvector<string> s(h);\\n\\trep(i, h)cin >> s[i];\\n\\ttmp++;\\n\\tcout << \\\"Case \\\" << tmp << \\\": \\\";\\n\\trep(_,h*w) {\\n\\t\\tint i = _ / w;\\n\\t\\tint j = _ % w;\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\tvector<vector<bool>> used(h, vector<bool>(w));\\n\\t\\t\\tused[i][j] = true;\\n\\t\\t\\tqueue<P> q;\\n\\t\\t\\tq.push({ i,j });\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tP p = q.front(); q.pop();\\n\\t\\t\\t\\trep(d, 4) {\\n\\t\\t\\t\\t\\tint nx = p.first + dx[d];\\n\\t\\t\\t\\t\\tint ny = p.second + dy[d];\\n\\t\\t\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\t\\t\\tif (!used[nx][ny]) {\\n\\t\\t\\t\\t\\t\\t\\tused[nx][ny] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push({ nx,ny });\\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\\trep(x, h)rep(y, w) {\\n\\t\\t\\t\\tif (s[x][y] == '.') {\\n\\t\\t\\t\\t\\tif (!used[x][y]) {\\n\\t\\t\\t\\t\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tbool exi = false;\\n\\t\\trep(j, w)if (s[h - 1][j] == '.')exi = true;\\n\\t\\tif (!exi) {\\n\\t\\t\\th--;\\n\\t\\t}\\n\\t\\telse break;\\n\\t}\\n\\tvector<vector<int>> trans(h, vector<int>(w));\\n\\tint c = 0;\\n\\trep(i, h)rep(j, w) {\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\ttrans[i][j] = c; c++;\\n\\t\\t}\\n\\t}\\n\\tusing speP = pair<int, modint>;\\n\\tvector<vector<speP>> A(c-1);\\n\\trep(i, h)rep(j, w)if (s[i][j] == '.') {\\n\\t\\trep(d, 4) {\\n\\t\\t\\tint nx = i + dx[d];\\n\\t\\t\\tint ny = j + dy[d];\\n\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\tint fr = trans[i][j];\\n\\t\\t\\t\\tint to = trans[nx][ny];\\n\\t\\t\\t\\tif (fr != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ fr,1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (fr!=c-1&&to != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ to,-1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto refl = [&](vector<speP>& p) {\\n\\t\\tauto cop = p; p.clear();\\n\\t\\tsort(all(cop));\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tmodint num = cop[i].second;\\n\\t\\t\\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t\\tnum += cop[i].second;\\n\\t\\t\\t}\\n\\t\\t\\tif (num != (modint)0)p.push_back({ cop[i].first,num });\\n\\t\\t}\\n\\t};\\n\\tif (c == 1) {\\n\\t\\tcout << 1 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\telse {\\n\\t\\tmodint ans = det(A);\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << 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\\twhile(cin>>h>>w,h)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 15916,\n \"score_of_the_acc\": -0.9806,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2393_6402389\",\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;\\n//constexpr ll mod = 998244353;\\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;\\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\\t//if (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; }\\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);\\ntemplate<typename T>\\nvoid addv(vector<T>& v, int loc, T val) {\\n\\tif (loc >= v.size())v.resize(loc + 1, 0);\\n\\tv[loc] += val;\\n}\\n/*const int mn = 100005;\\nbool isp[mn];\\nvector<int> ps;\\nvoid init() {\\n\\tfill(isp + 2, isp + mn, true);\\n\\tfor (int i = 2; i < mn; i++) {\\n\\t\\tif (!isp[i])continue;\\n\\t\\tps.push_back(i);\\n\\t\\tfor (int j = 2 * i; j < mn; j += i) {\\n\\t\\t\\tisp[j] = false;\\n\\t\\t}\\n\\t}\\n}*/\\n\\n//[,val)\\ntemplate<typename T>\\nauto prev_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\tif (res == st.begin())return st.end();\\n\\tres--; return res;\\n}\\n\\n//[val,)\\ntemplate<typename T>\\nauto next_itr(set<T>& st, T val) {\\n\\tauto res = st.lower_bound(val);\\n\\treturn res;\\n}\\nusing mP = pair<modint, modint>;\\n\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n//-----------------------------------------\\n\\ntypedef modint Data;\\ntypedef vector<Data> Array;\\ntypedef vector<Array> mat;\\n\\nbool is_zero(Data dat) { return abs(dat) < eps; }\\nmat operator-(mat a) {\\n\\trep(i, a.size())rep(j, a[0].size())a[i][j] = -a[i][j];\\n\\treturn a;\\n}\\nmat operator+(mat lhs, mat& rhs) {\\n\\trep(i, lhs.size())rep(j, lhs[0].size())lhs[i][j] += rhs[i][j];\\n\\treturn lhs;\\n}\\nmat operator-(mat lhs, mat& rhs) {\\n\\trep(i, lhs.size())rep(j, lhs[0].size())lhs[i][j] -= rhs[i][j];\\n\\treturn lhs;\\n}\\nmat operator*(const mat& lhs, const mat& rhs) {\\n\\tmat ret(lhs.size(), Array(rhs[0].size(), 0));\\n\\trep(i, lhs.size())rep(j, rhs[0].size())rep(k, rhs.size()) {\\n\\t\\tret[i][j] += lhs[i][k] * rhs[k][j];\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\nData det(mat a) {\\n\\tconst int n = a.size();\\n\\tData D = Data(1);\\n\\tfor (int i = 0; i < n; ++i) {\\n\\t\\tint pivot = i;\\n\\t\\tfor (int j = i + 1; j < n; ++j) {\\n\\t\\t\\tif (abs(a[j][i]) > abs(a[pivot][i]))pivot = j;\\n\\t\\t}\\n\\t\\tswap(a[pivot], a[i]);\\n\\t\\tD = D * a[i][i] * Data(i != pivot ? -1 : 1);\\n\\t\\tif (is_zero(a[i][i]))break;\\n\\t\\tData coef = (Data)1 / a[i][i];\\n\\t\\tfor (int j = i + 1; j < n; ++j) {\\n\\t\\t\\tif (a[j][i] == (Data)0)continue;\\n\\t\\t\\tfor (int k = n - 1; k >= i; --k) {\\n\\t\\t\\t\\ta[j][k] = a[j][k] - a[i][k] * a[j][i] * coef;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn D;\\n}\\n\\nint tmp = 0;\\n\\nint h, w;\\nvoid solve() {\\n\\tvector<string> s(h);\\n\\trep(i, h)cin >> s[i];\\n\\ttmp++;\\n\\tcout << \\\"Case \\\" << tmp << \\\": \\\";\\n\\trep(_,h*w) {\\n\\t\\tint i = _ / w;\\n\\t\\tint j = _ % w;\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\tvector<vector<bool>> used(h, vector<bool>(w));\\n\\t\\t\\tused[i][j] = true;\\n\\t\\t\\tqueue<P> q;\\n\\t\\t\\tq.push({ i,j });\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tP p = q.front(); q.pop();\\n\\t\\t\\t\\trep(d, 4) {\\n\\t\\t\\t\\t\\tint nx = p.first + dx[d];\\n\\t\\t\\t\\t\\tint ny = p.second + dy[d];\\n\\t\\t\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\t\\t\\tif (!used[nx][ny]) {\\n\\t\\t\\t\\t\\t\\t\\tused[nx][ny] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push({ nx,ny });\\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\\trep(x, h)rep(y, w) {\\n\\t\\t\\t\\tif (s[x][y] == '.') {\\n\\t\\t\\t\\t\\tif (!used[x][y]) {\\n\\t\\t\\t\\t\\t\\tcout << 0 << \\\"\\\\n\\\"; return;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tbool exi = false;\\n\\t\\trep(j, w)if (s[h - 1][j] == '.')exi = true;\\n\\t\\tif (!exi) {\\n\\t\\t\\th--;\\n\\t\\t}\\n\\t\\telse break;\\n\\t}\\n\\tvector<vector<int>> trans(h, vector<int>(w));\\n\\tint c = 0;\\n\\trep(i, h)rep(j, w) {\\n\\t\\tif (s[i][j] == '.') {\\n\\t\\t\\ttrans[i][j] = c; c++;\\n\\t\\t}\\n\\t}\\n\\tusing speP = pair<int, modint>;\\n\\tvector<vector<speP>> A(c-1);\\n\\trep(i, h)rep(j, w)if (s[i][j] == '.') {\\n\\t\\trep(d, 4) {\\n\\t\\t\\tint nx = i + dx[d];\\n\\t\\t\\tint ny = j + dy[d];\\n\\t\\t\\tif (nx < 0 || nx >= h || ny < 0 || ny >= w)continue;\\n\\t\\t\\tif (s[nx][ny] == '.') {\\n\\t\\t\\t\\tint fr = trans[i][j];\\n\\t\\t\\t\\tint to = trans[nx][ny];\\n\\t\\t\\t\\tif (fr != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ fr,1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (fr!=c-1&&to != c - 1) {\\n\\t\\t\\t\\t\\tA[fr].push_back({ to,-1 });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tauto refl = [&](vector<speP>& p) {\\n\\t\\tauto cop = p; p.clear();\\n\\t\\tsort(all(cop));\\n\\t\\trep(i, cop.size()) {\\n\\t\\t\\tmodint num = cop[i].second;\\n\\t\\t\\twhile (i + 1 < cop.size() && cop[i].first == cop[i + 1].first) {\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t\\tnum += cop[i].second;\\n\\t\\t\\t}\\n\\t\\t\\tif (num != (modint)0)p.push_back({ cop[i].first,num });\\n\\t\\t}\\n\\t};\\n\\tif (c == 1) {\\n\\t\\tcout << 1 << \\\"\\\\n\\\"; return;\\n\\t}\\n\\telse {\\n\\t\\tmodint ans = 1;\\n\\t\\trep(i, A.size())refl(A[i]);\\n\\t\\trep(i, c-1) {\\n\\t\\t\\tRep(j, i, A.size()) {\\n\\t\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\t\\tif(i!=j)ans *= -1;\\n\\t\\t\\t\\t\\tswap(A[i], A[j]);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (A[i].empty() || A[i][0].first != i) {\\n\\t\\t\\t\\tans = 0; break;\\n\\t\\t\\t}\\n\\t\\t\\tans *= A[i][0].second;\\n\\t\\t\\tmodint coef = (modint)1 / A[i][0].second;\\n\\t\\t\\tRep(j, i + 1, A.size()) {\\n\\t\\t\\t\\tif (A[j].size() && A[j][0].first == i) {\\n\\t\\t\\t\\t\\tmodint cc = coef * A[j][0].second;\\n\\t\\t\\t\\t\\tfor (auto p : A[i]) {\\n\\t\\t\\t\\t\\t\\tA[j].push_back({ p.first,(modint)-cc * p.second });\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trefl(A[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t}\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << 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\\twhile(cin>>h>>w,h)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 15128,\n \"score_of_the_acc\": -0.9459,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2393_3850822\",\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\\ntypedef vector<ll> V;\\ntypedef vector<V> MATRIX;\\n\\n\\nint H,W;\\nint height,width;\\nint num_case;\\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\\nll table[505][20];\\nchar base_map[505][20];\\n\\n\\nbool rangeCheck(int row,int col){\\n\\n\\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\\n}\\n\\nll gcd(ll x,ll y){\\n\\n\\tx = abs(x);\\n\\ty = abs(y);\\n\\n\\tif(x < y){\\n\\t\\tswap(x,y);\\n\\t}\\n\\tif(y == 0){\\n\\t\\treturn x;\\n\\t}else{\\n\\t\\treturn gcd(y,x%y);\\n\\t}\\n}\\n\\nll lcm(ll x,ll y){\\n\\n\\treturn (x*y)/gcd(x,y);\\n}\\n\\nll extgcd(ll a,ll b,ll &x,ll &y){\\n\\tll d = a;\\n\\tif(b != 0){\\n\\t\\td = extgcd(b,a%b,y,x);\\n\\t\\ty -= (a/b)*x;\\n\\t}else{\\n\\t\\tx = 1;\\n\\t\\ty = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\nll mod_inverse(ll a,ll m){\\n ll x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nll determinant(MATRIX A){\\n\\n\\tMATRIX C(height,V(width));\\n\\n\\tfor(int row = 0; row < height; row++){\\n\\t\\tfor(int col = 0; col < width; col++){\\n\\t\\t\\tC[row][col] = A[row][col];\\n\\t\\t}\\n\\t}\\n\\n\\tint RANGE = W;\\n\\n\\tll mult = 1;\\n\\n\\tfor(int base = 0; base < height-1; base++){\\n\\n\\t\\tint row = -1;\\n\\n\\t\\tif(C[base][W] != 0){\\n\\n\\t\\t\\trow = base;\\n\\t\\t}else{\\n\\n\\t\\t\\tfor(int k = 1; k <= RANGE && base+k < height; k++){\\n\\n\\t\\t\\t\\tif(C[base+k][W-k] != 0){\\n\\n\\t\\t\\t\\t\\trow = base+k;\\n\\n\\t\\t\\t\\t\\tfor(int a = 0; a < 2*W+1; a++){\\n\\n\\t\\t\\t\\t\\t\\tswap(C[base+k][W-k+a],C[base][W+a]);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tmult *= (-1+MOD);\\n\\t\\t\\t\\t\\tmult %= MOD;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(row == -1)return 0;\\n\\t\\t}\\n\\n\\t\\tfor(int k = 1; k <= RANGE && base+k < height; k++){\\n\\n\\t\\t\\tif(C[base+k][W-k] == 0)continue;\\n\\n\\t\\t\\tll LCM = lcm(C[base][W],C[base+k][W-k]);\\n\\n\\t\\t\\tll mult_base = LCM/C[base][W];\\n\\t\\t\\tll mult_k = LCM/C[base+k][W-k];\\n\\n\\t\\t\\tmult *= mult_k;\\n\\t\\t\\tmult %= MOD;\\n\\n\\t\\t\\tfor(int a = 0; a < 2*W+1; a++){\\n\\n\\t\\t\\t\\tC[base+k][W-k+a] *= mult_k;\\n\\t\\t\\t\\tC[base+k][W-k+a] %= MOD;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int a = 0; a < 2*W+1; a++){\\n\\n\\t\\t\\t\\tC[base+k][W-k+a] -= C[base][W+a]*mult_base;\\n\\n\\t\\t\\t\\tif(C[base+k][W-k+a] < 0){\\n\\t\\t\\t\\t\\tC[base+k][W-k+a] = abs(C[base+k][W-k+a])%MOD;\\n\\t\\t\\t\\t\\tC[base+k][W-k+a] *= -1;\\n\\t\\t\\t\\t\\tC[base+k][W-k+a] += MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ret = 1;\\n\\tfor(int i = 0; i < height; i++){\\n\\n\\t\\tret *= C[i][W];\\n\\t\\tret %= MOD;\\n\\t}\\n\\n\\tret *= mod_inverse(mult,MOD);\\n\\n\\treturn ret%MOD;\\n}\\n\\n\\nvoid func(){\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",base_map[row]);\\n\\t}\\n\\n\\tint index = 0;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tif(base_map[row][col] == '#')continue;\\n\\n\\t\\t\\ttable[row][col] = index++;\\n\\t\\t}\\n\\t}\\n\\n\\theight = index-1;\\n\\twidth = 3*W+1;\\n\\n\\tMATRIX A(height,V(width));\\n\\n\\tfor(int row = 0; row < height; row++){\\n\\t\\tfor(int col = 0; col < width; col++){\\n\\n\\t\\t\\tA[row][col] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tif(base_map[row][col] == '#' || table[row][col] == index-1)continue;\\n\\n\\t\\t\\tfor(int i = 0; i < 4; i++){\\n\\n\\t\\t\\t\\tint adj_row = row+diff_row[i];\\n\\t\\t\\t\\tint adj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(rangeCheck(adj_row,adj_col) == false || base_map[adj_row][adj_col] == '#')continue;\\n\\n\\t\\t\\t\\tif(table[adj_row][adj_col] != index-1){\\n\\n\\t\\t\\t\\t\\tA[table[row][col]][table[adj_row][adj_col]-table[row][col]+W] = -1+MOD;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tA[table[row][col]][W]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"Case %d: %lld\\\\n\\\",num_case++,abs(determinant(A)));\\n}\\n\\n\\nint main(){\\n\\n\\tnum_case = 1;\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\t\\tif(H == 0 && W == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 11868,\n \"score_of_the_acc\": -0.6783,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2393_1605296\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst int N = 500 + 5;\\nconst int M = 20;\\nconst int V = 500 * 15 + 5;\\nconst int MOD = (int)1e9 + 7;\\n\\nstruct Matrix\\n{\\n\\tlong long a[V][M * 3];\\n\\tlong long& getEntry(int x, int y) {\\n\\t\\treturn a[x][y - x + M];\\n\\t}\\n\\tbool haveEntry(int x, int y) {\\n\\t\\treturn 0 <= y - x + M && y - x + M < M * 3;\\n\\t}\\n\\tvoid clear() {\\n\\t\\tmemset(a, 0, sizeof a);\\n\\t}\\n} a;\\n\\nint n, m;\\nchar c[N][M];\\nint id[N][M];\\n\\n#define getId(x,y) (id[x][y])\\n\\nlong long modPow(long long a, long long p, long long MOD)\\n{\\n\\tlong long ret = 1;\\n\\tfor( ; p; p >>= 1, a = a * a % MOD) {\\n\\t\\tif (p & 1) {\\n\\t\\t\\tret = ret * a % MOD;\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\nvoid solve()\\n{\\n\\ta.clear();\\n\\tint v = 0;\\n\\tfor(int i = 0; i < n; ++ i) {\\n\\t\\tscanf(\\\"%s\\\", c[i]);\\n\\t\\tfor(int j = 0; j < m; ++ j) {\\n\\t\\t\\tif (c[i][j] == '.') {\\n\\t\\t\\t\\tid[i][j] = v ++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < n; ++ i) {\\n\\t\\tfor(int j = 0; j < m; ++ j) {\\n\\t\\t\\tif (c[i][j] == '.') {\\n\\t\\t\\t\\tif (i + 1 < n && c[i + 1][j] == '.') {\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j), getId(i, j)) ++;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i + 1, j), getId(i + 1, j)) ++;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j), getId(i + 1, j)) --;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i + 1, j), getId(i, j)) --;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (j + 1 < m && c[i][j + 1] == '.') {\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j), getId(i, j)) ++;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j + 1), getId(i, j + 1)) ++;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j), getId(i, j + 1)) --;\\n\\t\\t\\t\\t\\ta.getEntry(getId(i, j + 1), getId(i, j)) --;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t--v;\\n\\tlong long ret = 1;\\n\\tfor(int col = 0; col < v; ++ col) {\\n\\t\\tif (a.getEntry(col, col) == 0) {\\n\\t\\t\\tfor(int i = col + 1; a.haveEntry(i, col) && i < v; ++ i) {\\n\\t\\t\\t\\tif (a.getEntry(i, col)) {\\n\\t\\t\\t\\t\\tfor(int j = col; a.haveEntry(col, j) && a.haveEntry(i, j) && j < v; ++ j) {\\n\\t\\t\\t\\t\\t\\tswap(a.getEntry(col, j), a.getEntry(i, j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tret = -ret;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (a.getEntry(col, col)) {\\n\\t\\t\\tret = ret * a.getEntry(col, col) % MOD;\\n\\t\\t\\tlong long inv = modPow(a.getEntry(col, col), MOD - 2, MOD);\\n\\t\\t\\tfor(int i = col + 1; a.haveEntry(i, col) && i < v; ++ i) {\\n\\t\\t\\t\\tif (a.getEntry(i, col)) {\\n\\t\\t\\t\\t\\tlong long by = -a.getEntry(i, col) * inv % MOD;\\n\\t\\t\\t\\t\\tfor(int j = col; a.haveEntry(col, j) && a.haveEntry(i, j) && j < v; ++ j) {\\n\\t\\t\\t\\t\\t\\t(a.getEntry(i, j) += a.getEntry(col, j) * by) %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tret = 0;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tcout << (ret + MOD) % MOD << endl;\\n}\\n\\nint main()\\n{\\n\\tint t = 0;\\n\\tfor( ; scanf(\\\"%d%d\\\", &n, &m) == 2 && (n || m); ) {\\n\\t\\tprintf(\\\"Case %d: \\\", ++ t);\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4820,\n \"score_of_the_acc\": -0.1567,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2393_1452367\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <unordered_map>\\n#include <iterator>\\n#include <functional>\\n#include <cassert>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define REPS(i,x) for(int i=1;i<=(int)(x);i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RREPS(i,x) for(int i=((int)(x));i>0;i--)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) (container).begin(), (container).end()\\n#define RALL(container) (container).rbegin(), (container).rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define pb push_back\\n#define eb emplace_back\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\ntemplate<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}\\ntemplate<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}\\n\\nconst int INF = 1<<28;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\ntypedef unordered_map<int, int> Array;\\ntypedef vector<Array> Matrix;\\nostream& operator<<(ostream &os, const Array &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\nostream& operator<<(ostream &os, const Matrix &t) {\\nFOR(it,t)os<<*it<<endl;return os;\\n}\\n\\nint T, n, m;\\n\\ninline ll mod_inv(ll a, ll m){\\n ll b = m, u = 1, v = 0;\\n while (b) {\\n ll t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return (u % m + m) % m;\\n}\\n\\n\\nint det(Matrix mat){\\n\\tint n = mat.size();\\n\\tll ans = 1;\\n\\tREP(i, n){\\n\\t\\tans = ans * mat[i][i] % MOD;\\n\\t\\tif(!ans) return ans;\\n\\t\\tll inv = mod_inv(mat[i][i], MOD);\\n\\t\\tfor(int j=i+1;j<n;j++)if(mat[j].count(i)){\\n\\t\\t\\tll coef = (MOD - mat[j][i] * inv % MOD) % MOD;\\n\\t\\t\\tfor(auto it : mat[i]){\\n\\t\\t\\t\\tauto &jt = mat[j][it.first];\\n\\t\\t\\t\\tjt = (jt + coef*it.second) % MOD;\\n\\t\\t\\t\\tif(jt == 0) mat[j].erase(it.first);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\tint T = 1;\\n\\twhile(cin >> n >> m, n){\\n\\t\\tvector<string> s(n);\\n\\t\\tREP(i, n) cin >> s[i];\\n\\t\\tvi to(n*m);\\n\\t\\tint c = 0;\\n\\t\\tMatrix mat;\\n\\t\\tREP(i, n*m){\\n\\t\\t\\tint x = i%m;\\n\\t\\t\\tint y = i/m;\\n\\t\\t\\tif(s[y][x] == '#') continue;\\n\\t\\t\\tmat.eb();\\n\\t\\t\\tif(x && s[y][x-1] != '#'){\\n\\t\\t\\t\\tmat[c][c] ++; mat[c-1][c-1] ++;\\n\\t\\t\\t\\tmat[c][c-1] = mat[c-1][c] = MOD-1;\\n\\t\\t\\t}\\n\\t\\t\\tif(y && s[y-1][x] != '#'){\\n\\t\\t\\t\\tmat[c][c] ++; mat[to[i-m]][to[i-m]] ++;\\n\\t\\t\\t\\tmat[c][to[i-m]] = mat[to[i-m]][c] = MOD-1;\\n\\t\\t\\t}\\n\\t\\t\\tto[i] = c++;\\n\\t\\t}\\n\\t\\tREP(i, c-1) mat[i].erase(c-1);\\n\\t\\tmat.pop_back();\\n\\t\\tcout << \\\"Case \\\" << T++ << \\\": \\\" << det(mat) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2830,\n \"memory_kb\": 9312,\n \"score_of_the_acc\": -1.3936,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2393_1433201\",\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;\\n/*\\nuse under a[i][j]!=0 -> abs(i-j)<=B\\n(??????+-B?????????????????????????????????)\\n??????????????????swap?????±?????§,-B~+2B?????§???3B+1??????vi??????????????£??????\\n?????????0????????????B-th value(0-indexed) ???a[i][i]??????????????????????????????\\ntime O(NB^2)\\nspace O(NB)\\n*/\\ntypedef long long ll;\\nll mod=1e9+7;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> bmat;\\nll ex(ll x,ll p){\\n\\tll a=1;\\n\\twhile(p){\\n\\t\\tif(p%2) a=a*x%mod;\\n\\t\\tx=x*x%mod;\\n\\t\\tp/=2;\\n\\t}\\n\\treturn a;\\n}\\nll inv(ll a){\\n\\treturn ex(a,mod-2);\\n}\\nll det(bmat a){\\n\\tint N=a.size();\\n\\tif(N==0) return 1;\\n\\tint B=a[0].size()/3;\\n\\tll ans=1;\\n\\trep(i,N){\\n\\t\\tif(a[i][B]==0){\\n\\t\\t\\tfor(int j=i+1;j<N;j++){\\n\\t\\t\\t\\tif(B-(j-i)<0) break;\\n\\t\\t\\t\\tif(a[j][B-(j-i)]!=0){\\n\\t\\t\\t\\t\\tint d=j-i;\\n\\t\\t\\t\\t\\tfor(int k=d;k<=2*B+d;k++){\\n\\t\\t\\t\\t\\t\\tswap(a[i][k],a[j][k-d]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tans*=-1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(a[i][B]==0) return 0;\\n\\t\\t}\\n\\t\\tfor(int j=i+1;j<N;j++){\\n\\t\\t\\tif(B-(j-i)<0) break;\\n\\t\\t\\tint d=j-i;\\n\\t\\t\\tll c=a[j][B-d]*inv(a[i][B])%mod;\\n\\t\\t\\tfor(int k=B;k<=3*B;k++){\\n\\t\\t\\t\\ta[j][k-d]=(a[j][k-d]-c*a[i][k])%mod;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans=ans*a[i][B]%mod;\\n\\t}\\n\\tif(ans<0) ans+=mod;\\n\\treturn ans;\\n}\\nint H,W;\\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\nstring s[500];\\nbool is(int x,int y){\\n\\treturn 0<=x&&x<H&&0<=y&&y<W&&s[x][y]=='.';\\n}\\nint n[500][15];\\nint main(){\\n\\tint tt=0;\\n\\twhile(true){\\n\\t\\ttt++;\\n\\t\\tcin>>H>>W;\\n\\t\\tif(H==0) break;\\n\\t\\trep(i,H) cin>>s[i];\\n\\t\\tint N=0;\\n\\t\\trep(i,H) rep(j,W){\\n\\t\\t\\tif(s[i][j]=='#') n[i][j]=-1;\\n\\t\\t\\telse n[i][j]=N++;\\n\\t\\t}\\n\\t\\tbmat a(N-1,vi(3*W+1,0));\\n\\t\\trep(i,H) rep(j,W){\\n\\t\\t\\tif(!is(i,j)) continue;\\n\\t\\t\\tif(n[i][j]==N-1) break;\\n\\t\\t\\trep(d,4){\\n\\t\\t\\t\\tint x=i+dx[d],y=j+dy[d];\\n\\t\\t\\t\\tif(!is(x,y)) continue;\\n\\t\\t\\t\\tif(n[x][y]!=N-1) a[n[i][j]][n[x][y]-n[i][j]+W]++;\\n\\t\\t\\t\\ta[n[i][j]][W]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<\\\"Case \\\"<<tt<<\\\": \\\"<<det(a)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 7084,\n \"score_of_the_acc\": -0.563,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2393_1157193\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<map>\\n#include<vector>\\nusing namespace std;\\nchar str[600][20];\\nint dx[]={1,0,-1,0};\\nint dy[]={0,1,0,-1};\\nint num[600][20];\\nlong long mod=1000000007;\\nlong long pow(long long a,long long b){\\n\\tlong long ret=1;\\n\\twhile(b){\\n\\t\\tif(b%2)ret=ret*a%mod;\\n\\t\\ta=a*a%mod;\\n\\t\\tb/=2;\\n\\t}\\n\\treturn ret;\\n}\\ntypedef map<int,long long> vec;\\ntypedef vector<vec> mat;\\nlong long det(mat A){\\n\\tint n=A.size();\\n\\tlong long val=1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tint at=-1;\\n\\t\\tfor(int j=i;j<n;j++){\\n\\t\\t\\tif(A[j].count(i)&&A[j][i]){\\n\\t\\t\\t\\tat=j;break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!~at)return 0;\\n\\t\\tif(at!=i){\\n\\t\\t\\tswap(A[at],A[i]);\\n\\t\\t\\tval=(mod-val);\\n\\t\\t}\\n\\t\\tval=val*A[i][i]%mod;\\n\\t\\tlong long t=pow(A[i][i],mod-2);\\n\\t\\tfor(map<int,long long>::iterator it=A[i].begin();it!=A[i].end();it++){\\n\\t\\t\\tA[i][(*it).first]=(*it).second*t%mod;\\n\\t\\t}\\n\\t\\tfor(int j=i+1;j<n;j++){\\n\\t\\t\\tif(A[j].count(i)&&A[j][i]){\\n\\t\\t\\t\\tlong long div=mod-A[j][i];\\n\\t\\t\\t\\tfor(map<int,long long>::iterator it=A[i].begin();it!=A[i].end();it++){\\n\\t\\t\\t\\t\\tif((*it).second==0){continue;}\\n\\t\\t\\t\\t\\tif(!A[j].count((*it).first))A[j][(*it).first]=(*it).second*div%mod;\\n\\t\\t\\t\\t\\telse A[j][(*it).first]=(A[j][(*it).first]+(*it).second*div)%mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<n;i++)val=val*A[i][i]%mod;\\n\\treturn val;\\n}\\nint main(){\\n\\tint a,b;\\n\\tint T=0;\\n\\twhile(scanf(\\\"%d%d\\\",&a,&b),a){\\n\\t\\tT++;\\n\\t\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\t\\tint at=0;\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\t\\tnum[i][j]=-1;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\t\\tif(str[i][j]!='#')num[i][j]=at++;\\n\\t\\t}\\n\\t\\tmat A(at-1);\\n\\t\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\t\\tif(str[i][j]!='#'){\\n\\t\\t\\t\\tint deg=0;\\n\\t\\t\\t\\tfor(int k=0;k<4;k++){\\n\\t\\t\\t\\t\\tif(0<=i+dx[k]&&i+dx[k]<a&&0<=j+dy[k]&&j+dy[k]<b&&~num[i+dx[k]][j+dy[k]]){\\n\\t\\t\\t\\t\\t\\tdeg++;\\n\\t\\t\\t\\t\\t\\tif(num[i][j]<at-1&&num[i+dx[k]][j+dy[k]]<at-1){\\n\\t\\t\\t\\t\\t\\t\\tA[num[i][j]][num[i+dx[k]][j+dy[k]]]=mod-1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(num[i][j]<at-1)A[num[i][j]][num[i][j]]=deg;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tfor(int i=0;i<at-1;i++,printf(\\\"\\\\n\\\"))for(int j=0;j<at-1;j++)printf(\\\"%lld \\\",A[i][j]);\\n\\t\\tprintf(\\\"Case %d: %lld\\\\n\\\",T,det(A));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2950,\n \"memory_kb\": 18356,\n \"score_of_the_acc\": -2,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2393_382943\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <deque>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\ntypedef vector<int> Array;\\ntypedef vector<Array> Matrix;\\nconst ll MOD = 1e+9 + 7;\\n\\nvoid PrintMatrix(const Matrix &mat) {\\n REP(y, mat.size()) {\\n REP(x, mat[0].size()) {\\n printf(\\\"%d \\\", mat[y][x]);\\n }\\n puts(\\\"\\\");\\n }\\n puts(\\\"\\\");\\n}\\n\\n//a x + b y = gcd(a, b)\\nlong long extgcd(long long a, long long b, long long &x, long long &y) {\\n long long g = a; x = 1; y = 0;\\n if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;\\n return g;\\n}\\n\\nlong long InvMod(long long a, long long mod) {\\n long long x, y;\\n if (extgcd(a, mod, x, y) == 1) { return (x + mod) % mod; }\\n return 0;\\n}\\n\\n\\nvoid BandGaussElimination(Matrix &mat) {\\n int h = mat.size();\\n if (h == 0) { return; }\\n int w = mat[0].size() / 2;\\n REP(fy, h) {\\n if (mat[fy][w] == 0) { return; }\\n FOR(ty, fy + 1, min(h, fy + w + 1)) {\\n ll ratio = (MOD - mat[ty][w - (ty - fy)]) * InvMod(mat[fy][w], MOD) % MOD;\\n FOR(dx, 0, w + 1) {\\n int fx = w + dx;\\n int tx = w - (ty - fy) + dx;\\n mat[ty][tx] = (mat[ty][tx] + mat[fy][fx] * ratio) % MOD;\\n }\\n }\\n }\\n}\\n\\nchar field[600][600];\\nint indexes[600][20];\\nint main() {\\n int w, h;\\n int test_case = 0;\\n while (scanf(\\\"%d %d\\\", &h, &w), h|w) {\\n MEMSET(indexes, -1);\\n test_case++;\\n REP(y, h) {\\n scanf(\\\"%s\\\", field[y]);\\n }\\n int m = 0;\\n REP(y, h) {\\n REP(x, w) {\\n if (field[y][x] == '#' && m == 0) { continue; }\\n indexes[y][x] = m++;\\n }\\n }\\n Matrix mat(m, Array(2 * w + 1, 0));\\n REP(y, h) {\\n REP(x, w) {\\n if (indexes[y][x] == -1) { continue; }\\n if (field[y][x] == '#') {\\n mat[indexes[y][x]][w] = 1;\\n continue;\\n }\\n REP(dir, 4) {\\n const int dx[4] = { 1, 0, -1, 0 };\\n const int dy[4] = { 0, 1, 0, -1 };\\n int nx = x + dx[dir];\\n int ny = y + dy[dir];\\n if (nx < 0 || nx >= w || ny < 0 || ny >= h) { continue; }\\n if (field[ny][nx] == '#') { continue; }\\n mat[indexes[y][x]][w]++;\\n int offset = ny * w + nx - y * w - x;\\n mat[indexes[y][x]][w + offset] = MOD - 1;\\n assert(abs(offset) <= w);\\n }\\n }\\n }\\n mat.erase(mat.begin());\\n REP(dx, min(w, (int)mat.size())) {\\n mat[dx][w - dx - 1] = 0;\\n }\\n BandGaussElimination(mat);\\n REP(y, mat.size() / 2) REP(x, w * 2 + 1) { swap(mat[y][x], mat[mat.size() - y - 1][x]); }\\n REP(y, mat.size()) REP(x, w) { swap(mat[y][x], mat[y][2 * w - x]); }\\n BandGaussElimination(mat);\\n ll ans = 1;\\n REP(i, mat.size()) { ans = (ans * mat[i][w]) % MOD; }\\n printf(\\\"Case %d: %lld\\\\n\\\", test_case, ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2410,\n \"memory_kb\": 2304,\n \"score_of_the_acc\": -0.8065,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1361,"cells":{"group_id":{"kind":"string","value":"aoj_2392_cpp"},"problem_description":{"kind":"string","value":"Digit\nFor a positive integer\na\n, let\nS(a)\nbe the sum of the digits in base\nl\n.\nAlso let\nL(a)\nbe the minimum\nk\nsuch that\nS^k(a)\nis less than or equal to\nl-1\n.\nFind the minimum\na\nsuch that\nL(a) = N\nfor a given\nN\n, and print\na\nmodulo\nm\n.\nInput\nThe input contains several test cases, followed by a line containing \"0 0 0\".\nEach test case is given by a line with three integers\nN\n,\nm\n,\nl\n(\n0 \\leq N \\leq 10^5\n,\n1 \\leq m \\leq 10^9\n,\n2 \\leq l \\leq 10^9\n).\nOutput\nFor each test case, print its case number and the minimum\na\nmodulo\nm\nas described above.\nSample Input\n0 1000 10\n1 1000 10\n0 0 0\nOutput for the Sample Input\nCase 1: 1\nCase 2: 10"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2392_10351770","code_snippet":"// AOJ #2392 Digit\n// 2025.4.6\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 int n = 0; int c = gc();\n do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n return n;\n}\n\nvoid Cout(int n) {\n char b[30];\n if (!n) pc('0');\n else {\n if (n < 0) pc('-'), n = -n;\n int i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n while (i--) pc(b[i]);\n }\n}\n\nvoid Couts(const string &s) { for (char c : s) pc(c); }\n\nll gcd(ll a, ll b) {\n ll r;\n while (b != 0) r = a % b, a = b, b = r;\n return a;\n}\n\nll eulerPhi(ll N) {\n ll res = N;\n for (ll i = 2; i * i <= N; i++) {\n if (N % i == 0) {\n while (N % i == 0) N /= i;\n res -= res / i;\n }\n }\n if (N > 1) res -= res / N;\n return res;\n}\n\n__int128 modPow(__int128 base, ll exp, ll mod) {\n __int128 res = 1;\n base %= mod;\n while(exp > 0) {\n if(exp & 1) res = (res * base) % mod;\n base = (base * base) % mod;\n exp >>= 1;\n }\n return res;\n}\n\nll geomSum(ll a, ll n, ll mod) {\n ll newMod = mod * (a - 1);\n __int128 p = modPow(a, n, newMod);\n ll sum = (ll)((p - 1) / (a - 1));\n return sum % mod;\n}\n\npair<ll, ll> splitMod(ll M, ll L) {\n ll cp = 1, np = 1;\n for (ll i = 2; i * i <= M; i++) {\n if (M % i == 0) {\n ll fac = 1;\n while (M % i == 0) {\n fac *= i;\n M /= i;\n }\n if (gcd(L - 1, i) == 1) cp *= fac;\n else np *= fac;\n }\n }\n if (M > 1) {\n if (gcd(L - 1, M) == 1) cp *= M;\n else np *= M;\n }\n return {cp, np};\n}\n\nstruct State { ll mp, non; };\n\nll calc(ll N, ll L, ll M) {\n vector<State> st(N + 1);\n vector<ll> modVal(N + 1, 0);\n vector<ll> U(N + 1, 0);\n\n st[N].mp = M;\n st[N].non = 1;\n\n for (ll i = N; i >= 2; i--) {\n ll mp = st[i].mp, non = st[i].non;\n if (mp != 1) {\n auto sp = splitMod(mp, L);\n mp = sp.first;\n non = non * sp.second;\n }\n modVal[i] = mp * non;\n st[i - 1].mp = eulerPhi(mp);\n st[i - 1].non = non;\n }\n U[1] = 1;\n for (ll i = 2; i <= N; i++) {\n U[i] = (2 * geomSum(L, U[i - 1], modVal[i])) % modVal[i];\n if (U[i] == 0)\n U[i] = modVal[i];\n }\n return U[N];\n}\n\nint main(){\n ll N, M, L;\n int cn = 0;\n while (true) {\n int N = Cin(), M = Cin(), L = Cin();\n if (M == 0) break;\n ll ans;\n if (N == 0) ans = 1 % M;\n else if (N == 1) ans = L % M;\n else {\n ll t = calc(N, L, M);\n ans = (((L - 1) % M) * (t % M)) % M;\n ans = (ans + 1) % M;\n }\n Couts(\"Case \"), Cout(++cn), Couts(\": \"), Cout(ans), pc('\\n');\n }\n return 0;\n}","accuracy":1,"time_ms":750,"memory_kb":6124,"score_of_the_acc":-0.5534,"final_rank":3},{"submission_id":"aoj_2392_9457046","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nll euler_phi(ll N){\n ll CN=N;\n vll P;\n for(ll i=2;i*i<=N;i++)if(N%i==0){\n P.push_back(i);\n while(N%i==0)N/=i;\n }\n\n if(N!=1)P.push_back(N);\n for(auto p:P){\n CN/=p;\n CN*=(p-1);\n }\n return CN;\n}\n\nusing LL=__int128_t;\nLL modpow(LL a,ll n,LL mod){\n if(n==0)return 1;\n else if(n%2==1){\n return (a*modpow(a,n-1,mod)%mod);\n }\n LL t=modpow(a,n/2,mod);\n return (t*t)%mod;\n}\n\n//(a^n-1)/(a-1) modulo mod\nll geom_sum(ll a,ll n,ll mod){\n if(n==0)return 0;\n return (ll(modpow(a,n,LL(mod)*LL(a-1))-1)/(a-1))%mod;\n}\n\n// Mを, Lと互いに素のパートとそれ以外に分ける\npair<ll,ll> split(ll M,ll L){\n ll res=1,fes=1;\n for(ll i=2;i*i<=M;i++)if(M%i==0){\n ll d=1;\n while(M%i==0){\n d*=i;\n M/=i;\n }\n (gcd(L-1,i)==1?res:fes)*=d;\n }\n (gcd(M,L-1)==1?res:fes)*=M;\n return {res,fes};\n}\n\nll calcU(ll N,ll L,ll MP,ll ML=1){\n if(N==1)return 1;\n if(MP!=1){//互いに素パートが残っていたら分割\n pair<ll,ll> p=split(MP,L);\n MP=p.first;\n ML*=p.second;\n }\n ll D=calcU(N-1,L,euler_phi(MP),ML);\n D=geom_sum(L,D,MP*ML);\n D*=2;\n D%=(MP*ML);\n if(D==0)D=MP*ML;\n return D;\n}\n\n//M=ML*MP, MPとLは直交\nll calc(ll N,ll L,ll MP,ll ML=1){\n if(N==0)return 1%(ML*MP);\n ll u=calcU(N,L,MP,ML);\n // cout<<u<<\" \";\n u*=(L-1);\n u++;\n return u%(MP*ML);\n}\n\nll Case=0;\nvoid solve(ll N,ll M,ll L){\n Case++;\n cout<<\"Case \"<<Case<<\": \";\n cout<<calc(N,L,M,1)<<endl;\n return;\n}\n\nint main(){\n ll N,M,L;\n while(cin>>N>>M>>L,N+M+L!=0)solve(N,M,L);\n}","accuracy":1,"time_ms":770,"memory_kb":8128,"score_of_the_acc":-0.6153,"final_rank":5},{"submission_id":"aoj_2392_9457040","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nmap<pair<ll,pair<ll,ll>>,vvll> MP;\n\nll euler_phi(ll N){\n ll CN=N;\n vll P;\n for(ll i=2;i*i<=N;i++){\n if(N%i==0){\n P.push_back(i);\n while(N%i==0)N/=i;\n }\n }\n if(N!=1)P.push_back(N);\n for(auto p:P){\n CN/=p;\n CN*=(p-1);\n }\n return CN;\n}\n\nvvll mul(vvll A,vvll B,ll mod){\n ll n=A.size();\n vvll res(n,vll(n,0));\n rep(i,n)rep(j,n){\n rep(k,n){\n res[i][j]+=A[i][k]*B[k][j]%mod;\n }\n res[i][j]%=mod;\n }\n return res;\n}\n\n//A^N\nvvll matpow(vvll A,ll N,ll mod){\n ll n=A.size();\n ll a=A[0][0];\n vvll E(n,vll(n,0));\n rep(i,n)E[i][i]=1;\n ll pw=0;\n while(N>0){\n if(N%2){\n E=mul(E,A,mod);\n }\n N/=2;\n if(!MP.count({pw+1,{a,mod}})){\n A=mul(A,A,mod);\n MP[{pw+1,{a,mod}}]=A;\n }\n A=MP[{pw+1,{a,mod}}];\n pw++;\n }\n return E;\n}\n\nusing LL=__int128_t;\nLL modpow(LL a,ll n,LL mod){\n if(n==0)return 1;\n else if(n%2==1){\n return (a*modpow(a,n-1,mod)%mod);\n }\n LL t=modpow(a,n/2,mod);\n return (t*t)%mod;\n}\n\nll geom_sumnaive(ll a,ll n,ll mod){\n ll res=0;\n ll d=1;\n for(ll j=0;j<n;j++){\n res+=d;\n d=(d*a)%mod;\n }\n return res%mod;\n}\n\n//1+a+a^2+...+a^{n-1} %mod\nll geom_sum(ll a,ll n,ll mod){\n if(n==0)return 0;\n vvll A={{a,1},{0,1}};\n vvll P=matpow(A,n,mod);\n return P[0][1];\n\n}\n\nll geom_sum2(ll a,ll n,ll mod){\n if(n==0)return 0;\n return (ll(modpow(a,n,LL(mod)*LL(a-1))-1)/(a-1))%mod;\n}\n\npair<ll,ll> split(ll M,ll L){\n ll res=1,fes=1;\n for(ll i=2;i*i<=M;i++){\n if(M%i==0){\n \n ll d=1;\n while(M%i==0){\n d*=i;\n M/=i;\n }\n (gcd(L-1,i)==1?res:fes)*=d;\n }\n }\n (gcd(M,L-1)==1?res:fes)*=M;\n return {res,fes};\n}\n\nll calcU(ll N,ll L,ll MP,ll ML=1){\n if(N==1)return 1;\n if(MP!=1){\n pair<ll,ll> p=split(MP,L);\n // cout<<MP<<\" \"<<ML<<\" \"<<L<<\" \"<<p.first<<\" \"<<p.second*ML<<endl;\n MP=p.first;\n ML*=p.second;\n }\n ll D=calcU(N-1,L,euler_phi(MP),ML);\n D=geom_sum2(L,D,MP*ML);\n D*=2;\n D%=(MP*ML);\n if(D==0)D=MP*ML;\n return D;\n}\n\n\n\n//M=ML*MP, MPとLは直交\nll calc(ll N,ll L,ll MP,ll ML=1){\n if(N==0)return 1%(ML*MP);\n ll u=calcU(N,L,MP,ML);\n // cout<<u<<\" \";\n u*=(L-1);\n u++;\n return u%(MP*ML);\n}\n\nll Case=0;\nvoid solve(ll N,ll M,ll L){\n Case++;\n cout<<\"Case \"<<Case<<\": \";\n cout<<calc(N,L,M,1)<<endl;\n return;\n}\n\nint main(){\n ll N,M,L;\n while(cin>>N>>M>>L,N+M+L!=0)solve(N,M,L);\n}","accuracy":1,"time_ms":750,"memory_kb":8036,"score_of_the_acc":-0.587,"final_rank":4},{"submission_id":"aoj_2392_7246911","code_snippet":"#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n#pragma warning (disable: 4996)\n\nconst long long TEISUU = 100LL;\nlong long N, M, L;\nlong long dp1[100009]; // (Answer[i]-1) mod p\nlong long dp2[100009][69]; // (Answer[i]-1)/(L-1) mod euler(p)\nvector<long long> List;\nlong long Modulo_Precount[69][39];\nlong long Concat_Precount1[69][39];\nlong long Concat_Precount2[69][39];\n\nvoid mod_henkan(long long &a, long long m) {\n\tif (a >= TEISUU) {\n\t\tlong long eval = ((a - TEISUU) / m) * m;\n\t\ta -= eval;\n\t}\n}\n\nvoid Initialize() {\n\tfor (int i = 0; i < (int)List.size(); i++) {\n\t\tModulo_Precount[i][0] = L % List[i];\n\t\tfor (int j = 1; j < 34; j++) {\n\t\t\tModulo_Precount[i][j] = Modulo_Precount[i][j - 1] * Modulo_Precount[i][j - 1];\n\t\t\tModulo_Precount[i][j] %= List[i];\n\t\t}\n\t}\n\tfor (int i = 0; i < (int)List.size(); i++) {\n\t\tConcat_Precount1[i][0] = L;\n\t\tConcat_Precount2[i][0] = 1;\n\t\tfor (int j = 1; j < 34; j++) {\n\t\t\tConcat_Precount2[i][j] = Concat_Precount1[i][j - 1] * Concat_Precount2[i][j - 1] + Concat_Precount2[i][j - 1];\n\t\t\tConcat_Precount1[i][j] = Concat_Precount1[i][j - 1] * Concat_Precount1[i][j - 1];\n\t\t\tmod_henkan(Concat_Precount2[i][j], List[i]);\n\t\t\tmod_henkan(Concat_Precount1[i][j], List[i]);\n\t\t}\n\t}\n}\n\n// a^b mod m\nlong long modpow(long long a, long long b, long long m, int idx) {\n\tlong long r = 1;\n\tfor (int i = 0; i < 32; i++) {\n\t\tif ((b & (1LL << i)) != 0) { r *= Modulo_Precount[idx][i]; r %= m; }\n\t}\n\treturn r;\n}\n\n// 1111111111111...111111111111 mod m\nlong long Concatenate(long long a, long long m, int idx) {\n\tlong long ret = 0;\n\tfor (int i = 0; i < 32; i++) {\n\t\tif ((a & (1LL << i)) != 0) {\n\t\t\tret = (ret * Concat_Precount1[idx][i] + Concat_Precount2[idx][i]);\n\t\t\tmod_henkan(ret, m);\n\t\t}\n\t}\n\treturn ret;\n}\n\nlong long modpow_Slow(long long a, long long b, long long m) {\n\tlong long p = 1, q = a;\n\tfor (int i = 0; i < 34; i++) {\n\t\tif ((b & (1LL << i)) != 0) { p *= q; p %= m; }\n\t\tq *= q; q %= m;\n\t}\n\treturn p;\n}\n\n// 1111111111111...111111111111 mod m\nlong long Concatenate_Slow(long long a, long long m, long long base) {\n\tlong long ret = 0;\n\tlong long a1 = base, a2 = 1;\n\tfor (int i = 0; i < 34; i++) {\n\t\tif ((a & (1LL << i)) != 0) {\n\t\t\tret = (ret * a1 + a2);\n\t\t\tmod_henkan(ret, m);\n\t\t}\n\t\ta2 = (a1 * a2 + a2); mod_henkan(a2, m);\n\t\ta1 = (a1 * a1); mod_henkan(a1, m);\n\t}\n\treturn ret;\n}\n\nlong long Euler(long long n) {\n\tlong long r = n;\n\tlong long cur = n;\n\tfor (int i = 2; i * i <= n; i++) {\n\t\tif (cur % i != 0) continue;\n\t\tr = (1LL * r * (i - 1)) / (1LL * i);\n\t\twhile (cur % i == 0) { cur /= i; }\n\t}\n\tif (cur >= 2) {\n\t\tr = (1LL * r * (cur - 1)) / cur;\n\t}\n\treturn r;\n}\n\nlong long GCD(long long a, long long b) {\n\tif (b == 0) return a;\n\treturn GCD(b, a % b);\n}\n\nvector<int> yakusuu(int n) {\n\tvector<int> ret;\n\tfor (int i = 1; i * i <= n; i++) {\n\t\tif (n % i != 0) continue;\n\t\tret.push_back(i);\n\t\tif (i != n / i) ret.push_back(n / i);\n\t}\n\tsort(ret.begin(), ret.end());\n\treturn ret;\n}\n\nlong long solve() {\n\tif (N == 0) return 1;\n\tif (N == 1) return L % M;\n\tif (N == 2) return (2LL * L - 1LL) % M;\n\n\t// Prepare\n\tlong long mod1 = M, cx = Euler(M); List.clear(); List.push_back(M);\n\twhile (true) {\n\t\tList.push_back(cx);\n\t\tlong long val1 = 2LL * Concatenate_Slow(TEISUU + 0, cx, L);\n\t\tlong long val2 = 2LL * Concatenate_Slow(TEISUU + cx, cx, L);\n\t\tif (val1 == val2) {\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tvector<int> tmp = yakusuu(Euler(cx));\n\t\t\tfor (int i = 0; i < (int)tmp.size(); i++) {\n\t\t\t\tlong long val3 = 2LL * modpow_Slow(L, TEISUU + 0, cx);\n\t\t\t\tlong long val4 = 2LL * modpow_Slow(L, TEISUU + tmp[i], cx);\n\t\t\t\tif (val3 == val4) {\n\t\t\t\t\tlong long val5 = 2LL * Concatenate_Slow(TEISUU + tmp[i], cx, L);\n\t\t\t\t\tlong long diff = abs(val1 - val5) % cx;\n\t\t\t\t\tlong long bairitsu = cx / GCD(cx, diff);\n\t\t\t\t\tcx = tmp[i] * bairitsu;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tInitialize();\n\n\t// Initialize\n\tfor (int i = 0; i <= N; i++) {\n\t\tdp1[i] = 0;\n\t\tfor (int j = 0; j < (int)List.size(); j++) dp2[i][j] = 0;\n\t}\n\tdp1[1] = L % mod1;\n\tfor (int i = 1; i < (int)List.size(); i++) dp2[1][i] = 1;\n\n\t// Dynamic Programming\n\tfor (int i = 2; i <= N; i++) {\n\t\tdp1[i] = 2LL * modpow(L, dp2[i - 1][1], mod1, 0) - 1LL;\n\t\tdp1[i] = (dp1[i] + mod1) % mod1;\n\t\tfor (int j = 1; j < (int)List.size(); j++) {\n\t\t\tint mod_nex = 1; if (j + 1 < (int)List.size()) mod_nex = List[j + 1];\n\t\t\tint nex_idx = j; if (j + 1 < (int)List.size()) nex_idx = j + 1;\n\t\t\tdp2[i][j] = 2LL * Concatenate(dp2[i - 1][nex_idx], List[j], j);\n\t\t\tmod_henkan(dp2[i][j], List[j]);\n\t\t}\n\t}\n\treturn dp1[N];\n}\n\nint main() {\n\t// FILE* out = freopen(\"in1.txt\", \"w\", stdout);\n\tfor (int testcase = 1; testcase <= 869120; testcase++) {\n\t\tcin >> N >> M >> L;\n\t\tif (N + M + L == 0) break;\n\t\tlong long ans = solve();\n\t\tcout << \"Case \" << testcase << \": \" << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":490,"memory_kb":58096,"score_of_the_acc":-1.12,"final_rank":7},{"submission_id":"aoj_2392_1600664","code_snippet":"#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\ninline int safeAdd(int a, int b, int m) {\n\tif ((long long)a + b >= m) {\n\t\treturn m + ((long long)a + b) % m;\n\t} else {\n\t\treturn a + b;\n\t}\n}\n\ninline int safeMul(int a, int b, int m) {\n\tif ((long long)a * b >= m) {\n\t\treturn m + (long long)a * b % m;\n\t} else {\n\t\treturn a * b;\n\t}\n}\n\nint powSum(int x, int n, int MOD) {\n\tif (n == 0) {\n\t\treturn 0;\n\t}\n\tint ret = 0, s = 1, t = 1;\n\twhile (n) {\n\t\tif (n & 1) {\n\t\t\tret = safeAdd(ret, safeMul(s, t, MOD), MOD);\n\t\t\ts = safeMul(s, x, MOD);\n\t\t}\n\t\tt = safeMul(t, safeAdd(x, 1, MOD), MOD);\n\t\tx = safeMul(x, x, MOD);\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\nint phi(int n) {\n\tint ret = 1;\n\tfor (int i = 2; i * i <= n; ++i) {\n\t\tif (n % i == 0) {\n\t\t\tret *= (i - 1);\n\t\t\tn /= i;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tret *= i;\n\t\t\t\tn /= i;\n\t\t\t}\n\t\t}\n\t}\n\tif (n != 1) {\n\t\tret *= (n - 1);\n\t\tn = 1;\n\t}\n\treturn ret;\n}\n\nint l;\n\nint getb(int n, int mp, int mq) {\n\tint m = mp * mq;\n\tif (n == 1) {\n\t\treturn 1;\n\t}\n\tdo {\n\t\tint g = __gcd(mq, l - 1);\n\t\tif (g == 1) {\n\t\t\tbreak;\n\t\t}\n\t\tmp *= g, mq /= g;\n\t} while (true);\n\tint bn1;\n\tif (mq == 1) {\n\t\tbn1 = 1;\n\t\tfor (int i = 2; i < n; ++i) {\n\t\t\tint last = bn1;\n\t\t\tbn1 = safeMul(2, powSum(l, bn1, m), m);\n\t\t\tif (bn1 == last) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tbn1 = getb(n - 1, mp, phi(mq));\n\t}\n\treturn safeMul(2, powSum(l, bn1, m), m);\n}\n\nint main() {\n\tint n, m;\n\twhile (scanf(\"%d%d%d\", &n, &m, &l) == 3 && l) {\n\t\tint ans;\n\t\tif (n == 0) {\n\t\t\tans = 1 % m;\n\t\t} else if (n == 1) {\n\t\t\tans = l % m;\n\t\t} else {\n\t\t\tint bn = getb(n, 1, m);\n\t\t\tans = ((long long)(l - 1) * bn + 1) % m;\n\t\t}\n\t\tstatic int id = 0;\n\t\tprintf(\"Case %d: %d\\n\", ++id, ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":810,"memory_kb":1188,"score_of_the_acc":-0.5467,"final_rank":2},{"submission_id":"aoj_2392_1600627","code_snippet":"#include<vector>\n#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n\ninline int safeAdd(int a, int b, int m) {\n\tif ((long long)a + b >= m) {\n\t\treturn m + ((long long)a + b) % m;\n\t} else {\n\t\treturn a + b;\n\t}\n}\n\ninline int safeMul(int a, int b, int m) {\n\tif ((long long)a * b >= m) {\n\t\treturn m + (long long)a * b % m;\n\t} else {\n\t\treturn a * b;\n\t}\n}\n\nint powSum(int x, int n, int MOD) {\n\tif (n == 0) {\n\t\treturn 0;\n\t}\n\tint ret = 0, s = 1, t = 1;\n\twhile (n) {\n\t\tif (n & 1) {\n\t\t\tret = safeAdd(ret, safeMul(s, t, MOD), MOD);\n\t\t\ts = safeMul(s, x, MOD);\n\t\t}\n\t\tt = safeMul(t, safeAdd(x, 1, MOD), MOD);\n\t\tx = safeMul(x, x, MOD);\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n\nint phi(int n) {\n\tint ret = 1;\n\tfor (int i = 2; i * i <= n; ++i) {\n\t\tif (n % i == 0) {\n\t\t\tret *= (i - 1);\n\t\t\tn /= i;\n\t\t\twhile (n % i == 0) {\n\t\t\t\tret *= i;\n\t\t\t\tn /= i;\n\t\t\t}\n\t\t}\n\t}\n\tif (n != 1) {\n\t\tret *= (n - 1);\n\t\tn = 1;\n\t}\n\treturn ret;\n}\n\nint l;\n\nint getb(int n, int mp, int mq) {\n\tint m = mp * mq;\n\tif (n == 1) {\n\t\treturn 1;\n\t}\n\tdo {\n\t\tint g = __gcd(mq, l - 1);\n\t\tif (g == 1) {\n\t\t\tbreak;\n\t\t}\n\t\tmp *= g, mq /= g;\n\t} while (true);\n\tint bn1;\n\tif (mq == 1) {\n\t\tbn1 = 1;\n\t\tfor (int i = 2; i < n; ++i) {\n\t\t\tbn1 = safeMul(2, powSum(l, bn1, m), m);\n\t\t}\n\t} else {\n\t\tbn1 = getb(n - 1, mp, phi(mq));\n\t}\n\treturn safeMul(2, powSum(l, bn1, m), m);\n}\n\nint main() {\n\tint n, m;\n\twhile (scanf(\"%d%d%d\", &n, &m, &l) == 3 && l) {\n\t\tint ans;\n\t\tif (n == 0) {\n\t\t\tans = 1 % m;\n\t\t} else if (n == 1) {\n\t\t\tans = l % m;\n\t\t} else {\n\t\t\tint bn = getb(n, 1, m);\n\t\t\tans = ((long long)(l - 1) * bn + 1) % m;\n\t\t}\n\t\tstatic int id = 0;\n\t\tprintf(\"Case %d: %d\\n\", ++id, ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1150,"memory_kb":1188,"score_of_the_acc":-1,"final_rank":6},{"submission_id":"aoj_2392_1375520","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;\ntypedef long long ll;\nll a[100010];\nll b[100010];\nll c[100010];\nll s[100010];\nll m[100010];\nll gcd(ll x,ll y){\n\tif(y==0) return x;\n\treturn gcd(y,x%y);\n}\nll ex(ll x,ll p,ll mod){\n\tll a=1;\n\twhile(p){\n\t\tif(p%2) a=a*x%mod;\n\t\tx=x*x%mod;\n\t\tp/=2;\n\t}\n\treturn a;\n}\nll geo(ll x,ll p,ll mod){\t//1+x+..+x^(p-1)\n\tif(p==0) return 0;\n\tll a=0,s=1,t=1;\n\twhile(p){\n\t\tif(p%2){\n\t\t\ta=(a+s*t)%mod;\n\t\t\ts=s*x%mod;\n\t\t}\n\t\tt=t*(1+x)%mod;\n\t\tx=x*x%mod;\n\t\tp/=2;\n\t}\n\treturn a;\n}\ntypedef pair<int,int> P;\nll getord(ll M,ll a){\n\tll H=sqrt(M)+1;\n\tvector<P> babies;\n\tll p=1;\n\trep(i,H){\n\t\tbabies.pb(P(p,i));\n\t\tp=p*a%M;\n\t}\n\tll q=p;\n\tsort(all(babies));\n\trep1(i,H){\n\t\tint pos=upper_bound(all(babies),P(p,H))-babies.begin()-1;\n\t\tif(pos>=0&&babies[pos].fs==p) return i*H-babies[pos].sc;\n\t\tp=p*q%M;\n\t}\n}\nll pre,parg;\nvoid getnext(ll M,ll L,int id){\n\tll p=L;\n\tll gs[101];\n\tgs[0]=1;\n\trep(i,100){\n\t\tgs[i+1]=gcd(p,M);\n\t\tif(gs[i]==gs[i+1]){\n\t\t\ta[id]=i;\n\t\t\ts[id]=geo(L,i,M);\n\t\t\tll g=gs[i];\n\t\t\tc[id]=ex(L,i,M);\n\t\t\tM/=g;\n\t\t\tbreak;\n\t\t}\n\t\tp=p*L%M;\n\t}\n\tif(M==pre){\n\t\tm[id]=parg;\n\t\treturn;\n\t}\n\tll o=getord(M,L);\n\tll ss=geo(L,o,M);\n\tm[id]=M/gcd(M,ss)*o;\n\tpre=M,parg=m[id];\n}\nll getans(ll b,ll M,ll L){\n\treturn (2*ex(L,b,M)+M-1)%M;\n}\nint solve(ll N,ll M,ll L){\n\tpre=-1;\n\tif(N==0) return 1;\n\tif(N==1) return L%M;\n\tif(N==2) return getans(1,M,L);\n\tif(N==3) return getans(2,M,L);\n\tif(N==4) return getans(2*(L+1),M,L);\n\tN++;\n\tm[N]=M;\n\tfor(ll x=N-1;x>=4;x--){\n\t\tgetnext(m[x+1],L,x);\n\t}\n\tb[4]=2*(L+1)%m[4];\n\tfor(ll x=4;x<N;x++){\n\t\tll p=(b[x]-a[x])%m[x];\n\t\tif(p<0) p+=m[x];\n\t\tb[x+1]=2*(s[x]+c[x]*geo(L,p,m[x+1]))%m[x+1];\n\t}\n\treturn (b[N]*(L-1)+1)%M;\n}\nint main(){\n\tfor(int t=1;;t++){\n\t\tll N,M,L;\n\t\tcin>>N>>M>>L;\n\t\tif(M==0) break;\n\t\tprintf(\"Case %d: %d\\n\",t,solve(N,M,L));\n\t}\n}","accuracy":1,"time_ms":400,"memory_kb":5524,"score_of_the_acc":-0.0762,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2392_10351770\",\n \"code_snippet\": \"// AOJ #2392 Digit\\n// 2025.4.6\\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 int n = 0; int c = gc();\\n do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n return n;\\n}\\n\\nvoid Cout(int n) {\\n char b[30];\\n if (!n) pc('0');\\n else {\\n if (n < 0) pc('-'), n = -n;\\n int i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n while (i--) pc(b[i]);\\n }\\n}\\n\\nvoid Couts(const string &s) { for (char c : s) pc(c); }\\n\\nll gcd(ll a, ll b) {\\n ll r;\\n while (b != 0) r = a % b, a = b, b = r;\\n return a;\\n}\\n\\nll eulerPhi(ll N) {\\n ll res = N;\\n for (ll i = 2; i * i <= N; i++) {\\n if (N % i == 0) {\\n while (N % i == 0) N /= i;\\n res -= res / i;\\n }\\n }\\n if (N > 1) res -= res / N;\\n return res;\\n}\\n\\n__int128 modPow(__int128 base, ll exp, ll mod) {\\n __int128 res = 1;\\n base %= mod;\\n while(exp > 0) {\\n if(exp & 1) res = (res * base) % mod;\\n base = (base * base) % mod;\\n exp >>= 1;\\n }\\n return res;\\n}\\n\\nll geomSum(ll a, ll n, ll mod) {\\n ll newMod = mod * (a - 1);\\n __int128 p = modPow(a, n, newMod);\\n ll sum = (ll)((p - 1) / (a - 1));\\n return sum % mod;\\n}\\n\\npair<ll, ll> splitMod(ll M, ll L) {\\n ll cp = 1, np = 1;\\n for (ll i = 2; i * i <= M; i++) {\\n if (M % i == 0) {\\n ll fac = 1;\\n while (M % i == 0) {\\n fac *= i;\\n M /= i;\\n }\\n if (gcd(L - 1, i) == 1) cp *= fac;\\n else np *= fac;\\n }\\n }\\n if (M > 1) {\\n if (gcd(L - 1, M) == 1) cp *= M;\\n else np *= M;\\n }\\n return {cp, np};\\n}\\n\\nstruct State { ll mp, non; };\\n\\nll calc(ll N, ll L, ll M) {\\n vector<State> st(N + 1);\\n vector<ll> modVal(N + 1, 0);\\n vector<ll> U(N + 1, 0);\\n\\n st[N].mp = M;\\n st[N].non = 1;\\n\\n for (ll i = N; i >= 2; i--) {\\n ll mp = st[i].mp, non = st[i].non;\\n if (mp != 1) {\\n auto sp = splitMod(mp, L);\\n mp = sp.first;\\n non = non * sp.second;\\n }\\n modVal[i] = mp * non;\\n st[i - 1].mp = eulerPhi(mp);\\n st[i - 1].non = non;\\n }\\n U[1] = 1;\\n for (ll i = 2; i <= N; i++) {\\n U[i] = (2 * geomSum(L, U[i - 1], modVal[i])) % modVal[i];\\n if (U[i] == 0)\\n U[i] = modVal[i];\\n }\\n return U[N];\\n}\\n\\nint main(){\\n ll N, M, L;\\n int cn = 0;\\n while (true) {\\n int N = Cin(), M = Cin(), L = Cin();\\n if (M == 0) break;\\n ll ans;\\n if (N == 0) ans = 1 % M;\\n else if (N == 1) ans = L % M;\\n else {\\n ll t = calc(N, L, M);\\n ans = (((L - 1) % M) * (t % M)) % M;\\n ans = (ans + 1) % M;\\n }\\n Couts(\\\"Case \\\"), Cout(++cn), Couts(\\\": \\\"), Cout(ans), pc('\\\\n');\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 6124,\n \"score_of_the_acc\": -0.5534,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2392_9457046\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nusing vll=vector<ll>;\\nusing vvll=vector<vll>;\\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\\n\\nll euler_phi(ll N){\\n ll CN=N;\\n vll P;\\n for(ll i=2;i*i<=N;i++)if(N%i==0){\\n P.push_back(i);\\n while(N%i==0)N/=i;\\n }\\n\\n if(N!=1)P.push_back(N);\\n for(auto p:P){\\n CN/=p;\\n CN*=(p-1);\\n }\\n return CN;\\n}\\n\\nusing LL=__int128_t;\\nLL modpow(LL a,ll n,LL mod){\\n if(n==0)return 1;\\n else if(n%2==1){\\n return (a*modpow(a,n-1,mod)%mod);\\n }\\n LL t=modpow(a,n/2,mod);\\n return (t*t)%mod;\\n}\\n\\n//(a^n-1)/(a-1) modulo mod\\nll geom_sum(ll a,ll n,ll mod){\\n if(n==0)return 0;\\n return (ll(modpow(a,n,LL(mod)*LL(a-1))-1)/(a-1))%mod;\\n}\\n\\n// Mを, Lと互いに素のパートとそれ以外に分ける\\npair<ll,ll> split(ll M,ll L){\\n ll res=1,fes=1;\\n for(ll i=2;i*i<=M;i++)if(M%i==0){\\n ll d=1;\\n while(M%i==0){\\n d*=i;\\n M/=i;\\n }\\n (gcd(L-1,i)==1?res:fes)*=d;\\n }\\n (gcd(M,L-1)==1?res:fes)*=M;\\n return {res,fes};\\n}\\n\\nll calcU(ll N,ll L,ll MP,ll ML=1){\\n if(N==1)return 1;\\n if(MP!=1){//互いに素パートが残っていたら分割\\n pair<ll,ll> p=split(MP,L);\\n MP=p.first;\\n ML*=p.second;\\n }\\n ll D=calcU(N-1,L,euler_phi(MP),ML);\\n D=geom_sum(L,D,MP*ML);\\n D*=2;\\n D%=(MP*ML);\\n if(D==0)D=MP*ML;\\n return D;\\n}\\n\\n//M=ML*MP, MPとLは直交\\nll calc(ll N,ll L,ll MP,ll ML=1){\\n if(N==0)return 1%(ML*MP);\\n ll u=calcU(N,L,MP,ML);\\n // cout<<u<<\\\" \\\";\\n u*=(L-1);\\n u++;\\n return u%(MP*ML);\\n}\\n\\nll Case=0;\\nvoid solve(ll N,ll M,ll L){\\n Case++;\\n cout<<\\\"Case \\\"<<Case<<\\\": \\\";\\n cout<<calc(N,L,M,1)<<endl;\\n return;\\n}\\n\\nint main(){\\n ll N,M,L;\\n while(cin>>N>>M>>L,N+M+L!=0)solve(N,M,L);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 8128,\n \"score_of_the_acc\": -0.6153,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2392_9457040\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nusing vll=vector<ll>;\\nusing vvll=vector<vll>;\\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\\n\\nmap<pair<ll,pair<ll,ll>>,vvll> MP;\\n\\nll euler_phi(ll N){\\n ll CN=N;\\n vll P;\\n for(ll i=2;i*i<=N;i++){\\n if(N%i==0){\\n P.push_back(i);\\n while(N%i==0)N/=i;\\n }\\n }\\n if(N!=1)P.push_back(N);\\n for(auto p:P){\\n CN/=p;\\n CN*=(p-1);\\n }\\n return CN;\\n}\\n\\nvvll mul(vvll A,vvll B,ll mod){\\n ll n=A.size();\\n vvll res(n,vll(n,0));\\n rep(i,n)rep(j,n){\\n rep(k,n){\\n res[i][j]+=A[i][k]*B[k][j]%mod;\\n }\\n res[i][j]%=mod;\\n }\\n return res;\\n}\\n\\n//A^N\\nvvll matpow(vvll A,ll N,ll mod){\\n ll n=A.size();\\n ll a=A[0][0];\\n vvll E(n,vll(n,0));\\n rep(i,n)E[i][i]=1;\\n ll pw=0;\\n while(N>0){\\n if(N%2){\\n E=mul(E,A,mod);\\n }\\n N/=2;\\n if(!MP.count({pw+1,{a,mod}})){\\n A=mul(A,A,mod);\\n MP[{pw+1,{a,mod}}]=A;\\n }\\n A=MP[{pw+1,{a,mod}}];\\n pw++;\\n }\\n return E;\\n}\\n\\nusing LL=__int128_t;\\nLL modpow(LL a,ll n,LL mod){\\n if(n==0)return 1;\\n else if(n%2==1){\\n return (a*modpow(a,n-1,mod)%mod);\\n }\\n LL t=modpow(a,n/2,mod);\\n return (t*t)%mod;\\n}\\n\\nll geom_sumnaive(ll a,ll n,ll mod){\\n ll res=0;\\n ll d=1;\\n for(ll j=0;j<n;j++){\\n res+=d;\\n d=(d*a)%mod;\\n }\\n return res%mod;\\n}\\n\\n//1+a+a^2+...+a^{n-1} %mod\\nll geom_sum(ll a,ll n,ll mod){\\n if(n==0)return 0;\\n vvll A={{a,1},{0,1}};\\n vvll P=matpow(A,n,mod);\\n return P[0][1];\\n\\n}\\n\\nll geom_sum2(ll a,ll n,ll mod){\\n if(n==0)return 0;\\n return (ll(modpow(a,n,LL(mod)*LL(a-1))-1)/(a-1))%mod;\\n}\\n\\npair<ll,ll> split(ll M,ll L){\\n ll res=1,fes=1;\\n for(ll i=2;i*i<=M;i++){\\n if(M%i==0){\\n \\n ll d=1;\\n while(M%i==0){\\n d*=i;\\n M/=i;\\n }\\n (gcd(L-1,i)==1?res:fes)*=d;\\n }\\n }\\n (gcd(M,L-1)==1?res:fes)*=M;\\n return {res,fes};\\n}\\n\\nll calcU(ll N,ll L,ll MP,ll ML=1){\\n if(N==1)return 1;\\n if(MP!=1){\\n pair<ll,ll> p=split(MP,L);\\n // cout<<MP<<\\\" \\\"<<ML<<\\\" \\\"<<L<<\\\" \\\"<<p.first<<\\\" \\\"<<p.second*ML<<endl;\\n MP=p.first;\\n ML*=p.second;\\n }\\n ll D=calcU(N-1,L,euler_phi(MP),ML);\\n D=geom_sum2(L,D,MP*ML);\\n D*=2;\\n D%=(MP*ML);\\n if(D==0)D=MP*ML;\\n return D;\\n}\\n\\n\\n\\n//M=ML*MP, MPとLは直交\\nll calc(ll N,ll L,ll MP,ll ML=1){\\n if(N==0)return 1%(ML*MP);\\n ll u=calcU(N,L,MP,ML);\\n // cout<<u<<\\\" \\\";\\n u*=(L-1);\\n u++;\\n return u%(MP*ML);\\n}\\n\\nll Case=0;\\nvoid solve(ll N,ll M,ll L){\\n Case++;\\n cout<<\\\"Case \\\"<<Case<<\\\": \\\";\\n cout<<calc(N,L,M,1)<<endl;\\n return;\\n}\\n\\nint main(){\\n ll N,M,L;\\n while(cin>>N>>M>>L,N+M+L!=0)solve(N,M,L);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 8036,\n \"score_of_the_acc\": -0.587,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2392_7246911\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\n#pragma warning (disable: 4996)\\n\\nconst long long TEISUU = 100LL;\\nlong long N, M, L;\\nlong long dp1[100009]; // (Answer[i]-1) mod p\\nlong long dp2[100009][69]; // (Answer[i]-1)/(L-1) mod euler(p)\\nvector<long long> List;\\nlong long Modulo_Precount[69][39];\\nlong long Concat_Precount1[69][39];\\nlong long Concat_Precount2[69][39];\\n\\nvoid mod_henkan(long long &a, long long m) {\\n\\tif (a >= TEISUU) {\\n\\t\\tlong long eval = ((a - TEISUU) / m) * m;\\n\\t\\ta -= eval;\\n\\t}\\n}\\n\\nvoid Initialize() {\\n\\tfor (int i = 0; i < (int)List.size(); i++) {\\n\\t\\tModulo_Precount[i][0] = L % List[i];\\n\\t\\tfor (int j = 1; j < 34; j++) {\\n\\t\\t\\tModulo_Precount[i][j] = Modulo_Precount[i][j - 1] * Modulo_Precount[i][j - 1];\\n\\t\\t\\tModulo_Precount[i][j] %= List[i];\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < (int)List.size(); i++) {\\n\\t\\tConcat_Precount1[i][0] = L;\\n\\t\\tConcat_Precount2[i][0] = 1;\\n\\t\\tfor (int j = 1; j < 34; j++) {\\n\\t\\t\\tConcat_Precount2[i][j] = Concat_Precount1[i][j - 1] * Concat_Precount2[i][j - 1] + Concat_Precount2[i][j - 1];\\n\\t\\t\\tConcat_Precount1[i][j] = Concat_Precount1[i][j - 1] * Concat_Precount1[i][j - 1];\\n\\t\\t\\tmod_henkan(Concat_Precount2[i][j], List[i]);\\n\\t\\t\\tmod_henkan(Concat_Precount1[i][j], List[i]);\\n\\t\\t}\\n\\t}\\n}\\n\\n// a^b mod m\\nlong long modpow(long long a, long long b, long long m, int idx) {\\n\\tlong long r = 1;\\n\\tfor (int i = 0; i < 32; i++) {\\n\\t\\tif ((b & (1LL << i)) != 0) { r *= Modulo_Precount[idx][i]; r %= m; }\\n\\t}\\n\\treturn r;\\n}\\n\\n// 1111111111111...111111111111 mod m\\nlong long Concatenate(long long a, long long m, int idx) {\\n\\tlong long ret = 0;\\n\\tfor (int i = 0; i < 32; i++) {\\n\\t\\tif ((a & (1LL << i)) != 0) {\\n\\t\\t\\tret = (ret * Concat_Precount1[idx][i] + Concat_Precount2[idx][i]);\\n\\t\\t\\tmod_henkan(ret, m);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nlong long modpow_Slow(long long a, long long b, long long m) {\\n\\tlong long p = 1, q = a;\\n\\tfor (int i = 0; i < 34; i++) {\\n\\t\\tif ((b & (1LL << i)) != 0) { p *= q; p %= m; }\\n\\t\\tq *= q; q %= m;\\n\\t}\\n\\treturn p;\\n}\\n\\n// 1111111111111...111111111111 mod m\\nlong long Concatenate_Slow(long long a, long long m, long long base) {\\n\\tlong long ret = 0;\\n\\tlong long a1 = base, a2 = 1;\\n\\tfor (int i = 0; i < 34; i++) {\\n\\t\\tif ((a & (1LL << i)) != 0) {\\n\\t\\t\\tret = (ret * a1 + a2);\\n\\t\\t\\tmod_henkan(ret, m);\\n\\t\\t}\\n\\t\\ta2 = (a1 * a2 + a2); mod_henkan(a2, m);\\n\\t\\ta1 = (a1 * a1); mod_henkan(a1, m);\\n\\t}\\n\\treturn ret;\\n}\\n\\nlong long Euler(long long n) {\\n\\tlong long r = n;\\n\\tlong long cur = n;\\n\\tfor (int i = 2; i * i <= n; i++) {\\n\\t\\tif (cur % i != 0) continue;\\n\\t\\tr = (1LL * r * (i - 1)) / (1LL * i);\\n\\t\\twhile (cur % i == 0) { cur /= i; }\\n\\t}\\n\\tif (cur >= 2) {\\n\\t\\tr = (1LL * r * (cur - 1)) / cur;\\n\\t}\\n\\treturn r;\\n}\\n\\nlong long GCD(long long a, long long b) {\\n\\tif (b == 0) return a;\\n\\treturn GCD(b, a % b);\\n}\\n\\nvector<int> yakusuu(int n) {\\n\\tvector<int> ret;\\n\\tfor (int i = 1; i * i <= n; i++) {\\n\\t\\tif (n % i != 0) continue;\\n\\t\\tret.push_back(i);\\n\\t\\tif (i != n / i) ret.push_back(n / i);\\n\\t}\\n\\tsort(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\nlong long solve() {\\n\\tif (N == 0) return 1;\\n\\tif (N == 1) return L % M;\\n\\tif (N == 2) return (2LL * L - 1LL) % M;\\n\\n\\t// Prepare\\n\\tlong long mod1 = M, cx = Euler(M); List.clear(); List.push_back(M);\\n\\twhile (true) {\\n\\t\\tList.push_back(cx);\\n\\t\\tlong long val1 = 2LL * Concatenate_Slow(TEISUU + 0, cx, L);\\n\\t\\tlong long val2 = 2LL * Concatenate_Slow(TEISUU + cx, cx, L);\\n\\t\\tif (val1 == val2) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tvector<int> tmp = yakusuu(Euler(cx));\\n\\t\\t\\tfor (int i = 0; i < (int)tmp.size(); i++) {\\n\\t\\t\\t\\tlong long val3 = 2LL * modpow_Slow(L, TEISUU + 0, cx);\\n\\t\\t\\t\\tlong long val4 = 2LL * modpow_Slow(L, TEISUU + tmp[i], cx);\\n\\t\\t\\t\\tif (val3 == val4) {\\n\\t\\t\\t\\t\\tlong long val5 = 2LL * Concatenate_Slow(TEISUU + tmp[i], cx, L);\\n\\t\\t\\t\\t\\tlong long diff = abs(val1 - val5) % cx;\\n\\t\\t\\t\\t\\tlong long bairitsu = cx / GCD(cx, diff);\\n\\t\\t\\t\\t\\tcx = tmp[i] * bairitsu;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tInitialize();\\n\\n\\t// Initialize\\n\\tfor (int i = 0; i <= N; i++) {\\n\\t\\tdp1[i] = 0;\\n\\t\\tfor (int j = 0; j < (int)List.size(); j++) dp2[i][j] = 0;\\n\\t}\\n\\tdp1[1] = L % mod1;\\n\\tfor (int i = 1; i < (int)List.size(); i++) dp2[1][i] = 1;\\n\\n\\t// Dynamic Programming\\n\\tfor (int i = 2; i <= N; i++) {\\n\\t\\tdp1[i] = 2LL * modpow(L, dp2[i - 1][1], mod1, 0) - 1LL;\\n\\t\\tdp1[i] = (dp1[i] + mod1) % mod1;\\n\\t\\tfor (int j = 1; j < (int)List.size(); j++) {\\n\\t\\t\\tint mod_nex = 1; if (j + 1 < (int)List.size()) mod_nex = List[j + 1];\\n\\t\\t\\tint nex_idx = j; if (j + 1 < (int)List.size()) nex_idx = j + 1;\\n\\t\\t\\tdp2[i][j] = 2LL * Concatenate(dp2[i - 1][nex_idx], List[j], j);\\n\\t\\t\\tmod_henkan(dp2[i][j], List[j]);\\n\\t\\t}\\n\\t}\\n\\treturn dp1[N];\\n}\\n\\nint main() {\\n\\t// FILE* out = freopen(\\\"in1.txt\\\", \\\"w\\\", stdout);\\n\\tfor (int testcase = 1; testcase <= 869120; testcase++) {\\n\\t\\tcin >> N >> M >> L;\\n\\t\\tif (N + M + L == 0) break;\\n\\t\\tlong long ans = solve();\\n\\t\\tcout << \\\"Case \\\" << testcase << \\\": \\\" << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 58096,\n \"score_of_the_acc\": -1.12,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2392_1600664\",\n \"code_snippet\": \"#include<vector>\\n#include<cstdio>\\n#include<cstring>\\n#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\n\\ninline int safeAdd(int a, int b, int m) {\\n\\tif ((long long)a + b >= m) {\\n\\t\\treturn m + ((long long)a + b) % m;\\n\\t} else {\\n\\t\\treturn a + b;\\n\\t}\\n}\\n\\ninline int safeMul(int a, int b, int m) {\\n\\tif ((long long)a * b >= m) {\\n\\t\\treturn m + (long long)a * b % m;\\n\\t} else {\\n\\t\\treturn a * b;\\n\\t}\\n}\\n\\nint powSum(int x, int n, int MOD) {\\n\\tif (n == 0) {\\n\\t\\treturn 0;\\n\\t}\\n\\tint ret = 0, s = 1, t = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tret = safeAdd(ret, safeMul(s, t, MOD), MOD);\\n\\t\\t\\ts = safeMul(s, x, MOD);\\n\\t\\t}\\n\\t\\tt = safeMul(t, safeAdd(x, 1, MOD), MOD);\\n\\t\\tx = safeMul(x, x, MOD);\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint phi(int n) {\\n\\tint ret = 1;\\n\\tfor (int i = 2; i * i <= n; ++i) {\\n\\t\\tif (n % i == 0) {\\n\\t\\t\\tret *= (i - 1);\\n\\t\\t\\tn /= i;\\n\\t\\t\\twhile (n % i == 0) {\\n\\t\\t\\t\\tret *= i;\\n\\t\\t\\t\\tn /= i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (n != 1) {\\n\\t\\tret *= (n - 1);\\n\\t\\tn = 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint l;\\n\\nint getb(int n, int mp, int mq) {\\n\\tint m = mp * mq;\\n\\tif (n == 1) {\\n\\t\\treturn 1;\\n\\t}\\n\\tdo {\\n\\t\\tint g = __gcd(mq, l - 1);\\n\\t\\tif (g == 1) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tmp *= g, mq /= g;\\n\\t} while (true);\\n\\tint bn1;\\n\\tif (mq == 1) {\\n\\t\\tbn1 = 1;\\n\\t\\tfor (int i = 2; i < n; ++i) {\\n\\t\\t\\tint last = bn1;\\n\\t\\t\\tbn1 = safeMul(2, powSum(l, bn1, m), m);\\n\\t\\t\\tif (bn1 == last) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else {\\n\\t\\tbn1 = getb(n - 1, mp, phi(mq));\\n\\t}\\n\\treturn safeMul(2, powSum(l, bn1, m), m);\\n}\\n\\nint main() {\\n\\tint n, m;\\n\\twhile (scanf(\\\"%d%d%d\\\", &n, &m, &l) == 3 && l) {\\n\\t\\tint ans;\\n\\t\\tif (n == 0) {\\n\\t\\t\\tans = 1 % m;\\n\\t\\t} else if (n == 1) {\\n\\t\\t\\tans = l % m;\\n\\t\\t} else {\\n\\t\\t\\tint bn = getb(n, 1, m);\\n\\t\\t\\tans = ((long long)(l - 1) * bn + 1) % m;\\n\\t\\t}\\n\\t\\tstatic int id = 0;\\n\\t\\tprintf(\\\"Case %d: %d\\\\n\\\", ++id, ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -0.5467,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2392_1600627\",\n \"code_snippet\": \"#include<vector>\\n#include<cstdio>\\n#include<cstring>\\n#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\n\\ninline int safeAdd(int a, int b, int m) {\\n\\tif ((long long)a + b >= m) {\\n\\t\\treturn m + ((long long)a + b) % m;\\n\\t} else {\\n\\t\\treturn a + b;\\n\\t}\\n}\\n\\ninline int safeMul(int a, int b, int m) {\\n\\tif ((long long)a * b >= m) {\\n\\t\\treturn m + (long long)a * b % m;\\n\\t} else {\\n\\t\\treturn a * b;\\n\\t}\\n}\\n\\nint powSum(int x, int n, int MOD) {\\n\\tif (n == 0) {\\n\\t\\treturn 0;\\n\\t}\\n\\tint ret = 0, s = 1, t = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tret = safeAdd(ret, safeMul(s, t, MOD), MOD);\\n\\t\\t\\ts = safeMul(s, x, MOD);\\n\\t\\t}\\n\\t\\tt = safeMul(t, safeAdd(x, 1, MOD), MOD);\\n\\t\\tx = safeMul(x, x, MOD);\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint phi(int n) {\\n\\tint ret = 1;\\n\\tfor (int i = 2; i * i <= n; ++i) {\\n\\t\\tif (n % i == 0) {\\n\\t\\t\\tret *= (i - 1);\\n\\t\\t\\tn /= i;\\n\\t\\t\\twhile (n % i == 0) {\\n\\t\\t\\t\\tret *= i;\\n\\t\\t\\t\\tn /= i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (n != 1) {\\n\\t\\tret *= (n - 1);\\n\\t\\tn = 1;\\n\\t}\\n\\treturn ret;\\n}\\n\\nint l;\\n\\nint getb(int n, int mp, int mq) {\\n\\tint m = mp * mq;\\n\\tif (n == 1) {\\n\\t\\treturn 1;\\n\\t}\\n\\tdo {\\n\\t\\tint g = __gcd(mq, l - 1);\\n\\t\\tif (g == 1) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tmp *= g, mq /= g;\\n\\t} while (true);\\n\\tint bn1;\\n\\tif (mq == 1) {\\n\\t\\tbn1 = 1;\\n\\t\\tfor (int i = 2; i < n; ++i) {\\n\\t\\t\\tbn1 = safeMul(2, powSum(l, bn1, m), m);\\n\\t\\t}\\n\\t} else {\\n\\t\\tbn1 = getb(n - 1, mp, phi(mq));\\n\\t}\\n\\treturn safeMul(2, powSum(l, bn1, m), m);\\n}\\n\\nint main() {\\n\\tint n, m;\\n\\twhile (scanf(\\\"%d%d%d\\\", &n, &m, &l) == 3 && l) {\\n\\t\\tint ans;\\n\\t\\tif (n == 0) {\\n\\t\\t\\tans = 1 % m;\\n\\t\\t} else if (n == 1) {\\n\\t\\t\\tans = l % m;\\n\\t\\t} else {\\n\\t\\t\\tint bn = getb(n, 1, m);\\n\\t\\t\\tans = ((long long)(l - 1) * bn + 1) % m;\\n\\t\\t}\\n\\t\\tstatic int id = 0;\\n\\t\\tprintf(\\\"Case %d: %d\\\\n\\\", ++id, ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1150,\n \"memory_kb\": 1188,\n \"score_of_the_acc\": -1,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2392_1375520\",\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;\\ntypedef long long ll;\\nll a[100010];\\nll b[100010];\\nll c[100010];\\nll s[100010];\\nll m[100010];\\nll gcd(ll x,ll y){\\n\\tif(y==0) return x;\\n\\treturn gcd(y,x%y);\\n}\\nll ex(ll x,ll p,ll mod){\\n\\tll a=1;\\n\\twhile(p){\\n\\t\\tif(p%2) a=a*x%mod;\\n\\t\\tx=x*x%mod;\\n\\t\\tp/=2;\\n\\t}\\n\\treturn a;\\n}\\nll geo(ll x,ll p,ll mod){\\t//1+x+..+x^(p-1)\\n\\tif(p==0) return 0;\\n\\tll a=0,s=1,t=1;\\n\\twhile(p){\\n\\t\\tif(p%2){\\n\\t\\t\\ta=(a+s*t)%mod;\\n\\t\\t\\ts=s*x%mod;\\n\\t\\t}\\n\\t\\tt=t*(1+x)%mod;\\n\\t\\tx=x*x%mod;\\n\\t\\tp/=2;\\n\\t}\\n\\treturn a;\\n}\\ntypedef pair<int,int> P;\\nll getord(ll M,ll a){\\n\\tll H=sqrt(M)+1;\\n\\tvector<P> babies;\\n\\tll p=1;\\n\\trep(i,H){\\n\\t\\tbabies.pb(P(p,i));\\n\\t\\tp=p*a%M;\\n\\t}\\n\\tll q=p;\\n\\tsort(all(babies));\\n\\trep1(i,H){\\n\\t\\tint pos=upper_bound(all(babies),P(p,H))-babies.begin()-1;\\n\\t\\tif(pos>=0&&babies[pos].fs==p) return i*H-babies[pos].sc;\\n\\t\\tp=p*q%M;\\n\\t}\\n}\\nll pre,parg;\\nvoid getnext(ll M,ll L,int id){\\n\\tll p=L;\\n\\tll gs[101];\\n\\tgs[0]=1;\\n\\trep(i,100){\\n\\t\\tgs[i+1]=gcd(p,M);\\n\\t\\tif(gs[i]==gs[i+1]){\\n\\t\\t\\ta[id]=i;\\n\\t\\t\\ts[id]=geo(L,i,M);\\n\\t\\t\\tll g=gs[i];\\n\\t\\t\\tc[id]=ex(L,i,M);\\n\\t\\t\\tM/=g;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tp=p*L%M;\\n\\t}\\n\\tif(M==pre){\\n\\t\\tm[id]=parg;\\n\\t\\treturn;\\n\\t}\\n\\tll o=getord(M,L);\\n\\tll ss=geo(L,o,M);\\n\\tm[id]=M/gcd(M,ss)*o;\\n\\tpre=M,parg=m[id];\\n}\\nll getans(ll b,ll M,ll L){\\n\\treturn (2*ex(L,b,M)+M-1)%M;\\n}\\nint solve(ll N,ll M,ll L){\\n\\tpre=-1;\\n\\tif(N==0) return 1;\\n\\tif(N==1) return L%M;\\n\\tif(N==2) return getans(1,M,L);\\n\\tif(N==3) return getans(2,M,L);\\n\\tif(N==4) return getans(2*(L+1),M,L);\\n\\tN++;\\n\\tm[N]=M;\\n\\tfor(ll x=N-1;x>=4;x--){\\n\\t\\tgetnext(m[x+1],L,x);\\n\\t}\\n\\tb[4]=2*(L+1)%m[4];\\n\\tfor(ll x=4;x<N;x++){\\n\\t\\tll p=(b[x]-a[x])%m[x];\\n\\t\\tif(p<0) p+=m[x];\\n\\t\\tb[x+1]=2*(s[x]+c[x]*geo(L,p,m[x+1]))%m[x+1];\\n\\t}\\n\\treturn (b[N]*(L-1)+1)%M;\\n}\\nint main(){\\n\\tfor(int t=1;;t++){\\n\\t\\tll N,M,L;\\n\\t\\tcin>>N>>M>>L;\\n\\t\\tif(M==0) break;\\n\\t\\tprintf(\\\"Case %d: %d\\\\n\\\",t,solve(N,M,L));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 5524,\n \"score_of_the_acc\": -0.0762,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1362,"cells":{"group_id":{"kind":"string","value":"aoj_2394_cpp"},"problem_description":{"kind":"string","value":"Longest Lane\nMr. KM, the mayor of KM city, decided to build a new elementary school.\nThe site for the school has an awkward polygonal shape, which caused several problems.\nThe most serious problem was that there was not enough space for a short distance racetrack.\nYour task is to help Mr. KM to calculate the maximum possible length for the racetrack\nthat can be built in the site.\nThe track can be considered as a straight line segment whose width can be ignored.\nThe boundary of the site has a simple polygonal shape without self-intersection,\nand the track can touch the boundary.\nNote that the boundary might not be convex.\nInput\nThe input consists of multiple test cases, followed by a line containing \"0\".\nEach test case has the following format.\nThe first line contains an integer\nN\n(\n3 \\leq N \\leq 100\n).\nEach of the following\nN\nlines contains two integers\nx_i\nand\ny_i\n(\n-1,000 \\leq x_i, y_i \\leq 1,000\n),\nwhich describe the coordinates of a vertex of the polygonal border of the site, in counterclockwise order.\nOutput\nFor each test case, print its case number and the maximum possible length of the track in a line.\nThe answer should be given as a floating point number with an absolute error of at most\n10^{-6}\n.\nSample Input\n4\n0 0\n10 0\n10 10\n0 10\n3\n0 0\n1 0\n0 1\n0\nOutput for the Sample Input\nCase 1: 14.142135624\nCase 2: 1.41421356"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2394_10853935","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<cassert>\n#define N 110\n#define eps 1e-5\nusing namespace std;\n\nint dlcmp(double x) {return x<-eps?-1:x>eps;}\ndouble sqr(double x) {return x*x;}\n\nstruct Point\n{\n\tdouble x,y;\n\n\tPoint (){}\n\tPoint (double a,double b):x(a),y(b){}\n\n\tvoid input() {scanf(\"%lf%lf\",&x,&y);}\n\n\tPoint operator + (const Point &p) const {return Point(x+p.x,y+p.y);}\n\tPoint operator - (const Point &p) const {return Point(x-p.x,y-p.y);}\n\n\tdouble len() {return sqrt(sqr(x)+sqr(y));}\n\tPoint trunc(double d) {d/=len(); return Point(x*d,y*d);}\n};\n\ndouble cross(Point a,Point b) {return a.x*b.y-b.x*a.y;}\ndouble dot(Point a,Point b) {return a.x*b.x+a.y*b.y;}\ndouble dis(Point a,Point b) {return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));}\n\nPoint pt[N];\nvector<double>vec;\nint n;\n\n/*\n// 0 in-in; 1 in-out; 2 out-in; 3 out-out\nint check(Point s,Point e,Point a,Point o,Point b)\n{\n\tPoint v=e-s;\n\n\tif (dlcmp(vec,a-o)<=0&&dlcmp(vec,b-o)<=0)\n\t\treturn 0;\n\telse if (dlcmp(vec,a-o)>0&&dlcmp(vec,b-o)>0)\n\t\treturn 3;\n\telse if\n*/\n\nint segment_intersect(Point s1,Point e1,Point s2,Point e2)\n{\n\tif (dlcmp(cross(e1-s1,s2-s1))*dlcmp(cross(e1-s1,e2-s1))<0&&\n\t\tdlcmp(cross(e2-s2,s1-s2))*dlcmp(cross(e2-s2,e1-s2))<0)\n\t\treturn 1;\n\telse\n\t\treturn 0;\n}\n\nPoint interpoint_lines(Point s1,Point e1,Point s2,Point e2)\n{\n\tPoint v1,v2,res;\n\n\tv1=s1-e1; v2=s2-e2;\n\n\tdouble r=((s1.x-s2.x)*v2.y-(s1.y-s2.y)*v2.x)/(v1.x*v2.y-v2.x*v1.y);\n\tres.x=-r*v1.x+s1.x;\n\tres.y=-r*v1.y+s1.y;\n\treturn res;\n}\nbool isChange(Point s,Point e,Point a,Point o,Point b)\n{\n\tPoint vec=e-s;\n\n\tif (dlcmp(cross(vec,a-o))*dlcmp(cross(vec,b-o))<0)\n\t\treturn true;\n\telse\n\t\treturn false;\n}\n\nvoid init()\n{\n\tint i,cnt=0;\n\n\tcnt=2;\n\tfor (i=2;i<n;i++)\n\t{\n\t\twhile (cnt>1&&dlcmp(cross(pt[cnt-1]-pt[cnt-2],pt[i]-pt[cnt-1]))==0)\n\t\t\tcnt--;\n\t\tpt[cnt++]=pt[i];\n\t}\n\tn=cnt;\n}\n\nvoid solve(Point s,Point e,Point a,Point b,Point p,Point q)\n{\n\tint dp,dq;\n\n\tdp=dlcmp(cross(e-s,p-a));\n\tdq=dlcmp(cross(e-s,q-b));\n\tif (dlcmp(dot(e-s,b-a))<0)\n\t{\n\t\tdp=-dp; dq=-dq;\n\t}\n\n\n\tif(dp>0&&dq>0)\n\t{\n\t\tvec.push_back(dis(s,a));\n\t\tvec.push_back(dis(s,b));\n\t\t//printf(\"put3 %.3f %.3f\\n\",a.x,a.y);\n\t\t//printf(\"put3 %.3f %.3f\\n\",b.x,b.y);\n\t}\n\telse if (dp>0&&dq<0)\n\t{\n\t\tvec.push_back(dis(s,a));\n\t\t//printf(\"put3 %.3f %.3f\\n\",a.x,a.y);\n\t}\n\telse if (dp<0&&dq>0)\n\t{\n\t\tvec.push_back(dis(s,b));\n\t\t//printf(\"put3 %.3f %.3f\\n\",b.x,b.y);\n\t}\n}\n\n\nint main()\n{\n\tint i,j,k,m;\n\tdouble ans,tmp;\n\tPoint s,e,a,b,o,aa,bb;\n\n\tint ys=0;\n\n\twhile(scanf(\"%d\",&n),n)\n\t{\n\t\tfor (i=0;i<n;i++)\n\t\t\tpt[i].input();\n\n\t\tinit();\n\t\t//printf(\"n %d\\n\",n);\n\t\t//for (i=0;i<n;i++)\n\t\t\t//printf(\"%.2f %.2f\\n\",pt[i].x,pt[i].y);\n\n\t\tans=0;\n\t\tfor (i=0;i<n;i++)\n\t\t\tfor (j=0;j<n;j++)\n\t\t\t{\n\t\t\t\tif (i==j) continue;\n\t\t\t\t//printf(\"i%d j%d\\n\",i,j);\n\t\t\t\ts=pt[i]+(pt[i]-pt[j]).trunc(5000); e=pt[j]+(pt[j]-pt[i]).trunc(5000);\n\n\t\t\t\tvec.clear();\n\t\t\t\tfor (k=0;k<n;k++)\n\t\t\t\t{\n\t\t\t\t\ta=pt[k]; b=pt[(k+1)%n];\n\n\t\t\t\t\tif (segment_intersect(s,e,a,b))\n\t\t\t\t\t{\n\t\t\t\t\t\tPoint p=interpoint_lines(s,e,a,b);\n\t\t\t\t\t\t//printf(\"put1 %.3f %.3f\\n\",p.x,p.y);\n\t\t\t\t\t\tvec.push_back(dis(s,p));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor (k=0;k<n;k++)\n\t\t\t\t{\n\t\t\t\t\to=pt[k]; a=pt[(k-1+n)%n]; b=pt[(k+1)%n];\n\n\t\t\t\t\tif (dlcmp(cross(e-s,o-s))==0&&isChange(s,e,a,o,b))\n\t\t\t\t\t{\n\t\t\t\t\t\t//printf(\"put2 %.3f %.3f %.3f\\n\",o.x,o.y,dis(s,o));\n\t\t\t\t\t\tvec.push_back(dis(s,o));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tfor (k=0;k<n;k++)\n\t\t\t\t{\n\t\t\t\t\ta=pt[k]; b=pt[(k+1)%n],aa=pt[(k-1+n)%n]; bb=pt[(k+2)%n];\n\n\t\t\t\t\tif (dlcmp(cross(e-s,a-s))==0&&dlcmp(cross(e-s,b-s))==0)\n\t\t\t\t\t{\n\t\t\t\t\t\tPoint f1=e-s, f2=b-a;\n\t\t\t\t\t\t//printf(\"true k %d %.3f %.3f %.3f %.3f\\n\",k,f1.x,f1.y,f2.x,f2.y);\n\t\t\t\t\t\tsolve(s,e,a,b,aa,bb);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsort(vec.begin(),vec.end());\n\t\t\t\tm=vec.size(); assert(m%2==0);\n\t\t\t\ttmp=0;\n\t\t\t\tfor (k=0;k<m;k+=2)\n\t\t\t\t\ttmp=max(tmp,vec[k+1]-vec[k]);\n\n\t\t\t\tans=max(ans,tmp);\n\t\t\t}\n\n\t\tprintf(\"Case %d: %.8f\\n\",++ys,ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":2936,"score_of_the_acc":-0.6356,"final_rank":4},{"submission_id":"aoj_2394_10498050","code_snippet":"// AOJ 2394 Longest Lane\n// 2025.5.18\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ld = long double;\nconst ld EPS = 1e-9;\n\nstruct P { ld x, y; };\n\ninline P operator-(const P &a, const P &b) { return {a.x - b.x, a.y - b.y}; }\ninline ld dot(const P &a, const P &b) { return a.x*b.x + a.y*b.y; }\ninline ld crs(const P &a, const P &b) { return a.x*b.y - a.y*b.x; }\ninline ld crs(const P &a, const P &b, const P &c) {\n return crs({b.x - a.x, b.y - a.y}, {c.x - a.x, c.y - a.y});\n}\n\nint sgn(ld v){ return v < -EPS ? -1 : (v > EPS ? 1 : 0); }\nint ccw(const P &a, const P &b, const P &c){ return sgn(crs(a,b,c)); }\n\nvector<ld> cplt(const vector<P> &ps, const P &a, const P &b){\n int n = ps.size();\n P dir = b - a;\n vector<ld> pos;\n for(int i = 0; i < n; i++){\n P p = ps[i];\n P q = ps[(i+1)%n];\n P r = ps[(i-1+n)%n];\n int sa = ccw(a,b,p), sb = ccw(a,b,q);\n if (sa * sb == -1) {\n ld denom = crs(dir, q - p);\n if (sgn(denom) != 0) pos.push_back(crs(p,q,a) / denom);\n }\n if (sa == 0) {\n int sc = ccw(a,b,r);\n if (sb != sc && (sb*sc < 0 || ccw(p,q,r) > 0))\n pos.push_back(dot(p - a, dir) / dot(dir, dir));\n }\n }\n sort(pos.begin(), pos.end());\n return pos;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, tc = 1;\n while ( (cin >> N) && N ){\n vector<P> poly(N);\n for(int i = 0; i < N; i++) cin >> poly[i].x >> poly[i].y;\n\n ld ans = 0;\n for(int i = 0; i < N; i++){\n for(int j = 0; j < i; j++){\n P a = poly[i], b = poly[j];\n auto pos = cplt(poly, a, b);\n if (pos.size() < 2) continue;\n ld L = sqrtl(dot(b - a, b - a));\n for(int k = 0; k+1 < (int)pos.size(); k += 2){\n ld len = (pos[k+1] - pos[k]) * L;\n ans = max(ans, len);\n }\n }\n }\n cout << \"Case \" << tc++ << \": \"\n << fixed << setprecision(10)\n << (double)ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3424,"score_of_the_acc":-0.7877,"final_rank":8},{"submission_id":"aoj_2394_8998659","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)\n#define rep(i,b) rng(i,0,b)\n#define repn(i,b) rng(i,1,b+1)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(),x.end()\n#define si(x) (int)(x.size())\n#define mp make_pair\n\n#define tct template<class t>\ntct using vc=vector<t>;\nusing vi=vc<int>;\n#define tctu template<class t,class u>\ntctu bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\ntctu bool chmin(t&a,u b){if(a>b){a=b;return true;}else return false;}\n\nusing P=pair<int,int>;\n#define a first\n#define b second\nusing ld = long double;\nconst ld PI = acos((ld)-1);\nconst ld eps = 1e-9;\n\nint sgn(ld a){ return a<-eps?-1:(a>eps?1:0); }\nint sgn(ld a, ld b){ return sgn(a-b); }\n\nusing pt = complex<ld>;\n#define x real()\n#define y imag()\n\nusing ln=pair<pt,pt>;\npt dir(ln a){ return a.b-a.a; }\nld dot(const pt&a,const pt&b){ return a.x*b.x+a.y*b.y; }\nld crs(const pt&a,const pt&b){ return a.x*b.y-a.y*b.x; }\nld crs(const pt&a,const pt&b,const pt&c){ return crs(b-a,c-a); }\nint ccw(const pt&a,const pt&b){ return sgn(crs(a,b)); }\nint ccw(const pt&a,const pt&b,const pt&c){ return ccw(b-a,c-a); }\nint ccw(const ln&a, const pt&b){ return ccw(a.a, a.b, b); }\nld cllt(ln a, ln b){\n\treturn crs(b.a,b.b,a.a)/crs(dir(a),dir(b));\n}\nvc<ld>cplt(const vc<pt>&ps, ln z){\n\tint n=si(ps);\n\tvc<ld>pos;\n\trep(i,n){\n\t\tpt p=ps[i],q=ps[(i+1)%n],r=ps[(i+n-1)%n];\n\t\tint a=ccw(z,p),b=ccw(z,q);\n\t\tif(a*b==-1) pos.pb(cllt(z,ln(p,q)));\n\t\tif(a==0){\n\t\t\tint c=ccw(z,r);\n\t\t\tif(b!=c&&(b*c<0||ccw(p,q,r)>0)) pos.pb(dot(ps[i]-z.a,dir(z))/norm(dir(z)));\n\t\t}\n\t}\n\tsort(all(pos));\n\treturn pos;\n}\nint n;\nvoid solve(){\n\tvc<pt>vec(n);\n\trep(i,n){\n\t\tld p,q;cin>>p>>q;\n\t\tvec[i] = pt(p,q);\n\t}\n\tld ans = 0;\n\trep(i,n) rep(j,i){\n\t\tln z = mp(vec[i], vec[j]);\n\t\tauto info = cplt(vec, z);\n\t\tfor(int a=0;a<si(info);a+=2){\n\t\t\tchmax(ans, (info[a+1]-info[a]) * abs(vec[i]-vec[j]));\n\t\t}\n\t}\n\tcout << ans << '\\n';\n}\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\tint t; \n\trng(i,1,1000000){\n\t\tcin>>n; if(!n) return 0;\n\t\tcout << \"Case \"<<i<<\": \"; solve();\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":3572,"score_of_the_acc":-0.8293,"final_rank":12},{"submission_id":"aoj_2394_7151684","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double eps = 0.000001;\nconst double INF = 100000000;\nint sign(double x){\n if (x > eps){\n return 1;\n } else if (x < -eps){\n return -1;\n } else {\n return 0;\n }\n};\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator +(point P){\n return point(x + P.x, y + P.y);\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dist(point P, point Q){\n return abs(Q - P);\n}\ndouble dot(point P, point Q){\n return P.x * Q.x + P.y * Q.y;\n}\ndouble cross(point P, point Q){\n return P.x * Q.y - P.y * Q.x;\n}\nbool point_in_angle(point A, point B, point C, point P){\n B = B - A;\n C = C - A;\n P = P - A;\n if (abs(cross(B, P)) < eps && dot(B, P) > 0){\n return true;\n }\n if (abs(cross(C, P)) < eps && dot(C, P) > 0){\n return true;\n }\n if (abs(cross(B, C)) < eps){\n if (dot(B, C) > 0){\n return false;\n } else {\n return cross(B, P) > 0;\n }\n }\n if (cross(B, C) > 0){\n return cross(B, P) > 0 && cross(P, C) > 0;\n } else {\n return cross(B, P) > 0 || cross(P, C) > 0;\n }\n}\nstruct line{\n point A, B;\n line(point A, point B): A(A), B(B){\n }\n};\npoint vec(line L){\n return L.B - L.A;\n}\nbool segment_line_intersect(line L1, line L2){\n return sign(cross(L2.A - L1.A, vec(L1))) * sign(cross(L2.B - L1.A, vec(L1))) < 0;\n}\nbool segment_intersect(line L1, line L2){\n return segment_line_intersect(L1, L2) && segment_line_intersect(L2, L1);\n}\nint main(){\n cout << fixed << setprecision(10);\n int T = 0;\n while (true){\n int N;\n cin >> N;\n if (N == 0){\n break;\n }\n vector<point> P(N * 2);\n for (int i = 0; i < N; i++){\n cin >> P[i].x >> P[i].y;\n }\n for (int i = 0; i < N; i++){\n P[N + i] = P[i];\n }\n double ans = 0;\n for (int i = 1; i <= N; i++){\n for (int j = i + 1; j < i + N - 1; j++){\n double mn = -INF, mx = INF;\n bool ok = true;\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[j])){\n ok = false;\n }\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[i] + (P[i] - P[j]))){\n mn = 0;\n }\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[i])){\n ok = false;\n }\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[j] + (P[j] - P[i]))){\n mx = 1;\n }\n for (int k = 0; k < N; k++){\n if (k != i - 1 && k != i % N && k != (j - 1) % N && k != j % N){\n if (segment_line_intersect(line(P[i], P[j]), line(P[k], P[k + 1]))){\n double r = cross(P[k] - P[i], P[k + 1] - P[k]) / cross(P[j] - P[i], P[k + 1] - P[k]);\n if (r < eps){\n mn = max(mn, r);\n } else if (r > 1 - eps){\n mx = min(mx, r);\n } else {\n ok = false;\n }\n }\n }\n }\n for (int k = 0; k < N; k++){\n if (k != i % N && k != j % N){\n if (abs(cross(P[k] - P[i], P[j] - P[i])) < eps){\n if (!point_in_angle(P[k], P[k + 1], P[k + N - 1], P[k] + P[i] - P[j]) || !point_in_angle(P[k], P[k + 1], P[k + N - 1], P[k] + P[j] - P[i])){\n if (dot(P[k] - P[i], P[j] - P[i]) < 0){\n mn = max(mn, -abs(P[k] - P[i]) / abs(P[j] - P[i]));\n } else if (dot(P[k] - P[j], P[j] - P[i]) > 0){\n mx = min(mx, abs(P[k] - P[i]) / abs(P[j] - P[i]));\n } else {\n ok = false;\n }\n }\n }\n }\n }\n if (ok){\n ans = max(ans, (mx - mn) * dist(P[i], P[j]));\n }\n }\n }\n cout << \"Case \" << T + 1 << \": \" << ans << endl;\n T++;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3468,"score_of_the_acc":-0.815,"final_rank":10},{"submission_id":"aoj_2394_7151671","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double eps = 0.000001;\nconst double INF = 100000000;\nint sign(double x){\n if (x > eps){\n return 1;\n } else if (x < -eps){\n return -1;\n } else {\n return 0;\n }\n};\nstruct point{\n double x, y;\n point(){\n }\n point(double x, double y): x(x), y(y){\n }\n point operator +(point P){\n return point(x + P.x, y + P.y);\n }\n point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble dist(point P, point Q){\n return abs(Q - P);\n}\ndouble dot(point P, point Q){\n return P.x * Q.x + P.y * Q.y;\n}\ndouble cross(point P, point Q){\n return P.x * Q.y - P.y * Q.x;\n}\nbool point_in_angle(point A, point B, point C, point P){\n B = B - A;\n C = C - A;\n P = P - A;\n if (abs(cross(B, P)) < eps && dot(B, P) > 0){\n return true;\n }\n if (abs(cross(C, P)) < eps && dot(C, P) > 0){\n return true;\n }\n if (abs(cross(B, C)) < eps){\n if (dot(B, C) > 0){\n return false;\n } else {\n return cross(B, P) > 0;\n }\n }\n if (cross(B, C) > 0){\n return cross(B, P) > 0 && cross(P, C) > 0;\n } else {\n return cross(B, P) > 0 || cross(P, C) > 0;\n }\n}\nstruct line{\n point A, B;\n line(point A, point B): A(A), B(B){\n }\n};\npoint vec(line L){\n return L.B - L.A;\n}\nbool segment_line_intersect(line L1, line L2){\n return sign(cross(L2.A - L1.A, vec(L1))) * sign(cross(L2.B - L1.A, vec(L1))) < 0;\n}\nbool segment_intersect(line L1, line L2){\n return segment_line_intersect(L1, L2) && segment_line_intersect(L2, L1);\n}\nint main(){\n cout << fixed << setprecision(10);\n int T = 0;\n while (true){\n int n;\n cin >> n;\n if (n == 0){\n break;\n }\n vector<point> P(n * 2);\n for (int i = 0; i < n; i++){\n cin >> P[i].x >> P[i].y;\n }\n for (int i = 0; i < n; i++){\n P[n + i] = P[i];\n }\n double ans = 0;\n for (int i = 1; i <= n; i++){\n for (int j = i + 1; j < i + n - 1; j++){\n double mn = -INF, mx = INF;\n bool ok = true;\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[j])){\n ok = false;\n }\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[i] + (P[i] - P[j]))){\n mn = 0;\n }\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[i])){\n ok = false;\n }\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[j] + (P[j] - P[i]))){\n mx = 1;\n }\n for (int k = 0; k < n; k++){\n if (k != i - 1 && k != i % n && k != (j - 1) % n && k != j % n){\n if (segment_line_intersect(line(P[i], P[j]), line(P[k], P[k + 1]))){\n double r = cross(P[k] - P[i], P[k + 1] - P[k]) / cross(P[j] - P[i], P[k + 1] - P[k]);\n if (r < eps){\n mn = max(mn, r);\n } else if (r > 1 - eps){\n mx = min(mx, r);\n } else {\n ok = false;\n }\n }\n }\n }\n for (int k = 0; k < n; k++){\n if (k != i % n && k != j % n){\n if (abs(cross(P[k] - P[i], P[j] - P[i])) < eps){\n if (!point_in_angle(P[k], P[k + 1], P[k + n - 1], P[k] + P[i] - P[j]) || !point_in_angle(P[k], P[k + 1], P[k + n - 1], P[k] + P[j] - P[i])){\n if (dot(P[k] - P[i], P[j] - P[i]) < 0){\n mn = max(mn, -abs(P[k] - P[i]) / abs(P[j] - P[i]));\n } else if (dot(P[k] - P[j], P[j] - P[i]) > 0){\n mx = min(mx, abs(P[k] - P[i]) / abs(P[j] - P[i]));\n } else {\n ok = false;\n }\n }\n }\n }\n }\n if (ok){\n ans = max(ans, (mx - mn) * dist(P[i], P[j]));\n }\n }\n }\n cout << \"Case \" << T + 1 << \": \" << ans << endl;\n T++;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3576,"score_of_the_acc":-0.8537,"final_rank":13},{"submission_id":"aoj_2394_6163031","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 = 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;\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 << 10;\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\ntypedef complex<ld> Point;\nld dot(Point a, Point b) { return real(conj(a) * b); }\nld cross(Point a, Point b) { return imag(conj(a) * b); }\nnamespace std {\n\tbool operator<(const Point& lhs, const Point& rhs) {\n\t\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\n\t}\n}\nstruct Line {\n\tPoint a, b;\n};\nstruct Circle {\n\tPoint p; ld r;\n};\nint ccw(Point a, Point b, Point c) {\n\tb -= a; c -= a;\n\tif (cross(b, c) > eps)return 1;//counter clockwise\n\tif (cross(b, c) < -eps)return -1;//clock wise\n\tif (dot(b, c) < 0)return 2;//c--a--b on line\n\tif (norm(b) < norm(c))return -2;//a--b--c on line\n\treturn 0; //a--c--b on line\n}\nbool eq(ld a, ld b) {\n\treturn abs(a - b) < eps;\n}\n//2直線の交差判定\nbool isis_ll(Line l, Line m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n//直線と線分の交差判定\n//bool isis_ls(Line l, Line s) {\n//\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n//}\n//直線と線分の交差判定2\nbool isis_ls(Line l, Line s) {\n\t//return ccw(l.a, l.b, s.a) * ccw(l.a, l.b, s.b) !=1;\n\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n//点が直線上に存在するか\nbool isis_lp(Line l, Point p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n//点が線分上に存在するか\nbool isis_sp(Line s, Point p) {\n\t//誤差がisis_lpに比べて大きいので、できるだけisis_lpを使う\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n//線分と線分の交差判定\n//bool isis_ss(Line s, Line t) {\n//\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\n//}\n//線分と線分の交差判定2\nbool isis_ss(Line s, Line t) {\n\treturn 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//点から直線への垂線の足\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}\n//直線と直線の交点\n//平行な２直線に対しては使うな！！！！\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n//直線と点の距離\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n//直線と直線の距離\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n//線分と直線の距離\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n//線分と点の距離\nld dist_sp(Line s, Point p) {\n\tPoint r = proj(s, p);\n\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\n}\n//線分と線分の距離\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t))return 0;\n\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\n}\n//線分と線分の交点、平行な場合は端点両方\nvector<Point> is_ss(Line s1, Line s2) {\n\tif (!isis_ss(s1, s2))return {};\n\tvector<Point> res;\n\tif (abs(cross(s1.b - s1.a, s2.b - s2.a)) < eps) {\n\t\tif (isis_sp(s1, s2.a)) res.push_back(s2.a);\n\t\tif (isis_sp(s1, s2.b)) res.push_back(s2.b);\n\t\tif (isis_sp(s2, s1.a)) res.push_back(s1.a);\n\t\tif (isis_sp(s2, s1.b)) res.push_back(s1.b);\n\t}\n\telse {\n\t\tres.push_back(is_ll(s1, s2));\n\t}\n\treturn res;\n}\n\nusing polygon = vector<Point>;\n//0 -> on polygon, 1-> in polygon, 2-> out polygon\nint is_in_polygon(polygon& poly, Point p) {\n\tld sum = 0;\n\tint n = poly.size();\n\trep(i, n) {\n\t\tint ni = i + 1 == n ? 0 : i + 1;\n\t\tPoint pl = poly[i];\n\t\tPoint pr = poly[ni];\n\t\tLine e = { pl,pr };\n\t\tif (isis_sp(e, p))return 0;\n\t\tsum += arg((pr - p) / (pl - p));\n\t}\n\tif (abs(sum) < pi / 2)return 2;\n\treturn 1;\n}\nbool edge_in_polygon(polygon& poly, Line l) {\n\tPoint s = l.a, t = l.b;\n\tif (is_in_polygon(poly, s) == 2 || is_in_polygon(poly, t) == 2)return false;\n\tvector<ld> ts;\n\tint n = poly.size();\n\trep(i, n) {\n\t\tint ni = i + 1 == n ? 0 : i + 1;\n\t\tPoint pl = poly[i];\n\t\tPoint pr = poly[ni];\n\t\tLine e = { pl,pr };\n\t\tvector<Point> vp = is_ss(l, e);\n\t\tfor (Point p : vp) {\n\t\t\tld val = abs(p - s) / abs(t - s);\n\t\t\tts.push_back(val);\n\t\t}\n\t}\n\tts.push_back(0);\n\tts.push_back(1);\n\tsort(all(ts));\n\trep(i, ts.size() - 1) {\n\t\tld x = (ts[i] + ts[i + 1]) / 2;\n\t\tPoint c = s + (t - s) * x;\n\t\tif (is_in_polygon(poly, c) == 2)return false;\n\t}\n\treturn true;\n}\n\nint tmp = 0;\nvoid outputx() {\n\tcout << \"Case \" << tmp << \": \";\n}\nint n;\nvoid solve() {\n\ttmp++;\n\tpolygon p(n);\n\trep(i, n) {\n\t\tint x, y; cin >> x >> y;\n\t\tp[i] = { (ld)x,(ld)y };\n\t}\n\tld ans = 0;\n\trep(i, n)Rep(j, i + 1, n) {\n\t\tLine l = { p[i],p[j] };\n\t\tif (!edge_in_polygon(p, l))continue;\n\t\tvector<ld> ts;\n\t\trep(k, n) {\n\t\t\tint nk = k + 1 == n ? 0 : k + 1;\n\t\t\tif (isis_ll(l, { p[k],p[nk] })&&isis_ls(l, { p[k],p[nk] })) {\n\t\t\t\tPoint pp = is_ll(l, { p[k], p[nk] });\n\t\t\t\t//cout << \"? \" << pp << \"\\n\";\n\t\t\t\tld val = abs(pp - p[i]) / abs(p[j] - p[i]);\n\t\t\t\tif (ccw(p[i], p[j], pp) == 2)val *= -1;\n\t\t\t\tts.push_back(val);\n\t\t\t}\n\t\t}\n\t\tsort(all(ts));\n\t\tPoint cl = p[i], cr = p[j];\n\t\trep(k, ts.size()) {\n\t\t\tif (ts[k] < 1 + eps)continue;\n\t\t\tPoint z = p[i] + (p[j] - p[i]) * ts[k];\n\t\t\tPoint mid = (cr + z); mid /= 2;\n\t\t\tif (is_in_polygon(p, mid)==2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcr = z;\n\t\t}\n\t\tper(k, ts.size()) {\n\t\t\tif (ts[k] > -eps)continue;\n\t\t\tPoint z = p[i] + (p[j] - p[i]) * ts[k];\n\t\t\tPoint mid = (cl + z); mid /= 2;\n\t\t\tif (is_in_polygon(p, mid)==2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcl=z;\n\t\t}\n\t\t//cout << cl << \" \" << cr << \"\\n\";\n\t\tchmax(ans, abs(cl - cr));\n\t}\n\toutputx();\n\tcout << ans << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << 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\twhile(cin>>n,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":890,"memory_kb":3600,"score_of_the_acc":-1.8393,"final_rank":20},{"submission_id":"aoj_2394_4804246","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 10005\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\t\treturn x != p.x? x < p.x: y < p.y;\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\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\tvoid 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\nint N;\nint num_case = 1;\nPolygon P;\ndouble NUM = 200000;\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\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\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\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.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\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\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\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nbool isSame(Point a,Point b){\n\n\treturn abs(a-b) < EPS;\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n\nvoid func(){\n\n\tP.clear();\n\n\tdouble x,y;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tP.push_back(Point(x,y));\n\t}\n\n\tLine bottom,proj_line,calc_line;\n\tvector<Line> L;\n\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tL.push_back(Line(P[i],P[k]));\n\t\t}\n\t}\n\n\tVector vec_next,vec_pre;\n\n\tdouble ans = 0;\n\n\tLine tmp_line,work_line;\n\tPoint cross_point,base_p;\n\n\tvector<Point> V;\n\n\tfor(int i = 0; i < L.size(); i++){\n\t\tV.clear();\n\n\t\tdouble slope = calc_slope(L[i]);\n\n\t\t//両方向に直線を伸ばす\n\n\t\tif(fabs(slope-DBL_MAX) < EPS){ //垂直\n\n\t\t\twork_line = Line(Point(L[i].p[0].x,-NUM),Point(L[i].p[0].x,NUM));\n\n\t\t}else if(fabs(slope) < EPS){ //水平\n\n\t\t\twork_line = Line(Point(-NUM,L[i].p[0].y),Point(NUM,L[i].p[0].y));\n\n\t\t}else{\n\n\t\t\tif(L[i].p[0].x > L[i].p[1].x){\n\n\t\t\t\twork_line.p[0] = Point(L[i].p[0].x+NUM,L[i].p[0].y+NUM*slope);\n\t\t\t\twork_line.p[1] = Point(L[i].p[1].x-NUM,L[i].p[1].y-NUM*slope);\n\n\t\t\t}else{\n\n\t\t\t\twork_line.p[0] = Point(L[i].p[1].x+NUM,L[i].p[1].y+NUM*slope);\n\t\t\t\twork_line.p[1] = Point(L[i].p[0].x-NUM,L[i].p[0].y-NUM*slope);\n\t\t\t}\n\t\t}\n\n\t\tV.clear();\n\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\ttmp_line.p[0] = P[k];\n\t\t\ttmp_line.p[1] = P[(k+1)%N];\n\n\t\t\tif(!is_Cross(tmp_line,work_line))continue;\n\n\t\t\tV.push_back(calc_Cross_Point(work_line,tmp_line));\n\t\t}\n\n\t\tV.push_back(Point(BIG_NUM,BIG_NUM));\n\n\t\tsort(V.begin(),V.end());\n\t\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\t\tdouble tmp = 0;\n\t\tfor(int k = 0; k < V.size()-1; k++){\n\n\t\t\tif(contains(P,(V[k]+V[k+1])/2) != 0){\n\n\t\t\t\ttmp += calc_dist(V[k],V[k+1]);\n\t\t\t}else{\n\t\t\t\tans = max(ans,tmp);\n\t\t\t\ttmp = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"Case %d: %.10lf\\n\",num_case,ans);\n\n\tnum_case++;\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":140,"memory_kb":3372,"score_of_the_acc":-0.8955,"final_rank":14},{"submission_id":"aoj_2394_4804235","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 10005\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\t\treturn x != p.x? x < p.x: y < p.y;\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\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\tvoid 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\nstruct Info{\n\n\tInfo(Point arg_tmp_p,double arg_dist){\n\n\t\ttmp_p = arg_tmp_p;\n\t\tdist = arg_dist;\n\t}\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn dist < arg.dist;\n\t}\n\n\tPoint tmp_p;\n\tdouble dist;\n};\n\nint N;\nint num_case = 1;\nPolygon P;\ndouble NUM = 200000;\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\n\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\n\tdouble naiseki,norm1,norm2,gaiseki;\n\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\n\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\n\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\n\tif(gaiseki > EPS){\n\t\treturn 1;\n\t}else if(gaiseki < -EPS){\n\t\treturn -1;\n\t}\n\tif(naiseki < -EPS){\n\t\treturn 2;\n\t}\n\n\tif(norm1 < norm2){\n\t\treturn -2;\n\t}\n\treturn 0;\n}\n\n\n//★★直線ではなく、線分の交差判定★★\nbool is_Cross(Line a,Line b){\n\n\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\n\t\t\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\n\t\t\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\n\t\treturn true;\n\t}\n\treturn false;\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\nPoint project(Line l,Point p){\n\n\tVector base = l.p[1]-l.p[0];\n\tdouble r = dot(p-l.p[0],base)/norm(base);\n\treturn l.p[0]+base*r;\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.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\n//点と線分の距離\ndouble getDistanceSP(Line l,Point p){\n\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\n\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\n\treturn getDistanceLP(l,p);\n}\n\n//線分と線分の距離\ndouble getDistance(Line A,Line B){\n\tif(is_Cross(A,B))return 0.0;\n\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\n\t\t\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\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\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\n//交点を求める関数\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\n\tPoint ret;\n\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\n\tif(fabs(x1-x2) > EPS){\n\t\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\n\t}else{\n\t\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\n\t}\n\treturn ret;\n}\n\n//インタフェース関数\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\n\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\n}\n\nPoint calc_Cross_Point(Line A,Line B){\n\n\tif(getDistanceSP(B,A.p[0]) < EPS){\n\n\t\treturn A.p[0];\n\n\t}else if(getDistanceSP(B,A.p[1]) < EPS){\n\n\t\treturn A.p[1];\n\n\t}else if(getDistanceSP(A,B.p[0]) < EPS){\n\n\t\treturn B.p[0];\n\n\t}else if(getDistanceSP(A,B.p[1]) < EPS){\n\n\t\treturn B.p[1];\n\t}\n\n\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\n}\n\nbool isSame(Point a,Point b){\n\n\treturn abs(a-b) < EPS;\n}\n\n/*\n * IN 2\n * ON 1\n * OUT 0\n *\n */\nint contains(Polygon g,Point p){\n\tint n = g.size();\n\tbool x = false;\n\tfor(int i = 0; i < n; i++){\n\t\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\n\t\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\n\t\tif(a.y > b.y)swap(a,b);\n\t\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\n\t}\n\treturn (x ? 2:0);\n}\n\n\nvoid func(){\n\n\tP.clear();\n\n\tdouble x,y;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf\",&x,&y);\n\t\tP.push_back(Point(x,y));\n\t}\n\n\tLine bottom,proj_line,calc_line;\n\tvector<Line> L;\n\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = i+1; k < N; k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tL.push_back(Line(P[i],P[k]));\n\t\t}\n\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tif(k == i || (k+1)%N == i)continue;\n\t\t\tbottom.p[0] = P[k];\n\t\t\tbottom.p[1] = P[(k+1)%N];\n\n\t\t\tPoint proj_p = project(bottom,P[i]);\n\t\t\tproj_line.p[0] = P[i];\n\t\t\tproj_line.p[1] = proj_p;\n\n\t\t\tif(!is_Cross(bottom,proj_line))continue;\n\n\t\t\tPoint tmp_cross_p = calc_Cross_Point(proj_line,bottom);\n\n\t\t\tL.push_back(Line(P[i],tmp_cross_p));\n\t\t}\n\t}\n\n\tVector vec_next,vec_pre;\n\n\tdouble ans = 0;\n\n\tLine tmp_line,work_line;\n\tPoint cross_point,base_p;\n\n\tvector<Point> V;\n\n\tfor(int i = 0; i < L.size(); i++){\n\t\tV.clear();\n\n\t\tdouble slope = calc_slope(L[i]);\n\n\t\t//両方向に直線を伸ばす\n\n\t\tif(fabs(slope-DBL_MAX) < EPS){ //垂直\n\n\t\t\twork_line = Line(Point(L[i].p[0].x,-NUM),Point(L[i].p[0].x,NUM));\n\n\t\t}else if(fabs(slope) < EPS){ //水平\n\n\t\t\twork_line = Line(Point(-NUM,L[i].p[0].y),Point(NUM,L[i].p[0].y));\n\n\t\t}else{\n\n\t\t\tif(L[i].p[0].x > L[i].p[1].x){\n\n\t\t\t\twork_line.p[0] = Point(L[i].p[0].x+NUM,L[i].p[0].y+NUM*slope);\n\t\t\t\twork_line.p[1] = Point(L[i].p[1].x-NUM,L[i].p[1].y-NUM*slope);\n\n\t\t\t}else{\n\n\t\t\t\twork_line.p[0] = Point(L[i].p[1].x+NUM,L[i].p[1].y+NUM*slope);\n\t\t\t\twork_line.p[1] = Point(L[i].p[0].x-NUM,L[i].p[0].y-NUM*slope);\n\t\t\t}\n\t\t}\n\n\t\tV.clear();\n\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\ttmp_line.p[0] = P[k];\n\t\t\ttmp_line.p[1] = P[(k+1)%N];\n\n\t\t\tif(!is_Cross(tmp_line,work_line))continue;\n\n\t\t\tV.push_back(calc_Cross_Point(work_line,tmp_line));\n\t\t}\n\n\t\tV.push_back(Point(BIG_NUM,BIG_NUM));\n\n\t\tsort(V.begin(),V.end());\n\t\tV.erase(unique(V.begin(),V.end()),V.end());\n\n\t\tdouble tmp = 0;\n\t\tfor(int k = 0; k < V.size()-1; k++){\n\n\t\t\tif(contains(P,(V[k]+V[k+1])/2) != 0){\n\n\t\t\t\ttmp += calc_dist(V[k],V[k+1]);\n\t\t\t}else{\n\t\t\t\tans = max(ans,tmp);\n\t\t\t\ttmp = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"Case %d: %.10lf\\n\",num_case,ans);\n\n\tnum_case++;\n}\n\nint main(){\n\n\twhile(true){\n\n\t\tscanf(\"%d\",&N);\n\t\tif(N == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3432,"score_of_the_acc":-0.9745,"final_rank":15},{"submission_id":"aoj_2394_3114638","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-10;\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}\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\nP projection(const L& l, const P& p) {\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\n return l[0] + t*(l[0]-l[1]);\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}\n\nbool intersectLS(const L& l, const L& s){\n return cross(l[1]-l[0], s[0]-l[0])*\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\n}\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nbool isParallel(const P &a, const P &b){\n return abs(cross(a,b)) < EPS;\n}\nbool isParallel(const L &a, const L &b){\n return isParallel(a[1]-a[0], b[1]-b[0]);\n}\n\nP crosspointLL(const L &l, const L &m) {\n double A = cross(l[1]-l[0], m[1]-m[0]);\n double B = cross(l[1]-l[0], l[1]-m[0]);\n return m[0] + B/A *(m[1]-m[0]);\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\n}\ndouble getarea(const VP &poly){\n int n = poly.size();\n double ret = 0;\n for (int i=0; i<n; i++){ \n ret += cross(poly[i], poly[(i+1)%n]);\n }\n return ret*0.5;\n}\n\ndouble solve(const VP& poly){\n int n = poly.size();\n double ret = 0;\n vector<L> cand;\n for(int i=0; i<n; i++){\n for(int j=i+1; j<n; j++){\n cand.emplace_back(poly[i], poly[j]);\n }\n for(int j=0; j<n; j++){\n L edge(poly[j], poly[(j+1)%n]);\n if(distanceLP(edge, poly[i]) > EPS){\n cand.emplace_back(poly[i], projection(edge, poly[i]));\n }\n }\n }\n\n for(L &line: cand){\n VP plist;\n for(int k=0; k<n; k++){\n L edge(poly[k], poly[(k+1)%n]);\n if(!isParallel(line, edge) && intersectLS(line, edge)){\n plist.push_back(crosspointLL(line, edge));\n }\n }\n sort(plist.begin(), plist.end());\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\n \n plist.emplace_back(INF, 0);\n double range = 0;\n for(int i=0; i<(int)plist.size()-1; i++){\n if(in_poly((plist[i] +plist[i+1]) /2.0, poly) >= 0){\n range += abs(plist[i+1] -plist[i]);\n }else{\n ret = max(ret, range);\n range = 0;\n }\n }\n }\n return ret;\n}\n\nint main(){\n int dn=0;\n while(1){\n dn++;\n int n;\n cin >> n;\n if(n == 0) break;\n\n VP p(n);\n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n p[i] = P(x, y);\n }\n cout << fixed << setprecision(10);\n cout << \"Case \" << dn << \": \" << solve(p) << endl;\n \n }\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":4048,"score_of_the_acc":-1.4138,"final_rank":18},{"submission_id":"aoj_2394_2994986","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ld = long double;\nconst ld eps = 1e-10, pi = acos(-1.0);\n\nbool eq(ld a, ld b) {\n\treturn abs(a - b) < eps;\n}\n\nusing Point = complex<ld>;\nclass Line {\npublic:\n\tPoint a, b;\n};\nld dot(Point a, Point b) {\n\treturn real(conj(a) * b);\n}\n\nld cross(Point a, Point b) {\n\treturn imag(conj(a) * b);\n}\n\nint ccw(Point a, Point b, Point c) {\n\tb -= a, c -= a;\n\tif (cross(b, c) > eps) return 1;\t// a,b,c counter-clockwise\n\tif (cross(b, c) < -eps) return -1;\t// a,b,c clockwise\n\tif (dot(b, c) < 0) return 2;\t\t// c,a,b on a line\n\tif (norm(b) < norm(c)) return -2;\t// a,b,c on a line\n\treturn 0;\t\t\t\t\t\t\t// a,c,b on a line\n}\n\nbool isis_ll(Line l, Line m) {\n\treturn abs(cross(l.b - l.a, m.b - m.a)) > eps;\n}\n\nbool isis_ls(Line l, Line s) {\n\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\nbool isis_lp(Line l, Point p) {\n\treturn abs(cross(l.b - p, l.a - p)) < eps;\n}\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\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}\n\nPoint is_ll(Line s, Line t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tassert(cross(sv, tv) != 0);\n\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\n}\n\nbool isis_ss(Line s, Line t) {\n\tif (isis_ll(s, t)) return isis_ls(s, t) && isis_ls(t, s);\n\treturn isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a);\n}\n\nld dist_lp(Line l, Point p) {\n\treturn abs(p - proj(l, p));\n}\n\nld dist_ll(Line l, Line m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\nld dist_ls(Line l, Line s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\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\nld dist_ss(Line s, Line t) {\n\tif (isis_ss(s, t)) return 0;\n\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\n}\n\nbool is_in_polygon(const vector<Point>& poly, const Point& p) {\n\tint n = poly.size();\n\tld sum = 0;\n\tfor (int i = 0; i < n; ++i) {\n\t\tPoint p1 = poly[i], p2 = poly[(i + 1) % n];\n\t\tif (isis_sp((Line) { p1, p2 }, p)) return true;\n\t\tsum += arg((p2 - p) / (p1 - p));\n\t}\n\treturn abs(sum) > pi;\n}\n\nld calc(const Line& l, const vector<Point>& ps) {\n\tint n = ps.size();\n\tPoint v = l.b - l.a;\n\tassert(abs(v) > eps);\n\tv /= abs(v);\n\tvector<ld> pos = { 0, abs(l.b - l.a) };\n\tfor (int i = 0; i < n; i++) {\n\t\tLine s = { ps[i], ps[(i + 1) % n] };\n\t\tif (abs(cross(l.b - l.a, s.b - s.a)) > eps && isis_ss(l, s)) {\n\t\t\tauto pp = is_ll(l, s);\n\t\t\tld x = dot(pp - l.a, v);\n\t\t\tif (0 < x && x < pos[1]) pos.push_back(x);\n\t\t}\n\t}\n\tsort(pos.begin(), pos.end());\n\tld res = 0;\n\tfor (int i = 1; i < (int)pos.size(); i++) {\n\t\tif (!is_in_polygon(ps, l.a + v * ((pos[i] + pos[i - 1]) / 2.0))) break;\n\t\tres = pos[i];\n\t}\n\treturn res;\n}\n\nint main()\n{\n\tios::sync_with_stdio(false), cin.tie(0);\n\tcout << fixed << setprecision(10);\n\tint n, tcase = 0;\n\twhile (cin >> n, n) {\n\t\tvector<Point> ps;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tld x, y;\n\t\t\tcin >> x >> y;\n\t\t\tps.emplace_back(x, y);\n\t\t}\n\t\tld res = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i + 1; j < n; j++) {\n\t\t\t\tLine l = { ps[i], ps[j] };\n\t\t\t\tif (calc(l, ps) < abs(l.a - l.b) - eps) continue;\n\t\t\t\tPoint v = ps[j] - ps[i];\n\t\t\t\tassert(abs(v) > eps);\n\t\t\t\tv /= abs(v);\n\t\t\t\tPoint p1 = ps[j] + v * calc((Line) { ps[j], ps[j] + v * (ld)1e5 }, ps);\n\t\t\t\tPoint p2 = ps[i] - v * calc((Line) { ps[i], ps[i] - v * (ld)1e5 }, ps);\n\t\t\t\tres = max(res, abs(p1 - p2));\n\t\t\t}\n\t\t}\n\t\tcout << \"Case \" << ++tcase << \": \" << res << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":780,"memory_kb":3324,"score_of_the_acc":-1.6139,"final_rank":19},{"submission_id":"aoj_2394_2766836","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int SIZE = 210;\nconst double eps = 1e-15;\n\ntypedef long long ll;\ntypedef long double ld;\n\ntypedef complex<ll> P;\ntypedef complex<ld> Pd;\n\ninline ll dot(P a, P b){\n return (a * conj(b)).real();\n}\n\ninline ll cross(P a, P b){\n return (conj(a) * b).imag();\n}\n\nint ccw(P a, P b, P c){\n ll res1 = cross(b-a, c-a);\n if(res1 > 0) return 1; //CCW\n if(res1 < 0) return -1; //CW\n if(dot(b-a, c-a) < 0) return -2; //c -> a -> b\n if(dot(a-b, c-b) < 0) return 2; //a -> b -> c\n return 0;\n}\n\nbool iscollinear(P a1, P a2, P b1, P b2){\n return abs(cross(a2-a1, b2-b1)) == 0;\n}\n\nint isInterSS(P a1, P a2, P b1, P b2){\n if(iscollinear(a1, a2, b1, b2)) return false;\n \n int a = ccw(b1, b2, a1);\n int b = ccw(b1, b2, a2);\n int c = ccw(a1, a2, b1);\n int d = ccw(a1, a2, b2);\n\n if(a*b <= 0 && c*d < 0) return 1;\n if(a*b <= 0 && c == 0) return -1;\n if(a*b <= 0 && d == 0) return -2;\n return 0;\n}\n\nint isInterLS(P a1, P a2, P b1, P b2){\n if(iscollinear(a1, a2, b1, b2)) return false;\n\n int c = ccw(a1, a2, b1);\n int d = ccw(a1, a2, b2);\n \n if(abs(c) != 1) return -1;\n if(abs(d) != 1) return -2;\n if(c*d < 0) return 1;\n return 0;\n}\n\nbool iscontainedPP(int n, P *g, P p){\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] - p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) <= 0 && dot(a,b) <= 0) return true;\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a,b) > 0) f = !f;\n }\n return f;\n}\n\nPd getCrossPoint(P a1, P a2, P b1, P b2){\n P a = a2 - a1;\n P b = b2 - b1;\n Pd ad = Pd(a.real(), a.imag());\n Pd a1d = Pd(a1.real(), a1.imag());\n return a1d + ad * (ld)cross(b, b1-a1) / (ld)cross(b, a);\n}\n\ndouble absll(P a){\n return sqrt(a.real() * a.real() + a.imag() * a.imag());\n}\n\nPd toPd(P a){\n return Pd(a.real(), a.imag());\n}\n\nint T = 0;\n\nbool solve(){\n int n;\n int x[SIZE], y[SIZE];\n P p[SIZE];\n Pd pd[SIZE];\n \n if(scanf(\"%d\",&n) == EOF) return false;\n if(n == 0) return false;\n \n printf(\"Case %d: \",++T);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\",x+i, y+i);\n p[i] = P(x[i], y[i]);\n pd[i] = Pd(x[i], y[i]);\n }\n\n bool inS[SIZE][SIZE][2][2] = {}; // [a][b][{a:0,b:1}][{0:in,1:out}]\n \n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i == j) continue;\n \n P a = p[(i-1+n)%n];\n P b = p[i];\n P c = p[(i+1)%n];\n P d = p[j];\n\n int r1 = ccw(b, a, c);\n int r2 = ccw(b, a, d);\n int r3 = ccw(b, d, c);\n \n inS[i][j][0][0] = (r2 == 2 || r2 == 0 || r3 == 2 || r3 == 0); // online\n inS[i][j][0][0] |= (r1 == 1 && (r2 * r3 == -1 || r2 == -2 || r3 == -2));\n inS[i][j][0][0] |= (r2 == -1 && r3 == -1);\n\n //cerr << i << \" \" << j << \" : \" << inS[i][j][0][0] << \" \" << inS[i][j][0][1] << endl;\n //cerr << r1 << \" \" << r2 << \" \" << r3 << endl;\n \n d = b * 2LL - d;\n r2 = ccw(b, a, d);\n r3 = ccw(b, d, c);\n \n inS[i][j][0][1] = (r2 == 2 || r2 == 0 || r3 == 2 || r3 == 0); // online\n inS[i][j][0][1] |= (r1 == 1 && (r2 * r3 == -1 || r2 == -2 || r3 == -2));\n inS[i][j][0][1] |= (r2 == -1 && r3 == -1);\n\n inS[j][i][1][0] = inS[i][j][0][0];\n inS[j][i][1][1] = inS[i][j][0][1];\n\n //cerr << i << \" \" << j << \" : \" << inS[i][j][0][0] << \" \" << inS[i][j][0][1] << endl;\n //cerr << r1 << \" \" << r2 << \" \" << r3 << endl;\n }\n }\n\n double ans = 0;\n\n for(int i=0;i<n;i++){\n ans = max(ans, absll(p[i] - p[(i+1)%n]));\n }\n \n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n bool f = true;\n\n if (i+1 != j){\n for(int k=0;k<n;k++){\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\n\n int resISS = isInterSS(p[i], p[j], p[k], p[(k+1)%n]);\n \n if(resISS == 1 ||\n (resISS == -1 && (!inS[i][k][1][1] || !inS[i][k][1][0])) ||\n (resISS == -2 && (!inS[i][(k+1)%n][1][1] || !inS[i][(k+1)%n][1][0]))){\n f = false;\n break;\n }\n\n }\n if (!f) continue;\n }\n \n Pd cp1, cp2;\n bool cp1f = false, cp2f = false;\n \n for(int k=0;k<n;k++){\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\n \n int resILS = isInterLS(p[i], p[j], p[k], p[(k+1)%n]);\n Pd cp = getCrossPoint(p[i], p[j], p[k], p[(k+1)%n]);\n \n if(resILS){\n bool near1 = false;\n bool near2 = false;\n \n if(abs(pd[i] - cp) < abs(pd[j] - cp)){\n if (!cp1f || abs(pd[i] - cp) < abs(pd[i] - cp1)){\n if(resILS == 1 ||\n (resILS == -1 && !inS[i][k][1][1]) ||\n (resILS == -2 && !inS[i][(k+1)%n][1][1]))\n near1 = true;\n }\n }else{\n if (!cp2f || abs(pd[j] - cp) < abs(pd[j] - cp2)){\n if(resILS == 1 ||\n (resILS == -1 && !inS[j][k][1][1]) ||\n (resILS == -2 && !inS[j][(k+1)%n][1][1]))\n near2 = true;\n }\n }\n \n if(near1){\n cp1 = cp; cp1f = true;\n }\n \n if(near2){\n cp2 = cp; cp2f = true;\n }\n }\n }\n\n \n if(inS[i][j][0][0]){\n ans = max(ans, absll(p[i] - p[j]));\n } else {\n continue;\n }\n\n //1\n \n if (cp1f && inS[i][j][0][1]){\n ans = max(ans, (double)abs(pd[j] - cp1));\n }\n \n //2\n if (cp2f && inS[i][j][1][1]) {\n ans = max(ans, (double)abs(cp2 - pd[i]));\n if(cp1f && inS[i][j][0][1])\n ans = max(ans, (double)abs(cp1-cp2));\n }\n }\n }\n \n printf(\"%.10lf\\n\",(double)ans);\n \n return true;\n}\n \n\nint main(){\n //while(solve());\n\n for(int i=0;;i++){\n if(!solve()) break;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3372,"score_of_the_acc":-0.7575,"final_rank":7},{"submission_id":"aoj_2394_2765841","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int SIZE = 210;\nconst double eps = 1e-10;\n\ntypedef complex<double> P;\n\ninline double dot(P a, P b){\n return (a * conj(b)).real();\n}\n\ninline double cross(P a, P b){\n return (conj(a) * b).imag();\n}\n\nint ccw(P a, P b, P c){\n double res1 = cross(b-a, c-a);\n if(res1 > eps) return 1;\n if(res1 < -eps) return -1;\n if(dot(b-a, c-a) < -eps) return -2;\n if(dot(a-b, c-b) < -eps) return 2;\n return 0;\n}\n\nbool iscollinear(P a1, P a2, P b1, P b2){\n return abs(cross(a2-a1, b2-b1)) < eps;\n}\n\nint isInterSS(P a1, P a2, P b1, P b2){\n if(iscollinear(a1, a2, b1, b2)) return false;\n \n int a = ccw(b1, b2, a1);\n int b = ccw(b1, b2, a2);\n int c = ccw(a1, a2, b1);\n int d = ccw(a1, a2, b2);\n\n if(a*b <= 0 && c*d < 0) return 1;\n if(a*b <= 0 && c == 0) return -1;\n if(a*b <= 0 && d == 0) return -2;\n return 0;\n}\n\nint isInterLS(P a1, P a2, P b1, P b2){\n if(iscollinear(a1, a2, b1, b2)) return false;\n\n int c = ccw(a1, a2, b1);\n int d = ccw(a1, a2, b2);\n \n if(c == 0) return -1;\n if(d == 0) return -2;\n if(c*d < 0) return 1;\n return 0;\n}\n\nbool iscontainedPP(int n, P *g, P p){\n bool f = false;\n for(int i=0;i<n;i++){\n P a = g[i] -p, b = g[(i+1)%n] - p;\n if(abs(cross(a,b)) < eps && dot(a,b) < eps) return true;\n if(a.imag() > b.imag()) swap(a,b);\n if(a.imag() < eps && eps < b.imag() && cross(a,b) > eps) f = !f;\n }\n return f;\n}\n\nP getCrossPoint(P a1, P a2, P b1, P b2){\n P a = a2 - a1;\n P b = b2 - b1;\n return a1 + a * cross(b, b1-a1) / cross(b, a);\n}\n\nint T = 0;\n\nbool solve(){\n int n;\n int x[SIZE], y[SIZE];\n P p[SIZE];\n \n if(scanf(\"%d\",&n) == EOF) return false;\n if(n == 0) return false;\n\n printf(\"Case %d: \",++T);\n \n for(int i=0;i<n;i++){\n scanf(\"%d%d\",x+i, y+i);\n p[i] = P(x[i], y[i]);\n }\n\n bool inS[SIZE][SIZE][2][2] = {}; // [a][b][{a:0,b:1}][0:in,1:out}]\n \n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n auto dir = (p[j] - p[i]); //i->j\n double e = 1e10;\n if (abs(dir.imag()) > eps) e = min(e, abs(dir.imag()));\n if (abs(dir.real()) > eps) e = min(e, abs(dir.real()));\n dir = dir / e * 1e-7;\n\n inS[i][j][0][0] = iscontainedPP(n, p, p[i] + dir);\n inS[i][j][0][1] = iscontainedPP(n, p, p[i] - dir);\n inS[i][j][1][0] = iscontainedPP(n, p, p[j] - dir);\n inS[i][j][1][1] = iscontainedPP(n, p, p[j] + dir);\n inS[j][i][0][0] = inS[j][i][1][0];\n inS[j][i][0][1] = inS[j][i][1][1];\n inS[j][i][1][0] = inS[j][i][0][0];\n inS[j][i][1][1] = inS[j][i][0][1];\n }\n }\n\n double ans = 0;\n\n for(int i=0;i<n;i++){\n ans = max(ans,abs(p[i] - p[(i+1)%n]));\n }\n \n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n bool f = true;\n\n if (i+1 != j){\n for(int k=0;k<n;k++){\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\n\n int resISS = isInterSS(p[i], p[j], p[k], p[(k+1)%n]);\n \n if(resISS == 1 ||\n (resISS == -1 && (!inS[i][k][1][1] || !inS[i][k][1][0])) ||\n (resISS == -2 && (!inS[i][(k+1)%n][1][1] || !inS[i][(k+1)%n][1][0]))){\n f = false;\n break;\n }\n }\n\n if (!f) continue;\n }\n \n P cp1, cp2;\n bool cp1f = false, cp2f = false;\n \n for(int k=0;k<n;k++){\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\n \n int resILS = isInterLS(p[i], p[j], p[k], p[(k+1)%n]);\n P cp = getCrossPoint(p[i], p[j], p[k], p[(k+1)%n]);\n \n if(resILS){\n bool near1 = false;\n bool near2 = false;\n \n if(abs(p[i] - cp) < abs(p[j] - cp)){\n if (!cp1f || abs(p[i] - cp) < abs(p[i] - cp1)){\n if(resILS == 1 ||\n (resILS == -1 && !inS[i][k][1][1]) ||\n (resILS == -2 && !inS[i][(k+1)%n][1][1]))\n near1 = true;\n }\n }else{\n if (!cp2f || abs(p[j] - cp) < abs(p[j] - cp2)){\n if(resILS == 1 ||\n (resILS == -1 && !inS[j][k][1][1]) ||\n (resILS == -2 && !inS[j][(k+1)%n][1][1]))\n near2 = true;\n }\n }\n \n if(near1){\n cp1 = cp; cp1f = true;\n }\n \n if(near2){\n cp2 = cp; cp2f = true;\n }\n }\n\n //cerr << i << \" \" << j << \" \" << k << \" : \" << resILS << endl;\n }\n\n \n if(inS[i][j][0][0]){\n ans = max(ans, abs(p[i] - p[j]));\n } else {\n continue;\n }\n\n //1\n \n if (cp1f && inS[i][j][0][1]){\n ans = max(ans, abs(p[j] - cp1));\n }\n \n //2\n if (cp2f && inS[i][j][1][1]) {\n ans = max(ans, abs(cp2 - p[i]));\n if(cp1f && inS[i][j][0][1])\n ans = max(ans, abs(cp1-cp2));\n }\n\n //cerr << i << \" \" << j << \" : \" << ans << endl;\n }\n }\n\n printf(\"%.10lf\\n\",ans);\n \n return true;\n}\n \n\nint main(){\n //while(solve());\n\n for(int i=0;;i++){\n if(!solve()) break;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3404,"score_of_the_acc":-0.8265,"final_rank":11},{"submission_id":"aoj_2394_2149008","code_snippet":"#include<iostream>\n#include<cstdlib>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<ctime>\n#include<algorithm>\n#include<list>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<string>\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\n#define sqr(v) ((v)*(v))\n#define mb make_pair\n#define debug 0\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<int,LL> PIL;\ntypedef pair<LL,int> PLI;\ntypedef pair<LL,LL> PLL;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst int maxn=101;\nstruct Point\n{\n double x,y;\n Point(){}\n Point(double X,double Y)\n {\n x=X;y=Y;\n }\n bool operator <(const Point &p)const\n {\n if(sgn(x-p.x))return x<p.x;\n else return y<p.y;\n }\n bool operator ==(const Point &p)const\n {\n return sgn(x-p.x)==0&&sgn(y-p.y)==0;\n }\n Point operator -(const Point &p)\n {\n return Point(x-p.x,y-p.y);\n }\n Point operator +(const Point &p)\n {\n return Point(x+p.x,y+p.y);\n }\n double cross(const Point &p)const\n {\n return x*p.y-y*p.x;\n }\n double len()\n {\n return sqrt(sqr(x)+sqr(y));\n }\n void unit()\n {\n double tmp=len();\n x/=tmp;\n y/=tmp;\n x*=0.0001;\n y*=0.0001;\n }\n}pt[maxn];\nstruct Segment\n{\n Point st,ed;\n};\ndouble cross(const Point &p,const Point &q)\n{\n return p.x*q.y-p.y*q.x;\n}\ndouble dot(const Point &p,const Point &q)\n{\n return p.x*q.x+p.y*q.y;\n}\nPoint Insect(Segment &p,Segment &q)\n{\n double u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\n return Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\n}\nvector<Point> tp,sp;\nint n,cas;\nint check(Point P,int deb)\n{\n int con=0;\n Segment now,tmp;\n Point cp;\n now.st=P;\n con=0;\n now.ed.x=P.x+19950527;\n now.ed.y=P.y+27051995;\n for(int i=0;i<n;++i)\n {\n tmp.st=pt[i];\n tmp.ed=pt[(i+1)%n];\n if(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n {\n cp=Insect(tmp,now);\n if(cp==tmp.ed||cp==tmp.st)while(1);\n if(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\n ++con;\n }\n }\n return con%2;\n}\n \ndouble check(int i,int j)\n{\n Segment now,tmp;\n Point cp;\n tp.clear();\n now.st=pt[i];\n now.ed=pt[j];\n for(i=0;i<n;++i)\n {\n tmp.st=pt[i];\n tmp.ed=pt[(i+1)%n];\n if(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n {\n cp=Insect(tmp,now);\n if(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\n tp.push_back(cp);\n else if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0) // endpoints\n {\n if(cp==tmp.st)j=i;\n else j=i+1;\n if(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\n tp.push_back(cp);\n }\n }\n else if(sgn((tmp.st-now.st).cross(now.ed-now.st))==0&&sgn((tmp.ed-now.st).cross(now.ed-now.st))==0)\n {\n Point vec=tmp.ed-tmp.st;\n vec.unit();\n if(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\n {\n if(!check(tmp.st-vec,0))\n tp.push_back(tmp.st);\n if(!check(tmp.ed+vec,0))\n tp.push_back(tmp.ed);\n }\n }\n }\n sort(tp.begin(),tp.end());\n int n=tp.size();\n sp.clear();\n for(i=0;i<n;++i)\n if(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\n double ans=0;\n for(i=0;i<sp.size();i+=2)\n ans=max(ans,(sp[i+1]-sp[i]).len());\n return ans;\n}\nint main()\n{\n int i,j;\n cas=0;\n while(scanf(\"%d\",&n)!=EOF)\n {\n if(n==0)break;\n double len=0;\n for(i=0;i<n;++i)\n scanf(\"%lf%lf\",&pt[i].x,&pt[i].y);\n for(i=0;i<n;++i)\n len=max(len,(pt[i]-pt[(i+1)%n]).len());\n for(i=0;i<n;++i)\n for(j=i+1;j<n;++j)\n len=max(len,check(i,j));\n printf(\"Case %d: %.10f\\n\",++cas,len);\n //cout <<len*len<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3112,"score_of_the_acc":-0.6758,"final_rank":5},{"submission_id":"aoj_2394_2122383","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e16\n#define eps (1e-8)\n#define mod 1000000007\n#define pi acos(-1)\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 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 equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\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 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{ return fabs(x-p.x)<eps && fabs(y-p.y)<eps; }\n bool operator<(Point p)const{ \n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\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\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\n}\n\nbool intersect(Line L,Segment s){\n return cross(L.p2-L.p1,s.p1-L.p1)*cross(L.p2-L.p1,s.p2-L.p1)<eps;\n}\n\nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\n}\n\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\n}\n\nint n;\nPolygon p;\n\ndouble cal(Line L){\n vector<Point> vp;\n FOR(i,0,n){\n Segment s(p[i],p[(i+1)%n]);\n if(isParallel(L,s))continue;\n if(!intersect(L,s))continue;\n vp.pb(getCrossPointLL(L,s));\n }\n sort(all(vp));\n vp.erase(unique(all(vp)),vp.end());\n double sum=0,res=0;\n FOR(i,0,vp.size()-1){\n Point a=vp[i],b=vp[i+1];\n if(a==b)continue;\n Point m=a+(b-a)/2.0;\n if(contains(p,m)==0)sum=0;\n else { sum+=abs(b-a); res=max(res,sum); }\n }\n return res;\n}\n\ndouble solve(){\n double res=0;\n FOR(i,0,n){\n FOR(j,i+1,n)res=max(res,cal(Line(p[i],p[j])));\n }\n return res;\n}\n\nint main()\n{\n int c=1;\n while(cin>>n && n){\n p.clear();\n FOR(i,0,n){\n double x,y;\n cin>>x>>y;\n p.pb(Point(x,y));\n }\n cout<<\"Case \"<<c<<\": \"; pd(solve());\n c++;\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3124,"score_of_the_acc":-0.749,"final_rank":6},{"submission_id":"aoj_2394_2122047","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e16\n#define eps (1e-8)\n#define mod 1000000007\n#define pi acos(-1)\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 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 equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\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 vector<int> vi;\ntypedef vector<pii> vpi;\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\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{ return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\n bool operator<(Point p)const{ return \n ( x!=p.x ? x-p.x<eps : y-p.y<eps);}\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\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\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\nbool intersect(Line L,Segment s){\n return ccw(L.p1,L.p2,s.p1) * ccw(L.p1,L.p2,s.p2)<=0;\n}\n\nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\n}\n\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\n}\n\nint n;\nPolygon p;\n\ndouble cal(Line L){\n vector<pair<double,Point> > vp;\n Point mdp=getCrossPointLL(L,Line(Point(2000,-2000),Point(-2000,-2000)));\n FOR(i,0,n){\n Segment s(p[i],p[(i+1)%n]);\n if(isParallel(L,s))continue;\n if(!intersect(L,s))continue;\n Point m=getCrossPointLL(L,s);\n vp.pb(mp(abs(mdp-m),m));\n }\n sort(all(vp));\n vp.erase(unique(all(vp)),vp.end());\n double sum=0,res=0;\n FOR(i,0,vp.size()-1){\n Point a=vp[i].s,b=vp[i+1].s;\n Point m=a+(b-a)/4.0;\n if(contains(p,m)==0)sum=0;\n else {\n sum+=abs(b-a);\n res=max(res,sum);\n }\n }\n return res;\n}\n\ndouble solve(){\n double res=0;\n FOR(i,0,n){\n FOR(j,i+1,n)res=max(res,cal(Line(p[i],p[j])));\n }\n return res;\n}\n\nint main()\n{\n int c=1;\n while(cin>>n && n){\n p.clear();\n FOR(i,0,n){\n double x,y;\n cin>>x>>y;\n p.pb(Point(x,y));\n }\n cout<<\"Case \"<<c<<\": \";\n pd(solve());\n c++;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3224,"score_of_the_acc":-0.7964,"final_rank":9},{"submission_id":"aoj_2394_2079770","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e16\n#define eps (1e-6)\n#define mod 1000000007\n#define pi acos(-1)\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 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 equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\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 vector<int> vi;\ntypedef vector<pii> vpi;\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\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 (x!=p.x ? x-p.x<-eps : y-p.y<-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\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\n}\n\nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\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\nbool intersect(Point p1,Point p2,Point p3,Point p4){\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 &&\n ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\n}\n\nbool intersect(Segment s1,Segment s2){\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool intersectLS(Line l,Segment s){\n if(cross(l.p2-l.p1,s.p1-l.p1)*\n cross(l.p2-l.p1,s.p2-l.p1)<eps)return true;\n return false;\n}\n \nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\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\nvector<Line> getTangent(Polygon a,Polygon b){\n vector<Line> res;\n int n=a.size(),m=b.size();\n\n FOR(i,0,n){\n FOR(j,0,m){\n int bi=(i+n-1)%n,bj=(j+m-1)%m;\n int ni=(i+1)%n,nj=(j+1)%m;\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\n res.pb(Line(a[i],b[j]));\n }\n }\n }\n return res;\n}\n\nint n;\nPolygon p;\n\nbool check(Segment a){\n if(contains(p,a.p1)==0)return false;\n if(contains(p,a.p2)==0)return false;\n vector<pair<double,Point> > vdp;\n vdp.pb(mp(0,a.p1));\n vdp.pb(mp(abs(a.p1-a.p2),a.p2));\n FOR(i,0,n){\n Segment b(p[i],p[(i+1)%n]);\n if(isParallel(a,b))continue;\n if(!intersect(a,b))continue;\n Point c=getCrossPointLL(a,b);\n vdp.pb(mp(abs(a.p1-c),c));\n }\n sort(all(vdp));\n FOR(i,0,vdp.size()-1){\n Point c=vdp[i].s,d=vdp[i+1].s;\n if(c==d)continue;\n Point m=c+(d-c)/2.0;\n if(contains(p,m)==0)return false;\n }\n return true;\n}\n\ndouble get(Polygon s,Line l){\n vector<Point> vp;\n FOR(i,0,s.size()){\n Point a=s[i],b=s[(i+1)%s.size()];\n if(isParallel(l,Segment(a,b)))continue;\n if(!intersectLS(l,Segment(a,b)))continue;\n Point c=getCrossPointLL(l,Segment(a,b));\n if(!(c==b))vp.pb(c);\n }\n double res=0;\n FOR(i,0,vp.size()){\n FOR(j,i+1,vp.size()){\n if(check(Segment(vp[i],vp[j])))res=max(res,abs(vp[i]-vp[j]));\n }\n }\n return res;\n}\n\ndouble solve(){\n double res=0.0;\n FOR(i,0,n)res=max(res,abs(p[i]-p[(i+1)%n]));\n\n FOR(i,0,n-2){\n FOR(j,i+2,n){\n if((j+1)%n==i)continue;\n Polygon R,L,s;\n s.pb(p[i]);\n s.pb(p[(i+1)%n]);\n s.pb(p[j]);\n s.pb(p[(j+1)%n]);\n\n s=convex_hull(s); \n\n for(int k=(i+1)%n;k!=(j+1)%n;k=(k+1)%n)\n if(contains(s,p[k])!=0)R.pb(p[k]);\n for(int k=(j+1)%n;k!=(i+1)%n;k=(k+1)%n)\n if(contains(s,p[k])!=0)L.pb(p[k]);\n R=convex_hull(R);\n L=convex_hull(L);\n vector<Line> vs = getTangent(R,L);\n FOR(k,0,R.size()){\n res=max(res,get(s,Segment(R[k],R[(k+1)%R.size()])));\n }\n FOR(k,0,L.size()){\n res=max(res,get(s,Segment(L[k],L[(k+1)%L.size()])));\n }\n FOR(k,0,vs.size()){\n res=max(res,get(s,vs[k]));\n }\n }\n }\n return res;\n}\n\nint main()\n{\n int c=1;\n while(cin>>n && n){\n p.clear();\n FOR(i,0,n){\n int x,y;\n cin>>x>>y;\n p.pb(Point(x,y));\n }\n cout<<\"Case \"<<c<<\": \";\n pd(solve());\n c++;\n }\n return 0;\n}","accuracy":1,"time_ms":510,"memory_kb":3284,"score_of_the_acc":-1.2892,"final_rank":16},{"submission_id":"aoj_2394_2079547","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e16\n#define eps (1e-6)\n#define mod 1000000007\n#define pi acos(-1)\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 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 equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\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 vector<int> vi;\ntypedef vector<pii> vpi;\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\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 (x!=p.x ? x-p.x<-eps : y-p.y<-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\nbool isParallel(Vector a,Vector b){\n return equals(cross(a,b),0.0);\n}\n\nbool isParallel(Segment s,Segment t){\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\n}\n\nPoint getCrossPointLL(Line a,Line b){\n double A=cross(a.p2-a.p1,b.p2-b.p1);\n double B=cross(a.p2-a.p1,a.p2-b.p1);\n if(abs(A)<eps || abs(B)<eps)return b.p1;\n return b.p1+(b.p2-b.p1)*(B/A);\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\nbool intersect(Point p1,Point p2,Point p3,Point p4){\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 &&\n ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\n}\n\nbool intersect(Segment s1,Segment s2){\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\n}\n\nbool intersectLS(Line l,Segment s){\n if(cross(l.p2-l.p1,s.p1-l.p1)*\n cross(l.p2-l.p1,s.p2-l.p1)<eps)return true;\n return false;\n}\n \nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\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\nvector<Line> getTangent(Polygon a,Polygon b){\n vector<Line> res;\n int n=a.size(),m=b.size();\n\n FOR(i,0,n){\n FOR(j,0,m){\n int bi=(i+n-1)%n,bj=(j+m-1)%m;\n int ni=(i+1)%n,nj=(j+1)%m;\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\n res.pb(Line(a[i],b[j]));\n }\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\n res.pb(Line(a[i],b[j]));\n }\n }\n }\n return res;\n}\n\nint n;\nPolygon p;\n\nbool check(Segment a){\n if(contains(p,a.p1)==0)return false;\n if(contains(p,a.p2)==0)return false;\n vector<pair<double,Point> > vdp;\n vdp.pb(mp(0,a.p1));\n vdp.pb(mp(abs(a.p1-a.p2),a.p2));\n FOR(i,0,n){\n Segment b(p[i],p[(i+1)%n]);\n if(isParallel(a,b))continue;\n if(!intersect(a,b))continue;\n Point c=getCrossPointLL(a,b);\n vdp.pb(mp(abs(a.p1-c),c));\n }\n sort(all(vdp));\n FOR(i,0,vdp.size()-1){\n Point c=vdp[i].s,d=vdp[i+1].s;\n if(c==d)continue;\n Point m=c+(d-c)/2.0;\n if(contains(p,m)==0)return false;\n }\n return true;\n}\n\ndouble get(Polygon s,Line l){\n vector<Point> vp;\n FOR(i,0,s.size()){\n Point a=s[i],b=s[(i+1)%s.size()];\n if(isParallel(l,Segment(a,b)))continue;\n if(!intersectLS(l,Segment(a,b)))continue;\n Point c=getCrossPointLL(l,Segment(a,b));\n if(!(c==b))vp.pb(c);\n }\n double res=0;\n FOR(i,0,vp.size()){\n FOR(j,i+1,vp.size()){\n \n // pd(abs(vp[i]-vp[j]));\n if(check(Segment(vp[i],vp[j])))res=max(res,abs(vp[i]-vp[j]));\n }\n }\n return res;\n}\n\ndouble solve(){\n double res=0.0;\n FOR(i,0,n)res=max(res,abs(p[i]-p[(i+1)%n]));\n\n FOR(i,0,n-2){\n FOR(j,i+2,n){\n if((j+1)%n==i)continue;\n Polygon R,L,s;\n s.pb(p[i]);\n s.pb(p[(i+1)%n]);\n s.pb(p[j]);\n s.pb(p[(j+1)%n]);\n Segment s1(s[0],s[3]),s2(s[1],s[2]);\n if(intersect(s1,s2))swap(s1.p2,s2.p2);\n bool flag=true;\n for(int k=(i+1)%n;k!=j;k=(k+1)%n){\n Segment seg=Segment(p[k],p[(k+1)%n]);\n if(isParallel(s1,seg))continue;\n if(!intersect(s1,seg))continue;\n Point tmp=getCrossPointLL(s1,seg);\n if(!(tmp==seg.p1) && !(tmp==seg.p2))flag=false;\n }\n for(int k=(j+1)%n;k!=i;k=(k+1)%n){\n Segment seg=Segment(p[k],p[(k+1)%n]);\n if(isParallel(s2,seg))continue;\n if(!intersect(s2,seg))continue;\n Point tmp=getCrossPointLL(s2,seg);\n if(!(tmp==seg.p1) && !(tmp==seg.p2))flag=false;\n }\n //if(!flag)continue;\n\n s=convex_hull(s); \n\n for(int k=(i+1)%n;k!=(j+1)%n;k=(k+1)%n)\n if(contains(s,p[k])!=0)R.pb(p[k]);\n for(int k=(j+1)%n;k!=(i+1)%n;k=(k+1)%n)\n if(contains(s,p[k])!=0)L.pb(p[k]);\n R=convex_hull(R);\n L=convex_hull(L);\n vector<Line> vs = getTangent(R,L);\n FOR(k,0,R.size()){\n res=max(res,get(s,Segment(R[k],R[(k+1)%R.size()])));\n }\n FOR(k,0,L.size()){\n res=max(res,get(s,Segment(L[k],L[(k+1)%L.size()])));\n }\n FOR(k,0,vs.size()){\n res=max(res,get(s,vs[k]));\n }\n }\n }\n return res;\n}\n\nint main()\n{\n int c=1;\n while(cin>>n && n){\n p.clear();\n FOR(i,0,n){\n int x,y;\n cin>>x>>y;\n p.pb(Point(x,y));\n }\n cout<<\"Case \"<<c<<\": \";\n pd(solve());\n c++;\n }\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":3296,"score_of_the_acc":-1.328,"final_rank":17},{"submission_id":"aoj_2394_1537865","code_snippet":"#include<iostream>\n#include<cstdlib>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<ctime>\n#include<algorithm>\n#include<list>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<string>\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\n#define sqr(v) ((v)*(v))\n#define mb make_pair\n#define debug 0\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<int,LL> PIL;\ntypedef pair<LL,int> PLI;\ntypedef pair<LL,LL> PLL;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst int maxn=101;\nstruct Point\n{\n\tdouble x,y;\n\tPoint(){}\n\tPoint(double X,double Y)\n\t{\n\t\tx=X;y=Y;\n\t}\n\tbool operator <(const Point &p)const\n\t{\n\t\tif(sgn(x-p.x))return x<p.x;\n\t\telse return y<p.y;\n\t}\n\tbool operator ==(const Point &p)const\n\t{\n\t\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\n\t}\n\tPoint operator -(const Point &p)\n\t{\n\t\treturn Point(x-p.x,y-p.y);\n\t}\n\tPoint operator +(const Point &p)\n\t{\n\t\treturn Point(x+p.x,y+p.y);\n\t}\n\tdouble cross(const Point &p)const\n\t{\n\t\treturn x*p.y-y*p.x;\n\t}\n\tdouble len()\n\t{\n\t\treturn sqrt(sqr(x)+sqr(y));\n\t}\n\tvoid unit()\n\t{\n\t\tdouble tmp=len();\n\t\tx/=tmp;\n\t\ty/=tmp;\n\t\tx*=0.0001;\n\t\ty*=0.0001;\n\t}\n}pt[maxn];\nstruct Segment\n{\n\tPoint st,ed;\n};\ndouble cross(const Point &p,const Point &q)\n{\n\treturn p.x*q.y-p.y*q.x;\n}\ndouble dot(const Point &p,const Point &q)\n{\n\treturn p.x*q.x+p.y*q.y;\n}\nPoint Insect(Segment &p,Segment &q)\n{\n\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\n\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\n}\nvector<Point> tp,sp;\nint n,cas;\nint check(Point P,int deb)\n{\n\tint con=0;\n\tSegment now,tmp;\n\tPoint cp;\n\tnow.st=P;\n\tcon=0;\n\tnow.ed.x=P.x+19950527;\n\tnow.ed.y=P.y+27051995;\n\tfor(int i=0;i<n;++i)\n\t{\n\t\ttmp.st=pt[i];\n\t\ttmp.ed=pt[(i+1)%n];\n\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t{\n\t\t\tcp=Insect(tmp,now);\n\t\t\tif(cp==tmp.ed||cp==tmp.st)while(1);\n\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\n\t\t\t\t++con;\n\t\t}\n\t}\n\treturn con%2;\n}\n\t\ndouble check(int i,int j)\n{\n\tSegment now,tmp;\n\tPoint cp;\n\ttp.clear();\n\tnow.st=pt[i];\n\tnow.ed=pt[j];\n\tfor(i=0;i<n;++i)\n\t{\n\t\ttmp.st=pt[i];\n\t\ttmp.ed=pt[(i+1)%n];\n\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t{\n\t\t\tcp=Insect(tmp,now);\n\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\n\t\t\t\ttp.push_back(cp);\n\t\t\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0) // endpoints\n\t\t\t{\n\t\t\t\tif(cp==tmp.st)j=i;\n\t\t\t\telse j=i+1;\n\t\t\t\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\n\t\t\t\t\ttp.push_back(cp);\n\t\t\t}\n\t\t}\n\t\telse if(sgn((tmp.st-now.st).cross(now.ed-now.st))==0&&sgn((tmp.ed-now.st).cross(now.ed-now.st))==0)\n\t\t{\n\t\t\tPoint vec=tmp.ed-tmp.st;\n\t\t\tvec.unit();\n\t\t\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\n\t\t\t{\n\t\t\t\tif(!check(tmp.st-vec,0))\n\t\t\t\t\ttp.push_back(tmp.st);\n\t\t\t\tif(!check(tmp.ed+vec,0))\n\t\t\t\t\ttp.push_back(tmp.ed);\n\t\t\t}\n\t\t}\n\t}\n\tsort(tp.begin(),tp.end());\n\tint n=tp.size();\n\tsp.clear();\n\tfor(i=0;i<n;++i)\n\t\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\n\tdouble ans=0;\n\tfor(i=0;i<sp.size();i+=2)\n\t\tans=max(ans,(sp[i+1]-sp[i]).len());\n\treturn ans;\n}\nint main()\n{\n\tint i,j;\n\tcas=0;\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tif(n==0)break;\n\t\tdouble len=0;\n\t\tfor(i=0;i<n;++i)\n\t\t\tscanf(\"%lf%lf\",&pt[i].x,&pt[i].y);\n\t\tfor(i=0;i<n;++i)\n\t\t\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\n\t\tfor(i=0;i<n;++i)\n\t\t\tfor(j=i+1;j<n;++j)\n\t\t\t\tlen=max(len,check(i,j));\n\t\tprintf(\"Case %d: %.10f\\n\",++cas,len);\n\t\t//cout <<len*len<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1260,"score_of_the_acc":-0.0345,"final_rank":1},{"submission_id":"aoj_2394_1537546","code_snippet":"#include<iostream>\n#include<cstdlib>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<ctime>\n#include<algorithm>\n#include<list>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<string>\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\n#define sqr(v) ((v)*(v))\n#define mb make_pair\n#define debug 0\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<int,LL> PIL;\ntypedef pair<LL,int> PLI;\ntypedef pair<LL,LL> PLL;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst int maxn=101;\nstruct Point\n{\n\tdouble x,y;\n\tPoint(){}\n\tPoint(double X,double Y)\n\t{\n\t\tx=X;y=Y;\n\t}\n\tbool operator <(const Point &p)const\n\t{\n\t\tif(sgn(x-p.x))return x<p.x;\n\t\telse return y<p.y;\n\t}\n\tbool operator ==(const Point &p)const\n\t{\n\t\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\n\t}\n\tPoint operator -(const Point &p)\n\t{\n\t\treturn Point(x-p.x,y-p.y);\n\t}\n\tPoint operator +(const Point &p)\n\t{\n\t\treturn Point(x+p.x,y+p.y);\n\t}\n\tdouble cross(const Point &p)const\n\t{\n\t\treturn x*p.y-y*p.x;\n\t}\n\tdouble len()\n\t{\n\t\treturn sqrt(sqr(x)+sqr(y));\n\t}\n\tvoid unit()\n\t{\n\t\tdouble tmp=len();\n\t\tx/=tmp;\n\t\ty/=tmp;\n\t\tx*=0.0001;\n\t\ty*=0.0001;\n\t}\n}pt[maxn];\nstruct Segment\n{\n\tPoint st,ed;\n};\ndouble cross(const Point &p,const Point &q)\n{\n\treturn p.x*q.y-p.y*q.x;\n}\ndouble dot(const Point &p,const Point &q)\n{\n\treturn p.x*q.x+p.y*q.y;\n}\nPoint Insect(Segment &p,Segment &q)\n{\n\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\n\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\n}\nvector<Point> tp,sp;\nint n,cas;\ndouble go[][2]={{19942705,57051994},{-19942705,57051994},{19942705,-57051994},{-19942705,-57051994},{-19942705,27051994},{19942705,27051994},{19942705,-27051994},{-19942705,-27051994}};\nint check(Point P,int deb)\n{\n\tint avg=0,con;\n\tSegment now,tmp;\n\tPoint cp;\n\tnow.st=P;\n\tif(deb)cout <<P.x<<\" \"<<P.y<<endl;\n\tfor(int j=0;j<1;++j)\n\t{\n\t\tcon=0;\n\t\tnow.ed.x=P.x+go[j][0];\n\t\tnow.ed.y=P.y+go[j][1];\n\t\tfor(int i=0;i<n;++i)\n\t\t{\n\t\t\ttmp.st=pt[i];\n\t\t\ttmp.ed=pt[(i+1)%n];\n\t\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t\t{\n\t\t\t\tcp=Insect(tmp,now);\n\t\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\n\t\t\t\t{\n\t\t\t\t\tif(deb)\n\t\t\t\t\tcout <<j<<\" \"<<\"cross point:\"<<cp.x<<\" \"<<cp.y<<\" when:\"<<tmp.st.x<<\" \"<<tmp.st.y<<\" \"<<tmp.ed.x<<\" \"<<tmp.ed.y<<endl;\n\t\t\t\t\t++con;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(deb)cout <<\"avg: \"<<avg<<endl;\n\treturn con%2;\n}\n\t\ndouble check(int i,int j)\n{\n\tint oi=i,oj=j;\n\tSegment now,tmp;\n\tPoint cp;\n\ttp.clear();\n\tnow.st=pt[i];\n\tnow.ed=pt[j];\n\t//cout <<\"------------Begin--------------\"<<endl;cout <<now.st.x<<\" \"<<now.st.y<<endl;cout <<now.ed.x<<\" \"<<now.ed.y<<endl;\n\tfor(i=0;i<n;++i)\n\t{\n\t\ttmp.st=pt[i];\n\t\ttmp.ed=pt[(i+1)%n];\n\t\t//cout <<tmp.st.x<<\" \"<<tmp.st.y<<endl;cout <<tmp.ed.x<<\" \"<<tmp.ed.y<<endl;\n\t\t//cout <<(tmp.ed-tmp.st).cross(now.ed-now.st)<<endl;\n\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t{\n\t\t\tcp=Insect(tmp,now);\n\t\t\t//cout <<\"HERE\"<<\" \"<<cp.x<<\" \"<<cp.y<<\" \"<<dot(tmp.ed-cp,cp-tmp.st)<<endl;\n\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\n\t\t\t\ttp.push_back(cp);\n\t\t\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0)\n\t\t\t{\n\t\t\t\tif(cp==tmp.st)j=i;\n\t\t\t\telse j=i+1;\n\t\t\t\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\n\t\t\t\t{\n\n\t\t\t\t\t//if(cas==12&&oi==12&&oj==33)cout <<\"cp:\"<<cp.x<<\" \"<<cp.y<<endl;\n\t\t\t\t\ttp.push_back(cp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if(sgn((now.st-tmp.st).cross(now.ed-now.st))==0&&sgn((now.st-tmp.ed).cross(now.ed-now.st))==0)\n\t\t{\n\t\t\tPoint vec=tmp.ed-tmp.st;\n\t\t\tvec.unit();\n\t\t\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\n\t\t\t{\n\t\t\t\t//if(cas==12&&oi==0&&oj==61)check(tmp.st-vec,1);\n\t\t\t\tif(!check(tmp.st-vec,0))\n\t\t\t\t\ttp.push_back(tmp.st);\n\t\t\t\tif(!check(tmp.ed+vec,0))\n\t\t\t\t\ttp.push_back(tmp.ed);\n\t\t\t}\n\t\t}\n\t}\n\tsort(tp.begin(),tp.end());\n\tif(cas==-1&&oi==0&&oj==61){cout <<\"0--tp--0\"<<endl;for(i=0;i<tp.size();++i)cout<<tp[i].x<<\" \"<<tp[i].y<<endl;cout <<\"0--end--0\"<<endl;}\n\tint n=tp.size();\n\tsp.clear();\n\tfor(i=0;i<n;++i)\n\t\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\n\tif(cas==-1&&oi==0&&oj==61){cout <<\"0--sp--0\"<<endl;for(i=0;i<sp.size();++i)cout<<sp[i].x<<\" \"<<sp[i].y<<endl;cout <<\"0--end--0\"<<endl;}\n\tdouble ans=0;\n\tfor(i=0;i<sp.size();i+=2)\n\t\tans=max(ans,(sp[i+1]-sp[i]).len());\n\treturn ans;\n}\nint main()\n{\n\tint i,j;\n\tcas=0;\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tif(n==0)break;\n\t\t//if(cas==12)cout <<n<<endl;\n\t\tdouble len=0;\n\t\tfor(i=0;i<n;++i)\n\t\t{\n\t\t\tscanf(\"%lf%lf\",&pt[i].x,&pt[i].y);\n\t\t\t//if(cas==12)cout <<pt[i].x<<\" \"<<pt[i].y<<endl;\n\t\t}\n\t\tfor(i=0;i<n;++i)\n\t\t\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\n\t\tfor(i=0;i<n;++i)\n\t\t\tfor(j=i+1;j<n;++j)\n\t\t\t{\n\t\t\t\tif(cas==-1)\n\t\t\t\t{\n\t\t\t\t\tif(len<check(i,j))\n\t\t\t\t\t\tcout <<len<<\" \"<<check(i,j)<<\" \"<<i<<\" \"<<j<<\" \"<<endl\n\t\t\t\t\t\t\t <<pt[i].x<<\" \"<<pt[i].y<<endl\n\t\t\t\t\t\t\t <<pt[j].x<<\" \"<<pt[j].y<<endl\n\t\t\t\t\t\t\t <<\"----------------------------------------------------\"<<endl;\n\t\t\t\t}\n\t\t\t\tlen=max(len,check(i,j));\n\t\t\t}\n\t\tprintf(\"Case %d: %.10f\\n\",++cas,len);\n\t\t//cout <<len*len<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1264,"score_of_the_acc":-0.0359,"final_rank":2},{"submission_id":"aoj_2394_1537493","code_snippet":"#include<iostream>\n#include<cstdlib>\n#include<cstring>\n#include<cstdio>\n#include<cmath>\n#include<ctime>\n#include<algorithm>\n#include<list>\n#include<queue>\n#include<stack>\n#include<vector>\n#include<set>\n#include<map>\n#include<bitset>\n#include<string>\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\n#define sqr(v) ((v)*(v))\n#define mb make_pair\n#define debug 0\nusing namespace std;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef pair<int,int> PII;\ntypedef pair<int,LL> PIL;\ntypedef pair<LL,int> PLI;\ntypedef pair<LL,LL> PLL;\nconst double eps=1e-8;\nconst double pi=acos(-1);\nconst int maxn=101;\nstruct Point\n{\n\tdouble x,y;\n\tPoint(){}\n\tPoint(double X,double Y)\n\t{\n\t\tx=X;y=Y;\n\t}\n\tbool operator <(const Point &p)const\n\t{\n\t\tif(sgn(x-p.x))return x<p.x;\n\t\telse return y<p.y;\n\t}\n\tbool operator ==(const Point &p)const\n\t{\n\t\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\n\t}\n\tPoint operator -(const Point &p)\n\t{\n\t\treturn Point(x-p.x,y-p.y);\n\t}\n\tPoint operator +(const Point &p)\n\t{\n\t\treturn Point(x+p.x,y+p.y);\n\t}\n\tdouble cross(const Point &p)const\n\t{\n\t\treturn x*p.y-y*p.x;\n\t}\n\tdouble len()\n\t{\n\t\treturn sqrt(sqr(x)+sqr(y));\n\t}\n\tvoid unit()\n\t{\n\t\tx*=0.00000001;\n\t\ty*=0.00000001;\n\t}\n}pt[maxn];\nstruct Segment\n{\n\tPoint st,ed;\n};\ndouble cross(const Point &p,const Point &q)\n{\n\treturn p.x*q.y-p.y*q.x;\n}\ndouble dot(const Point &p,const Point &q)\n{\n\treturn p.x*q.x+p.y*q.y;\n}\nPoint Insect(Segment &p,Segment &q)\n{\n\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\n\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\n}\nvector<Point> tp,sp;\nint n,cas;\ndouble go[][2]={{19942705,57051994},{-19942705,57051994},{19942705,-57051994},{-19942705,-57051994}};\nint con[4];\nint check(Point P,int deb)\n{\n\tdouble avg=0;\n\tcon[0]=con[1]=con[2]=con[3]=0;\n\tSegment now,tmp;\n\tPoint cp;\n\tnow.st=P;\n\tfor(int j=0;j<3;++j)\n\t{\n\t\tnow.ed.x=P.x+go[j][0];\n\t\tnow.ed.y=P.y+go[j][1];\n\t\tfor(int i=0;i<n;++i)\n\t\t{\n\t\t\ttmp.st=pt[i];\n\t\t\ttmp.ed=pt[(i+1)%n];\n\t\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t\t{\n\t\t\t\tcp=Insect(tmp,now);\n\t\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\n\t\t\t\t{\n\t\t\t\t\tif(deb)\n\t\t\t\t\t{\n\t\t\t\t\t\tcout <<\"cross point:\"<<cp.x<<\" \"<<cp.y<<\" when:\"<<tmp.st.x<<\" \"<<tmp.st.y<<\" \"<<tmp.ed.x<<\" \"<<tmp.ed.y<<endl;\n\t\t\t\t\t\tcout <<dot(now.ed-cp,cp-now.st)/(now.ed-cp).len()/(now.st-cp).len()<<endl;\n\t\t\t\t\t}\n\t\t\t\t\t++con[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tavg+=((con[j])%2);\n\t}\n\treturn round(avg/4);\n}\n\t\ndouble check(int i,int j)\n{\n\tint oi=i,oj=j;\n\tSegment now,tmp;\n\tPoint cp;\n\ttp.clear();\n\tnow.st=pt[i];\n\tnow.ed=pt[j];\n\t//cout <<\"------------Begin--------------\"<<endl;cout <<now.st.x<<\" \"<<now.st.y<<endl;cout <<now.ed.x<<\" \"<<now.ed.y<<endl;\n\tfor(i=0;i<n;++i)\n\t{\n\t\ttmp.st=pt[i];\n\t\ttmp.ed=pt[(i+1)%n];\n\t\t//cout <<tmp.st.x<<\" \"<<tmp.st.y<<endl;cout <<tmp.ed.x<<\" \"<<tmp.ed.y<<endl;\n\t\t//cout <<(tmp.ed-tmp.st).cross(now.ed-now.st)<<endl;\n\t\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\n\t\t{\n\t\t\tcp=Insect(tmp,now);\n\t\t\t//cout <<\"HERE\"<<\" \"<<cp.x<<\" \"<<cp.y<<\" \"<<dot(tmp.ed-cp,cp-tmp.st)<<endl;\n\t\t\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\n\t\t\t\ttp.push_back(cp);\n\t\t\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0)\n\t\t\t{\n\t\t\t\tif(cp==tmp.st)j=i;\n\t\t\t\telse j=i+1;\n\t\t\t\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\n\t\t\t\t{\n\n\t\t\t\t\t//if(cas==12&&oi==12&&oj==33)cout <<\"cp:\"<<cp.x<<\" \"<<cp.y<<endl;\n\t\t\t\t\ttp.push_back(cp);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if(sgn((now.st-tmp.st).cross(now.ed-now.st))==0&&sgn((now.st-tmp.ed).cross(now.ed-now.st))==0)\n\t\t{\n\t\t\tPoint vec=tmp.ed-tmp.st;\n\t\t\tvec.unit();\n\t\t\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\n\t\t\t{\n\t\t\t\tif(check(tmp.st-vec,0)%2==0)\n\t\t\t\t{\n\t\t\t\t\t//if(cas==12&&oi==12&&oj==33)cout <<(tmp.st-vec).x<<\" st \"<<(tmp.st-vec).y<<\" \"<<vec.x<<\" \"<<vec.y<<\" \"<<check(tmp.st-vec,1)<<endl;\n\t\t\t\t\ttp.push_back(tmp.st);\n\t\t\t\t}\n\t\t\t\tif(check(tmp.ed+vec,0)%2==0)\n\t\t\t\t{\n\t\t\t\t\t//if(cas==12&&oi==12&&oj==33)cout <<tmp.ed.x<<\" ed \"<<tmp.ed.y<<endl;\n\t\t\t\t\ttp.push_back(tmp.ed);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tsort(tp.begin(),tp.end());\n\tif(cas==-1&&oi==0&&oj==61){cout <<\"0--tp--0\"<<endl;for(i=0;i<tp.size();++i)cout<<tp[i].x<<\" \"<<tp[i].y<<endl;cout <<\"0--end--0\"<<endl;}\n\tint n=tp.size();\n\tsp.clear();\n\tfor(i=0;i<n;++i)\n\t\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\n\tif(cas==-1&&oi==0&&oj==61){cout <<\"0--sp--0\"<<endl;for(i=0;i<sp.size();++i)cout<<sp[i].x<<\" \"<<sp[i].y<<endl;cout <<\"0--end--0\"<<endl;}\n\tdouble ans=0;\n\tfor(i=0;i<sp.size();i+=2)\n\t\tans=max(ans,(sp[i+1]-sp[i]).len());\n\treturn ans;\n}\nint main()\n{\n\tint i,j;\n\tcas=0;\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tif(n==0)break;\n\t\t//if(cas==12)cout <<n<<endl;\n\t\tdouble len=0;\n\t\tfor(i=0;i<n;++i)\n\t\t{\n\t\t\tscanf(\"%lf%lf\",&pt[i].x,&pt[i].y);\n\t\t\t//if(cas==12)cout <<pt[i].x<<\" \"<<pt[i].y<<endl;\n\t\t}\n\t\tfor(i=0;i<n;++i)\n\t\t\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\n\t\tfor(i=0;i<n;++i)\n\t\t\tfor(j=i+1;j<n;++j)\n\t\t\t{\n\t\t\t\tif(cas==-1)\n\t\t\t\t{\n\t\t\t\t\tif(len<check(i,j))\n\t\t\t\t\t\tcout <<len<<\" \"<<check(i,j)<<\" \"<<i<<\" \"<<j<<\" \"<<endl\n\t\t\t\t\t\t\t <<pt[i].x<<\" \"<<pt[i].y<<endl\n\t\t\t\t\t\t\t <<pt[j].x<<\" \"<<pt[j].y<<endl\n\t\t\t\t\t\t\t <<\"----------------------------------------------------\"<<endl;\n\t\t\t\t}\n\t\t\t\tlen=max(len,check(i,j));\n\t\t\t}\n\t\tprintf(\"Case %d: %.10f\\n\",++cas,len);\n\t\t//cout <<len*len<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1276,"score_of_the_acc":-0.0517,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2394_10853935\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n#include<cmath>\\n#include<vector>\\n#include<cassert>\\n#define N 110\\n#define eps 1e-5\\nusing namespace std;\\n\\nint dlcmp(double x) {return x<-eps?-1:x>eps;}\\ndouble sqr(double x) {return x*x;}\\n\\nstruct Point\\n{\\n\\tdouble x,y;\\n\\n\\tPoint (){}\\n\\tPoint (double a,double b):x(a),y(b){}\\n\\n\\tvoid input() {scanf(\\\"%lf%lf\\\",&x,&y);}\\n\\n\\tPoint operator + (const Point &p) const {return Point(x+p.x,y+p.y);}\\n\\tPoint operator - (const Point &p) const {return Point(x-p.x,y-p.y);}\\n\\n\\tdouble len() {return sqrt(sqr(x)+sqr(y));}\\n\\tPoint trunc(double d) {d/=len(); return Point(x*d,y*d);}\\n};\\n\\ndouble cross(Point a,Point b) {return a.x*b.y-b.x*a.y;}\\ndouble dot(Point a,Point b) {return a.x*b.x+a.y*b.y;}\\ndouble dis(Point a,Point b) {return sqrt(sqr(a.x-b.x)+sqr(a.y-b.y));}\\n\\nPoint pt[N];\\nvector<double>vec;\\nint n;\\n\\n/*\\n// 0 in-in; 1 in-out; 2 out-in; 3 out-out\\nint check(Point s,Point e,Point a,Point o,Point b)\\n{\\n\\tPoint v=e-s;\\n\\n\\tif (dlcmp(vec,a-o)<=0&&dlcmp(vec,b-o)<=0)\\n\\t\\treturn 0;\\n\\telse if (dlcmp(vec,a-o)>0&&dlcmp(vec,b-o)>0)\\n\\t\\treturn 3;\\n\\telse if\\n*/\\n\\nint segment_intersect(Point s1,Point e1,Point s2,Point e2)\\n{\\n\\tif (dlcmp(cross(e1-s1,s2-s1))*dlcmp(cross(e1-s1,e2-s1))<0&&\\n\\t\\tdlcmp(cross(e2-s2,s1-s2))*dlcmp(cross(e2-s2,e1-s2))<0)\\n\\t\\treturn 1;\\n\\telse\\n\\t\\treturn 0;\\n}\\n\\nPoint interpoint_lines(Point s1,Point e1,Point s2,Point e2)\\n{\\n\\tPoint v1,v2,res;\\n\\n\\tv1=s1-e1; v2=s2-e2;\\n\\n\\tdouble r=((s1.x-s2.x)*v2.y-(s1.y-s2.y)*v2.x)/(v1.x*v2.y-v2.x*v1.y);\\n\\tres.x=-r*v1.x+s1.x;\\n\\tres.y=-r*v1.y+s1.y;\\n\\treturn res;\\n}\\nbool isChange(Point s,Point e,Point a,Point o,Point b)\\n{\\n\\tPoint vec=e-s;\\n\\n\\tif (dlcmp(cross(vec,a-o))*dlcmp(cross(vec,b-o))<0)\\n\\t\\treturn true;\\n\\telse\\n\\t\\treturn false;\\n}\\n\\nvoid init()\\n{\\n\\tint i,cnt=0;\\n\\n\\tcnt=2;\\n\\tfor (i=2;i<n;i++)\\n\\t{\\n\\t\\twhile (cnt>1&&dlcmp(cross(pt[cnt-1]-pt[cnt-2],pt[i]-pt[cnt-1]))==0)\\n\\t\\t\\tcnt--;\\n\\t\\tpt[cnt++]=pt[i];\\n\\t}\\n\\tn=cnt;\\n}\\n\\nvoid solve(Point s,Point e,Point a,Point b,Point p,Point q)\\n{\\n\\tint dp,dq;\\n\\n\\tdp=dlcmp(cross(e-s,p-a));\\n\\tdq=dlcmp(cross(e-s,q-b));\\n\\tif (dlcmp(dot(e-s,b-a))<0)\\n\\t{\\n\\t\\tdp=-dp; dq=-dq;\\n\\t}\\n\\n\\n\\tif(dp>0&&dq>0)\\n\\t{\\n\\t\\tvec.push_back(dis(s,a));\\n\\t\\tvec.push_back(dis(s,b));\\n\\t\\t//printf(\\\"put3 %.3f %.3f\\\\n\\\",a.x,a.y);\\n\\t\\t//printf(\\\"put3 %.3f %.3f\\\\n\\\",b.x,b.y);\\n\\t}\\n\\telse if (dp>0&&dq<0)\\n\\t{\\n\\t\\tvec.push_back(dis(s,a));\\n\\t\\t//printf(\\\"put3 %.3f %.3f\\\\n\\\",a.x,a.y);\\n\\t}\\n\\telse if (dp<0&&dq>0)\\n\\t{\\n\\t\\tvec.push_back(dis(s,b));\\n\\t\\t//printf(\\\"put3 %.3f %.3f\\\\n\\\",b.x,b.y);\\n\\t}\\n}\\n\\n\\nint main()\\n{\\n\\tint i,j,k,m;\\n\\tdouble ans,tmp;\\n\\tPoint s,e,a,b,o,aa,bb;\\n\\n\\tint ys=0;\\n\\n\\twhile(scanf(\\\"%d\\\",&n),n)\\n\\t{\\n\\t\\tfor (i=0;i<n;i++)\\n\\t\\t\\tpt[i].input();\\n\\n\\t\\tinit();\\n\\t\\t//printf(\\\"n %d\\\\n\\\",n);\\n\\t\\t//for (i=0;i<n;i++)\\n\\t\\t\\t//printf(\\\"%.2f %.2f\\\\n\\\",pt[i].x,pt[i].y);\\n\\n\\t\\tans=0;\\n\\t\\tfor (i=0;i<n;i++)\\n\\t\\t\\tfor (j=0;j<n;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (i==j) continue;\\n\\t\\t\\t\\t//printf(\\\"i%d j%d\\\\n\\\",i,j);\\n\\t\\t\\t\\ts=pt[i]+(pt[i]-pt[j]).trunc(5000); e=pt[j]+(pt[j]-pt[i]).trunc(5000);\\n\\n\\t\\t\\t\\tvec.clear();\\n\\t\\t\\t\\tfor (k=0;k<n;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ta=pt[k]; b=pt[(k+1)%n];\\n\\n\\t\\t\\t\\t\\tif (segment_intersect(s,e,a,b))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tPoint p=interpoint_lines(s,e,a,b);\\n\\t\\t\\t\\t\\t\\t//printf(\\\"put1 %.3f %.3f\\\\n\\\",p.x,p.y);\\n\\t\\t\\t\\t\\t\\tvec.push_back(dis(s,p));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor (k=0;k<n;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\to=pt[k]; a=pt[(k-1+n)%n]; b=pt[(k+1)%n];\\n\\n\\t\\t\\t\\t\\tif (dlcmp(cross(e-s,o-s))==0&&isChange(s,e,a,o,b))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t//printf(\\\"put2 %.3f %.3f %.3f\\\\n\\\",o.x,o.y,dis(s,o));\\n\\t\\t\\t\\t\\t\\tvec.push_back(dis(s,o));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor (k=0;k<n;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ta=pt[k]; b=pt[(k+1)%n],aa=pt[(k-1+n)%n]; bb=pt[(k+2)%n];\\n\\n\\t\\t\\t\\t\\tif (dlcmp(cross(e-s,a-s))==0&&dlcmp(cross(e-s,b-s))==0)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tPoint f1=e-s, f2=b-a;\\n\\t\\t\\t\\t\\t\\t//printf(\\\"true k %d %.3f %.3f %.3f %.3f\\\\n\\\",k,f1.x,f1.y,f2.x,f2.y);\\n\\t\\t\\t\\t\\t\\tsolve(s,e,a,b,aa,bb);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tsort(vec.begin(),vec.end());\\n\\t\\t\\t\\tm=vec.size(); assert(m%2==0);\\n\\t\\t\\t\\ttmp=0;\\n\\t\\t\\t\\tfor (k=0;k<m;k+=2)\\n\\t\\t\\t\\t\\ttmp=max(tmp,vec[k+1]-vec[k]);\\n\\n\\t\\t\\t\\tans=max(ans,tmp);\\n\\t\\t\\t}\\n\\n\\t\\tprintf(\\\"Case %d: %.8f\\\\n\\\",++ys,ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 2936,\n \"score_of_the_acc\": -0.6356,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2394_10498050\",\n \"code_snippet\": \"// AOJ 2394 Longest Lane\\n// 2025.5.18\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ld = long double;\\nconst ld EPS = 1e-9;\\n\\nstruct P { ld x, y; };\\n\\ninline P operator-(const P &a, const P &b) { return {a.x - b.x, a.y - b.y}; }\\ninline ld dot(const P &a, const P &b) { return a.x*b.x + a.y*b.y; }\\ninline ld crs(const P &a, const P &b) { return a.x*b.y - a.y*b.x; }\\ninline ld crs(const P &a, const P &b, const P &c) {\\n return crs({b.x - a.x, b.y - a.y}, {c.x - a.x, c.y - a.y});\\n}\\n\\nint sgn(ld v){ return v < -EPS ? -1 : (v > EPS ? 1 : 0); }\\nint ccw(const P &a, const P &b, const P &c){ return sgn(crs(a,b,c)); }\\n\\nvector<ld> cplt(const vector<P> &ps, const P &a, const P &b){\\n int n = ps.size();\\n P dir = b - a;\\n vector<ld> pos;\\n for(int i = 0; i < n; i++){\\n P p = ps[i];\\n P q = ps[(i+1)%n];\\n P r = ps[(i-1+n)%n];\\n int sa = ccw(a,b,p), sb = ccw(a,b,q);\\n if (sa * sb == -1) {\\n ld denom = crs(dir, q - p);\\n if (sgn(denom) != 0) pos.push_back(crs(p,q,a) / denom);\\n }\\n if (sa == 0) {\\n int sc = ccw(a,b,r);\\n if (sb != sc && (sb*sc < 0 || ccw(p,q,r) > 0))\\n pos.push_back(dot(p - a, dir) / dot(dir, dir));\\n }\\n }\\n sort(pos.begin(), pos.end());\\n return pos;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int N, tc = 1;\\n while ( (cin >> N) && N ){\\n vector<P> poly(N);\\n for(int i = 0; i < N; i++) cin >> poly[i].x >> poly[i].y;\\n\\n ld ans = 0;\\n for(int i = 0; i < N; i++){\\n for(int j = 0; j < i; j++){\\n P a = poly[i], b = poly[j];\\n auto pos = cplt(poly, a, b);\\n if (pos.size() < 2) continue;\\n ld L = sqrtl(dot(b - a, b - a));\\n for(int k = 0; k+1 < (int)pos.size(); k += 2){\\n ld len = (pos[k+1] - pos[k]) * L;\\n ans = max(ans, len);\\n }\\n }\\n }\\n cout << \\\"Case \\\" << tc++ << \\\": \\\"\\n << fixed << setprecision(10)\\n << (double)ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.7877,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2394_8998659\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define rng(i,a,b) for(int i=(int)a;i<(int)b;i++)\\n#define rep(i,b) rng(i,0,b)\\n#define repn(i,b) rng(i,1,b+1)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(),x.end()\\n#define si(x) (int)(x.size())\\n#define mp make_pair\\n\\n#define tct template<class t>\\ntct using vc=vector<t>;\\nusing vi=vc<int>;\\n#define tctu template<class t,class u>\\ntctu bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\\ntctu bool chmin(t&a,u b){if(a>b){a=b;return true;}else return false;}\\n\\nusing P=pair<int,int>;\\n#define a first\\n#define b second\\nusing ld = long double;\\nconst ld PI = acos((ld)-1);\\nconst ld eps = 1e-9;\\n\\nint sgn(ld a){ return a<-eps?-1:(a>eps?1:0); }\\nint sgn(ld a, ld b){ return sgn(a-b); }\\n\\nusing pt = complex<ld>;\\n#define x real()\\n#define y imag()\\n\\nusing ln=pair<pt,pt>;\\npt dir(ln a){ return a.b-a.a; }\\nld dot(const pt&a,const pt&b){ return a.x*b.x+a.y*b.y; }\\nld crs(const pt&a,const pt&b){ return a.x*b.y-a.y*b.x; }\\nld crs(const pt&a,const pt&b,const pt&c){ return crs(b-a,c-a); }\\nint ccw(const pt&a,const pt&b){ return sgn(crs(a,b)); }\\nint ccw(const pt&a,const pt&b,const pt&c){ return ccw(b-a,c-a); }\\nint ccw(const ln&a, const pt&b){ return ccw(a.a, a.b, b); }\\nld cllt(ln a, ln b){\\n\\treturn crs(b.a,b.b,a.a)/crs(dir(a),dir(b));\\n}\\nvc<ld>cplt(const vc<pt>&ps, ln z){\\n\\tint n=si(ps);\\n\\tvc<ld>pos;\\n\\trep(i,n){\\n\\t\\tpt p=ps[i],q=ps[(i+1)%n],r=ps[(i+n-1)%n];\\n\\t\\tint a=ccw(z,p),b=ccw(z,q);\\n\\t\\tif(a*b==-1) pos.pb(cllt(z,ln(p,q)));\\n\\t\\tif(a==0){\\n\\t\\t\\tint c=ccw(z,r);\\n\\t\\t\\tif(b!=c&&(b*c<0||ccw(p,q,r)>0)) pos.pb(dot(ps[i]-z.a,dir(z))/norm(dir(z)));\\n\\t\\t}\\n\\t}\\n\\tsort(all(pos));\\n\\treturn pos;\\n}\\nint n;\\nvoid solve(){\\n\\tvc<pt>vec(n);\\n\\trep(i,n){\\n\\t\\tld p,q;cin>>p>>q;\\n\\t\\tvec[i] = pt(p,q);\\n\\t}\\n\\tld ans = 0;\\n\\trep(i,n) rep(j,i){\\n\\t\\tln z = mp(vec[i], vec[j]);\\n\\t\\tauto info = cplt(vec, z);\\n\\t\\tfor(int a=0;a<si(info);a+=2){\\n\\t\\t\\tchmax(ans, (info[a+1]-info[a]) * abs(vec[i]-vec[j]));\\n\\t\\t}\\n\\t}\\n\\tcout << ans << '\\\\n';\\n}\\nsigned main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\tint t; \\n\\trng(i,1,1000000){\\n\\t\\tcin>>n; if(!n) return 0;\\n\\t\\tcout << \\\"Case \\\"<<i<<\\\": \\\"; solve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.8293,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2394_7151684\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double eps = 0.000001;\\nconst double INF = 100000000;\\nint sign(double x){\\n if (x > eps){\\n return 1;\\n } else if (x < -eps){\\n return -1;\\n } else {\\n return 0;\\n }\\n};\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator +(point P){\\n return point(x + P.x, y + P.y);\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dist(point P, point Q){\\n return abs(Q - P);\\n}\\ndouble dot(point P, point Q){\\n return P.x * Q.x + P.y * Q.y;\\n}\\ndouble cross(point P, point Q){\\n return P.x * Q.y - P.y * Q.x;\\n}\\nbool point_in_angle(point A, point B, point C, point P){\\n B = B - A;\\n C = C - A;\\n P = P - A;\\n if (abs(cross(B, P)) < eps && dot(B, P) > 0){\\n return true;\\n }\\n if (abs(cross(C, P)) < eps && dot(C, P) > 0){\\n return true;\\n }\\n if (abs(cross(B, C)) < eps){\\n if (dot(B, C) > 0){\\n return false;\\n } else {\\n return cross(B, P) > 0;\\n }\\n }\\n if (cross(B, C) > 0){\\n return cross(B, P) > 0 && cross(P, C) > 0;\\n } else {\\n return cross(B, P) > 0 || cross(P, C) > 0;\\n }\\n}\\nstruct line{\\n point A, B;\\n line(point A, point B): A(A), B(B){\\n }\\n};\\npoint vec(line L){\\n return L.B - L.A;\\n}\\nbool segment_line_intersect(line L1, line L2){\\n return sign(cross(L2.A - L1.A, vec(L1))) * sign(cross(L2.B - L1.A, vec(L1))) < 0;\\n}\\nbool segment_intersect(line L1, line L2){\\n return segment_line_intersect(L1, L2) && segment_line_intersect(L2, L1);\\n}\\nint main(){\\n cout << fixed << setprecision(10);\\n int T = 0;\\n while (true){\\n int N;\\n cin >> N;\\n if (N == 0){\\n break;\\n }\\n vector<point> P(N * 2);\\n for (int i = 0; i < N; i++){\\n cin >> P[i].x >> P[i].y;\\n }\\n for (int i = 0; i < N; i++){\\n P[N + i] = P[i];\\n }\\n double ans = 0;\\n for (int i = 1; i <= N; i++){\\n for (int j = i + 1; j < i + N - 1; j++){\\n double mn = -INF, mx = INF;\\n bool ok = true;\\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[j])){\\n ok = false;\\n }\\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[i] + (P[i] - P[j]))){\\n mn = 0;\\n }\\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[i])){\\n ok = false;\\n }\\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[j] + (P[j] - P[i]))){\\n mx = 1;\\n }\\n for (int k = 0; k < N; k++){\\n if (k != i - 1 && k != i % N && k != (j - 1) % N && k != j % N){\\n if (segment_line_intersect(line(P[i], P[j]), line(P[k], P[k + 1]))){\\n double r = cross(P[k] - P[i], P[k + 1] - P[k]) / cross(P[j] - P[i], P[k + 1] - P[k]);\\n if (r < eps){\\n mn = max(mn, r);\\n } else if (r > 1 - eps){\\n mx = min(mx, r);\\n } else {\\n ok = false;\\n }\\n }\\n }\\n }\\n for (int k = 0; k < N; k++){\\n if (k != i % N && k != j % N){\\n if (abs(cross(P[k] - P[i], P[j] - P[i])) < eps){\\n if (!point_in_angle(P[k], P[k + 1], P[k + N - 1], P[k] + P[i] - P[j]) || !point_in_angle(P[k], P[k + 1], P[k + N - 1], P[k] + P[j] - P[i])){\\n if (dot(P[k] - P[i], P[j] - P[i]) < 0){\\n mn = max(mn, -abs(P[k] - P[i]) / abs(P[j] - P[i]));\\n } else if (dot(P[k] - P[j], P[j] - P[i]) > 0){\\n mx = min(mx, abs(P[k] - P[i]) / abs(P[j] - P[i]));\\n } else {\\n ok = false;\\n }\\n }\\n }\\n }\\n }\\n if (ok){\\n ans = max(ans, (mx - mn) * dist(P[i], P[j]));\\n }\\n }\\n }\\n cout << \\\"Case \\\" << T + 1 << \\\": \\\" << ans << endl;\\n T++;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.815,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2394_7151671\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double eps = 0.000001;\\nconst double INF = 100000000;\\nint sign(double x){\\n if (x > eps){\\n return 1;\\n } else if (x < -eps){\\n return -1;\\n } else {\\n return 0;\\n }\\n};\\nstruct point{\\n double x, y;\\n point(){\\n }\\n point(double x, double y): x(x), y(y){\\n }\\n point operator +(point P){\\n return point(x + P.x, y + P.y);\\n }\\n point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble dist(point P, point Q){\\n return abs(Q - P);\\n}\\ndouble dot(point P, point Q){\\n return P.x * Q.x + P.y * Q.y;\\n}\\ndouble cross(point P, point Q){\\n return P.x * Q.y - P.y * Q.x;\\n}\\nbool point_in_angle(point A, point B, point C, point P){\\n B = B - A;\\n C = C - A;\\n P = P - A;\\n if (abs(cross(B, P)) < eps && dot(B, P) > 0){\\n return true;\\n }\\n if (abs(cross(C, P)) < eps && dot(C, P) > 0){\\n return true;\\n }\\n if (abs(cross(B, C)) < eps){\\n if (dot(B, C) > 0){\\n return false;\\n } else {\\n return cross(B, P) > 0;\\n }\\n }\\n if (cross(B, C) > 0){\\n return cross(B, P) > 0 && cross(P, C) > 0;\\n } else {\\n return cross(B, P) > 0 || cross(P, C) > 0;\\n }\\n}\\nstruct line{\\n point A, B;\\n line(point A, point B): A(A), B(B){\\n }\\n};\\npoint vec(line L){\\n return L.B - L.A;\\n}\\nbool segment_line_intersect(line L1, line L2){\\n return sign(cross(L2.A - L1.A, vec(L1))) * sign(cross(L2.B - L1.A, vec(L1))) < 0;\\n}\\nbool segment_intersect(line L1, line L2){\\n return segment_line_intersect(L1, L2) && segment_line_intersect(L2, L1);\\n}\\nint main(){\\n cout << fixed << setprecision(10);\\n int T = 0;\\n while (true){\\n int n;\\n cin >> n;\\n if (n == 0){\\n break;\\n }\\n vector<point> P(n * 2);\\n for (int i = 0; i < n; i++){\\n cin >> P[i].x >> P[i].y;\\n }\\n for (int i = 0; i < n; i++){\\n P[n + i] = P[i];\\n }\\n double ans = 0;\\n for (int i = 1; i <= n; i++){\\n for (int j = i + 1; j < i + n - 1; j++){\\n double mn = -INF, mx = INF;\\n bool ok = true;\\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[j])){\\n ok = false;\\n }\\n if (!point_in_angle(P[i], P[i + 1], P[i - 1], P[i] + (P[i] - P[j]))){\\n mn = 0;\\n }\\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[i])){\\n ok = false;\\n }\\n if (!point_in_angle(P[j], P[j + 1], P[j - 1], P[j] + (P[j] - P[i]))){\\n mx = 1;\\n }\\n for (int k = 0; k < n; k++){\\n if (k != i - 1 && k != i % n && k != (j - 1) % n && k != j % n){\\n if (segment_line_intersect(line(P[i], P[j]), line(P[k], P[k + 1]))){\\n double r = cross(P[k] - P[i], P[k + 1] - P[k]) / cross(P[j] - P[i], P[k + 1] - P[k]);\\n if (r < eps){\\n mn = max(mn, r);\\n } else if (r > 1 - eps){\\n mx = min(mx, r);\\n } else {\\n ok = false;\\n }\\n }\\n }\\n }\\n for (int k = 0; k < n; k++){\\n if (k != i % n && k != j % n){\\n if (abs(cross(P[k] - P[i], P[j] - P[i])) < eps){\\n if (!point_in_angle(P[k], P[k + 1], P[k + n - 1], P[k] + P[i] - P[j]) || !point_in_angle(P[k], P[k + 1], P[k + n - 1], P[k] + P[j] - P[i])){\\n if (dot(P[k] - P[i], P[j] - P[i]) < 0){\\n mn = max(mn, -abs(P[k] - P[i]) / abs(P[j] - P[i]));\\n } else if (dot(P[k] - P[j], P[j] - P[i]) > 0){\\n mx = min(mx, abs(P[k] - P[i]) / abs(P[j] - P[i]));\\n } else {\\n ok = false;\\n }\\n }\\n }\\n }\\n }\\n if (ok){\\n ans = max(ans, (mx - mn) * dist(P[i], P[j]));\\n }\\n }\\n }\\n cout << \\\"Case \\\" << T + 1 << \\\": \\\" << ans << endl;\\n T++;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.8537,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2394_6163031\",\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 = 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;\\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 << 10;\\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\\ntypedef complex<ld> Point;\\nld dot(Point a, Point b) { return real(conj(a) * b); }\\nld cross(Point a, Point b) { return imag(conj(a) * b); }\\nnamespace std {\\n\\tbool operator<(const Point& lhs, const Point& rhs) {\\n\\t\\treturn lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();\\n\\t}\\n}\\nstruct Line {\\n\\tPoint a, b;\\n};\\nstruct Circle {\\n\\tPoint p; ld r;\\n};\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a; c -= a;\\n\\tif (cross(b, c) > eps)return 1;//counter clockwise\\n\\tif (cross(b, c) < -eps)return -1;//clock wise\\n\\tif (dot(b, c) < 0)return 2;//c--a--b on line\\n\\tif (norm(b) < norm(c))return -2;//a--b--c on line\\n\\treturn 0; //a--c--b on line\\n}\\nbool eq(ld a, ld b) {\\n\\treturn abs(a - b) < eps;\\n}\\n//2直線の交差判定\\nbool isis_ll(Line l, Line m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n//直線と線分の交差判定\\n//bool isis_ls(Line l, Line s) {\\n//\\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n//}\\n//直線と線分の交差判定2\\nbool isis_ls(Line l, Line s) {\\n\\t//return ccw(l.a, l.b, s.a) * ccw(l.a, l.b, s.b) !=1;\\n\\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n//点が直線上に存在するか\\nbool isis_lp(Line l, Point p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n//点が線分上に存在するか\\nbool isis_sp(Line s, Point p) {\\n\\t//誤差がisis_lpに比べて大きいので、できるだけisis_lpを使う\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n//線分と線分の交差判定\\n//bool isis_ss(Line s, Line t) {\\n//\\treturn(cross(s.b - s.a, t.a - s.a)*cross(s.b - s.a, t.b - s.a) < -eps && cross(t.b - t.a, s.a - t.a)*cross(t.b - t.a, s.b - t.a) < -eps);\\n//}\\n//線分と線分の交差判定2\\nbool isis_ss(Line s, Line t) {\\n\\treturn 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//点から直線への垂線の足\\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}\\n//直線と直線の交点\\n//平行な２直線に対しては使うな！！！！\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a; Point tv = t.b - t.a;\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n//直線と点の距離\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n//直線と直線の距離\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n//線分と直線の距離\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n//線分と点の距離\\nld dist_sp(Line s, Point p) {\\n\\tPoint r = proj(s, p);\\n\\treturn isis_sp(s, r) ? abs(p - r) : min(abs(p - s.a), abs(p - s.b));\\n}\\n//線分と線分の距離\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t))return 0;\\n\\treturn min({ dist_sp(s,t.a),dist_sp(s,t.b),dist_sp(t,s.a),dist_sp(t,s.b) });\\n}\\n//線分と線分の交点、平行な場合は端点両方\\nvector<Point> is_ss(Line s1, Line s2) {\\n\\tif (!isis_ss(s1, s2))return {};\\n\\tvector<Point> res;\\n\\tif (abs(cross(s1.b - s1.a, s2.b - s2.a)) < eps) {\\n\\t\\tif (isis_sp(s1, s2.a)) res.push_back(s2.a);\\n\\t\\tif (isis_sp(s1, s2.b)) res.push_back(s2.b);\\n\\t\\tif (isis_sp(s2, s1.a)) res.push_back(s1.a);\\n\\t\\tif (isis_sp(s2, s1.b)) res.push_back(s1.b);\\n\\t}\\n\\telse {\\n\\t\\tres.push_back(is_ll(s1, s2));\\n\\t}\\n\\treturn res;\\n}\\n\\nusing polygon = vector<Point>;\\n//0 -> on polygon, 1-> in polygon, 2-> out polygon\\nint is_in_polygon(polygon& poly, Point p) {\\n\\tld sum = 0;\\n\\tint n = poly.size();\\n\\trep(i, n) {\\n\\t\\tint ni = i + 1 == n ? 0 : i + 1;\\n\\t\\tPoint pl = poly[i];\\n\\t\\tPoint pr = poly[ni];\\n\\t\\tLine e = { pl,pr };\\n\\t\\tif (isis_sp(e, p))return 0;\\n\\t\\tsum += arg((pr - p) / (pl - p));\\n\\t}\\n\\tif (abs(sum) < pi / 2)return 2;\\n\\treturn 1;\\n}\\nbool edge_in_polygon(polygon& poly, Line l) {\\n\\tPoint s = l.a, t = l.b;\\n\\tif (is_in_polygon(poly, s) == 2 || is_in_polygon(poly, t) == 2)return false;\\n\\tvector<ld> ts;\\n\\tint n = poly.size();\\n\\trep(i, n) {\\n\\t\\tint ni = i + 1 == n ? 0 : i + 1;\\n\\t\\tPoint pl = poly[i];\\n\\t\\tPoint pr = poly[ni];\\n\\t\\tLine e = { pl,pr };\\n\\t\\tvector<Point> vp = is_ss(l, e);\\n\\t\\tfor (Point p : vp) {\\n\\t\\t\\tld val = abs(p - s) / abs(t - s);\\n\\t\\t\\tts.push_back(val);\\n\\t\\t}\\n\\t}\\n\\tts.push_back(0);\\n\\tts.push_back(1);\\n\\tsort(all(ts));\\n\\trep(i, ts.size() - 1) {\\n\\t\\tld x = (ts[i] + ts[i + 1]) / 2;\\n\\t\\tPoint c = s + (t - s) * x;\\n\\t\\tif (is_in_polygon(poly, c) == 2)return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nint tmp = 0;\\nvoid outputx() {\\n\\tcout << \\\"Case \\\" << tmp << \\\": \\\";\\n}\\nint n;\\nvoid solve() {\\n\\ttmp++;\\n\\tpolygon p(n);\\n\\trep(i, n) {\\n\\t\\tint x, y; cin >> x >> y;\\n\\t\\tp[i] = { (ld)x,(ld)y };\\n\\t}\\n\\tld ans = 0;\\n\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\tLine l = { p[i],p[j] };\\n\\t\\tif (!edge_in_polygon(p, l))continue;\\n\\t\\tvector<ld> ts;\\n\\t\\trep(k, n) {\\n\\t\\t\\tint nk = k + 1 == n ? 0 : k + 1;\\n\\t\\t\\tif (isis_ll(l, { p[k],p[nk] })&&isis_ls(l, { p[k],p[nk] })) {\\n\\t\\t\\t\\tPoint pp = is_ll(l, { p[k], p[nk] });\\n\\t\\t\\t\\t//cout << \\\"? \\\" << pp << \\\"\\\\n\\\";\\n\\t\\t\\t\\tld val = abs(pp - p[i]) / abs(p[j] - p[i]);\\n\\t\\t\\t\\tif (ccw(p[i], p[j], pp) == 2)val *= -1;\\n\\t\\t\\t\\tts.push_back(val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(all(ts));\\n\\t\\tPoint cl = p[i], cr = p[j];\\n\\t\\trep(k, ts.size()) {\\n\\t\\t\\tif (ts[k] < 1 + eps)continue;\\n\\t\\t\\tPoint z = p[i] + (p[j] - p[i]) * ts[k];\\n\\t\\t\\tPoint mid = (cr + z); mid /= 2;\\n\\t\\t\\tif (is_in_polygon(p, mid)==2) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tcr = z;\\n\\t\\t}\\n\\t\\tper(k, ts.size()) {\\n\\t\\t\\tif (ts[k] > -eps)continue;\\n\\t\\t\\tPoint z = p[i] + (p[j] - p[i]) * ts[k];\\n\\t\\t\\tPoint mid = (cl + z); mid /= 2;\\n\\t\\t\\tif (is_in_polygon(p, mid)==2) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tcl=z;\\n\\t\\t}\\n\\t\\t//cout << cl << \\\" \\\" << cr << \\\"\\\\n\\\";\\n\\t\\tchmax(ans, abs(cl - cr));\\n\\t}\\n\\toutputx();\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << 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\\twhile(cin>>n,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.8393,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2394_4804246\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 10005\\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\\t\\treturn x != p.x? x < p.x: y < p.y;\\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\\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\\tvoid 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\\nint N;\\nint num_case = 1;\\nPolygon P;\\ndouble NUM = 200000;\\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\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\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\\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.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\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\\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\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nbool isSame(Point a,Point b){\\n\\n\\treturn abs(a-b) < EPS;\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n\\nvoid func(){\\n\\n\\tP.clear();\\n\\n\\tdouble x,y;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tP.push_back(Point(x,y));\\n\\t}\\n\\n\\tLine bottom,proj_line,calc_line;\\n\\tvector<Line> L;\\n\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tL.push_back(Line(P[i],P[k]));\\n\\t\\t}\\n\\t}\\n\\n\\tVector vec_next,vec_pre;\\n\\n\\tdouble ans = 0;\\n\\n\\tLine tmp_line,work_line;\\n\\tPoint cross_point,base_p;\\n\\n\\tvector<Point> V;\\n\\n\\tfor(int i = 0; i < L.size(); i++){\\n\\t\\tV.clear();\\n\\n\\t\\tdouble slope = calc_slope(L[i]);\\n\\n\\t\\t//両方向に直線を伸ばす\\n\\n\\t\\tif(fabs(slope-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\twork_line = Line(Point(L[i].p[0].x,-NUM),Point(L[i].p[0].x,NUM));\\n\\n\\t\\t}else if(fabs(slope) < EPS){ //水平\\n\\n\\t\\t\\twork_line = Line(Point(-NUM,L[i].p[0].y),Point(NUM,L[i].p[0].y));\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(L[i].p[0].x > L[i].p[1].x){\\n\\n\\t\\t\\t\\twork_line.p[0] = Point(L[i].p[0].x+NUM,L[i].p[0].y+NUM*slope);\\n\\t\\t\\t\\twork_line.p[1] = Point(L[i].p[1].x-NUM,L[i].p[1].y-NUM*slope);\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\twork_line.p[0] = Point(L[i].p[1].x+NUM,L[i].p[1].y+NUM*slope);\\n\\t\\t\\t\\twork_line.p[1] = Point(L[i].p[0].x-NUM,L[i].p[0].y-NUM*slope);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\ttmp_line.p[0] = P[k];\\n\\t\\t\\ttmp_line.p[1] = P[(k+1)%N];\\n\\n\\t\\t\\tif(!is_Cross(tmp_line,work_line))continue;\\n\\n\\t\\t\\tV.push_back(calc_Cross_Point(work_line,tmp_line));\\n\\t\\t}\\n\\n\\t\\tV.push_back(Point(BIG_NUM,BIG_NUM));\\n\\n\\t\\tsort(V.begin(),V.end());\\n\\t\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\t\\tdouble tmp = 0;\\n\\t\\tfor(int k = 0; k < V.size()-1; k++){\\n\\n\\t\\t\\tif(contains(P,(V[k]+V[k+1])/2) != 0){\\n\\n\\t\\t\\t\\ttmp += calc_dist(V[k],V[k+1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tans = max(ans,tmp);\\n\\t\\t\\t\\ttmp = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"Case %d: %.10lf\\\\n\\\",num_case,ans);\\n\\n\\tnum_case++;\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.8955,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2394_4804235\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 10005\\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\\t\\treturn x != p.x? x < p.x: y < p.y;\\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\\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\\tvoid 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\\nstruct Info{\\n\\n\\tInfo(Point arg_tmp_p,double arg_dist){\\n\\n\\t\\ttmp_p = arg_tmp_p;\\n\\t\\tdist = arg_dist;\\n\\t}\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn dist < arg.dist;\\n\\t}\\n\\n\\tPoint tmp_p;\\n\\tdouble dist;\\n};\\n\\nint N;\\nint num_case = 1;\\nPolygon P;\\ndouble NUM = 200000;\\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\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\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\\nPoint project(Line l,Point p){\\n\\n\\tVector base = l.p[1]-l.p[0];\\n\\tdouble r = dot(p-l.p[0],base)/norm(base);\\n\\treturn l.p[0]+base*r;\\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.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\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\\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\\n//交点を求める関数\\nPoint calc_Cross_Point(double x1,double x2,double x3,double x4,double y1,double y2,double y3,double y4){\\n\\tPoint ret;\\n\\tret.x = ((x2-x1)*(y3*(x4-x3)+x3*(y3-y4))-(x4-x3)*(y1*(x2-x1)+x1*(y1-y2)))/((y2-y1)*(x4-x3)-(y4-y3)*(x2-x1));\\n\\tif(fabs(x1-x2) > EPS){\\n\\t\\tret.y = ((y2-y1)*ret.x+y1*(x2-x1)+x1*(y1-y2))/(x2-x1);\\n\\t}else{\\n\\t\\tret.y = ((y4-y3)*ret.x+y3*(x4-x3)+x3*(y3-y4))/(x4-x3);\\n\\t}\\n\\treturn ret;\\n}\\n\\n//インタフェース関数\\nPoint calc_Cross_Point(Point a,Point b,Point c,Point d){\\n\\treturn calc_Cross_Point(a.x,b.x,c.x,d.x,a.y,b.y,c.y,d.y);\\n}\\n\\nPoint calc_Cross_Point(Line A,Line B){\\n\\n\\tif(getDistanceSP(B,A.p[0]) < EPS){\\n\\n\\t\\treturn A.p[0];\\n\\n\\t}else if(getDistanceSP(B,A.p[1]) < EPS){\\n\\n\\t\\treturn A.p[1];\\n\\n\\t}else if(getDistanceSP(A,B.p[0]) < EPS){\\n\\n\\t\\treturn B.p[0];\\n\\n\\t}else if(getDistanceSP(A,B.p[1]) < EPS){\\n\\n\\t\\treturn B.p[1];\\n\\t}\\n\\n\\treturn calc_Cross_Point(A.p[0],A.p[1],B.p[0],B.p[1]);\\n}\\n\\nbool isSame(Point a,Point b){\\n\\n\\treturn abs(a-b) < EPS;\\n}\\n\\n/*\\n * IN 2\\n * ON 1\\n * OUT 0\\n *\\n */\\nint contains(Polygon g,Point p){\\n\\tint n = g.size();\\n\\tbool x = false;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tPoint a = g[i]-p,b = g[(i+1)%n]-p;\\n\\t\\tif(abs(cross(a,b)) < EPS && dot(a,b) < EPS)return 1;\\n\\t\\tif(a.y > b.y)swap(a,b);\\n\\t\\tif(a.y < EPS && EPS < b.y && cross(a,b) > EPS) x = !x;\\n\\t}\\n\\treturn (x ? 2:0);\\n}\\n\\n\\nvoid func(){\\n\\n\\tP.clear();\\n\\n\\tdouble x,y;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\tP.push_back(Point(x,y));\\n\\t}\\n\\n\\tLine bottom,proj_line,calc_line;\\n\\tvector<Line> L;\\n\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tL.push_back(Line(P[i],P[k]));\\n\\t\\t}\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tif(k == i || (k+1)%N == i)continue;\\n\\t\\t\\tbottom.p[0] = P[k];\\n\\t\\t\\tbottom.p[1] = P[(k+1)%N];\\n\\n\\t\\t\\tPoint proj_p = project(bottom,P[i]);\\n\\t\\t\\tproj_line.p[0] = P[i];\\n\\t\\t\\tproj_line.p[1] = proj_p;\\n\\n\\t\\t\\tif(!is_Cross(bottom,proj_line))continue;\\n\\n\\t\\t\\tPoint tmp_cross_p = calc_Cross_Point(proj_line,bottom);\\n\\n\\t\\t\\tL.push_back(Line(P[i],tmp_cross_p));\\n\\t\\t}\\n\\t}\\n\\n\\tVector vec_next,vec_pre;\\n\\n\\tdouble ans = 0;\\n\\n\\tLine tmp_line,work_line;\\n\\tPoint cross_point,base_p;\\n\\n\\tvector<Point> V;\\n\\n\\tfor(int i = 0; i < L.size(); i++){\\n\\t\\tV.clear();\\n\\n\\t\\tdouble slope = calc_slope(L[i]);\\n\\n\\t\\t//両方向に直線を伸ばす\\n\\n\\t\\tif(fabs(slope-DBL_MAX) < EPS){ //垂直\\n\\n\\t\\t\\twork_line = Line(Point(L[i].p[0].x,-NUM),Point(L[i].p[0].x,NUM));\\n\\n\\t\\t}else if(fabs(slope) < EPS){ //水平\\n\\n\\t\\t\\twork_line = Line(Point(-NUM,L[i].p[0].y),Point(NUM,L[i].p[0].y));\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(L[i].p[0].x > L[i].p[1].x){\\n\\n\\t\\t\\t\\twork_line.p[0] = Point(L[i].p[0].x+NUM,L[i].p[0].y+NUM*slope);\\n\\t\\t\\t\\twork_line.p[1] = Point(L[i].p[1].x-NUM,L[i].p[1].y-NUM*slope);\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\twork_line.p[0] = Point(L[i].p[1].x+NUM,L[i].p[1].y+NUM*slope);\\n\\t\\t\\t\\twork_line.p[1] = Point(L[i].p[0].x-NUM,L[i].p[0].y-NUM*slope);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tV.clear();\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\ttmp_line.p[0] = P[k];\\n\\t\\t\\ttmp_line.p[1] = P[(k+1)%N];\\n\\n\\t\\t\\tif(!is_Cross(tmp_line,work_line))continue;\\n\\n\\t\\t\\tV.push_back(calc_Cross_Point(work_line,tmp_line));\\n\\t\\t}\\n\\n\\t\\tV.push_back(Point(BIG_NUM,BIG_NUM));\\n\\n\\t\\tsort(V.begin(),V.end());\\n\\t\\tV.erase(unique(V.begin(),V.end()),V.end());\\n\\n\\t\\tdouble tmp = 0;\\n\\t\\tfor(int k = 0; k < V.size()-1; k++){\\n\\n\\t\\t\\tif(contains(P,(V[k]+V[k+1])/2) != 0){\\n\\n\\t\\t\\t\\ttmp += calc_dist(V[k],V[k+1]);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tans = max(ans,tmp);\\n\\t\\t\\t\\ttmp = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"Case %d: %.10lf\\\\n\\\",num_case,ans);\\n\\n\\tnum_case++;\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d\\\",&N);\\n\\t\\tif(N == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.9745,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2394_3114638\",\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-10;\\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}\\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\\nP projection(const L& l, const P& p) {\\n double t = dot(p-l[0], l[0]-l[1]) / norm(l[0]-l[1]);\\n return l[0] + t*(l[0]-l[1]);\\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}\\n\\nbool intersectLS(const L& l, const L& s){\\n return cross(l[1]-l[0], s[0]-l[0])*\\n cross(l[1]-l[0], s[1]-l[0]) < EPS;\\n}\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nbool isParallel(const P &a, const P &b){\\n return abs(cross(a,b)) < EPS;\\n}\\nbool isParallel(const L &a, const L &b){\\n return isParallel(a[1]-a[0], b[1]-b[0]);\\n}\\n\\nP crosspointLL(const L &l, const L &m) {\\n double A = cross(l[1]-l[0], m[1]-m[0]);\\n double B = cross(l[1]-l[0], l[1]-m[0]);\\n return m[0] + B/A *(m[1]-m[0]);\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\n}\\ndouble getarea(const VP &poly){\\n int n = poly.size();\\n double ret = 0;\\n for (int i=0; i<n; i++){ \\n ret += cross(poly[i], poly[(i+1)%n]);\\n }\\n return ret*0.5;\\n}\\n\\ndouble solve(const VP& poly){\\n int n = poly.size();\\n double ret = 0;\\n vector<L> cand;\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n cand.emplace_back(poly[i], poly[j]);\\n }\\n for(int j=0; j<n; j++){\\n L edge(poly[j], poly[(j+1)%n]);\\n if(distanceLP(edge, poly[i]) > EPS){\\n cand.emplace_back(poly[i], projection(edge, poly[i]));\\n }\\n }\\n }\\n\\n for(L &line: cand){\\n VP plist;\\n for(int k=0; k<n; k++){\\n L edge(poly[k], poly[(k+1)%n]);\\n if(!isParallel(line, edge) && intersectLS(line, edge)){\\n plist.push_back(crosspointLL(line, edge));\\n }\\n }\\n sort(plist.begin(), plist.end());\\n plist.erase(unique(plist.begin(), plist.end()), plist.end());\\n \\n plist.emplace_back(INF, 0);\\n double range = 0;\\n for(int i=0; i<(int)plist.size()-1; i++){\\n if(in_poly((plist[i] +plist[i+1]) /2.0, poly) >= 0){\\n range += abs(plist[i+1] -plist[i]);\\n }else{\\n ret = max(ret, range);\\n range = 0;\\n }\\n }\\n }\\n return ret;\\n}\\n\\nint main(){\\n int dn=0;\\n while(1){\\n dn++;\\n int n;\\n cin >> n;\\n if(n == 0) break;\\n\\n VP p(n);\\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n cout << fixed << setprecision(10);\\n cout << \\\"Case \\\" << dn << \\\": \\\" << solve(p) << endl;\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 4048,\n \"score_of_the_acc\": -1.4138,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2394_2994986\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ld = long double;\\nconst ld eps = 1e-10, pi = acos(-1.0);\\n\\nbool eq(ld a, ld b) {\\n\\treturn abs(a - b) < eps;\\n}\\n\\nusing Point = complex<ld>;\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n};\\nld dot(Point a, Point b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\nld cross(Point a, Point b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\nint ccw(Point a, Point b, Point c) {\\n\\tb -= a, c -= a;\\n\\tif (cross(b, c) > eps) return 1;\\t// a,b,c counter-clockwise\\n\\tif (cross(b, c) < -eps) return -1;\\t// a,b,c clockwise\\n\\tif (dot(b, c) < 0) return 2;\\t\\t// c,a,b on a line\\n\\tif (norm(b) < norm(c)) return -2;\\t// a,b,c on a line\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t// a,c,b on a line\\n}\\n\\nbool isis_ll(Line l, Line m) {\\n\\treturn abs(cross(l.b - l.a, m.b - m.a)) > eps;\\n}\\n\\nbool isis_ls(Line l, Line s) {\\n\\treturn (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\nbool isis_lp(Line l, Point p) {\\n\\treturn abs(cross(l.b - p, l.a - p)) < eps;\\n}\\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\\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}\\n\\nPoint is_ll(Line s, Line t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tassert(cross(sv, tv) != 0);\\n\\treturn s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);\\n}\\n\\nbool isis_ss(Line s, Line t) {\\n\\tif (isis_ll(s, t)) return isis_ls(s, t) && isis_ls(t, s);\\n\\treturn isis_sp(s, t.a) || isis_sp(s, t.b) || isis_sp(t, s.a);\\n}\\n\\nld dist_lp(Line l, Point p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\nld dist_ll(Line l, Line m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\nld dist_ls(Line l, Line s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\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\\nld dist_ss(Line s, Line t) {\\n\\tif (isis_ss(s, t)) return 0;\\n\\treturn min({ dist_sp(s, t.a), dist_sp(s, t.b), dist_sp(t, s.a), dist_sp(t, s.b) });\\n}\\n\\nbool is_in_polygon(const vector<Point>& poly, const Point& p) {\\n\\tint n = poly.size();\\n\\tld sum = 0;\\n\\tfor (int i = 0; i < n; ++i) {\\n\\t\\tPoint p1 = poly[i], p2 = poly[(i + 1) % n];\\n\\t\\tif (isis_sp((Line) { p1, p2 }, p)) return true;\\n\\t\\tsum += arg((p2 - p) / (p1 - p));\\n\\t}\\n\\treturn abs(sum) > pi;\\n}\\n\\nld calc(const Line& l, const vector<Point>& ps) {\\n\\tint n = ps.size();\\n\\tPoint v = l.b - l.a;\\n\\tassert(abs(v) > eps);\\n\\tv /= abs(v);\\n\\tvector<ld> pos = { 0, abs(l.b - l.a) };\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tLine s = { ps[i], ps[(i + 1) % n] };\\n\\t\\tif (abs(cross(l.b - l.a, s.b - s.a)) > eps && isis_ss(l, s)) {\\n\\t\\t\\tauto pp = is_ll(l, s);\\n\\t\\t\\tld x = dot(pp - l.a, v);\\n\\t\\t\\tif (0 < x && x < pos[1]) pos.push_back(x);\\n\\t\\t}\\n\\t}\\n\\tsort(pos.begin(), pos.end());\\n\\tld res = 0;\\n\\tfor (int i = 1; i < (int)pos.size(); i++) {\\n\\t\\tif (!is_in_polygon(ps, l.a + v * ((pos[i] + pos[i - 1]) / 2.0))) break;\\n\\t\\tres = pos[i];\\n\\t}\\n\\treturn res;\\n}\\n\\nint main()\\n{\\n\\tios::sync_with_stdio(false), cin.tie(0);\\n\\tcout << fixed << setprecision(10);\\n\\tint n, tcase = 0;\\n\\twhile (cin >> n, n) {\\n\\t\\tvector<Point> ps;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tld x, y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tps.emplace_back(x, y);\\n\\t\\t}\\n\\t\\tld res = 0;\\n\\t\\tfor (int i = 0; i < n; i++) {\\n\\t\\t\\tfor (int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tLine l = { ps[i], ps[j] };\\n\\t\\t\\t\\tif (calc(l, ps) < abs(l.a - l.b) - eps) continue;\\n\\t\\t\\t\\tPoint v = ps[j] - ps[i];\\n\\t\\t\\t\\tassert(abs(v) > eps);\\n\\t\\t\\t\\tv /= abs(v);\\n\\t\\t\\t\\tPoint p1 = ps[j] + v * calc((Line) { ps[j], ps[j] + v * (ld)1e5 }, ps);\\n\\t\\t\\t\\tPoint p2 = ps[i] - v * calc((Line) { ps[i], ps[i] - v * (ld)1e5 }, ps);\\n\\t\\t\\t\\tres = max(res, abs(p1 - p2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << \\\"Case \\\" << ++tcase << \\\": \\\" << res << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -1.6139,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2394_2766836\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int SIZE = 210;\\nconst double eps = 1e-15;\\n\\ntypedef long long ll;\\ntypedef long double ld;\\n\\ntypedef complex<ll> P;\\ntypedef complex<ld> Pd;\\n\\ninline ll dot(P a, P b){\\n return (a * conj(b)).real();\\n}\\n\\ninline ll cross(P a, P b){\\n return (conj(a) * b).imag();\\n}\\n\\nint ccw(P a, P b, P c){\\n ll res1 = cross(b-a, c-a);\\n if(res1 > 0) return 1; //CCW\\n if(res1 < 0) return -1; //CW\\n if(dot(b-a, c-a) < 0) return -2; //c -> a -> b\\n if(dot(a-b, c-b) < 0) return 2; //a -> b -> c\\n return 0;\\n}\\n\\nbool iscollinear(P a1, P a2, P b1, P b2){\\n return abs(cross(a2-a1, b2-b1)) == 0;\\n}\\n\\nint isInterSS(P a1, P a2, P b1, P b2){\\n if(iscollinear(a1, a2, b1, b2)) return false;\\n \\n int a = ccw(b1, b2, a1);\\n int b = ccw(b1, b2, a2);\\n int c = ccw(a1, a2, b1);\\n int d = ccw(a1, a2, b2);\\n\\n if(a*b <= 0 && c*d < 0) return 1;\\n if(a*b <= 0 && c == 0) return -1;\\n if(a*b <= 0 && d == 0) return -2;\\n return 0;\\n}\\n\\nint isInterLS(P a1, P a2, P b1, P b2){\\n if(iscollinear(a1, a2, b1, b2)) return false;\\n\\n int c = ccw(a1, a2, b1);\\n int d = ccw(a1, a2, b2);\\n \\n if(abs(c) != 1) return -1;\\n if(abs(d) != 1) return -2;\\n if(c*d < 0) return 1;\\n return 0;\\n}\\n\\nbool iscontainedPP(int n, P *g, P p){\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] - p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) <= 0 && dot(a,b) <= 0) return true;\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() <= 0 && 0 < b.imag() && cross(a,b) > 0) f = !f;\\n }\\n return f;\\n}\\n\\nPd getCrossPoint(P a1, P a2, P b1, P b2){\\n P a = a2 - a1;\\n P b = b2 - b1;\\n Pd ad = Pd(a.real(), a.imag());\\n Pd a1d = Pd(a1.real(), a1.imag());\\n return a1d + ad * (ld)cross(b, b1-a1) / (ld)cross(b, a);\\n}\\n\\ndouble absll(P a){\\n return sqrt(a.real() * a.real() + a.imag() * a.imag());\\n}\\n\\nPd toPd(P a){\\n return Pd(a.real(), a.imag());\\n}\\n\\nint T = 0;\\n\\nbool solve(){\\n int n;\\n int x[SIZE], y[SIZE];\\n P p[SIZE];\\n Pd pd[SIZE];\\n \\n if(scanf(\\\"%d\\\",&n) == EOF) return false;\\n if(n == 0) return false;\\n \\n printf(\\\"Case %d: \\\",++T);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\",x+i, y+i);\\n p[i] = P(x[i], y[i]);\\n pd[i] = Pd(x[i], y[i]);\\n }\\n\\n bool inS[SIZE][SIZE][2][2] = {}; // [a][b][{a:0,b:1}][{0:in,1:out}]\\n \\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n if(i == j) continue;\\n \\n P a = p[(i-1+n)%n];\\n P b = p[i];\\n P c = p[(i+1)%n];\\n P d = p[j];\\n\\n int r1 = ccw(b, a, c);\\n int r2 = ccw(b, a, d);\\n int r3 = ccw(b, d, c);\\n \\n inS[i][j][0][0] = (r2 == 2 || r2 == 0 || r3 == 2 || r3 == 0); // online\\n inS[i][j][0][0] |= (r1 == 1 && (r2 * r3 == -1 || r2 == -2 || r3 == -2));\\n inS[i][j][0][0] |= (r2 == -1 && r3 == -1);\\n\\n //cerr << i << \\\" \\\" << j << \\\" : \\\" << inS[i][j][0][0] << \\\" \\\" << inS[i][j][0][1] << endl;\\n //cerr << r1 << \\\" \\\" << r2 << \\\" \\\" << r3 << endl;\\n \\n d = b * 2LL - d;\\n r2 = ccw(b, a, d);\\n r3 = ccw(b, d, c);\\n \\n inS[i][j][0][1] = (r2 == 2 || r2 == 0 || r3 == 2 || r3 == 0); // online\\n inS[i][j][0][1] |= (r1 == 1 && (r2 * r3 == -1 || r2 == -2 || r3 == -2));\\n inS[i][j][0][1] |= (r2 == -1 && r3 == -1);\\n\\n inS[j][i][1][0] = inS[i][j][0][0];\\n inS[j][i][1][1] = inS[i][j][0][1];\\n\\n //cerr << i << \\\" \\\" << j << \\\" : \\\" << inS[i][j][0][0] << \\\" \\\" << inS[i][j][0][1] << endl;\\n //cerr << r1 << \\\" \\\" << r2 << \\\" \\\" << r3 << endl;\\n }\\n }\\n\\n double ans = 0;\\n\\n for(int i=0;i<n;i++){\\n ans = max(ans, absll(p[i] - p[(i+1)%n]));\\n }\\n \\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n bool f = true;\\n\\n if (i+1 != j){\\n for(int k=0;k<n;k++){\\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\\n\\n int resISS = isInterSS(p[i], p[j], p[k], p[(k+1)%n]);\\n \\n if(resISS == 1 ||\\n (resISS == -1 && (!inS[i][k][1][1] || !inS[i][k][1][0])) ||\\n (resISS == -2 && (!inS[i][(k+1)%n][1][1] || !inS[i][(k+1)%n][1][0]))){\\n f = false;\\n break;\\n }\\n\\n }\\n if (!f) continue;\\n }\\n \\n Pd cp1, cp2;\\n bool cp1f = false, cp2f = false;\\n \\n for(int k=0;k<n;k++){\\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\\n \\n int resILS = isInterLS(p[i], p[j], p[k], p[(k+1)%n]);\\n Pd cp = getCrossPoint(p[i], p[j], p[k], p[(k+1)%n]);\\n \\n if(resILS){\\n bool near1 = false;\\n bool near2 = false;\\n \\n if(abs(pd[i] - cp) < abs(pd[j] - cp)){\\n if (!cp1f || abs(pd[i] - cp) < abs(pd[i] - cp1)){\\n if(resILS == 1 ||\\n (resILS == -1 && !inS[i][k][1][1]) ||\\n (resILS == -2 && !inS[i][(k+1)%n][1][1]))\\n near1 = true;\\n }\\n }else{\\n if (!cp2f || abs(pd[j] - cp) < abs(pd[j] - cp2)){\\n if(resILS == 1 ||\\n (resILS == -1 && !inS[j][k][1][1]) ||\\n (resILS == -2 && !inS[j][(k+1)%n][1][1]))\\n near2 = true;\\n }\\n }\\n \\n if(near1){\\n cp1 = cp; cp1f = true;\\n }\\n \\n if(near2){\\n cp2 = cp; cp2f = true;\\n }\\n }\\n }\\n\\n \\n if(inS[i][j][0][0]){\\n ans = max(ans, absll(p[i] - p[j]));\\n } else {\\n continue;\\n }\\n\\n //1\\n \\n if (cp1f && inS[i][j][0][1]){\\n ans = max(ans, (double)abs(pd[j] - cp1));\\n }\\n \\n //2\\n if (cp2f && inS[i][j][1][1]) {\\n ans = max(ans, (double)abs(cp2 - pd[i]));\\n if(cp1f && inS[i][j][0][1])\\n ans = max(ans, (double)abs(cp1-cp2));\\n }\\n }\\n }\\n \\n printf(\\\"%.10lf\\\\n\\\",(double)ans);\\n \\n return true;\\n}\\n \\n\\nint main(){\\n //while(solve());\\n\\n for(int i=0;;i++){\\n if(!solve()) break;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.7575,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2394_2765841\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int SIZE = 210;\\nconst double eps = 1e-10;\\n\\ntypedef complex<double> P;\\n\\ninline double dot(P a, P b){\\n return (a * conj(b)).real();\\n}\\n\\ninline double cross(P a, P b){\\n return (conj(a) * b).imag();\\n}\\n\\nint ccw(P a, P b, P c){\\n double res1 = cross(b-a, c-a);\\n if(res1 > eps) return 1;\\n if(res1 < -eps) return -1;\\n if(dot(b-a, c-a) < -eps) return -2;\\n if(dot(a-b, c-b) < -eps) return 2;\\n return 0;\\n}\\n\\nbool iscollinear(P a1, P a2, P b1, P b2){\\n return abs(cross(a2-a1, b2-b1)) < eps;\\n}\\n\\nint isInterSS(P a1, P a2, P b1, P b2){\\n if(iscollinear(a1, a2, b1, b2)) return false;\\n \\n int a = ccw(b1, b2, a1);\\n int b = ccw(b1, b2, a2);\\n int c = ccw(a1, a2, b1);\\n int d = ccw(a1, a2, b2);\\n\\n if(a*b <= 0 && c*d < 0) return 1;\\n if(a*b <= 0 && c == 0) return -1;\\n if(a*b <= 0 && d == 0) return -2;\\n return 0;\\n}\\n\\nint isInterLS(P a1, P a2, P b1, P b2){\\n if(iscollinear(a1, a2, b1, b2)) return false;\\n\\n int c = ccw(a1, a2, b1);\\n int d = ccw(a1, a2, b2);\\n \\n if(c == 0) return -1;\\n if(d == 0) return -2;\\n if(c*d < 0) return 1;\\n return 0;\\n}\\n\\nbool iscontainedPP(int n, P *g, P p){\\n bool f = false;\\n for(int i=0;i<n;i++){\\n P a = g[i] -p, b = g[(i+1)%n] - p;\\n if(abs(cross(a,b)) < eps && dot(a,b) < eps) return true;\\n if(a.imag() > b.imag()) swap(a,b);\\n if(a.imag() < eps && eps < b.imag() && cross(a,b) > eps) f = !f;\\n }\\n return f;\\n}\\n\\nP getCrossPoint(P a1, P a2, P b1, P b2){\\n P a = a2 - a1;\\n P b = b2 - b1;\\n return a1 + a * cross(b, b1-a1) / cross(b, a);\\n}\\n\\nint T = 0;\\n\\nbool solve(){\\n int n;\\n int x[SIZE], y[SIZE];\\n P p[SIZE];\\n \\n if(scanf(\\\"%d\\\",&n) == EOF) return false;\\n if(n == 0) return false;\\n\\n printf(\\\"Case %d: \\\",++T);\\n \\n for(int i=0;i<n;i++){\\n scanf(\\\"%d%d\\\",x+i, y+i);\\n p[i] = P(x[i], y[i]);\\n }\\n\\n bool inS[SIZE][SIZE][2][2] = {}; // [a][b][{a:0,b:1}][0:in,1:out}]\\n \\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n auto dir = (p[j] - p[i]); //i->j\\n double e = 1e10;\\n if (abs(dir.imag()) > eps) e = min(e, abs(dir.imag()));\\n if (abs(dir.real()) > eps) e = min(e, abs(dir.real()));\\n dir = dir / e * 1e-7;\\n\\n inS[i][j][0][0] = iscontainedPP(n, p, p[i] + dir);\\n inS[i][j][0][1] = iscontainedPP(n, p, p[i] - dir);\\n inS[i][j][1][0] = iscontainedPP(n, p, p[j] - dir);\\n inS[i][j][1][1] = iscontainedPP(n, p, p[j] + dir);\\n inS[j][i][0][0] = inS[j][i][1][0];\\n inS[j][i][0][1] = inS[j][i][1][1];\\n inS[j][i][1][0] = inS[j][i][0][0];\\n inS[j][i][1][1] = inS[j][i][0][1];\\n }\\n }\\n\\n double ans = 0;\\n\\n for(int i=0;i<n;i++){\\n ans = max(ans,abs(p[i] - p[(i+1)%n]));\\n }\\n \\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n bool f = true;\\n\\n if (i+1 != j){\\n for(int k=0;k<n;k++){\\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\\n\\n int resISS = isInterSS(p[i], p[j], p[k], p[(k+1)%n]);\\n \\n if(resISS == 1 ||\\n (resISS == -1 && (!inS[i][k][1][1] || !inS[i][k][1][0])) ||\\n (resISS == -2 && (!inS[i][(k+1)%n][1][1] || !inS[i][(k+1)%n][1][0]))){\\n f = false;\\n break;\\n }\\n }\\n\\n if (!f) continue;\\n }\\n \\n P cp1, cp2;\\n bool cp1f = false, cp2f = false;\\n \\n for(int k=0;k<n;k++){\\n if(k == i || (k+1)%n == i || k == j || (k+1)%n == j) continue;\\n \\n int resILS = isInterLS(p[i], p[j], p[k], p[(k+1)%n]);\\n P cp = getCrossPoint(p[i], p[j], p[k], p[(k+1)%n]);\\n \\n if(resILS){\\n bool near1 = false;\\n bool near2 = false;\\n \\n if(abs(p[i] - cp) < abs(p[j] - cp)){\\n if (!cp1f || abs(p[i] - cp) < abs(p[i] - cp1)){\\n if(resILS == 1 ||\\n (resILS == -1 && !inS[i][k][1][1]) ||\\n (resILS == -2 && !inS[i][(k+1)%n][1][1]))\\n near1 = true;\\n }\\n }else{\\n if (!cp2f || abs(p[j] - cp) < abs(p[j] - cp2)){\\n if(resILS == 1 ||\\n (resILS == -1 && !inS[j][k][1][1]) ||\\n (resILS == -2 && !inS[j][(k+1)%n][1][1]))\\n near2 = true;\\n }\\n }\\n \\n if(near1){\\n cp1 = cp; cp1f = true;\\n }\\n \\n if(near2){\\n cp2 = cp; cp2f = true;\\n }\\n }\\n\\n //cerr << i << \\\" \\\" << j << \\\" \\\" << k << \\\" : \\\" << resILS << endl;\\n }\\n\\n \\n if(inS[i][j][0][0]){\\n ans = max(ans, abs(p[i] - p[j]));\\n } else {\\n continue;\\n }\\n\\n //1\\n \\n if (cp1f && inS[i][j][0][1]){\\n ans = max(ans, abs(p[j] - cp1));\\n }\\n \\n //2\\n if (cp2f && inS[i][j][1][1]) {\\n ans = max(ans, abs(cp2 - p[i]));\\n if(cp1f && inS[i][j][0][1])\\n ans = max(ans, abs(cp1-cp2));\\n }\\n\\n //cerr << i << \\\" \\\" << j << \\\" : \\\" << ans << endl;\\n }\\n }\\n\\n printf(\\\"%.10lf\\\\n\\\",ans);\\n \\n return true;\\n}\\n \\n\\nint main(){\\n //while(solve());\\n\\n for(int i=0;;i++){\\n if(!solve()) break;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.8265,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2394_2149008\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cstdio>\\n#include<cmath>\\n#include<ctime>\\n#include<algorithm>\\n#include<list>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<bitset>\\n#include<string>\\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\\n#define sqr(v) ((v)*(v))\\n#define mb make_pair\\n#define debug 0\\nusing namespace std;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef pair<int,int> PII;\\ntypedef pair<int,LL> PIL;\\ntypedef pair<LL,int> PLI;\\ntypedef pair<LL,LL> PLL;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst int maxn=101;\\nstruct Point\\n{\\n double x,y;\\n Point(){}\\n Point(double X,double Y)\\n {\\n x=X;y=Y;\\n }\\n bool operator <(const Point &p)const\\n {\\n if(sgn(x-p.x))return x<p.x;\\n else return y<p.y;\\n }\\n bool operator ==(const Point &p)const\\n {\\n return sgn(x-p.x)==0&&sgn(y-p.y)==0;\\n }\\n Point operator -(const Point &p)\\n {\\n return Point(x-p.x,y-p.y);\\n }\\n Point operator +(const Point &p)\\n {\\n return Point(x+p.x,y+p.y);\\n }\\n double cross(const Point &p)const\\n {\\n return x*p.y-y*p.x;\\n }\\n double len()\\n {\\n return sqrt(sqr(x)+sqr(y));\\n }\\n void unit()\\n {\\n double tmp=len();\\n x/=tmp;\\n y/=tmp;\\n x*=0.0001;\\n y*=0.0001;\\n }\\n}pt[maxn];\\nstruct Segment\\n{\\n Point st,ed;\\n};\\ndouble cross(const Point &p,const Point &q)\\n{\\n return p.x*q.y-p.y*q.x;\\n}\\ndouble dot(const Point &p,const Point &q)\\n{\\n return p.x*q.x+p.y*q.y;\\n}\\nPoint Insect(Segment &p,Segment &q)\\n{\\n double u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\\n return Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\\n}\\nvector<Point> tp,sp;\\nint n,cas;\\nint check(Point P,int deb)\\n{\\n int con=0;\\n Segment now,tmp;\\n Point cp;\\n now.st=P;\\n con=0;\\n now.ed.x=P.x+19950527;\\n now.ed.y=P.y+27051995;\\n for(int i=0;i<n;++i)\\n {\\n tmp.st=pt[i];\\n tmp.ed=pt[(i+1)%n];\\n if(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n {\\n cp=Insect(tmp,now);\\n if(cp==tmp.ed||cp==tmp.st)while(1);\\n if(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\\n ++con;\\n }\\n }\\n return con%2;\\n}\\n \\ndouble check(int i,int j)\\n{\\n Segment now,tmp;\\n Point cp;\\n tp.clear();\\n now.st=pt[i];\\n now.ed=pt[j];\\n for(i=0;i<n;++i)\\n {\\n tmp.st=pt[i];\\n tmp.ed=pt[(i+1)%n];\\n if(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n {\\n cp=Insect(tmp,now);\\n if(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\\n tp.push_back(cp);\\n else if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0) // endpoints\\n {\\n if(cp==tmp.st)j=i;\\n else j=i+1;\\n if(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\\n tp.push_back(cp);\\n }\\n }\\n else if(sgn((tmp.st-now.st).cross(now.ed-now.st))==0&&sgn((tmp.ed-now.st).cross(now.ed-now.st))==0)\\n {\\n Point vec=tmp.ed-tmp.st;\\n vec.unit();\\n if(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\\n {\\n if(!check(tmp.st-vec,0))\\n tp.push_back(tmp.st);\\n if(!check(tmp.ed+vec,0))\\n tp.push_back(tmp.ed);\\n }\\n }\\n }\\n sort(tp.begin(),tp.end());\\n int n=tp.size();\\n sp.clear();\\n for(i=0;i<n;++i)\\n if(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\\n double ans=0;\\n for(i=0;i<sp.size();i+=2)\\n ans=max(ans,(sp[i+1]-sp[i]).len());\\n return ans;\\n}\\nint main()\\n{\\n int i,j;\\n cas=0;\\n while(scanf(\\\"%d\\\",&n)!=EOF)\\n {\\n if(n==0)break;\\n double len=0;\\n for(i=0;i<n;++i)\\n scanf(\\\"%lf%lf\\\",&pt[i].x,&pt[i].y);\\n for(i=0;i<n;++i)\\n len=max(len,(pt[i]-pt[(i+1)%n]).len());\\n for(i=0;i<n;++i)\\n for(j=i+1;j<n;++j)\\n len=max(len,check(i,j));\\n printf(\\\"Case %d: %.10f\\\\n\\\",++cas,len);\\n //cout <<len*len<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3112,\n \"score_of_the_acc\": -0.6758,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2394_2122383\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e16\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi acos(-1)\\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 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 equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\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 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{ return fabs(x-p.x)<eps && fabs(y-p.y)<eps; }\\n bool operator<(Point p)const{ \\n return equals(x,p.x) ? y-p.y<-eps : x-p.x<-eps; }\\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\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Segment s,Segment t){\\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\\n}\\n\\nbool intersect(Line L,Segment s){\\n return cross(L.p2-L.p1,s.p1-L.p1)*cross(L.p2-L.p1,s.p2-L.p1)<eps;\\n}\\n\\nPoint getCrossPointLL(Line a,Line b){\\n double A=cross(a.p2-a.p1,b.p2-b.p1);\\n double B=cross(a.p2-a.p1,a.p2-b.p1);\\n if(abs(A)<eps)return b.p1;\\n return b.p1+(b.p2-b.p1)*(B/A);\\n}\\n\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\n}\\n\\nint n;\\nPolygon p;\\n\\ndouble cal(Line L){\\n vector<Point> vp;\\n FOR(i,0,n){\\n Segment s(p[i],p[(i+1)%n]);\\n if(isParallel(L,s))continue;\\n if(!intersect(L,s))continue;\\n vp.pb(getCrossPointLL(L,s));\\n }\\n sort(all(vp));\\n vp.erase(unique(all(vp)),vp.end());\\n double sum=0,res=0;\\n FOR(i,0,vp.size()-1){\\n Point a=vp[i],b=vp[i+1];\\n if(a==b)continue;\\n Point m=a+(b-a)/2.0;\\n if(contains(p,m)==0)sum=0;\\n else { sum+=abs(b-a); res=max(res,sum); }\\n }\\n return res;\\n}\\n\\ndouble solve(){\\n double res=0;\\n FOR(i,0,n){\\n FOR(j,i+1,n)res=max(res,cal(Line(p[i],p[j])));\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n int c=1;\\n while(cin>>n && n){\\n p.clear();\\n FOR(i,0,n){\\n double x,y;\\n cin>>x>>y;\\n p.pb(Point(x,y));\\n }\\n cout<<\\\"Case \\\"<<c<<\\\": \\\"; pd(solve());\\n c++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.749,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2394_2122047\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e16\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi acos(-1)\\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 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 equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\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 vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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{ return fabs(x-p.x)<eps && fabs(y-p.y)<eps;}\\n bool operator<(Point p)const{ return \\n ( x!=p.x ? x-p.x<eps : y-p.y<eps);}\\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\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Segment s,Segment t){\\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\\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\\nbool intersect(Line L,Segment s){\\n return ccw(L.p1,L.p2,s.p1) * ccw(L.p1,L.p2,s.p2)<=0;\\n}\\n\\nPoint getCrossPointLL(Line a,Line b){\\n double A=cross(a.p2-a.p1,b.p2-b.p1);\\n double B=cross(a.p2-a.p1,a.p2-b.p1);\\n if(abs(A)<eps || abs(B)<eps)return b.p1;\\n return b.p1+(b.p2-b.p1)*(B/A);\\n}\\n\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\n}\\n\\nint n;\\nPolygon p;\\n\\ndouble cal(Line L){\\n vector<pair<double,Point> > vp;\\n Point mdp=getCrossPointLL(L,Line(Point(2000,-2000),Point(-2000,-2000)));\\n FOR(i,0,n){\\n Segment s(p[i],p[(i+1)%n]);\\n if(isParallel(L,s))continue;\\n if(!intersect(L,s))continue;\\n Point m=getCrossPointLL(L,s);\\n vp.pb(mp(abs(mdp-m),m));\\n }\\n sort(all(vp));\\n vp.erase(unique(all(vp)),vp.end());\\n double sum=0,res=0;\\n FOR(i,0,vp.size()-1){\\n Point a=vp[i].s,b=vp[i+1].s;\\n Point m=a+(b-a)/4.0;\\n if(contains(p,m)==0)sum=0;\\n else {\\n sum+=abs(b-a);\\n res=max(res,sum);\\n }\\n }\\n return res;\\n}\\n\\ndouble solve(){\\n double res=0;\\n FOR(i,0,n){\\n FOR(j,i+1,n)res=max(res,cal(Line(p[i],p[j])));\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n int c=1;\\n while(cin>>n && n){\\n p.clear();\\n FOR(i,0,n){\\n double x,y;\\n cin>>x>>y;\\n p.pb(Point(x,y));\\n }\\n cout<<\\\"Case \\\"<<c<<\\\": \\\";\\n pd(solve());\\n c++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.7964,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2394_2079770\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e16\\n#define eps (1e-6)\\n#define mod 1000000007\\n#define pi acos(-1)\\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 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 equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\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 vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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 (x!=p.x ? x-p.x<-eps : y-p.y<-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\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Segment s,Segment t){\\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\\n}\\n\\nPoint getCrossPointLL(Line a,Line b){\\n double A=cross(a.p2-a.p1,b.p2-b.p1);\\n double B=cross(a.p2-a.p1,a.p2-b.p1);\\n if(abs(A)<eps || abs(B)<eps)return b.p1;\\n return b.p1+(b.p2-b.p1)*(B/A);\\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\\nbool intersect(Point p1,Point p2,Point p3,Point p4){\\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 &&\\n ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\\n}\\n\\nbool intersect(Segment s1,Segment s2){\\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool intersectLS(Line l,Segment s){\\n if(cross(l.p2-l.p1,s.p1-l.p1)*\\n cross(l.p2-l.p1,s.p2-l.p1)<eps)return true;\\n return false;\\n}\\n \\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\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\\nvector<Line> getTangent(Polygon a,Polygon b){\\n vector<Line> res;\\n int n=a.size(),m=b.size();\\n\\n FOR(i,0,n){\\n FOR(j,0,m){\\n int bi=(i+n-1)%n,bj=(j+m-1)%m;\\n int ni=(i+1)%n,nj=(j+1)%m;\\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\\n res.pb(Line(a[i],b[j]));\\n }\\n }\\n }\\n return res;\\n}\\n\\nint n;\\nPolygon p;\\n\\nbool check(Segment a){\\n if(contains(p,a.p1)==0)return false;\\n if(contains(p,a.p2)==0)return false;\\n vector<pair<double,Point> > vdp;\\n vdp.pb(mp(0,a.p1));\\n vdp.pb(mp(abs(a.p1-a.p2),a.p2));\\n FOR(i,0,n){\\n Segment b(p[i],p[(i+1)%n]);\\n if(isParallel(a,b))continue;\\n if(!intersect(a,b))continue;\\n Point c=getCrossPointLL(a,b);\\n vdp.pb(mp(abs(a.p1-c),c));\\n }\\n sort(all(vdp));\\n FOR(i,0,vdp.size()-1){\\n Point c=vdp[i].s,d=vdp[i+1].s;\\n if(c==d)continue;\\n Point m=c+(d-c)/2.0;\\n if(contains(p,m)==0)return false;\\n }\\n return true;\\n}\\n\\ndouble get(Polygon s,Line l){\\n vector<Point> vp;\\n FOR(i,0,s.size()){\\n Point a=s[i],b=s[(i+1)%s.size()];\\n if(isParallel(l,Segment(a,b)))continue;\\n if(!intersectLS(l,Segment(a,b)))continue;\\n Point c=getCrossPointLL(l,Segment(a,b));\\n if(!(c==b))vp.pb(c);\\n }\\n double res=0;\\n FOR(i,0,vp.size()){\\n FOR(j,i+1,vp.size()){\\n if(check(Segment(vp[i],vp[j])))res=max(res,abs(vp[i]-vp[j]));\\n }\\n }\\n return res;\\n}\\n\\ndouble solve(){\\n double res=0.0;\\n FOR(i,0,n)res=max(res,abs(p[i]-p[(i+1)%n]));\\n\\n FOR(i,0,n-2){\\n FOR(j,i+2,n){\\n if((j+1)%n==i)continue;\\n Polygon R,L,s;\\n s.pb(p[i]);\\n s.pb(p[(i+1)%n]);\\n s.pb(p[j]);\\n s.pb(p[(j+1)%n]);\\n\\n s=convex_hull(s); \\n\\n for(int k=(i+1)%n;k!=(j+1)%n;k=(k+1)%n)\\n if(contains(s,p[k])!=0)R.pb(p[k]);\\n for(int k=(j+1)%n;k!=(i+1)%n;k=(k+1)%n)\\n if(contains(s,p[k])!=0)L.pb(p[k]);\\n R=convex_hull(R);\\n L=convex_hull(L);\\n vector<Line> vs = getTangent(R,L);\\n FOR(k,0,R.size()){\\n res=max(res,get(s,Segment(R[k],R[(k+1)%R.size()])));\\n }\\n FOR(k,0,L.size()){\\n res=max(res,get(s,Segment(L[k],L[(k+1)%L.size()])));\\n }\\n FOR(k,0,vs.size()){\\n res=max(res,get(s,vs[k]));\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n int c=1;\\n while(cin>>n && n){\\n p.clear();\\n FOR(i,0,n){\\n int x,y;\\n cin>>x>>y;\\n p.pb(Point(x,y));\\n }\\n cout<<\\\"Case \\\"<<c<<\\\": \\\";\\n pd(solve());\\n c++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.2892,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2394_2079547\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e16\\n#define eps (1e-6)\\n#define mod 1000000007\\n#define pi acos(-1)\\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 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 equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\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 vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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 (x!=p.x ? x-p.x<-eps : y-p.y<-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\\nbool isParallel(Vector a,Vector b){\\n return equals(cross(a,b),0.0);\\n}\\n\\nbool isParallel(Segment s,Segment t){\\n return equals(cross(s.p1-s.p2,t.p1-t.p2),0.0);\\n}\\n\\nPoint getCrossPointLL(Line a,Line b){\\n double A=cross(a.p2-a.p1,b.p2-b.p1);\\n double B=cross(a.p2-a.p1,a.p2-b.p1);\\n if(abs(A)<eps || abs(B)<eps)return b.p1;\\n return b.p1+(b.p2-b.p1)*(B/A);\\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\\nbool intersect(Point p1,Point p2,Point p3,Point p4){\\n return (ccw(p1,p2,p3)*ccw(p1,p2,p4)<=0 &&\\n ccw(p3,p4,p1)*ccw(p3,p4,p2)<=0);\\n}\\n\\nbool intersect(Segment s1,Segment s2){\\n return intersect(s1.p1,s1.p2,s2.p1,s2.p2);\\n}\\n\\nbool intersectLS(Line l,Segment s){\\n if(cross(l.p2-l.p1,s.p1-l.p1)*\\n cross(l.p2-l.p1,s.p2-l.p1)<eps)return true;\\n return false;\\n}\\n \\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\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\\nvector<Line> getTangent(Polygon a,Polygon b){\\n vector<Line> res;\\n int n=a.size(),m=b.size();\\n\\n FOR(i,0,n){\\n FOR(j,0,m){\\n int bi=(i+n-1)%n,bj=(j+m-1)%m;\\n int ni=(i+1)%n,nj=(j+1)%m;\\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=1 && ccw(a[i],b[j],a[bi])!=1 &&\\n ccw(a[i],b[j],b[nj])!=-1 && ccw(a[i],b[j],b[bj])!=-1 ){\\n res.pb(Line(a[i],b[j]));\\n }\\n if(ccw(a[i],b[j],a[ni])!=-1 && ccw(a[i],b[j],a[bi])!=-1 &&\\n ccw(a[i],b[j],b[nj])!=1 && ccw(a[i],b[j],b[bj])!=1){\\n res.pb(Line(a[i],b[j]));\\n }\\n }\\n }\\n return res;\\n}\\n\\nint n;\\nPolygon p;\\n\\nbool check(Segment a){\\n if(contains(p,a.p1)==0)return false;\\n if(contains(p,a.p2)==0)return false;\\n vector<pair<double,Point> > vdp;\\n vdp.pb(mp(0,a.p1));\\n vdp.pb(mp(abs(a.p1-a.p2),a.p2));\\n FOR(i,0,n){\\n Segment b(p[i],p[(i+1)%n]);\\n if(isParallel(a,b))continue;\\n if(!intersect(a,b))continue;\\n Point c=getCrossPointLL(a,b);\\n vdp.pb(mp(abs(a.p1-c),c));\\n }\\n sort(all(vdp));\\n FOR(i,0,vdp.size()-1){\\n Point c=vdp[i].s,d=vdp[i+1].s;\\n if(c==d)continue;\\n Point m=c+(d-c)/2.0;\\n if(contains(p,m)==0)return false;\\n }\\n return true;\\n}\\n\\ndouble get(Polygon s,Line l){\\n vector<Point> vp;\\n FOR(i,0,s.size()){\\n Point a=s[i],b=s[(i+1)%s.size()];\\n if(isParallel(l,Segment(a,b)))continue;\\n if(!intersectLS(l,Segment(a,b)))continue;\\n Point c=getCrossPointLL(l,Segment(a,b));\\n if(!(c==b))vp.pb(c);\\n }\\n double res=0;\\n FOR(i,0,vp.size()){\\n FOR(j,i+1,vp.size()){\\n \\n // pd(abs(vp[i]-vp[j]));\\n if(check(Segment(vp[i],vp[j])))res=max(res,abs(vp[i]-vp[j]));\\n }\\n }\\n return res;\\n}\\n\\ndouble solve(){\\n double res=0.0;\\n FOR(i,0,n)res=max(res,abs(p[i]-p[(i+1)%n]));\\n\\n FOR(i,0,n-2){\\n FOR(j,i+2,n){\\n if((j+1)%n==i)continue;\\n Polygon R,L,s;\\n s.pb(p[i]);\\n s.pb(p[(i+1)%n]);\\n s.pb(p[j]);\\n s.pb(p[(j+1)%n]);\\n Segment s1(s[0],s[3]),s2(s[1],s[2]);\\n if(intersect(s1,s2))swap(s1.p2,s2.p2);\\n bool flag=true;\\n for(int k=(i+1)%n;k!=j;k=(k+1)%n){\\n Segment seg=Segment(p[k],p[(k+1)%n]);\\n if(isParallel(s1,seg))continue;\\n if(!intersect(s1,seg))continue;\\n Point tmp=getCrossPointLL(s1,seg);\\n if(!(tmp==seg.p1) && !(tmp==seg.p2))flag=false;\\n }\\n for(int k=(j+1)%n;k!=i;k=(k+1)%n){\\n Segment seg=Segment(p[k],p[(k+1)%n]);\\n if(isParallel(s2,seg))continue;\\n if(!intersect(s2,seg))continue;\\n Point tmp=getCrossPointLL(s2,seg);\\n if(!(tmp==seg.p1) && !(tmp==seg.p2))flag=false;\\n }\\n //if(!flag)continue;\\n\\n s=convex_hull(s); \\n\\n for(int k=(i+1)%n;k!=(j+1)%n;k=(k+1)%n)\\n if(contains(s,p[k])!=0)R.pb(p[k]);\\n for(int k=(j+1)%n;k!=(i+1)%n;k=(k+1)%n)\\n if(contains(s,p[k])!=0)L.pb(p[k]);\\n R=convex_hull(R);\\n L=convex_hull(L);\\n vector<Line> vs = getTangent(R,L);\\n FOR(k,0,R.size()){\\n res=max(res,get(s,Segment(R[k],R[(k+1)%R.size()])));\\n }\\n FOR(k,0,L.size()){\\n res=max(res,get(s,Segment(L[k],L[(k+1)%L.size()])));\\n }\\n FOR(k,0,vs.size()){\\n res=max(res,get(s,vs[k]));\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n int c=1;\\n while(cin>>n && n){\\n p.clear();\\n FOR(i,0,n){\\n int x,y;\\n cin>>x>>y;\\n p.pb(Point(x,y));\\n }\\n cout<<\\\"Case \\\"<<c<<\\\": \\\";\\n pd(solve());\\n c++;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -1.328,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2394_1537865\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cstdio>\\n#include<cmath>\\n#include<ctime>\\n#include<algorithm>\\n#include<list>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<bitset>\\n#include<string>\\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\\n#define sqr(v) ((v)*(v))\\n#define mb make_pair\\n#define debug 0\\nusing namespace std;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef pair<int,int> PII;\\ntypedef pair<int,LL> PIL;\\ntypedef pair<LL,int> PLI;\\ntypedef pair<LL,LL> PLL;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst int maxn=101;\\nstruct Point\\n{\\n\\tdouble x,y;\\n\\tPoint(){}\\n\\tPoint(double X,double Y)\\n\\t{\\n\\t\\tx=X;y=Y;\\n\\t}\\n\\tbool operator <(const Point &p)const\\n\\t{\\n\\t\\tif(sgn(x-p.x))return x<p.x;\\n\\t\\telse return y<p.y;\\n\\t}\\n\\tbool operator ==(const Point &p)const\\n\\t{\\n\\t\\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\\n\\t}\\n\\tPoint operator -(const Point &p)\\n\\t{\\n\\t\\treturn Point(x-p.x,y-p.y);\\n\\t}\\n\\tPoint operator +(const Point &p)\\n\\t{\\n\\t\\treturn Point(x+p.x,y+p.y);\\n\\t}\\n\\tdouble cross(const Point &p)const\\n\\t{\\n\\t\\treturn x*p.y-y*p.x;\\n\\t}\\n\\tdouble len()\\n\\t{\\n\\t\\treturn sqrt(sqr(x)+sqr(y));\\n\\t}\\n\\tvoid unit()\\n\\t{\\n\\t\\tdouble tmp=len();\\n\\t\\tx/=tmp;\\n\\t\\ty/=tmp;\\n\\t\\tx*=0.0001;\\n\\t\\ty*=0.0001;\\n\\t}\\n}pt[maxn];\\nstruct Segment\\n{\\n\\tPoint st,ed;\\n};\\ndouble cross(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.y-p.y*q.x;\\n}\\ndouble dot(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.x+p.y*q.y;\\n}\\nPoint Insect(Segment &p,Segment &q)\\n{\\n\\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\\n\\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\\n}\\nvector<Point> tp,sp;\\nint n,cas;\\nint check(Point P,int deb)\\n{\\n\\tint con=0;\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\tnow.st=P;\\n\\tcon=0;\\n\\tnow.ed.x=P.x+19950527;\\n\\tnow.ed.y=P.y+27051995;\\n\\tfor(int i=0;i<n;++i)\\n\\t{\\n\\t\\ttmp.st=pt[i];\\n\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t{\\n\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\tif(cp==tmp.ed||cp==tmp.st)while(1);\\n\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\\n\\t\\t\\t\\t++con;\\n\\t\\t}\\n\\t}\\n\\treturn con%2;\\n}\\n\\t\\ndouble check(int i,int j)\\n{\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\ttp.clear();\\n\\tnow.st=pt[i];\\n\\tnow.ed=pt[j];\\n\\tfor(i=0;i<n;++i)\\n\\t{\\n\\t\\ttmp.st=pt[i];\\n\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t{\\n\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\\n\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0) // endpoints\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cp==tmp.st)j=i;\\n\\t\\t\\t\\telse j=i+1;\\n\\t\\t\\t\\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if(sgn((tmp.st-now.st).cross(now.ed-now.st))==0&&sgn((tmp.ed-now.st).cross(now.ed-now.st))==0)\\n\\t\\t{\\n\\t\\t\\tPoint vec=tmp.ed-tmp.st;\\n\\t\\t\\tvec.unit();\\n\\t\\t\\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!check(tmp.st-vec,0))\\n\\t\\t\\t\\t\\ttp.push_back(tmp.st);\\n\\t\\t\\t\\tif(!check(tmp.ed+vec,0))\\n\\t\\t\\t\\t\\ttp.push_back(tmp.ed);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tp.begin(),tp.end());\\n\\tint n=tp.size();\\n\\tsp.clear();\\n\\tfor(i=0;i<n;++i)\\n\\t\\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\\n\\tdouble ans=0;\\n\\tfor(i=0;i<sp.size();i+=2)\\n\\t\\tans=max(ans,(sp[i+1]-sp[i]).len());\\n\\treturn ans;\\n}\\nint main()\\n{\\n\\tint i,j;\\n\\tcas=0;\\n\\twhile(scanf(\\\"%d\\\",&n)!=EOF)\\n\\t{\\n\\t\\tif(n==0)break;\\n\\t\\tdouble len=0;\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tscanf(\\\"%lf%lf\\\",&pt[i].x,&pt[i].y);\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tfor(j=i+1;j<n;++j)\\n\\t\\t\\t\\tlen=max(len,check(i,j));\\n\\t\\tprintf(\\\"Case %d: %.10f\\\\n\\\",++cas,len);\\n\\t\\t//cout <<len*len<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1260,\n \"score_of_the_acc\": -0.0345,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2394_1537546\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cstdio>\\n#include<cmath>\\n#include<ctime>\\n#include<algorithm>\\n#include<list>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<bitset>\\n#include<string>\\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\\n#define sqr(v) ((v)*(v))\\n#define mb make_pair\\n#define debug 0\\nusing namespace std;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef pair<int,int> PII;\\ntypedef pair<int,LL> PIL;\\ntypedef pair<LL,int> PLI;\\ntypedef pair<LL,LL> PLL;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst int maxn=101;\\nstruct Point\\n{\\n\\tdouble x,y;\\n\\tPoint(){}\\n\\tPoint(double X,double Y)\\n\\t{\\n\\t\\tx=X;y=Y;\\n\\t}\\n\\tbool operator <(const Point &p)const\\n\\t{\\n\\t\\tif(sgn(x-p.x))return x<p.x;\\n\\t\\telse return y<p.y;\\n\\t}\\n\\tbool operator ==(const Point &p)const\\n\\t{\\n\\t\\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\\n\\t}\\n\\tPoint operator -(const Point &p)\\n\\t{\\n\\t\\treturn Point(x-p.x,y-p.y);\\n\\t}\\n\\tPoint operator +(const Point &p)\\n\\t{\\n\\t\\treturn Point(x+p.x,y+p.y);\\n\\t}\\n\\tdouble cross(const Point &p)const\\n\\t{\\n\\t\\treturn x*p.y-y*p.x;\\n\\t}\\n\\tdouble len()\\n\\t{\\n\\t\\treturn sqrt(sqr(x)+sqr(y));\\n\\t}\\n\\tvoid unit()\\n\\t{\\n\\t\\tdouble tmp=len();\\n\\t\\tx/=tmp;\\n\\t\\ty/=tmp;\\n\\t\\tx*=0.0001;\\n\\t\\ty*=0.0001;\\n\\t}\\n}pt[maxn];\\nstruct Segment\\n{\\n\\tPoint st,ed;\\n};\\ndouble cross(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.y-p.y*q.x;\\n}\\ndouble dot(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.x+p.y*q.y;\\n}\\nPoint Insect(Segment &p,Segment &q)\\n{\\n\\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\\n\\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\\n}\\nvector<Point> tp,sp;\\nint n,cas;\\ndouble go[][2]={{19942705,57051994},{-19942705,57051994},{19942705,-57051994},{-19942705,-57051994},{-19942705,27051994},{19942705,27051994},{19942705,-27051994},{-19942705,-27051994}};\\nint check(Point P,int deb)\\n{\\n\\tint avg=0,con;\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\tnow.st=P;\\n\\tif(deb)cout <<P.x<<\\\" \\\"<<P.y<<endl;\\n\\tfor(int j=0;j<1;++j)\\n\\t{\\n\\t\\tcon=0;\\n\\t\\tnow.ed.x=P.x+go[j][0];\\n\\t\\tnow.ed.y=P.y+go[j][1];\\n\\t\\tfor(int i=0;i<n;++i)\\n\\t\\t{\\n\\t\\t\\ttmp.st=pt[i];\\n\\t\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t\\t{\\n\\t\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(deb)\\n\\t\\t\\t\\t\\tcout <<j<<\\\" \\\"<<\\\"cross point:\\\"<<cp.x<<\\\" \\\"<<cp.y<<\\\" when:\\\"<<tmp.st.x<<\\\" \\\"<<tmp.st.y<<\\\" \\\"<<tmp.ed.x<<\\\" \\\"<<tmp.ed.y<<endl;\\n\\t\\t\\t\\t\\t++con;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(deb)cout <<\\\"avg: \\\"<<avg<<endl;\\n\\treturn con%2;\\n}\\n\\t\\ndouble check(int i,int j)\\n{\\n\\tint oi=i,oj=j;\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\ttp.clear();\\n\\tnow.st=pt[i];\\n\\tnow.ed=pt[j];\\n\\t//cout <<\\\"------------Begin--------------\\\"<<endl;cout <<now.st.x<<\\\" \\\"<<now.st.y<<endl;cout <<now.ed.x<<\\\" \\\"<<now.ed.y<<endl;\\n\\tfor(i=0;i<n;++i)\\n\\t{\\n\\t\\ttmp.st=pt[i];\\n\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\t//cout <<tmp.st.x<<\\\" \\\"<<tmp.st.y<<endl;cout <<tmp.ed.x<<\\\" \\\"<<tmp.ed.y<<endl;\\n\\t\\t//cout <<(tmp.ed-tmp.st).cross(now.ed-now.st)<<endl;\\n\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t{\\n\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\t//cout <<\\\"HERE\\\"<<\\\" \\\"<<cp.x<<\\\" \\\"<<cp.y<<\\\" \\\"<<dot(tmp.ed-cp,cp-tmp.st)<<endl;\\n\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\\n\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cp==tmp.st)j=i;\\n\\t\\t\\t\\telse j=i+1;\\n\\t\\t\\t\\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t//if(cas==12&&oi==12&&oj==33)cout <<\\\"cp:\\\"<<cp.x<<\\\" \\\"<<cp.y<<endl;\\n\\t\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if(sgn((now.st-tmp.st).cross(now.ed-now.st))==0&&sgn((now.st-tmp.ed).cross(now.ed-now.st))==0)\\n\\t\\t{\\n\\t\\t\\tPoint vec=tmp.ed-tmp.st;\\n\\t\\t\\tvec.unit();\\n\\t\\t\\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//if(cas==12&&oi==0&&oj==61)check(tmp.st-vec,1);\\n\\t\\t\\t\\tif(!check(tmp.st-vec,0))\\n\\t\\t\\t\\t\\ttp.push_back(tmp.st);\\n\\t\\t\\t\\tif(!check(tmp.ed+vec,0))\\n\\t\\t\\t\\t\\ttp.push_back(tmp.ed);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tp.begin(),tp.end());\\n\\tif(cas==-1&&oi==0&&oj==61){cout <<\\\"0--tp--0\\\"<<endl;for(i=0;i<tp.size();++i)cout<<tp[i].x<<\\\" \\\"<<tp[i].y<<endl;cout <<\\\"0--end--0\\\"<<endl;}\\n\\tint n=tp.size();\\n\\tsp.clear();\\n\\tfor(i=0;i<n;++i)\\n\\t\\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\\n\\tif(cas==-1&&oi==0&&oj==61){cout <<\\\"0--sp--0\\\"<<endl;for(i=0;i<sp.size();++i)cout<<sp[i].x<<\\\" \\\"<<sp[i].y<<endl;cout <<\\\"0--end--0\\\"<<endl;}\\n\\tdouble ans=0;\\n\\tfor(i=0;i<sp.size();i+=2)\\n\\t\\tans=max(ans,(sp[i+1]-sp[i]).len());\\n\\treturn ans;\\n}\\nint main()\\n{\\n\\tint i,j;\\n\\tcas=0;\\n\\twhile(scanf(\\\"%d\\\",&n)!=EOF)\\n\\t{\\n\\t\\tif(n==0)break;\\n\\t\\t//if(cas==12)cout <<n<<endl;\\n\\t\\tdouble len=0;\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%lf%lf\\\",&pt[i].x,&pt[i].y);\\n\\t\\t\\t//if(cas==12)cout <<pt[i].x<<\\\" \\\"<<pt[i].y<<endl;\\n\\t\\t}\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tfor(j=i+1;j<n;++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cas==-1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(len<check(i,j))\\n\\t\\t\\t\\t\\t\\tcout <<len<<\\\" \\\"<<check(i,j)<<\\\" \\\"<<i<<\\\" \\\"<<j<<\\\" \\\"<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<pt[i].x<<\\\" \\\"<<pt[i].y<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<pt[j].x<<\\\" \\\"<<pt[j].y<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<\\\"----------------------------------------------------\\\"<<endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlen=max(len,check(i,j));\\n\\t\\t\\t}\\n\\t\\tprintf(\\\"Case %d: %.10f\\\\n\\\",++cas,len);\\n\\t\\t//cout <<len*len<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1264,\n \"score_of_the_acc\": -0.0359,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2394_1537493\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cstdio>\\n#include<cmath>\\n#include<ctime>\\n#include<algorithm>\\n#include<list>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<bitset>\\n#include<string>\\n#define sgn(v) (abs((v))<eps?0:((v)<0?-1:1))\\n#define sqr(v) ((v)*(v))\\n#define mb make_pair\\n#define debug 0\\nusing namespace std;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef pair<int,int> PII;\\ntypedef pair<int,LL> PIL;\\ntypedef pair<LL,int> PLI;\\ntypedef pair<LL,LL> PLL;\\nconst double eps=1e-8;\\nconst double pi=acos(-1);\\nconst int maxn=101;\\nstruct Point\\n{\\n\\tdouble x,y;\\n\\tPoint(){}\\n\\tPoint(double X,double Y)\\n\\t{\\n\\t\\tx=X;y=Y;\\n\\t}\\n\\tbool operator <(const Point &p)const\\n\\t{\\n\\t\\tif(sgn(x-p.x))return x<p.x;\\n\\t\\telse return y<p.y;\\n\\t}\\n\\tbool operator ==(const Point &p)const\\n\\t{\\n\\t\\treturn sgn(x-p.x)==0&&sgn(y-p.y)==0;\\n\\t}\\n\\tPoint operator -(const Point &p)\\n\\t{\\n\\t\\treturn Point(x-p.x,y-p.y);\\n\\t}\\n\\tPoint operator +(const Point &p)\\n\\t{\\n\\t\\treturn Point(x+p.x,y+p.y);\\n\\t}\\n\\tdouble cross(const Point &p)const\\n\\t{\\n\\t\\treturn x*p.y-y*p.x;\\n\\t}\\n\\tdouble len()\\n\\t{\\n\\t\\treturn sqrt(sqr(x)+sqr(y));\\n\\t}\\n\\tvoid unit()\\n\\t{\\n\\t\\tx*=0.00000001;\\n\\t\\ty*=0.00000001;\\n\\t}\\n}pt[maxn];\\nstruct Segment\\n{\\n\\tPoint st,ed;\\n};\\ndouble cross(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.y-p.y*q.x;\\n}\\ndouble dot(const Point &p,const Point &q)\\n{\\n\\treturn p.x*q.x+p.y*q.y;\\n}\\nPoint Insect(Segment &p,Segment &q)\\n{\\n\\tdouble u=cross(p.ed-p.st,q.st-p.st),v=cross(p.st-p.ed,q.ed-p.st);\\n\\treturn Point((q.st.x*v+q.ed.x*u)/(u+v),(q.st.y*v+q.ed.y*u)/(u+v));\\n}\\nvector<Point> tp,sp;\\nint n,cas;\\ndouble go[][2]={{19942705,57051994},{-19942705,57051994},{19942705,-57051994},{-19942705,-57051994}};\\nint con[4];\\nint check(Point P,int deb)\\n{\\n\\tdouble avg=0;\\n\\tcon[0]=con[1]=con[2]=con[3]=0;\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\tnow.st=P;\\n\\tfor(int j=0;j<3;++j)\\n\\t{\\n\\t\\tnow.ed.x=P.x+go[j][0];\\n\\t\\tnow.ed.y=P.y+go[j][1];\\n\\t\\tfor(int i=0;i<n;++i)\\n\\t\\t{\\n\\t\\t\\ttmp.st=pt[i];\\n\\t\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t\\t{\\n\\t\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0&&sgn(dot(now.ed-cp,cp-now.st))>0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(deb)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcout <<\\\"cross point:\\\"<<cp.x<<\\\" \\\"<<cp.y<<\\\" when:\\\"<<tmp.st.x<<\\\" \\\"<<tmp.st.y<<\\\" \\\"<<tmp.ed.x<<\\\" \\\"<<tmp.ed.y<<endl;\\n\\t\\t\\t\\t\\t\\tcout <<dot(now.ed-cp,cp-now.st)/(now.ed-cp).len()/(now.st-cp).len()<<endl;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t++con[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tavg+=((con[j])%2);\\n\\t}\\n\\treturn round(avg/4);\\n}\\n\\t\\ndouble check(int i,int j)\\n{\\n\\tint oi=i,oj=j;\\n\\tSegment now,tmp;\\n\\tPoint cp;\\n\\ttp.clear();\\n\\tnow.st=pt[i];\\n\\tnow.ed=pt[j];\\n\\t//cout <<\\\"------------Begin--------------\\\"<<endl;cout <<now.st.x<<\\\" \\\"<<now.st.y<<endl;cout <<now.ed.x<<\\\" \\\"<<now.ed.y<<endl;\\n\\tfor(i=0;i<n;++i)\\n\\t{\\n\\t\\ttmp.st=pt[i];\\n\\t\\ttmp.ed=pt[(i+1)%n];\\n\\t\\t//cout <<tmp.st.x<<\\\" \\\"<<tmp.st.y<<endl;cout <<tmp.ed.x<<\\\" \\\"<<tmp.ed.y<<endl;\\n\\t\\t//cout <<(tmp.ed-tmp.st).cross(now.ed-now.st)<<endl;\\n\\t\\tif(sgn((tmp.ed-tmp.st).cross(now.ed-now.st)))\\n\\t\\t{\\n\\t\\t\\tcp=Insect(tmp,now);\\n\\t\\t\\t//cout <<\\\"HERE\\\"<<\\\" \\\"<<cp.x<<\\\" \\\"<<cp.y<<\\\" \\\"<<dot(tmp.ed-cp,cp-tmp.st)<<endl;\\n\\t\\t\\tif(sgn(dot(tmp.ed-cp,cp-tmp.st))>0)\\n\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\telse if(sgn(dot(tmp.ed-cp,cp-tmp.st))==0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cp==tmp.st)j=i;\\n\\t\\t\\t\\telse j=i+1;\\n\\t\\t\\t\\tif(cross(pt[(j-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(j+1)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\t//if(cas==12&&oi==12&&oj==33)cout <<\\\"cp:\\\"<<cp.x<<\\\" \\\"<<cp.y<<endl;\\n\\t\\t\\t\\t\\ttp.push_back(cp);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if(sgn((now.st-tmp.st).cross(now.ed-now.st))==0&&sgn((now.st-tmp.ed).cross(now.ed-now.st))==0)\\n\\t\\t{\\n\\t\\t\\tPoint vec=tmp.ed-tmp.st;\\n\\t\\t\\tvec.unit();\\n\\t\\t\\tif(cross(pt[(i-1+n)%n]-now.st,now.ed-now.st)*cross(pt[(i+2)%n]-now.st,now.ed-now.st)<0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(check(tmp.st-vec,0)%2==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//if(cas==12&&oi==12&&oj==33)cout <<(tmp.st-vec).x<<\\\" st \\\"<<(tmp.st-vec).y<<\\\" \\\"<<vec.x<<\\\" \\\"<<vec.y<<\\\" \\\"<<check(tmp.st-vec,1)<<endl;\\n\\t\\t\\t\\t\\ttp.push_back(tmp.st);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(check(tmp.ed+vec,0)%2==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//if(cas==12&&oi==12&&oj==33)cout <<tmp.ed.x<<\\\" ed \\\"<<tmp.ed.y<<endl;\\n\\t\\t\\t\\t\\ttp.push_back(tmp.ed);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tp.begin(),tp.end());\\n\\tif(cas==-1&&oi==0&&oj==61){cout <<\\\"0--tp--0\\\"<<endl;for(i=0;i<tp.size();++i)cout<<tp[i].x<<\\\" \\\"<<tp[i].y<<endl;cout <<\\\"0--end--0\\\"<<endl;}\\n\\tint n=tp.size();\\n\\tsp.clear();\\n\\tfor(i=0;i<n;++i)\\n\\t\\tif(i==0||(!(tp[i]==tp[i-1])))sp.push_back(tp[i]);\\n\\tif(cas==-1&&oi==0&&oj==61){cout <<\\\"0--sp--0\\\"<<endl;for(i=0;i<sp.size();++i)cout<<sp[i].x<<\\\" \\\"<<sp[i].y<<endl;cout <<\\\"0--end--0\\\"<<endl;}\\n\\tdouble ans=0;\\n\\tfor(i=0;i<sp.size();i+=2)\\n\\t\\tans=max(ans,(sp[i+1]-sp[i]).len());\\n\\treturn ans;\\n}\\nint main()\\n{\\n\\tint i,j;\\n\\tcas=0;\\n\\twhile(scanf(\\\"%d\\\",&n)!=EOF)\\n\\t{\\n\\t\\tif(n==0)break;\\n\\t\\t//if(cas==12)cout <<n<<endl;\\n\\t\\tdouble len=0;\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t{\\n\\t\\t\\tscanf(\\\"%lf%lf\\\",&pt[i].x,&pt[i].y);\\n\\t\\t\\t//if(cas==12)cout <<pt[i].x<<\\\" \\\"<<pt[i].y<<endl;\\n\\t\\t}\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tlen=max(len,(pt[i]-pt[(i+1)%n]).len());\\n\\t\\tfor(i=0;i<n;++i)\\n\\t\\t\\tfor(j=i+1;j<n;++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(cas==-1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(len<check(i,j))\\n\\t\\t\\t\\t\\t\\tcout <<len<<\\\" \\\"<<check(i,j)<<\\\" \\\"<<i<<\\\" \\\"<<j<<\\\" \\\"<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<pt[i].x<<\\\" \\\"<<pt[i].y<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<pt[j].x<<\\\" \\\"<<pt[j].y<<endl\\n\\t\\t\\t\\t\\t\\t\\t <<\\\"----------------------------------------------------\\\"<<endl;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlen=max(len,check(i,j));\\n\\t\\t\\t}\\n\\t\\tprintf(\\\"Case %d: %.10f\\\\n\\\",++cas,len);\\n\\t\\t//cout <<len*len<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1276,\n \"score_of_the_acc\": -0.0517,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1363,"cells":{"group_id":{"kind":"string","value":"aoj_2397_cpp"},"problem_description":{"kind":"string","value":"Three-way Branch\nThere is a grid that consists of\nW \\times H\ncells. The upper-left-most cell is\n(1, 1)\n.\nYou are standing on the cell of\n(1,1)\nand you are going to move to cell of\n(W, H)\n.\nYou can only move to adjacent lower-left, lower or lower-right cells.\nThere are obstructions on several cells. You can not move to it. You cannot move out the grid, either.\nWrite a program that outputs the number of ways to reach\n(W,H)\nmodulo 1,000,000,009.\nYou can assume that there is no obstruction at\n(1,1)\n.\nInput\nThe first line contains three integers, the width\nW\n, the height\nH\n, and the number of obstructions\nN\n. \n(\n1 \\leq W \\leq 75\n,\n2 \\leq H \\leq 10^{18}\n,\n0 \\leq N \\leq 30\n)\nEach of following\nN\nlines contains 2 integers, denoting the position of an obstruction\n(x_i, y_i)\n.\nThe last test case is followed by a line containing three zeros.\nOutput\nFor each test case, print its case number and the number of ways to reach\n(W,H)\nmodulo 1,000,000,009.\nSample Input\n2 4 1\n2 1\n2 2 1\n2 2\n0 0 0\nOutput for the Sample Input\nCase 1: 4\nCase 2: 0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2397_10853997","code_snippet":"#include <cstdio>\n#include <vector>\n#include <cstdlib>\n#include <algorithm>\n#include <cstring>\n#include <map>\n#define llint long long\n#define MOD 1000000009\n\nusing namespace std;\n\nconst int maxn = 75; //必须加 const，否则编译错误\n\nint n, N;\nllint m;\nmap<llint, vector<llint> > s;\n\nclass Matrix {\npublic:\n\tllint val[maxn][maxn];\n\tMatrix() {\n\t\tmemset(val, 0, sizeof(val));\n\t}\n\n\tMatrix operator*(const Matrix& c) const {\n\t\tMatrix res;\n\t\tfor (int i = 0; i < n; ++i)\n\t\t\tfor (int j = 0; j < n; ++j)\n\t\t\t\tfor (int k = 0; k < n; ++k) {\n\t\t\t\t\tres.val[i][j] += val[i][k] * c.val[k][j];\n\t\t\t\t\tres.val[i][j] = (res.val[i][j] + MOD) % MOD; //防止矩阵元素变为负数，若不需要，去掉\"+MOD\"\n\t\t\t\t}\n\t\treturn res;\n\t}\n\n\tMatrix& operator*=(const Matrix& c) {\n\t\t*this = *this * c;\n\t\treturn *this;\n\t}\n\n\tMatrix Pow(llint k) { //返回one^k\n\t\tMatrix res = Zero();\n\t\tMatrix step = One();\n\t\twhile (k) {\n\t\t\tif (k & 1)\n\t\t\t\tres *= step;\n\t\t\tk >>= 1;\n\t\t\tstep *= step;\n\t\t}\n\t\treturn res;\n\t}\n\n\tMatrix Zero() const {\n\t\tMatrix res;\n\t\tfor (int i = 0; i < maxn; ++i)\n\t\t\tres.val[i][i] = 1;\n\t\treturn res;\n\t}\n\n\tMatrix One() const {\n\t\tMatrix res;\n\t\tres.val[0][0] = res.val[0][1] = 1;\n\t\tres.val[n-1][n-1] = res.val[n-1][n-2] = 1;\n\t\tfor (int i = 1; i < n - 1; ++i) {\n\t\t\tres.val[i][i-1] = res.val[i][i] = res.val[i][i + 1] = 1;\n\t\t}\n\t\treturn res;\n\t}\n};\n\nint main() {\n\tint kcase = 0;\n\twhile (scanf(\"%d%lld%d\", &n, &m, &N) && n) {\n\t\ts.clear();\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tllint x, y;\n\t\t\tscanf(\"%lld%lld\", &x, &y);\n\t\t\ts[--y].push_back(--x);\n\t\t}\n\t\tif (n == 1) {\n\t\t\tif (N) {\n\t\t\t\tprintf(\"Case %d: 0\\n\", ++kcase);\n\t\t\t} else {\n\t\t\t\tprintf(\"Case %d: 1\\n\", ++kcase);\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tMatrix res;\n\t\tres.val[0][0] = 1;\n\t\tllint now = 0;\n\t\tfor (map<llint, vector<llint> >::iterator it = s.begin(); it != s.end(); ++it) {\n //printf(\"%I64d\\n\", it -> first);\n\t\t\tif (it -> first == 0) continue;\n\t\t\tres *= res.Pow((it -> first) - now);\n\t\t\tnow = it -> first;\n\t\t\tfor (int i = 0; i < (int)(it -> second).size(); ++i) {\n\t\t\t\tres.val[0][(it -> second)[i]] = 0;\n\t\t\t}\n\t\t}\n\t\tres *= res.Pow(m - 1 - now);\n\t\tprintf(\"Case %d: %lld\\n\", ++kcase, res.val[0][n - 1]);\n\t}\n return 0;\n}","accuracy":1,"time_ms":3290,"memory_kb":3136,"score_of_the_acc":-1,"final_rank":8},{"submission_id":"aoj_2397_10684527","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n\nusing namespace std;\n\nconst long long MOD = 1000000009;\n\nstruct Step\n{\n long long Marx[75][75];\n long long H;\n long long W;\n};\nstruct Obstruction\n{\n long long x;\n long long y;\n};\n\nStep StepByStep(Step a,Step b)\n{\n Step ret;\n ret.H = a.H + b.H - 1;\n ret.W = a.W;\n\n for(int i=0;i<ret.W;++i)\n {\n for(int j=0;j<ret.W;++j)\n {\n ret.Marx[i][j] = 0;\n for(int k=0;k<ret.W;++k)\n {\n ret.Marx[i][j] += a.Marx[i][k]*b.Marx[k][j];\n ret.Marx[i][j] = ret.Marx[i][j]%MOD;\n }\n }\n }\n\n return ret;\n}\n\nlong long InitStep(Step step[],long long W,long long H)\n{\n long long h = 3;\n long long Tot = 1;\n step[0].W = W;\n step[0].H = 2;\n for(int i=0;i<W;++i)\n {\n for(int j=0;j<W;++j)\n {\n if(i==j||i==j-1||i==j+1)\n step[0].Marx[i][j] = 1;\n else\n step[0].Marx[i][j] = 0;\n }\n }\n\n while(h<=H)\n {\n step[Tot] = StepByStep(step[Tot-1],step[Tot-1]);\n ++Tot;\n h = 2*h-1;\n }\n\n return Tot;\n}\n\nStep CombineStep(long long H,long long W,Step step[],long long N) //H 为高度\n{\n Step way;\n way.H = 1;\n way.W = W;\n for(int i=0;i<W;++i)\n for(int j=0;j<W;++j)\n {\n if(i==j)\n way.Marx[i][j] = 1;\n else way.Marx[i][j] = 0;\n }\n\n long long h = 1;\n for(int i=N-1;i>=0;--i)\n {\n if(h+step[i].H-1<=H)\n {\n way = StepByStep(way,step[i]);\n h += step[i].H-1;\n }\n }\n return way;\n}\n\nint cmp(Obstruction obs1,Obstruction obs2)\n{\n return obs1.y<obs2.y;\n}\n\nlong long W,H,N;\nStep step[100],way;\nlong long Tot;\nObstruction obs[30];\n\nint main()\n{\n //freopen(\"in.txt\",\"r\",stdin);\n int iCase = 1;\n while(scanf(\"%lld %lld %lld\",&W,&H,&N)!=EOF)\n {\n if(W==0&&H==0&&N==0)\n break;\n\n Tot = InitStep(step,W,H);\n\n for(int i=0;i<N;++i)\n {\n scanf(\"%lld %lld\",&obs[i].x,&obs[i].y);\n }\n sort(obs,obs+N,cmp);\n if(N==0)\n {\n way = CombineStep(H,W,step,Tot);\n }\n else\n {\n way.H = 1;\n way.W = W;\n for(int i=0;i<W;++i)\n for(int j=0;j<W;++j)\n {\n if(i==j)\n way.Marx[i][j] = 1;\n else way.Marx[i][j] = 0;\n }\n\n for(int i=0;i<=N;++i)\n {\n if(i==0)\n {\n way = StepByStep(way,CombineStep(obs[i].y,W,step,Tot));\n for(int j=0;j<W;++j)\n {\n way.Marx[j][obs[i].x-1] = 0;\n }\n }\n else if(i==N)\n {\n way = StepByStep(way,CombineStep(H - obs[N-1].y+1,W,step,Tot));\n }\n else\n {\n way = StepByStep(way,CombineStep(obs[i].y-obs[i-1].y+1,W,step,Tot));\n for(int j=0;j<W;++j)\n {\n way.Marx[j][obs[i].x-1] = 0;\n }\n }\n }\n\n }\n\n printf(\"Case %d: %lld\\n\",iCase,way.Marx[0][W-1]%MOD);\n ++iCase;\n }\n return 0;\n}","accuracy":1,"time_ms":1230,"memory_kb":7944,"score_of_the_acc":-1,"final_rank":8},{"submission_id":"aoj_2397_10684524","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cstdlib>\n#include <cmath>\nusing namespace std;\n#define MOD 1000000009\nlong long w,h,n;\nstruct Matrix{\n long long n,m[80][80];\n Matrix operator * (const Matrix &b)const{\n Matrix c;\n memset(c.m,0,sizeof c.m);\n c.n=n;\n for (int i=0;i<n;i++)\n for (int j=0;j<n;j++)\n for (int k=0;k<n;k++){\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nMatrix A;\nlong long x[80];\nlong long k,p,q;\nstruct node{\n long long a,b;\n};\nnode Pos[80];\nint cmp(node a,node b){\n return a.b<b.b;\n}\nvoid get_x(Matrix a){\n long long y[80];\n memset(y,0,sizeof y);\n for (int i=0;i<a.n;i++){\n for (int j=0;j<a.n;j++){\n y[i]=(y[i]+(x[j]*a.m[i][j])%MOD)%MOD;\n }\n }\n for (int i=0;i<a.n;i++)\n x[i]=y[i];\n}\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b); //列向量\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n while (j<n){\n p=Pos[j].b-1;\n if (p==k){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n j++;\n }\n if (k<h-1){\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %d: %lld\\n\",++d,x[w-1]);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3912,"score_of_the_acc":-1.0109,"final_rank":15},{"submission_id":"aoj_2397_10684522","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//行向量\n k=0;\n j=0;\n //k=0;\n //j=0;\n /*\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":3000,"memory_kb":3916,"score_of_the_acc":-1.0215,"final_rank":20},{"submission_id":"aoj_2397_10684521","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n k=0;\n j=0;\n //k=0;\n //j=0;\n /*\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3916,"score_of_the_acc":-1.0117,"final_rank":16},{"submission_id":"aoj_2397_10684520","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n k=0;\n //j=0;\n //k=0;\n j=0;\n /*\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3920,"score_of_the_acc":-1.0126,"final_rank":18},{"submission_id":"aoj_2397_10684519","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n k=0;\n j=0;\n /*\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2970,"memory_kb":3608,"score_of_the_acc":-0.9428,"final_rank":3},{"submission_id":"aoj_2397_10684518","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n k=0;\n j=0;\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3592,"score_of_the_acc":-0.9444,"final_rank":4},{"submission_id":"aoj_2397_10684514","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n long long i,j,now;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n k=0;\n j=0;\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3916,"score_of_the_acc":-1.0117,"final_rank":16},{"submission_id":"aoj_2397_10684513","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n long long i,j,now;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n /*\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n */\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n memset(x,0,sizeof x);\n x[0]=1;\n k=0;\n j=0;\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3744,"score_of_the_acc":-0.9808,"final_rank":6},{"submission_id":"aoj_2397_10684510","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n long long i,j,now;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n //for (i=0;i<w;i++)\n // x[i]=0;//列向量\n memset(x,0,sizeof x);\n x[0]=1;\n k=0;\n j=0;\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3844,"score_of_the_acc":-1.0016,"final_rank":11},{"submission_id":"aoj_2397_10684508","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n long long i,j,now;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n\n // ****************************************\n /*\n int i,j;\n int d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n ones.n=w;\n for (i=0;i<n;i++)\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n sort(Pos,Pos+n,cmp);\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\n memset(x,0,sizeof x);\n x[0]=1;\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1;\n A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i]=1;\n A.m[i][i-1]=1;\n A.m[i][i+1]=1;\n }\n k=0;\n j=0;\n */\n //****************************************\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3800,"score_of_the_acc":-0.9925,"final_rank":7},{"submission_id":"aoj_2397_10684505","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nlong long k,p,q;\nint main(){\n long long i,j,now;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3844,"score_of_the_acc":-1.0016,"final_rank":11},{"submission_id":"aoj_2397_10684503","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nlong long x[80];\nvoid get_x(Matrix A){\n long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (long long i=0;i<A.n;i++){\n for (long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nlong long sum;\nlong long w,n;\nlong long h;\nint main(){\n long long i,j,now;\n long long k;\n long long p,q;\n long long d=0;\n while (scanf(\"%lld%lld%lld\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%lld%lld\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %lld: %lld\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2960,"memory_kb":3800,"score_of_the_acc":-0.9779,"final_rank":5},{"submission_id":"aoj_2397_10684501","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n //Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b-1;\n if (k==p){\n x[Pos[j].a-1]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a-1]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3880,"score_of_the_acc":-1.0043,"final_rank":13},{"submission_id":"aoj_2397_10684500","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b;\n if (k==p){\n x[Pos[j].a]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2980,"memory_kb":3892,"score_of_the_acc":-1.0068,"final_rank":14},{"submission_id":"aoj_2397_10684498","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[80];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n)!=EOF){\n if (w==0) return 0;\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b;\n if (k==p){\n x[Pos[j].a]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3916,"score_of_the_acc":-1.0166,"final_rank":19},{"submission_id":"aoj_2397_10684496","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (long long i=0;i<n;i++)\n for (long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[50];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n)!=EOF){\n if (w==0) return 0;\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b;\n if (k==p){\n x[Pos[j].a]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2990,"memory_kb":3840,"score_of_the_acc":-1.0008,"final_rank":10},{"submission_id":"aoj_2397_10684494","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n unsigned long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n\n Matrix(const Matrix &ipt){\n n = ipt.n;\n for (unsigned long long i=0;i<n;++i){\n for (unsigned long long j=0;j<n;++j){\n m[i][j] = ipt.m[i][j];\n }\n }\n }\n unsigned long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (unsigned long long i=0;i<n;i++)\n for (unsigned long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (unsigned long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[50];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n)!=EOF){\n if (w==0) return 0;\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;\n A.m[i][i]=1;\n A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b;\n if (k==p){\n x[Pos[j].a]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2320,"memory_kb":3760,"score_of_the_acc":-0.6589,"final_rank":2},{"submission_id":"aoj_2397_10684491","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define MOD 1000000009\nstruct Matrix{\n unsigned long long n;\n\n Matrix(){\n memset(m,0,sizeof m);\n };\n\n Matrix(const Matrix &ipt){\n n = ipt.n;\n for (unsigned long long i=0;i<n;++i){\n for (unsigned long long j=0;j<n;++j){\n m[i][j] = ipt.m[i][j];\n }\n }\n }\n unsigned long long m[80][80];\n Matrix operator * (const Matrix &b) const{\n Matrix c;\n for (unsigned long long i=0;i<n;i++)\n for (unsigned long long j=0;j<n;j++){\n c.m[i][j]=0;\n for (unsigned long long k=0;k<n;k++)\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\n }\n c.n=n;\n return c;\n }\n};\nMatrix ones;\nMatrix Pow(const Matrix &a,unsigned long long n){\n Matrix t=ones,y=a;\n while (n){\n if (n & 1) t = (t * y) ;\n y = (y * y) ;\n n /= 2;\n }\n return t;\n}\nstruct node{\n unsigned long long a,b;\n}Pos[50];\nbool cmp(node a,node b){\n return a.b<b.b;\n}\nMatrix A,B;\nunsigned long long x[80];\nvoid get_x(Matrix A){\n unsigned long long y[80];\n //printf(\"!!!\");\n memset(y,0,sizeof y);\n for (unsigned long long i=0;i<A.n;i++){\n for (unsigned long long j=0;j<A.n;j++){\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\n }\n }\n for (unsigned long long i=0;i<A.n;i++)\n x[i]=y[i];\n}\nunsigned long long sum;\nunsigned long long w,n;\nunsigned long long h;\nint main(){\n unsigned long long i,j,now;\n unsigned long long k;\n unsigned long long p,q;\n unsigned long long d=0;\n while (scanf(\"%llu%llu%llu\",&w,&h,&n),w||h||n){\n memset(ones.m,0,sizeof ones.m);\n ones.n=w;\n for (i=0;i<w;i++)\n ones.m[i][i]=1;\n for (i=0;i<n;i++){\n scanf(\"%llu%llu\",&Pos[i].a,&Pos[i].b);\n Pos[i].a--;Pos[i].b--;\n }\n sort(Pos,Pos+n,cmp);\n memset(A.m,0,sizeof A.m);\n A.n=w;\n A.m[0][0]=1; A.m[0][1]=1;\n for (i=1;i<w;i++){\n A.m[i][i-1]=1;A.m[i][i]=1;A.m[i][i+1]=1;\n }\n for (i=0;i<w;i++)\n x[i]=0;//列向量\n x[0]=1;\n k=0;\n j=0;\n //printf(\"!!!\");\n while (j<n){\n p=Pos[j].b;\n if (k==p){\n x[Pos[j].a]=0;\n }\n else{\n get_x(Pow(A,p-k));\n k=p;\n x[Pos[j].a]=0;\n }\n //printf(\"%d\",k);\n //for (int i=0;i<w;i++)\n // printf(\"%5d\",x[i]);\n //printf(\"\\n\");\n j++;\n\n }\n //printf(\"!!!\");\n if (k<h-1){\n\n// B=Pow(A,h-1-k);printf(\"#!!!\");\n get_x(Pow(A,h-1-k));\n }\n printf(\"Case %llu: %llu\\n\",++d,(x[w-1]%MOD+MOD)%MOD);\n }\n}","accuracy":1,"time_ms":2320,"memory_kb":3748,"score_of_the_acc":-0.6564,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2397_10853997\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <cstring>\\n#include <map>\\n#define llint long long\\n#define MOD 1000000009\\n\\nusing namespace std;\\n\\nconst int maxn = 75; //必须加 const，否则编译错误\\n\\nint n, N;\\nllint m;\\nmap<llint, vector<llint> > s;\\n\\nclass Matrix {\\npublic:\\n\\tllint val[maxn][maxn];\\n\\tMatrix() {\\n\\t\\tmemset(val, 0, sizeof(val));\\n\\t}\\n\\n\\tMatrix operator*(const Matrix& c) const {\\n\\t\\tMatrix res;\\n\\t\\tfor (int i = 0; i < n; ++i)\\n\\t\\t\\tfor (int j = 0; j < n; ++j)\\n\\t\\t\\t\\tfor (int k = 0; k < n; ++k) {\\n\\t\\t\\t\\t\\tres.val[i][j] += val[i][k] * c.val[k][j];\\n\\t\\t\\t\\t\\tres.val[i][j] = (res.val[i][j] + MOD) % MOD; //防止矩阵元素变为负数，若不需要，去掉\\\"+MOD\\\"\\n\\t\\t\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\tMatrix& operator*=(const Matrix& c) {\\n\\t\\t*this = *this * c;\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix Pow(llint k) { //返回one^k\\n\\t\\tMatrix res = Zero();\\n\\t\\tMatrix step = One();\\n\\t\\twhile (k) {\\n\\t\\t\\tif (k & 1)\\n\\t\\t\\t\\tres *= step;\\n\\t\\t\\tk >>= 1;\\n\\t\\t\\tstep *= step;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\n\\tMatrix Zero() const {\\n\\t\\tMatrix res;\\n\\t\\tfor (int i = 0; i < maxn; ++i)\\n\\t\\t\\tres.val[i][i] = 1;\\n\\t\\treturn res;\\n\\t}\\n\\n\\tMatrix One() const {\\n\\t\\tMatrix res;\\n\\t\\tres.val[0][0] = res.val[0][1] = 1;\\n\\t\\tres.val[n-1][n-1] = res.val[n-1][n-2] = 1;\\n\\t\\tfor (int i = 1; i < n - 1; ++i) {\\n\\t\\t\\tres.val[i][i-1] = res.val[i][i] = res.val[i][i + 1] = 1;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nint main() {\\n\\tint kcase = 0;\\n\\twhile (scanf(\\\"%d%lld%d\\\", &n, &m, &N) && n) {\\n\\t\\ts.clear();\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tllint x, y;\\n\\t\\t\\tscanf(\\\"%lld%lld\\\", &x, &y);\\n\\t\\t\\ts[--y].push_back(--x);\\n\\t\\t}\\n\\t\\tif (n == 1) {\\n\\t\\t\\tif (N) {\\n\\t\\t\\t\\tprintf(\\\"Case %d: 0\\\\n\\\", ++kcase);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprintf(\\\"Case %d: 1\\\\n\\\", ++kcase);\\n\\t\\t\\t}\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tMatrix res;\\n\\t\\tres.val[0][0] = 1;\\n\\t\\tllint now = 0;\\n\\t\\tfor (map<llint, vector<llint> >::iterator it = s.begin(); it != s.end(); ++it) {\\n //printf(\\\"%I64d\\\\n\\\", it -> first);\\n\\t\\t\\tif (it -> first == 0) continue;\\n\\t\\t\\tres *= res.Pow((it -> first) - now);\\n\\t\\t\\tnow = it -> first;\\n\\t\\t\\tfor (int i = 0; i < (int)(it -> second).size(); ++i) {\\n\\t\\t\\t\\tres.val[0][(it -> second)[i]] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tres *= res.Pow(m - 1 - now);\\n\\t\\tprintf(\\\"Case %d: %lld\\\\n\\\", ++kcase, res.val[0][n - 1]);\\n\\t}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3290,\n \"memory_kb\": 3136,\n \"score_of_the_acc\": -1,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2397_10684527\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nconst long long MOD = 1000000009;\\n\\nstruct Step\\n{\\n long long Marx[75][75];\\n long long H;\\n long long W;\\n};\\nstruct Obstruction\\n{\\n long long x;\\n long long y;\\n};\\n\\nStep StepByStep(Step a,Step b)\\n{\\n Step ret;\\n ret.H = a.H + b.H - 1;\\n ret.W = a.W;\\n\\n for(int i=0;i<ret.W;++i)\\n {\\n for(int j=0;j<ret.W;++j)\\n {\\n ret.Marx[i][j] = 0;\\n for(int k=0;k<ret.W;++k)\\n {\\n ret.Marx[i][j] += a.Marx[i][k]*b.Marx[k][j];\\n ret.Marx[i][j] = ret.Marx[i][j]%MOD;\\n }\\n }\\n }\\n\\n return ret;\\n}\\n\\nlong long InitStep(Step step[],long long W,long long H)\\n{\\n long long h = 3;\\n long long Tot = 1;\\n step[0].W = W;\\n step[0].H = 2;\\n for(int i=0;i<W;++i)\\n {\\n for(int j=0;j<W;++j)\\n {\\n if(i==j||i==j-1||i==j+1)\\n step[0].Marx[i][j] = 1;\\n else\\n step[0].Marx[i][j] = 0;\\n }\\n }\\n\\n while(h<=H)\\n {\\n step[Tot] = StepByStep(step[Tot-1],step[Tot-1]);\\n ++Tot;\\n h = 2*h-1;\\n }\\n\\n return Tot;\\n}\\n\\nStep CombineStep(long long H,long long W,Step step[],long long N) //H 为高度\\n{\\n Step way;\\n way.H = 1;\\n way.W = W;\\n for(int i=0;i<W;++i)\\n for(int j=0;j<W;++j)\\n {\\n if(i==j)\\n way.Marx[i][j] = 1;\\n else way.Marx[i][j] = 0;\\n }\\n\\n long long h = 1;\\n for(int i=N-1;i>=0;--i)\\n {\\n if(h+step[i].H-1<=H)\\n {\\n way = StepByStep(way,step[i]);\\n h += step[i].H-1;\\n }\\n }\\n return way;\\n}\\n\\nint cmp(Obstruction obs1,Obstruction obs2)\\n{\\n return obs1.y<obs2.y;\\n}\\n\\nlong long W,H,N;\\nStep step[100],way;\\nlong long Tot;\\nObstruction obs[30];\\n\\nint main()\\n{\\n //freopen(\\\"in.txt\\\",\\\"r\\\",stdin);\\n int iCase = 1;\\n while(scanf(\\\"%lld %lld %lld\\\",&W,&H,&N)!=EOF)\\n {\\n if(W==0&&H==0&&N==0)\\n break;\\n\\n Tot = InitStep(step,W,H);\\n\\n for(int i=0;i<N;++i)\\n {\\n scanf(\\\"%lld %lld\\\",&obs[i].x,&obs[i].y);\\n }\\n sort(obs,obs+N,cmp);\\n if(N==0)\\n {\\n way = CombineStep(H,W,step,Tot);\\n }\\n else\\n {\\n way.H = 1;\\n way.W = W;\\n for(int i=0;i<W;++i)\\n for(int j=0;j<W;++j)\\n {\\n if(i==j)\\n way.Marx[i][j] = 1;\\n else way.Marx[i][j] = 0;\\n }\\n\\n for(int i=0;i<=N;++i)\\n {\\n if(i==0)\\n {\\n way = StepByStep(way,CombineStep(obs[i].y,W,step,Tot));\\n for(int j=0;j<W;++j)\\n {\\n way.Marx[j][obs[i].x-1] = 0;\\n }\\n }\\n else if(i==N)\\n {\\n way = StepByStep(way,CombineStep(H - obs[N-1].y+1,W,step,Tot));\\n }\\n else\\n {\\n way = StepByStep(way,CombineStep(obs[i].y-obs[i-1].y+1,W,step,Tot));\\n for(int j=0;j<W;++j)\\n {\\n way.Marx[j][obs[i].x-1] = 0;\\n }\\n }\\n }\\n\\n }\\n\\n printf(\\\"Case %d: %lld\\\\n\\\",iCase,way.Marx[0][W-1]%MOD);\\n ++iCase;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1230,\n \"memory_kb\": 7944,\n \"score_of_the_acc\": -1,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2397_10684524\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cmath>\\nusing namespace std;\\n#define MOD 1000000009\\nlong long w,h,n;\\nstruct Matrix{\\n long long n,m[80][80];\\n Matrix operator * (const Matrix &b)const{\\n Matrix c;\\n memset(c.m,0,sizeof c.m);\\n c.n=n;\\n for (int i=0;i<n;i++)\\n for (int j=0;j<n;j++)\\n for (int k=0;k<n;k++){\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nMatrix A;\\nlong long x[80];\\nlong long k,p,q;\\nstruct node{\\n long long a,b;\\n};\\nnode Pos[80];\\nint cmp(node a,node b){\\n return a.b<b.b;\\n}\\nvoid get_x(Matrix a){\\n long long y[80];\\n memset(y,0,sizeof y);\\n for (int i=0;i<a.n;i++){\\n for (int j=0;j<a.n;j++){\\n y[i]=(y[i]+(x[j]*a.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (int i=0;i<a.n;i++)\\n x[i]=y[i];\\n}\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b); //列向量\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n while (j<n){\\n p=Pos[j].b-1;\\n if (p==k){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n j++;\\n }\\n if (k<h-1){\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %d: %lld\\\\n\\\",++d,x[w-1]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3912,\n \"score_of_the_acc\": -1.0109,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2397_10684522\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//行向量\\n k=0;\\n j=0;\\n //k=0;\\n //j=0;\\n /*\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3000,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -1.0215,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2397_10684521\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n k=0;\\n j=0;\\n //k=0;\\n //j=0;\\n /*\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -1.0117,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2397_10684520\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n k=0;\\n //j=0;\\n //k=0;\\n j=0;\\n /*\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3920,\n \"score_of_the_acc\": -1.0126,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2397_10684519\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n k=0;\\n j=0;\\n /*\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2970,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.9428,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2397_10684518\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n k=0;\\n j=0;\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.9444,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2397_10684514\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n long long i,j,now;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n k=0;\\n j=0;\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -1.0117,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2397_10684513\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n long long i,j,now;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n /*\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n */\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n memset(x,0,sizeof x);\\n x[0]=1;\\n k=0;\\n j=0;\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.9808,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2397_10684510\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n long long i,j,now;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n //for (i=0;i<w;i++)\\n // x[i]=0;//列向量\\n memset(x,0,sizeof x);\\n x[0]=1;\\n k=0;\\n j=0;\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -1.0016,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2397_10684508\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n long long i,j,now;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n\\n // ****************************************\\n /*\\n int i,j;\\n int d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n ones.n=w;\\n for (i=0;i<n;i++)\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n sort(Pos,Pos+n,cmp);\\n //if ((w==0)&&(h==0)&&(n==0)) return 0;\\n memset(x,0,sizeof x);\\n x[0]=1;\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1;\\n A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i]=1;\\n A.m[i][i-1]=1;\\n A.m[i][i+1]=1;\\n }\\n k=0;\\n j=0;\\n */\\n //****************************************\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -0.9925,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2397_10684505\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nlong long k,p,q;\\nint main(){\\n long long i,j,now;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -1.0016,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2397_10684503\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nlong long x[80];\\nvoid get_x(Matrix A){\\n long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (long long i=0;i<A.n;i++){\\n for (long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nlong long sum;\\nlong long w,n;\\nlong long h;\\nint main(){\\n long long i,j,now;\\n long long k;\\n long long p,q;\\n long long d=0;\\n while (scanf(\\\"%lld%lld%lld\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%lld%lld\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %lld: %lld\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2960,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -0.9779,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2397_10684501\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n //Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b-1;\\n if (k==p){\\n x[Pos[j].a-1]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a-1]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -1.0043,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2397_10684500\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b;\\n if (k==p){\\n x[Pos[j].a]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -1.0068,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2397_10684498\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[80];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n)!=EOF){\\n if (w==0) return 0;\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b;\\n if (k==p){\\n x[Pos[j].a]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -1.0166,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2397_10684496\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (long long i=0;i<n;i++)\\n for (long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[50];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n)!=EOF){\\n if (w==0) return 0;\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b;\\n if (k==p){\\n x[Pos[j].a]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.0008,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2397_10684494\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n unsigned long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n\\n Matrix(const Matrix &ipt){\\n n = ipt.n;\\n for (unsigned long long i=0;i<n;++i){\\n for (unsigned long long j=0;j<n;++j){\\n m[i][j] = ipt.m[i][j];\\n }\\n }\\n }\\n unsigned long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (unsigned long long i=0;i<n;i++)\\n for (unsigned long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (unsigned long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[50];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n)!=EOF){\\n if (w==0) return 0;\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;\\n A.m[i][i]=1;\\n A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b;\\n if (k==p){\\n x[Pos[j].a]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2320,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.6589,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2397_10684491\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\nusing namespace std;\\n#define MOD 1000000009\\nstruct Matrix{\\n unsigned long long n;\\n\\n Matrix(){\\n memset(m,0,sizeof m);\\n };\\n\\n Matrix(const Matrix &ipt){\\n n = ipt.n;\\n for (unsigned long long i=0;i<n;++i){\\n for (unsigned long long j=0;j<n;++j){\\n m[i][j] = ipt.m[i][j];\\n }\\n }\\n }\\n unsigned long long m[80][80];\\n Matrix operator * (const Matrix &b) const{\\n Matrix c;\\n for (unsigned long long i=0;i<n;i++)\\n for (unsigned long long j=0;j<n;j++){\\n c.m[i][j]=0;\\n for (unsigned long long k=0;k<n;k++)\\n c.m[i][j]=(c.m[i][j]+(m[i][k]*b.m[k][j])%MOD)%MOD;\\n }\\n c.n=n;\\n return c;\\n }\\n};\\nMatrix ones;\\nMatrix Pow(const Matrix &a,unsigned long long n){\\n Matrix t=ones,y=a;\\n while (n){\\n if (n & 1) t = (t * y) ;\\n y = (y * y) ;\\n n /= 2;\\n }\\n return t;\\n}\\nstruct node{\\n unsigned long long a,b;\\n}Pos[50];\\nbool cmp(node a,node b){\\n return a.b<b.b;\\n}\\nMatrix A,B;\\nunsigned long long x[80];\\nvoid get_x(Matrix A){\\n unsigned long long y[80];\\n //printf(\\\"!!!\\\");\\n memset(y,0,sizeof y);\\n for (unsigned long long i=0;i<A.n;i++){\\n for (unsigned long long j=0;j<A.n;j++){\\n y[i]=(y[i]+(x[j]*A.m[i][j])%MOD)%MOD;\\n }\\n }\\n for (unsigned long long i=0;i<A.n;i++)\\n x[i]=y[i];\\n}\\nunsigned long long sum;\\nunsigned long long w,n;\\nunsigned long long h;\\nint main(){\\n unsigned long long i,j,now;\\n unsigned long long k;\\n unsigned long long p,q;\\n unsigned long long d=0;\\n while (scanf(\\\"%llu%llu%llu\\\",&w,&h,&n),w||h||n){\\n memset(ones.m,0,sizeof ones.m);\\n ones.n=w;\\n for (i=0;i<w;i++)\\n ones.m[i][i]=1;\\n for (i=0;i<n;i++){\\n scanf(\\\"%llu%llu\\\",&Pos[i].a,&Pos[i].b);\\n Pos[i].a--;Pos[i].b--;\\n }\\n sort(Pos,Pos+n,cmp);\\n memset(A.m,0,sizeof A.m);\\n A.n=w;\\n A.m[0][0]=1; A.m[0][1]=1;\\n for (i=1;i<w;i++){\\n A.m[i][i-1]=1;A.m[i][i]=1;A.m[i][i+1]=1;\\n }\\n for (i=0;i<w;i++)\\n x[i]=0;//列向量\\n x[0]=1;\\n k=0;\\n j=0;\\n //printf(\\\"!!!\\\");\\n while (j<n){\\n p=Pos[j].b;\\n if (k==p){\\n x[Pos[j].a]=0;\\n }\\n else{\\n get_x(Pow(A,p-k));\\n k=p;\\n x[Pos[j].a]=0;\\n }\\n //printf(\\\"%d\\\",k);\\n //for (int i=0;i<w;i++)\\n // printf(\\\"%5d\\\",x[i]);\\n //printf(\\\"\\\\n\\\");\\n j++;\\n\\n }\\n //printf(\\\"!!!\\\");\\n if (k<h-1){\\n\\n// B=Pow(A,h-1-k);printf(\\\"#!!!\\\");\\n get_x(Pow(A,h-1-k));\\n }\\n printf(\\\"Case %llu: %llu\\\\n\\\",++d,(x[w-1]%MOD+MOD)%MOD);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2320,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.6564,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1364,"cells":{"group_id":{"kind":"string","value":"aoj_2396_cpp"},"problem_description":{"kind":"string","value":"Skyland\nSomewhere in the sky, KM kingdom built\nn\nfloating islands by their highly developed technology.\nThe islands are numbered from 1 to\nn\n.\nThe king of the country, Kita_masa, can choose any non-negative real number as the altitude for each island, as long as the sum of the altitudes is greater than or equals to\nH\n.\nFor floating the island\ni\nto the altitude\nh_i\n, it costs\nb_i h_i\n.\nBesides, it costs\n|h_i - h_j|c_{i,j}\nfor each pair of islands\ni\nand\nj\nsince there are communications between these islands.\nRecently, energy prices are rising, so the king, Kita_masa, wants to minimize the sum of the costs.\nThe king ordered you, a court programmer, to write a program that finds the altitudes of the floating islands that minimize the cost.\nInput\nThe input contains several test cases.\nEach test case starts with a line containing two integers\nn\n(\n1 \\leq n \\leq 100\n) and\nH\n(\n0\\leq H \\leq 1,000\n), separated by a single space.\nThe next line contains\nn\nintegers\nb_1\n,\nb_2\n,...,\nb_n\n(\n0\\leq b_i \\leq 1,000\n).\nEach of the next\nn\nlines contains\nn\nintegers\nc_{i,j}\n(\n0 \\leq c_{i,j} \\leq 1,000\n).\nYou may assume\nc_{i, i} = 0\nand\nc_{i, j} = c_{j, i}\n.\nThe last test case is followed by a line containing two zeros.\nOutput\nFor each test case, print its case number.\nThen print a line containing a space-separated list of the altitudes of the islands that minimizes the sum of the costs.\nIf there are several possible solutions, print any of them.\nYour answer will be accepted if the altitude of each island is non-negative, sum of the altitudes is greater than\n(1-10^{-9})H\n, and the cost calculated from your answer has an absolute or relative error less than\n10^{-9}\nfrom the optimal solution.\nFollow the format of the sample output.\nSample Input\n2 1\n1 3\n0 1\n1 0\n3 3\n1 2 4\n0 2 0\n2 0 1\n0 1 0\n0 0\nOutput for the Sample Input\nCase 1:\n0.75 0.25\nCase 2:\n1.5 1.5 0.0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2396_1134890","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <assert.h>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\n\ntypedef double Weight;\nconst Weight INF=99999999;\nstruct Edge{\n\tint src,dst;\n\tWeight weight;\n\tint rev;\n\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\n};\ntypedef vector< vector<Edge> > Graph;\n\nvoid add_edge(Graph &G,int s,int t,Weight cap){\n\tG[s].push_back(Edge(s,t,cap,G[t].size()));\n\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\n}\n\n\nvoid bfs(const Graph &G,vector<int> &level,int s){\n\tlevel[s]=0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\tREP(i,G[v].size()){\n\t\t\tconst Edge &e=G[v][i];\n\t\t\tif(e.weight>1e-8 && level[e.dst] < 0){\n\t\t\t\tlevel[e.dst] = level[v] +1;\n\t\t\t\tque.push(e.dst);\n\t\t\t}\n\t\t}\n\t}\n}\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\n\tif(v==t)return flow;\n\tfor(int &i=iter[v];i<(int)G[v].size();i++){\n\t\tEdge &e=G[v][i];\n\t\tif(e.weight>0&&level[v]<level[e.dst]){\n\t\t\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\n\t\t\tif(d>0){\n\t\t\t\te.weight-=d;\n\t\t\t\tG[e.dst][e.rev].weight+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\nreturn 0;\n}\n\n// Dinic\n// O(EV^2)\nWeight max_flow(Graph &G,int s,int t){\n\tWeight flow = 0;\n\twhile(true){\n\t\tvector<int> level(G.size(),-1);\n\t\tvector<int> iter(G.size(),0);\n\t\tbfs(G,level,s);\n\t\tif(level[t]<0)break; // もう流せない\n\t\tWeight f=0;\n\t\twhile((f=dfs(G,level,iter,s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nint n, h;\ndouble b[101], c[101][101];\n\nvi solve2(double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tmax_flow(g, n, n+1);\n\tqueue<int> que;\n\tvi visited(n+2, 1);\n\tque.push(n);\n\tvisited[n] = visited[n+1] = 0;\n\twhile(!que.empty()){\n\t\tint v = que.front(); que.pop();\n\t\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\n\t\t\tvisited[e->dst] = 0;\n\t\t\tque.push(e->dst);\n\t\t}\n\t}\n\treturn visited;\n}\n\nint main(){\n\tfor(int T=1;scanf(\"%d%d\", &n, &h), n;++T){\n\t\tREP(i, n) scanf(\"%lf\", &b[i]);\n\t\tREP(i, n)REP(j, n) scanf(\"%lf\", &c[i][j]);\n\t\tvi ans;\n\t\tdouble l=0.0, r = 2000.0;\n\t\tREP(itr, 11){\n\t\t\tdouble med = (l+r)/2;\n\t\t\tvi res = solve2(med);\n\t\t\tif(accumulate(ALL(res), 0)){\n\t\t\t\tans = res;\n\t\t\t\tr = med;\n\t\t\t}else l = med;\n\t\t}\n\t\tprintf(\"Case %d:\\n\", T, l);\n\t\tdouble H = (double)h / accumulate(ALL(ans), 0);\n\t\tREP(i, n) printf(\"%.15f%s\", ans[i] ? H : 0.0, i+1==n ? \"\\n\" : \" \");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":1864,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2396_1134888","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <assert.h>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\n\ntypedef double Weight;\nconst Weight INF=99999999;\nstruct Edge{\n\tint src,dst;\n\tWeight weight;\n\tint rev;\n\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\n};\ntypedef vector< vector<Edge> > Graph;\n\nvoid add_edge(Graph &G,int s,int t,Weight cap){\n\tG[s].push_back(Edge(s,t,cap,G[t].size()));\n\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\n}\n\n\nvoid bfs(const Graph &G,vector<int> &level,int s){\n\tlevel[s]=0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\tREP(i,G[v].size()){\n\t\t\tconst Edge &e=G[v][i];\n\t\t\tif(e.weight>1e-8 && level[e.dst] < 0){\n\t\t\t\tlevel[e.dst] = level[v] +1;\n\t\t\t\tque.push(e.dst);\n\t\t\t}\n\t\t}\n\t}\n}\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\n\tif(v==t)return flow;\n\tfor(int &i=iter[v];i<(int)G[v].size();i++){\n\t\tEdge &e=G[v][i];\n\t\tif(e.weight>0&&level[v]<level[e.dst]){\n\t\t\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\n\t\t\tif(d>0){\n\t\t\t\te.weight-=d;\n\t\t\t\tG[e.dst][e.rev].weight+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\nreturn 0;\n}\n\n// Dinic\n// O(EV^2)\nWeight max_flow(Graph &G,int s,int t){\n\tWeight flow = 0;\n\twhile(true){\n\t\tvector<int> level(G.size(),-1);\n\t\tvector<int> iter(G.size(),0);\n\t\tbfs(G,level,s);\n\t\tif(level[t]<0)break; // もう流せない\n\t\tWeight f=0;\n\t\twhile((f=dfs(G,level,iter,s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nint n, h;\ndouble b[101], c[101][101];\n\nvi solve2(double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tmax_flow(g, n, n+1);\n\tqueue<int> que;\n\tvi visited(n+2, 1);\n\tque.push(n);\n\tvisited[n] = visited[n+1] = 0;\n\twhile(!que.empty()){\n\t\tint v = que.front(); que.pop();\n\t\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\n\t\t\tvisited[e->dst] = 0;\n\t\t\tque.push(e->dst);\n\t\t}\n\t}\n\treturn visited;\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tfor(int T=1;cin >> n >> h, n;++T){\n\t\tREP(i, n) cin >> b[i];\n\t\tREP(i, n)REP(j, n) cin >> c[i][j];\n\t\tvi ans;\n\t\tdouble l=0.0, r = 2000.0;\n\t\tREP(itr, 20){\n\t\t\tdouble med = (l+r)/2;\n\t\t\tvi res = solve2(med);\n\t\t\tif(accumulate(ALL(res), 0)){\n\t\t\t\tans = res;\n\t\t\t\tr = med;\n\t\t\t}else l = med;\n\t\t}\n\t\tprintf(\"Case %d:\\n\", T, l);\n\t\tint lSl = accumulate(ALL(ans), 0);\n\t\tREP(i, n) printf(\"%.15f%s\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \"\\n\" : \" \");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1908,"score_of_the_acc":-1.0218,"final_rank":2},{"submission_id":"aoj_2396_1134887","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <assert.h>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\n\ntypedef double Weight;\nconst Weight INF=99999999;\nstruct Edge{\n\tint src,dst;\n\tWeight weight;\n\tint rev;\n\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\n};\ntypedef vector< vector<Edge> > Graph;\n\nvoid add_edge(Graph &G,int s,int t,Weight cap){\n\tG[s].push_back(Edge(s,t,cap,G[t].size()));\n\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\n}\n\n\nvoid bfs(const Graph &G,vector<int> &level,int s){\n\tlevel[s]=0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\tREP(i,G[v].size()){\n\t\t\tconst Edge &e=G[v][i];\n\t\t\tif(e.weight>1e-8 && level[e.dst] < 0){\n\t\t\t\tlevel[e.dst] = level[v] +1;\n\t\t\t\tque.push(e.dst);\n\t\t\t}\n\t\t}\n\t}\n}\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\n\tif(v==t)return flow;\n\tfor(int &i=iter[v];i<(int)G[v].size();i++){\n\t\tEdge &e=G[v][i];\n\t\tif(e.weight>0&&level[v]<level[e.dst]){\n\t\t\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\n\t\t\tif(d>0){\n\t\t\t\te.weight-=d;\n\t\t\t\tG[e.dst][e.rev].weight+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\nreturn 0;\n}\n\n// Dinic\n// O(EV^2)\nWeight max_flow(Graph &G,int s,int t){\n\tWeight flow = 0;\n\twhile(true){\n\t\tvector<int> level(G.size(),-1);\n\t\tvector<int> iter(G.size(),0);\n\t\tbfs(G,level,s);\n\t\tif(level[t]<0)break; // もう流せない\n\t\tWeight f=0;\n\t\twhile((f=dfs(G,level,iter,s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nint n, h;\ndouble b[101], c[101][101];\n\nvi solve2(double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tmax_flow(g, n, n+1);\n\tqueue<int> que;\n\tvi visited(n+2, 1);\n\tque.push(n);\n\tvisited[n] = visited[n+1] = 0;\n\twhile(!que.empty()){\n\t\tint v = que.front(); que.pop();\n\t\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\n\t\t\tvisited[e->dst] = 0;\n\t\t\tque.push(e->dst);\n\t\t}\n\t}\n\treturn visited;\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tfor(int T=1;cin >> n >> h, n;++T){\n\t\tREP(i, n) cin >> b[i];\n\t\tREP(i, n)REP(j, n) cin >> c[i][j];\n\t\tvi ans;\n\t\tdouble l=0.0, r = 2000.0;\n\t\tREP(itr, 40){\n\t\t\tdouble med = (l+r)/2;\n\t\t\tvi res = solve2(med);\n\t\t\tif(accumulate(ALL(res), 0)){\n\t\t\t\tans = res;\n\t\t\t\tr = med;\n\t\t\t}else l = med;\n\t\t}\n\t\tprintf(\"Case %d:\\n\", T, l);\n\t\tint lSl = accumulate(ALL(ans), 0);\n\t\tREP(i, n) printf(\"%.15f%s\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \"\\n\" : \" \");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":580,"memory_kb":1904,"score_of_the_acc":-1.3503,"final_rank":3},{"submission_id":"aoj_2396_1134886","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <assert.h>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\n\ntypedef double Weight;\nconst Weight INF=99999999;\nstruct Edge{\n\tint src,dst;\n\tWeight weight;\n\tint rev;\n\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\n};\ntypedef vector< vector<Edge> > Graph;\n\nvoid add_edge(Graph &G,int s,int t,Weight cap){\n\tG[s].push_back(Edge(s,t,cap,G[t].size()));\n\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\n}\n\n\nvoid bfs(const Graph &G,vector<int> &level,int s){\n\tlevel[s]=0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\tREP(i,G[v].size()){\n\t\t\tconst Edge &e=G[v][i];\n\t\t\tif(e.weight>1e-8 && level[e.dst] < 0){\n\t\t\t\tlevel[e.dst] = level[v] +1;\n\t\t\t\tque.push(e.dst);\n\t\t\t}\n\t\t}\n\t}\n}\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\n\tif(v==t)return flow;\n\tfor(int &i=iter[v];i<(int)G[v].size();i++){\n\t\tEdge &e=G[v][i];\n\t\tif(e.weight>0&&level[v]<level[e.dst]){\n\t\t\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\n\t\t\tif(d>0){\n\t\t\t\te.weight-=d;\n\t\t\t\tG[e.dst][e.rev].weight+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\nreturn 0;\n}\n\n// Dinic\n// O(EV^2)\nWeight max_flow(Graph &G,int s,int t){\n\tWeight flow = 0;\n\twhile(true){\n\t\tvector<int> level(G.size(),-1);\n\t\tvector<int> iter(G.size(),0);\n\t\tbfs(G,level,s);\n\t\tif(level[t]<0)break; // もう流せない\n\t\tWeight f=0;\n\t\twhile((f=dfs(G,level,iter,s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nint n, h;\ndouble b[101], c[101][101];\n\nvi solve2(double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tmax_flow(g, n, n+1);\n\tqueue<int> que;\n\tvi visited(n+2, 1);\n\tque.push(n);\n\tvisited[n] = visited[n+1] = 0;\n\twhile(!que.empty()){\n\t\tint v = que.front(); que.pop();\n\t\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\n\t\t\tvisited[e->dst] = 0;\n\t\t\tque.push(e->dst);\n\t\t}\n\t}\n\treturn visited;\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tfor(int T=1;cin >> n >> h, n;++T){\n\t\tREP(i, n) cin >> b[i];\n\t\tREP(i, n)REP(j, n) cin >> c[i][j];\n\t\tvi ans;\n\t\tdouble l=0.0, r = 2000.0;\n\t\tREP(itr, 60){\n\t\t\tdouble med = (l+r)/2;\n\t\t\tvi res = solve2(med);\n\t\t\tif(accumulate(ALL(res), 0)){\n\t\t\t\tans = res;\n\t\t\t\tr = med;\n\t\t\t}else l = med;\n\t\t}\n\t\tprintf(\"Case %d:\\n\", T, l);\n\t\tint lSl = accumulate(ALL(ans), 0);\n\t\tREP(i, n) printf(\"%.15f%s\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \"\\n\" : \" \");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":880,"memory_kb":1908,"score_of_the_acc":-1.8326,"final_rank":4},{"submission_id":"aoj_2396_1134881","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <assert.h>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n\n\n\ntypedef double Weight;\nconst Weight INF=99999999;\nstruct Edge{\n\tint src,dst;\n\tWeight weight;\n\tint rev;\n\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\n};\ntypedef vector< vector<Edge> > Graph;\n\nvoid add_edge(Graph &G,int s,int t,Weight cap){\n\tG[s].push_back(Edge(s,t,cap,G[t].size()));\n\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\n}\n\n\nvoid bfs(const Graph &G,vector<int> &level,int s){\n\tlevel[s]=0;\n\tqueue<int> que;\n\tque.push(s);\n\twhile(!que.empty()){\n\t\tint v=que.front();que.pop();\n\t\tREP(i,G[v].size()){\n\t\t\tconst Edge &e=G[v][i];\n\t\t\tif(e.weight>1e-8 && level[e.dst] < 0){\n\t\t\t\tlevel[e.dst] = level[v] +1;\n\t\t\t\tque.push(e.dst);\n\t\t\t}\n\t\t}\n\t}\n}\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\n\tif(v==t)return flow;\n\tfor(int &i=iter[v];i<(int)G[v].size();i++){\n\t\tEdge &e=G[v][i];\n\t\tif(e.weight>0&&level[v]<level[e.dst]){\n\t\t\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\n\t\t\tif(d>0){\n\t\t\t\te.weight-=d;\n\t\t\t\tG[e.dst][e.rev].weight+=d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\nreturn 0;\n}\n\n// Dinic\n// O(EV^2)\nWeight max_flow(Graph &G,int s,int t){\n\tWeight flow = 0;\n\twhile(true){\n\t\tvector<int> level(G.size(),-1);\n\t\tvector<int> iter(G.size(),0);\n\t\tbfs(G,level,s);\n\t\tif(level[t]<0)break; // もう流せない\n\t\tWeight f=0;\n\t\twhile((f=dfs(G,level,iter,s,t,INF))>0){\n\t\t\tflow+=f;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nint n, h;\ndouble b[101], c[101][101];\nvi ans;\npair<double, vi> solve(int req, double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, i == req ? 1e8 : t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tconst double cost = max_flow(g, n, n+1) - n * t;\n\tpair<double, vi> res(cost, vi());\n\tFOR(e, g[n])if(e->weight < 1e-8) res.second.push_back(e->dst);\n\treturn res;\n}\n\npair<double, vi> solve2(double t){\n\tGraph g(n+2);\n\tREP(i, n){\n\t\tadd_edge(g, n, i, b[i]);\n\t\tadd_edge(g, i, n+1, t);\n\t\tREP(j, n)if(i!=j){\n\t\t\tadd_edge(g, i, j, c[i][j]);\n\t\t}\n\t}\n\tconst double cost1 = max_flow(g, n, n+1) - n * t;\n\tif(cost1 > EPS) return make_pair(cost1, vi(n+1));\n\tdouble cost2 = INF;\n\tint q = 0;\n\tqueue<int> que;\n\tvi visited(n+2, 1);\n\tque.push(n);\n\tvisited[n] = visited[n+1] = 0;\n\twhile(!que.empty()){\n\t\tint v = que.front(); que.pop();\n\t\tFOR(e, g[v])if(e->weight*100 > EPS && visited[e->dst]){\n\t\t\tvisited[e->dst] = 0;\n\t\t\tque.push(e->dst);\n\t\t}\n\t}\n\treturn make_pair(cost1 + !accumulate(ALL(visited), 0), visited);\n}\n\nint main(){\n\tios::sync_with_stdio(false);\n\tfor(int T=1;cin >> n >> h, n;++T){\n\t\tREP(i, n) cin >> b[i];\n\t\tREP(i, n)REP(j, n) cin >> c[i][j];\n\t\tvi ans;\n\t\tdouble l=0.0, r = 2000.0;\n\t\tREP(itr, 60){\n\t\t\tdouble med = (l+r)/2;\n\t\t\tauto res = solve2(med);\n//\t\t\tcout << itr << \", \" << med << \", \" << res.first << \", \" << res.second << endl;\n\t\t\tif(res.first < 1e-8){\n\t\t\t\tans = res.second;\n\t\t\t\tr = med;\n\t\t\t}else l = med;\n\t\t}\n//\t\tans = solve(solve2(l).second, l).second;\n\t\tprintf(\"Case %d:\\n\", T, l);\n\t\tint lSl = accumulate(ALL(ans), 0);\n\t\tvector<double> qqq(n);\n\t\tREP(i, n) qqq[i] = ans[i] ? (double)h / lSl : 0.0;\n\t\tdouble sum = 0;\n\t\tREP(i, n) sum += qqq[i] * b[i];\n\t\tREP(i, n)REP(j, n) sum += abs(qqq[i] - qqq[j]) * c[i][j];\n//\t\tprintf(\"%.10f\\n\", sum/h);\n\n\t\tREP(i, n) printf(\"%.15f%s\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \"\\n\" : \" \");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":890,"memory_kb":1916,"score_of_the_acc":-2,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2396_1134890\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <assert.h>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\n\\n\\ntypedef double Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n\\tint src,dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n};\\ntypedef vector< vector<Edge> > Graph;\\n\\nvoid add_edge(Graph &G,int s,int t,Weight cap){\\n\\tG[s].push_back(Edge(s,t,cap,G[t].size()));\\n\\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\\n}\\n\\n\\nvoid bfs(const Graph &G,vector<int> &level,int s){\\n\\tlevel[s]=0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\tREP(i,G[v].size()){\\n\\t\\t\\tconst Edge &e=G[v][i];\\n\\t\\t\\tif(e.weight>1e-8 && level[e.dst] < 0){\\n\\t\\t\\t\\tlevel[e.dst] = level[v] +1;\\n\\t\\t\\t\\tque.push(e.dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\\n\\tif(v==t)return flow;\\n\\tfor(int &i=iter[v];i<(int)G[v].size();i++){\\n\\t\\tEdge &e=G[v][i];\\n\\t\\tif(e.weight>0&&level[v]<level[e.dst]){\\n\\t\\t\\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.weight-=d;\\n\\t\\t\\t\\tG[e.dst][e.rev].weight+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\nreturn 0;\\n}\\n\\n// Dinic\\n// O(EV^2)\\nWeight max_flow(Graph &G,int s,int t){\\n\\tWeight flow = 0;\\n\\twhile(true){\\n\\t\\tvector<int> level(G.size(),-1);\\n\\t\\tvector<int> iter(G.size(),0);\\n\\t\\tbfs(G,level,s);\\n\\t\\tif(level[t]<0)break; // もう流せない\\n\\t\\tWeight f=0;\\n\\t\\twhile((f=dfs(G,level,iter,s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nint n, h;\\ndouble b[101], c[101][101];\\n\\nvi solve2(double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tmax_flow(g, n, n+1);\\n\\tqueue<int> que;\\n\\tvi visited(n+2, 1);\\n\\tque.push(n);\\n\\tvisited[n] = visited[n+1] = 0;\\n\\twhile(!que.empty()){\\n\\t\\tint v = que.front(); que.pop();\\n\\t\\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\\n\\t\\t\\tvisited[e->dst] = 0;\\n\\t\\t\\tque.push(e->dst);\\n\\t\\t}\\n\\t}\\n\\treturn visited;\\n}\\n\\nint main(){\\n\\tfor(int T=1;scanf(\\\"%d%d\\\", &n, &h), n;++T){\\n\\t\\tREP(i, n) scanf(\\\"%lf\\\", &b[i]);\\n\\t\\tREP(i, n)REP(j, n) scanf(\\\"%lf\\\", &c[i][j]);\\n\\t\\tvi ans;\\n\\t\\tdouble l=0.0, r = 2000.0;\\n\\t\\tREP(itr, 11){\\n\\t\\t\\tdouble med = (l+r)/2;\\n\\t\\t\\tvi res = solve2(med);\\n\\t\\t\\tif(accumulate(ALL(res), 0)){\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\t\\tr = med;\\n\\t\\t\\t}else l = med;\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", T, l);\\n\\t\\tdouble H = (double)h / accumulate(ALL(ans), 0);\\n\\t\\tREP(i, n) printf(\\\"%.15f%s\\\", ans[i] ? H : 0.0, i+1==n ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 1864,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2396_1134888\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <assert.h>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\n\\n\\ntypedef double Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n\\tint src,dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n};\\ntypedef vector< vector<Edge> > Graph;\\n\\nvoid add_edge(Graph &G,int s,int t,Weight cap){\\n\\tG[s].push_back(Edge(s,t,cap,G[t].size()));\\n\\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\\n}\\n\\n\\nvoid bfs(const Graph &G,vector<int> &level,int s){\\n\\tlevel[s]=0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\tREP(i,G[v].size()){\\n\\t\\t\\tconst Edge &e=G[v][i];\\n\\t\\t\\tif(e.weight>1e-8 && level[e.dst] < 0){\\n\\t\\t\\t\\tlevel[e.dst] = level[v] +1;\\n\\t\\t\\t\\tque.push(e.dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\\n\\tif(v==t)return flow;\\n\\tfor(int &i=iter[v];i<(int)G[v].size();i++){\\n\\t\\tEdge &e=G[v][i];\\n\\t\\tif(e.weight>0&&level[v]<level[e.dst]){\\n\\t\\t\\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.weight-=d;\\n\\t\\t\\t\\tG[e.dst][e.rev].weight+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\nreturn 0;\\n}\\n\\n// Dinic\\n// O(EV^2)\\nWeight max_flow(Graph &G,int s,int t){\\n\\tWeight flow = 0;\\n\\twhile(true){\\n\\t\\tvector<int> level(G.size(),-1);\\n\\t\\tvector<int> iter(G.size(),0);\\n\\t\\tbfs(G,level,s);\\n\\t\\tif(level[t]<0)break; // もう流せない\\n\\t\\tWeight f=0;\\n\\t\\twhile((f=dfs(G,level,iter,s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nint n, h;\\ndouble b[101], c[101][101];\\n\\nvi solve2(double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tmax_flow(g, n, n+1);\\n\\tqueue<int> que;\\n\\tvi visited(n+2, 1);\\n\\tque.push(n);\\n\\tvisited[n] = visited[n+1] = 0;\\n\\twhile(!que.empty()){\\n\\t\\tint v = que.front(); que.pop();\\n\\t\\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\\n\\t\\t\\tvisited[e->dst] = 0;\\n\\t\\t\\tque.push(e->dst);\\n\\t\\t}\\n\\t}\\n\\treturn visited;\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tfor(int T=1;cin >> n >> h, n;++T){\\n\\t\\tREP(i, n) cin >> b[i];\\n\\t\\tREP(i, n)REP(j, n) cin >> c[i][j];\\n\\t\\tvi ans;\\n\\t\\tdouble l=0.0, r = 2000.0;\\n\\t\\tREP(itr, 20){\\n\\t\\t\\tdouble med = (l+r)/2;\\n\\t\\t\\tvi res = solve2(med);\\n\\t\\t\\tif(accumulate(ALL(res), 0)){\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\t\\tr = med;\\n\\t\\t\\t}else l = med;\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", T, l);\\n\\t\\tint lSl = accumulate(ALL(ans), 0);\\n\\t\\tREP(i, n) printf(\\\"%.15f%s\\\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1908,\n \"score_of_the_acc\": -1.0218,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2396_1134887\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <assert.h>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\n\\n\\ntypedef double Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n\\tint src,dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n};\\ntypedef vector< vector<Edge> > Graph;\\n\\nvoid add_edge(Graph &G,int s,int t,Weight cap){\\n\\tG[s].push_back(Edge(s,t,cap,G[t].size()));\\n\\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\\n}\\n\\n\\nvoid bfs(const Graph &G,vector<int> &level,int s){\\n\\tlevel[s]=0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\tREP(i,G[v].size()){\\n\\t\\t\\tconst Edge &e=G[v][i];\\n\\t\\t\\tif(e.weight>1e-8 && level[e.dst] < 0){\\n\\t\\t\\t\\tlevel[e.dst] = level[v] +1;\\n\\t\\t\\t\\tque.push(e.dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\\n\\tif(v==t)return flow;\\n\\tfor(int &i=iter[v];i<(int)G[v].size();i++){\\n\\t\\tEdge &e=G[v][i];\\n\\t\\tif(e.weight>0&&level[v]<level[e.dst]){\\n\\t\\t\\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.weight-=d;\\n\\t\\t\\t\\tG[e.dst][e.rev].weight+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\nreturn 0;\\n}\\n\\n// Dinic\\n// O(EV^2)\\nWeight max_flow(Graph &G,int s,int t){\\n\\tWeight flow = 0;\\n\\twhile(true){\\n\\t\\tvector<int> level(G.size(),-1);\\n\\t\\tvector<int> iter(G.size(),0);\\n\\t\\tbfs(G,level,s);\\n\\t\\tif(level[t]<0)break; // もう流せない\\n\\t\\tWeight f=0;\\n\\t\\twhile((f=dfs(G,level,iter,s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nint n, h;\\ndouble b[101], c[101][101];\\n\\nvi solve2(double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tmax_flow(g, n, n+1);\\n\\tqueue<int> que;\\n\\tvi visited(n+2, 1);\\n\\tque.push(n);\\n\\tvisited[n] = visited[n+1] = 0;\\n\\twhile(!que.empty()){\\n\\t\\tint v = que.front(); que.pop();\\n\\t\\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\\n\\t\\t\\tvisited[e->dst] = 0;\\n\\t\\t\\tque.push(e->dst);\\n\\t\\t}\\n\\t}\\n\\treturn visited;\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tfor(int T=1;cin >> n >> h, n;++T){\\n\\t\\tREP(i, n) cin >> b[i];\\n\\t\\tREP(i, n)REP(j, n) cin >> c[i][j];\\n\\t\\tvi ans;\\n\\t\\tdouble l=0.0, r = 2000.0;\\n\\t\\tREP(itr, 40){\\n\\t\\t\\tdouble med = (l+r)/2;\\n\\t\\t\\tvi res = solve2(med);\\n\\t\\t\\tif(accumulate(ALL(res), 0)){\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\t\\tr = med;\\n\\t\\t\\t}else l = med;\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", T, l);\\n\\t\\tint lSl = accumulate(ALL(ans), 0);\\n\\t\\tREP(i, n) printf(\\\"%.15f%s\\\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 1904,\n \"score_of_the_acc\": -1.3503,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2396_1134886\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <assert.h>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\n\\n\\ntypedef double Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n\\tint src,dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n};\\ntypedef vector< vector<Edge> > Graph;\\n\\nvoid add_edge(Graph &G,int s,int t,Weight cap){\\n\\tG[s].push_back(Edge(s,t,cap,G[t].size()));\\n\\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\\n}\\n\\n\\nvoid bfs(const Graph &G,vector<int> &level,int s){\\n\\tlevel[s]=0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\tREP(i,G[v].size()){\\n\\t\\t\\tconst Edge &e=G[v][i];\\n\\t\\t\\tif(e.weight>1e-8 && level[e.dst] < 0){\\n\\t\\t\\t\\tlevel[e.dst] = level[v] +1;\\n\\t\\t\\t\\tque.push(e.dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\\n\\tif(v==t)return flow;\\n\\tfor(int &i=iter[v];i<(int)G[v].size();i++){\\n\\t\\tEdge &e=G[v][i];\\n\\t\\tif(e.weight>0&&level[v]<level[e.dst]){\\n\\t\\t\\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.weight-=d;\\n\\t\\t\\t\\tG[e.dst][e.rev].weight+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\nreturn 0;\\n}\\n\\n// Dinic\\n// O(EV^2)\\nWeight max_flow(Graph &G,int s,int t){\\n\\tWeight flow = 0;\\n\\twhile(true){\\n\\t\\tvector<int> level(G.size(),-1);\\n\\t\\tvector<int> iter(G.size(),0);\\n\\t\\tbfs(G,level,s);\\n\\t\\tif(level[t]<0)break; // もう流せない\\n\\t\\tWeight f=0;\\n\\t\\twhile((f=dfs(G,level,iter,s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nint n, h;\\ndouble b[101], c[101][101];\\n\\nvi solve2(double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tmax_flow(g, n, n+1);\\n\\tqueue<int> que;\\n\\tvi visited(n+2, 1);\\n\\tque.push(n);\\n\\tvisited[n] = visited[n+1] = 0;\\n\\twhile(!que.empty()){\\n\\t\\tint v = que.front(); que.pop();\\n\\t\\tFOR(e, g[v])if(e->weight*10 > EPS && visited[e->dst]){\\n\\t\\t\\tvisited[e->dst] = 0;\\n\\t\\t\\tque.push(e->dst);\\n\\t\\t}\\n\\t}\\n\\treturn visited;\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tfor(int T=1;cin >> n >> h, n;++T){\\n\\t\\tREP(i, n) cin >> b[i];\\n\\t\\tREP(i, n)REP(j, n) cin >> c[i][j];\\n\\t\\tvi ans;\\n\\t\\tdouble l=0.0, r = 2000.0;\\n\\t\\tREP(itr, 60){\\n\\t\\t\\tdouble med = (l+r)/2;\\n\\t\\t\\tvi res = solve2(med);\\n\\t\\t\\tif(accumulate(ALL(res), 0)){\\n\\t\\t\\t\\tans = res;\\n\\t\\t\\t\\tr = med;\\n\\t\\t\\t}else l = med;\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", T, l);\\n\\t\\tint lSl = accumulate(ALL(ans), 0);\\n\\t\\tREP(i, n) printf(\\\"%.15f%s\\\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 1908,\n \"score_of_the_acc\": -1.8326,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2396_1134881\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <assert.h>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n\\n\\n\\ntypedef double Weight;\\nconst Weight INF=99999999;\\nstruct Edge{\\n\\tint src,dst;\\n\\tWeight weight;\\n\\tint rev;\\n\\tEdge(int f, int t, Weight c,int rev=0):src(f),dst(t),weight(c),rev(rev){}\\n};\\ntypedef vector< vector<Edge> > Graph;\\n\\nvoid add_edge(Graph &G,int s,int t,Weight cap){\\n\\tG[s].push_back(Edge(s,t,cap,G[t].size()));\\n\\tG[t].push_back(Edge(t,s,0,G[s].size()-1));\\n}\\n\\n\\nvoid bfs(const Graph &G,vector<int> &level,int s){\\n\\tlevel[s]=0;\\n\\tqueue<int> que;\\n\\tque.push(s);\\n\\twhile(!que.empty()){\\n\\t\\tint v=que.front();que.pop();\\n\\t\\tREP(i,G[v].size()){\\n\\t\\t\\tconst Edge &e=G[v][i];\\n\\t\\t\\tif(e.weight>1e-8 && level[e.dst] < 0){\\n\\t\\t\\t\\tlevel[e.dst] = level[v] +1;\\n\\t\\t\\t\\tque.push(e.dst);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nWeight dfs(Graph &G,vector<int> &level,vector<int> &iter,int v,int t,Weight flow){\\n\\tif(v==t)return flow;\\n\\tfor(int &i=iter[v];i<(int)G[v].size();i++){\\n\\t\\tEdge &e=G[v][i];\\n\\t\\tif(e.weight>0&&level[v]<level[e.dst]){\\n\\t\\t\\tWeight d=dfs(G,level,iter,e.dst,t,min(flow,e.weight));\\n\\t\\t\\tif(d>0){\\n\\t\\t\\t\\te.weight-=d;\\n\\t\\t\\t\\tG[e.dst][e.rev].weight+=d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\nreturn 0;\\n}\\n\\n// Dinic\\n// O(EV^2)\\nWeight max_flow(Graph &G,int s,int t){\\n\\tWeight flow = 0;\\n\\twhile(true){\\n\\t\\tvector<int> level(G.size(),-1);\\n\\t\\tvector<int> iter(G.size(),0);\\n\\t\\tbfs(G,level,s);\\n\\t\\tif(level[t]<0)break; // もう流せない\\n\\t\\tWeight f=0;\\n\\t\\twhile((f=dfs(G,level,iter,s,t,INF))>0){\\n\\t\\t\\tflow+=f;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nint n, h;\\ndouble b[101], c[101][101];\\nvi ans;\\npair<double, vi> solve(int req, double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, i == req ? 1e8 : t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tconst double cost = max_flow(g, n, n+1) - n * t;\\n\\tpair<double, vi> res(cost, vi());\\n\\tFOR(e, g[n])if(e->weight < 1e-8) res.second.push_back(e->dst);\\n\\treturn res;\\n}\\n\\npair<double, vi> solve2(double t){\\n\\tGraph g(n+2);\\n\\tREP(i, n){\\n\\t\\tadd_edge(g, n, i, b[i]);\\n\\t\\tadd_edge(g, i, n+1, t);\\n\\t\\tREP(j, n)if(i!=j){\\n\\t\\t\\tadd_edge(g, i, j, c[i][j]);\\n\\t\\t}\\n\\t}\\n\\tconst double cost1 = max_flow(g, n, n+1) - n * t;\\n\\tif(cost1 > EPS) return make_pair(cost1, vi(n+1));\\n\\tdouble cost2 = INF;\\n\\tint q = 0;\\n\\tqueue<int> que;\\n\\tvi visited(n+2, 1);\\n\\tque.push(n);\\n\\tvisited[n] = visited[n+1] = 0;\\n\\twhile(!que.empty()){\\n\\t\\tint v = que.front(); que.pop();\\n\\t\\tFOR(e, g[v])if(e->weight*100 > EPS && visited[e->dst]){\\n\\t\\t\\tvisited[e->dst] = 0;\\n\\t\\t\\tque.push(e->dst);\\n\\t\\t}\\n\\t}\\n\\treturn make_pair(cost1 + !accumulate(ALL(visited), 0), visited);\\n}\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tfor(int T=1;cin >> n >> h, n;++T){\\n\\t\\tREP(i, n) cin >> b[i];\\n\\t\\tREP(i, n)REP(j, n) cin >> c[i][j];\\n\\t\\tvi ans;\\n\\t\\tdouble l=0.0, r = 2000.0;\\n\\t\\tREP(itr, 60){\\n\\t\\t\\tdouble med = (l+r)/2;\\n\\t\\t\\tauto res = solve2(med);\\n//\\t\\t\\tcout << itr << \\\", \\\" << med << \\\", \\\" << res.first << \\\", \\\" << res.second << endl;\\n\\t\\t\\tif(res.first < 1e-8){\\n\\t\\t\\t\\tans = res.second;\\n\\t\\t\\t\\tr = med;\\n\\t\\t\\t}else l = med;\\n\\t\\t}\\n//\\t\\tans = solve(solve2(l).second, l).second;\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", T, l);\\n\\t\\tint lSl = accumulate(ALL(ans), 0);\\n\\t\\tvector<double> qqq(n);\\n\\t\\tREP(i, n) qqq[i] = ans[i] ? (double)h / lSl : 0.0;\\n\\t\\tdouble sum = 0;\\n\\t\\tREP(i, n) sum += qqq[i] * b[i];\\n\\t\\tREP(i, n)REP(j, n) sum += abs(qqq[i] - qqq[j]) * c[i][j];\\n//\\t\\tprintf(\\\"%.10f\\\\n\\\", sum/h);\\n\\n\\t\\tREP(i, n) printf(\\\"%.15f%s\\\", ans[i] ? (double)h / lSl : 0.0, i+1==n ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 1916,\n \"score_of_the_acc\": -2,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1365,"cells":{"group_id":{"kind":"string","value":"aoj_2391_cpp"},"problem_description":{"kind":"string","value":"Billiards Sorting\nRotation is one of several popular pocket billiards games.\nIt uses 15 balls numbered from 1 to 15, and set them up as illustrated in the following figure at the beginning of a game.\n(Note: the ball order is modified from real-world Rotation rules for simplicity of the problem.)\n[ 1]\n [ 2][ 3]\n [ 4][ 5][ 6]\n [ 7][ 8][ 9][10]\n[11][12][13][14][15]\nYou are an engineer developing an automatic billiards machine.\nFor the first step you had to build a machine that sets up the initial condition.\nThis project went well, and finally made up a machine that could arrange the balls in the triangular shape.\nHowever, unfortunately, it could not place the balls in the correct order.\nSo now you are trying to build another machine that fixes the order of balls by swapping them.\nTo cut off the cost, it is only allowed to swap the ball #1 with its neighboring balls that are not in the same row.\nFor example, in the case below, only the following pairs can be swapped: (1,2), (1,3), (1,8), and (1,9).\n[ 5]\n [ 2][ 3]\n [ 4][ 1][ 6]\n [ 7][ 8][ 9][10]\n[11][12][13][14][15]\nWrite a program that calculates the minimum number of swaps required.\nInput\nThe first line of each test case has an integer\nN\n(\n1 \\leq N \\leq 5\n), which is the number of the rows.\nThe following\nN\nlines describe how the balls are arranged by the first machine;\nthe\ni\n-th of them consists of exactly\ni\nintegers, which are the ball numbers.\nThe input terminates when\nN\n= 0. Your program must not output for this case.\nOutput\nFor each test case, print its case number and the minimum number of swaps.\nYou can assume that any arrangement can be fixed by not more than 45 swaps.\nSample Input\n2\n3\n2 1\n4\n9\n2 4\n8 5 3\n7 1 6 10\n0\nOutput for the Sample Input\nCase 1: 1\nCase 2: 13"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2391_10851349","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <cstring>\n#include <cmath>\n#include <string>\n#include <stack>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdlib>\n#define INF 0x3f3f3f3f\n#define er(i) (1<<i)\n#define lb lower_bound\n#define up upper_bound\n#define eps 1e-8\n#define mp make_pair\n#define pii pair<int, int>\n#define zero(x) (((x)>0?(x):-(x))<eps)\n#define mem(a,b) memset((a),(b),sizeof((a)))\n#define lld long long\n\nusing namespace std;\nint dir[20][4];\nint dis[20][20];\nint n;\nint a[20];\nint b[20];\nint ans;\n\nint cal() {\n int sum = 0;\n int i;\n for(i = 1; i <= n; i++)\n if (a[i] != 1)\n sum += dis[i][a[i]];\n return sum;\n}\n\nint dfs(int dep, int now, int pre) {\n int i;\n// cout<<dep<<endl;\n// for(i = 1; i <= n; i++)\n// cout<<a[i]<<\" \";\n// cout<<endl;\n// cout<<cal()<<endl;\n int s = cal();\n if (s == 0) return 1;\n if (dep + s > ans) return 0;\n\n for(i = 3; i >= 0; i--) {\n int u = dir[now][i];\n if (u == 0 || u > n || u == pre) continue;\n swap(a[now], a[u]);\n if (dfs(dep + 1, u, now)) return 1;\n swap(a[now], a[u]);\n }\n return 0;\n}\n\nint main() {\n int cas = 0;\n int i, j, k;\n mem(dir,0);\n dir[1][0] = 2;\n dir[1][1] = 3;\n dir[2][0] = 1;\n dir[2][1] = 4;\n dir[2][3] = 5;\n dir[3][0] = 1;\n dir[3][1] = 5;\n dir[3][2] = 6;\n dir[4][0] = 2;\n dir[4][1] = 7;\n dir[4][2] = 8;\n dir[5][0] = 2;\n dir[5][1] = 3;\n dir[5][2] = 8;\n dir[5][3] = 9;\n dir[6][0] = 3;\n dir[6][1] = 9;\n dir[6][2] = 10;\n dir[7][0] = 4;\n dir[7][1] = 11;\n dir[7][2] = 12;\n dir[8][0] = 4;\n dir[8][1] = 5;\n dir[8][2] = 12;\n dir[8][3] = 13;\n dir[9][0] = 5;\n dir[9][1] = 6;\n dir[9][2] = 13;\n dir[9][3] = 14;\n dir[10][0] = 6;\n dir[10][1] = 14;\n dir[10][2] = 15;\n dir[11][0] = 7;\n dir[12][0] = 7;\n dir[12][1] = 8;\n dir[13][0] = 8;\n dir[13][1] = 9;\n dir[14][0] = 9;\n dir[14][1] = 10;\n dir[15][0] = 10;\n mem(dis,63);\n for(i = 1; i <= 15; i++) {\n dis[i][i] = 0;\n for(j = 0; j < 4; j++) {\n if (dir[i][j] == 0) continue;\n dis[i][dir[i][j]] = 1;\n }\n }\n for(k = 1; k <= 15; k++)\n for(i = 1; i <= 15; i++)\n for(j = 1; j <= 15; j++)\n if (i != j && j != k && i != k)\n if (dis[i][k] + dis[k][j] < dis[i][j])\n dis[i][j] = dis[i][k] + dis[k][j];\n// for(i = 1; i <= 10; i++)\n// for(j = 1; j <= 10; j++)\n// cout<<i<<\" \"<<j<<\" \"<<dis[i][j]<<endl;\n while(~scanf(\"%d\", &n), n) {\n n = n * (n + 1) / 2;\n int p = 0;\n for(i = 1; i <= n; i++)\n scanf(\"%d\", &a[i]);\n for(i = 1; i <= n; i++)\n if (a[i] == 1) p = i;\n for(i = 1; i <= n; i++)\n b[i] = a[i];\n int st = 0;\n if (p == 1 || (p >= 4 && p <= 6) || (p >= 11 && p <= 15)) st = 0; else st = 1;\n for(ans = st; ans <= 45; ans+=2) {\n// for(i = 1; i <= n; i++)\n// a[i] = b[i];\n if (dfs(0, p, -1) != 0) break;\n }\n printf(\"Case %d: %d\\n\", ++cas, ans);\n }\n return 0;\n}","accuracy":1,"time_ms":4640,"memory_kb":3572,"score_of_the_acc":-0.0605,"final_rank":1},{"submission_id":"aoj_2391_525730","code_snippet":"#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\n// 0\n// 1 2\n// 3 4 5\n// 6 7 8 9\n// 10 11 12 13 14\n\n// nei[i] := ( マス i と隣接するマス )\nconst int nei[15][4]={\n\t{ 1, 2,-1,-1},\n\t{ 0, 3, 4,-1},\n\t{ 0, 4, 5,-1},\n\t{ 1, 6, 7,-1},\n\t{ 1, 2, 7, 8},\n\t{ 2, 8, 9,-1},\n\t{ 3,10,11,-1},\n\t{ 3, 4,11,12},\n\t{ 4, 5,12,13},\n\t{ 5,13,14,-1},\n\t{ 6,-1,-1,-1},\n\t{ 6, 7,-1,-1},\n\t{ 7, 8,-1,-1},\n\t{ 8, 9,-1,-1},\n\t{ 9,-1,-1,-1}\n};\n\nint dist[15][15]; // dist[i][j] := ( マス i にある数字をマス j に移動するための最短手数 )\n\nint n,a[15];\n\nint hstar(int now){\n\tint sum=0;\n\trep(i,n) if(a[i]!=0) sum+=dist[a[i]][i];\n\treturn now+sum;\n}\n\nint ub;\nbool dfs(int now,int p,int pre,int end){\n\tif(end==n) return true;\n\n\tif(hstar(now)>ub) return false;\n\n\t// rep(k,4){\n\tfor(int k=3;k>=0;k--){ // 逆順に調べた方が 10 秒くらい速い ( テストケースの特性?? )\n\t\tint q=nei[p][k];\n\t\tif(q==-1 || q>=n || q==pre) continue; // 直前の状態には遷移しない\n\t\tswap(a[p],a[q]);\n\t\tint end2=end-(a[q]==p?1:0)-(a[p]==q?1:0)+(a[p]==p?1:0)+(a[q]==q?1:0);\n\t\tif(dfs(now+1,q,p,end2)) return true;\n\t\tswap(a[p],a[q]);\n\t}\n\treturn false;\n}\n\nint main(){\n\trep(i0,15){\n\t\trep(i,15) dist[i0][i]=77;\n\t\tdist[i0][i0]=0;\n\t\tint Q[32],head=0,tail=0; Q[tail++]=i0;\n\t\twhile(head<tail){\n\t\t\tint i=Q[head++];\n\t\t\trep(k,4){\n\t\t\t\tint j=nei[i][k];\n\t\t\t\tif(j!=-1 && dist[i0][j]==77) dist[i0][j]=dist[i0][i]+1, Q[tail++]=j;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int cas=1;scanf(\"%d\",&n),n;cas++){\n\t\tn=n*(n+1)/2;\n\t\trep(i,n) scanf(\"%d\",a+i), a[i]--;\n\n\t\tint end=0; // 揃っている数字の個数\n\t\trep(i,n) if(a[i]==i) end++;\n\n\t\tint p=find(a,a+15,0)-a;\n\t\tint h=(1<=p&&p<=2||6<=p&&p<=9?1:0); // 1 のある行 mod 2\n\t\tfor(ub=h;ub<45;ub+=2) if(dfs(0,p,-1,end)) break;\n\t\tprintf(\"Case %d: %d\\n\",cas,ub);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":5980,"memory_kb":1028,"score_of_the_acc":-0.734,"final_rank":5},{"submission_id":"aoj_2391_525729","code_snippet":"#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\n// 0\n// 1 2\n// 3 4 5\n// 6 7 8 9\n// 10 11 12 13 14\n\n// nei[i] := ( テ」ツδ榲」ツつケ i テ」ツ?ィテゥツ堋」テヲツ篠・テ」ツ?凖」ツつ凝」ツδ榲」ツつケ )\nconst int nei[15][4]={\n\t{ 1, 2,-1,-1},\n\t{ 0, 3, 4,-1},\n\t{ 0, 4, 5,-1},\n\t{ 1, 6, 7,-1},\n\t{ 1, 2, 7, 8},\n\t{ 2, 8, 9,-1},\n\t{ 3,10,11,-1},\n\t{ 3, 4,11,12},\n\t{ 4, 5,12,13},\n\t{ 5,13,14,-1},\n\t{ 6,-1,-1,-1},\n\t{ 6, 7,-1,-1},\n\t{ 7, 8,-1,-1},\n\t{ 8, 9,-1,-1},\n\t{ 9,-1,-1,-1}\n};\n\nint dist[15][15]; // dist[i][j] := ( テ」ツδ榲」ツつケ i テ」ツ?ォテ」ツ?づ」ツつ凝ヲツ閉ーテ・ツュツ療」ツつ津」ツδ榲」ツつケ j テ」ツ?ォテァツァツサテ・ツ仰陛」ツ?凖」ツつ凝」ツ?淌」ツつ?」ツ?ョテヲツ慊?ァツ淞ュテヲツ可凝ヲツ閉ー )\n\nint n,a[15];\n\nint hstar(int now){\n\tint sum=0;\n\trep(i,n) if(a[i]!=0) sum+=dist[a[i]][i];\n\treturn now+sum;\n}\n\nint ub;\nbool dfs(int now,int p,int pre,int end){\n\tif(end==n) return true;\n\n\tif(hstar(now)>ub) return false;\n\n\t// rep(k,4){\n\tfor(int k=3;k>=0;k--){ // テゥツ??ゥツ??」ツ?ォティツェツソテ」ツ?ケテ」ツ?淌ヲツ鳴ケテ」ツ??10 テァツァツ津」ツ?湘」ツつ嘉」ツ??ゥツ?淌」ツ??( テ」ツδ?」ツつケテ」ツδ暗」ツつアテ」ツδシテ」ツつケテ」ツ?ョテァツ可ケテヲツ?ァ?? )\n\t\tint q=nei[p][k];\n\t\tif(q==-1 || q>=n || q==pre) continue; // テァツ崢エテ・ツ可催」ツ?ョテァツ環カテヲツ?凝」ツ?ォテ」ツ?ッテゥツ?キテァツァツサテ」ツ?療」ツ?ェテ」ツ??\n\t\tswap(a[p],a[q]);\n\t\tint end2=end-(a[q]==p?1:0)-(a[p]==q?1:0)+(a[p]==p?1:0)+(a[q]==q?1:0);\n\t\tif(dfs(now+1,q,p,end2)) return true;\n\t\tswap(a[p],a[q]);\n\t}\n\treturn false;\n}\n\nint main(){\n\trep(i0,15){\n\t\trep(i,15) dist[i0][i]=77;\n\t\tdist[i0][i0]=0;\n\t\tint Q[32],head=0,tail=0; Q[tail++]=i0;\n\t\twhile(head<tail){\n\t\t\tint i=Q[head++];\n\t\t\trep(k,4){\n\t\t\t\tint j=nei[i][k];\n\t\t\t\tif(j!=-1 && dist[i0][j]==77) dist[i0][j]=dist[i0][i]+1, Q[tail++]=j;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int cas=1;scanf(\"%d\",&n),n;cas++){\n\t\tn=n*(n+1)/2;\n\t\trep(i,n) scanf(\"%d\",a+i), a[i]--;\n\n\t\tint end=0; // テヲツ渉ε」ツ?」テ」ツ?ヲテ」ツ??」ツつ凝ヲツ閉ーテ・ツュツ療」ツ?ョテ・ツ?凝ヲツ閉ー\n\t\trep(i,n) if(a[i]==i) end++;\n\n\t\tint p=find(a,a+15,0)-a;\n\t\tint h=(1<=p&&p<=2||6<=p&&p<=9?1:0); // 1 テ」ツ?ョテ」ツ?づ」ツつ凝ィツ。ツ?mod 2\n\t\tfor(ub=h;ub<45;ub+=2) if(dfs(0,p,-1,end)) break;\n\t\tprintf(\"Case %d: %d\\n\",cas,ub);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":5900,"memory_kb":1028,"score_of_the_acc":-0.6912,"final_rank":4},{"submission_id":"aoj_2391_428556","code_snippet":"#include<iostream>\n#include<queue>\n#include<numeric>\n#include<cstdio>\n#include<queue>\n#include<cassert>\n#include<vector>\n#include<set>\n#include<map>\nusing namespace std;\n#define REP(i,b,n) for(int i=b;i<n;i++)\n#define rep(i,n) REP(i,0,n)\nconst int inf = 100;\nconst int N = 5;\nconst int dy[]={1,1,-1,-1};\nconst int dx[]={0,1,0, -1};\n\nconst int wdy[2] = {-1,1};\nint edge[66605][N][N];\nint wdcost[N+1][66605];\nclass st{\npublic:\n int mat[N][N];\n st(){\n rep(i,N)rep(j,N)mat[i][j] = 0;\n rep(i,N)mat[i][i] = N-i;\n mat[0][0] = N-1;\n }\n bool operator<(const st & a)const{\n rep(i,N)rep(j,N)if (mat[i][j] != a.mat[i][j])return mat[i][j] < a.mat[i][j];\n return false;\n }\n};\n\nint getst(st &now,map<st,int> & M){\n int index = M.size();\n if (M.count(now) == 0)M[now] = index;\n return M[now];\n}\n\nmap<st,int> NUM;\nvoid makeall(){\n map<st,int> M;\n queue<st> Q;\n st ini;\n Q.push(ini);\n M.insert(make_pair(ini,0));\n while(!Q.empty()){\n st now = Q.front();Q.pop();\n int nownum = getst(now,NUM);\n int tc = M[now];\n wdcost[N][nownum] = tc;\n rep(i,N){\n if (accumulate(now.mat[i],now.mat[i+1],0) == N-i)continue;\n rep(j,N){\n\trep(k,2){\n\t int ney = i+wdy[k];\n\t if (ney == -1 || ney == N)continue;\n\t if (now.mat[ney][j] == 0)continue;\n\t st next = now;\n\t next.mat[i][j]++;\n\t next.mat[ney][j]--;\n\t int nextnum = getst(next,NUM);\n\t edge[nownum][ney][j] = nextnum;\n\t if (M.count(next) == 0){\n\t M.insert(make_pair(next,tc+1));\n\t Q.push(next);\n\t }\n\t}\n }\n }\n }\n}\n\nint row[15];\nint col[15];\nvoid precalcWD(){\n const int ori[N][N]={\n 1,3,6,10,15,\n 2,5,9,14,0,\n 4,8,13,0,0,\n 7,12,0,0,0,\n 11,0,0,0,0,\n };\n rep(i,N){\n rep(j,N){\n if (ori[i][j] == 1 || ori[i][j] == 0)continue;\n row[ori[i][j]] = i;\n col[ori[i][j]] = j;\n }\n }\n}\n\npair<int,int> getWD(int n,int cpy[N][N]){\n if (n != 5)return make_pair(0,0);\n st r,c;\n int inp[N][N]={0};\n rep(j,N){\n int p = 0;\n rep(i,N){\n if (cpy[i][j] == 0)continue;\n inp[p++][j] = cpy[i][j];\n }\n }\n int matr[N][N]={},matc[N][N]={};\n rep(i,N){\n rep(j,N){\n if (inp[i][j] == 0 || inp[i][j] == 1)continue;\n matr[i][row[inp[i][j]]]++;\n matc[j][col[inp[i][j]]]++;\n }\n }\n\n\n //int wdr,wdc;\n rep(i,N)rep(j,N)r.mat[i][j] = matr[i][j];\n rep(i,N)rep(j,N)c.mat[i][j] = matc[i][j];\n return make_pair(NUM[r],NUM[c]);\n}\n\nvoid initWD(){\n rep(i,66605)rep(j,N)rep(k,N)edge[i][j][k] = -1;\n makeall();\n precalcWD();\n}\n\n//-------------------------------------------------------------------------------------\nint mcost[N*N][N][N];\nvoid precalc(int n){\n int pos[n][n];\n int p=0;\n rep(i,n){\n rep(j,i+1){\n rep(k,n)rep(l,k+1)mcost[p][k][l] = inf;\n mcost[p][i][j] = 0;\n pos[i][j] = p;\n p++;\n }\n }\n while(true){\n bool isupdate=false;\n rep(ii,n){\n rep(jj,ii+1){\n\tint now = pos[ii][jj];\n\trep(i,n){\n\trep(j,i+1){\n\t rep(k,4){\n\t int ney = i+dy[k],nex = j+dx[k];\n\t if (ney == -1 || nex == -1 || ney == n || ney < nex)continue;\n\t if (ney == i && nex == i+1)continue;\n\t if (mcost[now][ney][nex] > mcost[now][i][j]+1){\n\t isupdate = true;\n\t mcost[now][ney][nex] = mcost[now][i][j]+1;\n\t }\n\t if (mcost[now][i][j] > mcost[now][ney][nex] + 1){\n\t isupdate = true;\n\t mcost[now][i][j] = mcost[now][ney][nex]+1;\n\t }\n\t }\n\t}\n\t}\n }\n }\n if (!isupdate)break;\n }\n}\n//-------------------------------------------------------------------------------------\n\nint in[N][N];\nint geth(int n){\n rep(i,n)rep(j,i+1)mcost[0][i][j] = 0;\n\n int ret = 0;\n rep(i,n){\n rep(j,i+1){\n ret += mcost[in[i][j]-1][i][j];\n }\n }\n return ret;\n}\n\nint ans;\nbool solve(int n,int cnt,int lim,int py,int px,int prev,int h,int wdr,int wdc,int y,int x){\n if (h == 0){\n ans = min(ans,cnt);\n return true;\n }\n if (cnt + h > lim){\n return false;\n }\n if (n == 5 && cnt + wdcost[5][wdr] + wdcost[5][wdc] > lim){\n return false;\n }\n rep(k,4){\n int ney = y+dy[k],nex = x+dx[k];\n if (ney == -1 || nex == -1 || ney == n || ney < nex)continue;\n if (in[ney][nex] == prev)continue;\n\n int nexth = h + (mcost[in[ney][nex]-1][y][x]-mcost[in[ney][nex]-1][ney][nex]);\n int nextwdr=wdr,nextwdc=wdc;\n if (n == 5){\n if (k == 0 || k == 2){//wdr -> nextwdr\n\tassert(nex == x);\n\tint base = x;\n\tnextwdr = edge[wdr][ney-base][row[in[ney][nex]]];\n }else {//wdc -> nextwdc\n\tnextwdc = edge[wdc][nex][col[in[ney][nex]]];\n }\n }\n swap(in[y][x],in[ney][nex]);\n bool ret;\n ret = solve(n,cnt+1,lim,-1,-1,in[y][x],nexth,nextwdr,nextwdc,ney,nex);\n swap(in[y][x],in[ney][nex]);\n if (ret)return true;\n }\n return false;\n}\n\nint main(){\n initWD();\n int n;\n int tc = 1;\n while(cin>>n && n){\n ans = inf;\n rep(i,n){\n rep(j,i+1){\n\tcin>>in[i][j];\n }\n }\n precalc(n);\n int sy,sx;\n rep(i,n)rep(j,i+1)if (in[i][j] == 1)sy = i,sx=j;\n int mod = mcost[0][sy][sx];\n int h = geth(n);\n int beg = 0;\n \n pair<int,int> wd = getWD(n,in);\n int wdr=wd.first,wdc=wd.second;\n\n if (mod%2 != 0)beg++;\n for(int i=beg;;i+=2){\n ans = inf;\n bool ret = solve(n,0,i,-1,-1,-1,h,wdr,wdc,sy,sx);\n if (ret){break;}\n }\n cout <<\"Case \" << tc++ << \": \" << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":5230,"memory_kb":25000,"score_of_the_acc":-0.7392,"final_rank":6},{"submission_id":"aoj_2391_384989","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nconst int HALF = 22;\nconst ll BASE = 1e+9 + 7;\nint n;\nint N;\nint posX[15];\nint posY[15];\nint dist[15][15];\nconst int dx[4] = { -1, 0, 0, 1 };\nconst int dy[4] = { -1, -1, 1, 1 };\n\ninline int Encode(int x, int y) {\n assert(x <= y);\n return y * (y + 1) / 2 + x;\n}\ninline void Decode(int code, int &x, int &y) {\n assert(0 <= code && code < 15);\n x = posX[code];\n y = posY[code];\n}\n\nstruct State {\n char cost;\n char a;\n char cards[15];\n int Get(int x, int y) {\n return cards[Encode(x, y)];\n }\n void Set(int x, int y, int v) {\n cards[Encode(x, y)] = v;\n }\n void Swap(int x1, int y1, int x2, int y2) {\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\n }\n void Holl(int &rx, int &ry) {\n REP(i, N) {\n if (cards[i] == 1) {\n rx = posX[i];\n ry = posY[i];\n return;\n }\n }\n assert(false);\n }\n int HollX() {\n int x, y;\n Holl(x, y);\n return x;\n }\n int HollY() {\n int x, y;\n Holl(x, y);\n return y;\n }\n void CalcA() {\n int rev[16];\n REP(i, N) {\n rev[(int)cards[i] - 1] = i;\n }\n\n a = 0;\n FOR(i, 1, N) {\n a += dist[rev[i]][i];\n }\n FOR(i, 3, N) {\n if (cards[i] == i + 1) { continue; }\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\n }\n a += 6;\nnext:;\n }\n if (a != 0 && n == 5) {\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n }\n }\n ull Hash() {\n ll ret = 0;\n REP(i, N) {\n ret = ret * BASE + cards[i];\n }\n return ret;\n }\n bool operator<(const State &rhs) const {\n return cost + a > rhs.cost + rhs.a;\n }\n};\n\nmap<ull, char> half[6];\nvoid CalcHalfSide(int m) {\n n = m;\n N = n * (n + 1) / 2;\n State ini;\n ini.cost = 0;\n REP(i, N) { ini.cards[i] = i + 1; }\n queue<State> que;\n que.push(ini);\n half[m][ini.Hash()] = 0;\n\n while (!que.empty()) {\n State s = que.front();\n que.pop();\n if (s.cost == HALF) { continue; }\n\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ull h = ns.Hash();\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\n half[m][h] = ns.cost;\n que.push(ns);\n }\n }\n}\n\nint main() {\n REP(y, 5) {\n REP(x, y + 1) {\n posX[Encode(x, y)] = x;\n posY[Encode(x, y)] = y;\n }\n }\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\n int test_case = 0;\n while (scanf(\"%d\", &n), n) {\n test_case++;\n N = n * (n + 1) / 2;\n\n // calc dist\n MEMSET(dist, 0x0f);\n REP(i, N) { dist[i][i] = 0; }\n REP(i, N) {\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n dist[i][Encode(nx, ny)] = 1;\n }\n }\n REP(k, N) REP(i, N) REP(j, N) {\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n\n // Get Input\n State ini;\n ini.cost = 0;\n REP(y, n) {\n REP(x, y + 1) {\n int v;\n scanf(\"%d\", &v);\n ini.Set(x, y, v);\n }\n }\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\n ini.Swap(0, n - 1, 0, n - 2);\n ini.cost++;\n }\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\n ini.cost++;\n }\n if (half[n].count(ini.Hash())) {\n printf(\"Case %d: %d\\n\", test_case, ini.cost + half[n][ini.Hash()]);\n continue;\n }\n ini.CalcA();\n int x, y;\n ini.Holl(x, y);\n\n // A*\n map<ull, int> dists;\n priority_queue<State> que;\n que.push(ini);\n dists[ini.Hash()] = 0;\n int ans = 45;\n while (!que.empty()) {\n State s = que.top();\n que.pop();\n if (s.a == 0) {\n ans = s.cost;\n break;\n }\n if (half[n].count(s.Hash())) {\n ans = min(ans, s.cost + half[n][s.Hash()]);\n //cout << \"OK:\" << \" \" << ans << endl;\n continue;\n }\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ns.CalcA();\n if (ns.cost > ans - HALF) { continue; }\n if (ns.cost + ns.a > ans) { continue; }\n ull h = ns.Hash();\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\n dists[h] = ns.cost;\n que.push(ns);\n }\n }\n printf(\"Case %d: %d\\n\", test_case, ans);\n }\n}","accuracy":1,"time_ms":5540,"memory_kb":59000,"score_of_the_acc":-1.4813,"final_rank":8},{"submission_id":"aoj_2391_384978","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nconst int HALF = 21;\nconst ll BASE = 1e+9 + 7;\nint n;\nint N;\nint posX[15];\nint posY[15];\nint dist[15][15];\nconst int dx[4] = { -1, 0, 0, 1 };\nconst int dy[4] = { -1, -1, 1, 1 };\n\ninline int Encode(int x, int y) {\n assert(x <= y);\n return y * (y + 1) / 2 + x;\n}\ninline void Decode(int code, int &x, int &y) {\n assert(0 <= code && code < 15);\n x = posX[code];\n y = posY[code];\n}\n\nstruct State {\n char cost;\n char a;\n char cards[15];\n int Get(int x, int y) {\n return cards[Encode(x, y)];\n }\n void Set(int x, int y, int v) {\n cards[Encode(x, y)] = v;\n }\n void Swap(int x1, int y1, int x2, int y2) {\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\n }\n void Holl(int &rx, int &ry) {\n REP(i, N) {\n if (cards[i] == 1) {\n rx = posX[i];\n ry = posY[i];\n return;\n }\n }\n assert(false);\n }\n int HollX() {\n int x, y;\n Holl(x, y);\n return x;\n }\n int HollY() {\n int x, y;\n Holl(x, y);\n return y;\n }\n void CalcA() {\n int rev[16];\n REP(i, N) {\n rev[(int)cards[i] - 1] = i;\n }\n\n a = 0;\n FOR(i, 1, N) {\n a += dist[rev[i]][i];\n }\n FOR(i, 3, N) {\n if (cards[i] == i + 1) { continue; }\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\n }\n a += 6;\nnext:;\n }\n if (a != 0 && n == 5) {\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n }\n }\n ull Hash() {\n ll ret = 0;\n REP(i, N) {\n ret = ret * BASE + cards[i];\n }\n return ret;\n }\n bool operator<(const State &rhs) const {\n return cost + a > rhs.cost + rhs.a;\n }\n};\n\nmap<ull, char> half[6];\nvoid CalcHalfSide(int m) {\n n = m;\n N = n * (n + 1) / 2;\n State ini;\n ini.cost = 0;\n REP(i, N) { ini.cards[i] = i + 1; }\n queue<State> que;\n que.push(ini);\n half[m][ini.Hash()] = 0;\n\n while (!que.empty()) {\n State s = que.front();\n que.pop();\n if (s.cost == HALF) { continue; }\n\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ull h = ns.Hash();\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\n half[m][h] = ns.cost;\n que.push(ns);\n }\n }\n}\n\nint main() {\n REP(y, 5) {\n REP(x, y + 1) {\n posX[Encode(x, y)] = x;\n posY[Encode(x, y)] = y;\n }\n }\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\n int test_case = 0;\n while (scanf(\"%d\", &n), n) {\n test_case++;\n N = n * (n + 1) / 2;\n\n // calc dist\n MEMSET(dist, 0x0f);\n REP(i, N) { dist[i][i] = 0; }\n REP(i, N) {\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n dist[i][Encode(nx, ny)] = 1;\n }\n }\n REP(k, N) REP(i, N) REP(j, N) {\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n\n // Get Input\n State ini;\n ini.cost = 0;\n REP(y, n) {\n REP(x, y + 1) {\n int v;\n scanf(\"%d\", &v);\n ini.Set(x, y, v);\n }\n }\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\n ini.Swap(0, n - 1, 0, n - 2);\n ini.cost++;\n }\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\n ini.cost++;\n }\n ini.CalcA();\n int x, y;\n ini.Holl(x, y);\n\n // A*\n map<ull, int> dists;\n priority_queue<State> que;\n que.push(ini);\n dists[ini.Hash()] = 0;\n int ans = 45;\n while (!que.empty()) {\n State s = que.top();\n que.pop();\n if (s.a == 0) {\n ans = s.cost;\n break;\n }\n if (half[n].count(s.Hash())) {\n ans = min(ans, s.cost + half[n][s.Hash()]);\n //cout << \"OK:\" << \" \" << ans << endl;\n continue;\n }\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ns.CalcA();\n if (ns.cost > ans - HALF) { continue; }\n if (ns.cost + ns.a > ans) { continue; }\n ull h = ns.Hash();\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\n dists[h] = ns.cost;\n que.push(ns);\n }\n }\n printf(\"Case %d: %d\\n\", test_case, ans);\n }\n}","accuracy":1,"time_ms":5990,"memory_kb":50000,"score_of_the_acc":-1.5694,"final_rank":10},{"submission_id":"aoj_2391_384972","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nconst int HALF = 22;\nconst ll BASE = 1e+9 + 7;\nint n;\nint N;\nint posX[15];\nint posY[15];\nint dist[15][15];\nconst int dx[4] = { -1, 0, 0, 1 };\nconst int dy[4] = { -1, -1, 1, 1 };\n\ninline int Encode(int x, int y) {\n assert(x <= y);\n return y * (y + 1) / 2 + x;\n}\ninline void Decode(int code, int &x, int &y) {\n assert(0 <= code && code < 15);\n x = posX[code];\n y = posY[code];\n}\n\nstruct State {\n char cost;\n char a;\n char cards[15];\n int Get(int x, int y) {\n return cards[Encode(x, y)];\n }\n void Set(int x, int y, int v) {\n cards[Encode(x, y)] = v;\n }\n void Swap(int x1, int y1, int x2, int y2) {\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\n }\n void Holl(int &rx, int &ry) {\n REP(i, N) {\n if (cards[i] == 1) {\n rx = posX[i];\n ry = posY[i];\n return;\n }\n }\n assert(false);\n }\n int HollX() {\n int x, y;\n Holl(x, y);\n return x;\n }\n int HollY() {\n int x, y;\n Holl(x, y);\n return y;\n }\n void CalcA() {\n int rev[16];\n REP(i, N) {\n rev[(int)cards[i] - 1] = i;\n }\n\n a = 0;\n FOR(i, 1, N) {\n a += dist[rev[i]][i];\n }\n FOR(i, 3, N) {\n if (cards[i] == i + 1) { continue; }\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\n }\n a += 6;\nnext:;\n }\n if (a != 0 && n == 5) {\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n }\n }\n ull Hash() {\n ll ret = 0;\n REP(i, N) {\n ret = ret * BASE + cards[i];\n }\n return ret;\n }\n bool operator<(const State &rhs) const {\n return cost + a > rhs.cost + rhs.a;\n }\n};\n\nmap<ull, char> half[6];\nvoid CalcHalfSide(int m) {\n n = m;\n N = n * (n + 1) / 2;\n State ini;\n ini.cost = 0;\n REP(i, N) { ini.cards[i] = i + 1; }\n queue<State> que;\n que.push(ini);\n half[m][ini.Hash()] = 0;\n\n while (!que.empty()) {\n State s = que.front();\n que.pop();\n if (s.cost == HALF) { continue; }\n\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ull h = ns.Hash();\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\n half[m][h] = ns.cost;\n que.push(ns);\n }\n }\n}\n\nint main() {\n REP(y, 5) {\n REP(x, y + 1) {\n posX[Encode(x, y)] = x;\n posY[Encode(x, y)] = y;\n }\n }\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\n int test_case = 0;\n while (scanf(\"%d\", &n), n) {\n test_case++;\n N = n * (n + 1) / 2;\n\n // calc dist\n MEMSET(dist, 0x0f);\n REP(i, N) { dist[i][i] = 0; }\n REP(i, N) {\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n dist[i][Encode(nx, ny)] = 1;\n }\n }\n REP(k, N) REP(i, N) REP(j, N) {\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n\n // Get Input\n State ini;\n ini.cost = 0;\n REP(y, n) {\n REP(x, y + 1) {\n int v;\n scanf(\"%d\", &v);\n ini.Set(x, y, v);\n }\n }\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\n ini.Swap(0, n - 1, 0, n - 2);\n ini.cost++;\n }\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\n ini.cost++;\n }\n ini.CalcA();\n int x, y;\n ini.Holl(x, y);\n\n // A*\n map<ull, int> dists;\n priority_queue<State> que;\n que.push(ini);\n dists[ini.Hash()] = 0;\n int ans = 45;\n while (!que.empty()) {\n State s = que.top();\n que.pop();\n if (s.a == 0) {\n ans = s.cost;\n break;\n }\n if (half[n].count(s.Hash())) {\n ans = min(ans, s.cost + half[n][s.Hash()]);\n //cout << \"OK:\" << \" \" << ans << endl;\n continue;\n }\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ns.CalcA();\n if (ns.cost > ans - HALF) { continue; }\n if (ns.cost + ns.a > ans) { continue; }\n ull h = ns.Hash();\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\n dists[h] = ns.cost;\n que.push(ns);\n }\n }\n printf(\"Case %d: %d\\n\", test_case, ans);\n }\n}","accuracy":1,"time_ms":5610,"memory_kb":59000,"score_of_the_acc":-1.5187,"final_rank":9},{"submission_id":"aoj_2391_384969","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nconst int HALF = 22;\nconst ll BASE = 1e+9 + 7;\nint n;\nint N;\nint posX[15];\nint posY[15];\nint dist[15][15];\nconst int dx[4] = { -1, 0, 0, 1 };\nconst int dy[4] = { -1, -1, 1, 1 };\n\ninline int Encode(int x, int y) {\n assert(x <= y);\n return y * (y + 1) / 2 + x;\n}\ninline void Decode(int code, int &x, int &y) {\n assert(0 <= code && code < 15);\n x = posX[code];\n y = posY[code];\n}\n\nstruct State {\n char cost;\n char a;\n char cards[15];\n int Get(int x, int y) {\n return cards[Encode(x, y)];\n }\n void Set(int x, int y, int v) {\n cards[Encode(x, y)] = v;\n }\n void Swap(int x1, int y1, int x2, int y2) {\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\n }\n void Holl(int &rx, int &ry) {\n REP(i, N) {\n if (cards[i] == 1) {\n rx = posX[i];\n ry = posY[i];\n return;\n }\n }\n assert(false);\n }\n int HollX() {\n int x, y;\n Holl(x, y);\n return x;\n }\n int HollY() {\n int x, y;\n Holl(x, y);\n return y;\n }\n void CalcA() {\n int rev[16];\n REP(i, N) {\n rev[(int)cards[i] - 1] = i;\n }\n\n a = 0;\n FOR(i, 1, N) {\n a += dist[rev[i]][i];\n }\n FOR(i, 3, N) {\n if (cards[i] == i + 1) { continue; }\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\n }\n a += 6;\nnext:;\n }\n if (a != 0 && n == 5) {\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\n a += 6;\n }\n }\n }\n ull Hash() {\n ll ret = 0;\n REP(i, N) {\n ret = ret * BASE + cards[i];\n }\n return ret;\n }\n bool operator<(const State &rhs) const {\n return cost + a > rhs.cost + rhs.a;\n }\n};\n\nmap<ull, char> half[6];\nvoid CalcHalfSide(int m) {\n n = m;\n N = n * (n + 1) / 2;\n State ini;\n ini.cost = 0;\n REP(i, N) { ini.cards[i] = i + 1; }\n queue<State> que;\n que.push(ini);\n half[m][ini.Hash()] = 0;\n\n while (!que.empty()) {\n State s = que.front();\n que.pop();\n if (s.cost == HALF) { continue; }\n\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ull h = ns.Hash();\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\n half[m][h] = ns.cost;\n que.push(ns);\n }\n }\n}\n\nint main() {\n REP(y, 5) {\n REP(x, y + 1) {\n posX[Encode(x, y)] = x;\n posY[Encode(x, y)] = y;\n }\n }\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\n int test_case = 0;\n while (scanf(\"%d\", &n), n) {\n test_case++;\n N = n * (n + 1) / 2;\n\n // calc dist\n MEMSET(dist, 0x0f);\n REP(i, N) { dist[i][i] = 0; }\n REP(i, N) {\n int fx = posX[i];\n int fy = posY[i];\n REP(dir, 4) {\n int nx = fx + dx[dir];\n int ny = fy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n dist[i][Encode(nx, ny)] = 1;\n }\n }\n REP(k, N) REP(i, N) REP(j, N) {\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n\n // Get Input\n State ini;\n ini.cost = 0;\n REP(y, n) {\n REP(x, y + 1) {\n int v;\n scanf(\"%d\", &v);\n ini.Set(x, y, v);\n }\n }\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\n ini.Swap(0, n - 1, 0, n - 2);\n ini.cost++;\n }\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\n ini.cost++;\n }\n ini.CalcA();\n int x, y;\n ini.Holl(x, y);\n\n // A*\n map<ull, int> dists;\n priority_queue<State> que;\n que.push(ini);\n dists[ini.Hash()] = 0;\n int ans = 45;\n while (!que.empty()) {\n State s = que.top();\n que.pop();\n if (s.a == 0) {\n ans = s.cost;\n break;\n }\n if (half[n].count(s.Hash())) {\n ans = min(ans, s.cost + half[n][s.Hash()]);\n //cout << \"OK:\" << \" \" << ans << endl;\n }\n int hx, hy;\n s.Holl(hx, hy);\n REP(dir, 4) {\n int nx = hx + dx[dir];\n int ny = hy + dy[dir];\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\n State ns = s;\n ns.Swap(hx, hy, nx, ny);\n ns.cost++;\n ns.CalcA();\n if (ns.cost > ans - HALF) { continue; }\n if (ns.cost + ns.a > ans) { continue; }\n ull h = ns.Hash();\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\n dists[h] = ns.cost;\n que.push(ns);\n }\n }\n printf(\"Case %d: %d\\n\", test_case, ans);\n }\n}","accuracy":1,"time_ms":5510,"memory_kb":0,"score_of_the_acc":-0.4652,"final_rank":3},{"submission_id":"aoj_2391_379913","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<queue>\nusing namespace std;\n\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\n#define dbg(x) cerr << #x << \" = \" << (x) << endl;\ntypedef long long ll;\ntypedef vector<int> vi;\n\nvoid solve_small(vi);\n\nconst int dy[] = {-1, -1, 1, 1}, dx[] = {-1, 0, 0, 1};\nmap<ll, int> M;\nint n, num[5][5];\n\ninline ll hash(const vi &v){\n\tll res = 0;\n\trep(i,v.size()) res *= 17, res += v[i];\n\treturn res;\n}\ninline void push(const vi &v, int c, queue<pair<int,vi> > &q){\n\tll h = hash(v);\n\tif(M.count(h))return;\n\tM[h] = c;\n\tif(c <= 22) q.push(make_pair(c+1, v));\n}\n\nint main(){\n\t\n\tqueue<pair<int,vi> > q;\n\tvi goal;\n\tint k = 0;\n\trep(i,5) rep(j,i+1){\n\t\tnum[i][j] = k;\n\t\tgoal.push_back(++k);\n\t}\n\tpush(goal, 0, q);\n\t\n\twhile(!q.empty()){\n\t\tvi v = q.front().second;\n\t\tint c = q.front().first; q.pop();\n\t\t\n\t\tint idx = -1, y, x;\n\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\tif(v[++idx] == 1) goto OUT;\n\t\tOUT:;\n\t\trep(d,4){\n\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\tpush(v, c, q);\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t}\n\t}\n\tint cs = 0;\n\t\n\twhile(cin >> n, n){\n\t\t\n\t\tcout << \"Case \" << ++cs << \": \";\n\t\t\n\t\tvi v(n*(n+1)/2);\n\t\tk = 0;\n\t\trep(i,n) rep(j,i+1) cin >> v[k++];\n\t\tif(n <= 4){\n\t\t\tsolve_small(v);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tll h = hash(v);\n\t\tif(M.count(h)){\n\t\t\tcout << M[h] << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tqueue<pair<int,vi> > q;\n\t\tset<ll> s;\n\t\ts.insert(h);\n\t\tq.push(make_pair(0, v));\n\t\twhile(!q.empty()){\n\t\t\tv = q.front().second;\n\t\t\tint c = q.front().first; q.pop();\n\t\t\t\n\t\t\tint idx = -1, y, x;\n\t\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\t\tif(v[++idx] == 1) goto OUT2;\n\t\t\tOUT2:;\n\t\t\trep(d,4){\n\t\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\t\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\n\t\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\t\tll h = hash(v);\n\t\t\t\tif(M.count(h)){\n\t\t\t\t\tcout << M[h] + c + 1 << endl;\n\t\t\t\t\tgoto END;\n\t\t\t\t}\n\t\t\t\tif(!s.count(h)) q.push(make_pair(c+1, v)), s.insert(h);\n\t\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\t}\n\t\t}\n\t\tEND:;\n\t}\n\treturn 0;\n}\n\nvoid solve_small(vi v){\n\tvi goal = v;\n\tsort(goal.begin(), goal.end());\n\tqueue<pair<int,vi> > q;\n\tset<ll> s;\n\tll ghash = hash(goal);\n\tq.push(make_pair(0, v));\n\t\n\twhile(!q.empty()){\n\t\tv = q.front().second;\n\t\tint c = q.front().first; q.pop();\n\t\tll h = hash(v);\n\t\tif(s.count(h)) continue;\n\t\ts.insert(h);\n\t\tif(h == ghash){\n\t\t\tcout << c <<endl; return;\n\t\t}\n\t\tint idx = -1, y, x;\n\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\tif(v[++idx] == 1) goto OUT3;\n\t\tOUT3:;\n\t\trep(d,4){\n\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\tif(ny < 0 || nx < 0 || ny >= n || nx > ny) continue;\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\tif(!s.count(hash(v))) q.push(make_pair(c+1, v));\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":5310,"memory_kb":0,"score_of_the_acc":-0.3583,"final_rank":2},{"submission_id":"aoj_2391_379900","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<queue>\nusing namespace std;\n\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\n#define dbg(x) cerr << #x << \" = \" << (x) << endl;\ntypedef long long ll;\ntypedef vector<int> vi;\n\nvoid solve_small(vi);\n\nconst int dy[] = {-1, -1, 1, 1}, dx[] = {-1, 0, 0, 1};\nmap<ll, int> M;\nint n, num[5][5];\n\ninline ll hash(const vi &v){\n\tll res = 0;\n\trep(i,v.size()) res *= 17, res += v[i];\n\treturn res;\n}\ninline void push(const vi &v, int c, queue<pair<int,vi> > &q){\n\tll h = hash(v);\n\tif(M.count(h) || c > 22) return;\n\tM[h] = c;\n\tq.push(make_pair(c+1, v));\n}\n\nvoid pv(const vi &v){\n\tint k = 0;\n\trep(i,n) rep(j,i+1) cerr << v[k++] << (j==i?\"\\n\":\" \");\n}\n\nint main(){\n\t\n\tqueue<pair<int,vi> > q;\n\tvi goal;\n\tint k = 0;\n\trep(i,5) rep(j,i+1){\n\t\tnum[i][j] = k;\n\t\tgoal.push_back(++k);\n\t}\n\tpush(goal, 0, q);\n\t\n\twhile(!q.empty()){\n\t\tvi v = q.front().second;\n\t\tint c = q.front().first; q.pop();\n\t\t/*\n\t\tdbg(c);\n\t\tif(c == 2) pv(v);\n\t\t*/\n\t\tint idx = -1, y, x;\n\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\tif(v[++idx] == 1) goto OUT;\n\t\tOUT:;\n\t\trep(d,4){\n\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\tpush(v, c, q);\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t}\n\t}\n\t\n\tint cs = 0;\n\t\n\twhile(cin >> n, n){\n\t\t\n\t\tcout << \"Case \" << ++cs << \": \";\n\t\t\n\t\tvi v(n*(n+1)/2);\n\t\tk = 0;\n\t\trep(i,n) rep(j,i+1) cin >> v[k++];\n\t\tif(n <= 4){\n\t\t\tsolve_small(v);\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tll h = hash(v);\n\t\tif(M.count(h)){\n\t\t\tcout << M[h] << endl;\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tqueue<pair<int,vi> > q;\n\t\tset<ll> s;\n\t\ts.insert(h);\n\t\tq.push(make_pair(0, v));\n\t\twhile(!q.empty()){\n\t\t\tv = q.front().second;\n\t\t\tint c = q.front().first; q.pop();\n\t\t\t\n\t\t\tint idx = -1, y, x;\n\t\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\t\tif(v[++idx] == 1) goto OUT2;\n\t\t\tOUT2:;\n\t\t\trep(d,4){\n\t\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\t\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\n\t\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\t\tll h = hash(v);\n\t\t\t\tif(M.count(h)){\n\t\t\t\t\tcout << M[h] + c + 1 << endl;\n\t\t\t\t\tgoto END;\n\t\t\t\t}\n\t\t\t\tif(!s.count(h)) q.push(make_pair(c+1, v)), s.insert(h);\n\t\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\t}\n\t\t}\n\t\tEND:;\n\t}\n\treturn 0;\n}\n\nvoid solve_small(vi v){\n\tvi goal = v;\n\tsort(goal.begin(), goal.end());\n\tqueue<pair<int,vi> > q;\n\tset<ll> s;\n\tll ghash = hash(goal);\n\tq.push(make_pair(0, v));\n\t\n\t//rep(i,v.size())cerr<<v[i]<<(i==v.size()-1?\"\\n\":\" \");\n\t\n\twhile(!q.empty()){\n\t\tv = q.front().second;\n\t\tint c = q.front().first; q.pop();\n\t\tll h = hash(v);\n\t\tif(s.count(h)) continue;\n\t\ts.insert(h);\n\t\tif(h == ghash){\n\t\t\tcout << c <<endl; return;\n\t\t}\n\t\t/*\n\t\tcerr<<endl;\n\t\tint k = 0;\n\t\trep(i,n) rep(j,i+1) cerr << v[k++] << (j==i?\"\\n\":\" \");\n\t\t*/\n\t\tint idx = -1, y, x;\n\t\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\n\t\t\tif(v[++idx] == 1) goto OUT3;\n\t\tOUT3:;\n\t\trep(d,4){\n\t\t\tint ny = y + dy[d], nx = x + dx[d];\n\t\t\tif(ny < 0 || nx < 0 || ny >= n || nx > ny) continue;\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t\tif(!s.count(hash(v))) q.push(make_pair(c+1, v));\n\t\t\tswap(v[num[ny][nx]], v[idx]);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":6510,"memory_kb":0,"score_of_the_acc":-1,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2391_10851349\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <cstring>\\n#include <cmath>\\n#include <string>\\n#include <stack>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <cstdlib>\\n#define INF 0x3f3f3f3f\\n#define er(i) (1<<i)\\n#define lb lower_bound\\n#define up upper_bound\\n#define eps 1e-8\\n#define mp make_pair\\n#define pii pair<int, int>\\n#define zero(x) (((x)>0?(x):-(x))<eps)\\n#define mem(a,b) memset((a),(b),sizeof((a)))\\n#define lld long long\\n\\nusing namespace std;\\nint dir[20][4];\\nint dis[20][20];\\nint n;\\nint a[20];\\nint b[20];\\nint ans;\\n\\nint cal() {\\n int sum = 0;\\n int i;\\n for(i = 1; i <= n; i++)\\n if (a[i] != 1)\\n sum += dis[i][a[i]];\\n return sum;\\n}\\n\\nint dfs(int dep, int now, int pre) {\\n int i;\\n// cout<<dep<<endl;\\n// for(i = 1; i <= n; i++)\\n// cout<<a[i]<<\\\" \\\";\\n// cout<<endl;\\n// cout<<cal()<<endl;\\n int s = cal();\\n if (s == 0) return 1;\\n if (dep + s > ans) return 0;\\n\\n for(i = 3; i >= 0; i--) {\\n int u = dir[now][i];\\n if (u == 0 || u > n || u == pre) continue;\\n swap(a[now], a[u]);\\n if (dfs(dep + 1, u, now)) return 1;\\n swap(a[now], a[u]);\\n }\\n return 0;\\n}\\n\\nint main() {\\n int cas = 0;\\n int i, j, k;\\n mem(dir,0);\\n dir[1][0] = 2;\\n dir[1][1] = 3;\\n dir[2][0] = 1;\\n dir[2][1] = 4;\\n dir[2][3] = 5;\\n dir[3][0] = 1;\\n dir[3][1] = 5;\\n dir[3][2] = 6;\\n dir[4][0] = 2;\\n dir[4][1] = 7;\\n dir[4][2] = 8;\\n dir[5][0] = 2;\\n dir[5][1] = 3;\\n dir[5][2] = 8;\\n dir[5][3] = 9;\\n dir[6][0] = 3;\\n dir[6][1] = 9;\\n dir[6][2] = 10;\\n dir[7][0] = 4;\\n dir[7][1] = 11;\\n dir[7][2] = 12;\\n dir[8][0] = 4;\\n dir[8][1] = 5;\\n dir[8][2] = 12;\\n dir[8][3] = 13;\\n dir[9][0] = 5;\\n dir[9][1] = 6;\\n dir[9][2] = 13;\\n dir[9][3] = 14;\\n dir[10][0] = 6;\\n dir[10][1] = 14;\\n dir[10][2] = 15;\\n dir[11][0] = 7;\\n dir[12][0] = 7;\\n dir[12][1] = 8;\\n dir[13][0] = 8;\\n dir[13][1] = 9;\\n dir[14][0] = 9;\\n dir[14][1] = 10;\\n dir[15][0] = 10;\\n mem(dis,63);\\n for(i = 1; i <= 15; i++) {\\n dis[i][i] = 0;\\n for(j = 0; j < 4; j++) {\\n if (dir[i][j] == 0) continue;\\n dis[i][dir[i][j]] = 1;\\n }\\n }\\n for(k = 1; k <= 15; k++)\\n for(i = 1; i <= 15; i++)\\n for(j = 1; j <= 15; j++)\\n if (i != j && j != k && i != k)\\n if (dis[i][k] + dis[k][j] < dis[i][j])\\n dis[i][j] = dis[i][k] + dis[k][j];\\n// for(i = 1; i <= 10; i++)\\n// for(j = 1; j <= 10; j++)\\n// cout<<i<<\\\" \\\"<<j<<\\\" \\\"<<dis[i][j]<<endl;\\n while(~scanf(\\\"%d\\\", &n), n) {\\n n = n * (n + 1) / 2;\\n int p = 0;\\n for(i = 1; i <= n; i++)\\n scanf(\\\"%d\\\", &a[i]);\\n for(i = 1; i <= n; i++)\\n if (a[i] == 1) p = i;\\n for(i = 1; i <= n; i++)\\n b[i] = a[i];\\n int st = 0;\\n if (p == 1 || (p >= 4 && p <= 6) || (p >= 11 && p <= 15)) st = 0; else st = 1;\\n for(ans = st; ans <= 45; ans+=2) {\\n// for(i = 1; i <= n; i++)\\n// a[i] = b[i];\\n if (dfs(0, p, -1) != 0) break;\\n }\\n printf(\\\"Case %d: %d\\\\n\\\", ++cas, ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4640,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.0605,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2391_525730\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n// 0\\n// 1 2\\n// 3 4 5\\n// 6 7 8 9\\n// 10 11 12 13 14\\n\\n// nei[i] := ( マス i と隣接するマス )\\nconst int nei[15][4]={\\n\\t{ 1, 2,-1,-1},\\n\\t{ 0, 3, 4,-1},\\n\\t{ 0, 4, 5,-1},\\n\\t{ 1, 6, 7,-1},\\n\\t{ 1, 2, 7, 8},\\n\\t{ 2, 8, 9,-1},\\n\\t{ 3,10,11,-1},\\n\\t{ 3, 4,11,12},\\n\\t{ 4, 5,12,13},\\n\\t{ 5,13,14,-1},\\n\\t{ 6,-1,-1,-1},\\n\\t{ 6, 7,-1,-1},\\n\\t{ 7, 8,-1,-1},\\n\\t{ 8, 9,-1,-1},\\n\\t{ 9,-1,-1,-1}\\n};\\n\\nint dist[15][15]; // dist[i][j] := ( マス i にある数字をマス j に移動するための最短手数 )\\n\\nint n,a[15];\\n\\nint hstar(int now){\\n\\tint sum=0;\\n\\trep(i,n) if(a[i]!=0) sum+=dist[a[i]][i];\\n\\treturn now+sum;\\n}\\n\\nint ub;\\nbool dfs(int now,int p,int pre,int end){\\n\\tif(end==n) return true;\\n\\n\\tif(hstar(now)>ub) return false;\\n\\n\\t// rep(k,4){\\n\\tfor(int k=3;k>=0;k--){ // 逆順に調べた方が 10 秒くらい速い ( テストケースの特性?? )\\n\\t\\tint q=nei[p][k];\\n\\t\\tif(q==-1 || q>=n || q==pre) continue; // 直前の状態には遷移しない\\n\\t\\tswap(a[p],a[q]);\\n\\t\\tint end2=end-(a[q]==p?1:0)-(a[p]==q?1:0)+(a[p]==p?1:0)+(a[q]==q?1:0);\\n\\t\\tif(dfs(now+1,q,p,end2)) return true;\\n\\t\\tswap(a[p],a[q]);\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(){\\n\\trep(i0,15){\\n\\t\\trep(i,15) dist[i0][i]=77;\\n\\t\\tdist[i0][i0]=0;\\n\\t\\tint Q[32],head=0,tail=0; Q[tail++]=i0;\\n\\t\\twhile(head<tail){\\n\\t\\t\\tint i=Q[head++];\\n\\t\\t\\trep(k,4){\\n\\t\\t\\t\\tint j=nei[i][k];\\n\\t\\t\\t\\tif(j!=-1 && dist[i0][j]==77) dist[i0][j]=dist[i0][i]+1, Q[tail++]=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int cas=1;scanf(\\\"%d\\\",&n),n;cas++){\\n\\t\\tn=n*(n+1)/2;\\n\\t\\trep(i,n) scanf(\\\"%d\\\",a+i), a[i]--;\\n\\n\\t\\tint end=0; // 揃っている数字の個数\\n\\t\\trep(i,n) if(a[i]==i) end++;\\n\\n\\t\\tint p=find(a,a+15,0)-a;\\n\\t\\tint h=(1<=p&&p<=2||6<=p&&p<=9?1:0); // 1 のある行 mod 2\\n\\t\\tfor(ub=h;ub<45;ub+=2) if(dfs(0,p,-1,end)) break;\\n\\t\\tprintf(\\\"Case %d: %d\\\\n\\\",cas,ub);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5980,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.734,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2391_525729\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\n// 0\\n// 1 2\\n// 3 4 5\\n// 6 7 8 9\\n// 10 11 12 13 14\\n\\n// nei[i] := ( テ」ツδ榲」ツつケ i テ」ツ?ィテゥツ堋」テヲツ篠・テ」ツ?凖」ツつ凝」ツδ榲」ツつケ )\\nconst int nei[15][4]={\\n\\t{ 1, 2,-1,-1},\\n\\t{ 0, 3, 4,-1},\\n\\t{ 0, 4, 5,-1},\\n\\t{ 1, 6, 7,-1},\\n\\t{ 1, 2, 7, 8},\\n\\t{ 2, 8, 9,-1},\\n\\t{ 3,10,11,-1},\\n\\t{ 3, 4,11,12},\\n\\t{ 4, 5,12,13},\\n\\t{ 5,13,14,-1},\\n\\t{ 6,-1,-1,-1},\\n\\t{ 6, 7,-1,-1},\\n\\t{ 7, 8,-1,-1},\\n\\t{ 8, 9,-1,-1},\\n\\t{ 9,-1,-1,-1}\\n};\\n\\nint dist[15][15]; // dist[i][j] := ( テ」ツδ榲」ツつケ i テ」ツ?ォテ」ツ?づ」ツつ凝ヲツ閉ーテ・ツュツ療」ツつ津」ツδ榲」ツつケ j テ」ツ?ォテァツァツサテ・ツ仰陛」ツ?凖」ツつ凝」ツ?淌」ツつ?」ツ?ョテヲツ慊?ァツ淞ュテヲツ可凝ヲツ閉ー )\\n\\nint n,a[15];\\n\\nint hstar(int now){\\n\\tint sum=0;\\n\\trep(i,n) if(a[i]!=0) sum+=dist[a[i]][i];\\n\\treturn now+sum;\\n}\\n\\nint ub;\\nbool dfs(int now,int p,int pre,int end){\\n\\tif(end==n) return true;\\n\\n\\tif(hstar(now)>ub) return false;\\n\\n\\t// rep(k,4){\\n\\tfor(int k=3;k>=0;k--){ // テゥツ??ゥツ??」ツ?ォティツェツソテ」ツ?ケテ」ツ?淌ヲツ鳴ケテ」ツ??10 テァツァツ津」ツ?湘」ツつ嘉」ツ??ゥツ?淌」ツ??( テ」ツδ?」ツつケテ」ツδ暗」ツつアテ」ツδシテ」ツつケテ」ツ?ョテァツ可ケテヲツ?ァ?? )\\n\\t\\tint q=nei[p][k];\\n\\t\\tif(q==-1 || q>=n || q==pre) continue; // テァツ崢エテ・ツ可催」ツ?ョテァツ環カテヲツ?凝」ツ?ォテ」ツ?ッテゥツ?キテァツァツサテ」ツ?療」ツ?ェテ」ツ??\\n\\t\\tswap(a[p],a[q]);\\n\\t\\tint end2=end-(a[q]==p?1:0)-(a[p]==q?1:0)+(a[p]==p?1:0)+(a[q]==q?1:0);\\n\\t\\tif(dfs(now+1,q,p,end2)) return true;\\n\\t\\tswap(a[p],a[q]);\\n\\t}\\n\\treturn false;\\n}\\n\\nint main(){\\n\\trep(i0,15){\\n\\t\\trep(i,15) dist[i0][i]=77;\\n\\t\\tdist[i0][i0]=0;\\n\\t\\tint Q[32],head=0,tail=0; Q[tail++]=i0;\\n\\t\\twhile(head<tail){\\n\\t\\t\\tint i=Q[head++];\\n\\t\\t\\trep(k,4){\\n\\t\\t\\t\\tint j=nei[i][k];\\n\\t\\t\\t\\tif(j!=-1 && dist[i0][j]==77) dist[i0][j]=dist[i0][i]+1, Q[tail++]=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int cas=1;scanf(\\\"%d\\\",&n),n;cas++){\\n\\t\\tn=n*(n+1)/2;\\n\\t\\trep(i,n) scanf(\\\"%d\\\",a+i), a[i]--;\\n\\n\\t\\tint end=0; // テヲツ渉ε」ツ?」テ」ツ?ヲテ」ツ??」ツつ凝ヲツ閉ーテ・ツュツ療」ツ?ョテ・ツ?凝ヲツ閉ー\\n\\t\\trep(i,n) if(a[i]==i) end++;\\n\\n\\t\\tint p=find(a,a+15,0)-a;\\n\\t\\tint h=(1<=p&&p<=2||6<=p&&p<=9?1:0); // 1 テ」ツ?ョテ」ツ?づ」ツつ凝ィツ。ツ?mod 2\\n\\t\\tfor(ub=h;ub<45;ub+=2) if(dfs(0,p,-1,end)) break;\\n\\t\\tprintf(\\\"Case %d: %d\\\\n\\\",cas,ub);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5900,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.6912,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2391_428556\",\n \"code_snippet\": \"#include<iostream>\\n#include<queue>\\n#include<numeric>\\n#include<cstdio>\\n#include<queue>\\n#include<cassert>\\n#include<vector>\\n#include<set>\\n#include<map>\\nusing namespace std;\\n#define REP(i,b,n) for(int i=b;i<n;i++)\\n#define rep(i,n) REP(i,0,n)\\nconst int inf = 100;\\nconst int N = 5;\\nconst int dy[]={1,1,-1,-1};\\nconst int dx[]={0,1,0, -1};\\n\\nconst int wdy[2] = {-1,1};\\nint edge[66605][N][N];\\nint wdcost[N+1][66605];\\nclass st{\\npublic:\\n int mat[N][N];\\n st(){\\n rep(i,N)rep(j,N)mat[i][j] = 0;\\n rep(i,N)mat[i][i] = N-i;\\n mat[0][0] = N-1;\\n }\\n bool operator<(const st & a)const{\\n rep(i,N)rep(j,N)if (mat[i][j] != a.mat[i][j])return mat[i][j] < a.mat[i][j];\\n return false;\\n }\\n};\\n\\nint getst(st &now,map<st,int> & M){\\n int index = M.size();\\n if (M.count(now) == 0)M[now] = index;\\n return M[now];\\n}\\n\\nmap<st,int> NUM;\\nvoid makeall(){\\n map<st,int> M;\\n queue<st> Q;\\n st ini;\\n Q.push(ini);\\n M.insert(make_pair(ini,0));\\n while(!Q.empty()){\\n st now = Q.front();Q.pop();\\n int nownum = getst(now,NUM);\\n int tc = M[now];\\n wdcost[N][nownum] = tc;\\n rep(i,N){\\n if (accumulate(now.mat[i],now.mat[i+1],0) == N-i)continue;\\n rep(j,N){\\n\\trep(k,2){\\n\\t int ney = i+wdy[k];\\n\\t if (ney == -1 || ney == N)continue;\\n\\t if (now.mat[ney][j] == 0)continue;\\n\\t st next = now;\\n\\t next.mat[i][j]++;\\n\\t next.mat[ney][j]--;\\n\\t int nextnum = getst(next,NUM);\\n\\t edge[nownum][ney][j] = nextnum;\\n\\t if (M.count(next) == 0){\\n\\t M.insert(make_pair(next,tc+1));\\n\\t Q.push(next);\\n\\t }\\n\\t}\\n }\\n }\\n }\\n}\\n\\nint row[15];\\nint col[15];\\nvoid precalcWD(){\\n const int ori[N][N]={\\n 1,3,6,10,15,\\n 2,5,9,14,0,\\n 4,8,13,0,0,\\n 7,12,0,0,0,\\n 11,0,0,0,0,\\n };\\n rep(i,N){\\n rep(j,N){\\n if (ori[i][j] == 1 || ori[i][j] == 0)continue;\\n row[ori[i][j]] = i;\\n col[ori[i][j]] = j;\\n }\\n }\\n}\\n\\npair<int,int> getWD(int n,int cpy[N][N]){\\n if (n != 5)return make_pair(0,0);\\n st r,c;\\n int inp[N][N]={0};\\n rep(j,N){\\n int p = 0;\\n rep(i,N){\\n if (cpy[i][j] == 0)continue;\\n inp[p++][j] = cpy[i][j];\\n }\\n }\\n int matr[N][N]={},matc[N][N]={};\\n rep(i,N){\\n rep(j,N){\\n if (inp[i][j] == 0 || inp[i][j] == 1)continue;\\n matr[i][row[inp[i][j]]]++;\\n matc[j][col[inp[i][j]]]++;\\n }\\n }\\n\\n\\n //int wdr,wdc;\\n rep(i,N)rep(j,N)r.mat[i][j] = matr[i][j];\\n rep(i,N)rep(j,N)c.mat[i][j] = matc[i][j];\\n return make_pair(NUM[r],NUM[c]);\\n}\\n\\nvoid initWD(){\\n rep(i,66605)rep(j,N)rep(k,N)edge[i][j][k] = -1;\\n makeall();\\n precalcWD();\\n}\\n\\n//-------------------------------------------------------------------------------------\\nint mcost[N*N][N][N];\\nvoid precalc(int n){\\n int pos[n][n];\\n int p=0;\\n rep(i,n){\\n rep(j,i+1){\\n rep(k,n)rep(l,k+1)mcost[p][k][l] = inf;\\n mcost[p][i][j] = 0;\\n pos[i][j] = p;\\n p++;\\n }\\n }\\n while(true){\\n bool isupdate=false;\\n rep(ii,n){\\n rep(jj,ii+1){\\n\\tint now = pos[ii][jj];\\n\\trep(i,n){\\n\\trep(j,i+1){\\n\\t rep(k,4){\\n\\t int ney = i+dy[k],nex = j+dx[k];\\n\\t if (ney == -1 || nex == -1 || ney == n || ney < nex)continue;\\n\\t if (ney == i && nex == i+1)continue;\\n\\t if (mcost[now][ney][nex] > mcost[now][i][j]+1){\\n\\t isupdate = true;\\n\\t mcost[now][ney][nex] = mcost[now][i][j]+1;\\n\\t }\\n\\t if (mcost[now][i][j] > mcost[now][ney][nex] + 1){\\n\\t isupdate = true;\\n\\t mcost[now][i][j] = mcost[now][ney][nex]+1;\\n\\t }\\n\\t }\\n\\t}\\n\\t}\\n }\\n }\\n if (!isupdate)break;\\n }\\n}\\n//-------------------------------------------------------------------------------------\\n\\nint in[N][N];\\nint geth(int n){\\n rep(i,n)rep(j,i+1)mcost[0][i][j] = 0;\\n\\n int ret = 0;\\n rep(i,n){\\n rep(j,i+1){\\n ret += mcost[in[i][j]-1][i][j];\\n }\\n }\\n return ret;\\n}\\n\\nint ans;\\nbool solve(int n,int cnt,int lim,int py,int px,int prev,int h,int wdr,int wdc,int y,int x){\\n if (h == 0){\\n ans = min(ans,cnt);\\n return true;\\n }\\n if (cnt + h > lim){\\n return false;\\n }\\n if (n == 5 && cnt + wdcost[5][wdr] + wdcost[5][wdc] > lim){\\n return false;\\n }\\n rep(k,4){\\n int ney = y+dy[k],nex = x+dx[k];\\n if (ney == -1 || nex == -1 || ney == n || ney < nex)continue;\\n if (in[ney][nex] == prev)continue;\\n\\n int nexth = h + (mcost[in[ney][nex]-1][y][x]-mcost[in[ney][nex]-1][ney][nex]);\\n int nextwdr=wdr,nextwdc=wdc;\\n if (n == 5){\\n if (k == 0 || k == 2){//wdr -> nextwdr\\n\\tassert(nex == x);\\n\\tint base = x;\\n\\tnextwdr = edge[wdr][ney-base][row[in[ney][nex]]];\\n }else {//wdc -> nextwdc\\n\\tnextwdc = edge[wdc][nex][col[in[ney][nex]]];\\n }\\n }\\n swap(in[y][x],in[ney][nex]);\\n bool ret;\\n ret = solve(n,cnt+1,lim,-1,-1,in[y][x],nexth,nextwdr,nextwdc,ney,nex);\\n swap(in[y][x],in[ney][nex]);\\n if (ret)return true;\\n }\\n return false;\\n}\\n\\nint main(){\\n initWD();\\n int n;\\n int tc = 1;\\n while(cin>>n && n){\\n ans = inf;\\n rep(i,n){\\n rep(j,i+1){\\n\\tcin>>in[i][j];\\n }\\n }\\n precalc(n);\\n int sy,sx;\\n rep(i,n)rep(j,i+1)if (in[i][j] == 1)sy = i,sx=j;\\n int mod = mcost[0][sy][sx];\\n int h = geth(n);\\n int beg = 0;\\n \\n pair<int,int> wd = getWD(n,in);\\n int wdr=wd.first,wdc=wd.second;\\n\\n if (mod%2 != 0)beg++;\\n for(int i=beg;;i+=2){\\n ans = inf;\\n bool ret = solve(n,0,i,-1,-1,-1,h,wdr,wdc,sy,sx);\\n if (ret){break;}\\n }\\n cout <<\\\"Case \\\" << tc++ << \\\": \\\" << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5230,\n \"memory_kb\": 25000,\n \"score_of_the_acc\": -0.7392,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2391_384989\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nconst int HALF = 22;\\nconst ll BASE = 1e+9 + 7;\\nint n;\\nint N;\\nint posX[15];\\nint posY[15];\\nint dist[15][15];\\nconst int dx[4] = { -1, 0, 0, 1 };\\nconst int dy[4] = { -1, -1, 1, 1 };\\n\\ninline int Encode(int x, int y) {\\n assert(x <= y);\\n return y * (y + 1) / 2 + x;\\n}\\ninline void Decode(int code, int &x, int &y) {\\n assert(0 <= code && code < 15);\\n x = posX[code];\\n y = posY[code];\\n}\\n\\nstruct State {\\n char cost;\\n char a;\\n char cards[15];\\n int Get(int x, int y) {\\n return cards[Encode(x, y)];\\n }\\n void Set(int x, int y, int v) {\\n cards[Encode(x, y)] = v;\\n }\\n void Swap(int x1, int y1, int x2, int y2) {\\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\\n }\\n void Holl(int &rx, int &ry) {\\n REP(i, N) {\\n if (cards[i] == 1) {\\n rx = posX[i];\\n ry = posY[i];\\n return;\\n }\\n }\\n assert(false);\\n }\\n int HollX() {\\n int x, y;\\n Holl(x, y);\\n return x;\\n }\\n int HollY() {\\n int x, y;\\n Holl(x, y);\\n return y;\\n }\\n void CalcA() {\\n int rev[16];\\n REP(i, N) {\\n rev[(int)cards[i] - 1] = i;\\n }\\n\\n a = 0;\\n FOR(i, 1, N) {\\n a += dist[rev[i]][i];\\n }\\n FOR(i, 3, N) {\\n if (cards[i] == i + 1) { continue; }\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\\n }\\n a += 6;\\nnext:;\\n }\\n if (a != 0 && n == 5) {\\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n }\\n }\\n ull Hash() {\\n ll ret = 0;\\n REP(i, N) {\\n ret = ret * BASE + cards[i];\\n }\\n return ret;\\n }\\n bool operator<(const State &rhs) const {\\n return cost + a > rhs.cost + rhs.a;\\n }\\n};\\n\\nmap<ull, char> half[6];\\nvoid CalcHalfSide(int m) {\\n n = m;\\n N = n * (n + 1) / 2;\\n State ini;\\n ini.cost = 0;\\n REP(i, N) { ini.cards[i] = i + 1; }\\n queue<State> que;\\n que.push(ini);\\n half[m][ini.Hash()] = 0;\\n\\n while (!que.empty()) {\\n State s = que.front();\\n que.pop();\\n if (s.cost == HALF) { continue; }\\n\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ull h = ns.Hash();\\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\\n half[m][h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n}\\n\\nint main() {\\n REP(y, 5) {\\n REP(x, y + 1) {\\n posX[Encode(x, y)] = x;\\n posY[Encode(x, y)] = y;\\n }\\n }\\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\\n int test_case = 0;\\n while (scanf(\\\"%d\\\", &n), n) {\\n test_case++;\\n N = n * (n + 1) / 2;\\n\\n // calc dist\\n MEMSET(dist, 0x0f);\\n REP(i, N) { dist[i][i] = 0; }\\n REP(i, N) {\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n dist[i][Encode(nx, ny)] = 1;\\n }\\n }\\n REP(k, N) REP(i, N) REP(j, N) {\\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n\\n // Get Input\\n State ini;\\n ini.cost = 0;\\n REP(y, n) {\\n REP(x, y + 1) {\\n int v;\\n scanf(\\\"%d\\\", &v);\\n ini.Set(x, y, v);\\n }\\n }\\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\\n ini.Swap(0, n - 1, 0, n - 2);\\n ini.cost++;\\n }\\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\\n ini.cost++;\\n }\\n if (half[n].count(ini.Hash())) {\\n printf(\\\"Case %d: %d\\\\n\\\", test_case, ini.cost + half[n][ini.Hash()]);\\n continue;\\n }\\n ini.CalcA();\\n int x, y;\\n ini.Holl(x, y);\\n\\n // A*\\n map<ull, int> dists;\\n priority_queue<State> que;\\n que.push(ini);\\n dists[ini.Hash()] = 0;\\n int ans = 45;\\n while (!que.empty()) {\\n State s = que.top();\\n que.pop();\\n if (s.a == 0) {\\n ans = s.cost;\\n break;\\n }\\n if (half[n].count(s.Hash())) {\\n ans = min(ans, s.cost + half[n][s.Hash()]);\\n //cout << \\\"OK:\\\" << \\\" \\\" << ans << endl;\\n continue;\\n }\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ns.CalcA();\\n if (ns.cost > ans - HALF) { continue; }\\n if (ns.cost + ns.a > ans) { continue; }\\n ull h = ns.Hash();\\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\\n dists[h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n printf(\\\"Case %d: %d\\\\n\\\", test_case, ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5540,\n \"memory_kb\": 59000,\n \"score_of_the_acc\": -1.4813,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2391_384978\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nconst int HALF = 21;\\nconst ll BASE = 1e+9 + 7;\\nint n;\\nint N;\\nint posX[15];\\nint posY[15];\\nint dist[15][15];\\nconst int dx[4] = { -1, 0, 0, 1 };\\nconst int dy[4] = { -1, -1, 1, 1 };\\n\\ninline int Encode(int x, int y) {\\n assert(x <= y);\\n return y * (y + 1) / 2 + x;\\n}\\ninline void Decode(int code, int &x, int &y) {\\n assert(0 <= code && code < 15);\\n x = posX[code];\\n y = posY[code];\\n}\\n\\nstruct State {\\n char cost;\\n char a;\\n char cards[15];\\n int Get(int x, int y) {\\n return cards[Encode(x, y)];\\n }\\n void Set(int x, int y, int v) {\\n cards[Encode(x, y)] = v;\\n }\\n void Swap(int x1, int y1, int x2, int y2) {\\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\\n }\\n void Holl(int &rx, int &ry) {\\n REP(i, N) {\\n if (cards[i] == 1) {\\n rx = posX[i];\\n ry = posY[i];\\n return;\\n }\\n }\\n assert(false);\\n }\\n int HollX() {\\n int x, y;\\n Holl(x, y);\\n return x;\\n }\\n int HollY() {\\n int x, y;\\n Holl(x, y);\\n return y;\\n }\\n void CalcA() {\\n int rev[16];\\n REP(i, N) {\\n rev[(int)cards[i] - 1] = i;\\n }\\n\\n a = 0;\\n FOR(i, 1, N) {\\n a += dist[rev[i]][i];\\n }\\n FOR(i, 3, N) {\\n if (cards[i] == i + 1) { continue; }\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\\n }\\n a += 6;\\nnext:;\\n }\\n if (a != 0 && n == 5) {\\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n }\\n }\\n ull Hash() {\\n ll ret = 0;\\n REP(i, N) {\\n ret = ret * BASE + cards[i];\\n }\\n return ret;\\n }\\n bool operator<(const State &rhs) const {\\n return cost + a > rhs.cost + rhs.a;\\n }\\n};\\n\\nmap<ull, char> half[6];\\nvoid CalcHalfSide(int m) {\\n n = m;\\n N = n * (n + 1) / 2;\\n State ini;\\n ini.cost = 0;\\n REP(i, N) { ini.cards[i] = i + 1; }\\n queue<State> que;\\n que.push(ini);\\n half[m][ini.Hash()] = 0;\\n\\n while (!que.empty()) {\\n State s = que.front();\\n que.pop();\\n if (s.cost == HALF) { continue; }\\n\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ull h = ns.Hash();\\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\\n half[m][h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n}\\n\\nint main() {\\n REP(y, 5) {\\n REP(x, y + 1) {\\n posX[Encode(x, y)] = x;\\n posY[Encode(x, y)] = y;\\n }\\n }\\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\\n int test_case = 0;\\n while (scanf(\\\"%d\\\", &n), n) {\\n test_case++;\\n N = n * (n + 1) / 2;\\n\\n // calc dist\\n MEMSET(dist, 0x0f);\\n REP(i, N) { dist[i][i] = 0; }\\n REP(i, N) {\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n dist[i][Encode(nx, ny)] = 1;\\n }\\n }\\n REP(k, N) REP(i, N) REP(j, N) {\\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n\\n // Get Input\\n State ini;\\n ini.cost = 0;\\n REP(y, n) {\\n REP(x, y + 1) {\\n int v;\\n scanf(\\\"%d\\\", &v);\\n ini.Set(x, y, v);\\n }\\n }\\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\\n ini.Swap(0, n - 1, 0, n - 2);\\n ini.cost++;\\n }\\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\\n ini.cost++;\\n }\\n ini.CalcA();\\n int x, y;\\n ini.Holl(x, y);\\n\\n // A*\\n map<ull, int> dists;\\n priority_queue<State> que;\\n que.push(ini);\\n dists[ini.Hash()] = 0;\\n int ans = 45;\\n while (!que.empty()) {\\n State s = que.top();\\n que.pop();\\n if (s.a == 0) {\\n ans = s.cost;\\n break;\\n }\\n if (half[n].count(s.Hash())) {\\n ans = min(ans, s.cost + half[n][s.Hash()]);\\n //cout << \\\"OK:\\\" << \\\" \\\" << ans << endl;\\n continue;\\n }\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ns.CalcA();\\n if (ns.cost > ans - HALF) { continue; }\\n if (ns.cost + ns.a > ans) { continue; }\\n ull h = ns.Hash();\\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\\n dists[h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n printf(\\\"Case %d: %d\\\\n\\\", test_case, ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5990,\n \"memory_kb\": 50000,\n \"score_of_the_acc\": -1.5694,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2391_384972\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nconst int HALF = 22;\\nconst ll BASE = 1e+9 + 7;\\nint n;\\nint N;\\nint posX[15];\\nint posY[15];\\nint dist[15][15];\\nconst int dx[4] = { -1, 0, 0, 1 };\\nconst int dy[4] = { -1, -1, 1, 1 };\\n\\ninline int Encode(int x, int y) {\\n assert(x <= y);\\n return y * (y + 1) / 2 + x;\\n}\\ninline void Decode(int code, int &x, int &y) {\\n assert(0 <= code && code < 15);\\n x = posX[code];\\n y = posY[code];\\n}\\n\\nstruct State {\\n char cost;\\n char a;\\n char cards[15];\\n int Get(int x, int y) {\\n return cards[Encode(x, y)];\\n }\\n void Set(int x, int y, int v) {\\n cards[Encode(x, y)] = v;\\n }\\n void Swap(int x1, int y1, int x2, int y2) {\\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\\n }\\n void Holl(int &rx, int &ry) {\\n REP(i, N) {\\n if (cards[i] == 1) {\\n rx = posX[i];\\n ry = posY[i];\\n return;\\n }\\n }\\n assert(false);\\n }\\n int HollX() {\\n int x, y;\\n Holl(x, y);\\n return x;\\n }\\n int HollY() {\\n int x, y;\\n Holl(x, y);\\n return y;\\n }\\n void CalcA() {\\n int rev[16];\\n REP(i, N) {\\n rev[(int)cards[i] - 1] = i;\\n }\\n\\n a = 0;\\n FOR(i, 1, N) {\\n a += dist[rev[i]][i];\\n }\\n FOR(i, 3, N) {\\n if (cards[i] == i + 1) { continue; }\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\\n }\\n a += 6;\\nnext:;\\n }\\n if (a != 0 && n == 5) {\\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n }\\n }\\n ull Hash() {\\n ll ret = 0;\\n REP(i, N) {\\n ret = ret * BASE + cards[i];\\n }\\n return ret;\\n }\\n bool operator<(const State &rhs) const {\\n return cost + a > rhs.cost + rhs.a;\\n }\\n};\\n\\nmap<ull, char> half[6];\\nvoid CalcHalfSide(int m) {\\n n = m;\\n N = n * (n + 1) / 2;\\n State ini;\\n ini.cost = 0;\\n REP(i, N) { ini.cards[i] = i + 1; }\\n queue<State> que;\\n que.push(ini);\\n half[m][ini.Hash()] = 0;\\n\\n while (!que.empty()) {\\n State s = que.front();\\n que.pop();\\n if (s.cost == HALF) { continue; }\\n\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ull h = ns.Hash();\\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\\n half[m][h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n}\\n\\nint main() {\\n REP(y, 5) {\\n REP(x, y + 1) {\\n posX[Encode(x, y)] = x;\\n posY[Encode(x, y)] = y;\\n }\\n }\\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\\n int test_case = 0;\\n while (scanf(\\\"%d\\\", &n), n) {\\n test_case++;\\n N = n * (n + 1) / 2;\\n\\n // calc dist\\n MEMSET(dist, 0x0f);\\n REP(i, N) { dist[i][i] = 0; }\\n REP(i, N) {\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n dist[i][Encode(nx, ny)] = 1;\\n }\\n }\\n REP(k, N) REP(i, N) REP(j, N) {\\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n\\n // Get Input\\n State ini;\\n ini.cost = 0;\\n REP(y, n) {\\n REP(x, y + 1) {\\n int v;\\n scanf(\\\"%d\\\", &v);\\n ini.Set(x, y, v);\\n }\\n }\\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\\n ini.Swap(0, n - 1, 0, n - 2);\\n ini.cost++;\\n }\\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\\n ini.cost++;\\n }\\n ini.CalcA();\\n int x, y;\\n ini.Holl(x, y);\\n\\n // A*\\n map<ull, int> dists;\\n priority_queue<State> que;\\n que.push(ini);\\n dists[ini.Hash()] = 0;\\n int ans = 45;\\n while (!que.empty()) {\\n State s = que.top();\\n que.pop();\\n if (s.a == 0) {\\n ans = s.cost;\\n break;\\n }\\n if (half[n].count(s.Hash())) {\\n ans = min(ans, s.cost + half[n][s.Hash()]);\\n //cout << \\\"OK:\\\" << \\\" \\\" << ans << endl;\\n continue;\\n }\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ns.CalcA();\\n if (ns.cost > ans - HALF) { continue; }\\n if (ns.cost + ns.a > ans) { continue; }\\n ull h = ns.Hash();\\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\\n dists[h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n printf(\\\"Case %d: %d\\\\n\\\", test_case, ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5610,\n \"memory_kb\": 59000,\n \"score_of_the_acc\": -1.5187,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2391_384969\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nconst int HALF = 22;\\nconst ll BASE = 1e+9 + 7;\\nint n;\\nint N;\\nint posX[15];\\nint posY[15];\\nint dist[15][15];\\nconst int dx[4] = { -1, 0, 0, 1 };\\nconst int dy[4] = { -1, -1, 1, 1 };\\n\\ninline int Encode(int x, int y) {\\n assert(x <= y);\\n return y * (y + 1) / 2 + x;\\n}\\ninline void Decode(int code, int &x, int &y) {\\n assert(0 <= code && code < 15);\\n x = posX[code];\\n y = posY[code];\\n}\\n\\nstruct State {\\n char cost;\\n char a;\\n char cards[15];\\n int Get(int x, int y) {\\n return cards[Encode(x, y)];\\n }\\n void Set(int x, int y, int v) {\\n cards[Encode(x, y)] = v;\\n }\\n void Swap(int x1, int y1, int x2, int y2) {\\n swap(cards[Encode(x1, y1)], cards[Encode(x2, y2)]);\\n }\\n void Holl(int &rx, int &ry) {\\n REP(i, N) {\\n if (cards[i] == 1) {\\n rx = posX[i];\\n ry = posY[i];\\n return;\\n }\\n }\\n assert(false);\\n }\\n int HollX() {\\n int x, y;\\n Holl(x, y);\\n return x;\\n }\\n int HollY() {\\n int x, y;\\n Holl(x, y);\\n return y;\\n }\\n void CalcA() {\\n int rev[16];\\n REP(i, N) {\\n rev[(int)cards[i] - 1] = i;\\n }\\n\\n a = 0;\\n FOR(i, 1, N) {\\n a += dist[rev[i]][i];\\n }\\n FOR(i, 3, N) {\\n if (cards[i] == i + 1) { continue; }\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n if (cards[Encode(nx, ny)] != Encode(nx, ny) + 1) { goto next; }\\n }\\n a += 6;\\nnext:;\\n }\\n if (a != 0 && n == 5) {\\n if (cards[0] == 1 && cards[1] == 2 && cards[2] == 3) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1) &&\\n (cards[3] == 4 && cards[4] == 5 && cards[5] == 6) &&\\n (cards[6] != 7 || cards[7] != 8 || cards[8] != 9 ||\\n cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n if ((cards[0] == 1 || cards[1] == 1 || cards[2] == 1 ||\\n cards[3] == 1 || cards[4] == 1 || cards[5] == 1) &&\\n (cards[6] == 7 || cards[7] == 8 || cards[8] == 9) &&\\n (cards[9] != 10 || cards[11] != 12 || cards[12] != 13 || cards[13] != 14)) {\\n a += 6;\\n }\\n }\\n }\\n ull Hash() {\\n ll ret = 0;\\n REP(i, N) {\\n ret = ret * BASE + cards[i];\\n }\\n return ret;\\n }\\n bool operator<(const State &rhs) const {\\n return cost + a > rhs.cost + rhs.a;\\n }\\n};\\n\\nmap<ull, char> half[6];\\nvoid CalcHalfSide(int m) {\\n n = m;\\n N = n * (n + 1) / 2;\\n State ini;\\n ini.cost = 0;\\n REP(i, N) { ini.cards[i] = i + 1; }\\n queue<State> que;\\n que.push(ini);\\n half[m][ini.Hash()] = 0;\\n\\n while (!que.empty()) {\\n State s = que.front();\\n que.pop();\\n if (s.cost == HALF) { continue; }\\n\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ull h = ns.Hash();\\n if (half[m].count(h) && half[m][h] <= ns.cost) { continue; }\\n half[m][h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n}\\n\\nint main() {\\n REP(y, 5) {\\n REP(x, y + 1) {\\n posX[Encode(x, y)] = x;\\n posY[Encode(x, y)] = y;\\n }\\n }\\n FOREQ(i, 1, 5) { CalcHalfSide(i); }\\n int test_case = 0;\\n while (scanf(\\\"%d\\\", &n), n) {\\n test_case++;\\n N = n * (n + 1) / 2;\\n\\n // calc dist\\n MEMSET(dist, 0x0f);\\n REP(i, N) { dist[i][i] = 0; }\\n REP(i, N) {\\n int fx = posX[i];\\n int fy = posY[i];\\n REP(dir, 4) {\\n int nx = fx + dx[dir];\\n int ny = fy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n dist[i][Encode(nx, ny)] = 1;\\n }\\n }\\n REP(k, N) REP(i, N) REP(j, N) {\\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n\\n // Get Input\\n State ini;\\n ini.cost = 0;\\n REP(y, n) {\\n REP(x, y + 1) {\\n int v;\\n scanf(\\\"%d\\\", &v);\\n ini.Set(x, y, v);\\n }\\n }\\n if (ini.Get(0, n - 1) != Encode(0, n - 1) + 1) {\\n ini.Swap(0, n - 1, 0, n - 2);\\n ini.cost++;\\n }\\n if (ini.Get(n - 1, n - 1) != Encode(n - 1, n - 1) + 1) {\\n ini.Swap(n - 1, n - 1, n - 2, n - 2);\\n ini.cost++;\\n }\\n ini.CalcA();\\n int x, y;\\n ini.Holl(x, y);\\n\\n // A*\\n map<ull, int> dists;\\n priority_queue<State> que;\\n que.push(ini);\\n dists[ini.Hash()] = 0;\\n int ans = 45;\\n while (!que.empty()) {\\n State s = que.top();\\n que.pop();\\n if (s.a == 0) {\\n ans = s.cost;\\n break;\\n }\\n if (half[n].count(s.Hash())) {\\n ans = min(ans, s.cost + half[n][s.Hash()]);\\n //cout << \\\"OK:\\\" << \\\" \\\" << ans << endl;\\n }\\n int hx, hy;\\n s.Holl(hx, hy);\\n REP(dir, 4) {\\n int nx = hx + dx[dir];\\n int ny = hy + dy[dir];\\n if (nx < 0 || nx > ny || ny < 0 || ny >= n) { continue; }\\n State ns = s;\\n ns.Swap(hx, hy, nx, ny);\\n ns.cost++;\\n ns.CalcA();\\n if (ns.cost > ans - HALF) { continue; }\\n if (ns.cost + ns.a > ans) { continue; }\\n ull h = ns.Hash();\\n if (dists.count(h) && dists[h] <= ns.cost) { continue; }\\n dists[h] = ns.cost;\\n que.push(ns);\\n }\\n }\\n printf(\\\"Case %d: %d\\\\n\\\", test_case, ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5510,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.4652,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2391_379913\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<queue>\\nusing namespace std;\\n\\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\n\\nvoid solve_small(vi);\\n\\nconst int dy[] = {-1, -1, 1, 1}, dx[] = {-1, 0, 0, 1};\\nmap<ll, int> M;\\nint n, num[5][5];\\n\\ninline ll hash(const vi &v){\\n\\tll res = 0;\\n\\trep(i,v.size()) res *= 17, res += v[i];\\n\\treturn res;\\n}\\ninline void push(const vi &v, int c, queue<pair<int,vi> > &q){\\n\\tll h = hash(v);\\n\\tif(M.count(h))return;\\n\\tM[h] = c;\\n\\tif(c <= 22) q.push(make_pair(c+1, v));\\n}\\n\\nint main(){\\n\\t\\n\\tqueue<pair<int,vi> > q;\\n\\tvi goal;\\n\\tint k = 0;\\n\\trep(i,5) rep(j,i+1){\\n\\t\\tnum[i][j] = k;\\n\\t\\tgoal.push_back(++k);\\n\\t}\\n\\tpush(goal, 0, q);\\n\\t\\n\\twhile(!q.empty()){\\n\\t\\tvi v = q.front().second;\\n\\t\\tint c = q.front().first; q.pop();\\n\\t\\t\\n\\t\\tint idx = -1, y, x;\\n\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\tif(v[++idx] == 1) goto OUT;\\n\\t\\tOUT:;\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\tpush(v, c, q);\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t}\\n\\t}\\n\\tint cs = 0;\\n\\t\\n\\twhile(cin >> n, n){\\n\\t\\t\\n\\t\\tcout << \\\"Case \\\" << ++cs << \\\": \\\";\\n\\t\\t\\n\\t\\tvi v(n*(n+1)/2);\\n\\t\\tk = 0;\\n\\t\\trep(i,n) rep(j,i+1) cin >> v[k++];\\n\\t\\tif(n <= 4){\\n\\t\\t\\tsolve_small(v);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tll h = hash(v);\\n\\t\\tif(M.count(h)){\\n\\t\\t\\tcout << M[h] << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tqueue<pair<int,vi> > q;\\n\\t\\tset<ll> s;\\n\\t\\ts.insert(h);\\n\\t\\tq.push(make_pair(0, v));\\n\\t\\twhile(!q.empty()){\\n\\t\\t\\tv = q.front().second;\\n\\t\\t\\tint c = q.front().first; q.pop();\\n\\t\\t\\t\\n\\t\\t\\tint idx = -1, y, x;\\n\\t\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\t\\tif(v[++idx] == 1) goto OUT2;\\n\\t\\t\\tOUT2:;\\n\\t\\t\\trep(d,4){\\n\\t\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\t\\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\\n\\t\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\t\\tll h = hash(v);\\n\\t\\t\\t\\tif(M.count(h)){\\n\\t\\t\\t\\t\\tcout << M[h] + c + 1 << endl;\\n\\t\\t\\t\\t\\tgoto END;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(!s.count(h)) q.push(make_pair(c+1, v)), s.insert(h);\\n\\t\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tEND:;\\n\\t}\\n\\treturn 0;\\n}\\n\\nvoid solve_small(vi v){\\n\\tvi goal = v;\\n\\tsort(goal.begin(), goal.end());\\n\\tqueue<pair<int,vi> > q;\\n\\tset<ll> s;\\n\\tll ghash = hash(goal);\\n\\tq.push(make_pair(0, v));\\n\\t\\n\\twhile(!q.empty()){\\n\\t\\tv = q.front().second;\\n\\t\\tint c = q.front().first; q.pop();\\n\\t\\tll h = hash(v);\\n\\t\\tif(s.count(h)) continue;\\n\\t\\ts.insert(h);\\n\\t\\tif(h == ghash){\\n\\t\\t\\tcout << c <<endl; return;\\n\\t\\t}\\n\\t\\tint idx = -1, y, x;\\n\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\tif(v[++idx] == 1) goto OUT3;\\n\\t\\tOUT3:;\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\tif(ny < 0 || nx < 0 || ny >= n || nx > ny) continue;\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\tif(!s.count(hash(v))) q.push(make_pair(c+1, v));\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5310,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.3583,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2391_379900\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<queue>\\nusing namespace std;\\n\\n#define rep(i,n) for(int i = 0; i < (int)n; i++)\\n#define dbg(x) cerr << #x << \\\" = \\\" << (x) << endl;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\n\\nvoid solve_small(vi);\\n\\nconst int dy[] = {-1, -1, 1, 1}, dx[] = {-1, 0, 0, 1};\\nmap<ll, int> M;\\nint n, num[5][5];\\n\\ninline ll hash(const vi &v){\\n\\tll res = 0;\\n\\trep(i,v.size()) res *= 17, res += v[i];\\n\\treturn res;\\n}\\ninline void push(const vi &v, int c, queue<pair<int,vi> > &q){\\n\\tll h = hash(v);\\n\\tif(M.count(h) || c > 22) return;\\n\\tM[h] = c;\\n\\tq.push(make_pair(c+1, v));\\n}\\n\\nvoid pv(const vi &v){\\n\\tint k = 0;\\n\\trep(i,n) rep(j,i+1) cerr << v[k++] << (j==i?\\\"\\\\n\\\":\\\" \\\");\\n}\\n\\nint main(){\\n\\t\\n\\tqueue<pair<int,vi> > q;\\n\\tvi goal;\\n\\tint k = 0;\\n\\trep(i,5) rep(j,i+1){\\n\\t\\tnum[i][j] = k;\\n\\t\\tgoal.push_back(++k);\\n\\t}\\n\\tpush(goal, 0, q);\\n\\t\\n\\twhile(!q.empty()){\\n\\t\\tvi v = q.front().second;\\n\\t\\tint c = q.front().first; q.pop();\\n\\t\\t/*\\n\\t\\tdbg(c);\\n\\t\\tif(c == 2) pv(v);\\n\\t\\t*/\\n\\t\\tint idx = -1, y, x;\\n\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\tif(v[++idx] == 1) goto OUT;\\n\\t\\tOUT:;\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\tpush(v, c, q);\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint cs = 0;\\n\\t\\n\\twhile(cin >> n, n){\\n\\t\\t\\n\\t\\tcout << \\\"Case \\\" << ++cs << \\\": \\\";\\n\\t\\t\\n\\t\\tvi v(n*(n+1)/2);\\n\\t\\tk = 0;\\n\\t\\trep(i,n) rep(j,i+1) cin >> v[k++];\\n\\t\\tif(n <= 4){\\n\\t\\t\\tsolve_small(v);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tll h = hash(v);\\n\\t\\tif(M.count(h)){\\n\\t\\t\\tcout << M[h] << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\t\\n\\t\\tqueue<pair<int,vi> > q;\\n\\t\\tset<ll> s;\\n\\t\\ts.insert(h);\\n\\t\\tq.push(make_pair(0, v));\\n\\t\\twhile(!q.empty()){\\n\\t\\t\\tv = q.front().second;\\n\\t\\t\\tint c = q.front().first; q.pop();\\n\\t\\t\\t\\n\\t\\t\\tint idx = -1, y, x;\\n\\t\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\t\\tif(v[++idx] == 1) goto OUT2;\\n\\t\\t\\tOUT2:;\\n\\t\\t\\trep(d,4){\\n\\t\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\t\\tif(ny < 0 || nx < 0 || ny >= 5 || nx > ny) continue;\\n\\t\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\t\\tll h = hash(v);\\n\\t\\t\\t\\tif(M.count(h)){\\n\\t\\t\\t\\t\\tcout << M[h] + c + 1 << endl;\\n\\t\\t\\t\\t\\tgoto END;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(!s.count(h)) q.push(make_pair(c+1, v)), s.insert(h);\\n\\t\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tEND:;\\n\\t}\\n\\treturn 0;\\n}\\n\\nvoid solve_small(vi v){\\n\\tvi goal = v;\\n\\tsort(goal.begin(), goal.end());\\n\\tqueue<pair<int,vi> > q;\\n\\tset<ll> s;\\n\\tll ghash = hash(goal);\\n\\tq.push(make_pair(0, v));\\n\\t\\n\\t//rep(i,v.size())cerr<<v[i]<<(i==v.size()-1?\\\"\\\\n\\\":\\\" \\\");\\n\\t\\n\\twhile(!q.empty()){\\n\\t\\tv = q.front().second;\\n\\t\\tint c = q.front().first; q.pop();\\n\\t\\tll h = hash(v);\\n\\t\\tif(s.count(h)) continue;\\n\\t\\ts.insert(h);\\n\\t\\tif(h == ghash){\\n\\t\\t\\tcout << c <<endl; return;\\n\\t\\t}\\n\\t\\t/*\\n\\t\\tcerr<<endl;\\n\\t\\tint k = 0;\\n\\t\\trep(i,n) rep(j,i+1) cerr << v[k++] << (j==i?\\\"\\\\n\\\":\\\" \\\");\\n\\t\\t*/\\n\\t\\tint idx = -1, y, x;\\n\\t\\tfor(y = 0; y < 5; y++) for(x = 0; x <= y; x++)\\n\\t\\t\\tif(v[++idx] == 1) goto OUT3;\\n\\t\\tOUT3:;\\n\\t\\trep(d,4){\\n\\t\\t\\tint ny = y + dy[d], nx = x + dx[d];\\n\\t\\t\\tif(ny < 0 || nx < 0 || ny >= n || nx > ny) continue;\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t\\tif(!s.count(hash(v))) q.push(make_pair(c+1, v));\\n\\t\\t\\tswap(v[num[ny][nx]], v[idx]);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6510,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -1,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1366,"cells":{"group_id":{"kind":"string","value":"aoj_2399_cpp"},"problem_description":{"kind":"string","value":"Save Your Privacy!\n君のプライバシーを守れ!\nEnglish text is not available in this practice contest.\nICPC (International Committee of Privacy and Confidence) は世界中に多くの構成員を持つ組織であり、その名の通り非常にプライバシーを尊重する、秘密主義者たちの団体である。構成員たちは必要上他の構成員の個人情報を知ってしまうことがあるが、それらを厳重に秘匿するよう義務付けられている。\nしかしある日、何人かの構成員の個人情報が漏洩してしまった！ICPCの ACM (Account Control Manager: アカウント管理責任者) であるあなたは、速やかに情報を漏洩させた構成員を特定し、厳重に処分しなければならない。\nあなたは構成員よりも大きな権限を持つ管理者なので、誰が誰の個人情報を知ってしまっているかを完全に把握している。もちろん、どの構成員も自分の知らない構成員の個人情報を漏洩させることはありえない。しかし、犯人は自分が知っている全ての個人情報を漏洩させたとは限らない。個人情報が漏洩してしまった構成員の一覧から、どの構成員が個人情報を漏洩させたのかを (可能ならば) 特定しよう。\nところで、ICPC という組織が何を目的として活動しているのかは最重要機密であり、管理者の権限をもってしても知ることはできない。\nInput\n入力ファイルは複数のデータセットを含む。1 つのデータセットは、以下の形式で与えられる。\nN\nM\n1\np\n1,1\np\n1,2\n...\np\n1,M\n1\nM\n2\np\n2,1\np\n2,2\n...\np\n2,M\n2\n:\nM\nN\np\nN,1\np\nN,2\n...\np\nN,M\nN\nK\nl\n1\nl\n2\n...\nl\nK\nN (2 ≤ N ≤ 100) は構成員の数を表す整数である。それぞれの構成員には 1 から N までの番号が振られている。\n続く N 行には各構成員の番号順に、その構成員が知っている個人情報の一覧が与えられる。各行の最初の整数 M\ni\n(0 ≤ M\ni\n≤ N)は、後に続く整数の個数を表す。残りの整数は、その構成員が個人情報を知っている構成員の番号を表す。\n最後の行には、個人情報が漏洩した構成員の一覧が示される。 K (1 ≤ K ≤ N) は漏洩した構成員の人数を表し、残りの整数は漏洩した構成員の番号を表す。\n入力は正しく与えられると仮定してよい。つまり、ある構成員が知っている個人情報の一覧として、同じ構成員の番号が 2 回以上与えられたり、存在しない構成員の番号が与えられることはない。漏洩した構成員の番号の一覧も同様である。\nN = 0 のとき、入力は終了する。\nOutput\n個人情報を漏洩させた構成員を特定できるならば、その構成員の番号を出力せよ。特定できない場合 -1 を出力せよ。\n特定できない場合には、次の 2 つのケースがある。 1 つは、流出させた可能性がある構成員が 2 人以上挙げられる場合である。もう 1 つは、どの構成員が流出させたと仮定しても矛盾が生じる場合である。どちらの場合でも、あなたのプログラムは -1 と出力しなければならない。\nSample Input\n3\n2 2 3\n1 1\n1 1\n2 2 3\n3\n2 2 3\n1 3\n1 2\n1 2\n5\n3 1 3 4\n4 1 3 4 5\n2 1 3\n2 1 2\n0\n3 1 3 5\n3\n2 2 1\n1 1\n1 2\n3 3 2 1\n0\nOutput for Sample Input\n1\n-1\n2\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2399_10852712","code_snippet":"#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i = 0; i < n; ++i)\n#define all(x) x.begin(), x.end()\n#define X firsst\n#define Y second\n#define pb push_back\nusing namespace std;\n\nint main(void){\n int n;\n while(cin >> n && n){\n int m, t, k;\n vector<int> ss[128];\n rep(i,n){\n cin >> m;\n rep(j,m){\n cin >> t;\n t--;\n ss[t].pb(i);\n }\n }\n// rep(i,n){\n// rep(j,ss[i].size()){\n// cout << ss[i][j] << \"<\";\n// }\n// cout << endl;\n// }\n cin >> k;\n int used[128]={0};\n rep(i,k){\n cin >> t;\n t--;\n rep(j, ss[t].size()){\n used[ss[t][j]]++;\n }\n }\n int index = -1;\n rep(i,n){\n if(used[i] == k){\n if(index == -1){\n index = i;\n }else{\n index = -2;\n }\n }\n }\n if(index < 0){\n cout << -1 << endl;\n }else{\n cout << index+1 << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3528,"score_of_the_acc":-0.4409,"final_rank":12},{"submission_id":"aoj_2399_10609742","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, const A &r) {\n if(l < r)\n l = r;\n}\n\nll mod = 998244353;\n\nll n;\nvoid input() { cin >> n; }\n\nvoid solve() {\n vector<set<ll>> know(n);\n for(int i = 0; i < n; i++) {\n ll a;\n cin >> a;\n for(int j = 0; j < a; j++) {\n ll b;\n cin >> b;\n know[i].insert(b);\n }\n }\n ll a;\n cin >> a;\n set<ll> sh;\n for(int i = 0; i < n; i++)\n sh.insert(i);\n for(int i = 0; i < a; i++) {\n ll b;\n cin >> b;\n for(int j = 0; j < n; j++) {\n if(know[j].count(b) == 0)\n sh.erase(j);\n }\n }\n cout << (sh.size() == 1 ? *sh.begin() + 1 : -1) << endl;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while(1) {\n input();\n if(n == 0)\n break;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3784,"score_of_the_acc":-0.6929,"final_rank":13},{"submission_id":"aoj_2399_10599238","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int N;\n cin >> N;\n if (N == 0) return false;\n vector<set<int>> S(N);\n for (int i = 0; i < N; i++) {\n int M;\n cin >> M;\n while (M--) {\n int a;\n cin >> a;\n S[i].insert(a);\n }\n }\n int K;\n cin >> K;\n vector<int> A(K);\n for (int i = 0; i < K; i++) cin >> A[i];\n int ans = -1;\n for (int i = 0; i < N; i++) {\n auto T = S[i];\n bool ok = true;\n for (int a : A) {\n if (T.find(a) == T.end()) ok = false;\n }\n if (ok) {\n if (ans != -1) {\n ans = -1;\n break;\n }\n ans = i + 1;\n }\n }\n cout << ans << '\\n';\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":3968,"score_of_the_acc":-0.874,"final_rank":15},{"submission_id":"aoj_2399_10571981","code_snippet":"// AOJ 2399 - Save Your Privacy!\n// JAG Practice Contest for Japan Domestic 2012 - Problem A\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nbool solving() {\n int N; cin >> N;\n if(N == 0) return false;\n\n vector<set<int>> know(N);\n for(int i=0; i<N; ++i) {\n int M; cin >> M;\n for(int j=0; j<M; ++j) {\n int p; cin >> p;\n know[i].insert(p);\n }\n }\n int K; cin >> K;\n vector<int> leaked(K);\n for(int i=0; i<K; ++i) cin >> leaked[i];\n\n vector<bool> sus(N, true);\n for(int i=0; i<K; ++i) {\n for(int j=0; j<N; ++j) {\n if(!know[j].count(leaked[i])) sus[j] = false;\n }\n }\n int culprit = -1;\n for(int i=0; i<N; ++i) {\n if(sus[i]) {\n if(culprit == -1) culprit = i+1;\n else {\n cout << -1 << endl;\n return true;\n }\n }\n }\n cout << culprit << endl;\n return true;\n}\n\nint main() {\n while(solving()) {}\n}","accuracy":1,"time_ms":20,"memory_kb":3880,"score_of_the_acc":-1.7874,"final_rank":20},{"submission_id":"aoj_2399_10496669","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n while (true) {\n int N;\n cin >> N;\n if (N == 0) break;\n\n vector<vector<int>> list;\n for (int i = 0; i < N; i++) {\n int n2;\n cin >> n2;\n vector<int> arr(n2);\n for (int j = 0; j < n2; j++) {\n cin >> arr[j];\n arr[j]--; // Adjusting to 0-based index\n }\n list.push_back(arr);\n }\n\n int K;\n cin >> K;\n if (K == 0) {\n cout << -1 << endl;\n continue;\n }\n\n vector<int> checkarr(K);\n for (int i = 0; i < K; i++) {\n cin >> checkarr[i];\n checkarr[i]--; // Adjusting to 0-based index\n }\n\n int ans = -1;\n bool doublefound = false;\n for (int i = 0; i < list.size(); i++) {\n if (doublefound) break;\n vector<int>& arr2 = list[i];\n int cursol = 0;\n for (int j = 0; j < arr2.size(); j++) {\n if (arr2[j] == checkarr[cursol]) {\n cursol++;\n j = -1; // Reset j to start from the beginning\n if (cursol == K) {\n if (ans == -1) {\n ans = i + 1; // Convert to 1-based index\n } else {\n doublefound = true;\n }\n break;\n }\n }\n }\n }\n\n if (doublefound) {\n cout << -1 << endl;\n } else {\n cout << ans << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3520,"score_of_the_acc":-0.4331,"final_rank":11},{"submission_id":"aoj_2399_10416721","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define rep2(i, a, b) rep3(i, a, b, 1)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep0(n) rep1(aaaaa, n)\n#define ov4(a, b, c, d, name, ...) name\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\n#define fore(e, v) for (auto&& e : v)\n#define all(a) begin(a), end(a)\n#define sz(a) (int)(size(a))\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\n#define eb emplace_back\n\ntemplate <typename T, typename S>\nbool chmin(T& a, const S& b) {\n return a > b ? a = b, 1 : 0;\n}\ntemplate <typename T, typename S>\nbool chmax(T& a, const S& b) {\n return a < b ? a = b, 1 : 0;\n}\nconst int INF = 1e9 + 100;\nconst ll INFL = 3e18 + 100;\n#define i128 __int128_t\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nvoid solve();\nint main(){\n while(1)solve();\n}\n\nvoid solve(){\n int N;\n cin>>N;\n if(N==0)exit(0);\n vector<set<int>> A(N);\n rep(i,N){\n int M;\n cin>>M;\n rep(M){\n int t;\n cin>>t;\n A[i].insert(t);\n }\n }\n int K;\n cin>>K;\n vi X(K);\n fore(i,X)cin>>i;\n vi ans;\n rep(i,N){\n bool ok=1;\n fore(j,X){\n if(!A[i].contains(j))ok=0;\n }\n if(ok)ans.eb(i+1);\n }\n if(sz(ans)!=1)cout<<\"-1\\n\";\n else cout<<ans[0]<<'\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":3968,"score_of_the_acc":-0.874,"final_rank":15},{"submission_id":"aoj_2399_10404490","code_snippet":"#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace atcoder;\nusing namespace std;\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\n#define OVERLOAD_REP(_1, _2, _3, _4, 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, n) for (ll i=a;i<n;i++)\n#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\n#define RREP1(n) for(ll i=n;i>=0;i--)\n#define RREP2(i, n) for(ll i=n;i>=0;i--)\n#define RREP3(i, a, n) for(ll i=n;i>=a;i--)\n#define RREP4(i, a, b, n) for(ll i=n;i>=a;i-=b)\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define foa(a,v) (auto& a : (v))\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define len(n) (long long)(n).size()\n#define pb push_back\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vvvs = vector<vvs>;\nusing vld = vector<ld>;\nusing vvld = vector<vld>;\nusing vvvld = vector<vvld>;\nusing vc = vector<char>;\nusing vvc = vector<vc>;\nusing vvvc = vector<vvc>;\nusing pll = pair<ll,ll>;\nusing vpll = vector<pll>;\ntemplate<class... T>\nconstexpr auto min(T... a){\n return min(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate<class... T>\nconstexpr auto max(T... a){\n return max(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\nll modpow(ll a,ll b,ll c){\n ll ans = 1;\n while (b){\n if (b & 1){\n ans *= a;\n ans %= c;\n }\n a *= a;\n a %= c;\n b /= 2;\n }\n return ans;\n}\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define PLL(name) pll name;cin>>name.first>>name.second;\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\n\nvoid print(){cout << \"\\n\";}\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\nvoid print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\n\n\n\nint main(){\n while(1){\n LL(n);\n if(n == 0){break;}\n vector<set<ll>> a(n);\n rep(i,n){\n LL(m);\n VLL(b,m);\n for(auto x:b){\n a[i].emplace(x);\n }\n }\n LL(k);\n VLL(c,k);\n auto solve = [&](){\n ll ans = -1;\n rep(i,n){\n ll cnt = 0;\n rep(j,k){\n if(a[i].count(c[j])){\n cnt++;\n }\n }\n if(cnt == k){\n if(ans != -1){\n print(-1);\n return;\n }\n ans = i+1;\n }\n }\n print(ans);\n\n };\n solve();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4096,"score_of_the_acc":-1,"final_rank":17},{"submission_id":"aoj_2399_9402917","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n while (1) {\n int N;\n cin >> N;\n if (N == 0) {\n break;\n }\n vector<int> M(N);\n vector<set<int>> st(N);\n for (int i = 0; i < N; i++) {\n cin >> M[i];\n for (int j = 0; j < M[i]; j++) {\n int p;\n cin >> p;\n st[i].insert(p);\n }\n }\n int K;\n cin >> K;\n vector<int> l(K);\n for (int i = 0; i < K; i++) {\n cin >> l[i];\n }\n int ans = -1;\n for (int i = 0; i < N; i++) {\n int cnt = 0;\n for (int j = 0; j < K; j++) {\n if (st[i].count(l[j])) {\n cnt++;\n }\n }\n if (cnt == K) {\n if (ans == -1) {\n ans = i + 1;\n } else {\n ans = -1;\n break;\n }\n }\n }\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3800,"score_of_the_acc":-1.7087,"final_rank":19},{"submission_id":"aoj_2399_9373006","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,j,n) for (long long i = j; i < (int)(n); i++)\n#define REP(i,j,n) for (long long i = j; i <= (int)(n); i++)\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n#define all(x) (x.begin(), x.end())\ntemplate<typename T1, typename T2> inline bool chmax(T1 &a, T2 b){\n bool compare = (a < b);\n if(compare) a = b;\n return compare;\n}\ntemplate<typename T1, typename T2> inline bool chmin(T1 &a, T2 b){\n bool compare = (a > b);\n if(compare) a = b;\n return compare;\n}\nstring substrback(string s,size_t p,size_t l){\n\t//s=文字列 p=後ろから数えて何文字目 l=pから何文字目まで\n\tconst size_t strl = s.length();\n\treturn s.substr(strl - p,l);\n}\n//pair型のfirstで比較\nbool comparePairs(const pair<ll,ll> &a, const pair<ll,ll> &b){\n\tif(a.first != b.first)\n\treturn a.first<b.first;\n\treturn a.second < b.second;\n}\n//pair型のsecondで比較\nbool comparePairs2(const pair<ll,ll> &a, const pair<ll,ll> &b){\n\tif(a.second != b.second)\n\treturn a.second<b.second;\n\treturn a.first < b.first;\n}\n//pair型の１.second と2.firstをつなげていく\nbool customsort(const pair<ll,ll> &a,const pair<ll,ll> &b){\n\tif(a.second == b.first){\n\t\treturn true;\n\t}\n\treturn false;\n}\nbool customsort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {\n // 特定の値がfirstに出た場合、そのsecond値を先頭に持ってくる\n if (a.first == -1) {\n return true;\n } else if (b.first == -1) {\n return false;\n }\n return a.first < b.first;\n}\n\n//nの階乗\null facto(ll n){\n\tif (n==0 || n ==1){\n\t\treturn 1;\n\t} else {\n\t\treturn n *facto(n-1);\n\t}\n}\n//nのΣ\nll sum(ll n) {\n\tll sum =0;\n\tsum = n*(n+1)/2;\n\treturn sum;\n}\nstruct V {\n\tint a, b;\n};\nbool acom(const V& a, const V& b) {\n\treturn a.a < b.a;\n}\nbool bcom(const V& a, const V& b) {\n\treturn a.b < b.b;\n}\nbool isPrime(ll num){\n\tif(num==1)return false;\n\tif(num==2)return true;\n\tif(num % 2 == 0)return false;\n\tfor(ll i =3;i*i<=num;i+=2){\n\t\tif(num % i == 0)return false;\n\t}\n\treturn true;\n}\nint gcd(int a, int b){\n\tif(a%b==0) return b;\n\telse return gcd(b, a%b);\n}\n/*\nint main() {\n\tll n,m;\n\tcin>>n>>m;\n\tfor (ll i = (ll) sqrt(m) + 1; i >= 2; i--) {\n\t\twhile(true) {\n\t\t\tif (n % i == 0 && m % i == 0) {\n\t\t\t\tm /= i;\n\t\t\t\tn /= i;\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tll g = gcd(n,m);\n\tn/=g; m/=g;\n\t//cout<<n<<\" \"<<m<<endl;\n\tint maxn =0; int maxm = 0;\n\tint n1 =n; int m1 =m;\n\twhile(n1>0){\n\t\tchmax(maxn,n1%10);\n\t\tn1/=10;\n\t}\n\twhile(m1>0){\n\t\tchmax(maxm,m1%10);\n\t\tm1/=10;\n\t}\n\tll ans = max(n,m);\n\tif(ans>10)ans==10;\n\tcout<<ans<<endl;\n}\n*/\n//atodekesite\nunordered_set<ll> primes;\nvoid bunkai(ll num) {\n\tcout<<num<<endl;\n\tif(num==1)return;\n\tif(num==2) {\n\t\tprimes.insert(2);\n\t\tbunkai(num/2);\n\t}\n\tif(num % 2 == 0)return;\n\tfor(ll i =3;i*i<=num;i+=2){\n\t\tif(num % i == 0) {\n\t\t\tprimes.insert(i);\n\t\t\tbunkai(num/i);\n\t\t} else {\n\t\t\treturn;\n\t\t}\n\t}\n}\nvector<bool> temp;\nbool solve() {\n int n;\n cin>>n;\n if (n==0) return false;\n vector<vector<bool>> m(n);\n temp = vector<bool>(n);\n rep(i,0,n) temp[i] = false;\n rep(i,0,n) m[i]=temp;\n rep(i,0,n) {\n int k;\n cin>>k;\n rep(j,0,k) {\n int x;\n cin>>x;\n x--;\n m[i][x]=true;\n }\n }\n int z;\n cin>>z;\n vector<bool> flags(n);\n rep(i, 0, n) flags[i]= true;\n rep(i, 0, z) {\n int x;\n cin>>x;\n x--;\n rep(j, 0, n) {\n if (!m[j][x]) flags[j] = false;\n }\n }\n int ans = -1;\n int size = 0;\n rep(i, 0, n) {\n if (flags[i]) {\n size++;\n ans = i;\n }\n }\n if (size != 1) {\n cout<<-1<<endl;\n } else {\n cout<<ans+1<<endl;\n }\n return true;\n}\nint main(){\n while(solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":-0.1457,"final_rank":2},{"submission_id":"aoj_2399_9372999","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nstruct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n\n#define rep(i, x, limit) for (ll i = (ll)x; i < (ll)limit; i++)\n#define REP(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; i++)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define el '\\n'\n#define spa \" \"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YES cout << \"YES\" << el\n#define NO cout << \"NO\" << el\n#define eps (1e-10)\n#define Equals(a,b) (fabs((a) - (b)) < eps )\n#define debug(x) cerr << #x << \" = \" << x << el\n\nconst double pi = 3.141592653589793238;\nconst int inf = 1073741823;\nconst ll infl = 1LL << 60;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\ntemplate<typename T1, typename T2>\nstd::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){\n os << \"{\" << p.first << \",\" << p.second << \"}\";\n return os;\n}\n\n// 配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り\ntemplate<typename T> inline void print_vec(const vector<T> &v, bool split_line=false) {\n if(v.empty()){\n cout << \"This vector is empty.\" << el;\n return;\n }\n bool isValue = (is_integral<T>::value);\n for (int i = 0; i < (int)v.size(); i++) {\n if(isValue && (v[i]==inf || v[i]==infl)) cout << 'x' << \" \\n\"[split_line || i+1==(int)v.size()];\n else cout << v[i] << \" \\n\"[split_line || i+1==(int)v.size()];\n }\n}\n\ntemplate<typename T1, typename T2> inline void print_vec(const vector<pair<T1,T2>> &v, bool split_line=false){\n if(v.empty()){\n cout << \"This vector is empty.\" << el;\n return;\n }\n for(int i = 0; i < (int)v.size(); i++){\n cout << '{';\n auto p = v[i];\n pair<bool,bool> isValue = {is_integral<T1>::value, is_integral<T2>::value};\n if(isValue.first && (p.first==inf || p.first==infl)) cout << \"x,\";\n else cout << p.first << ',';\n if(isValue.second && (p.second==inf || p.second==infl)) cout << 'x';\n else cout << p.second;\n cout << \"}\" << \" \\n\"[split_line || i+1==(int)v.size()];\n }\n}\n\ntemplate<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {\n bool compare = a < b;\n if(compare) a = b;\n return compare;\n}\ntemplate<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {\n bool compare = a > b;\n if(compare) a = b;\n return compare;\n}\n\n// std::chronoを利用した時間計測用クラス\nclass Timer{\n chrono::system_clock::time_point start;\n public:\n Timer() : start(chrono::system_clock::now()) {}\n \n double count(){\n chrono::duration<double> Time_ = chrono::system_clock::now() - start;\n return Time_.count();\n }\n\n bool is_under(double x){\n return (this -> count()) < x;\n }\n};\n\nint main(){\n while(true){\n int n;\n cin >> n;\n if(n==0) break;\n vector<int> m(n);\n vector<vector<int>> p(n,vector<int>());\n rep(i,0,n){\n cin >> m[i];\n rep(j,0,m[i]){\n int x;\n cin >> x;\n p[i].emplace_back(x);\n }\n }\n int k;\n cin >> k;\n vector<int> l(k);\n rep(i,0,k) cin >> l[i];\n int idx = -1;\n rep(i,0,n){\n set<int> se;\n rep(j,0,m[i]) se.insert(p[i][j]);\n bool isok = true;\n rep(j,0,k){\n if(!se.count(l[j])) isok=false;\n }\n if(isok){\n if(idx!=-1){\n idx = -1;\n break;\n }\n idx = i+1;\n }\n }\n cout << idx << el;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3408,"score_of_the_acc":-0.3228,"final_rank":6},{"submission_id":"aoj_2399_9372937","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing ll = long long;\n#define all(x) x.begin(), x.end()\ntemplate <class A, class B>\ninline bool chmin(A &a, const B &b) {\n return b < a && (a = b, true);\n}\ntemplate <class A, class B>\ninline bool chmax(A &a, const B &b) {\n return b > a && (a = b, true);\n}\n\nint solve() {\n int n;\n cin >> n;\n if (n == 0) return 1;\n vector s(n, vector<bool>(n));\n rep(i, n) {\n int m;\n cin >> m;\n rep(j, m) {\n int v;\n cin >> v;\n v--;\n s[i][v] = true;\n }\n }\n vector<bool> t(n);\n int k;\n cin >> k;\n rep(i, k) {\n int v;\n cin >> v;\n v--;\n t[v] = true;\n }\n int count = 0;\n int tar = 0;\n rep(i, n) {\n bool ok = true;\n rep(j, n) ok &= (!t[j] || s[i][j]);\n if (ok) {\n count++;\n tar = i;\n }\n }\n cout << (count == 1 ? tar + 1 : -1) << endl;\n return 0;\n}\n\nint main() {\n while (!solve())\n ;\n}","accuracy":1,"time_ms":10,"memory_kb":3388,"score_of_the_acc":-0.3031,"final_rank":5},{"submission_id":"aoj_2399_9372875","code_snippet":"#include <bits/stdc++.h>\n\nbool solve() {\n int N;\n std::cin >> N;\n if (N == 0) return false;\n std::vector<std::set<int>> A(N);\n for (int i{} ; i < N ; i++) {\n int M;\n std::cin >> M;\n for (int j{} ; j < M ; j++) {\n int p;\n std::cin >> p;\n A[i].insert(p);\n }\n }\n int K;\n std::cin >> K;\n std::vector<int> L(K);\n for (auto& l : L) std::cin >> l;\n int cnt{}, pos{-1};\n for (int i{} ; i < N ; i++) {\n bool ok{true};\n for (auto l : L) ok &= A[i].find(l) != A[i].end();\n if (ok) {\n cnt++;\n pos = i + 1;\n }\n }\n if (cnt == 1) {\n std::cout << pos << '\\n';\n }\n else {\n std::cout << -1 << '\\n';\n }\n return true;\n}\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n while (solve()) ;\n}","accuracy":1,"time_ms":10,"memory_kb":3868,"score_of_the_acc":-0.7756,"final_rank":14},{"submission_id":"aoj_2399_9331547","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n while(true){\n int N;\n cin >> N;\n if(N==0)break;\n vector<vector<int>>p(N,vector<int>(0));\n vector<int>M(N);\n for(int i=0;i<N;i++){\n cin >> M[i];\n for(int j=0;j<M[i];j++){\n int x;\n cin >> x;\n p[i].push_back(x);\n }\n }\n\n int K;\n cin >> K;\n vector<int>l(K);\n for(int i=0;i<K;i++){\n cin >> l[i];\n }\n int pos;\n int cnt2=0;\n for(int i=0;i<N;i++){\n int cnt=0;\n for(int j=0;j<K;j++){\n if(find(p[i].begin(),p[i].end(),l[j])!=p[i].end()){\n cnt++;\n }\n }\n if(cnt==K){\n cnt2++;\n pos=i+1;\n }\n }\n if(cnt2==1)cout << pos << endl;\n else cout << -1 << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.3504,"final_rank":8},{"submission_id":"aoj_2399_9309898","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e17;\n\nint main(){\n while(true){\n int n;\n cin >> n;\n if(n==0){\n break;\n }\n vector know(n,vector<int>());\n for(int i=0;i<n;i++){\n int m;\n cin >> m;\n for(int j=0;j<m;j++){\n int x;\n cin >> x;\n know[i].push_back(x);\n }\n }\n\n int k;\n cin >> k;\n\n vector<int> known(k);\n for(int i=0;i<k;i++){\n cin >> known[i];\n }\n\n int hannin = 0;\n int ans = -1;\n int ok = true;\n\n for(int i=0;i<n;i++){\n ok = true;\n for(int j=0;j<k;j++){\n bool exist = false; \n for(int x=0;x<know[i].size();x++){\n if(know[i][x]==known[j]){\n exist = true;\n }\n }\n if(!exist){\n ok = false;\n }\n }\n if(ok){\n hannin++;\n ans = i+1;\n } \n }\n\n if(hannin==1){\n cout << ans << endl;\n }\n else{\n cout << -1 << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3428,"score_of_the_acc":-0.3425,"final_rank":7},{"submission_id":"aoj_2399_9259836","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;\n\nint n;\n\nvoid solve() {\n vector<set<int>> v (n);\n int m;\n rep(i,n) {\n cin >> m;\n int x;\n rep(j,m) {\n cin >> x;\n v[i].insert(x);\n }\n }\n cin >> m;\n vector<int> kk (m);\n rep(i,m) {\n cin >> kk[i];\n }\n\n int sus = -1;\n rep(i,n) {\n rep(j,m) {\n if (v[i].find(kk[j]) == v[i].end()) {\n break;\n }\n if (j == m-1) {\n if (sus>=0) {\n cout << -1 << endl;\n return;\n }\n sus = i+1;\n }\n }\n }\n cout << sus << endl;\n return;\n}\n\nint main() {\n while (true) {\n cin >> n;\n if (n == 0) {\n return 0;\n }\n solve();\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3760,"score_of_the_acc":-1.6693,"final_rank":18},{"submission_id":"aoj_2399_8978594","code_snippet":"// (◕ᴗ◕✿)\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = 3.141592653589793;\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nint solve(int N){\n vvi know(N, vi(N, 0));\n rep(i, N){\n int M; cin >> M;\n rep(j, M){\n int p; cin >> p; p--;\n know[i][p] = 1;\n }\n }\n int K; cin >> K;\n vi L(K); rep(i, K) cin >> L[i];\n rep(i, K) L[i]--;\n vi cand;\n rep(i, N){\n bool flag = true;\n for (auto l : L) if (!know[i][l]) flag = false;\n if (flag) cand.push_back(i + 1);\n }\n if (len(cand) == 1) return cand[0];\n return -1;\n}\n\nint main(){\n vc<int> ans;\n while (true){\n int N; cin >> N;\n if (N == 0) break;\n ans.push_back(solve(N));\n }\n for (auto x : ans) cout << x << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3496,"score_of_the_acc":-0.4094,"final_rank":10},{"submission_id":"aoj_2399_8975291","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n while (true) {\n int n;\n cin >> n;\n\n if (n == 0) {\n break;\n }\n\n int memo[n][101];\n memset(memo, 0, sizeof(memo));\n for (int i = 0; i < n; i++) {\n int m;\n cin >> m;\n for (int j = 0; j < m; j++) {\n int p;\n cin >> p;\n memo[i][p] = 1;\n }\n }\n\n int k;\n cin >> k;\n int l[k];\n for (int i = 0; i < k; i++) {\n cin >> l[i];\n }\n\n int ans = -1;\n for (int i = 0; i < n; i++) {\n bool ok = true;\n for (int j = 0; j < k; j++) {\n if (!memo[i][l[j]]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n if (ans == -1) {\n ans = i+1;\n } else {\n ans = -1;\n break;\n }\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3472,"score_of_the_acc":-0.3858,"final_rank":9},{"submission_id":"aoj_2399_8571395","code_snippet":"#include <bits/stdc++.h>\n\nbool solve() {\n int n; std::cin >> n;\n if (n == 0) return false;\n std::vector P(n, std::vector<bool>(n));\n std::vector<int> know(n);\n for (int i{} ; i < n ; i++) {\n int m; std::cin >> m;\n for (int j{} ; j < m ; j++) {\n int v; std::cin >> v;\n P[i][v - 1] = true;\n know[v - 1]++;\n }\n }\n int m; std::cin >> m;\n std::vector<int> flow(m);\n for (auto& f : flow) {\n std::cin >> f;\n f--;\n }\n std::vector<bool> all(n);\n for (int i{} ; i < n ; i++) {\n bool ok{true};\n for (auto f : flow) ok &= P[i][f];\n all[i] = ok;\n }\n int count{(int)std::count(all.begin(), all.end(), true)};\n if (count != 1) {\n std::cout << -1 << '\\n';\n return true;\n }\n bool only{};\n for (auto f : flow) only |= know[f] == 1;\n if (only) {\n int ans{(int)(std::find(all.begin(), all.end(), true) - all.begin())};\n ans++;\n std::cout << ans << '\\n';\n }\n else {\n std::cout << -1 << '\\n';\n }\n return true;\n}\n\nint main() {\n for (int i{} ; solve() ; i++) {\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3364,"score_of_the_acc":-0.2795,"final_rank":3},{"submission_id":"aoj_2399_8570919","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n bool B[100][100] = {};\n for (int i =0; i < N; i++) {\n int M;\n cin >> M;\n for (int j =0; j < M; j++) {\n int K;\n cin >> K;\n K--;\n B[K][i] = true;\n }\n }\n bool ANS[100] = {};\n for (int i =0; i < N; i++) ANS[i] = true;\n int L;\n cin >> L;\n for (int i = 0; i < L; i++) {\n int H;\n cin >> H;\n H--;\n for (int j =0; j < N; j++) {\n if (!B[H][j]) ANS[j] = false;\n }\n }\n int COUNT = 0;\n for (int i = 0; i < N; i++) if (ANS[i]) COUNT++;\n if (COUNT == 1) {\n for (int i = 0; i < N; i++) if (ANS[i]) cout << i + 1 << endl;\n }\n else {\n cout << -1 << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3080,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2399_8528307","code_snippet":"#include <bits/stdc++.h>\n\nint solve() {\n using State = std::bitset<100>;\n int n;\n std::cin >> n;\n if (n == 0) return 1;\n std::vector<State> states(n + 1);\n\n for (int i = 0; i < n + 1; i++) {\n int m;\n std::cin >> m;\n while (m--) {\n int j;\n std::cin >> j;\n j--;\n states[i].set(j);\n }\n }\n\n // for (int i = 0; i < n; i++) {\n // for (int j = 0; j < n; j++) {\n // std::cerr << states[i][j] << ' ' ;\n // }\n // std::cerr << std::endl;\n // }\n\n int ans = -1;\n for (int i = 0; i < n; i++) {\n if ((states[i] & states[n]) == states[n]) {\n if (ans != -1) {\n std::cout << -1 << std::endl;\n return 0;\n }\n ans = i + 1;\n }\n }\n std::cout << ans << std::endl;\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3372,"score_of_the_acc":-0.2874,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2399_10852712\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#define rep(i,n) for(int i = 0; i < n; ++i)\\n#define all(x) x.begin(), x.end()\\n#define X firsst\\n#define Y second\\n#define pb push_back\\nusing namespace std;\\n\\nint main(void){\\n int n;\\n while(cin >> n && n){\\n int m, t, k;\\n vector<int> ss[128];\\n rep(i,n){\\n cin >> m;\\n rep(j,m){\\n cin >> t;\\n t--;\\n ss[t].pb(i);\\n }\\n }\\n// rep(i,n){\\n// rep(j,ss[i].size()){\\n// cout << ss[i][j] << \\\"<\\\";\\n// }\\n// cout << endl;\\n// }\\n cin >> k;\\n int used[128]={0};\\n rep(i,k){\\n cin >> t;\\n t--;\\n rep(j, ss[t].size()){\\n used[ss[t][j]]++;\\n }\\n }\\n int index = -1;\\n rep(i,n){\\n if(used[i] == k){\\n if(index == -1){\\n index = i;\\n }else{\\n index = -2;\\n }\\n }\\n }\\n if(index < 0){\\n cout << -1 << endl;\\n }else{\\n cout << index+1 << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.4409,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2399_10609742\",\n \"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, const A &r) {\\n if(l < r)\\n l = r;\\n}\\n\\nll mod = 998244353;\\n\\nll n;\\nvoid input() { cin >> n; }\\n\\nvoid solve() {\\n vector<set<ll>> know(n);\\n for(int i = 0; i < n; i++) {\\n ll a;\\n cin >> a;\\n for(int j = 0; j < a; j++) {\\n ll b;\\n cin >> b;\\n know[i].insert(b);\\n }\\n }\\n ll a;\\n cin >> a;\\n set<ll> sh;\\n for(int i = 0; i < n; i++)\\n sh.insert(i);\\n for(int i = 0; i < a; i++) {\\n ll b;\\n cin >> b;\\n for(int j = 0; j < n; j++) {\\n if(know[j].count(b) == 0)\\n sh.erase(j);\\n }\\n }\\n cout << (sh.size() == 1 ? *sh.begin() + 1 : -1) << endl;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n while(1) {\\n input();\\n if(n == 0)\\n break;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.6929,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2399_10599238\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int N;\\n cin >> N;\\n if (N == 0) return false;\\n vector<set<int>> S(N);\\n for (int i = 0; i < N; i++) {\\n int M;\\n cin >> M;\\n while (M--) {\\n int a;\\n cin >> a;\\n S[i].insert(a);\\n }\\n }\\n int K;\\n cin >> K;\\n vector<int> A(K);\\n for (int i = 0; i < K; i++) cin >> A[i];\\n int ans = -1;\\n for (int i = 0; i < N; i++) {\\n auto T = S[i];\\n bool ok = true;\\n for (int a : A) {\\n if (T.find(a) == T.end()) ok = false;\\n }\\n if (ok) {\\n if (ans != -1) {\\n ans = -1;\\n break;\\n }\\n ans = i + 1;\\n }\\n }\\n cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.874,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2399_10571981\",\n \"code_snippet\": \"// AOJ 2399 - Save Your Privacy!\\n// JAG Practice Contest for Japan Domestic 2012 - Problem A\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solving() {\\n int N; cin >> N;\\n if(N == 0) return false;\\n\\n vector<set<int>> know(N);\\n for(int i=0; i<N; ++i) {\\n int M; cin >> M;\\n for(int j=0; j<M; ++j) {\\n int p; cin >> p;\\n know[i].insert(p);\\n }\\n }\\n int K; cin >> K;\\n vector<int> leaked(K);\\n for(int i=0; i<K; ++i) cin >> leaked[i];\\n\\n vector<bool> sus(N, true);\\n for(int i=0; i<K; ++i) {\\n for(int j=0; j<N; ++j) {\\n if(!know[j].count(leaked[i])) sus[j] = false;\\n }\\n }\\n int culprit = -1;\\n for(int i=0; i<N; ++i) {\\n if(sus[i]) {\\n if(culprit == -1) culprit = i+1;\\n else {\\n cout << -1 << endl;\\n return true;\\n }\\n }\\n }\\n cout << culprit << endl;\\n return true;\\n}\\n\\nint main() {\\n while(solving()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -1.7874,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2399_10496669\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n while (true) {\\n int N;\\n cin >> N;\\n if (N == 0) break;\\n\\n vector<vector<int>> list;\\n for (int i = 0; i < N; i++) {\\n int n2;\\n cin >> n2;\\n vector<int> arr(n2);\\n for (int j = 0; j < n2; j++) {\\n cin >> arr[j];\\n arr[j]--; // Adjusting to 0-based index\\n }\\n list.push_back(arr);\\n }\\n\\n int K;\\n cin >> K;\\n if (K == 0) {\\n cout << -1 << endl;\\n continue;\\n }\\n\\n vector<int> checkarr(K);\\n for (int i = 0; i < K; i++) {\\n cin >> checkarr[i];\\n checkarr[i]--; // Adjusting to 0-based index\\n }\\n\\n int ans = -1;\\n bool doublefound = false;\\n for (int i = 0; i < list.size(); i++) {\\n if (doublefound) break;\\n vector<int>& arr2 = list[i];\\n int cursol = 0;\\n for (int j = 0; j < arr2.size(); j++) {\\n if (arr2[j] == checkarr[cursol]) {\\n cursol++;\\n j = -1; // Reset j to start from the beginning\\n if (cursol == K) {\\n if (ans == -1) {\\n ans = i + 1; // Convert to 1-based index\\n } else {\\n doublefound = true;\\n }\\n break;\\n }\\n }\\n }\\n }\\n\\n if (doublefound) {\\n cout << -1 << endl;\\n } else {\\n cout << ans << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.4331,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2399_10416721\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\\n#define rep2(i, a, b) rep3(i, a, b, 1)\\n#define rep1(i, n) rep2(i, 0, n)\\n#define rep0(n) rep1(aaaaa, n)\\n#define ov4(a, b, c, d, name, ...) name\\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\\n#define fore(e, v) for (auto&& e : v)\\n#define all(a) begin(a), end(a)\\n#define sz(a) (int)(size(a))\\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\\n#define eb emplace_back\\n\\ntemplate <typename T, typename S>\\nbool chmin(T& a, const S& b) {\\n return a > b ? a = b, 1 : 0;\\n}\\ntemplate <typename T, typename S>\\nbool chmax(T& a, const S& b) {\\n return a < b ? a = b, 1 : 0;\\n}\\nconst int INF = 1e9 + 100;\\nconst ll INFL = 3e18 + 100;\\n#define i128 __int128_t\\nstruct _ {\\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\\n} __;\\n\\nvoid solve();\\nint main(){\\n while(1)solve();\\n}\\n\\nvoid solve(){\\n int N;\\n cin>>N;\\n if(N==0)exit(0);\\n vector<set<int>> A(N);\\n rep(i,N){\\n int M;\\n cin>>M;\\n rep(M){\\n int t;\\n cin>>t;\\n A[i].insert(t);\\n }\\n }\\n int K;\\n cin>>K;\\n vi X(K);\\n fore(i,X)cin>>i;\\n vi ans;\\n rep(i,N){\\n bool ok=1;\\n fore(j,X){\\n if(!A[i].contains(j))ok=0;\\n }\\n if(ok)ans.eb(i+1);\\n }\\n if(sz(ans)!=1)cout<<\\\"-1\\\\n\\\";\\n else cout<<ans[0]<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.874,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2399_10404490\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace atcoder;\\nusing namespace std;\\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\\n#define OVERLOAD_REP(_1, _2, _3, _4, 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, n) for (ll i=a;i<n;i++)\\n#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\\n#define RREP1(n) for(ll i=n;i>=0;i--)\\n#define RREP2(i, n) for(ll i=n;i>=0;i--)\\n#define RREP3(i, a, n) for(ll i=n;i>=a;i--)\\n#define RREP4(i, a, b, n) for(ll i=n;i>=a;i-=b)\\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define foa(a,v) (auto& a : (v))\\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define len(n) (long long)(n).size()\\n#define pb push_back\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vs = vector<string>;\\nusing vvs = vector<vs>;\\nusing vvvs = vector<vvs>;\\nusing vld = vector<ld>;\\nusing vvld = vector<vld>;\\nusing vvvld = vector<vvld>;\\nusing vc = vector<char>;\\nusing vvc = vector<vc>;\\nusing vvvc = vector<vvc>;\\nusing pll = pair<ll,ll>;\\nusing vpll = vector<pll>;\\ntemplate<class... T>\\nconstexpr auto min(T... a){\\n return min(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate<class... T>\\nconstexpr auto max(T... a){\\n return max(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate<class... T>\\nvoid input(T&... a){\\n (cin >> ... >> a);\\n}\\nll modpow(ll a,ll b,ll c){\\n ll ans = 1;\\n while (b){\\n if (b & 1){\\n ans *= a;\\n ans %= c;\\n }\\n a *= a;\\n a %= c;\\n b /= 2;\\n }\\n return ans;\\n}\\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define PLL(name) pll name;cin>>name.first>>name.second;\\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\\n\\nvoid print(){cout << \\\"\\\\n\\\";}\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\nvoid print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\n\\n\\n\\nint main(){\\n while(1){\\n LL(n);\\n if(n == 0){break;}\\n vector<set<ll>> a(n);\\n rep(i,n){\\n LL(m);\\n VLL(b,m);\\n for(auto x:b){\\n a[i].emplace(x);\\n }\\n }\\n LL(k);\\n VLL(c,k);\\n auto solve = [&](){\\n ll ans = -1;\\n rep(i,n){\\n ll cnt = 0;\\n rep(j,k){\\n if(a[i].count(c[j])){\\n cnt++;\\n }\\n }\\n if(cnt == k){\\n if(ans != -1){\\n print(-1);\\n return;\\n }\\n ans = i+1;\\n }\\n }\\n print(ans);\\n\\n };\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -1,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2399_9402917\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n while (1) {\\n int N;\\n cin >> N;\\n if (N == 0) {\\n break;\\n }\\n vector<int> M(N);\\n vector<set<int>> st(N);\\n for (int i = 0; i < N; i++) {\\n cin >> M[i];\\n for (int j = 0; j < M[i]; j++) {\\n int p;\\n cin >> p;\\n st[i].insert(p);\\n }\\n }\\n int K;\\n cin >> K;\\n vector<int> l(K);\\n for (int i = 0; i < K; i++) {\\n cin >> l[i];\\n }\\n int ans = -1;\\n for (int i = 0; i < N; i++) {\\n int cnt = 0;\\n for (int j = 0; j < K; j++) {\\n if (st[i].count(l[j])) {\\n cnt++;\\n }\\n }\\n if (cnt == K) {\\n if (ans == -1) {\\n ans = i + 1;\\n } else {\\n ans = -1;\\n break;\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3800,\n \"score_of_the_acc\": -1.7087,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2399_9373006\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,j,n) for (long long i = j; i < (int)(n); i++)\\n#define REP(i,j,n) for (long long i = j; i <= (int)(n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n#define all(x) (x.begin(), x.end())\\ntemplate<typename T1, typename T2> inline bool chmax(T1 &a, T2 b){\\n bool compare = (a < b);\\n if(compare) a = b;\\n return compare;\\n}\\ntemplate<typename T1, typename T2> inline bool chmin(T1 &a, T2 b){\\n bool compare = (a > b);\\n if(compare) a = b;\\n return compare;\\n}\\nstring substrback(string s,size_t p,size_t l){\\n\\t//s=文字列 p=後ろから数えて何文字目 l=pから何文字目まで\\n\\tconst size_t strl = s.length();\\n\\treturn s.substr(strl - p,l);\\n}\\n//pair型のfirstで比較\\nbool comparePairs(const pair<ll,ll> &a, const pair<ll,ll> &b){\\n\\tif(a.first != b.first)\\n\\treturn a.first<b.first;\\n\\treturn a.second < b.second;\\n}\\n//pair型のsecondで比較\\nbool comparePairs2(const pair<ll,ll> &a, const pair<ll,ll> &b){\\n\\tif(a.second != b.second)\\n\\treturn a.second<b.second;\\n\\treturn a.first < b.first;\\n}\\n//pair型の１.second と2.firstをつなげていく\\nbool customsort(const pair<ll,ll> &a,const pair<ll,ll> &b){\\n\\tif(a.second == b.first){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\nbool customsort2(const pair<ll, ll> &a, const pair<ll, ll> &b) {\\n // 特定の値がfirstに出た場合、そのsecond値を先頭に持ってくる\\n if (a.first == -1) {\\n return true;\\n } else if (b.first == -1) {\\n return false;\\n }\\n return a.first < b.first;\\n}\\n\\n//nの階乗\\null facto(ll n){\\n\\tif (n==0 || n ==1){\\n\\t\\treturn 1;\\n\\t} else {\\n\\t\\treturn n *facto(n-1);\\n\\t}\\n}\\n//nのΣ\\nll sum(ll n) {\\n\\tll sum =0;\\n\\tsum = n*(n+1)/2;\\n\\treturn sum;\\n}\\nstruct V {\\n\\tint a, b;\\n};\\nbool acom(const V& a, const V& b) {\\n\\treturn a.a < b.a;\\n}\\nbool bcom(const V& a, const V& b) {\\n\\treturn a.b < b.b;\\n}\\nbool isPrime(ll num){\\n\\tif(num==1)return false;\\n\\tif(num==2)return true;\\n\\tif(num % 2 == 0)return false;\\n\\tfor(ll i =3;i*i<=num;i+=2){\\n\\t\\tif(num % i == 0)return false;\\n\\t}\\n\\treturn true;\\n}\\nint gcd(int a, int b){\\n\\tif(a%b==0) return b;\\n\\telse return gcd(b, a%b);\\n}\\n/*\\nint main() {\\n\\tll n,m;\\n\\tcin>>n>>m;\\n\\tfor (ll i = (ll) sqrt(m) + 1; i >= 2; i--) {\\n\\t\\twhile(true) {\\n\\t\\t\\tif (n % i == 0 && m % i == 0) {\\n\\t\\t\\t\\tm /= i;\\n\\t\\t\\t\\tn /= i;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll g = gcd(n,m);\\n\\tn/=g; m/=g;\\n\\t//cout<<n<<\\\" \\\"<<m<<endl;\\n\\tint maxn =0; int maxm = 0;\\n\\tint n1 =n; int m1 =m;\\n\\twhile(n1>0){\\n\\t\\tchmax(maxn,n1%10);\\n\\t\\tn1/=10;\\n\\t}\\n\\twhile(m1>0){\\n\\t\\tchmax(maxm,m1%10);\\n\\t\\tm1/=10;\\n\\t}\\n\\tll ans = max(n,m);\\n\\tif(ans>10)ans==10;\\n\\tcout<<ans<<endl;\\n}\\n*/\\n//atodekesite\\nunordered_set<ll> primes;\\nvoid bunkai(ll num) {\\n\\tcout<<num<<endl;\\n\\tif(num==1)return;\\n\\tif(num==2) {\\n\\t\\tprimes.insert(2);\\n\\t\\tbunkai(num/2);\\n\\t}\\n\\tif(num % 2 == 0)return;\\n\\tfor(ll i =3;i*i<=num;i+=2){\\n\\t\\tif(num % i == 0) {\\n\\t\\t\\tprimes.insert(i);\\n\\t\\t\\tbunkai(num/i);\\n\\t\\t} else {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n}\\nvector<bool> temp;\\nbool solve() {\\n int n;\\n cin>>n;\\n if (n==0) return false;\\n vector<vector<bool>> m(n);\\n temp = vector<bool>(n);\\n rep(i,0,n) temp[i] = false;\\n rep(i,0,n) m[i]=temp;\\n rep(i,0,n) {\\n int k;\\n cin>>k;\\n rep(j,0,k) {\\n int x;\\n cin>>x;\\n x--;\\n m[i][x]=true;\\n }\\n }\\n int z;\\n cin>>z;\\n vector<bool> flags(n);\\n rep(i, 0, n) flags[i]= true;\\n rep(i, 0, z) {\\n int x;\\n cin>>x;\\n x--;\\n rep(j, 0, n) {\\n if (!m[j][x]) flags[j] = false;\\n }\\n }\\n int ans = -1;\\n int size = 0;\\n rep(i, 0, n) {\\n if (flags[i]) {\\n size++;\\n ans = i;\\n }\\n }\\n if (size != 1) {\\n cout<<-1<<endl;\\n } else {\\n cout<<ans+1<<endl;\\n }\\n return true;\\n}\\nint main(){\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.1457,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2399_9372999\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nstruct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n\\n#define rep(i, x, limit) for (ll i = (ll)x; i < (ll)limit; i++)\\n#define REP(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; i++)\\n#define all(x) x.begin(), x.end()\\n#define rall(x) x.rbegin(), x.rend()\\n#define el '\\\\n'\\n#define spa \\\" \\\"\\n#define Yes cout << \\\"Yes\\\" << el\\n#define No cout << \\\"No\\\" << el\\n#define YES cout << \\\"YES\\\" << el\\n#define NO cout << \\\"NO\\\" << el\\n#define eps (1e-10)\\n#define Equals(a,b) (fabs((a) - (b)) < eps )\\n#define debug(x) cerr << #x << \\\" = \\\" << x << el\\n\\nconst double pi = 3.141592653589793238;\\nconst int inf = 1073741823;\\nconst ll infl = 1LL << 60;\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\ntemplate<typename T1, typename T2>\\nstd::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){\\n os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";\\n return os;\\n}\\n\\n// 配列の要素を空白区切りで出力 第二引数をtrueにすると改行区切り\\ntemplate<typename T> inline void print_vec(const vector<T> &v, bool split_line=false) {\\n if(v.empty()){\\n cout << \\\"This vector is empty.\\\" << el;\\n return;\\n }\\n bool isValue = (is_integral<T>::value);\\n for (int i = 0; i < (int)v.size(); i++) {\\n if(isValue && (v[i]==inf || v[i]==infl)) cout << 'x' << \\\" \\\\n\\\"[split_line || i+1==(int)v.size()];\\n else cout << v[i] << \\\" \\\\n\\\"[split_line || i+1==(int)v.size()];\\n }\\n}\\n\\ntemplate<typename T1, typename T2> inline void print_vec(const vector<pair<T1,T2>> &v, bool split_line=false){\\n if(v.empty()){\\n cout << \\\"This vector is empty.\\\" << el;\\n return;\\n }\\n for(int i = 0; i < (int)v.size(); i++){\\n cout << '{';\\n auto p = v[i];\\n pair<bool,bool> isValue = {is_integral<T1>::value, is_integral<T2>::value};\\n if(isValue.first && (p.first==inf || p.first==infl)) cout << \\\"x,\\\";\\n else cout << p.first << ',';\\n if(isValue.second && (p.second==inf || p.second==infl)) cout << 'x';\\n else cout << p.second;\\n cout << \\\"}\\\" << \\\" \\\\n\\\"[split_line || i+1==(int)v.size()];\\n }\\n}\\n\\ntemplate<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {\\n bool compare = a < b;\\n if(compare) a = b;\\n return compare;\\n}\\ntemplate<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {\\n bool compare = a > b;\\n if(compare) a = b;\\n return compare;\\n}\\n\\n// std::chronoを利用した時間計測用クラス\\nclass Timer{\\n chrono::system_clock::time_point start;\\n public:\\n Timer() : start(chrono::system_clock::now()) {}\\n \\n double count(){\\n chrono::duration<double> Time_ = chrono::system_clock::now() - start;\\n return Time_.count();\\n }\\n\\n bool is_under(double x){\\n return (this -> count()) < x;\\n }\\n};\\n\\nint main(){\\n while(true){\\n int n;\\n cin >> n;\\n if(n==0) break;\\n vector<int> m(n);\\n vector<vector<int>> p(n,vector<int>());\\n rep(i,0,n){\\n cin >> m[i];\\n rep(j,0,m[i]){\\n int x;\\n cin >> x;\\n p[i].emplace_back(x);\\n }\\n }\\n int k;\\n cin >> k;\\n vector<int> l(k);\\n rep(i,0,k) cin >> l[i];\\n int idx = -1;\\n rep(i,0,n){\\n set<int> se;\\n rep(j,0,m[i]) se.insert(p[i][j]);\\n bool isok = true;\\n rep(j,0,k){\\n if(!se.count(l[j])) isok=false;\\n }\\n if(isok){\\n if(idx!=-1){\\n idx = -1;\\n break;\\n }\\n idx = i+1;\\n }\\n }\\n cout << idx << el;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.3228,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2399_9372937\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\nusing ll = long long;\\n#define all(x) x.begin(), x.end()\\ntemplate <class A, class B>\\ninline bool chmin(A &a, const B &b) {\\n return b < a && (a = b, true);\\n}\\ntemplate <class A, class B>\\ninline bool chmax(A &a, const B &b) {\\n return b > a && (a = b, true);\\n}\\n\\nint solve() {\\n int n;\\n cin >> n;\\n if (n == 0) return 1;\\n vector s(n, vector<bool>(n));\\n rep(i, n) {\\n int m;\\n cin >> m;\\n rep(j, m) {\\n int v;\\n cin >> v;\\n v--;\\n s[i][v] = true;\\n }\\n }\\n vector<bool> t(n);\\n int k;\\n cin >> k;\\n rep(i, k) {\\n int v;\\n cin >> v;\\n v--;\\n t[v] = true;\\n }\\n int count = 0;\\n int tar = 0;\\n rep(i, n) {\\n bool ok = true;\\n rep(j, n) ok &= (!t[j] || s[i][j]);\\n if (ok) {\\n count++;\\n tar = i;\\n }\\n }\\n cout << (count == 1 ? tar + 1 : -1) << endl;\\n return 0;\\n}\\n\\nint main() {\\n while (!solve())\\n ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.3031,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2399_9372875\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nbool solve() {\\n int N;\\n std::cin >> N;\\n if (N == 0) return false;\\n std::vector<std::set<int>> A(N);\\n for (int i{} ; i < N ; i++) {\\n int M;\\n std::cin >> M;\\n for (int j{} ; j < M ; j++) {\\n int p;\\n std::cin >> p;\\n A[i].insert(p);\\n }\\n }\\n int K;\\n std::cin >> K;\\n std::vector<int> L(K);\\n for (auto& l : L) std::cin >> l;\\n int cnt{}, pos{-1};\\n for (int i{} ; i < N ; i++) {\\n bool ok{true};\\n for (auto l : L) ok &= A[i].find(l) != A[i].end();\\n if (ok) {\\n cnt++;\\n pos = i + 1;\\n }\\n }\\n if (cnt == 1) {\\n std::cout << pos << '\\\\n';\\n }\\n else {\\n std::cout << -1 << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3868,\n \"score_of_the_acc\": -0.7756,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2399_9331547\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n\\nint main(){\\n while(true){\\n int N;\\n cin >> N;\\n if(N==0)break;\\n vector<vector<int>>p(N,vector<int>(0));\\n vector<int>M(N);\\n for(int i=0;i<N;i++){\\n cin >> M[i];\\n for(int j=0;j<M[i];j++){\\n int x;\\n cin >> x;\\n p[i].push_back(x);\\n }\\n }\\n\\n int K;\\n cin >> K;\\n vector<int>l(K);\\n for(int i=0;i<K;i++){\\n cin >> l[i];\\n }\\n int pos;\\n int cnt2=0;\\n for(int i=0;i<N;i++){\\n int cnt=0;\\n for(int j=0;j<K;j++){\\n if(find(p[i].begin(),p[i].end(),l[j])!=p[i].end()){\\n cnt++;\\n }\\n }\\n if(cnt==K){\\n cnt2++;\\n pos=i+1;\\n }\\n }\\n if(cnt2==1)cout << pos << endl;\\n else cout << -1 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.3504,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2399_9309898\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\\nconst long long MOD1 = 1000000007;\\nconst long long MOD2 = 998244353;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst long long INF = 1e17;\\n\\nint main(){\\n while(true){\\n int n;\\n cin >> n;\\n if(n==0){\\n break;\\n }\\n vector know(n,vector<int>());\\n for(int i=0;i<n;i++){\\n int m;\\n cin >> m;\\n for(int j=0;j<m;j++){\\n int x;\\n cin >> x;\\n know[i].push_back(x);\\n }\\n }\\n\\n int k;\\n cin >> k;\\n\\n vector<int> known(k);\\n for(int i=0;i<k;i++){\\n cin >> known[i];\\n }\\n\\n int hannin = 0;\\n int ans = -1;\\n int ok = true;\\n\\n for(int i=0;i<n;i++){\\n ok = true;\\n for(int j=0;j<k;j++){\\n bool exist = false; \\n for(int x=0;x<know[i].size();x++){\\n if(know[i][x]==known[j]){\\n exist = true;\\n }\\n }\\n if(!exist){\\n ok = false;\\n }\\n }\\n if(ok){\\n hannin++;\\n ans = i+1;\\n } \\n }\\n\\n if(hannin==1){\\n cout << ans << endl;\\n }\\n else{\\n cout << -1 << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.3425,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2399_9259836\",\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;\\n\\nint n;\\n\\nvoid solve() {\\n vector<set<int>> v (n);\\n int m;\\n rep(i,n) {\\n cin >> m;\\n int x;\\n rep(j,m) {\\n cin >> x;\\n v[i].insert(x);\\n }\\n }\\n cin >> m;\\n vector<int> kk (m);\\n rep(i,m) {\\n cin >> kk[i];\\n }\\n\\n int sus = -1;\\n rep(i,n) {\\n rep(j,m) {\\n if (v[i].find(kk[j]) == v[i].end()) {\\n break;\\n }\\n if (j == m-1) {\\n if (sus>=0) {\\n cout << -1 << endl;\\n return;\\n }\\n sus = i+1;\\n }\\n }\\n }\\n cout << sus << endl;\\n return;\\n}\\n\\nint main() {\\n while (true) {\\n cin >> n;\\n if (n == 0) {\\n return 0;\\n }\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -1.6693,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2399_8978594\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = 3.141592653589793;\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\nint solve(int N){\\n vvi know(N, vi(N, 0));\\n rep(i, N){\\n int M; cin >> M;\\n rep(j, M){\\n int p; cin >> p; p--;\\n know[i][p] = 1;\\n }\\n }\\n int K; cin >> K;\\n vi L(K); rep(i, K) cin >> L[i];\\n rep(i, K) L[i]--;\\n vi cand;\\n rep(i, N){\\n bool flag = true;\\n for (auto l : L) if (!know[i][l]) flag = false;\\n if (flag) cand.push_back(i + 1);\\n }\\n if (len(cand) == 1) return cand[0];\\n return -1;\\n}\\n\\nint main(){\\n vc<int> ans;\\n while (true){\\n int N; cin >> N;\\n if (N == 0) break;\\n ans.push_back(solve(N));\\n }\\n for (auto x : ans) cout << x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.4094,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2399_8975291\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n while (true) {\\n int n;\\n cin >> n;\\n\\n if (n == 0) {\\n break;\\n }\\n\\n int memo[n][101];\\n memset(memo, 0, sizeof(memo));\\n for (int i = 0; i < n; i++) {\\n int m;\\n cin >> m;\\n for (int j = 0; j < m; j++) {\\n int p;\\n cin >> p;\\n memo[i][p] = 1;\\n }\\n }\\n\\n int k;\\n cin >> k;\\n int l[k];\\n for (int i = 0; i < k; i++) {\\n cin >> l[i];\\n }\\n\\n int ans = -1;\\n for (int i = 0; i < n; i++) {\\n bool ok = true;\\n for (int j = 0; j < k; j++) {\\n if (!memo[i][l[j]]) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n if (ans == -1) {\\n ans = i+1;\\n } else {\\n ans = -1;\\n break;\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.3858,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2399_8571395\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nbool solve() {\\n int n; std::cin >> n;\\n if (n == 0) return false;\\n std::vector P(n, std::vector<bool>(n));\\n std::vector<int> know(n);\\n for (int i{} ; i < n ; i++) {\\n int m; std::cin >> m;\\n for (int j{} ; j < m ; j++) {\\n int v; std::cin >> v;\\n P[i][v - 1] = true;\\n know[v - 1]++;\\n }\\n }\\n int m; std::cin >> m;\\n std::vector<int> flow(m);\\n for (auto& f : flow) {\\n std::cin >> f;\\n f--;\\n }\\n std::vector<bool> all(n);\\n for (int i{} ; i < n ; i++) {\\n bool ok{true};\\n for (auto f : flow) ok &= P[i][f];\\n all[i] = ok;\\n }\\n int count{(int)std::count(all.begin(), all.end(), true)};\\n if (count != 1) {\\n std::cout << -1 << '\\\\n';\\n return true;\\n }\\n bool only{};\\n for (auto f : flow) only |= know[f] == 1;\\n if (only) {\\n int ans{(int)(std::find(all.begin(), all.end(), true) - all.begin())};\\n ans++;\\n std::cout << ans << '\\\\n';\\n }\\n else {\\n std::cout << -1 << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n for (int i{} ; solve() ; i++) {\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.2795,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2399_8570919\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n while(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n bool B[100][100] = {};\\n for (int i =0; i < N; i++) {\\n int M;\\n cin >> M;\\n for (int j =0; j < M; j++) {\\n int K;\\n cin >> K;\\n K--;\\n B[K][i] = true;\\n }\\n }\\n bool ANS[100] = {};\\n for (int i =0; i < N; i++) ANS[i] = true;\\n int L;\\n cin >> L;\\n for (int i = 0; i < L; i++) {\\n int H;\\n cin >> H;\\n H--;\\n for (int j =0; j < N; j++) {\\n if (!B[H][j]) ANS[j] = false;\\n }\\n }\\n int COUNT = 0;\\n for (int i = 0; i < N; i++) if (ANS[i]) COUNT++;\\n if (COUNT == 1) {\\n for (int i = 0; i < N; i++) if (ANS[i]) cout << i + 1 << endl;\\n }\\n else {\\n cout << -1 << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2399_8528307\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint solve() {\\n using State = std::bitset<100>;\\n int n;\\n std::cin >> n;\\n if (n == 0) return 1;\\n std::vector<State> states(n + 1);\\n\\n for (int i = 0; i < n + 1; i++) {\\n int m;\\n std::cin >> m;\\n while (m--) {\\n int j;\\n std::cin >> j;\\n j--;\\n states[i].set(j);\\n }\\n }\\n\\n // for (int i = 0; i < n; i++) {\\n // for (int j = 0; j < n; j++) {\\n // std::cerr << states[i][j] << ' ' ;\\n // }\\n // std::cerr << std::endl;\\n // }\\n\\n int ans = -1;\\n for (int i = 0; i < n; i++) {\\n if ((states[i] & states[n]) == states[n]) {\\n if (ans != -1) {\\n std::cout << -1 << std::endl;\\n return 0;\\n }\\n ans = i + 1;\\n }\\n }\\n std::cout << ans << std::endl;\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.2874,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1367,"cells":{"group_id":{"kind":"string","value":"aoj_2400_cpp"},"problem_description":{"kind":"string","value":"You Are the Judge\n審判は君だ！\nEnglish text is not available in this practice contest.\nあなたはプログラミングコンテスト iCPC の審判だ。今日も何事もなく試合が終わり、後は結果を出力するだけだと思いきや、突然システムが停止してしまった！\nこれでは結果が出力できない！ でも、大丈夫。我々にはログがある。\nあなたは優れたプログラマーであり、かつて iCPC で輝かしい成績を残したこともある。\nそこであなたはシステムログから各チームの成績を割り出し、チームの順位表を出力するプログラムを作成することにした。\n入力としてチームの数、問題の数、システムログが与えられる。\nシムテムログは以下の 2 種類のレコードからなる。\nレコード\n内容\n効果\ntID pID time CORRECT\n時刻 time に、チーム tID が 問題 pID に正解するプログラムを送信。\nチーム tID の正解数に1が加算される。\nチーム tID のペナルティに、(チーム tID の問題 pID に対する誤答数*1200+time)が加算される。\n以後, チーム tID の問題 pID に対する解答は棄却され、システムログにも送信履歴が残らない。\ntID pID time WRONG\n時刻 time に、チーム tID が 問題 pID に誤答するプログラムを送信。\nチーム tID の 問題 pID に対する誤答数に1が加算される。\n※上記のシステムログはこの問題のために簡略化されたものであり、本番のICPCで見られるシステムログと異なることに留意せよ\niCPCにおける順位付けのルールは以下の通りである。\nより多くの問題を解いたチームは順位が上になる\n解いた問題が同じ場合、ペナルティの少ないチームのほうが順位が上になる\n解いた問題もペナルティも同じ場合、チーム番号が小さいほうのチームが順位が上になる\n入力より与えられるコンテストの情報・システムログから各チームの成績を割り出し、チームの順位表を出力せよ。\nInput\n入力は複数のデータセットからなる。各データセットは以下の形式で与えられる。\nT\nP\nR\ntID\n1\npID\n1\ntime\n1\nmessage\n1\ntID\n2\npID\n2\ntime\n2\nmessage\n2\n...\ntID\nR\npID\nR\ntime\nR\nmessage\nR\nデータセットの1行目には 参加チーム数 T 、問題数 P、システムログのレコード数 R が含まれる。\n続くR行にはシステムログの各レコードが含まれる。\nシステムログのレコードとして、チーム番号 tID\ni\n、問題番号 pID\ni\n、試合開始からの経過時間 time\ni\n、メッセージの種類 message\ni\nが含まれる。\n入力は以下の制約を満たす。\n1 ≤ T ≤ 50\n1 ≤ P ≤ 10\n1 ≤ R ≤ 500\n1 ≤ tID\ni\n≤ T\n1 ≤ pID\ni\n≤ P\n1 ≤ time\ni\n≤ 10800\nmessage\ni\nは CORRECT, WRONGのいずれか\nシステムログのレコードは、時刻の小さいものから順に与えられ、複数のレコードの時刻が同じになることはない\n入力の終わりはスペースで区切られた3個の0で与えられる。\nOutput\n与えられたシステムログより各チームの成績・順位を割り出し、順位が上のチームから順に、チーム番号、正解数、ペナルティ を出力せよ。\nSample Input\n3 3 5\n3 1 800 WRONG\n1 1 1200 CORRECT\n3 1 1400 CORRECT\n1 2 2400 CORRECT\n1 3 3600 CORRECT\n5 2 5\n3 1 1000 WRONG\n5 2 2000 CORRECT\n3 1 2800 CORRECT\n4 1 4000 CORRECT\n5 1 5000 CORRECT\n6 3 15\n2 1 10 WRONG\n3 3 15 WRONG\n3 3 20 CORRECT\n1 1 50 CORRECT\n4 2 60 WRONG\n1 2 70 WRONG\n4 1 80 CORRECT\n1 2 90 WRONG\n1 2 150 CORRECT\n3 1 160 WRONG\n3 1 180 CORRECT\n3 2 210 WRONG\n5 3 500 CORRECT\n4 2 720 CORRECT\n5 1 1500 CORRECT\n0 0 0\nOutput for Sample Input\n1 3 7200\n3 1 2600\n2 0 0\n5 2 7000\n3 1 4000\n4 1 4000\n1 0 0\n2 0 0\n4 2 2000\n5 2 2000\n1 2 2600\n3 2 2600\n2 0 0\n6 0 0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2400_10612926","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int T, P, R;\n cin >> T >> P >> R;\n if (T == 0 && P == 0 && R == 0) return false;\n vector<vector<bool>> AC(T, vector<bool>(P, false));\n vector<vector<int>> WA(T, vector<int>(P, 0));\n vector<int> cnt(T, 0), time(T, 0);\n while (R--) {\n int t, p, cur;\n string s;\n cin >> t >> p >> cur >> s;\n t--, p--;\n if (AC[t][p]) continue;\n if (s == \"CORRECT\") {\n AC[t][p] = true;\n cnt[t]++;\n time[t] += cur + 1200 * WA[t][p];\n } else {\n WA[t][p]++;\n }\n }\n vector<int> ord(T);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&] (int i, int j) {\n return cnt[i] == cnt[j] ? time[i] == time[j] ? i < j : time[i] < time[j] : cnt[i] > cnt[j];\n });\n for (int i : ord) {\n cout << i + 1 << ' ' << cnt[i] << ' ' << time[i] << '\\n';\n }\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.6796,"final_rank":15},{"submission_id":"aoj_2400_10572012","code_snippet":"// AOJ 2400 - You Are the Judge\n// JAG Practice Contest for Japan Domestic 2012 - Problem B\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nbool solving() {\n int T, P, R; cin >> T >> P >> R;\n if(T == 0) return false;\n\n vector<int> tID(R), pID(R), t(R);\n vector<string> m(R);\n for(int i=0; i<R; ++i) {\n cin >> tID[i] >> pID[i] >> t[i] >> m[i];\n --tID[i]; --pID[i];\n }\n\n vector<vector<int>> WA(T, vector<int>(P));\n vector<pair<pair<int,int>, int>> score(T);\n for(int i=0; i<T; ++i) score[i].second = i+1;\n for(int i=0; i<R; ++i) {\n if(m[i] == \"CORRECT\") {\n --score[tID[i]].first.first;\n score[tID[i]].first.second += t[i] + 1200 * WA[tID[i]][pID[i]];\n } else {\n ++WA[tID[i]][pID[i]];\n }\n }\n sort(score.begin(), score.end());\n for(int i=0; i<T; ++i) {\n cout << score[i].second << ' ' << -score[i].first.first << ' ' << score[i].first.second << endl;\n }\n return true;\n}\n\nint main() {\n while(solving()) {}\n}","accuracy":1,"time_ms":10,"memory_kb":3404,"score_of_the_acc":-0.5534,"final_rank":10},{"submission_id":"aoj_2400_10417846","code_snippet":"#include<atcoder/all>\nusing 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 ans {\n int idx, ac, pena;\n\n bool operator < (const ans &S) const {\n if(ac != S.ac) {\n return ac < S.ac;\n } else if (pena != S.pena) {\n return pena > S.pena;\n } else {\n return idx > S.idx;\n }\n }\n};\n\nvoid solve() {\n int t, p, r;\n cin >> t >> p >> r;\n \n if(t == 0 && p == 0 && r == 0)exit(0);\n \n vector<vector<int>> locked(t, vector<int>(p, 0));\n vector<vector<int>> pen(t, vector<int>(p));\n\n vector<ans> vec(t);\n rep(i, t)vec[i] = {i+1, 0, 0};\n\n rep(i, r) {\n int tid, pid, ti;\n string message;\n cin >> tid >> pid >> ti >> message;\n\n tid--;\n pid--;\n\n if(locked[tid][pid]) {\n continue;\n }\n \n if(message == \"WRONG\") {\n pen[tid][pid]++;\n } else {\n locked[tid][pid] = true;\n\n vec[tid].ac += 1;\n vec[tid].pena += 1200 * pen[tid][pid] + ti;\n }\n }\n\n sort(rall(vec));\n rep(i, t) {\n cout << vec[i].idx << \" \" << vec[i].ac << \" \" << vec[i].pena << endl;\n }\n}\n\nint main() {\n while(true)solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3584,"score_of_the_acc":-0.9903,"final_rank":18},{"submission_id":"aoj_2400_9408186","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n while(true){\n int t,p,r;\n cin>>t>>p>>r;\n if(t==0)break;\n vector<vector<bool>>solved(t,vector<bool>(p,false));\n vector<int>pena(t,0);\n vector<vector<int>>wa(t,vector<int>(p,0));\n while(r--){\n int tid,pid,time;\n string mes;\n cin>>tid>>pid>>time>>mes;\n tid--,pid--;\n if(solved[tid][pid])continue;\n if(mes==\"CORRECT\"){\n solved[tid][pid]=true;\n pena[tid]+=wa[tid][pid]*1200+time;\n }\n else wa[tid][pid]++;\n }\n vector<int>ans(t);\n iota(ans.begin(),ans.end(),0);\n sort(ans.begin(),ans.end(),[&](int l,int r){\n int acl=0,acr=0;\n for(int i=0;i<p;i++){\n acl+=solved[l][i];\n acr+=solved[r][i];\n }\n if(acl!=acr)return acl>acr;\n if(pena[l]!=pena[r])return pena[l]<pena[r];\n return l<r;\n });\n for(int i:ans){\n int ac=0;\n for(int j=0;j<p;j++)ac+=solved[i][j];\n cout<<i+1<<' '<<ac<<' '<<pena[i]<<endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3340,"score_of_the_acc":-0.3981,"final_rank":2},{"submission_id":"aoj_2400_9401718","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nbool compareTeams(const vector<int>& a, const vector<int>& b) {\n if (a[0] != b[0]) {\n return a[0] > b[0];\n }\n if (a[1] != b[1]) {\n return a[1] < b[1];\n }\n return a[2] < b[2];\n}\n\nint main(void)\n{\n int t, p, r;\n while (true)\n {\n cin >> t >> p >> r;\n if (t == 0 && p == 0 && r == 0)\n {\n break;\n }\n\n vector<int> correctCount(t, 0), penalty(t, 0);\n vector<vector<int> > wrongCount(t, vector<int>(p, 0));\n\n for (int i = 0; i < r; i++)\n {\n int teamId, questionId, time;\n string kindAns;\n cin >> teamId >> questionId >> time >> kindAns;\n\n if (kindAns == \"WRONG\")\n {\n wrongCount[teamId - 1][questionId - 1]++;\n }\n else if (kindAns == \"CORRECT\")\n {\n correctCount[teamId - 1]++;\n penalty[teamId - 1] += time + wrongCount[teamId - 1][questionId - 1] * 1200;\n }\n }\n\n vector<vector<int> > teams(t, vector<int>(3));\n\n for (int i = 0; i < t; i++)\n {\n teams[i][0] = correctCount[i];\n teams[i][1] = penalty[i];\n teams[i][2] = i + 1;\n }\n\n sort(teams.begin(), teams.end(), compareTeams);\n\n for (int i = 0; i < t;i++)\n {\n cout << teams[i][2] << \" \" << teams[i][0] << \" \" << teams[i][1] << endl;\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3224,"score_of_the_acc":-1.1165,"final_rank":20},{"submission_id":"aoj_2400_9346599","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing ll = long long;\n#define all(x) x.begin(),x.end()\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\n\nint solve() {\n int T, P, R;\n std::cin >> T >> P >> R;\n if (T == 0) return 1;\n std::vector<int> p(T), c(T);\n std::vector w(T, std::vector<int>(P));\n const int OK = -1;\n for (int i = 0; i < R; i++) {\n int tid, pid, ti;\n std::string mes;\n std::cin >> tid >> pid >> ti >> mes;\n tid--;\n pid--;\n if (w[tid][pid] == OK) continue;\n if (mes == \"CORRECT\") {\n p[tid] += ti + w[tid][pid] * 1200;\n c[tid]++;\n w[tid][pid] = OK;\n } else {\n w[tid][pid]++;\n }\n }\n using Tu = std::tuple<int, int, int>;\n std::vector<Tu> data;\n for (int i = 0; i < T; i++) {\n data.emplace_back(-c[i], p[i], i);\n }\n std::sort(data.begin(), data.end());\n for (int i = 0; i < T; i++) {\n auto [a, b, c] = data[i];\n std::cout << c + 1 << ' ' << -a << ' ' << b << std::endl;\n }\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.6796,"final_rank":15},{"submission_id":"aoj_2400_9334180","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n//#pragma GCC optimize(\"Ofast\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\nusing ll=long long;\n#define overload4(_1, _2, _3, _4, 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 each(i,...) for(auto&& i:__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 all(i) begin(i), end(i)\n#define rall(i) (i).rbegin(), (i).rend()\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define elif else if\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> ll sum(const T& a){ return accumulate(all(a), 0LL); }\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nconst int INF =0x3fffffff;\nconst ll INFll =0x1fffffffffffffff;// 4times ok\nconst int MOD= int(1e9)+7;\nconst int MODD=998244353;\nusing P= pair<int,int>;\nusing Pl= pair<ll,ll>;\nusing ld=long double;\nusing VVl=vector<vector<ll>>;\nusing VVd=vector<vector<ld>>;\nusing Vd=vector<ld>;\nusing tuplis =array<ll, 3>;\nusing quatro=array<ll,4>;\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll four[] = {0, 1, 0, -1, 0};\nconst ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};\nconst ld EPS = 1e-9;\nconst ld PI = 3.1415926535897932;\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){ a%=p; ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll isqr(ll x){ll r=sqrt(x)-1;while((r+1)*(r+1)<=x)r++;return r;}\nvector<ll> divisor(ll x){vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\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#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,size) vector<type> name(size); in(name)\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\n\nbool solve(){\n LL(t,p,r);\n if(t==0)return false;\n vec(Pl,score,t);\n map<Pl,ll>cnt;\n rep(r){\n LL(ti,pi,mi);\n STR(x);\n ll j=0;\n if(x==\"WRONG\")j=1;\n ti--;\n if(j!=0){\n cnt[{ti,pi}]++;\n }\n else{\n score[ti].first++;\n score[ti].second+=mi+cnt[{ti,pi}]*1200;\n }\n }\n vector<tuplis>X;\n rep(t){\n X.push_back({score[i].first,-score[i].second,-i});\n }\n Sort(X);\n Rev(X);\n rep(t){\n out(-X[i][2]+1,X[i][0],-X[i][1]);\n }\n return true;\n}\n\nint main(){\n ll t=1;\n// in(t);\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3588,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_2400_9332223","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n while(true){\n ll T,P,R;\n cin >> T >> P >> R;\n if(T==0&&P==0&&R==0)break;\n vector<ll>tID(R);\n vector<ll>pID(R);\n vector<ll>time(R);\n vector<string>message(R);\n for(ll i=0;i<R;i++){\n cin >> tID[i] >> pID[i] >> time[i] >> message[i];\n }\n\n vector<vector<ll>>WA_cnt(P,vector<ll>(T));\n vector<tuple<ll,ll,ll>>info(T,{0,0,0});\n for(ll i=0;i<T;i++){\n get<2>(info[i])=i;\n }\n for(ll i=0;i<R;i++){\n if(message[i]==\"WRONG\"){\n WA_cnt[pID[i]-1][tID[i]-1]++;\n }else{\n get<0>(info[tID[i]-1])++;\n get<1>(info[tID[i]-1])+=WA_cnt[pID[i]-1][tID[i]-1]*1200+time[i];\n }\n }\n for(ll i=0;i<T;i++){\n get<1>(info[i]) = 100000000-get<1>(info[i]);\n get<2>(info[i]) = 100-get<2>(info[i]);\n }\n\n sort(info.rbegin(),info.rend());\n for(int i=0;i<T;i++){\n cout << 100-get<2>(info[i])+1 << \" \" << get<0>(info[i]) << \" \" << 100000000-get<1>(info[i]) << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3400,"score_of_the_acc":-0.5437,"final_rank":8},{"submission_id":"aoj_2400_9309860","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e17;\n\nint main(){\n while(true){\n int t,p,r;\n cin >> t>>p>>r;\n if(t==0){\n break;\n }\n\n vector<int> tID(r),pID(r),time(r);\n vector<string> message(r);\n\n vector<int> ac(t),pena(t);\n vector wa(t,vector<int>(p));\n\n for(int i=0;i<r;i++){\n int x,y;\n cin >> x >> y;\n x--;\n y--;\n tID[i] = x;\n pID[i] = y;\n cin >> time[i] >> message[i];\n }\n\n for(int i=0;i<r;i++){\n if(wa[tID[i]][pID[i]]==-1)continue;\n if(message[i]==\"CORRECT\"){\n ac[tID[i]]++;\n pena[tID[i]] += wa[tID[i]][pID[i]]*1200 + time[i];\n wa[tID[i]][pID[i]] = -1;\n }\n if(message[i]==\"WRONG\"){\n wa[tID[i]][pID[i]]++;\n }\n }\n\n vector<tuple<int,int,int>> cnt(t);\n for(int i=0;i<t;i++){\n cnt[i] = {-ac[i],pena[i],i};\n }\n sort(cnt.begin(),cnt.end());\n\n for(int i=0;i<t;i++){\n cout << get<2>(cnt[i]) + 1 << ' ' << -get<0>(cnt[i]) << ' ' << get<1>(cnt[i]) <<endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3400,"score_of_the_acc":-0.5437,"final_rank":8},{"submission_id":"aoj_2400_9296564","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (long long i=0;i<n;i++)\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\n#define range(value,range) for(const auto &value : range)\n#define ll long long\n#define vl vector<long long>\n#define vvl vector<vector<long long>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define inf 4000000000000000000LL\n#define mod 998244353\n\nll solve() {\n ll t,p,r;\n cin>>t>>p>>r;\n if(t==0&&p==0&&r==0)return 1;\n\n vvl g(t,vl(p,0));\n vvl ans(t,vl(3,0));\n rep(i,t)ans[i][2]=i+1;\n rep(z,r){\n ll tid,pid,time;\n string mes;\n cin>>tid>>pid>>time>>mes,pid--,tid--;\n if(mes==\"WRONG\"){\n g[tid][pid]++;\n }else{\n ans[tid][0]--;\n ans[tid][1]+=1200*g[tid][pid]+time;\n }\n }\n sort(ans.begin(),ans.end());\n rep(i,t)ans[i][0]*=-1;\n rep(i,t){\n cout<<ans[i][2]<<\" \"<<ans[i][0]<<\" \"<<ans[i][1]<<endl;\n }\n //vvdbg(ans);\n return 0;\n}\nint main(){\n\twhile(1){\n\t\tif(solve()==1)break;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3460,"score_of_the_acc":-0.6893,"final_rank":17},{"submission_id":"aoj_2400_9296550","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (long long i=0;i<n;i++)\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\n#define range(value,range) for(const auto &value : range)\n#define ll long long\n#define vl vector<long long>\n#define vvl vector<vector<long long>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define inf 4000000000000000000LL\n#define mod 998244353\n\nll solve() {\n ll t,p,r;\n cin>>t>>p>>r;\n if(t==0&&p==0&&r==0)return 1;\n\n vvl g(t,vl(p,0));\n vvl ans(t,vl(3,0));\n rep(i,t)ans[i][2]=i+1;\n rep(z,r){\n ll tid,pid,time;\n string mes;\n cin>>tid>>pid>>time>>mes,pid--,tid--;\n if(mes==\"WRONG\"){\n g[tid][pid]++;\n }else{\n ans[tid][0]--;\n ans[tid][1]+=1200*g[tid][pid]+time;\n }\n }\n sort(ans.begin(),ans.end());\n rep(i,t)ans[i][0]*=-1;\n rep(i,t){\n cout<<ans[i][2]<<\" \"<<ans[i][0]<<\" \"<<ans[i][1]<<endl;\n }\n //vvdbg(ans);\n return 0;\n}\nint main(){\n\twhile(1){\n\t\tif(solve()==1)break;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3372,"score_of_the_acc":-0.4757,"final_rank":6},{"submission_id":"aoj_2400_9266063","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nvoid solve(ll t, ll p, ll r){\n vector<ll> ac(t, 0);\n vector<ll> pena(t, 0);\n vector<vector<ll>> wa_cnt(t, vector<ll>(p, 0));\n\n for(int rid = 0; rid < r; rid++){\n ll tid, pid, time; string msg;\n cin >> tid >> pid >> time >> msg;\n tid--; pid--;\n\n if(msg == \"CORRECT\"){\n ac[tid]++;\n pena[tid] += (wa_cnt[tid][pid] * 1200 + time);\n }\n else if(msg == \"WRONG\"){\n wa_cnt[tid][pid]++;\n }\n else{\n cerr << \"Invalid msg\" << endl;\n assert(false);\n }\n }\n\n vector<int> ord(t);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](const auto &p, const auto & q){\n if(ac[p] != ac[q]) return ac[p] > ac[q];\n else if(pena[p] != pena[q]) return pena[p] < pena[q];\n else return p < q;\n });\n\n for(int i = 0; i < ord.size(); i++){\n int tid = ord[i];\n cout << tid+1 << \" \" << ac[tid] << \" \" << pena[tid] << endl;\n }\n}\n\nint main(){\n while(true){\n ll t, p, r; cin >> t >> p >> r;\n if(t == 0 && p == 0 && r == 0) break;\n else solve(t, p, r);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.6505,"final_rank":11},{"submission_id":"aoj_2400_9259857","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;\n\nint t,p,r;\n\nvoid solve() {\n vector<vector<int>> v (t,vector<int> (3));\n map<pair<int,int>,int> mp;\n rep(i,t) {\n v[i][0] = 0;\n v[i][1] = 0;\n v[i][2] = (i+1);\n }\n int tm, te, num;\n string acc;\n rep(w,r) {\n cin >> te >> num >> tm >> acc;\n if (acc == \"CORRECT\") {\n v[te-1][0]--;\n if (mp.find({te,num}) != mp.end()) {\n v[te-1][1] += tm + mp[{te,num}]*1200;\n }\n else {\n v[te-1][1] += tm;\n }\n }\n else {\n mp[{te,num}]++;\n }\n }\n\n sort(all(v));\n rep(i,t) {\n cout << v[i][2] << ' ' << -v[i][0] << ' ' << v[i][1] << endl;\n }\n return;\n}\n\n\n\nint main() {\n while (true) {\n cin >> t >> p >> r;\n if (t == 0) {\n return 0;\n }\n solve();\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3396,"score_of_the_acc":-0.534,"final_rank":7},{"submission_id":"aoj_2400_8978955","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n while (true) {\n int t, p, r;\n cin >> t >> p >> r;\n\n if (t == 0 && p == 0 && r == 0) {\n break;\n }\n\n int tid[r], pid[r], ttime[r];\n string message[r];\n for (int i = 0; i < r; i++) {\n cin >> tid[i] >> pid[i] >> ttime[i] >> message[i];\n }\n\n int acproblem[t+1];\n int waproblem[t+1][p+1];\n int penalty[t+1];\n memset(acproblem, 0, sizeof(acproblem));\n memset(waproblem, 0, sizeof(waproblem));\n memset(penalty, 0, sizeof(penalty));\n for (int i = 0; i < r; i++) {\n if (message[i] == \"CORRECT\") {\n acproblem[tid[i]]++;\n penalty[tid[i]] += waproblem[tid[i]][pid[i]]*1200 + ttime[i];\n } else {\n waproblem[tid[i]][pid[i]]++;\n }\n }\n\n vector<tuple<int, int, int> > viii(t);\n for (int i = 1; i <= t; i++) {\n viii[i-1] = {-acproblem[i], penalty[i], i};\n }\n\n sort(viii.begin(), viii.end());\n\n for (int i = 0; i < t; i++) {\n cout << get<2>(viii[i]) << \" \" << -get<0>(viii[i]) << \" \" << get<1>(viii[i]) << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.466,"final_rank":5},{"submission_id":"aoj_2400_8571505","code_snippet":"#include <bits/stdc++.h>\n\nbool solve() {\n int T, P, R; std::cin >> T >> P >> R;\n if (T == 0 and P == 0 and R == 0) return false;\n\n std::vector<int> count(T), penalty(T);\n std::vector ac(T, std::vector<bool>(P));\n std::vector wa(T, std::vector<int>(P));\n for (int _{} ; _ < R ; _++) {\n int t, p, time; std::cin >> t >> p >> time;\n t--; p--;\n std::string s; std::cin >> s;\n if (ac[t][p]) continue;\n if (s[0] == 'C') {\n ac[t][p] = true;\n count[t]++;\n penalty[t] += time + wa[t][p] * 1200;\n }\n else {\n wa[t][p]++;\n }\n }\n\n std::vector<int> ans(T);\n std::iota(ans.begin(), ans.end(), 0);\n std::sort(ans.begin(), ans.end(), [&](int i, int j) -> bool {\n if (count[i] != count[j]) return count[i] > count[j];\n else if (penalty[i] != penalty[j]) return penalty[i] < penalty[j];\n else return i < j;\n });\n for (int i{} ; i < T ; i++) {\n int v{ans[i]};\n std::cout << v + 1 << ' ' << count[v] << ' ' << penalty[v] << '\\n';\n }\n return true;\n}\n\nint main() {\n for (int i{} ; solve() ; i++) {\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.6505,"final_rank":11},{"submission_id":"aoj_2400_8570949","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n while(1) {\n int T, P, R;\n cin >> T >> P >> R;\n if (T == 0 && P == 0 && R == 0) return 0;\n vector<int> Pena(T,0), AC(T,0);\n vector<vector<int>> WA(T, vector<int>(P, 0));\n for (int i = 0; i < R; i++) {\n int TID, PID, TIME;\n string S;\n cin >> TID >> PID >> TIME >> S;\n TID--, PID--;\n if (S == \"CORRECT\") {\n AC[TID]++;\n Pena[TID]+=WA[TID][PID]*1200+TIME;\n }\n else if (S == \"WRONG\") {\n WA[TID][PID]++;\n }\n }\n vector<pair<int, pair<int, int> > > V;\n for (int i = 0; i < T; i++) V.push_back({P - AC[i], {Pena[i], i}});\n sort(V.begin(), V.end());\n for (int i = 0; i < T; i++) {\n cout << V[i].second.second + 1 << ' ' << P - V[i].first << ' ' << V[i].second.first << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.6505,"final_rank":11},{"submission_id":"aoj_2400_8528323","code_snippet":"#include <bits/stdc++.h>\n\nint solve() {\n int n, m, q;\n std::cin >> n >> m >> q;\n if (n == 0) return 1;\n\n std::vector<std::pair<int, int>> result(n);\n std::vector penalty(n, std::vector<int>(m));\n\n for (int i = 0; i < q; i++) {\n int a, b, t;\n std::string s;\n std::cin >> a >> b >> t >> s;\n a--; b--;\n if (s == \"CORRECT\") {\n result[a].first++;\n result[a].second += penalty[a][b] + t;\n } else {\n penalty[a][b] += 1200;\n }\n }\n\n std::vector<int> ans(n);\n std::iota(ans.begin(), ans.end(), 0);\n std::sort(ans.rbegin(), ans.rend(), \n [&](int lhs, int rhs) {\n auto [la, lb] = result[lhs];\n auto [ra, rb] = result[rhs];\n if (la == ra && lb == rb) {\n return rhs < lhs;\n }\n if (la == ra) {\n return rb < lb;\n }\n return la < ra;\n });\n\n for (auto i: ans) {\n auto [a, b] = result[i];\n std::cout << i + 1 << ' ' << a << ' ' << b << std::endl;\n }\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3360,"score_of_the_acc":-0.4466,"final_rank":3},{"submission_id":"aoj_2400_8346622","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> Pi;\ntypedef pair<Pi, int> PPi;\nint main(){\n int t, p, r, td, pd, ti;\n string ms;\n while(cin >> t >> p >> r, t){\n int score[51][11]={};\n int wrong[51][11]={};\n int sum[51]={};\n for(int i=0;i<r;i++){\n cin >> td >> pd >> ti >> ms;\n if(ms == \"CORRECT\"){\n if(score[td][pd]>0) continue;\n score[td][pd] = ti;\n sum[td]++;\n } else if(ms == \"WRONG\"){\n wrong[td][pd]++;\n }\n }\n int pena[51]={};\n PPi ppi[51];\n for(int i=1;i<=t;i++){\n for(int j=1;j<=p;j++){\n if(score[i][j]>0) pena[i] += wrong[i][j]*1200 + score[i][j];\n }\n ppi[i-1] = PPi(Pi(-sum[i], pena[i]), i);\n }\n sort(ppi, ppi+t);\n for(int i=0;i<t;i++){\n Pi pi = ppi[i].first;\n cout << ppi[i].second << \" \" << -pi.first << \" \" << pi.second << endl;\n }\n }\n return(0);\n}","accuracy":1,"time_ms":10,"memory_kb":3176,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2400_8231284","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <stdio.h>\n#include <math.h>\n#include <set>\n#include <map>\n#include <queue>\n#include <cassert>\n#include <numeric>\n#include <cstdio>\n\n\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define P pair<int, int>\n\n\nint main() {\n\tint t, p, r;\n\tint tid, pid, time;\n\tstring message;\n\n\tcin >> t >> p >> r;\n\twhile (t != 0) {\n\t\tvector<int>point(t);\n\t\tvector<int>penalty(t);\n\t\tvector<vector<int>>table(t, vector<int>(p));\n\t\tfor (int i = 0;i < r;i++) {\n\t\t\tcin >> tid >> pid >> time >> message;\n\t\t\ttid--;pid--;\n\t\t\tif (message == \"WRONG\") {\n\t\t\t\ttable[tid][pid]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tpoint[tid]++;\n\t\t\t\tpenalty[tid] += table[tid][pid] * 1200 + time;\n\t\t\t}\n\t\t}\n\t\tvector<vector<pair<int, int>>>table2(p+1);\n\t\tfor (int i = 0;i < t;i++) {\n\t\t\ttable2[point[i]].push_back(pair<int, int>(penalty[i], i + 1));\n\t\t}\n\t\tfor (int i = 0;i < p+1;i++) {\n\t\t\tsort(table2[i].begin(), table2[i].end());\n\t\t}\n\t\tfor (int i = p;i >=0;i--) {\n\t\t\tfor (auto k : table2[i]) {\n\t\t\t\tcout << k.second << ' ' << i << ' ' << k.first << endl;\n\t\t\t}\n\t\t}\n\t\tcin >> t >> p >> r;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3360,"score_of_the_acc":-0.4466,"final_rank":3},{"submission_id":"aoj_2400_7894714","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\nint main() {\n\tint T, P, R;\n\tcin >> T >> P >> R;\n\twhile(T != 0) {\n\t\tvector<vector<int>> pena(T, vector<int>(P));\n\t\tvector<int> correct(T);\n\t\tvector<int> time(T);\n\t\tusing TU = tuple<int, int, int>;\n\t\tfor(int i = 0; i < R; i++) {\n\t\t\tint tID, pID, timeD;\n\t\t\tcin >> tID >> pID >> timeD;\n\t\t\ttID--;\n\t\t\tpID--;\n\t\t\tstring message;\n\t\t\tcin >> message;\n\t\t\tif(message == \"CORRECT\") {\n\t\t\t\tcorrect[tID]++;\n\t\t\t\ttime[tID] += timeD;\n\t\t\t\ttime[tID] += pena[tID][pID] * 1200;\n\t\t\t} else {\n\t\t\t\tpena[tID][pID]++;\n\t\t\t}\n\t\t}\n\t\tvector<TU> VT;\n\t\tfor(int i = 0; i < T; i++) {\n\t\t\tVT.emplace_back(correct[i], -time[i], -i);\n\t\t}\n\t\tsort(VT.begin(), VT.end());\n\t\treverse(VT.begin(), VT.end());\n\t\tfor(int i = 0; i < T; i++) {\n\t\t\tauto [c, t, id] = VT[i];\n\t\t\tt = -t;\n\t\t\tid = -id + 1;\n\t\t\tcout << id << \" \" << c << \" \" << t << endl;\n\t\t}\n\t\tcin >> T >> P >> R;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3452,"score_of_the_acc":-0.6699,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2400_10612926\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n int T, P, R;\\n cin >> T >> P >> R;\\n if (T == 0 && P == 0 && R == 0) return false;\\n vector<vector<bool>> AC(T, vector<bool>(P, false));\\n vector<vector<int>> WA(T, vector<int>(P, 0));\\n vector<int> cnt(T, 0), time(T, 0);\\n while (R--) {\\n int t, p, cur;\\n string s;\\n cin >> t >> p >> cur >> s;\\n t--, p--;\\n if (AC[t][p]) continue;\\n if (s == \\\"CORRECT\\\") {\\n AC[t][p] = true;\\n cnt[t]++;\\n time[t] += cur + 1200 * WA[t][p];\\n } else {\\n WA[t][p]++;\\n }\\n }\\n vector<int> ord(T);\\n iota(ord.begin(), ord.end(), 0);\\n sort(ord.begin(), ord.end(), [&] (int i, int j) {\\n return cnt[i] == cnt[j] ? time[i] == time[j] ? i < j : time[i] < time[j] : cnt[i] > cnt[j];\\n });\\n for (int i : ord) {\\n cout << i + 1 << ' ' << cnt[i] << ' ' << time[i] << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.6796,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2400_10572012\",\n \"code_snippet\": \"// AOJ 2400 - You Are the Judge\\n// JAG Practice Contest for Japan Domestic 2012 - Problem B\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solving() {\\n int T, P, R; cin >> T >> P >> R;\\n if(T == 0) return false;\\n\\n vector<int> tID(R), pID(R), t(R);\\n vector<string> m(R);\\n for(int i=0; i<R; ++i) {\\n cin >> tID[i] >> pID[i] >> t[i] >> m[i];\\n --tID[i]; --pID[i];\\n }\\n\\n vector<vector<int>> WA(T, vector<int>(P));\\n vector<pair<pair<int,int>, int>> score(T);\\n for(int i=0; i<T; ++i) score[i].second = i+1;\\n for(int i=0; i<R; ++i) {\\n if(m[i] == \\\"CORRECT\\\") {\\n --score[tID[i]].first.first;\\n score[tID[i]].first.second += t[i] + 1200 * WA[tID[i]][pID[i]];\\n } else {\\n ++WA[tID[i]][pID[i]];\\n }\\n }\\n sort(score.begin(), score.end());\\n for(int i=0; i<T; ++i) {\\n cout << score[i].second << ' ' << -score[i].first.first << ' ' << score[i].first.second << endl;\\n }\\n return true;\\n}\\n\\nint main() {\\n while(solving()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.5534,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2400_10417846\",\n \"code_snippet\": \"#include<atcoder/all>\\nusing 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 ans {\\n int idx, ac, pena;\\n\\n bool operator < (const ans &S) const {\\n if(ac != S.ac) {\\n return ac < S.ac;\\n } else if (pena != S.pena) {\\n return pena > S.pena;\\n } else {\\n return idx > S.idx;\\n }\\n }\\n};\\n\\nvoid solve() {\\n int t, p, r;\\n cin >> t >> p >> r;\\n \\n if(t == 0 && p == 0 && r == 0)exit(0);\\n \\n vector<vector<int>> locked(t, vector<int>(p, 0));\\n vector<vector<int>> pen(t, vector<int>(p));\\n\\n vector<ans> vec(t);\\n rep(i, t)vec[i] = {i+1, 0, 0};\\n\\n rep(i, r) {\\n int tid, pid, ti;\\n string message;\\n cin >> tid >> pid >> ti >> message;\\n\\n tid--;\\n pid--;\\n\\n if(locked[tid][pid]) {\\n continue;\\n }\\n \\n if(message == \\\"WRONG\\\") {\\n pen[tid][pid]++;\\n } else {\\n locked[tid][pid] = true;\\n\\n vec[tid].ac += 1;\\n vec[tid].pena += 1200 * pen[tid][pid] + ti;\\n }\\n }\\n\\n sort(rall(vec));\\n rep(i, t) {\\n cout << vec[i].idx << \\\" \\\" << vec[i].ac << \\\" \\\" << vec[i].pena << endl;\\n }\\n}\\n\\nint main() {\\n while(true)solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.9903,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2400_9408186\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n while(true){\\n int t,p,r;\\n cin>>t>>p>>r;\\n if(t==0)break;\\n vector<vector<bool>>solved(t,vector<bool>(p,false));\\n vector<int>pena(t,0);\\n vector<vector<int>>wa(t,vector<int>(p,0));\\n while(r--){\\n int tid,pid,time;\\n string mes;\\n cin>>tid>>pid>>time>>mes;\\n tid--,pid--;\\n if(solved[tid][pid])continue;\\n if(mes==\\\"CORRECT\\\"){\\n solved[tid][pid]=true;\\n pena[tid]+=wa[tid][pid]*1200+time;\\n }\\n else wa[tid][pid]++;\\n }\\n vector<int>ans(t);\\n iota(ans.begin(),ans.end(),0);\\n sort(ans.begin(),ans.end(),[&](int l,int r){\\n int acl=0,acr=0;\\n for(int i=0;i<p;i++){\\n acl+=solved[l][i];\\n acr+=solved[r][i];\\n }\\n if(acl!=acr)return acl>acr;\\n if(pena[l]!=pena[r])return pena[l]<pena[r];\\n return l<r;\\n });\\n for(int i:ans){\\n int ac=0;\\n for(int j=0;j<p;j++)ac+=solved[i][j];\\n cout<<i+1<<' '<<ac<<' '<<pena[i]<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.3981,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2400_9401718\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\nusing namespace std;\\n\\nbool compareTeams(const vector<int>& a, const vector<int>& b) {\\n if (a[0] != b[0]) {\\n return a[0] > b[0];\\n }\\n if (a[1] != b[1]) {\\n return a[1] < b[1];\\n }\\n return a[2] < b[2];\\n}\\n\\nint main(void)\\n{\\n int t, p, r;\\n while (true)\\n {\\n cin >> t >> p >> r;\\n if (t == 0 && p == 0 && r == 0)\\n {\\n break;\\n }\\n\\n vector<int> correctCount(t, 0), penalty(t, 0);\\n vector<vector<int> > wrongCount(t, vector<int>(p, 0));\\n\\n for (int i = 0; i < r; i++)\\n {\\n int teamId, questionId, time;\\n string kindAns;\\n cin >> teamId >> questionId >> time >> kindAns;\\n\\n if (kindAns == \\\"WRONG\\\")\\n {\\n wrongCount[teamId - 1][questionId - 1]++;\\n }\\n else if (kindAns == \\\"CORRECT\\\")\\n {\\n correctCount[teamId - 1]++;\\n penalty[teamId - 1] += time + wrongCount[teamId - 1][questionId - 1] * 1200;\\n }\\n }\\n\\n vector<vector<int> > teams(t, vector<int>(3));\\n\\n for (int i = 0; i < t; i++)\\n {\\n teams[i][0] = correctCount[i];\\n teams[i][1] = penalty[i];\\n teams[i][2] = i + 1;\\n }\\n\\n sort(teams.begin(), teams.end(), compareTeams);\\n\\n for (int i = 0; i < t;i++)\\n {\\n cout << teams[i][2] << \\\" \\\" << teams[i][0] << \\\" \\\" << teams[i][1] << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -1.1165,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2400_9346599\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\nusing ll = long long;\\n#define all(x) x.begin(),x.end()\\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\\n\\nint solve() {\\n int T, P, R;\\n std::cin >> T >> P >> R;\\n if (T == 0) return 1;\\n std::vector<int> p(T), c(T);\\n std::vector w(T, std::vector<int>(P));\\n const int OK = -1;\\n for (int i = 0; i < R; i++) {\\n int tid, pid, ti;\\n std::string mes;\\n std::cin >> tid >> pid >> ti >> mes;\\n tid--;\\n pid--;\\n if (w[tid][pid] == OK) continue;\\n if (mes == \\\"CORRECT\\\") {\\n p[tid] += ti + w[tid][pid] * 1200;\\n c[tid]++;\\n w[tid][pid] = OK;\\n } else {\\n w[tid][pid]++;\\n }\\n }\\n using Tu = std::tuple<int, int, int>;\\n std::vector<Tu> data;\\n for (int i = 0; i < T; i++) {\\n data.emplace_back(-c[i], p[i], i);\\n }\\n std::sort(data.begin(), data.end());\\n for (int i = 0; i < T; i++) {\\n auto [a, b, c] = data[i];\\n std::cout << c + 1 << ' ' << -a << ' ' << b << std::endl;\\n }\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.6796,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2400_9334180\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n//#pragma GCC optimize(\\\"Ofast\\\")\\n//#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\nusing ll=long long;\\n#define overload4(_1, _2, _3, _4, 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 each(i,...) for(auto&& i:__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 all(i) begin(i), end(i)\\n#define rall(i) (i).rbegin(), (i).rend()\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define elif else if\\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> ll sum(const T& a){ return accumulate(all(a), 0LL); }\\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\\nconst int INF =0x3fffffff;\\nconst ll INFll =0x1fffffffffffffff;// 4times ok\\nconst int MOD= int(1e9)+7;\\nconst int MODD=998244353;\\nusing P= pair<int,int>;\\nusing Pl= pair<ll,ll>;\\nusing ld=long double;\\nusing VVl=vector<vector<ll>>;\\nusing VVd=vector<vector<ld>>;\\nusing Vd=vector<ld>;\\nusing tuplis =array<ll, 3>;\\nusing quatro=array<ll,4>;\\n#define vec(type,name,...) vector<type> name(__VA_ARGS__)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nconst ll four[] = {0, 1, 0, -1, 0};\\nconst ll eight[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};\\nconst ld EPS = 1e-9;\\nconst ld PI = 3.1415926535897932;\\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){ a%=p; ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\nll isqr(ll x){ll r=sqrt(x)-1;while((r+1)*(r+1)<=x)r++;return r;}\\nvector<ll> divisor(ll x){vector<ll> ans; for(ll i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\\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#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,size) vector<type> name(size); in(name)\\n#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)\\n\\nbool solve(){\\n LL(t,p,r);\\n if(t==0)return false;\\n vec(Pl,score,t);\\n map<Pl,ll>cnt;\\n rep(r){\\n LL(ti,pi,mi);\\n STR(x);\\n ll j=0;\\n if(x==\\\"WRONG\\\")j=1;\\n ti--;\\n if(j!=0){\\n cnt[{ti,pi}]++;\\n }\\n else{\\n score[ti].first++;\\n score[ti].second+=mi+cnt[{ti,pi}]*1200;\\n }\\n }\\n vector<tuplis>X;\\n rep(t){\\n X.push_back({score[i].first,-score[i].second,-i});\\n }\\n Sort(X);\\n Rev(X);\\n rep(t){\\n out(-X[i][2]+1,X[i][0],-X[i][1]);\\n }\\n return true;\\n}\\n\\nint main(){\\n ll t=1;\\n// in(t);\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2400_9332223\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nint main(){\\n while(true){\\n ll T,P,R;\\n cin >> T >> P >> R;\\n if(T==0&&P==0&&R==0)break;\\n vector<ll>tID(R);\\n vector<ll>pID(R);\\n vector<ll>time(R);\\n vector<string>message(R);\\n for(ll i=0;i<R;i++){\\n cin >> tID[i] >> pID[i] >> time[i] >> message[i];\\n }\\n\\n vector<vector<ll>>WA_cnt(P,vector<ll>(T));\\n vector<tuple<ll,ll,ll>>info(T,{0,0,0});\\n for(ll i=0;i<T;i++){\\n get<2>(info[i])=i;\\n }\\n for(ll i=0;i<R;i++){\\n if(message[i]==\\\"WRONG\\\"){\\n WA_cnt[pID[i]-1][tID[i]-1]++;\\n }else{\\n get<0>(info[tID[i]-1])++;\\n get<1>(info[tID[i]-1])+=WA_cnt[pID[i]-1][tID[i]-1]*1200+time[i];\\n }\\n }\\n for(ll i=0;i<T;i++){\\n get<1>(info[i]) = 100000000-get<1>(info[i]);\\n get<2>(info[i]) = 100-get<2>(info[i]);\\n }\\n\\n sort(info.rbegin(),info.rend());\\n for(int i=0;i<T;i++){\\n cout << 100-get<2>(info[i])+1 << \\\" \\\" << get<0>(info[i]) << \\\" \\\" << 100000000-get<1>(info[i]) << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.5437,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2400_9309860\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,k,n) for (int i = k; i < (n); ++i)\\nconst long long MOD1 = 1000000007;\\nconst long long MOD2 = 998244353;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst long long INF = 1e17;\\n\\nint main(){\\n while(true){\\n int t,p,r;\\n cin >> t>>p>>r;\\n if(t==0){\\n break;\\n }\\n\\n vector<int> tID(r),pID(r),time(r);\\n vector<string> message(r);\\n\\n vector<int> ac(t),pena(t);\\n vector wa(t,vector<int>(p));\\n\\n for(int i=0;i<r;i++){\\n int x,y;\\n cin >> x >> y;\\n x--;\\n y--;\\n tID[i] = x;\\n pID[i] = y;\\n cin >> time[i] >> message[i];\\n }\\n\\n for(int i=0;i<r;i++){\\n if(wa[tID[i]][pID[i]]==-1)continue;\\n if(message[i]==\\\"CORRECT\\\"){\\n ac[tID[i]]++;\\n pena[tID[i]] += wa[tID[i]][pID[i]]*1200 + time[i];\\n wa[tID[i]][pID[i]] = -1;\\n }\\n if(message[i]==\\\"WRONG\\\"){\\n wa[tID[i]][pID[i]]++;\\n }\\n }\\n\\n vector<tuple<int,int,int>> cnt(t);\\n for(int i=0;i<t;i++){\\n cnt[i] = {-ac[i],pena[i],i};\\n }\\n sort(cnt.begin(),cnt.end());\\n\\n for(int i=0;i<t;i++){\\n cout << get<2>(cnt[i]) + 1 << ' ' << -get<0>(cnt[i]) << ' ' << get<1>(cnt[i]) <<endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.5437,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2400_9296564\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (long long i=0;i<n;i++)\\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\\n#define range(value,range) for(const auto &value : range)\\n#define ll long long\\n#define vl vector<long long>\\n#define vvl vector<vector<long long>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define inf 4000000000000000000LL\\n#define mod 998244353\\n\\nll solve() {\\n ll t,p,r;\\n cin>>t>>p>>r;\\n if(t==0&&p==0&&r==0)return 1;\\n\\n vvl g(t,vl(p,0));\\n vvl ans(t,vl(3,0));\\n rep(i,t)ans[i][2]=i+1;\\n rep(z,r){\\n ll tid,pid,time;\\n string mes;\\n cin>>tid>>pid>>time>>mes,pid--,tid--;\\n if(mes==\\\"WRONG\\\"){\\n g[tid][pid]++;\\n }else{\\n ans[tid][0]--;\\n ans[tid][1]+=1200*g[tid][pid]+time;\\n }\\n }\\n sort(ans.begin(),ans.end());\\n rep(i,t)ans[i][0]*=-1;\\n rep(i,t){\\n cout<<ans[i][2]<<\\\" \\\"<<ans[i][0]<<\\\" \\\"<<ans[i][1]<<endl;\\n }\\n //vvdbg(ans);\\n return 0;\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tif(solve()==1)break;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.6893,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2400_9296550\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (long long i=0;i<n;i++)\\n#define loop(i,m,n) for(long long i=m;i<=n;i++)\\n#define range(value,range) for(const auto &value : range)\\n#define ll long long\\n#define vl vector<long long>\\n#define vvl vector<vector<long long>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define inf 4000000000000000000LL\\n#define mod 998244353\\n\\nll solve() {\\n ll t,p,r;\\n cin>>t>>p>>r;\\n if(t==0&&p==0&&r==0)return 1;\\n\\n vvl g(t,vl(p,0));\\n vvl ans(t,vl(3,0));\\n rep(i,t)ans[i][2]=i+1;\\n rep(z,r){\\n ll tid,pid,time;\\n string mes;\\n cin>>tid>>pid>>time>>mes,pid--,tid--;\\n if(mes==\\\"WRONG\\\"){\\n g[tid][pid]++;\\n }else{\\n ans[tid][0]--;\\n ans[tid][1]+=1200*g[tid][pid]+time;\\n }\\n }\\n sort(ans.begin(),ans.end());\\n rep(i,t)ans[i][0]*=-1;\\n rep(i,t){\\n cout<<ans[i][2]<<\\\" \\\"<<ans[i][0]<<\\\" \\\"<<ans[i][1]<<endl;\\n }\\n //vvdbg(ans);\\n return 0;\\n}\\nint main(){\\n\\twhile(1){\\n\\t\\tif(solve()==1)break;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.4757,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2400_9266063\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nvoid solve(ll t, ll p, ll r){\\n vector<ll> ac(t, 0);\\n vector<ll> pena(t, 0);\\n vector<vector<ll>> wa_cnt(t, vector<ll>(p, 0));\\n\\n for(int rid = 0; rid < r; rid++){\\n ll tid, pid, time; string msg;\\n cin >> tid >> pid >> time >> msg;\\n tid--; pid--;\\n\\n if(msg == \\\"CORRECT\\\"){\\n ac[tid]++;\\n pena[tid] += (wa_cnt[tid][pid] * 1200 + time);\\n }\\n else if(msg == \\\"WRONG\\\"){\\n wa_cnt[tid][pid]++;\\n }\\n else{\\n cerr << \\\"Invalid msg\\\" << endl;\\n assert(false);\\n }\\n }\\n\\n vector<int> ord(t);\\n iota(ord.begin(), ord.end(), 0);\\n sort(ord.begin(), ord.end(), [&](const auto &p, const auto & q){\\n if(ac[p] != ac[q]) return ac[p] > ac[q];\\n else if(pena[p] != pena[q]) return pena[p] < pena[q];\\n else return p < q;\\n });\\n\\n for(int i = 0; i < ord.size(); i++){\\n int tid = ord[i];\\n cout << tid+1 << \\\" \\\" << ac[tid] << \\\" \\\" << pena[tid] << endl;\\n }\\n}\\n\\nint main(){\\n while(true){\\n ll t, p, r; cin >> t >> p >> r;\\n if(t == 0 && p == 0 && r == 0) break;\\n else solve(t, p, r);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.6505,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2400_9259857\",\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;\\n\\nint t,p,r;\\n\\nvoid solve() {\\n vector<vector<int>> v (t,vector<int> (3));\\n map<pair<int,int>,int> mp;\\n rep(i,t) {\\n v[i][0] = 0;\\n v[i][1] = 0;\\n v[i][2] = (i+1);\\n }\\n int tm, te, num;\\n string acc;\\n rep(w,r) {\\n cin >> te >> num >> tm >> acc;\\n if (acc == \\\"CORRECT\\\") {\\n v[te-1][0]--;\\n if (mp.find({te,num}) != mp.end()) {\\n v[te-1][1] += tm + mp[{te,num}]*1200;\\n }\\n else {\\n v[te-1][1] += tm;\\n }\\n }\\n else {\\n mp[{te,num}]++;\\n }\\n }\\n\\n sort(all(v));\\n rep(i,t) {\\n cout << v[i][2] << ' ' << -v[i][0] << ' ' << v[i][1] << endl;\\n }\\n return;\\n}\\n\\n\\n\\nint main() {\\n while (true) {\\n cin >> t >> p >> r;\\n if (t == 0) {\\n return 0;\\n }\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.534,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2400_8978955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n while (true) {\\n int t, p, r;\\n cin >> t >> p >> r;\\n\\n if (t == 0 && p == 0 && r == 0) {\\n break;\\n }\\n\\n int tid[r], pid[r], ttime[r];\\n string message[r];\\n for (int i = 0; i < r; i++) {\\n cin >> tid[i] >> pid[i] >> ttime[i] >> message[i];\\n }\\n\\n int acproblem[t+1];\\n int waproblem[t+1][p+1];\\n int penalty[t+1];\\n memset(acproblem, 0, sizeof(acproblem));\\n memset(waproblem, 0, sizeof(waproblem));\\n memset(penalty, 0, sizeof(penalty));\\n for (int i = 0; i < r; i++) {\\n if (message[i] == \\\"CORRECT\\\") {\\n acproblem[tid[i]]++;\\n penalty[tid[i]] += waproblem[tid[i]][pid[i]]*1200 + ttime[i];\\n } else {\\n waproblem[tid[i]][pid[i]]++;\\n }\\n }\\n\\n vector<tuple<int, int, int> > viii(t);\\n for (int i = 1; i <= t; i++) {\\n viii[i-1] = {-acproblem[i], penalty[i], i};\\n }\\n\\n sort(viii.begin(), viii.end());\\n\\n for (int i = 0; i < t; i++) {\\n cout << get<2>(viii[i]) << \\\" \\\" << -get<0>(viii[i]) << \\\" \\\" << get<1>(viii[i]) << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.466,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2400_8571505\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nbool solve() {\\n int T, P, R; std::cin >> T >> P >> R;\\n if (T == 0 and P == 0 and R == 0) return false;\\n\\n std::vector<int> count(T), penalty(T);\\n std::vector ac(T, std::vector<bool>(P));\\n std::vector wa(T, std::vector<int>(P));\\n for (int _{} ; _ < R ; _++) {\\n int t, p, time; std::cin >> t >> p >> time;\\n t--; p--;\\n std::string s; std::cin >> s;\\n if (ac[t][p]) continue;\\n if (s[0] == 'C') {\\n ac[t][p] = true;\\n count[t]++;\\n penalty[t] += time + wa[t][p] * 1200;\\n }\\n else {\\n wa[t][p]++;\\n }\\n }\\n\\n std::vector<int> ans(T);\\n std::iota(ans.begin(), ans.end(), 0);\\n std::sort(ans.begin(), ans.end(), [&](int i, int j) -> bool {\\n if (count[i] != count[j]) return count[i] > count[j];\\n else if (penalty[i] != penalty[j]) return penalty[i] < penalty[j];\\n else return i < j;\\n });\\n for (int i{} ; i < T ; i++) {\\n int v{ans[i]};\\n std::cout << v + 1 << ' ' << count[v] << ' ' << penalty[v] << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n for (int i{} ; solve() ; i++) {\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.6505,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2400_8570949\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n while(1) {\\n int T, P, R;\\n cin >> T >> P >> R;\\n if (T == 0 && P == 0 && R == 0) return 0;\\n vector<int> Pena(T,0), AC(T,0);\\n vector<vector<int>> WA(T, vector<int>(P, 0));\\n for (int i = 0; i < R; i++) {\\n int TID, PID, TIME;\\n string S;\\n cin >> TID >> PID >> TIME >> S;\\n TID--, PID--;\\n if (S == \\\"CORRECT\\\") {\\n AC[TID]++;\\n Pena[TID]+=WA[TID][PID]*1200+TIME;\\n }\\n else if (S == \\\"WRONG\\\") {\\n WA[TID][PID]++;\\n }\\n }\\n vector<pair<int, pair<int, int> > > V;\\n for (int i = 0; i < T; i++) V.push_back({P - AC[i], {Pena[i], i}});\\n sort(V.begin(), V.end());\\n for (int i = 0; i < T; i++) {\\n cout << V[i].second.second + 1 << ' ' << P - V[i].first << ' ' << V[i].second.first << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.6505,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2400_8528323\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint solve() {\\n int n, m, q;\\n std::cin >> n >> m >> q;\\n if (n == 0) return 1;\\n\\n std::vector<std::pair<int, int>> result(n);\\n std::vector penalty(n, std::vector<int>(m));\\n\\n for (int i = 0; i < q; i++) {\\n int a, b, t;\\n std::string s;\\n std::cin >> a >> b >> t >> s;\\n a--; b--;\\n if (s == \\\"CORRECT\\\") {\\n result[a].first++;\\n result[a].second += penalty[a][b] + t;\\n } else {\\n penalty[a][b] += 1200;\\n }\\n }\\n\\n std::vector<int> ans(n);\\n std::iota(ans.begin(), ans.end(), 0);\\n std::sort(ans.rbegin(), ans.rend(), \\n [&](int lhs, int rhs) {\\n auto [la, lb] = result[lhs];\\n auto [ra, rb] = result[rhs];\\n if (la == ra && lb == rb) {\\n return rhs < lhs;\\n }\\n if (la == ra) {\\n return rb < lb;\\n }\\n return la < ra;\\n });\\n\\n for (auto i: ans) {\\n auto [a, b] = result[i];\\n std::cout << i + 1 << ' ' << a << ' ' << b << std::endl;\\n }\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.4466,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2400_8346622\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int, int> Pi;\\ntypedef pair<Pi, int> PPi;\\nint main(){\\n int t, p, r, td, pd, ti;\\n string ms;\\n while(cin >> t >> p >> r, t){\\n int score[51][11]={};\\n int wrong[51][11]={};\\n int sum[51]={};\\n for(int i=0;i<r;i++){\\n cin >> td >> pd >> ti >> ms;\\n if(ms == \\\"CORRECT\\\"){\\n if(score[td][pd]>0) continue;\\n score[td][pd] = ti;\\n sum[td]++;\\n } else if(ms == \\\"WRONG\\\"){\\n wrong[td][pd]++;\\n }\\n }\\n int pena[51]={};\\n PPi ppi[51];\\n for(int i=1;i<=t;i++){\\n for(int j=1;j<=p;j++){\\n if(score[i][j]>0) pena[i] += wrong[i][j]*1200 + score[i][j];\\n }\\n ppi[i-1] = PPi(Pi(-sum[i], pena[i]), i);\\n }\\n sort(ppi, ppi+t);\\n for(int i=0;i<t;i++){\\n Pi pi = ppi[i].first;\\n cout << ppi[i].second << \\\" \\\" << -pi.first << \\\" \\\" << pi.second << endl;\\n }\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2400_8231284\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <stdio.h>\\n#include <math.h>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <cassert>\\n#include <numeric>\\n#include <cstdio>\\n\\n\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define P pair<int, int>\\n\\n\\nint main() {\\n\\tint t, p, r;\\n\\tint tid, pid, time;\\n\\tstring message;\\n\\n\\tcin >> t >> p >> r;\\n\\twhile (t != 0) {\\n\\t\\tvector<int>point(t);\\n\\t\\tvector<int>penalty(t);\\n\\t\\tvector<vector<int>>table(t, vector<int>(p));\\n\\t\\tfor (int i = 0;i < r;i++) {\\n\\t\\t\\tcin >> tid >> pid >> time >> message;\\n\\t\\t\\ttid--;pid--;\\n\\t\\t\\tif (message == \\\"WRONG\\\") {\\n\\t\\t\\t\\ttable[tid][pid]++;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tpoint[tid]++;\\n\\t\\t\\t\\tpenalty[tid] += table[tid][pid] * 1200 + time;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<pair<int, int>>>table2(p+1);\\n\\t\\tfor (int i = 0;i < t;i++) {\\n\\t\\t\\ttable2[point[i]].push_back(pair<int, int>(penalty[i], i + 1));\\n\\t\\t}\\n\\t\\tfor (int i = 0;i < p+1;i++) {\\n\\t\\t\\tsort(table2[i].begin(), table2[i].end());\\n\\t\\t}\\n\\t\\tfor (int i = p;i >=0;i--) {\\n\\t\\t\\tfor (auto k : table2[i]) {\\n\\t\\t\\t\\tcout << k.second << ' ' << i << ' ' << k.first << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcin >> t >> p >> r;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.4466,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2400_7894714\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\nint main() {\\n\\tint T, P, R;\\n\\tcin >> T >> P >> R;\\n\\twhile(T != 0) {\\n\\t\\tvector<vector<int>> pena(T, vector<int>(P));\\n\\t\\tvector<int> correct(T);\\n\\t\\tvector<int> time(T);\\n\\t\\tusing TU = tuple<int, int, int>;\\n\\t\\tfor(int i = 0; i < R; i++) {\\n\\t\\t\\tint tID, pID, timeD;\\n\\t\\t\\tcin >> tID >> pID >> timeD;\\n\\t\\t\\ttID--;\\n\\t\\t\\tpID--;\\n\\t\\t\\tstring message;\\n\\t\\t\\tcin >> message;\\n\\t\\t\\tif(message == \\\"CORRECT\\\") {\\n\\t\\t\\t\\tcorrect[tID]++;\\n\\t\\t\\t\\ttime[tID] += timeD;\\n\\t\\t\\t\\ttime[tID] += pena[tID][pID] * 1200;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpena[tID][pID]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<TU> VT;\\n\\t\\tfor(int i = 0; i < T; i++) {\\n\\t\\t\\tVT.emplace_back(correct[i], -time[i], -i);\\n\\t\\t}\\n\\t\\tsort(VT.begin(), VT.end());\\n\\t\\treverse(VT.begin(), VT.end());\\n\\t\\tfor(int i = 0; i < T; i++) {\\n\\t\\t\\tauto [c, t, id] = VT[i];\\n\\t\\t\\tt = -t;\\n\\t\\t\\tid = -id + 1;\\n\\t\\t\\tcout << id << \\\" \\\" << c << \\\" \\\" << t << endl;\\n\\t\\t}\\n\\t\\tcin >> T >> P >> R;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.6699,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1368,"cells":{"group_id":{"kind":"string","value":"aoj_2401_cpp"},"problem_description":{"kind":"string","value":"Equation\n恒等式\nEnglish text is not available in this practice contest.\n論理演算では，値は T と F の2種類だけを扱う．\n\"-\"を単項演算子（入力が 1 つの演算を表す記号），\n\"*\", \"+\", \"->\" を 2 項演算子（入力が 2 つの演算を表す記号）とする．\n\"-\" は論理否定(NOT)，\n\"*\" は論理積(AND)，\n\"+\" は論理和(OR)，\n\"->\" は論理包含(IMP)を表す演算子である．\nこれらの論理演算の真理値表を下の表に示す．\nx\ny\n-x\n(x*y)\n(x+y)\n(x->y)\nT\nT\nF\nT\nT\nT\nT\nF\nF\nF\nT\nF\nF\nT\nT\nF\nT\nT\nF\nF\nT\nF\nF\nT\n論理式は以下のいずれかの形式である．\nX, Yは論理式とし， 2 項演算子は必ず括弧で囲むものとする．\n定数: T, F\n変数: a, b, c, d, e, f, g, h, i, j, k\n論理否定: -X\n論理積: (X*Y)\n論理和: (X+Y)\n論理包含: (X->Y)\n2 つの論理式を等号 \"=\" で結合した等式が与えられる．\n恒等式とは，式に現れる変数がどのような値であっても成立する等式のことである．\n与えられた等式が恒等式であるかを判定するプログラムを作りたい．\nInput\n入力は複数の行で構成され，各行は 1 つのデータセットである．\nデータセットはT, F, a, b, c, d, e, f, g, h, i, j, k, (, ), =, -, +, *, > から成る文字列であり， 空白など他の文字を含まない．\n1 行の文字数は 1000 文字以下と仮定してよい．\n1 つのデータセットは等式ひとつを含む．\n等式の文法は次の BNF で与えられる．\nすべての等式はこの構文規則に従う．\n<equation> ::= <formula> \"=\" <formula>\n<formula> ::= \"T\" | \"F\" |\n\"a\" | \"b\" | \"c\" | \"d\" | \"e\" | \"f\" |\n\"g\" | \"h\" | \"i\" | \"j\" | \"k\" |\n\"-\" <formula> |\n\"(\" <formula> \"*\" <formula> \")\" |\n\"(\" <formula> \"+\" <formula> \")\" |\n\"(\" <formula> \"->\" <formula> \")\"\n入力の終わりは \"#\" だけからなる行で示されており，この行はデータセットではない．\nOutput\n各データセットについて，等式が恒等式であれば“YES”を， そうでなければ“NO”をそれぞれ1行に出力しなさい． 出力には余分な文字を含んではならない．\nSample Input\n-(a+b)=(-a*-b)\n(a->b)=(-a+b)\n((a*T)+b)=(-c+(a*-b))\n#\nOutput for Sample Input\nYES\nYES\nNO"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2401_10678747","code_snippet":"#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\n\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n \n size_t operator()(int x) const {\n return splitmix64(x);\n }\n \n size_t operator()(const string& x) const {\n uint64_t hash = 0;\n for (char c : x) {\n hash = hash * 31 + c;\n }\n return splitmix64(hash);\n }\n \n size_t operator()(const pair<int, int>& p) const {\n return splitmix64(((uint64_t)p.first << 32) | (uint64_t)p.second);\n }\n};\n\n\ntemplate<typename T, typename S, typename Hash = custom_hash>\nusing hash_table = gp_hash_table<T, S, Hash>;\ntemplate<typename T, typename Hash = custom_hash>\nusing hash_set = gp_hash_table<T, null_type, Hash>;\n\n\nclass parser;\n\n\nstruct node {\n int symbol_id;\n string value;\n vector<node*> values;\n \nprivate:\n const parser* parser_ptr;\n \npublic:\n node(int s, const parser* p = nullptr) : symbol_id(s), value(\"\"), parser_ptr(p) {}\n node(int s, const string &v, const parser* p = nullptr) : symbol_id(s), value(v), parser_ptr(p) {}\n \n \n void set_parser(const parser* p) {\n parser_ptr = p;\n \n for (auto child : values) {\n if (child) {\n child->set_parser(p);\n }\n }\n }\n \n \n string get_token_name() const;\n \n \n void add_child(node* child) {\n if (child && parser_ptr) {\n child->set_parser(parser_ptr);\n }\n values.push_back(child);\n }\n};\n\n\nstruct LRItem {\n int lhs;\n vector<int> rhs;\n int dot_pos;\n \n LRItem(int l, const vector<int> &r, int d) : lhs(l), rhs(r), dot_pos(d) {}\n \n bool operator==(const LRItem &other) const {\n return lhs == other.lhs && rhs == other.rhs && dot_pos == other.dot_pos;\n }\n \n int next_symbol() const {\n if (dot_pos < (int)rhs.size()) return rhs[dot_pos];\n return -1;\n }\n \n bool is_complete() const {\n return dot_pos >= (int)rhs.size();\n }\n};\n\n\nstruct LRItemHash {\n size_t operator()(const LRItem &item) const {\n size_t h1 = custom_hash{}(item.lhs);\n size_t h2 = 0;\n for (int s : item.rhs) {\n h2 ^= custom_hash{}(s) + 0x9e3779b9 + (h2 << 6) + (h2 >> 2);\n }\n size_t h3 = custom_hash{}(item.dot_pos);\n return h1 ^ (h2 << 1) ^ (h3 << 2);\n }\n};\n\n\nenum class ActionType { SHIFT, REDUCE, ACCEPT, ERROR };\n\nstruct Action {\n ActionType type;\n int value;\n \n Action() : type(ActionType::ERROR), value(-1) {}\n Action(ActionType t, int v) : type(t), value(v) {}\n \n string to_string() const {\n switch (type) {\n case ActionType::SHIFT: return \"SHIFT \" + std::to_string(value);\n case ActionType::REDUCE: return \"REDUCE \" + std::to_string(value);\n case ActionType::ACCEPT: return \"ACCEPT\";\n case ActionType::ERROR: return \"ERROR\";\n }\n return \"UNKNOWN\";\n }\n};\n\n\nstruct Production {\n int lhs;\n vector<int> rhs;\n \n Production(int l, const vector<int> &r) : lhs(l), rhs(r) {}\n};\n\nclass parser {\nprivate:\n \n vector<string> id_to_name;\n hash_table<string, int> name_to_id;\n \n \n vector<string> terminal_patterns;\n vector<int> terminal_order;\n hash_set<int> terminals;\n hash_set<int> nonterminals;\n vector<Production> productions;\n \n \n hash_table<int, hash_set<int>> first_sets;\n hash_table<int, hash_set<int>> follow_sets;\n \n \n vector<hash_set<LRItem, LRItemHash>> states;\n hash_table<pair<int, int>, Action> action_table;\n hash_table<pair<int, int>, int> goto_table;\n \n int start_symbol_id = -1;\n int augmented_start_id = -1;\n bool debug_mode = false;\n \n \n int get_or_create_symbol_id(const string &name) {\n auto it = name_to_id.find(name);\n if (it != name_to_id.end()) {\n return it->second;\n }\n int id = (int)id_to_name.size();\n id_to_name.push_back(name);\n name_to_id[name] = id;\n return id;\n }\n \n int get_or_create_symbol_id_const(const string &name) const {\n auto it = name_to_id.find(name);\n if (it != name_to_id.end()) {\n return it->second;\n }\n return -1;\n }\n \n \n int resolve_symbol_reference(int symbol_id) const {\n if (symbol_id == -1 || symbol_id >= (int)id_to_name.size()) return symbol_id;\n const string &name = id_to_name[symbol_id];\n if (name.length() > 0 && name[0] == '#') {\n string actual_name = name.substr(1);\n auto it = name_to_id.find(actual_name);\n if (it != name_to_id.end()) {\n return it->second;\n }\n }\n return symbol_id;\n }\n \n bool is_terminal_symbol(int symbol_id) const {\n int resolved_id = resolve_symbol_reference(symbol_id);\n if (resolved_id == -1) return false;\n return terminals.find(resolved_id) != terminals.end() && \n nonterminals.find(resolved_id) == nonterminals.end();\n }\n \n bool is_nonterminal_symbol(int symbol_id) const {\n int resolved_id = resolve_symbol_reference(symbol_id);\n if (resolved_id == -1) return false;\n return nonterminals.find(resolved_id) != nonterminals.end();\n }\n \n \n string production_to_string(const Production &prod) const {\n string result = get_symbol_name(prod.lhs) + \" ::= \";\n for (int symbol_id : prod.rhs) {\n int resolved_id = resolve_symbol_reference(symbol_id);\n result += get_symbol_name(resolved_id) + \" \";\n }\n return result;\n }\n \n \n vector<string> split_by_semicolon(const string &text) {\n vector<string> rules;\n stringstream ss(text);\n string rule;\n \n while (getline(ss, rule, ';')) {\n rule.erase(0, rule.find_first_not_of(\" \\t\\r\\n\"));\n rule.erase(rule.find_last_not_of(\" \\t\\r\\n\") + 1);\n \n if (!rule.empty()) {\n rules.push_back(rule);\n }\n }\n \n return rules;\n }\n \n \n \nvoid parse_bnf(const string &bnf_text) {\n regex terminal_pattern(R\"(^\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*=\\s*(.*?)\\s*$)\");\n regex production_pattern(R\"(^\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*::=\\s*(.*?)\\s*$)\");\n \n vector<string> rules = split_by_semicolon(bnf_text);\n \n \n for (size_t rule_idx = 0; rule_idx < rules.size(); rule_idx++) {\n const string &rule = rules[rule_idx];\n check_bnf_warnings(rule, rule_idx + 1);\n }\n \n \n for (const string &rule : rules) {\n smatch match;\n if (regex_match(rule, match, terminal_pattern)) {\n string name = match[1].str();\n string pattern = match[2].str();\n \n int id = get_or_create_symbol_id(name);\n if ((int)terminal_patterns.size() <= id) {\n terminal_patterns.resize(id + 1);\n }\n terminal_patterns[id] = pattern;\n terminal_order.push_back(id);\n terminals.insert(id);\n }\n }\n \n \n for (const string &rule : rules) {\n smatch match;\n if (regex_match(rule, match, production_pattern)) {\n string lhs = match[1].str();\n string rhs_all = match[2].str();\n \n int lhs_id = get_or_create_symbol_id(lhs);\n nonterminals.insert(lhs_id);\n \n if (lhs == \"START\") {\n start_symbol_id = lhs_id;\n }\n \n istringstream rhs_stream(rhs_all);\n string rhs_part;\n while (getline(rhs_stream, rhs_part, '|')) {\n rhs_part.erase(0, rhs_part.find_first_not_of(\" \\t\"));\n rhs_part.erase(rhs_part.find_last_not_of(\" \\t\") + 1);\n \n if (!rhs_part.empty()) {\n vector<int> rhs_ids;\n istringstream symbol_stream(rhs_part);\n string symbol;\n while (symbol_stream >> symbol) {\n int symbol_id = get_or_create_symbol_id(symbol);\n rhs_ids.push_back(symbol_id);\n }\n productions.emplace_back(lhs_id, rhs_ids);\n \n \n check_production_warnings(lhs, rhs_part, productions.size());\n }\n }\n }\n }\n}\n\nprivate:\n \n void check_bnf_warnings(const string &rule, int rule_number) {\n \n int equals_count = 0;\n int define_equals_count = 0;\n bool in_escape = false;\n \n for (size_t i = 0; i < rule.length(); i++) {\n char c = rule[i];\n \n if (in_escape) {\n in_escape = false;\n continue;\n }\n \n if (c == '\\\\') {\n in_escape = true;\n continue;\n }\n \n \n if (i + 2 < rule.length() && rule.substr(i, 3) == \"::=\") {\n define_equals_count++;\n i += 2; \n } \n \n else if (c == '=' && (i == 0 || rule[i-1] != ':') && (i + 1 >= rule.length() || rule[i+1] != '=')) {\n equals_count++;\n }\n }\n }\n \n \n void check_production_warnings(const string &lhs, const string &rhs, int production_number) {\n \n istringstream symbol_stream(rhs);\n string symbol;\n vector<string> symbols_without_hash;\n \n while (symbol_stream >> symbol) {\n if (!symbol.empty() && symbol[0] != '#') {\n \n symbols_without_hash.push_back(symbol);\n }\n }\n }\n \n \n bool contains_unescaped_hash(const string &text) {\n bool in_escape = false;\n \n for (size_t i = 0; i < text.length(); i++) {\n char c = text[i];\n \n if (in_escape) {\n in_escape = false;\n continue;\n }\n \n if (c == '\\\\') {\n in_escape = true;\n continue;\n }\n \n if (c == '#') {\n return true;\n }\n }\n \n return false;\n }\n \n \n void compute_first_sets() {\n \n for (int term_id : terminals) {\n first_sets[term_id].insert(term_id);\n }\n \n \n for (int nonterm_id : nonterminals) {\n first_sets[nonterm_id] = hash_set<int>();\n }\n \n bool changed = true;\n while (changed) {\n changed = false;\n \n for (const auto &prod : productions) {\n int lhs = prod.lhs;\n const auto &rhs = prod.rhs;\n \n hash_set<int> first_rhs = compute_first_of_sequence(rhs);\n \n for (int sym : first_rhs) {\n if (first_sets[lhs].find(sym) == first_sets[lhs].end()) {\n first_sets[lhs].insert(sym);\n changed = true;\n }\n }\n }\n }\n }\n \n \n hash_set<int> compute_first_of_sequence(const vector<int> &sequence) {\n hash_set<int> result;\n \n if (sequence.empty()) {\n result.insert(-1); \n return result;\n }\n \n for (int i = 0; i < (int)sequence.size(); i++) {\n int symbol_id = sequence[i];\n int resolved_id = resolve_symbol_reference(symbol_id);\n \n if (is_terminal_symbol(symbol_id)) {\n result.insert(resolved_id);\n break;\n } else if (is_nonterminal_symbol(symbol_id)) {\n bool has_epsilon = false;\n for (int sym : first_sets[resolved_id]) {\n if (sym == -1) {\n has_epsilon = true;\n } else {\n result.insert(sym);\n }\n }\n \n if (!has_epsilon) {\n break;\n }\n \n if (i == (int)sequence.size() - 1) {\n result.insert(-1); \n }\n }\n }\n \n return result;\n }\n \n \n void compute_follow_sets() {\n int eof_id = get_or_create_symbol_id(\"$\");\n follow_sets[start_symbol_id].insert(eof_id);\n \n bool changed = true;\n while (changed) {\n changed = false;\n \n for (const auto &prod : productions) {\n for (int i = 0; i < (int)prod.rhs.size(); i++) {\n int symbol_id = prod.rhs[i];\n int resolved_id = resolve_symbol_reference(symbol_id);\n \n if (is_nonterminal_symbol(symbol_id)) {\n vector<int> beta(prod.rhs.begin() + i + 1, prod.rhs.end());\n hash_set<int> first_beta = compute_first_of_sequence(beta);\n \n for (int sym : first_beta) {\n if (sym != -1 && follow_sets[resolved_id].find(sym) == follow_sets[resolved_id].end()) {\n follow_sets[resolved_id].insert(sym);\n changed = true;\n }\n }\n \n if (first_beta.find(-1) != first_beta.end()) {\n for (int sym : follow_sets[prod.lhs]) {\n if (follow_sets[resolved_id].find(sym) == follow_sets[resolved_id].end()) {\n follow_sets[resolved_id].insert(sym);\n changed = true;\n }\n }\n }\n }\n }\n }\n }\n }\n \n \n hash_set<LRItem, LRItemHash> closure(const hash_set<LRItem, LRItemHash> &items) {\n hash_set<LRItem, LRItemHash> result = items;\n bool changed = true;\n \n while (changed) {\n changed = false;\n vector<LRItem> new_items;\n \n for (const auto &item : result) {\n int next_sym = item.next_symbol();\n if (next_sym != -1 && is_nonterminal_symbol(next_sym)) {\n int resolved_id = resolve_symbol_reference(next_sym);\n \n for (int prod_idx = 0; prod_idx < (int)productions.size(); prod_idx++) {\n const auto &prod = productions[prod_idx];\n if (prod.lhs == resolved_id) {\n LRItem new_item(prod.lhs, prod.rhs, 0);\n if (result.find(new_item) == result.end()) {\n bool found = false;\n for (const auto &ni : new_items) {\n if (ni == new_item) {\n found = true;\n break;\n }\n }\n if (!found) {\n new_items.push_back(new_item);\n changed = true;\n }\n }\n }\n }\n }\n }\n \n for (const auto &item : new_items) {\n result.insert(item);\n }\n }\n \n return result;\n }\n \n \n hash_set<LRItem, LRItemHash> goto_func(const hash_set<LRItem, LRItemHash> &items, int symbol_id) {\n hash_set<LRItem, LRItemHash> goto_items;\n \n for (const auto &item : items) {\n if (item.next_symbol() == symbol_id) {\n LRItem new_item(item.lhs, item.rhs, item.dot_pos + 1);\n goto_items.insert(new_item);\n }\n }\n \n if (goto_items.empty()) {\n return goto_items;\n }\n \n return closure(goto_items);\n }\n \n \n bool states_equal(const hash_set<LRItem, LRItemHash> &a, const hash_set<LRItem, LRItemHash> &b) const {\n if (a.size() != b.size()) return false;\n for (const auto &item : a) {\n if (b.find(item) == b.end()) return false;\n }\n return true;\n }\n \n \n int find_state_id(const hash_set<LRItem, LRItemHash> &target_state) const {\n for (int i = 0; i < (int)states.size(); i++) {\n if (states_equal(states[i], target_state)) {\n return i;\n }\n }\n return -1;\n }\n \n \n void build_slr1_states() {\n if (start_symbol_id == -1) {\n throw runtime_error(\"Start symbol 'START' not found in grammar\");\n }\n \n compute_first_sets();\n compute_follow_sets();\n \n augmented_start_id = get_or_create_symbol_id(\"_START\");\n productions.insert(productions.begin(), Production(augmented_start_id, {start_symbol_id}));\n nonterminals.insert(augmented_start_id);\n \n \n hash_set<LRItem, LRItemHash> initial_items;\n LRItem initial_item(augmented_start_id, {start_symbol_id}, 0);\n initial_items.insert(initial_item);\n \n hash_set<LRItem, LRItemHash> initial_state = closure(initial_items);\n states.push_back(initial_state);\n \n queue<int> worklist;\n worklist.push(0);\n \n while (!worklist.empty()) {\n int current_state_id = worklist.front();\n worklist.pop();\n auto current_state = states[current_state_id];\n \n hash_set<int> symbols;\n for (const auto &item : current_state) {\n int next_sym = item.next_symbol();\n if (next_sym != -1) {\n symbols.insert(next_sym);\n }\n }\n \n for (int symbol_id : symbols) {\n auto next_state = goto_func(current_state, symbol_id);\n if (next_state.empty()) continue;\n \n int next_state_id = find_state_id(next_state);\n if (next_state_id == -1) {\n next_state_id = (int)states.size();\n states.push_back(next_state);\n worklist.push(next_state_id);\n }\n \n if (is_terminal_symbol(symbol_id)) {\n int resolved_id = resolve_symbol_reference(symbol_id);\n action_table[{current_state_id, resolved_id}] = Action(ActionType::SHIFT, next_state_id);\n } else if (is_nonterminal_symbol(symbol_id)) {\n int resolved_id = resolve_symbol_reference(symbol_id);\n goto_table[{current_state_id, resolved_id}] = next_state_id;\n }\n }\n }\n \n \n for (int state_id = 0; state_id < (int)states.size(); state_id++) {\n for (const auto &item : states[state_id]) {\n if (item.is_complete()) {\n if (item.lhs == augmented_start_id) {\n int eof_id = get_or_create_symbol_id(\"$\");\n action_table[{state_id, eof_id}] = Action(ActionType::ACCEPT, 0);\n } else {\n int prod_id = find_production_id(item.lhs, item.rhs);\n if (prod_id != -1) {\n \n for (int follow_sym : follow_sets[item.lhs]) {\n pair<int, int> key = {state_id, follow_sym};\n auto existing = action_table.find(key);\n \n action_table[key] = Action(ActionType::REDUCE, prod_id);\n }\n }\n }\n }\n }\n }\n }\n \n int find_production_id(int lhs, const vector<int> &rhs) {\n for (int i = 0; i < (int)productions.size(); i++) {\n if (productions[i].lhs == lhs && productions[i].rhs == rhs) {\n return i;\n }\n }\n return -1;\n }\n \n \n struct Token {\n int type_id;\n string value;\n Token(int t, const string &v) : type_id(t), value(v) {}\n };\n \n enum class TokenizeResult {\n SUCCESS,\n INVALID_REGEX,\n UNRECOGNIZED_CHARACTER\n };\n \n \nTokenizeResult tokenize(const string &input, vector<Token> &tokens) {\n tokens.clear();\n vector<regex> patterns;\n vector<int> type_ids;\n \n for (int term_id : terminal_order) {\n if (terminals.find(term_id) != terminals.end() && term_id < (int)terminal_patterns.size()) {\n try {\n patterns.push_back(regex(terminal_patterns[term_id]));\n type_ids.push_back(term_id);\n } catch (const regex_error &e) {\n return TokenizeResult::INVALID_REGEX;\n }\n }\n }\n \n auto start = input.cbegin();\n while (start != input.cend()) {\n if (isspace(*start)) {\n ++start;\n continue;\n }\n \n \n int best_match_length = 0;\n int best_match_type = -1;\n string best_match_value = \"\";\n \n for (size_t i = 0; i < patterns.size(); i++) {\n smatch match;\n if (regex_search(start, input.cend(), match, patterns[i]) && match.position() == 0) {\n int match_length = (int)match.length();\n \n \n if (match_length > best_match_length || \n (match_length == best_match_length && best_match_type == -1)) {\n best_match_length = match_length;\n best_match_type = type_ids[i];\n best_match_value = match.str();\n }\n }\n }\n \n if (best_match_type == -1) {\n return TokenizeResult::UNRECOGNIZED_CHARACTER;\n }\n \n tokens.emplace_back(best_match_type, best_match_value);\n start += best_match_length;\n }\n \n return TokenizeResult::SUCCESS;\n}\n \npublic:\n parser(const string &bnf_text, bool debug = false) : debug_mode(debug) {\n parse_bnf(bnf_text);\n build_slr1_states();\n }\n \n node* parse(const string &input) {\n vector<Token> tokens;\n TokenizeResult tokenize_result = tokenize(input, tokens);\n \n if (tokenize_result != TokenizeResult::SUCCESS) {\n return nullptr;\n }\n \n int eof_id = get_or_create_symbol_id(\"$\");\n tokens.emplace_back(eof_id, \"$\");\n \n vector<int> state_stack = {0};\n vector<node*> symbol_stack;\n int token_pos = 0;\n \n while (true) {\n if (state_stack.empty() || token_pos >= (int)tokens.size()) {\n return nullptr;\n }\n \n int current_state = state_stack.back();\n int current_token_type = tokens[token_pos].type_id;\n string current_token_value = tokens[token_pos].value;\n \n auto action_key = make_pair(current_state, current_token_type);\n auto action_it = action_table.find(action_key);\n \n if (action_it == action_table.end()) {\n return nullptr;\n }\n \n Action action = action_it->second;\n \n if (action.type == ActionType::SHIFT) {\n state_stack.push_back(action.value);\n node* new_node = new node(current_token_type, current_token_value, this);\n symbol_stack.push_back(new_node);\n token_pos++;\n } else if (action.type == ActionType::REDUCE) {\n if (action.value < 0 || action.value >= (int)productions.size()) {\n return nullptr;\n }\n \n Production &prod = productions[action.value];\n node* new_node = new node(prod.lhs, this);\n \n int pop_count = (int)prod.rhs.size();\n if (pop_count > (int)symbol_stack.size() || pop_count > (int)state_stack.size()) {\n return nullptr;\n }\n \n for (int i = 0; i < pop_count; i++) {\n node* child = symbol_stack.back();\n new_node->values.insert(new_node->values.begin(), child);\n symbol_stack.pop_back();\n state_stack.pop_back();\n }\n \n for (auto child : new_node->values) {\n if (child) {\n child->set_parser(this);\n }\n }\n \n symbol_stack.push_back(new_node);\n \n if (state_stack.empty()) {\n return nullptr;\n }\n \n auto goto_key = make_pair(state_stack.back(), prod.lhs);\n auto goto_it = goto_table.find(goto_key);\n if (goto_it == goto_table.end()) {\n return nullptr;\n }\n \n state_stack.push_back(goto_it->second);\n } else if (action.type == ActionType::ACCEPT) {\n if (symbol_stack.empty()) {\n return nullptr;\n }\n node* result = symbol_stack.back();\n if (result) {\n result->set_parser(this);\n }\n return result;\n } else {\n return nullptr;\n }\n }\n }\n \n string get_symbol_name(int symbol_id) const {\n if (symbol_id < 0 || symbol_id >= (int)id_to_name.size()) return \"\";\n return id_to_name[symbol_id];\n }\n};\n\n\nstring node::get_token_name() const {\n if (!parser_ptr) return \"\";\n return parser_ptr->get_symbol_name(symbol_id);\n}\n\nusing ll = long long;\nbool eval(node* root, int j){\n if (root == nullptr) return 0;\n \n string symbol_name = root->get_token_name();\n if (symbol_name == \"START\"){\n return eval(root->values[0], j) == eval(root->values[2], j);\n }\n\n if (symbol_name == \"EXPR\"){\n if (root->values.size() == 1) {\n return eval(root->values[0], j);\n }\n\n if (root->values.size() == 2){\n return !eval(root->values[1], j);\n }\n\n if (root->values[2]->get_token_name() == \"AND\") {\n bool b1 = eval(root->values[1], j);\n if (!b1) return 0;\n bool b2 = eval(root->values[3], j);\n return b2;\n }\n\n if (root->values[2]->get_token_name() == \"OR\") {\n bool b1 = eval(root->values[1], j);\n if (b1) return 1;\n bool b2 = eval(root->values[3], j);\n return b2;\n }\n\n if (root->values[2]->get_token_name() == \"TO\") {\n bool b1 = eval(root->values[1], j);\n if (!b1) return 1;\n bool b2 = eval(root->values[3], j);\n return b2;\n }\n }\n\n if (symbol_name == \"ATOM\") {\n if (root->value == \"T\") return 1;\n if (root->value == \"F\") return 0;\n if (root->value.length() == 1) {\n return (j >> (root->value[0] - 'a')) & 1;\n }\n }\n\n return 0;\n}\n\nint main() {\n \n bool debug = false;\n \n auto parser0 = parser(\n \"ATOM = T|F|[a-k];\"\n \"NOT = -;\"\n \"AND = \\\\*;\"\n \"OR = \\\\+;\"\n \"TO = ->;\"\n \"EQ = \\\\=;\"\n \"LPAR = \\\\(;\"\n \"RPAR = \\\\);\"\n \"START ::= #EXPR #EQ #EXPR;\"\n \"EXPR ::= #NOT #EXPR | #LPAR #EXPR #AND #EXPR #RPAR | \"\n \"#LPAR #EXPR #OR #EXPR #RPAR | #LPAR #EXPR #TO #EXPR #RPAR | #ATOM;\",\n debug\n );\n \n while (1){\n string s;\n cin >> s;\n if (s == \"#\") break;\n\n bool f = 1;\n auto result = parser0.parse(s);\n assert(result != nullptr);\n for (int i = 0; i < (1<<11); i++){\n if (!eval(result, i)){\n cout << \"NO\" << endl;\n f = 0;\n break;\n }\n }\n if (f) cout << \"YES\" << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":4708,"score_of_the_acc":-1.2368,"final_rank":20},{"submission_id":"aoj_2401_10665817","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nstring S;\n\nbool var[11];\n\nbool read_for(int &i);\n\nbool read_equ(int &i){\n // cerr << i << \"!\\n\";\n bool ret1 = read_for(i);\n assert(S[i++] == '=');\n bool ret2 = read_for(i);\n return ret1 == ret2;\n}\n\nbool read_for(int &i){\n // cerr << i << \"\\n\";\n if(S[i] == 'T'){\n i++;\n return true;\n }else if(S[i] == 'F'){\n i++;\n return false;\n }else{\n if('a' <= S[i] && S[i] <= 'k'){\n return var[S[i++] - 'a'];\n }else{\n if(S[i] == '-'){\n i++;\n return !read_for(i);\n }else{\n assert(S[i++] == '(');\n bool ret1 = read_for(i);\n char op = S[i++];\n if(op == '-'){\n assert(S[i] == '>');\n i++;\n }\n bool ret2 = read_for(i);\n assert(S[i++] == ')');\n if(op == '*'){\n return ret1 & ret2;\n }else if(op == '+'){\n return ret1 | ret2;\n }else{\n assert(op == '-');\n return (!ret1) | ret2;\n }\n\n }\n }\n }\n}\n\nint main(){\n while(true){\n cin >> S;\n if(S == \"#\"){\n break;\n }\n string ans = \"YES\";\n for(int i = 0; i < 2048; i++){\n for(int j = 0; j < 11; j++){\n if((i >> j) & 1){\n var[j] = true;\n }else{\n var[j] = false;\n }\n }\n int index = 0;\n if(!read_equ(index)){\n ans = \"NO\";\n }\n }\n cout << ans << \"\\n\";\n }\n\n}","accuracy":1,"time_ms":40,"memory_kb":3584,"score_of_the_acc":-0.2154,"final_rank":12},{"submission_id":"aoj_2401_10573529","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\n// #include <atcoder/all>\n// using namespace atcoder;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\n\n// #include \"titan_cpplib/others/print.cpp\"\n\n\nclass Parser {\npublic:\n using T = char;\n\n string s;\n int n, ptr;\n\n Parser() {}\n Parser(string s) : s(s), n(s.size()), ptr(0) {}\n\n void consume(char expected) {\n if (next() != expected) {\n printf(\"Parser::Error: Expected `%c` but got `%c`\\n\", expected, next());\n assert(false);\n }\n ptr++;\n }\n\n char next() const {\n assert(ptr < n);\n return s[ptr];\n }\n\n bool done() const {\n return ptr == n;\n }\n\n bool is_digit(char c) const {\n return '0' <= c && c <= '9';\n }\n\n int number() {\n // cerr << \"number-start\" << endl;\n ll ret = 0;\n while (!done() && is_digit(next())) {\n char v = next();\n ret *= 10;\n ret += v - '0';\n consume(v);\n }\n // cerr << \"number-fin : \" << ret << endl;\n return ret;\n }\n\n // ------------------------------------\n\n void init() { ptr = 0; }\n\n T expression() {\n return expr(0);\n }\n\n T expr(int level) {\n // rep(_, level) {\n // cerr << \" \";\n // }\n // cerr << \" \" << next() << endl;\n\n assert(0 <= level && level <= 1);\n if (level <= 0) {\n T ret = expr(level+1);\n while (!done()) {\n if (next() == '*') {\n consume('*');\n T nxt = expr(level+1);\n if (ret == 'T' && nxt == 'T') {\n ret = 'T';\n } else {\n ret = 'F';\n }\n } else if (next() == '+') {\n consume('+');\n T nxt = expr(level+1);\n if (ret == 'F' && nxt == 'F') {\n ret = 'F';\n } else {\n ret = 'T';\n }\n } else if (next() == '-' && s[ptr+1] == '>') {\n consume('-');\n consume('>');\n T nxt = expr(level+1);\n if (ret == 'T' && nxt == 'F') {\n ret = 'F';\n } else {\n ret = 'T';\n }\n } else {\n break;\n }\n }\n return ret;\n } else {\n if (next() == '(') {\n consume('(');\n T ret = expr(0);\n consume(')');\n return ret;\n } else if (next() == '-') {\n // 前置の単項演算子\n consume('-');\n T nxt = expr(level);\n if (nxt == 'T') return 'F';\n if (nxt == 'F') return 'T';\n } else if (next() == 'T' || next() == 'F') {\n char x = next();\n consume(x);\n return x;\n }\n }\n assert(false);\n }\n\n T parse() {\n return expression();\n }\n};\n\nvoid solve() {\n string s;\n cin >> s;\n if (s == \"#\") {\n exit(0);\n }\n int n = s.size();\n string left, right;\n bool upd = false;\n rep(i, n) {\n if (s[i] == '=') {\n upd = true;\n continue;\n }\n if (!upd) {\n left += s[i];\n } else {\n right += s[i];\n }\n }\n // cerr << left << \" \" << right << endl;\n\n int cnt = 11;\n rep(bit, (1<<cnt)-1) {\n string left_t = left;\n string right_t = right;\n rep(i, left.size()) {\n rep(j, cnt) {\n if (left[i] == 'a'+j) {\n left_t[i] = (bit>>j&1) ? 'T' : 'F';\n }\n }\n }\n rep(i, right.size()) {\n rep(j, cnt) {\n if (right[i] == 'a'+j) {\n right_t[i] = (bit>>j&1) ? 'T' : 'F';\n }\n }\n }\n\n // cerr << left_t << endl;\n Parser p(left_t);\n char pres = p.parse();\n // cerr << \"pres=\" << pres << endl;\n\n // cerr << right_t << endl;\n Parser q(right_t);\n char qres = q.parse();\n // cerr << \"qres=\" << qres << endl;\n\n if (pres != qres) {\n cout << \"NO\" << endl;\n return;\n }\n }\n\n cout << \"YES\" << endl;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(15);\n\n int t = 1e9;// cin >> t;\n for (int i = 0; i < t; ++i) {\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3584,"score_of_the_acc":-0.2549,"final_rank":15},{"submission_id":"aoj_2401_10418437","code_snippet":"#pragma region // comavius::competitive library\n\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\n{ // 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\nnamespace comavius::competitive::sfinae\n{ // SFINAE : breaking changes are prohibited\n\n#pragma region // has_mul_op\n template <typename T, typename = void>\n struct has_multiply_operator : std::false_type\n {\n };\n template <typename T>\n struct has_multiply_operator<T, std::void_t<decltype(std::declval<T>() * std::declval<T>())>> : std::true_type\n {\n };\n#pragma endregion // has_mul_op\n\n#pragma region // has_forward_iterator\n template <typename T, typename = void>\n struct has_forward_iterator\n {\n static constexpr bool value = false;\n };\n\n template <typename T>\n struct has_forward_iterator<T, std::void_t<\n decltype(std::begin(std::declval<T &>())),\n decltype(std::end(std::declval<T &>())),\n typename T::iterator, // Tがiterator型を持つ\n decltype(++std::declval<typename T::iterator &>()),\n decltype(*std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() == std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() != std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() = std::declval<const typename T::iterator &>())>>\n {\n static constexpr bool value = true;\n };\n#pragma endregion // has_forward_iterator\n}\n\nnamespace comavius::competitive::algebraic_structures\n{\n // work in progress\n /*\n template <typename T>\n struct Monoid {\n\n };\n */\n}\n\nnamespace comavius::competitive\n{ // BFS\n\n class BFS\n {\n std::vector<std::vector<long long>> adjacency_list;\n long long number_of_nodes;\n\n public:\n BFS(std::vector<std::vector<long long>> adjacency_list_, long long number_of_nodes_)\n {\n this->adjacency_list = adjacency_list_;\n this->number_of_nodes = number_of_nodes_;\n }\n\n long long run(long long start_node, long long end_node)\n {\n std::vector<bool> visited(number_of_nodes, false);\n std::vector<long long> current_queue(1, start_node), next_queue;\n visited[start_node] = true;\n long long distance = 0;\n if (start_node == end_node)\n {\n return distance;\n }\n while (current_queue.size() != 0)\n {\n distance++;\n next_queue.clear();\n for (auto i : current_queue)\n {\n if (i == end_node)\n {\n return distance;\n }\n for (auto j : adjacency_list[i])\n {\n if (!visited[j])\n {\n visited[j] = true;\n next_queue.push_back(j);\n if (j == end_node)\n {\n return distance;\n }\n }\n }\n }\n current_queue = next_queue;\n }\n return (long long)-1;\n }\n };\n} // namespace comavius::competitive::BFS\n\nnamespace comavius::competitive\n{ // UnionFind\n\n class UnionFind\n {\n std::vector<long long> parent;\n std::vector<long long> rank;\n std::vector<long long> size;\n std::vector<long long> edge_count;\n\n public:\n UnionFind(long long num_nodes)\n {\n parent.resize(num_nodes, -1);\n rank.resize(num_nodes, 0);\n size.resize(num_nodes, 1);\n edge_count.resize(num_nodes, 0);\n }\n\n long long root_of(long long x)\n {\n if (parent[x] == -1)\n {\n return x;\n }\n else\n {\n return parent[x] = root_of(parent[x]);\n }\n }\n\n void unite(long long x, long long y)\n {\n long long rx = root_of(x);\n long long ry = root_of(y);\n if (rx == ry)\n {\n edge_count[rx]++;\n return;\n }\n else if (rank[rx] < rank[ry])\n {\n parent[rx] = ry;\n size[ry] += size[rx];\n edge_count[ry] += edge_count[rx] + 1;\n }\n else\n {\n parent[ry] = rx;\n size[rx] += size[ry];\n if (rank[rx] == rank[ry])\n rank[rx]++;\n edge_count[rx] += edge_count[ry] + 1;\n }\n return;\n }\n\n bool is_same(long long x, long long y)\n {\n return root_of(x) == root_of(y);\n }\n\n long long size_of(long long x)\n {\n return size[root_of(x)];\n }\n bool is_cycle(long long x)\n {\n return edge_count[root_of(x)] >= size[root_of(x)];\n }\n };\n} // namespace comavius::competitive::UnionFind\n\nnamespace comavius::competitive\n{ // get_primes\n\n std::vector<long long> get_primes(long long n)\n {\n std::vector<bool> is_prime(n + 1, true);\n std::vector<long long> primes;\n is_prime[0] = false;\n is_prime[1] = false;\n for (long long i = 2; i <= n; i++)\n {\n if (is_prime[i])\n {\n primes.push_back(i);\n for (long long j = 2 * i; j <= n; j += i)\n {\n is_prime[j] = false;\n }\n }\n }\n return primes;\n }\n} // namespace comavius::competitive::get_primes\n\nnamespace comavius::competitive\n{ // fast pow (repeated squaring)\n\n template <typename T>\n T fast_pow(T base, T neutral, long long exponent)\n {\n // check if T has multiply operator\n static_assert(sfinae::has_multiply_operator<T>::value, \"comavius::competitive::fast_pow : T must have operator*\");\n T ans = neutral;\n while (exponent > 0)\n {\n if (exponent % 2 == 1)\n {\n ans *= base;\n }\n base *= base;\n exponent /= 2;\n }\n return ans;\n }\n} // namespace comavius::competitive::fast_pow\n\nnamespace comavius::competitive\n{ // bipartite matching\n /*\n class BipartiteMatching {\n long long size, size_u, size_v;\n std::vector<long long> nodes_u, nodes_v;\n std::vector<std::vector<long long>> adjacency_list;\n\n };\n */\n}\n\nnamespace comavius::competitive\n{ // chmax/chmin\n template <typename T>\n concept HasMaxOverload = requires(T a, T b) {\n {\n std::max(a, b)\n } -> std::convertible_to<T>;\n };\n template <typename T>\n concept HasMinOverload = requires(T a, T b) {\n {\n std::min(a, b)\n } -> std::convertible_to<T>;\n };\n\n template <HasMaxOverload T>\n void chmax(T &a, T b)\n {\n a = std::max(a, b);\n }\n\n template <HasMinOverload T>\n void chmin(T &a, T b)\n {\n a = std::min(a, b);\n }\n\n}\n\nnamespace comavius::competitive\n{ // Print(stdout, stderr)\n\n#pragma region // formatting various type of values\n // is_vector structure\n template <typename T>\n struct is_vector : std::false_type\n {\n };\n template <typename T>\n struct is_vector<std::vector<T>> : std::true_type\n {\n };\n // is_pair structure\n template <typename T>\n struct is_pair : std::false_type\n {\n };\n template <typename T, typename U>\n struct is_pair<std::pair<T, U>> : std::true_type\n {\n };\n // is_iterator structure\n template <typename T, typename = void>\n struct is_iterator : std::false_type\n {\n };\n template <typename T>\n struct is_iterator<\n T,\n typename std::enable_if<\n !std::is_same<\n typename std::iterator_traits<T>::value_type,\n void>::value>::type> : std::true_type\n {\n };\n // generate std::string for stdout/stderr\n // std::string\n std::string generate_string(std::string s)\n {\n return s + \" \";\n }\n // char\n std::string generate_string(char c)\n {\n return std::string(1, c) + \" \";\n }\n // eger types\n template <typename T>\n typename std::enable_if_t<std::is_integral<T>::value, std::string>\n generate_string(T t)\n {\n return std::to_string(t) + \" \";\n }\n // floating point types\n template <typename T>\n typename std::enable_if_t<std::is_floating_point<T>::value, std::string>\n generate_string(T t)\n {\n return std::to_string(t) + \" \";\n }\n // container with forward iterator\n template <typename T>\n typename std::enable_if_t<sfinae::has_forward_iterator<T>::value, std::string>\n generate_string(T t)\n {\n std::string s = \"\";\n for (auto i = t.begin(); i != t.end(); i++)\n {\n s += generate_string(*i);\n s += \" \";\n }\n s += \"\\n\";\n return s;\n }\n // std::pair\n template <typename T>\n typename std::enable_if_t<is_pair<T>::value, std::string>\n generate_string(T t)\n {\n return generate_string(t.first) + generate_string(t.second);\n }\n // std::iterator\n template <typename T>\n typename std::enable_if_t<is_iterator<T>::value, std::string>\n generate_string(T begin, T end)\n {\n std::string s = \"\";\n for (auto i = begin; i != end; i++)\n {\n s += generate_string(*i);\n s += \" \";\n }\n s += \"\\n\";\n return s;\n }\n#pragma endregion // formatting various type of values\n\n // color enum-class\n enum class Color\n {\n BLACK,\n RED,\n GREEN,\n YELLOW,\n BLUE,\n MAGENTA,\n CYAN,\n WHITE,\n DEFAULT\n };\n\n // ansi code color\n std::string get_ansi_color(Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::string ansi_code;\n switch (color)\n {\n case Color::BLACK:\n ansi_code = \"\\033[30m\\033[1m\";\n break;\n case Color::RED:\n ansi_code = \"\\033[31m\\033[1m\";\n break;\n case Color::GREEN:\n ansi_code = \"\\033[32m\\033[1m\";\n break;\n case Color::YELLOW:\n ansi_code = \"\\033[33m\\033[1m\";\n break;\n case Color::BLUE:\n ansi_code = \"\\033[34m\\033[1m\";\n break;\n case Color::MAGENTA:\n ansi_code = \"\\033[35m\\033[1m\";\n break;\n case Color::CYAN:\n ansi_code = \"\\033[36m\\033[1m\";\n break;\n case Color::WHITE:\n ansi_code = \"\\033[37m\";\n break;\n case Color::DEFAULT:\n ansi_code = \"\\033[0m\";\n break;\n }\n return ansi_code;\n }\n else\n {\n return \"\";\n }\n }\n\n#pragma region // Print to stdout\n // default color(native)\n template <typename T>\n void print(T t)\n {\n std::cout << generate_string(t);\n }\n // with iterator range\n template <typename T>\n void print(T begin, T end)\n {\n std::cout << generate_string(begin, end);\n }\n // print\"ln\"\n template <typename T>\n void println(T t)\n {\n print(t);\n std::cout << \"\\n\";\n }\n // print\"ln\" with iterator range\n template <typename T>\n void println(T begin, T end)\n {\n print(begin, end);\n std::cout << \"\\n\";\n }\n // yes or no\n void yneos(bool a)\n {\n if (a)\n {\n println(\"Yes\");\n }\n else\n {\n println(\"No\");\n }\n }\n#pragma endregion // Print to stdout\n\n#pragma region // ePrint to stderr\n // default color(Color::CYAN)\n template <typename T>\n void errprint(T t)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::cerr << get_ansi_color(Color::RED) << generate_string(t) << get_ansi_color(Color::DEFAULT);\n }\n }\n // set color\n template <typename T>\n void errprint(T t, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::cerr << get_ansi_color(color) << generate_string(t) << get_ansi_color(Color::DEFAULT);\n }\n }\n // print\"ln\"\n template <typename T>\n void errprintln(T t)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(t);\n std::cerr << \"\\n\";\n }\n }\n template <typename T>\n void errprintln(T t, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(t, color);\n std::cerr << \"\\n\";\n }\n }\n // print\"ln\" with iterator range\n template <typename T>\n void errprintln(T begin, T end)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(begin, end);\n std::cerr << \"\\n\";\n }\n }\n template <typename T>\n void errprintln(T begin, T end, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(begin, end, color);\n std::cerr << \"\\n\";\n }\n }\n // debug print\n void debug()\n {\n errprintln(\"DEBUG\", Color::MAGENTA);\n }\n#pragma endregion // ePrint to stderr\n\n} // namespace comavius::competitive print\n\n\n\nnamespace comavius::competitive\n{ // initial settings\n void initial_settings()\n {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::setprecision(15);\n std::cerr << std::setprecision(15);\n }\n} // namespace comavius::competitive::initial_settings\n\n#pragma region // Read macro\n#define GET_1_ARG(TYPE, ARG) \\\n ; \\\n TYPE ARG; \\\n 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) \\\n std::vector<TYPE> NAME(SIZE); \\\n for (long long i = 0; i < SIZE; i++) \\\n std::cin >> NAME[i];\n#define readvv(TYPE, NAME, H, W) \\\n std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); \\\n for (long long i = 0; i < H; i++) \\\n for (long long j = 0; j < W; j++) \\\n 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\nusing namespace std;\nusing namespace comavius::competitive;\n#pragma endregion // namespace expansion\n\n#pragma endregion // comavius::competitive library\n\n//#include <atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\nusing vvpll = vec<vec<pll>>;\n\nusing namespace std;\n\nstr replace(str s, ll bits) {\n str vs = \"abcedfghijk\";\n ll n = s.size();\n rep(i, n) {\n rep(j, vs.size()) {\n if (s[i] == vs[j]) {\n if (((bits >> j) & 1) == 0) {\n s[i] = 'T';\n }\n else {\n s[i] = 'F';\n }\n }\n }\n }\n str s2;\n rep(i, n){\n if (s[i] == '-' && i != n-1 && s[i+1] == '>') {\n s2.push_back('&');\n i++;\n }\n else {\n s2.push_back(s[i]);\n }\n }\n return s2;\n}\n\nchar myminus(char c) {\n if (c == 'T') {\n return 'F';\n }\n else {\n return 'T';\n }\n}\n\nchar myprod(char l, char r) {\n if (l == 'T' && r == 'T') {\n return 'T';\n }\n else {\n return 'F';\n }\n}\n\nchar myadd(char l, char r) {\n if (l == 'T' || r == 'T') {\n return 'T';\n }\n else {\n return 'F';\n }\n}\n\nchar myimply(char l, char r) {\n if (l == 'T' && r == 'F') {\n return 'F';\n }\n else {\n return 'T';\n }\n}\n\nbool eval(str s) {\n ll n = s.size();\n str stack;\n reverse(all(s));\n while (s.size()) {\n char c = s.back();\n s.pop_back();\n if (c == 'T' || c == 'F') {\n if (stack.size() != 0) {\n if (stack.back() == '(') {\n stack.push_back(c);\n }\n else {\n char op = stack.back();\n stack.pop_back();\n if (op == '-') {\n s.push_back(myminus(c));\n }\n else {\n char left = stack.back();\n stack.pop_back();\n if (op == '*') {\n s.push_back(myprod(left, c));\n }\n else if (op == '+') {\n s.push_back(myadd(left, c));\n }\n else {\n s.push_back(myimply(left, c));\n }\n }\n }\n }\n else {\n stack.push_back(c);\n }\n }\n else if (c == ')') {\n char prev = stack.back();\n stack.pop_back();\n stack.pop_back();\n s.push_back(prev);\n }\n else {\n stack.push_back(c);\n }\n //cerr << stack << \" \" << s << endl;\n }\n //cerr <<\"finally \"<<stack << endl;\n if (stack[0] == 'T') {\n return true;\n }\n else {\n return false;\n }\n}\n\nint main() {\n read(str, s);\n do {\n ll n = s.size();\n ll eqidx;\n rep(i, n) {\n if (s[i] == '=') {\n eqidx = i;\n }\n }\n str left = s.substr(0, eqidx);\n str right = s.substr(eqidx+1, n - eqidx);\n //cerr << left << \"\\n\" << right << endl;\n bool ok = true;\n rep(bits, (1ll << 11)) {\n str l = replace(left, bits);\n str r = replace(right, bits);\n //cerr << l << endl;\n bool l_b = eval(l);\n bool r_b = eval(r);\n if (l_b != r_b) {\n ok = false;\n break;\n }\n }\n if (ok) {\n cout << \"YES\\n\";\n }\n else {\n cout << \"NO\\n\";\n }\n cin >> s;\n } while (s != \"#\");\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-0.2417,"final_rank":13},{"submission_id":"aoj_2401_10418433","code_snippet":"#pragma region // comavius::competitive library\n\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\n{ // 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\nnamespace comavius::competitive::sfinae\n{ // SFINAE : breaking changes are prohibited\n\n#pragma region // has_mul_op\n template <typename T, typename = void>\n struct has_multiply_operator : std::false_type\n {\n };\n template <typename T>\n struct has_multiply_operator<T, std::void_t<decltype(std::declval<T>() * std::declval<T>())>> : std::true_type\n {\n };\n#pragma endregion // has_mul_op\n\n#pragma region // has_forward_iterator\n template <typename T, typename = void>\n struct has_forward_iterator\n {\n static constexpr bool value = false;\n };\n\n template <typename T>\n struct has_forward_iterator<T, std::void_t<\n decltype(std::begin(std::declval<T &>())),\n decltype(std::end(std::declval<T &>())),\n typename T::iterator, // Tがiterator型を持つ\n decltype(++std::declval<typename T::iterator &>()),\n decltype(*std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() == std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() != std::declval<typename T::iterator &>()),\n decltype(std::declval<typename T::iterator &>() = std::declval<const typename T::iterator &>())>>\n {\n static constexpr bool value = true;\n };\n#pragma endregion // has_forward_iterator\n}\n\nnamespace comavius::competitive::algebraic_structures\n{\n // work in progress\n /*\n template <typename T>\n struct Monoid {\n\n };\n */\n}\n\nnamespace comavius::competitive\n{ // BFS\n\n class BFS\n {\n std::vector<std::vector<long long>> adjacency_list;\n long long number_of_nodes;\n\n public:\n BFS(std::vector<std::vector<long long>> adjacency_list_, long long number_of_nodes_)\n {\n this->adjacency_list = adjacency_list_;\n this->number_of_nodes = number_of_nodes_;\n }\n\n long long run(long long start_node, long long end_node)\n {\n std::vector<bool> visited(number_of_nodes, false);\n std::vector<long long> current_queue(1, start_node), next_queue;\n visited[start_node] = true;\n long long distance = 0;\n if (start_node == end_node)\n {\n return distance;\n }\n while (current_queue.size() != 0)\n {\n distance++;\n next_queue.clear();\n for (auto i : current_queue)\n {\n if (i == end_node)\n {\n return distance;\n }\n for (auto j : adjacency_list[i])\n {\n if (!visited[j])\n {\n visited[j] = true;\n next_queue.push_back(j);\n if (j == end_node)\n {\n return distance;\n }\n }\n }\n }\n current_queue = next_queue;\n }\n return (long long)-1;\n }\n };\n} // namespace comavius::competitive::BFS\n\nnamespace comavius::competitive\n{ // UnionFind\n\n class UnionFind\n {\n std::vector<long long> parent;\n std::vector<long long> rank;\n std::vector<long long> size;\n std::vector<long long> edge_count;\n\n public:\n UnionFind(long long num_nodes)\n {\n parent.resize(num_nodes, -1);\n rank.resize(num_nodes, 0);\n size.resize(num_nodes, 1);\n edge_count.resize(num_nodes, 0);\n }\n\n long long root_of(long long x)\n {\n if (parent[x] == -1)\n {\n return x;\n }\n else\n {\n return parent[x] = root_of(parent[x]);\n }\n }\n\n void unite(long long x, long long y)\n {\n long long rx = root_of(x);\n long long ry = root_of(y);\n if (rx == ry)\n {\n edge_count[rx]++;\n return;\n }\n else if (rank[rx] < rank[ry])\n {\n parent[rx] = ry;\n size[ry] += size[rx];\n edge_count[ry] += edge_count[rx] + 1;\n }\n else\n {\n parent[ry] = rx;\n size[rx] += size[ry];\n if (rank[rx] == rank[ry])\n rank[rx]++;\n edge_count[rx] += edge_count[ry] + 1;\n }\n return;\n }\n\n bool is_same(long long x, long long y)\n {\n return root_of(x) == root_of(y);\n }\n\n long long size_of(long long x)\n {\n return size[root_of(x)];\n }\n bool is_cycle(long long x)\n {\n return edge_count[root_of(x)] >= size[root_of(x)];\n }\n };\n} // namespace comavius::competitive::UnionFind\n\nnamespace comavius::competitive\n{ // get_primes\n\n std::vector<long long> get_primes(long long n)\n {\n std::vector<bool> is_prime(n + 1, true);\n std::vector<long long> primes;\n is_prime[0] = false;\n is_prime[1] = false;\n for (long long i = 2; i <= n; i++)\n {\n if (is_prime[i])\n {\n primes.push_back(i);\n for (long long j = 2 * i; j <= n; j += i)\n {\n is_prime[j] = false;\n }\n }\n }\n return primes;\n }\n} // namespace comavius::competitive::get_primes\n\nnamespace comavius::competitive\n{ // fast pow (repeated squaring)\n\n template <typename T>\n T fast_pow(T base, T neutral, long long exponent)\n {\n // check if T has multiply operator\n static_assert(sfinae::has_multiply_operator<T>::value, \"comavius::competitive::fast_pow : T must have operator*\");\n T ans = neutral;\n while (exponent > 0)\n {\n if (exponent % 2 == 1)\n {\n ans *= base;\n }\n base *= base;\n exponent /= 2;\n }\n return ans;\n }\n} // namespace comavius::competitive::fast_pow\n\nnamespace comavius::competitive\n{ // bipartite matching\n /*\n class BipartiteMatching {\n long long size, size_u, size_v;\n std::vector<long long> nodes_u, nodes_v;\n std::vector<std::vector<long long>> adjacency_list;\n\n };\n */\n}\n\nnamespace comavius::competitive\n{ // chmax/chmin\n template <typename T>\n concept HasMaxOverload = requires(T a, T b) {\n {\n std::max(a, b)\n } -> std::convertible_to<T>;\n };\n template <typename T>\n concept HasMinOverload = requires(T a, T b) {\n {\n std::min(a, b)\n } -> std::convertible_to<T>;\n };\n\n template <HasMaxOverload T>\n void chmax(T &a, T b)\n {\n a = std::max(a, b);\n }\n\n template <HasMinOverload T>\n void chmin(T &a, T b)\n {\n a = std::min(a, b);\n }\n\n}\n\nnamespace comavius::competitive\n{ // Print(stdout, stderr)\n\n#pragma region // formatting various type of values\n // is_vector structure\n template <typename T>\n struct is_vector : std::false_type\n {\n };\n template <typename T>\n struct is_vector<std::vector<T>> : std::true_type\n {\n };\n // is_pair structure\n template <typename T>\n struct is_pair : std::false_type\n {\n };\n template <typename T, typename U>\n struct is_pair<std::pair<T, U>> : std::true_type\n {\n };\n // is_iterator structure\n template <typename T, typename = void>\n struct is_iterator : std::false_type\n {\n };\n template <typename T>\n struct is_iterator<\n T,\n typename std::enable_if<\n !std::is_same<\n typename std::iterator_traits<T>::value_type,\n void>::value>::type> : std::true_type\n {\n };\n // generate std::string for stdout/stderr\n // std::string\n std::string generate_string(std::string s)\n {\n return s + \" \";\n }\n // char\n std::string generate_string(char c)\n {\n return std::string(1, c) + \" \";\n }\n // eger types\n template <typename T>\n typename std::enable_if_t<std::is_integral<T>::value, std::string>\n generate_string(T t)\n {\n return std::to_string(t) + \" \";\n }\n // floating point types\n template <typename T>\n typename std::enable_if_t<std::is_floating_point<T>::value, std::string>\n generate_string(T t)\n {\n return std::to_string(t) + \" \";\n }\n // container with forward iterator\n template <typename T>\n typename std::enable_if_t<sfinae::has_forward_iterator<T>::value, std::string>\n generate_string(T t)\n {\n std::string s = \"\";\n for (auto i = t.begin(); i != t.end(); i++)\n {\n s += generate_string(*i);\n s += \" \";\n }\n s += \"\\n\";\n return s;\n }\n // std::pair\n template <typename T>\n typename std::enable_if_t<is_pair<T>::value, std::string>\n generate_string(T t)\n {\n return generate_string(t.first) + generate_string(t.second);\n }\n // std::iterator\n template <typename T>\n typename std::enable_if_t<is_iterator<T>::value, std::string>\n generate_string(T begin, T end)\n {\n std::string s = \"\";\n for (auto i = begin; i != end; i++)\n {\n s += generate_string(*i);\n s += \" \";\n }\n s += \"\\n\";\n return s;\n }\n#pragma endregion // formatting various type of values\n\n // color enum-class\n enum class Color\n {\n BLACK,\n RED,\n GREEN,\n YELLOW,\n BLUE,\n MAGENTA,\n CYAN,\n WHITE,\n DEFAULT\n };\n\n // ansi code color\n std::string get_ansi_color(Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::string ansi_code;\n switch (color)\n {\n case Color::BLACK:\n ansi_code = \"\\033[30m\\033[1m\";\n break;\n case Color::RED:\n ansi_code = \"\\033[31m\\033[1m\";\n break;\n case Color::GREEN:\n ansi_code = \"\\033[32m\\033[1m\";\n break;\n case Color::YELLOW:\n ansi_code = \"\\033[33m\\033[1m\";\n break;\n case Color::BLUE:\n ansi_code = \"\\033[34m\\033[1m\";\n break;\n case Color::MAGENTA:\n ansi_code = \"\\033[35m\\033[1m\";\n break;\n case Color::CYAN:\n ansi_code = \"\\033[36m\\033[1m\";\n break;\n case Color::WHITE:\n ansi_code = \"\\033[37m\";\n break;\n case Color::DEFAULT:\n ansi_code = \"\\033[0m\";\n break;\n }\n return ansi_code;\n }\n else\n {\n return \"\";\n }\n }\n\n#pragma region // Print to stdout\n // default color(native)\n template <typename T>\n void print(T t)\n {\n std::cout << generate_string(t);\n }\n // with iterator range\n template <typename T>\n void print(T begin, T end)\n {\n std::cout << generate_string(begin, end);\n }\n // print\"ln\"\n template <typename T>\n void println(T t)\n {\n print(t);\n std::cout << \"\\n\";\n }\n // print\"ln\" with iterator range\n template <typename T>\n void println(T begin, T end)\n {\n print(begin, end);\n std::cout << \"\\n\";\n }\n // yes or no\n void yneos(bool a)\n {\n if (a)\n {\n println(\"Yes\");\n }\n else\n {\n println(\"No\");\n }\n }\n#pragma endregion // Print to stdout\n\n#pragma region // ePrint to stderr\n // default color(Color::CYAN)\n template <typename T>\n void errprint(T t)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::cerr << get_ansi_color(Color::RED) << generate_string(t) << get_ansi_color(Color::DEFAULT);\n }\n }\n // set color\n template <typename T>\n void errprint(T t, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n std::cerr << get_ansi_color(color) << generate_string(t) << get_ansi_color(Color::DEFAULT);\n }\n }\n // print\"ln\"\n template <typename T>\n void errprintln(T t)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(t);\n std::cerr << \"\\n\";\n }\n }\n template <typename T>\n void errprintln(T t, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(t, color);\n std::cerr << \"\\n\";\n }\n }\n // print\"ln\" with iterator range\n template <typename T>\n void errprintln(T begin, T end)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(begin, end);\n std::cerr << \"\\n\";\n }\n }\n template <typename T>\n void errprintln(T begin, T end, Color color)\n {\n if (IS_TEST_ENVIROMENT)\n {\n errprint(begin, end, color);\n std::cerr << \"\\n\";\n }\n }\n // debug print\n void debug()\n {\n errprintln(\"DEBUG\", Color::MAGENTA);\n }\n#pragma endregion // ePrint to stderr\n\n} // namespace comavius::competitive print\n\n\n\nnamespace comavius::competitive\n{ // initial settings\n void initial_settings()\n {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::setprecision(15);\n std::cerr << std::setprecision(15);\n }\n} // namespace comavius::competitive::initial_settings\n\n#pragma region // Read macro\n#define GET_1_ARG(TYPE, ARG) \\\n ; \\\n TYPE ARG; \\\n 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) \\\n std::vector<TYPE> NAME(SIZE); \\\n for (long long i = 0; i < SIZE; i++) \\\n std::cin >> NAME[i];\n#define readvv(TYPE, NAME, H, W) \\\n std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); \\\n for (long long i = 0; i < H; i++) \\\n for (long long j = 0; j < W; j++) \\\n 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\nusing namespace std;\nusing namespace comavius::competitive;\n#pragma endregion // namespace expansion\n\n#pragma endregion // comavius::competitive library\n\n//#include <atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\nusing vvpll = vec<vec<pll>>;\n\nusing namespace std;\n\nstr replace(str s, ll bits) {\n str vs = \"abcedfghijk\";\n ll n = s.size();\n rep(i, n) {\n rep(j, vs.size()) {\n if (s[i] == vs[j]) {\n if ((bits >> j) & 1) {\n s[i] = 'T';\n }\n else {\n s[i] = 'F';\n }\n }\n }\n }\n str s2;\n rep(i, n){\n if (s[i] == '-' && i != n-1 && s[i+1] == '>') {\n s2.push_back('&');\n i++;\n }\n else {\n s2.push_back(s[i]);\n }\n }\n return s2;\n}\n\nchar myminus(char c) {\n if (c == 'T') {\n return 'F';\n }\n else {\n return 'T';\n }\n}\n\nchar myprod(char l, char r) {\n if (l == 'T' && r == 'T') {\n return 'T';\n }\n else {\n return 'F';\n }\n}\n\nchar myadd(char l, char r) {\n if (l == 'T' || r == 'T') {\n return 'T';\n }\n else {\n return 'F';\n }\n}\n\nchar myimply(char l, char r) {\n if (l == 'T' && r == 'F') {\n return 'F';\n }\n else {\n return 'T';\n }\n}\n\nbool eval(str s) {\n ll n = s.size();\n str stack;\n reverse(all(s));\n while (s.size()) {\n char c = s.back();\n s.pop_back();\n if (c == 'T' || c == 'F') {\n if (stack.size() != 0) {\n if (stack.back() == '(') {\n stack.push_back(c);\n }\n else {\n char op = stack.back();\n stack.pop_back();\n if (op == '-') {\n s.push_back(myminus(c));\n }\n else {\n char left = stack.back();\n stack.pop_back();\n if (op == '*') {\n s.push_back(myprod(left, c));\n }\n else if (op == '+') {\n s.push_back(myadd(left, c));\n }\n else {\n s.push_back(myimply(left, c));\n }\n }\n }\n }\n else {\n stack.push_back(c);\n }\n }\n else if (c == ')') {\n char prev = stack.back();\n stack.pop_back();\n stack.pop_back();\n s.push_back(prev);\n }\n else {\n stack.push_back(c);\n }\n //cerr << stack << \" \" << s << endl;\n }\n //cerr <<\"finally \"<<stack << endl;\n if (stack[0] == 'T') {\n return true;\n }\n else {\n return false;\n }\n}\n\nint main() {\n read(str, s);\n do {\n ll n = s.size();\n ll eqidx;\n rep(i, n) {\n if (s[i] == '=') {\n eqidx = i;\n }\n }\n str left = s.substr(0, eqidx);\n str right = s.substr(eqidx+1, n - eqidx);\n //cerr << left << \"\\n\" << right << endl;\n bool ok = true;\n rep(bits, (1ll << 11)) {\n str l = replace(left, bits);\n str r = replace(right, bits);\n //cerr << l << endl;\n bool l_b = eval(l);\n bool r_b = eval(r);\n if (l_b != r_b) {\n ok = false;\n break;\n }\n }\n if (ok) {\n cout << \"YES\\n\";\n }\n else {\n cout << \"NO\\n\";\n }\n cin >> s;\n } while (s != \"#\");\n}","accuracy":1,"time_ms":60,"memory_kb":3584,"score_of_the_acc":-0.2417,"final_rank":13},{"submission_id":"aoj_2401_10418222","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define rep2(i, a, b) rep3(i, a, b, 1)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep0(n) rep1(aaaaa, n)\n#define ov4(a, b, c, d, name, ...) name\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\n#define fore(e, v) for (auto&& e : v)\n#define all(a) begin(a), end(a)\n#define sz(a) (int)(size(a))\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\n#define eb emplace_back\n\ntemplate <typename T, typename S>\nbool chmin(T& a, const S& b) {\n return a > b ? a = b, 1 : 0;\n}\ntemplate <typename T, typename S>\nbool chmax(T& a, const S& b) {\n return a < b ? a = b, 1 : 0;\n}\nconst int INF = 1e9 + 100;\nconst ll INFL = 3e18 + 100;\n#define i128 __int128_t\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nvoid solve();\nint main(){\n while(1)solve();\n}\n\narray<int,11> val;\nbool TF(string S){\n // cerr<<S<<endl;\n int N=sz(S);\n if(S[0]=='-'){\n string ns;\n rep(i,1,N)ns.push_back(S[i]);\n return !TF(ns);\n }\n if(N==1){\n switch(S[0]){\n case 'T':return true;\n case 'F':return false;\n default :return val[S[0]-'a'];\n }\n }\n if(!(S[0]=='('&&S.back()==')'))exit(0);\n int c=0;\n string L,R;\n int idx;\n char op='/';\n for(idx=1;idx<N-1;idx++){\n if(c==0&&(S[idx]=='*'||S[idx]=='+'||S.substr(idx,2)==\"->\")){\n op=S[idx];\n if(op=='-')idx++;\n break;\n }\n if(S[idx]=='(')c++;\n if(S[idx]==')')c--;\n L.push_back(S[idx]);\n }\n for(++idx;idx<N-1;idx++){\n R.push_back(S[idx]);\n }\n bool l=TF(L),r=TF(R);\n if(op=='*')return l&&r;\n if(op=='+')return l||r;\n if(op=='-')return (!l)||r;\n assert(false);\n}\n\nvoid solve(){\n string Si;\n cin>>Si;\n if(Si==\"#\")exit(0);\n string S;\n fore(i,Si){\n if(!S.empty()&&S.back()=='-'&&i=='-')S.pop_back();\n else S.push_back(i);\n }\n string L,R;\n int idx=0;\n for(;idx<sz(S);idx++){\n if(S[idx]=='='){\n idx++;\n break;\n }\n L.push_back(S[idx]);\n }\n for(;idx<sz(S);idx++){\n R.push_back(S[idx]);\n }\n rep(i,1<<11){\n rep(j,11){\n val[j]=i>>j&1;\n if(TF(L)!=TF(R)){\n cout<<\"NO\\n\";\n return;\n }\n }\n }\n cout<<\"YES\\n\";\n}","accuracy":1,"time_ms":770,"memory_kb":3584,"score_of_the_acc":-1.176,"final_rank":19},{"submission_id":"aoj_2401_10417982","code_snippet":"/**\n\tauthor: shobonvip\n\tcreated: 2025.04.24 17:46:57\n**/\n\n#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#define all(v) v.begin(), v.end()\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\nstring so;\n\nstring s;\nint piv = 0;\nint jokyo = 0;\n\nbool formula();\n\nbool formula() {\n\tif (s[piv]=='T'){\n\t\tpiv++;\n\t\treturn true;\n\t}\n\tif (s[piv]=='F'){\n\t\tpiv++;\n\t\treturn false;\n\t}\n\n\tif ('a'<=s[piv]&&s[piv]<='k') {\n\t\tint dar=s[piv]-'a';\n\t\tpiv++;\n\t\tif((jokyo>>dar)&1){\n\t\t\treturn true;\n\t\t}else{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (s[piv]=='-'){\n\t\tpiv++;\n\t\tbool ret=formula();\n\t\tif(ret)return false;\n\t\telse return true;\n\t}\n\n\tif (s[piv]=='(') {\n\n\t\tpiv++;\n\t\tbool ret1=formula();\n\t\tchar c=s[piv];\n\t\tif(c=='-'){\n\t\t\tpiv++;\n\t\t\tc=s[piv];\n\t\t}\n\t\tpiv++;\n\t\tbool ret2=formula();\n\t\tpiv++;\n\t\tif(c=='*'){\n\t\t\tif(ret1&&ret2){\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}else if(c=='+'){\n\t\t\tif(ret1||ret2){\n\t\t\t\treturn true;\n\t\t\t}else{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}else{\n\t\t\tif(!ret1)return true;\n\t\t\tif(ret2)return true;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tassert(false);\n}\n\nvoid solve() {\n\tpiv = 0;\n\tstring t1 = \"\";\n\tstring t2 = \"\";\n\tbool modes = 0;\n\trep(i,0,(int)so.size()) {\n\t\tif (so[i]=='=') {\n\t\t\tmodes=1;\n\t\t}else{\n\t\t\tif(modes){\n\t\t\t\tt2+=so[i];\n\t\t\t}else{\n\t\t\t\tt1+=so[i];\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<bool> var1(1<<11);\n\tvector<bool> var2(1<<11);\n\n\ts=t1;\n\trep(i,0,1<<11){\n\t\tjokyo=i;\n\t\tpiv=0;\n\t\tvar1[i]=formula();\n\t}\n\ts=t2;\n\trep(i,0,1<<11){\n\t\tjokyo=i;\n\t\tpiv=0;\n\t\tvar2[i]=formula();\n\t}\n\n\tif(var1==var2){\n\t\tcout<<\"YES\\n\";\n\t}else{\n\t\tcout<<\"NO\\n\";\n\t}\n}\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n\twhile(true) {\n\t\tcin >> so;\n\t\tif (so == \"#\") break;\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3420,"score_of_the_acc":-0.0557,"final_rank":3},{"submission_id":"aoj_2401_10308908","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl '\\n'\ntypedef long long int ll;\ntypedef long double ld;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntemplate <typename T> istream &operator >>(istream &in, pair<T,T> &a) {in >> a.first >> a.second; return in;}\ntemplate <typename T> ostream &operator <<(ostream &out, pair<T,T> &a) {out << a.first << ' ' << a.second; return out;}\ntemplate <typename T> pair<T,T> operator - (pair<T,T> a, pair<T,T> b){return {a.first-b.first, a.second-b.second};}\n\nvoid tokenize(const string& s, char delimiter, vector<string> &out) {\n\tvector<string> tokens;\n\tstringstream ss(s);\n\tstring token;\n\twhile (getline(ss, token, delimiter)) out.push_back(token);\n}\n\nvoid parse(string &s, string &out)\n{\n\tstack<char> op_stack;\n\tunordered_map<char, int> precedence = {{'-', 4}, {'*', 3}, {'+', 2}, {'>', 1}, {'(', 0} };\n\n\tfor ( int i = 0 ; i < s.size() ; i ++ )\n\t{\n\t\tauto c = s[i];\n\t\tif ( c == 'T' || c == 'F' || 'a' <= c && c <= 'z' )\n\t\t\tout.push_back(c);\n\t\telse if ( c == '(')\n\t\t\top_stack.emplace('(');\n\t\telse if ( c == ')' )\n\t\t{\n\t\t\twhile (!op_stack.empty() && op_stack.top() != '(') {\n\t\t\t\tout.push_back(op_stack.top());\n\t\t\t\top_stack.pop();\n\t\t\t}\n\t\t\top_stack.pop();\n\t\t}\n\t\telse if ( c == '-' || c == '+' || c == '*' )\n\t\t{\n\t\t\tif ( i + 1 < s.size() && s[i+1] == '>' ) c = s[++i];\n\t\t\twhile (!op_stack.empty() && precedence[op_stack.top()] > precedence[c]) {\n\t\t\t\tout.push_back(op_stack.top());\n\t\t\t\top_stack.pop();\n\t\t\t}\n\t\t\top_stack.push(c);\n\t\t}\n\t}\n\twhile (!op_stack.empty()) {\n\t\tout.push_back(op_stack.top());\n\t\top_stack.pop();\n\t}\n}\n\nbool calc(string &expr, vector<bool> &val)\n{\n\tbool b;\n\tstack<bool> st;\n\tfor (auto c: expr )\n\t{\n\t\tif ( c == 'T' ) st.push(true);\n\t\telse if ( c == 'F' ) st.push(false);\n\t\telse if ( 'a' <= c && c <= 'z' ) st.push(val[c-'a']);\n\t\telse if ( c == '-' ) st.top() = !st.top();\n\t\telse if ( c == '*' )\n\t\t{\n\t\t\tb = st.top(); st.pop();\n\t\t\tst.top() = st.top() && b;\n\t\t}\n\t\telse if ( c == '+' )\n\t\t{\n\t\t\tb = st.top(); st.pop();\n\t\t\tst.top() = st.top() || b;\n\t\t}\n\t\telse if ( c == '>' )\n\t\t{\n\t\t\tb = st.top(); st.pop();\n\t\t\tst.top() = ( !st.top() || ( b && st.top() ));\n\t\t}\n\t}\n\tassert ( st.size() == 1 );\n\treturn st.top();\n}\nvoid sol(int Case) {\n\tstring s;\n\twhile ( getline(cin, s) && s != \"#\")\n\t{\n\t\tvector<string> equations ;\n\t\ttokenize(s, '=', equations);\n\t\tvector<string> postfix(equations.size());\n\t\tfor ( int i = 0 ; i < equations.size() ; i ++ )\n\t\t\tparse(equations[i], postfix[i]);\n\n\t\tvector<bool> val(11);\n\t\tint MaxN = 1 << 11;\n\n\t\tvector<bool> answer(equations.size());\n\t\tbool ans = true;\n\t\tfor ( int v = 0 ; v < MaxN && ans ; v++ )\n\t\t{\n\t\t\tfor ( int j = 0 ; j < 11 ; j ++ )\n\t\t\t\tval[j] = ( ( v >> j ) & 1 ) ? true : false;\n\n\t\t\tfor ( int j = 0 ; j < equations.size() && ans ; j ++ )\n\t\t\t\tanswer[j] = calc(postfix[j], val);\n\n\t\t\tfor ( int j = 1 ; j < equations.size() && ans ; j ++ )\n\t\t\t\tans = answer[j-1] == answer[j];\n\t\t}\n\t\tif ( ans ) cout << \"YES\\n\";\n\t\telse cout << \"NO\\n\";\n\t}\n}\n\nint main()\n{\n#ifdef AJAVA_DEBUG\nfreopen(\"input.txt\", \"rt\", stdin);freopen(\"output.txt\", \"wt\", stdout);\n#endif\n cin.tie(nullptr)->sync_with_stdio(false);\n\tint T=1; \n\t// cin >> T;\n\tfor (int i = 1 ; i <= T ; i ++ ) sol(i);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3492,"score_of_the_acc":-0.1085,"final_rank":9},{"submission_id":"aoj_2401_10010444","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\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 overload(a, b, c, d, ...) d\n#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)\n#define all(a) begin(a), end(a)\n#define sz(a) ssize(a)\nbool chmin(auto& a, auto b) {\n return a > b ? a = b, 1 : 0;\n}\nbool chmax(auto& a, auto b) {\n return a < b ? a = b, 1 : 0;\n}\n\nstruct Parser {\n using CopyIter = string::const_iterator;\n using Iter = CopyIter&;\n string line;\n CopyIter ed;\n Parser(string s): line(s) {}\n bool parse() {\n auto it = line.cbegin();\n ed = line.cend();\n return formula(it);\n }\n void skip(Iter it, char c) {\n assert(*it == c);\n // cerr << *it << ' ' << c << endl;\n it++;\n }\n bool formula(Iter it) {\n if (*it == 'T') {\n skip(it, 'T');\n return true;\n } else if (*it == 'F') {\n skip(it, 'F');\n return false;\n } else if (*it == '-') {\n skip(it, '-');\n return true ^ formula(it);\n } else {\n skip(it, '(');\n bool L = formula(it);\n if (*it == '*') {\n skip(it, '*');\n auto R = formula(it);\n L = L && R;\n } else if (*it == '+') {\n skip(it, '+');\n auto R = formula(it);\n L = L || R;\n } else {\n skip(it, '-');\n skip(it, '>');\n auto R = formula(it);\n L = !L || R;\n }\n skip(it, ')');\n return L;\n }\n }\n};\n\nbool solve() {\n string s;\n getline(cin, s);\n if (s == \"#\") return 1;\n\n string alphabet;\n const int N = 11;\n const string TorF = \"TF\";\n rep(i, 0, N) alphabet.push_back(i + 'a');\n\n rep(i, 0, 1 << N) {\n string t = s;\n for (auto& c: t) {\n if ('a' <= c && c <= 'k') {\n c = TorF[(i >> (c - 'a')) & 1];\n }\n }\n int m = find(all(t), '=') - t.begin();\n auto L = t.substr(0, m);\n auto R = t.substr(m + 1);\n if (Parser(L).parse() != Parser(R).parse()) {\n cout << \"NO\" << '\\n';\n return 0;\n }\n }\n\n cout << \"YES\" << '\\n';\n return 0;\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n while (!solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0821,"final_rank":5},{"submission_id":"aoj_2401_9416245","code_snippet":"// #define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\n// #include <atcoder/all>\n// #include \"qitoy/math/binomial.hpp\"\n\n#define rep(i, n) for (long long i = 0; i < (n); i++)\n#define rep1(i, n) for (long long i = 1; i <= (n); i++)\n#define all(v) v.begin(), v.end()\n#define decimal(n) cout << fixed << setprecision(n);\nusing namespace std;\n// using namespace atcoder;\nusing vi = vector<int>; using vvi = vector<vi>; using vs = vector<string>;\nusing ll = long long; using vl = vector<ll>; using vvl = vector<vl>; \n// using mint = modint998244353;\n// const ll MOD = 998244353;\n// using mint = modint;\n// const ll MOD = 998244353;\n// using mint = modint1000000007;\n// const ll MOD = 1000000007;\n// using vm = vector<mint>; using vvm = vector<vm>;\nusing vll = vl;\nusing P = pair<ll, ll>; using T = tuple<ll, ll, ll>;\nusing vc = vector<char>; using vvc = vector<vc>;\nconst ll MAX = 2000100; const ll llINF = 2e18;\nconst int intINF = 2e9; const long double pi = acos(-1);\nll di[] = {0, -1, 0, 1, -1, -1, 1, 1};\nll dj[] = {1, 0, -1, 0, 1, -1, -1, 1};\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\n\n#include <string>\n#include <cctype>\ntypedef string::const_iterator State;\nclass ParseError {};\n\n// プロトタイプ宣言\nbool equation (State &begin);\nbool formula (State &begin);\nbool element (State &begin);\nvoid consume(State &begin, char expected);\n\n\nvector<bool> value(11);\n\n// 四則演算の式をパースして、その評価結果を返す。\nbool equation (State &begin) {\n bool ret = formula(begin);\n\n consume(begin, '=');\n\n bool ret2 = formula(begin);\n return (ret == ret2 ? true : false);\n}\n\n// 乗算除算の式をパースして、その評価結果を返す。\nbool formula (State &begin) {\n bool ret;\n \n if(*begin == '-') {\n consume(begin, '-');\n ret = !(formula(begin));\n }\n else if(*begin == '(') {\n consume(begin, '(');\n bool temp1 = formula(begin);\n if(*begin == '*') {\n consume(begin, '*');\n bool temp2 = formula(begin);\n ret = (temp1 & temp2);\n }\n else if(*begin == '+') {\n consume(begin, '+');\n bool temp2 = formula(begin);\n ret = (temp1 | temp2);\n }\n else if(*begin == '-') {\n consume(begin, '-');\n consume(begin, '>');\n bool temp2 = formula(begin);\n ret = ((!temp1) | temp2);\n }\n consume(begin, ')');\n\n }\n else {\n ret = element(begin);\n }\n\n return ret;\n}\n\nbool element (State &begin) {\n if(*begin == 'T') {\n consume(begin, 'T');\n return true;\n }\n else if(*begin == 'F') {\n consume(begin, 'F');\n return false;\n }\n else {\n bool ret = value[*begin - 'a'];\n begin++;\n return ret;\n }\n}\n\n// beginがexpectedを指していたらbeginを一つ進める。\nvoid consume(State &begin, char expected) {\n if (*begin == expected) {\n begin++;\n } else {\n cerr << \"Expected '\" << expected << \"' but got '\" << *begin << \"'\"\n << endl;\n cerr << \"Rest string is '\";\n while (*begin) {\n cerr << *begin++;\n }\n cerr << \"'\" << endl;\n throw ParseError();\n }\n}\n\nint main() {\n while(true) {\n string s;\n cin >> s;\n if(s == \"#\") break;\n bool flag = true;\n rep(bit, (1ll << 11)) {\n rep(mask, 11) {\n if(bit & (1ll << mask)) value[mask] = true;\n else value[mask] = false;\n }\n State begin = s.begin();\n if(!equation(begin)) {\n flag = false;\n break;\n };\n }\n cout << (flag ? \"YES\" : \"NO\") << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3476,"score_of_the_acc":-0.0968,"final_rank":6},{"submission_id":"aoj_2401_9370184","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9 + 10;\nconst ll INFL = 4e18;\n\nbool v[11];\n\nusing State = string::const_iterator;\nclass ParseError {};\nvoid consume(State &begin, char expected) {\n if (*begin == expected) {\n begin++;\n } else {\n cerr << \"Expected '\" << expected << \"' but got '\" << *begin << \"'\" << endl;\n cerr << \"Rest string is '\";\n while (*begin) {\n cerr << *begin++;\n }\n cerr << \"'\" << endl;\n throw ParseError();\n }\n}\n\nbool contain(bool a, bool b) {\n if (a && !b) {\n return false;\n }\n return true;\n}\n\nbool formula(State &begin);\n\nbool formula(State &begin) {\n if (*begin == 'T') {\n begin++;\n return true;\n }\n if (*begin == 'F') {\n begin++;\n return false;\n }\n if ('a' <= *begin && *begin <= 'k') {\n bool ret = v[*begin - 'a'];\n begin++;\n return ret;\n }\n if (*begin == '-') {\n begin++;\n return !formula(begin);\n }\n if (*begin == '(') {\n begin++;\n bool ret = formula(begin);\n if (*begin == '+') {\n begin++;\n ret |= formula(begin);\n } else if (*begin == '*') {\n begin++;\n ret &= formula(begin);\n } else if (*begin == '-' && *next(begin) == '>') {\n begin++;\n begin++;\n bool ret2 = formula(begin);\n ret = contain(ret, ret2);\n }\n consume(begin, ')');\n return ret;\n }\n return true;\n}\n\nint main() {\n while (true) {\n string S;\n cin >> S;\n\n if (S == \"#\") {\n break;\n }\n\n string A, B;\n int N = S.size();\n {\n int i = 0;\n for (i = 0; i < N; i++) {\n if (S[i] == '=') {\n i++;\n break;\n }\n A.push_back(S[i]);\n }\n for (; i < N; i++) {\n B.push_back(S[i]);\n }\n }\n\n bool ok = true;\n for (int i = 0; i < 1 << 11; i++) {\n for (int j = 0; j < 11; j++) {\n if (i >> j & 1) {\n v[j] = true;\n } else {\n v[j] = false;\n }\n }\n State a = A.begin();\n State b = B.begin();\n\n ok &= formula(a) == formula(b);\n }\n\n if (ok) {\n cout << \"YES\" << endl;\n } else {\n cout << \"NO\" << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3480,"score_of_the_acc":-0.0997,"final_rank":7},{"submission_id":"aoj_2401_9370053","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Parser{\n string s;\n int var;\n string::const_iterator itr;\n\n Parser(string s, int var) : s(s), var(var), itr(s.begin()){}\n\n bool parse(){\n return equation();\n }\n\n bool val(char ch){\n if(ch == 'T') return true;\n if(ch == 'F') return false;\n return (var & (1 << (ch - 'a'))) > 0;\n }\n\n bool equation(){\n bool left = formula();\n ++itr;\n bool right = formula();\n return left == right;\n }\n\n bool formula(){\n bool ret;\n if(*itr == '-'){\n ++itr;\n ret = !formula();\n }\n else if(*itr == '('){\n ++itr;\n bool left = formula(), right;\n if(*itr == '+'){\n ++itr;\n right = formula();\n ret = left | right;\n }\n else if(*itr == '*'){\n ++itr;\n right = formula();\n ret = left & right;\n }\n else{\n ++itr; ++itr;\n right = formula();\n ret = !(left & (!right));\n }\n ++itr;\n }\n else{\n ret = val(*itr);\n ++itr;\n }\n return ret;\n }\n};\n\nint main(){\n string s;\n while(getline(cin, s)){\n if(s == \"#\") break;\n bool ans = true;\n for(int i = 0; i < 1 << 11; ++i){\n ans &= Parser(s, i).parse();\n }\n cout << (ans ? \"YES\" : \"NO\") << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3488,"score_of_the_acc":-0.1056,"final_rank":8},{"submission_id":"aoj_2401_9369324","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = (int)1e9 + 1001010;\nconst ll llINF = (long long)4e18 + 22000020;\nconst string endn = \"\\n\";\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\nconst string ELEM_SEPARATION = \" \", VEC_SEPARATION = endn;\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \"\");} return o;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \"\");} return o;}\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\n#ifdef DEBUG\n#include <debug_slephy.cpp>\n#else\n#define debug(...)\n#endif\n// ================================== ここまでテンプレ ==================================\n\n// Parser (T must have constructor T(long long))\ntemplate<class T> struct Parser {\n /* basic settings */\n vector<vector<string>> OPERATORS; // binary operator priority\n function<T(const string&, T, T)> OPERATION; // binary operation\n\n /* optional settings */\n function<T(const string&, int&)> GET_LEAF; // leaf parser\n vector<string> UNARY_OPERATORS; // unary operator (ex: \"-\", \"log\")\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\n const string OPERATOR_NUMBER = \"num\";\n\n /* result: parse tree */\n int root; // vals[root] is the answer\n vector<T> vals; // value of each node\n vector<string> ops; // operator of each node\n vector<int> left, right; // the index of left-node, right-node\n vector<int> ids; // the node-index of the i-th value\n\n /* constructor */\n string S;\n Parser() {}\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n init(operators, operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n init(operators, operation, get_leaf);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, unary_operators, unary_operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, get_leaf, unary_operators, unary_operation);\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n OPERATORS = operators, OPERATION = operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void clear() {\n S = \"\";\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\n }\n\n /* eval */\n T eval(const string &str, bool default_parse_numeric = true) {\n clear();\n S = str;\n int p = 0, id = 0;\n root = parse(p, id, default_parse_numeric);\n return vals[root];\n }\n\n /* node generator */\n // value\n int new_leaf(T val, int &id) {\n vals.push_back(val);\n ops.push_back(OPERATOR_NUMBER);\n left.push_back(-1);\n right.push_back(-1);\n ids.push_back(id++);\n return (int)vals.size() - 1;\n }\n // FUNC(lp)\n int new_node_with_left(T val, const string &op, int lp) {\n vals.push_back(val);\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(-1);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n // (lp) op (rp)\n int new_node_with_left_right(const string &op, int lp, int rp) {\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(rp);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n\n /* parser */\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\n assert(p >= 0 && p < (int)S.size());\n string op;\n if (depth < (int)OPERATORS.size()) {\n // recursive descent\n int lp = parse(p, id, default_parse_numeric, depth + 1);\n bool update = false;\n do {\n update = false;\n if (is_in_the_operators(p, op,\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\n int rp = parse(p, id, default_parse_numeric, depth + 1);\n lp = new_node_with_left_right(op, lp, rp);\n update = true;\n }\n } while (p < (int)S.size() && update);\n return lp;\n }\n else if (default_parse_numeric && isdigit(S[p])) {\n return get_number(p, id);\n }\n else if (S[p] == '(') {\n return get_bracket(p, id, default_parse_numeric);\n }\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\n return get_unary_operation(p, id, op, default_parse_numeric);\n }\n else {\n return new_leaf(GET_LEAF(S, p), id);\n }\n }\n bool is_the_operator(int &p, const string &op) {\n if (op != \"\" && S.substr(p, op.size()) == op) {\n p += op.size();\n return true;\n }\n return false;\n }\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\n for (const auto &op : ops) {\n if (is_the_operator(p, op)) {\n res_op = op;\n return true;\n }\n }\n return false;\n }\n int get_number(int &p, int &id) {\n long long val = 0, sign = 1;\n if (S[p] == '-') sign = -1, ++p;\n while (p < (int)S.size() && isdigit(S[p])) {\n val = val * 10 + (int)(S[p++] - '0');\n }\n return new_leaf(T(val * sign), id);\n }\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\n ++p; // skip \"(\"\n int lp = parse(p, id, default_parse_numeric, 0);\n ++p; // skip \")\"\n return lp;\n }\n int get_unary_operation(int &p, int &id, const string &op,\n bool default_parse_numeric) {\n int lp;\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\n }\n\n /* dump */\n void dump() {\n dump_rec(root);\n }\n void dump_rec(int v, string space = \"\") {\n cout << space << v << \": (\" << ops[v] << \", \" << vals[v]\n << \") -> left: \" << left[v] << \", right: \" << right[v] << endl;\n if (left[v] != -1) dump_rec(left[v], space + \" \");\n if (right[v] != -1) dump_rec(right[v], space + \" \");\n }\n};\n\nvoid solve(){\n string s; cin >> s;\n if(s == \"#\") exit(0);\n\n string s1, s2;\n {\n int pos = s.find(\"=\");\n s1 = {s.begin(), s.begin()+pos};\n s2 = {s.begin()+pos+1, s.end()};\n debug(s1, s2);\n }\n\n vector<vector<string>> operators = {{\"*\", \"+\", \"->\"}};\n auto operation = [&](const string &op, bool l, bool r) -> bool {\n if(op == \"*\") return (l & r);\n else if(op == \"+\") return (l | r);\n else if(op == \"->\") return (!l | r);\n else exit(1);\n };\n\n vector<string> unary_operators = {\"-\"};\n auto unary_operation = [&](const string &op, bool l) -> bool {\n if(op == \"-\") return !l;\n else exit(1);\n };\n\n\n for(ll bt = 0; bt < (1LL<<11); bt++){\n auto get_leaf = [&](const string &s, int &p) -> bool {\n if(s[p] == 'T'){\n p++;\n return true;\n }\n else if(s[p] == 'F'){\n p++;\n return false;\n }\n else if('a' <= s[p] && s[p] <= 'k'){\n int idx = s[p++] - 'a';\n if(bit(bt, idx)) return true;\n else return false;\n }\n else{\n exit(1);\n }\n };\n\n Parser<bool> parser(operators, operation, get_leaf, unary_operators, unary_operation);\n bool ans1 = parser.eval(s1, false);\n bool ans2 = parser.eval(s2, false);\n\n if(ans1 != ans2){\n cout << \"NO\" << endl;\n return;\n }\n }\n\n cout << \"YES\" << endl;\n}\n\nint main() {\n while(true) solve();\n}","accuracy":1,"time_ms":180,"memory_kb":3784,"score_of_the_acc":-0.5463,"final_rank":16},{"submission_id":"aoj_2401_9367458","code_snippet":"//\n// LL1 再帰降下パーサー\n// 計算結果を出力するだけでなく、構文解析木を構築する\n//\n// verified:\n// AOJ 0109 スマート計算機 (for basic expression)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0109&lang=jp\n//\n// AOJ 2613 Unordered Operators (for operator priority)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2613\n//\n// AOJ 2401 恒等式 (for unary \"not\" operator)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2401\n//\n// AOJ 1346 Miscalculation (for operator priority)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1346\n//\n// TTPC 2023 F - N^a (log N)^b (for unary \"log\" operator)\n// https://atcoder.jp/contests/ttpc2023/tasks/ttpc2023_f\n//\n// AtCoder codeFlyer E - 数式とクエリ (for parse-tree)\n// https://atcoder.jp/contests/bitflyer2018-final-open/tasks/bitflyer2018_final_e\n//\n\n\n/*\n basic settings:\n ・vector<set<string>> OPERATORS\n - 登場する二項演算子と、その優先順位を設定する\n ・function<T(const string&, T, T)> OPERATION\n - 二項演算子に応じた二項演算の結果を出力する処理を設定する\n\n optional settings:\n ・function<T(const string&, int&)> GET_LEAF\n - 構文解析木において葉となる部分のパース方法を外部から指示したい場合に設定する\n - 第二引数は文字列中の index を表す\n ・string UNARY_OPERATORS\n - パースする文字列に単項演算子 (\"-\" や \"log\" など) が含まれる場合、その関数を表す文字列を設定\n ・function<T(T)> UNARY_OPERATION\n - パースする文字列に単項演算子 (\"-\" や \"log\" など) が含まれる場合、その関数の中身を設定\n\n usage:\n ・eval(const string &str, bool default_parse_numeric = true)\n - 与えられた文字列 S をパースして、計算結果を出力する\n - root, left, right などに構文解析木の構造が格納される (詳細は dump() を参照)\n - 引数 default_parse_numeric について\n - true：文字列 S 中の \"927\" などの通常の数値情報を long long 型にパースする\n - false：数値情報などをパースする関数オブジェクトを外部で定義して渡す\n ・dump()\n - 文字列 S の構文解析木を出力する\n */\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n// Parser (T must have constructor T(long long))\ntemplate<class T> struct Parser {\n /* basic settings */\n vector<vector<string>> OPERATORS; // binary operator priority\n function<T(const string&, T, T)> OPERATION; // binary operation\n\n /* optional settings */\n function<T(const string&, int&)> GET_LEAF; // leaf parser\n vector<string> UNARY_OPERATORS; // unary operator (ex: \"-\", \"log\")\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\n const string OPERATOR_NUMBER = \"num\";\n\n /* result: parse tree */\n int root; // vals[root] is the answer\n vector<T> vals; // value of each node\n vector<string> ops; // operator of each node\n vector<int> left, right; // the index of left-node, right-node\n vector<int> ids; // the node-index of the i-th value\n\n /* constructor */\n string S;\n Parser() {}\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n init(operators, operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n init(operators, operation, get_leaf);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, unary_operators, unary_operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, get_leaf, unary_operators, unary_operation);\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n OPERATORS = operators, OPERATION = operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void clear() {\n S = \"\";\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\n }\n\n /* eval */\n T eval(const string &str, bool default_parse_numeric = true) {\n clear();\n S = str;\n int p = 0, id = 0;\n root = parse(p, id, default_parse_numeric);\n return vals[root];\n }\n\n /* node generator */\n // value\n int new_leaf(T val, int &id) {\n vals.push_back(val);\n ops.push_back(OPERATOR_NUMBER);\n left.push_back(-1);\n right.push_back(-1);\n ids.push_back(id++);\n return (int)vals.size() - 1;\n }\n // FUNC(lp)\n int new_node_with_left(T val, const string &op, int lp) {\n vals.push_back(val);\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(-1);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n // (lp) op (rp)\n int new_node_with_left_right(const string &op, int lp, int rp) {\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(rp);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n\n /* parser */\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\n assert(p >= 0 && p < (int)S.size());\n string op;\n if (depth < (int)OPERATORS.size()) {\n // recursive descent\n int lp = parse(p, id, default_parse_numeric, depth + 1);\n bool update = false;\n do {\n update = false;\n if (is_in_the_operators(p, op,\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\n int rp = parse(p, id, default_parse_numeric, depth + 1);\n lp = new_node_with_left_right(op, lp, rp);\n update = true;\n }\n } while (p < (int)S.size() && update);\n return lp;\n }\n else if (default_parse_numeric && isdigit(S[p])) {\n return get_number(p, id);\n }\n else if (S[p] == '(') {\n return get_bracket(p, id, default_parse_numeric);\n }\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\n return get_unary_operation(p, id, op, default_parse_numeric);\n }\n else {\n return new_leaf(GET_LEAF(S, p), id);\n }\n }\n bool is_the_operator(int &p, const string &op) {\n if (op != \"\" && S.substr(p, op.size()) == op) {\n p += op.size();\n return true;\n }\n return false;\n }\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\n for (const auto &op : ops) {\n if (is_the_operator(p, op)) {\n res_op = op;\n return true;\n }\n }\n return false;\n }\n int get_number(int &p, int &id) {\n long long val = 0, sign = 1;\n if (S[p] == '-') sign = -1, ++p;\n while (p < (int)S.size() && isdigit(S[p])) {\n val = val * 10 + (int)(S[p++] - '0');\n }\n return new_leaf(T(val * sign), id);\n }\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\n ++p; // skip \"(\"\n int lp = parse(p, id, default_parse_numeric, 0);\n ++p; // skip \")\"\n return lp;\n }\n int get_unary_operation(int &p, int &id, const string &op,\n bool default_parse_numeric) {\n int lp;\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\n }\n\n /* dump */\n void dump() {\n dump_rec(root);\n }\n void dump_rec(int v, string space = \"\") {\n cout << space << v << \": (\" << ops[v] << \", \" << vals[v]\n << \") -> left: \" << left[v] << \", right: \" << right[v] << endl;\n if (left[v] != -1) dump_rec(left[v], space + \" \");\n if (right[v] != -1) dump_rec(right[v], space + \" \");\n }\n};\n\n\n\n//------------------------------//\n// Examples\n//------------------------------//\n\n/* user small test */\nvoid small_test() {\n // set parser\n vector<vector<string>> operators = {{\"*\", \"/\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else if (op == \"/\") return a / b;\n else return 0;\n };\n vector<string> unary_operators = {\"-\"};\n auto unary_operation = [&](const string &op, long long a) -> long long {\n return -a;\n };\n Parser<long long> ps(operators, operation, unary_operators, unary_operation);\n\n vector<string> tests = {\n \"-(-3)\",\n \"-(-9+3*(-4))\",\n \"-5-(-3)\",\n \"-4-99\"\n };\n for (const auto &S : tests) {\n cout << S << \" = \" << ps.eval(S) << endl;\n }\n}\n\n\n/* AOJ 0109 */\nvoid AOJ_0109() {\n vector<vector<string>> operators = {{\"*\", \"/\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else if (op == \"/\") return a / b;\n else return 0;\n };\n Parser<long long> ps(operators, operation);\n\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string S;\n cin >> S;\n S.pop_back();\n cout << ps.eval(S) << endl;\n }\n}\n\n\n/* AOJ 2613 */\nvoid AOJ_2613() {\n string S;\n cin >> S;\n\n // 二項演算を設定\n auto operation = [&](const string &op, long long l, long long r) -> long long {\n if (op == \"+\") return l + r;\n else if (op == \"-\") return l - r;\n else return l * r;\n };\n\n // 演算子の優先順位をすべて試す\n long long res = -LONG_MAX;\n for (int i = 0; i < 3; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 3; ++k) {\n vector<vector<string>> operators(3);\n operators[i].push_back(\"+\");\n operators[j].push_back(\"-\");\n operators[k].push_back(\"*\");\n Parser<long long> ps(operators, operation);\n res = max(res, ps.eval(S));\n }\n }\n }\n cout << res << endl;\n}\n\n\n/* AOJ 2401 */\nvoid AOJ_2401() {\n // parser settings //\n vector<vector<string>> ops = {{\"+\", \"*\", \"->\"}};\n auto operation = [&](const string &op, bool l, bool r) -> bool {\n if (op == \"+\") return (l || r);\n else if (op == \"*\") return (l && r);\n else if (op == \"->\") return (!l || r);\n else exit(1);\n };\n auto get_leaf = [&](const string &S, int &p) -> bool {\n return (S[p++] == 'T' ? true : false);\n };\n vector<string> unary_ops = {\"-\"};\n auto unary_operation = [&](const string &op, bool l) -> bool {\n if (op == \"-\") return !l;\n else exit(1);\n };\n Parser<bool> ps1(ops, operation, get_leaf, unary_ops, unary_operation);\n Parser<bool> ps2(ops, operation, get_leaf, unary_ops, unary_operation);\n\n string S;\n while (cin >> S) {\n if (S == \"#\") break;\n for (int i = 0; i < S.size(); ++i) if (S[i] == '=') S[i] = ' ';\n\n bool res = true;\n for (int bit = 0; bit < (1<<11); ++bit) {\n string SS = S;\n for (int i = 0; i < SS.size(); ++i) {\n if (SS[i] >= 'a' && SS[i] <= 'k') {\n int id = SS[i] - 'a';\n if (bit & (1<<id)) SS[i] = 'T';\n else SS[i] = 'F';\n }\n }\n istringstream si(SS);\n string s1, s2;\n si >> s1 >> s2;\n bool r1 = ps1.eval(s1, false), r2 = ps2.eval(s2, false);\n if (r1 != r2) {\n res = false;\n }\n\n }\n if (res) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n}\n\n\n/* AOJ 1346 */\nvoid AOJ_1346() {\n // multiplication-rool parser, left-to-right parser\n vector<vector<string>> operator_mul = {{\"*\"}, {\"+\"}};\n vector<vector<string>> operator_left_right = {{\"+\", \"*\"}};\n auto operation = [&](string op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else return a * b;\n };\n Parser<long long> ps_mul(operator_mul, operation);\n Parser<long long> ps_left_right(operator_left_right, operation);\n\n string S;\n long long ans;\n cin >> S >> ans;\n\n bool mul = false, left_right = false;\n if (ps_mul.eval(S) == ans) mul = true;\n if (ps_left_right.eval(S) == ans) left_right = true;\n\n if (mul && left_right) cout << \"U\" << endl;\n else if (mul) cout << \"M\" << endl;\n else if (left_right) cout << \"L\" << endl;\n else cout << \"I\" << endl;\n}\n\n\n/* TTPC 2023 F */\nstruct Node {\n long long n, l, val;\n bool eps;\n Node(long long n = 0, long long l = 0, long long e = 0, long long v = 0)\n : n(n), l(l), eps(e), val(v) {}\n friend ostream& operator << (ostream &s, Node node) {\n return s << \"(\" << node.n << \", \" << node.l << \", \" << node.eps\n << \", \" << node.val << \")\";\n }\n};\n\nvoid TTPC_2023_F() {\n // operators\n vector<vector<string>> operators = {{\"^\"}, {\"*\"}, {\"+\"}};\n\n // define binary operation\n auto operation = [&](const string &op, const Node &l, const Node &r) -> Node {\n if (op == \"+\") {\n vector<long long> vl({l.n, l.l, (long long)l.eps, l.val});\n vector<long long> vr({r.n, r.l, (long long)r.eps, r.val});\n return (vl > vr ? l : r);\n }\n else if (op == \"*\") return Node(l.n + r.n, l.l + r.l, l.eps | r.eps, 1);\n else if (op == \"^\") return Node(l.n * r.val, l.l * r.val, l.eps, 1);\n else return Node();\n };\n\n // define number process\n auto get_leaf = [&](const string &S, int &p) -> Node {\n if (S[p] == 'N') {\n ++p;\n return Node(1, 0, false, 1);\n } else {\n long long val = 0;\n do {\n val = val * 10 + (int)(S[p++] - '0');\n } while (S[p] >= '0' && S[p] <= '9');\n return Node(0, 0, false, val);\n }\n };\n\n // define function (log)\n vector<string> unary_operators = {\"log\"};\n auto unary_operation = [&](const string &op, const Node &node) -> Node {\n if (op == \"log\") {\n if (node.n >= 1) return Node(0, 1, false, 1);\n else return Node(0, 0, true, 0);\n } else return Node();\n };\n\n // 入力\n string S;\n cin >> S;\n Parser<Node> ps(operators, operation, get_leaf, unary_operators, unary_operation);\n auto res = ps.eval(S, false);\n //ps.dump();\n\n if (res.eps) ++res.l;\n cout << res.n << \" \" << res.l << endl;\n}\n\n\n/* codeFloyer E */\ntemplate<int MOD> struct Fp {\n // inner value\n long long val;\n\n // constructor\n constexpr Fp() : val(0) { }\n constexpr Fp(long long v) : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr long long get() const { return val; }\n constexpr int get_mod() const { return MOD; }\n\n // arithmetic operators\n constexpr Fp operator + () const { return Fp(*this); }\n constexpr Fp operator - () const { return Fp(0) - Fp(*this); }\n constexpr Fp operator + (const Fp &r) const { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp &r) const { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp &r) const { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp &r) const { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp &r) {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp &r) {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp &r) {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp &r) {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp pow(long long n) const {\n Fp res(1), mul(*this);\n while (n > 0) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n constexpr Fp inv() const {\n Fp res(1), div(*this);\n return res / div;\n }\n\n // other operators\n constexpr bool operator == (const Fp &r) const {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp &r) const {\n return this->val != r.val;\n }\n constexpr Fp& operator ++ () {\n ++val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -- () {\n if (val == 0) val += MOD;\n --val;\n return *this;\n }\n constexpr Fp operator ++ (int) const {\n Fp res = *this;\n ++*this;\n return res;\n }\n constexpr Fp operator -- (int) const {\n Fp res = *this;\n --*this;\n return res;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD> &x) {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD> &x) {\n return os << x.val;\n }\n friend constexpr Fp<MOD> pow(const Fp<MOD> &r, long long n) {\n return r.pow(n);\n }\n friend constexpr Fp<MOD> inv(const Fp<MOD> &r) {\n return r.inv();\n }\n};\n\nvoid codeFloyer_E() {\n const int MOD = 1000000007;\n using mint = Fp<MOD>;\n\n // 入力\n string S;\n int Q;\n cin >> S >> Q;\n int N = 0;\n for (int i = 0; i < S.size(); ++i) if (S[i] == 'a') ++N;\n vector<long long> given(N);\n for (int i = 0; i < N; ++i) cin >> given[i];\n\n // set Parser\n vector<vector<string>> operators = {{\"*\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, mint a, mint b) -> mint {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else return 0;\n };\n int id = 0;\n auto get_leaf = [&](const string &S, int &p) -> mint {\n if (S[p] == 'a') {\n ++p;\n return given[id++];\n } else return 0;\n };\n Parser<mint> ps(operators, operation, get_leaf);\n mint base = ps.eval(S);\n\n // DP\n vector<mint> dp(N);\n auto rec = [&](auto self, int v, mint w) -> void {\n if (ps.ops[v] == ps.OPERATOR_NUMBER) dp[ps.ids[v]] = w;\n else if (ps.ops[v] == \"+\") {\n self(self, ps.left[v], w);\n self(self, ps.right[v], w);\n }\n else if (ps.ops[v] == \"-\") {\n self(self, ps.left[v], w);\n self(self, ps.right[v], -w);\n }\n else if (ps.ops[v] == \"*\") {\n self(self, ps.left[v], w * ps.vals[ps.right[v]]);\n self(self, ps.right[v], w * ps.vals[ps.left[v]]);\n }\n };\n rec(rec, ps.root, mint(1));\n\n // 出力\n for (int q = 0; q < Q; ++q) {\n long long id, x;\n cin >> id >> x;\n --id;\n mint res = base + dp[id] * (x - given[id]);\n cout << res << endl;\n }\n}\n\n\nint main() {\n // small_test();\n //AOJ_0109();\n //AOJ_2613();\n AOJ_2401();\n //AOJ_1346();\n //TTPC_2023_F();\n //codeFloyer_E();\n}","accuracy":1,"time_ms":310,"memory_kb":3824,"score_of_the_acc":-0.7466,"final_rank":17},{"submission_id":"aoj_2401_9365588","code_snippet":"//\n// LL1 再帰降下パーサー\n// 計算結果を出力するだけでなく、構文解析木を構築する\n//\n// verified:\n// AOJ 0109 スマート計算機 (for basic expression)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0109&lang=jp\n//\n// AOJ 2613 Unordered Operators (for operator priority)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2613\n//\n// AOJ 2401 恒等式 (for unary \"not\" operator)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2401\n//\n// AOJ 1346 Miscalculation (for operator priority)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1346\n//\n// TTPC 2023 F - N^a (log N)^b (for unary \"log\" operator)\n// https://atcoder.jp/contests/ttpc2023/tasks/ttpc2023_f\n//\n// AtCoder codeFlyer E - 数式とクエリ (for parse-tree)\n// https://atcoder.jp/contests/bitflyer2018-final-open/tasks/bitflyer2018_final_e\n//\n\n\n/*\n basic settings:\n ・vector<set<string>> OPERATORS\n - 登場する二項演算子と、その優先順位を設定する\n ・function<T(const string&, T, T)> OPERATION\n - 二項演算子に応じた二項演算の結果を出力する処理を設定する\n\n optional settings:\n ・function<T(const string&, int&)> GET_LEAF\n - 構文解析木において葉となる部分のパース方法を外部から指示したい場合に設定する\n - 第二引数は文字列中の index を表す\n ・string UNARY_OPERATORS\n - パースする文字列に単項演算子 (\"-\" や \"log\" など) が含まれる場合、その関数を表す文字列を設定\n ・function<T(T)> UNARY_OPERATION\n - パースする文字列に単項演算子 (\"-\" や \"log\" など) が含まれる場合、その関数の中身を設定\n\n usage:\n ・eval(const string &str, bool default_parse_numeric = true)\n - 与えられた文字列 S をパースして、計算結果を出力する\n - root, left, right などに構文解析木の構造が格納される (詳細は dump() を参照)\n - 引数 default_parse_numeric について\n - true：文字列 S 中の \"927\" などの通常の数値情報を long long 型にパースする\n - false：数値情報などをパースする関数オブジェクトを外部で定義して渡す\n ・dump()\n - 文字列 S の構文解析木を出力する\n */\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n// Parser (T must have constructor T(long long))\ntemplate<class T> struct Parser {\n /* basic settings */\n vector<vector<string>> OPERATORS; // binary operator priority\n function<T(const string&, T, T)> OPERATION; // binary operation\n\n /* optional settings */\n function<T(const string&, int&)> GET_LEAF; // leaf parser\n vector<string> UNARY_OPERATORS; // unary operator (ex: \"-\", \"log\")\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\n const string OPERATOR_NUMBER = \"num\";\n\n /* result: parse tree */\n int root; // vals[root] is the answer\n vector<T> vals; // value of each node\n vector<string> ops; // operator of each node\n vector<int> left, right; // the index of left-node, right-node\n vector<int> ids; // the node-index of the i-th value\n\n /* constructor */\n string S;\n Parser() {}\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n init(operators, operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n init(operators, operation, get_leaf);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, unary_operators, unary_operation);\n }\n Parser(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n init(operators, operation, get_leaf, unary_operators, unary_operation);\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation) {\n OPERATORS = operators, OPERATION = operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void init(const vector<vector<string>> &operators,\n const function<T(const string&, T, T)> operation,\n const function<T(const string&, int&)> get_leaf,\n const vector<string> &unary_operators,\n const function<T(const string &op, T)> unary_operation) {\n OPERATORS = operators, OPERATION = operation;\n GET_LEAF = get_leaf;\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\n }\n void clear() {\n S = \"\";\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\n }\n\n /* eval */\n T eval(const string &str, bool default_parse_numeric = true) {\n clear();\n S = str;\n int p = 0, id = 0;\n root = parse(p, id, default_parse_numeric);\n return vals[root];\n }\n\n /* node generator */\n // value\n int new_leaf(T val, int &id) {\n vals.push_back(val);\n ops.push_back(OPERATOR_NUMBER);\n left.push_back(-1);\n right.push_back(-1);\n ids.push_back(id++);\n return (int)vals.size() - 1;\n }\n // FUNC(lp)\n int new_node_with_left(T val, const string &op, int lp) {\n vals.push_back(val);\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(-1);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n // (lp) op (rp)\n int new_node_with_left_right(const string &op, int lp, int rp) {\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\n ops.push_back(op);\n left.push_back(lp);\n right.push_back(rp);\n ids.push_back(-1);\n return (int)vals.size() - 1;\n }\n\n /* parser */\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\n assert(p >= 0 && p < (int)S.size());\n string op;\n if (depth < (int)OPERATORS.size()) {\n // recursive descent\n int lp = parse(p, id, default_parse_numeric, depth + 1);\n bool update = false;\n do {\n update = false;\n if (is_in_the_operators(p, op,\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\n int rp = parse(p, id, default_parse_numeric, depth + 1);\n lp = new_node_with_left_right(op, lp, rp);\n update = true;\n }\n } while (p < (int)S.size() && update);\n return lp;\n }\n else if (default_parse_numeric && isdigit(S[p])) {\n return get_number(p, id);\n }\n else if (S[p] == '(') {\n return get_bracket(p, id, default_parse_numeric);\n }\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\n return get_unary_operation(p, id, op, default_parse_numeric);\n }\n else {\n return new_leaf(GET_LEAF(S, p), id);\n }\n }\n bool is_the_operator(int &p, const string &op) {\n if (op != \"\" && S.substr(p, op.size()) == op) {\n p += op.size();\n return true;\n }\n return false;\n }\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\n for (const auto &op : ops) {\n if (is_the_operator(p, op)) {\n res_op = op;\n return true;\n }\n }\n return false;\n }\n int get_number(int &p, int &id) {\n long long val = 0, sign = 1;\n if (S[p] == '-') sign = -1, ++p;\n while (p < (int)S.size() && isdigit(S[p])) {\n val = val * 10 + (int)(S[p++] - '0');\n }\n return new_leaf(T(val * sign), id);\n }\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\n ++p; // skip \"(\"\n int lp = parse(p, id, default_parse_numeric, 0);\n ++p; // skip \")\"\n return lp;\n }\n int get_unary_operation(int &p, int &id, const string &op,\n bool default_parse_numeric) {\n int lp;\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\n }\n\n /* dump */\n void dump() {\n dump_rec(root);\n }\n void dump_rec(int v, string space = \"\") {\n cout << space << v << \": (\" << ops[v] << \", \" << vals[v]\n << \") -> left: \" << left[v] << \", right: \" << right[v] << endl;\n if (left[v] != -1) dump_rec(left[v], space + \" \");\n if (right[v] != -1) dump_rec(right[v], space + \" \");\n }\n};\n\n\n\n//------------------------------//\n// Examples\n//------------------------------//\n\n/* user small test */\nvoid small_test() {\n // set parser\n vector<vector<string>> operators = {{\"*\", \"/\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else if (op == \"/\") return a / b;\n else return 0;\n };\n vector<string> unary_operators = {\"-\"};\n auto unary_operation = [&](const string &op, long long a) -> long long {\n return -a;\n };\n Parser<long long> ps(operators, operation, unary_operators, unary_operation);\n\n vector<string> tests = {\n \"-(-3)\",\n \"-(-9+3*(-4))\",\n \"-5-(-3)\",\n \"-4-99\"\n };\n for (const auto &S : tests) {\n cout << S << \" = \" << ps.eval(S) << endl;\n }\n}\n\n\n/* AOJ 0109 */\nvoid AOJ_0109() {\n vector<vector<string>> operators = {{\"*\", \"/\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else if (op == \"/\") return a / b;\n else return 0;\n };\n Parser<long long> ps(operators, operation);\n\n int N;\n cin >> N;\n for (int i = 0; i < N; ++i) {\n string S;\n cin >> S;\n S.pop_back();\n cout << ps.eval(S) << endl;\n }\n}\n\n\n/* AOJ 2613 */\nvoid AOJ_2613() {\n string S;\n cin >> S;\n\n // 二項演算を設定\n auto operation = [&](const string &op, long long l, long long r) -> long long {\n if (op == \"+\") return l + r;\n else if (op == \"-\") return l - r;\n else return l * r;\n };\n\n // 演算子の優先順位をすべて試す\n long long res = -LONG_MAX;\n for (int i = 0; i < 3; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 3; ++k) {\n vector<vector<string>> operators(3);\n operators[i].push_back(\"+\");\n operators[j].push_back(\"-\");\n operators[k].push_back(\"*\");\n Parser<long long> ps(operators, operation);\n res = max(res, ps.eval(S));\n }\n }\n }\n cout << res << endl;\n}\n\n\n/* AOJ 2401 */\nvoid AOJ_2401() {\n // parser settings //\n vector<vector<string>> ops = {{\"+\", \"*\", \"->\"}};\n auto operation = [&](const string &op, bool l, bool r) -> bool {\n if (op == \"+\") return (l || r);\n else if (op == \"*\") return (l && r);\n else if (op == \"->\") return (!l || r);\n else return true;\n };\n auto get_leaf = [&](const string &S, int &p) -> bool {\n return (S[p++] == 'T' ? true : false);\n };\n vector<string> unary_ops = {\"-\"};\n auto unary_operation = [&](const string &op, bool l) -> bool {\n if (op == \"-\") return !l;\n else return l;\n };\n Parser<bool> ps1(ops, operation, get_leaf, unary_ops, unary_operation);\n Parser<bool> ps2(ops, operation, get_leaf, unary_ops, unary_operation);\n\n string S;\n while (cin >> S) {\n if (S == \"#\") break;\n for (int i = 0; i < S.size(); ++i) if (S[i] == '=') S[i] = ' ';\n\n bool res = true;\n for (int bit = 0; bit < (1<<11); ++bit) {\n string SS = S;\n for (int i = 0; i < SS.size(); ++i) {\n if (SS[i] >= 'a' && SS[i] <= 'k') {\n int id = SS[i] - 'a';\n if (bit & (1<<id)) SS[i] = 'T';\n else SS[i] = 'F';\n }\n }\n istringstream si(SS);\n string s1, s2;\n si >> s1 >> s2;\n bool r1 = ps1.eval(s1, false), r2 = ps2.eval(s2, false);\n if (r1 != r2) {\n res = false;\n }\n }\n if (res) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n}\n\n\n/* AOJ 1346 */\nvoid AOJ_1346() {\n // multiplication-rool parser, left-to-right parser\n vector<vector<string>> operator_mul = {{\"*\"}, {\"+\"}};\n vector<vector<string>> operator_left_right = {{\"+\", \"*\"}};\n auto operation = [&](string op, long long a, long long b) -> long long {\n if (op == \"+\") return a + b;\n else return a * b;\n };\n Parser<long long> ps_mul(operator_mul, operation);\n Parser<long long> ps_left_right(operator_left_right, operation);\n\n string S;\n long long ans;\n cin >> S >> ans;\n\n bool mul = false, left_right = false;\n if (ps_mul.eval(S) == ans) mul = true;\n if (ps_left_right.eval(S) == ans) left_right = true;\n\n if (mul && left_right) cout << \"U\" << endl;\n else if (mul) cout << \"M\" << endl;\n else if (left_right) cout << \"L\" << endl;\n else cout << \"I\" << endl;\n}\n\n\n/* TTPC 2023 F */\nstruct Node {\n long long n, l, val;\n bool eps;\n Node(long long n = 0, long long l = 0, long long e = 0, long long v = 0)\n : n(n), l(l), eps(e), val(v) {}\n friend ostream& operator << (ostream &s, Node node) {\n return s << \"(\" << node.n << \", \" << node.l << \", \" << node.eps\n << \", \" << node.val << \")\";\n }\n};\n\nvoid TTPC_2023_F() {\n // operators\n vector<vector<string>> operators = {{\"^\"}, {\"*\"}, {\"+\"}};\n\n // define binary operation\n auto operation = [&](const string &op, const Node &l, const Node &r) -> Node {\n if (op == \"+\") {\n vector<long long> vl({l.n, l.l, (long long)l.eps, l.val});\n vector<long long> vr({r.n, r.l, (long long)r.eps, r.val});\n return (vl > vr ? l : r);\n }\n else if (op == \"*\") return Node(l.n + r.n, l.l + r.l, l.eps | r.eps, 1);\n else if (op == \"^\") return Node(l.n * r.val, l.l * r.val, l.eps, 1);\n else return Node();\n };\n\n // define number process\n auto get_leaf = [&](const string &S, int &p) -> Node {\n if (S[p] == 'N') {\n ++p;\n return Node(1, 0, false, 1);\n } else {\n long long val = 0;\n do {\n val = val * 10 + (int)(S[p++] - '0');\n } while (S[p] >= '0' && S[p] <= '9');\n return Node(0, 0, false, val);\n }\n };\n\n // define function (log)\n vector<string> unary_operators = {\"log\"};\n auto unary_operation = [&](const string &op, const Node &node) -> Node {\n if (op == \"log\") {\n if (node.n >= 1) return Node(0, 1, false, 1);\n else return Node(0, 0, true, 0);\n } else return Node();\n };\n\n // 入力\n string S;\n cin >> S;\n Parser<Node> ps(operators, operation, get_leaf, unary_operators, unary_operation);\n auto res = ps.eval(S, false);\n //ps.dump();\n\n if (res.eps) ++res.l;\n cout << res.n << \" \" << res.l << endl;\n}\n\n\n/* codeFloyer E */\ntemplate<int MOD> struct Fp {\n // inner value\n long long val;\n\n // constructor\n constexpr Fp() : val(0) { }\n constexpr Fp(long long v) : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr long long get() const { return val; }\n constexpr int get_mod() const { return MOD; }\n\n // arithmetic operators\n constexpr Fp operator + () const { return Fp(*this); }\n constexpr Fp operator - () const { return Fp(0) - Fp(*this); }\n constexpr Fp operator + (const Fp &r) const { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp &r) const { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp &r) const { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp &r) const { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp &r) {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp &r) {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp &r) {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp &r) {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp pow(long long n) const {\n Fp res(1), mul(*this);\n while (n > 0) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n constexpr Fp inv() const {\n Fp res(1), div(*this);\n return res / div;\n }\n\n // other operators\n constexpr bool operator == (const Fp &r) const {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp &r) const {\n return this->val != r.val;\n }\n constexpr Fp& operator ++ () {\n ++val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -- () {\n if (val == 0) val += MOD;\n --val;\n return *this;\n }\n constexpr Fp operator ++ (int) const {\n Fp res = *this;\n ++*this;\n return res;\n }\n constexpr Fp operator -- (int) const {\n Fp res = *this;\n --*this;\n return res;\n }\n friend constexpr istream& operator >> (istream &is, Fp<MOD> &x) {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD> &x) {\n return os << x.val;\n }\n friend constexpr Fp<MOD> pow(const Fp<MOD> &r, long long n) {\n return r.pow(n);\n }\n friend constexpr Fp<MOD> inv(const Fp<MOD> &r) {\n return r.inv();\n }\n};\n\nvoid codeFloyer_E() {\n const int MOD = 1000000007;\n using mint = Fp<MOD>;\n\n // 入力\n string S;\n int Q;\n cin >> S >> Q;\n int N = 0;\n for (int i = 0; i < S.size(); ++i) if (S[i] == 'a') ++N;\n vector<long long> given(N);\n for (int i = 0; i < N; ++i) cin >> given[i];\n\n // set Parser\n vector<vector<string>> operators = {{\"*\"}, {\"+\", \"-\"}};\n auto operation = [&](const string &op, mint a, mint b) -> mint {\n if (op == \"+\") return a + b;\n else if (op == \"-\") return a - b;\n else if (op == \"*\") return a * b;\n else return 0;\n };\n int id = 0;\n auto get_leaf = [&](const string &S, int &p) -> mint {\n if (S[p] == 'a') {\n ++p;\n return given[id++];\n } else return 0;\n };\n Parser<mint> ps(operators, operation, get_leaf);\n mint base = ps.eval(S);\n\n // DP\n vector<mint> dp(N);\n auto rec = [&](auto self, int v, mint w) -> void {\n if (ps.ops[v] == ps.OPERATOR_NUMBER) dp[ps.ids[v]] = w;\n else if (ps.ops[v] == \"+\") {\n self(self, ps.left[v], w);\n self(self, ps.right[v], w);\n }\n else if (ps.ops[v] == \"-\") {\n self(self, ps.left[v], w);\n self(self, ps.right[v], -w);\n }\n else if (ps.ops[v] == \"*\") {\n self(self, ps.left[v], w * ps.vals[ps.right[v]]);\n self(self, ps.right[v], w * ps.vals[ps.left[v]]);\n }\n };\n rec(rec, ps.root, mint(1));\n\n // 出力\n for (int q = 0; q < Q; ++q) {\n long long id, x;\n cin >> id >> x;\n --id;\n mint res = base + dp[id] * (x - given[id]);\n cout << res << endl;\n }\n}\n\n\nint main() {\n // small_test();\n //AOJ_0109();\n //AOJ_2613();\n AOJ_2401();\n //AOJ_1346();\n //TTPC_2023_F();\n //codeFloyer_E();\n}","accuracy":1,"time_ms":300,"memory_kb":3936,"score_of_the_acc":-0.8156,"final_rank":18},{"submission_id":"aoj_2401_9291233","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9 + 10;\nconst ll INFL = 4e18;\n\nconst int V = 11;\nbool v[V];\n\nbool contain(bool a, bool b) {\n if (a && !b) return false;\n return true;\n}\n\nbool parse_formula(const string &s, int &i);\nbool parse_equation(const string &s) {\n int i = 0;\n bool L = parse_formula(s, i);\n assert(s[i] == '=');\n i++;\n bool R = parse_formula(s, i);\n return L == R;\n}\n\nbool parse_formula(const string &s, int &i) {\n if (s[i] == 'T') {\n i++;\n return true;\n } else if (s[i] == 'F') {\n i++;\n return false;\n } else if ('a' <= s[i] && s[i] <= 'k') {\n bool ret = v[s[i] - 'a'];\n i++;\n return ret;\n } else if (s[i] == '-') {\n i++;\n return !parse_formula(s, i);\n } else if (s[i] == '(') {\n i++;\n bool ret = parse_formula(s, i);\n if (s[i] == '+') {\n i++;\n ret |= parse_formula(s, i);\n } else if (s[i] == '*') {\n i++;\n ret &= parse_formula(s, i);\n } else if (s[i] == '-' && s[i + 1] == '>') {\n i += 2;\n bool ret2 = parse_formula(s, i);\n ret = contain(ret, ret2);\n } else {\n exit(1);\n }\n assert(s[i] == ')');\n i++;\n return ret;\n }\n return true;\n}\n\nint main() {\n while (true) {\n string S;\n cin >> S;\n\n if (S == \"#\") break;\n\n bool ok = true;\n parse_equation(S);\n for (int i = 0; i < 1 << V; i++) {\n for (int j = 0; j < V; j++) {\n if (i >> j & 1)\n v[j] = true;\n else\n v[j] = false;\n }\n ok &= parse_equation(S);\n }\n\n cout << (ok ? \"YES\\n\" : \"NO\\n\");\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3344,"score_of_the_acc":-0.0132,"final_rank":1},{"submission_id":"aoj_2401_9056235","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef string::const_iterator state;\nint expression(state &begin);\nint term(state &begin);\nint term2(state &begin);\nint factor(state &begin);\nint number(state &begin);\n\nint expression(state &begin) {\n int ret = term(begin);\n for (;;) {\n if (*begin == '+') {\n begin++;\n ret = min(1, ret + term(begin));\n } else {\n break;\n }\n }\n return ret;\n}\n\nint term(state &begin) {\n int ret = term2(begin);\n for (;;) {\n if (*begin == '*') {\n begin++;\n ret *= term2(begin);\n } else if (*begin == '/') {\n begin++;\n int b = term2(begin);\n if (ret == 1 && b == 1) {\n ret = 1;\n } else if (ret == 1 && b == 0) {\n ret = 0;\n } else if (ret == 0 && b == 1) {\n ret = 1;\n } else {\n ret = 1;\n }\n } else {\n break;\n }\n }\n return ret;\n}\n\nint term2(state &begin) {\n int b = 1;\n if (*begin == '-') {\n begin++;\n return b ^ term2(begin);\n } else {\n return factor(begin);\n }\n}\n\nint factor(state &begin) {\n if (*begin == '(') {\n begin++;\n int ret = expression(begin);\n begin++;\n return ret;\n } else {\n int ret = number(begin);\n return ret;\n }\n}\n\nint number(state &begin) {\n int ret = 0;\n if (isdigit(*begin)) {\n ret *= 10;\n ret += *begin - '0';\n begin++;\n }\n return ret;\n}\n\nint main() {\n while (true) {\n string s;\n cin >> s;\n if (s == \"#\") {\n break;\n }\n string str;\n for (int i = 0; i < s.size(); i++) {\n if (i < s.size() - 1 && s[i] == '-' && s[i + 1] == '>') {\n str.push_back('/');\n i++;\n } else {\n if (s[i] == 'T') {\n str.push_back('1');\n } else if (s[i] == 'F') {\n str.push_back('0');\n } else {\n str.push_back(s[i]);\n }\n }\n }\n bool flg = true;\n for (int i = 0; i < (1 << 11); i++) {\n bool b[12] = {};\n for (int j = 0; j < 11; j++) {\n if (i & (1 << j)) {\n b[j] = 1;\n }\n }\n string bufstr;\n for (int j = 0; j < str.size(); j++) {\n if ('a' <= str[j] && str[j] <= 'k') {\n int num = str[j] - 'a';\n bufstr.push_back(b[num] + '0');\n } else {\n bufstr.push_back(str[j]);\n }\n }\n string str1, str2;\n bool flag = false;\n for (int j = 0; j < bufstr.size(); j++) {\n if (bufstr[j] == '=') {\n flag = true;\n } else if (!flag) {\n str1.push_back(bufstr[j]);\n } else {\n str2.push_back(bufstr[j]);\n }\n }\n state begin = str1.begin();\n state begin2 = str2.begin();\n int ans1 = expression(begin);\n int ans2 = expression(begin2);\n if (ans1 != ans2) {\n flg = false;\n }\n }\n if (flg) {\n cout << \"YES\" << endl;\n } else {\n cout << \"NO\" << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3368,"score_of_the_acc":-0.0702,"final_rank":4},{"submission_id":"aoj_2401_8862245","code_snippet":"#include <algorithm>\n#include <cctype>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint mask;\nstruct Parser {\n typedef string::const_iterator State;\n bool solve(const string &S) {\n State begin = S.begin();\n return equation(begin);\n }\n bool equation(State &begin) {\n bool left = formula(begin);\n begin++;\n bool right = formula(begin);\n return left == right;\n }\n bool formula(State &begin) {\n if (*begin == '(') {\n begin++;\n bool left = formula(begin);\n char op = *begin;\n begin++;\n if (op == '-')\n begin++;\n bool right = formula(begin);\n begin++;\n bool ret = deduce(left, op, right);\n return ret;\n } else if (*begin == '-') {\n begin++;\n return !formula(begin);\n } else {\n return boolean(begin);\n }\n }\n bool deduce(bool x, char op, bool y) {\n if (op == '*') {\n return x & y;\n } else if (op == '+') {\n return x | y;\n } else {\n return !x | y;\n }\n }\n bool boolean(State &begin) {\n bool ret;\n if (*begin == 'T')\n ret = 1;\n else if (*begin == 'F')\n ret = 0;\n else\n ret = (mask >> (*begin - 'a')) & 1;\n begin++;\n return ret;\n }\n};\nvoid solve(string S) {\n Parser ps;\n for (mask = 0; mask < (1 << 11); mask++) {\n if (!ps.solve(S)) {\n cout << \"NO\" << endl;\n return;\n }\n }\n cout << \"YES\" << endl;\n}\nint main() {\n string S;\n while (cin >> S && S != \"#\") {\n solve(S);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3416,"score_of_the_acc":-0.0528,"final_rank":2},{"submission_id":"aoj_2401_8862244","code_snippet":"#include <algorithm>\n#include <cctype>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint mask;\ntemplate <class T> struct Parser {\n typedef string::const_iterator State;\n T solve(const string &S) {\n State begin = S.begin();\n return equation(begin);\n }\n T equation(State &begin) {\n T left = formula(begin);\n ++begin;\n T right = formula(begin);\n return left == right;\n }\n T formula(State &begin) {\n if (*begin == '(') {\n ++begin;\n T left = formula(begin);\n char op = *begin;\n ++begin;\n if (op == '-')\n ++begin;\n T right = formula(begin);\n ++begin;\n T ret = deduce(left, op, right);\n return ret;\n } else if (*begin == '-') {\n ++begin;\n return !formula(begin);\n } else {\n return boolean(begin);\n }\n }\n T deduce(T x, char op, T y) {\n if (op == '*') {\n return x and y;\n } else if (op == '+') {\n return x or y;\n } else {\n return !x or y;\n }\n }\n T boolean(State &begin) {\n T ret;\n if (*begin == 'T')\n ret = 1;\n else if (*begin == 'F')\n ret = 0;\n else\n ret = (mask >> (*begin - 'a')) & 1;\n ++begin;\n return ret;\n }\n};\nvoid solve(string S) {\n Parser<bool> ps;\n for (mask = 0; mask < (1 << 11); mask++) {\n if (!ps.solve(S)) {\n cout << \"NO\" << endl;\n return;\n }\n }\n cout << \"YES\" << endl;\n}\nint main() {\n string S;\n while (cin >> S && S != \"#\") {\n solve(S);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3492,"score_of_the_acc":-0.1085,"final_rank":9},{"submission_id":"aoj_2401_8862242","code_snippet":"#include <algorithm>\n#include <cctype>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nint mask;\ntemplate <class T> struct Parser {\n typedef string::const_iterator State;\n T solve(const string &S) {\n State begin = S.begin();\n return equation(begin);\n }\n T equation(State &begin) {\n T left = formula(begin);\n begin++;\n T right = formula(begin);\n return left == right;\n }\n T formula(State &begin) {\n if (*begin == '(') {\n begin++;\n T left = formula(begin);\n char op = *begin;\n begin++;\n if (op == '-')\n begin++;\n T right = formula(begin);\n begin++;\n return deduce(left, op, right);\n } else if (*begin == '-') {\n begin++;\n T ret = !formula(begin);\n return ret;\n } else {\n return boolean(begin);\n }\n }\n T deduce(T x, char op, T y) {\n if (op == '*') {\n return x and y;\n } else if (op == '+') {\n return x or y;\n } else {\n return !x or y;\n }\n }\n T boolean(State &begin) {\n T ret;\n if (*begin == 'T')\n ret = 1;\n else if (*begin == 'F')\n ret = 0;\n else\n ret = (mask >> (*begin - 'a')) & 1;\n begin++;\n return ret;\n }\n};\n\nvoid solve(string S) {\n Parser<bool> ps;\n #pragma omp parallel for\n for (mask = 0; mask < (1 << 11); mask++) {\n if (!ps.solve(S)) {\n cout << \"NO\" << endl;\n return;\n }\n }\n cout << \"YES\" << endl;\n}\n\nint main() {\n string S;\n while (cin >> S && S != \"#\") {\n solve(S);\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3496,"score_of_the_acc":-0.1114,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_2401_10678747\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\n#include <ext/pb_ds/tag_and_trait.hpp>\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n\\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n \\n size_t operator()(int x) const {\\n return splitmix64(x);\\n }\\n \\n size_t operator()(const string& x) const {\\n uint64_t hash = 0;\\n for (char c : x) {\\n hash = hash * 31 + c;\\n }\\n return splitmix64(hash);\\n }\\n \\n size_t operator()(const pair<int, int>& p) const {\\n return splitmix64(((uint64_t)p.first << 32) | (uint64_t)p.second);\\n }\\n};\\n\\n\\ntemplate<typename T, typename S, typename Hash = custom_hash>\\nusing hash_table = gp_hash_table<T, S, Hash>;\\ntemplate<typename T, typename Hash = custom_hash>\\nusing hash_set = gp_hash_table<T, null_type, Hash>;\\n\\n\\nclass parser;\\n\\n\\nstruct node {\\n int symbol_id;\\n string value;\\n vector<node*> values;\\n \\nprivate:\\n const parser* parser_ptr;\\n \\npublic:\\n node(int s, const parser* p = nullptr) : symbol_id(s), value(\\\"\\\"), parser_ptr(p) {}\\n node(int s, const string &v, const parser* p = nullptr) : symbol_id(s), value(v), parser_ptr(p) {}\\n \\n \\n void set_parser(const parser* p) {\\n parser_ptr = p;\\n \\n for (auto child : values) {\\n if (child) {\\n child->set_parser(p);\\n }\\n }\\n }\\n \\n \\n string get_token_name() const;\\n \\n \\n void add_child(node* child) {\\n if (child && parser_ptr) {\\n child->set_parser(parser_ptr);\\n }\\n values.push_back(child);\\n }\\n};\\n\\n\\nstruct LRItem {\\n int lhs;\\n vector<int> rhs;\\n int dot_pos;\\n \\n LRItem(int l, const vector<int> &r, int d) : lhs(l), rhs(r), dot_pos(d) {}\\n \\n bool operator==(const LRItem &other) const {\\n return lhs == other.lhs && rhs == other.rhs && dot_pos == other.dot_pos;\\n }\\n \\n int next_symbol() const {\\n if (dot_pos < (int)rhs.size()) return rhs[dot_pos];\\n return -1;\\n }\\n \\n bool is_complete() const {\\n return dot_pos >= (int)rhs.size();\\n }\\n};\\n\\n\\nstruct LRItemHash {\\n size_t operator()(const LRItem &item) const {\\n size_t h1 = custom_hash{}(item.lhs);\\n size_t h2 = 0;\\n for (int s : item.rhs) {\\n h2 ^= custom_hash{}(s) + 0x9e3779b9 + (h2 << 6) + (h2 >> 2);\\n }\\n size_t h3 = custom_hash{}(item.dot_pos);\\n return h1 ^ (h2 << 1) ^ (h3 << 2);\\n }\\n};\\n\\n\\nenum class ActionType { SHIFT, REDUCE, ACCEPT, ERROR };\\n\\nstruct Action {\\n ActionType type;\\n int value;\\n \\n Action() : type(ActionType::ERROR), value(-1) {}\\n Action(ActionType t, int v) : type(t), value(v) {}\\n \\n string to_string() const {\\n switch (type) {\\n case ActionType::SHIFT: return \\\"SHIFT \\\" + std::to_string(value);\\n case ActionType::REDUCE: return \\\"REDUCE \\\" + std::to_string(value);\\n case ActionType::ACCEPT: return \\\"ACCEPT\\\";\\n case ActionType::ERROR: return \\\"ERROR\\\";\\n }\\n return \\\"UNKNOWN\\\";\\n }\\n};\\n\\n\\nstruct Production {\\n int lhs;\\n vector<int> rhs;\\n \\n Production(int l, const vector<int> &r) : lhs(l), rhs(r) {}\\n};\\n\\nclass parser {\\nprivate:\\n \\n vector<string> id_to_name;\\n hash_table<string, int> name_to_id;\\n \\n \\n vector<string> terminal_patterns;\\n vector<int> terminal_order;\\n hash_set<int> terminals;\\n hash_set<int> nonterminals;\\n vector<Production> productions;\\n \\n \\n hash_table<int, hash_set<int>> first_sets;\\n hash_table<int, hash_set<int>> follow_sets;\\n \\n \\n vector<hash_set<LRItem, LRItemHash>> states;\\n hash_table<pair<int, int>, Action> action_table;\\n hash_table<pair<int, int>, int> goto_table;\\n \\n int start_symbol_id = -1;\\n int augmented_start_id = -1;\\n bool debug_mode = false;\\n \\n \\n int get_or_create_symbol_id(const string &name) {\\n auto it = name_to_id.find(name);\\n if (it != name_to_id.end()) {\\n return it->second;\\n }\\n int id = (int)id_to_name.size();\\n id_to_name.push_back(name);\\n name_to_id[name] = id;\\n return id;\\n }\\n \\n int get_or_create_symbol_id_const(const string &name) const {\\n auto it = name_to_id.find(name);\\n if (it != name_to_id.end()) {\\n return it->second;\\n }\\n return -1;\\n }\\n \\n \\n int resolve_symbol_reference(int symbol_id) const {\\n if (symbol_id == -1 || symbol_id >= (int)id_to_name.size()) return symbol_id;\\n const string &name = id_to_name[symbol_id];\\n if (name.length() > 0 && name[0] == '#') {\\n string actual_name = name.substr(1);\\n auto it = name_to_id.find(actual_name);\\n if (it != name_to_id.end()) {\\n return it->second;\\n }\\n }\\n return symbol_id;\\n }\\n \\n bool is_terminal_symbol(int symbol_id) const {\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n if (resolved_id == -1) return false;\\n return terminals.find(resolved_id) != terminals.end() && \\n nonterminals.find(resolved_id) == nonterminals.end();\\n }\\n \\n bool is_nonterminal_symbol(int symbol_id) const {\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n if (resolved_id == -1) return false;\\n return nonterminals.find(resolved_id) != nonterminals.end();\\n }\\n \\n \\n string production_to_string(const Production &prod) const {\\n string result = get_symbol_name(prod.lhs) + \\\" ::= \\\";\\n for (int symbol_id : prod.rhs) {\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n result += get_symbol_name(resolved_id) + \\\" \\\";\\n }\\n return result;\\n }\\n \\n \\n vector<string> split_by_semicolon(const string &text) {\\n vector<string> rules;\\n stringstream ss(text);\\n string rule;\\n \\n while (getline(ss, rule, ';')) {\\n rule.erase(0, rule.find_first_not_of(\\\" \\\\t\\\\r\\\\n\\\"));\\n rule.erase(rule.find_last_not_of(\\\" \\\\t\\\\r\\\\n\\\") + 1);\\n \\n if (!rule.empty()) {\\n rules.push_back(rule);\\n }\\n }\\n \\n return rules;\\n }\\n \\n \\n \\nvoid parse_bnf(const string &bnf_text) {\\n regex terminal_pattern(R\\\"(^\\\\s*([A-Za-z_][A-Za-z0-9_]*)\\\\s*=\\\\s*(.*?)\\\\s*$)\\\");\\n regex production_pattern(R\\\"(^\\\\s*([A-Za-z_][A-Za-z0-9_]*)\\\\s*::=\\\\s*(.*?)\\\\s*$)\\\");\\n \\n vector<string> rules = split_by_semicolon(bnf_text);\\n \\n \\n for (size_t rule_idx = 0; rule_idx < rules.size(); rule_idx++) {\\n const string &rule = rules[rule_idx];\\n check_bnf_warnings(rule, rule_idx + 1);\\n }\\n \\n \\n for (const string &rule : rules) {\\n smatch match;\\n if (regex_match(rule, match, terminal_pattern)) {\\n string name = match[1].str();\\n string pattern = match[2].str();\\n \\n int id = get_or_create_symbol_id(name);\\n if ((int)terminal_patterns.size() <= id) {\\n terminal_patterns.resize(id + 1);\\n }\\n terminal_patterns[id] = pattern;\\n terminal_order.push_back(id);\\n terminals.insert(id);\\n }\\n }\\n \\n \\n for (const string &rule : rules) {\\n smatch match;\\n if (regex_match(rule, match, production_pattern)) {\\n string lhs = match[1].str();\\n string rhs_all = match[2].str();\\n \\n int lhs_id = get_or_create_symbol_id(lhs);\\n nonterminals.insert(lhs_id);\\n \\n if (lhs == \\\"START\\\") {\\n start_symbol_id = lhs_id;\\n }\\n \\n istringstream rhs_stream(rhs_all);\\n string rhs_part;\\n while (getline(rhs_stream, rhs_part, '|')) {\\n rhs_part.erase(0, rhs_part.find_first_not_of(\\\" \\\\t\\\"));\\n rhs_part.erase(rhs_part.find_last_not_of(\\\" \\\\t\\\") + 1);\\n \\n if (!rhs_part.empty()) {\\n vector<int> rhs_ids;\\n istringstream symbol_stream(rhs_part);\\n string symbol;\\n while (symbol_stream >> symbol) {\\n int symbol_id = get_or_create_symbol_id(symbol);\\n rhs_ids.push_back(symbol_id);\\n }\\n productions.emplace_back(lhs_id, rhs_ids);\\n \\n \\n check_production_warnings(lhs, rhs_part, productions.size());\\n }\\n }\\n }\\n }\\n}\\n\\nprivate:\\n \\n void check_bnf_warnings(const string &rule, int rule_number) {\\n \\n int equals_count = 0;\\n int define_equals_count = 0;\\n bool in_escape = false;\\n \\n for (size_t i = 0; i < rule.length(); i++) {\\n char c = rule[i];\\n \\n if (in_escape) {\\n in_escape = false;\\n continue;\\n }\\n \\n if (c == '\\\\\\\\') {\\n in_escape = true;\\n continue;\\n }\\n \\n \\n if (i + 2 < rule.length() && rule.substr(i, 3) == \\\"::=\\\") {\\n define_equals_count++;\\n i += 2; \\n } \\n \\n else if (c == '=' && (i == 0 || rule[i-1] != ':') && (i + 1 >= rule.length() || rule[i+1] != '=')) {\\n equals_count++;\\n }\\n }\\n }\\n \\n \\n void check_production_warnings(const string &lhs, const string &rhs, int production_number) {\\n \\n istringstream symbol_stream(rhs);\\n string symbol;\\n vector<string> symbols_without_hash;\\n \\n while (symbol_stream >> symbol) {\\n if (!symbol.empty() && symbol[0] != '#') {\\n \\n symbols_without_hash.push_back(symbol);\\n }\\n }\\n }\\n \\n \\n bool contains_unescaped_hash(const string &text) {\\n bool in_escape = false;\\n \\n for (size_t i = 0; i < text.length(); i++) {\\n char c = text[i];\\n \\n if (in_escape) {\\n in_escape = false;\\n continue;\\n }\\n \\n if (c == '\\\\\\\\') {\\n in_escape = true;\\n continue;\\n }\\n \\n if (c == '#') {\\n return true;\\n }\\n }\\n \\n return false;\\n }\\n \\n \\n void compute_first_sets() {\\n \\n for (int term_id : terminals) {\\n first_sets[term_id].insert(term_id);\\n }\\n \\n \\n for (int nonterm_id : nonterminals) {\\n first_sets[nonterm_id] = hash_set<int>();\\n }\\n \\n bool changed = true;\\n while (changed) {\\n changed = false;\\n \\n for (const auto &prod : productions) {\\n int lhs = prod.lhs;\\n const auto &rhs = prod.rhs;\\n \\n hash_set<int> first_rhs = compute_first_of_sequence(rhs);\\n \\n for (int sym : first_rhs) {\\n if (first_sets[lhs].find(sym) == first_sets[lhs].end()) {\\n first_sets[lhs].insert(sym);\\n changed = true;\\n }\\n }\\n }\\n }\\n }\\n \\n \\n hash_set<int> compute_first_of_sequence(const vector<int> &sequence) {\\n hash_set<int> result;\\n \\n if (sequence.empty()) {\\n result.insert(-1); \\n return result;\\n }\\n \\n for (int i = 0; i < (int)sequence.size(); i++) {\\n int symbol_id = sequence[i];\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n \\n if (is_terminal_symbol(symbol_id)) {\\n result.insert(resolved_id);\\n break;\\n } else if (is_nonterminal_symbol(symbol_id)) {\\n bool has_epsilon = false;\\n for (int sym : first_sets[resolved_id]) {\\n if (sym == -1) {\\n has_epsilon = true;\\n } else {\\n result.insert(sym);\\n }\\n }\\n \\n if (!has_epsilon) {\\n break;\\n }\\n \\n if (i == (int)sequence.size() - 1) {\\n result.insert(-1); \\n }\\n }\\n }\\n \\n return result;\\n }\\n \\n \\n void compute_follow_sets() {\\n int eof_id = get_or_create_symbol_id(\\\"$\\\");\\n follow_sets[start_symbol_id].insert(eof_id);\\n \\n bool changed = true;\\n while (changed) {\\n changed = false;\\n \\n for (const auto &prod : productions) {\\n for (int i = 0; i < (int)prod.rhs.size(); i++) {\\n int symbol_id = prod.rhs[i];\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n \\n if (is_nonterminal_symbol(symbol_id)) {\\n vector<int> beta(prod.rhs.begin() + i + 1, prod.rhs.end());\\n hash_set<int> first_beta = compute_first_of_sequence(beta);\\n \\n for (int sym : first_beta) {\\n if (sym != -1 && follow_sets[resolved_id].find(sym) == follow_sets[resolved_id].end()) {\\n follow_sets[resolved_id].insert(sym);\\n changed = true;\\n }\\n }\\n \\n if (first_beta.find(-1) != first_beta.end()) {\\n for (int sym : follow_sets[prod.lhs]) {\\n if (follow_sets[resolved_id].find(sym) == follow_sets[resolved_id].end()) {\\n follow_sets[resolved_id].insert(sym);\\n changed = true;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n \\n \\n hash_set<LRItem, LRItemHash> closure(const hash_set<LRItem, LRItemHash> &items) {\\n hash_set<LRItem, LRItemHash> result = items;\\n bool changed = true;\\n \\n while (changed) {\\n changed = false;\\n vector<LRItem> new_items;\\n \\n for (const auto &item : result) {\\n int next_sym = item.next_symbol();\\n if (next_sym != -1 && is_nonterminal_symbol(next_sym)) {\\n int resolved_id = resolve_symbol_reference(next_sym);\\n \\n for (int prod_idx = 0; prod_idx < (int)productions.size(); prod_idx++) {\\n const auto &prod = productions[prod_idx];\\n if (prod.lhs == resolved_id) {\\n LRItem new_item(prod.lhs, prod.rhs, 0);\\n if (result.find(new_item) == result.end()) {\\n bool found = false;\\n for (const auto &ni : new_items) {\\n if (ni == new_item) {\\n found = true;\\n break;\\n }\\n }\\n if (!found) {\\n new_items.push_back(new_item);\\n changed = true;\\n }\\n }\\n }\\n }\\n }\\n }\\n \\n for (const auto &item : new_items) {\\n result.insert(item);\\n }\\n }\\n \\n return result;\\n }\\n \\n \\n hash_set<LRItem, LRItemHash> goto_func(const hash_set<LRItem, LRItemHash> &items, int symbol_id) {\\n hash_set<LRItem, LRItemHash> goto_items;\\n \\n for (const auto &item : items) {\\n if (item.next_symbol() == symbol_id) {\\n LRItem new_item(item.lhs, item.rhs, item.dot_pos + 1);\\n goto_items.insert(new_item);\\n }\\n }\\n \\n if (goto_items.empty()) {\\n return goto_items;\\n }\\n \\n return closure(goto_items);\\n }\\n \\n \\n bool states_equal(const hash_set<LRItem, LRItemHash> &a, const hash_set<LRItem, LRItemHash> &b) const {\\n if (a.size() != b.size()) return false;\\n for (const auto &item : a) {\\n if (b.find(item) == b.end()) return false;\\n }\\n return true;\\n }\\n \\n \\n int find_state_id(const hash_set<LRItem, LRItemHash> &target_state) const {\\n for (int i = 0; i < (int)states.size(); i++) {\\n if (states_equal(states[i], target_state)) {\\n return i;\\n }\\n }\\n return -1;\\n }\\n \\n \\n void build_slr1_states() {\\n if (start_symbol_id == -1) {\\n throw runtime_error(\\\"Start symbol 'START' not found in grammar\\\");\\n }\\n \\n compute_first_sets();\\n compute_follow_sets();\\n \\n augmented_start_id = get_or_create_symbol_id(\\\"_START\\\");\\n productions.insert(productions.begin(), Production(augmented_start_id, {start_symbol_id}));\\n nonterminals.insert(augmented_start_id);\\n \\n \\n hash_set<LRItem, LRItemHash> initial_items;\\n LRItem initial_item(augmented_start_id, {start_symbol_id}, 0);\\n initial_items.insert(initial_item);\\n \\n hash_set<LRItem, LRItemHash> initial_state = closure(initial_items);\\n states.push_back(initial_state);\\n \\n queue<int> worklist;\\n worklist.push(0);\\n \\n while (!worklist.empty()) {\\n int current_state_id = worklist.front();\\n worklist.pop();\\n auto current_state = states[current_state_id];\\n \\n hash_set<int> symbols;\\n for (const auto &item : current_state) {\\n int next_sym = item.next_symbol();\\n if (next_sym != -1) {\\n symbols.insert(next_sym);\\n }\\n }\\n \\n for (int symbol_id : symbols) {\\n auto next_state = goto_func(current_state, symbol_id);\\n if (next_state.empty()) continue;\\n \\n int next_state_id = find_state_id(next_state);\\n if (next_state_id == -1) {\\n next_state_id = (int)states.size();\\n states.push_back(next_state);\\n worklist.push(next_state_id);\\n }\\n \\n if (is_terminal_symbol(symbol_id)) {\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n action_table[{current_state_id, resolved_id}] = Action(ActionType::SHIFT, next_state_id);\\n } else if (is_nonterminal_symbol(symbol_id)) {\\n int resolved_id = resolve_symbol_reference(symbol_id);\\n goto_table[{current_state_id, resolved_id}] = next_state_id;\\n }\\n }\\n }\\n \\n \\n for (int state_id = 0; state_id < (int)states.size(); state_id++) {\\n for (const auto &item : states[state_id]) {\\n if (item.is_complete()) {\\n if (item.lhs == augmented_start_id) {\\n int eof_id = get_or_create_symbol_id(\\\"$\\\");\\n action_table[{state_id, eof_id}] = Action(ActionType::ACCEPT, 0);\\n } else {\\n int prod_id = find_production_id(item.lhs, item.rhs);\\n if (prod_id != -1) {\\n \\n for (int follow_sym : follow_sets[item.lhs]) {\\n pair<int, int> key = {state_id, follow_sym};\\n auto existing = action_table.find(key);\\n \\n action_table[key] = Action(ActionType::REDUCE, prod_id);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n \\n int find_production_id(int lhs, const vector<int> &rhs) {\\n for (int i = 0; i < (int)productions.size(); i++) {\\n if (productions[i].lhs == lhs && productions[i].rhs == rhs) {\\n return i;\\n }\\n }\\n return -1;\\n }\\n \\n \\n struct Token {\\n int type_id;\\n string value;\\n Token(int t, const string &v) : type_id(t), value(v) {}\\n };\\n \\n enum class TokenizeResult {\\n SUCCESS,\\n INVALID_REGEX,\\n UNRECOGNIZED_CHARACTER\\n };\\n \\n \\nTokenizeResult tokenize(const string &input, vector<Token> &tokens) {\\n tokens.clear();\\n vector<regex> patterns;\\n vector<int> type_ids;\\n \\n for (int term_id : terminal_order) {\\n if (terminals.find(term_id) != terminals.end() && term_id < (int)terminal_patterns.size()) {\\n try {\\n patterns.push_back(regex(terminal_patterns[term_id]));\\n type_ids.push_back(term_id);\\n } catch (const regex_error &e) {\\n return TokenizeResult::INVALID_REGEX;\\n }\\n }\\n }\\n \\n auto start = input.cbegin();\\n while (start != input.cend()) {\\n if (isspace(*start)) {\\n ++start;\\n continue;\\n }\\n \\n \\n int best_match_length = 0;\\n int best_match_type = -1;\\n string best_match_value = \\\"\\\";\\n \\n for (size_t i = 0; i < patterns.size(); i++) {\\n smatch match;\\n if (regex_search(start, input.cend(), match, patterns[i]) && match.position() == 0) {\\n int match_length = (int)match.length();\\n \\n \\n if (match_length > best_match_length || \\n (match_length == best_match_length && best_match_type == -1)) {\\n best_match_length = match_length;\\n best_match_type = type_ids[i];\\n best_match_value = match.str();\\n }\\n }\\n }\\n \\n if (best_match_type == -1) {\\n return TokenizeResult::UNRECOGNIZED_CHARACTER;\\n }\\n \\n tokens.emplace_back(best_match_type, best_match_value);\\n start += best_match_length;\\n }\\n \\n return TokenizeResult::SUCCESS;\\n}\\n \\npublic:\\n parser(const string &bnf_text, bool debug = false) : debug_mode(debug) {\\n parse_bnf(bnf_text);\\n build_slr1_states();\\n }\\n \\n node* parse(const string &input) {\\n vector<Token> tokens;\\n TokenizeResult tokenize_result = tokenize(input, tokens);\\n \\n if (tokenize_result != TokenizeResult::SUCCESS) {\\n return nullptr;\\n }\\n \\n int eof_id = get_or_create_symbol_id(\\\"$\\\");\\n tokens.emplace_back(eof_id, \\\"$\\\");\\n \\n vector<int> state_stack = {0};\\n vector<node*> symbol_stack;\\n int token_pos = 0;\\n \\n while (true) {\\n if (state_stack.empty() || token_pos >= (int)tokens.size()) {\\n return nullptr;\\n }\\n \\n int current_state = state_stack.back();\\n int current_token_type = tokens[token_pos].type_id;\\n string current_token_value = tokens[token_pos].value;\\n \\n auto action_key = make_pair(current_state, current_token_type);\\n auto action_it = action_table.find(action_key);\\n \\n if (action_it == action_table.end()) {\\n return nullptr;\\n }\\n \\n Action action = action_it->second;\\n \\n if (action.type == ActionType::SHIFT) {\\n state_stack.push_back(action.value);\\n node* new_node = new node(current_token_type, current_token_value, this);\\n symbol_stack.push_back(new_node);\\n token_pos++;\\n } else if (action.type == ActionType::REDUCE) {\\n if (action.value < 0 || action.value >= (int)productions.size()) {\\n return nullptr;\\n }\\n \\n Production &prod = productions[action.value];\\n node* new_node = new node(prod.lhs, this);\\n \\n int pop_count = (int)prod.rhs.size();\\n if (pop_count > (int)symbol_stack.size() || pop_count > (int)state_stack.size()) {\\n return nullptr;\\n }\\n \\n for (int i = 0; i < pop_count; i++) {\\n node* child = symbol_stack.back();\\n new_node->values.insert(new_node->values.begin(), child);\\n symbol_stack.pop_back();\\n state_stack.pop_back();\\n }\\n \\n for (auto child : new_node->values) {\\n if (child) {\\n child->set_parser(this);\\n }\\n }\\n \\n symbol_stack.push_back(new_node);\\n \\n if (state_stack.empty()) {\\n return nullptr;\\n }\\n \\n auto goto_key = make_pair(state_stack.back(), prod.lhs);\\n auto goto_it = goto_table.find(goto_key);\\n if (goto_it == goto_table.end()) {\\n return nullptr;\\n }\\n \\n state_stack.push_back(goto_it->second);\\n } else if (action.type == ActionType::ACCEPT) {\\n if (symbol_stack.empty()) {\\n return nullptr;\\n }\\n node* result = symbol_stack.back();\\n if (result) {\\n result->set_parser(this);\\n }\\n return result;\\n } else {\\n return nullptr;\\n }\\n }\\n }\\n \\n string get_symbol_name(int symbol_id) const {\\n if (symbol_id < 0 || symbol_id >= (int)id_to_name.size()) return \\\"\\\";\\n return id_to_name[symbol_id];\\n }\\n};\\n\\n\\nstring node::get_token_name() const {\\n if (!parser_ptr) return \\\"\\\";\\n return parser_ptr->get_symbol_name(symbol_id);\\n}\\n\\nusing ll = long long;\\nbool eval(node* root, int j){\\n if (root == nullptr) return 0;\\n \\n string symbol_name = root->get_token_name();\\n if (symbol_name == \\\"START\\\"){\\n return eval(root->values[0], j) == eval(root->values[2], j);\\n }\\n\\n if (symbol_name == \\\"EXPR\\\"){\\n if (root->values.size() == 1) {\\n return eval(root->values[0], j);\\n }\\n\\n if (root->values.size() == 2){\\n return !eval(root->values[1], j);\\n }\\n\\n if (root->values[2]->get_token_name() == \\\"AND\\\") {\\n bool b1 = eval(root->values[1], j);\\n if (!b1) return 0;\\n bool b2 = eval(root->values[3], j);\\n return b2;\\n }\\n\\n if (root->values[2]->get_token_name() == \\\"OR\\\") {\\n bool b1 = eval(root->values[1], j);\\n if (b1) return 1;\\n bool b2 = eval(root->values[3], j);\\n return b2;\\n }\\n\\n if (root->values[2]->get_token_name() == \\\"TO\\\") {\\n bool b1 = eval(root->values[1], j);\\n if (!b1) return 1;\\n bool b2 = eval(root->values[3], j);\\n return b2;\\n }\\n }\\n\\n if (symbol_name == \\\"ATOM\\\") {\\n if (root->value == \\\"T\\\") return 1;\\n if (root->value == \\\"F\\\") return 0;\\n if (root->value.length() == 1) {\\n return (j >> (root->value[0] - 'a')) & 1;\\n }\\n }\\n\\n return 0;\\n}\\n\\nint main() {\\n \\n bool debug = false;\\n \\n auto parser0 = parser(\\n \\\"ATOM = T|F|[a-k];\\\"\\n \\\"NOT = -;\\\"\\n \\\"AND = \\\\\\\\*;\\\"\\n \\\"OR = \\\\\\\\+;\\\"\\n \\\"TO = ->;\\\"\\n \\\"EQ = \\\\\\\\=;\\\"\\n \\\"LPAR = \\\\\\\\(;\\\"\\n \\\"RPAR = \\\\\\\\);\\\"\\n \\\"START ::= #EXPR #EQ #EXPR;\\\"\\n \\\"EXPR ::= #NOT #EXPR | #LPAR #EXPR #AND #EXPR #RPAR | \\\"\\n \\\"#LPAR #EXPR #OR #EXPR #RPAR | #LPAR #EXPR #TO #EXPR #RPAR | #ATOM;\\\",\\n debug\\n );\\n \\n while (1){\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") break;\\n\\n bool f = 1;\\n auto result = parser0.parse(s);\\n assert(result != nullptr);\\n for (int i = 0; i < (1<<11); i++){\\n if (!eval(result, i)){\\n cout << \\\"NO\\\" << endl;\\n f = 0;\\n break;\\n }\\n }\\n if (f) cout << \\\"YES\\\" << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 4708,\n \"score_of_the_acc\": -1.2368,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2401_10665817\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nstring S;\\n\\nbool var[11];\\n\\nbool read_for(int &i);\\n\\nbool read_equ(int &i){\\n // cerr << i << \\\"!\\\\n\\\";\\n bool ret1 = read_for(i);\\n assert(S[i++] == '=');\\n bool ret2 = read_for(i);\\n return ret1 == ret2;\\n}\\n\\nbool read_for(int &i){\\n // cerr << i << \\\"\\\\n\\\";\\n if(S[i] == 'T'){\\n i++;\\n return true;\\n }else if(S[i] == 'F'){\\n i++;\\n return false;\\n }else{\\n if('a' <= S[i] && S[i] <= 'k'){\\n return var[S[i++] - 'a'];\\n }else{\\n if(S[i] == '-'){\\n i++;\\n return !read_for(i);\\n }else{\\n assert(S[i++] == '(');\\n bool ret1 = read_for(i);\\n char op = S[i++];\\n if(op == '-'){\\n assert(S[i] == '>');\\n i++;\\n }\\n bool ret2 = read_for(i);\\n assert(S[i++] == ')');\\n if(op == '*'){\\n return ret1 & ret2;\\n }else if(op == '+'){\\n return ret1 | ret2;\\n }else{\\n assert(op == '-');\\n return (!ret1) | ret2;\\n }\\n\\n }\\n }\\n }\\n}\\n\\nint main(){\\n while(true){\\n cin >> S;\\n if(S == \\\"#\\\"){\\n break;\\n }\\n string ans = \\\"YES\\\";\\n for(int i = 0; i < 2048; i++){\\n for(int j = 0; j < 11; j++){\\n if((i >> j) & 1){\\n var[j] = true;\\n }else{\\n var[j] = false;\\n }\\n }\\n int index = 0;\\n if(!read_equ(index)){\\n ans = \\\"NO\\\";\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.2154,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2401_10573529\",\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\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\nusing ll = long long;\\n\\n// #include \\\"titan_cpplib/others/print.cpp\\\"\\n\\n\\nclass Parser {\\npublic:\\n using T = char;\\n\\n string s;\\n int n, ptr;\\n\\n Parser() {}\\n Parser(string s) : s(s), n(s.size()), ptr(0) {}\\n\\n void consume(char expected) {\\n if (next() != expected) {\\n printf(\\\"Parser::Error: Expected `%c` but got `%c`\\\\n\\\", expected, next());\\n assert(false);\\n }\\n ptr++;\\n }\\n\\n char next() const {\\n assert(ptr < n);\\n return s[ptr];\\n }\\n\\n bool done() const {\\n return ptr == n;\\n }\\n\\n bool is_digit(char c) const {\\n return '0' <= c && c <= '9';\\n }\\n\\n int number() {\\n // cerr << \\\"number-start\\\" << endl;\\n ll ret = 0;\\n while (!done() && is_digit(next())) {\\n char v = next();\\n ret *= 10;\\n ret += v - '0';\\n consume(v);\\n }\\n // cerr << \\\"number-fin : \\\" << ret << endl;\\n return ret;\\n }\\n\\n // ------------------------------------\\n\\n void init() { ptr = 0; }\\n\\n T expression() {\\n return expr(0);\\n }\\n\\n T expr(int level) {\\n // rep(_, level) {\\n // cerr << \\\" \\\";\\n // }\\n // cerr << \\\" \\\" << next() << endl;\\n\\n assert(0 <= level && level <= 1);\\n if (level <= 0) {\\n T ret = expr(level+1);\\n while (!done()) {\\n if (next() == '*') {\\n consume('*');\\n T nxt = expr(level+1);\\n if (ret == 'T' && nxt == 'T') {\\n ret = 'T';\\n } else {\\n ret = 'F';\\n }\\n } else if (next() == '+') {\\n consume('+');\\n T nxt = expr(level+1);\\n if (ret == 'F' && nxt == 'F') {\\n ret = 'F';\\n } else {\\n ret = 'T';\\n }\\n } else if (next() == '-' && s[ptr+1] == '>') {\\n consume('-');\\n consume('>');\\n T nxt = expr(level+1);\\n if (ret == 'T' && nxt == 'F') {\\n ret = 'F';\\n } else {\\n ret = 'T';\\n }\\n } else {\\n break;\\n }\\n }\\n return ret;\\n } else {\\n if (next() == '(') {\\n consume('(');\\n T ret = expr(0);\\n consume(')');\\n return ret;\\n } else if (next() == '-') {\\n // 前置の単項演算子\\n consume('-');\\n T nxt = expr(level);\\n if (nxt == 'T') return 'F';\\n if (nxt == 'F') return 'T';\\n } else if (next() == 'T' || next() == 'F') {\\n char x = next();\\n consume(x);\\n return x;\\n }\\n }\\n assert(false);\\n }\\n\\n T parse() {\\n return expression();\\n }\\n};\\n\\nvoid solve() {\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") {\\n exit(0);\\n }\\n int n = s.size();\\n string left, right;\\n bool upd = false;\\n rep(i, n) {\\n if (s[i] == '=') {\\n upd = true;\\n continue;\\n }\\n if (!upd) {\\n left += s[i];\\n } else {\\n right += s[i];\\n }\\n }\\n // cerr << left << \\\" \\\" << right << endl;\\n\\n int cnt = 11;\\n rep(bit, (1<<cnt)-1) {\\n string left_t = left;\\n string right_t = right;\\n rep(i, left.size()) {\\n rep(j, cnt) {\\n if (left[i] == 'a'+j) {\\n left_t[i] = (bit>>j&1) ? 'T' : 'F';\\n }\\n }\\n }\\n rep(i, right.size()) {\\n rep(j, cnt) {\\n if (right[i] == 'a'+j) {\\n right_t[i] = (bit>>j&1) ? 'T' : 'F';\\n }\\n }\\n }\\n\\n // cerr << left_t << endl;\\n Parser p(left_t);\\n char pres = p.parse();\\n // cerr << \\\"pres=\\\" << pres << endl;\\n\\n // cerr << right_t << endl;\\n Parser q(right_t);\\n char qres = q.parse();\\n // cerr << \\\"qres=\\\" << qres << endl;\\n\\n if (pres != qres) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n }\\n\\n cout << \\\"YES\\\" << endl;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(15);\\n\\n int t = 1e9;// cin >> t;\\n for (int i = 0; i < t; ++i) {\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.2549,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2401_10418437\",\n \"code_snippet\": \"#pragma region // comavius::competitive library\\n\\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\\n{ // 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\\nnamespace comavius::competitive::sfinae\\n{ // SFINAE : breaking changes are prohibited\\n\\n#pragma region // has_mul_op\\n template <typename T, typename = void>\\n struct has_multiply_operator : std::false_type\\n {\\n };\\n template <typename T>\\n struct has_multiply_operator<T, std::void_t<decltype(std::declval<T>() * std::declval<T>())>> : std::true_type\\n {\\n };\\n#pragma endregion // has_mul_op\\n\\n#pragma region // has_forward_iterator\\n template <typename T, typename = void>\\n struct has_forward_iterator\\n {\\n static constexpr bool value = false;\\n };\\n\\n template <typename T>\\n struct has_forward_iterator<T, std::void_t<\\n decltype(std::begin(std::declval<T &>())),\\n decltype(std::end(std::declval<T &>())),\\n typename T::iterator, // Tがiterator型を持つ\\n decltype(++std::declval<typename T::iterator &>()),\\n decltype(*std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() == std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() != std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() = std::declval<const typename T::iterator &>())>>\\n {\\n static constexpr bool value = true;\\n };\\n#pragma endregion // has_forward_iterator\\n}\\n\\nnamespace comavius::competitive::algebraic_structures\\n{\\n // work in progress\\n /*\\n template <typename T>\\n struct Monoid {\\n\\n };\\n */\\n}\\n\\nnamespace comavius::competitive\\n{ // BFS\\n\\n class BFS\\n {\\n std::vector<std::vector<long long>> adjacency_list;\\n long long number_of_nodes;\\n\\n public:\\n BFS(std::vector<std::vector<long long>> adjacency_list_, long long number_of_nodes_)\\n {\\n this->adjacency_list = adjacency_list_;\\n this->number_of_nodes = number_of_nodes_;\\n }\\n\\n long long run(long long start_node, long long end_node)\\n {\\n std::vector<bool> visited(number_of_nodes, false);\\n std::vector<long long> current_queue(1, start_node), next_queue;\\n visited[start_node] = true;\\n long long distance = 0;\\n if (start_node == end_node)\\n {\\n return distance;\\n }\\n while (current_queue.size() != 0)\\n {\\n distance++;\\n next_queue.clear();\\n for (auto i : current_queue)\\n {\\n if (i == end_node)\\n {\\n return distance;\\n }\\n for (auto j : adjacency_list[i])\\n {\\n if (!visited[j])\\n {\\n visited[j] = true;\\n next_queue.push_back(j);\\n if (j == end_node)\\n {\\n return distance;\\n }\\n }\\n }\\n }\\n current_queue = next_queue;\\n }\\n return (long long)-1;\\n }\\n };\\n} // namespace comavius::competitive::BFS\\n\\nnamespace comavius::competitive\\n{ // UnionFind\\n\\n class UnionFind\\n {\\n std::vector<long long> parent;\\n std::vector<long long> rank;\\n std::vector<long long> size;\\n std::vector<long long> edge_count;\\n\\n public:\\n UnionFind(long long num_nodes)\\n {\\n parent.resize(num_nodes, -1);\\n rank.resize(num_nodes, 0);\\n size.resize(num_nodes, 1);\\n edge_count.resize(num_nodes, 0);\\n }\\n\\n long long root_of(long long x)\\n {\\n if (parent[x] == -1)\\n {\\n return x;\\n }\\n else\\n {\\n return parent[x] = root_of(parent[x]);\\n }\\n }\\n\\n void unite(long long x, long long y)\\n {\\n long long rx = root_of(x);\\n long long ry = root_of(y);\\n if (rx == ry)\\n {\\n edge_count[rx]++;\\n return;\\n }\\n else if (rank[rx] < rank[ry])\\n {\\n parent[rx] = ry;\\n size[ry] += size[rx];\\n edge_count[ry] += edge_count[rx] + 1;\\n }\\n else\\n {\\n parent[ry] = rx;\\n size[rx] += size[ry];\\n if (rank[rx] == rank[ry])\\n rank[rx]++;\\n edge_count[rx] += edge_count[ry] + 1;\\n }\\n return;\\n }\\n\\n bool is_same(long long x, long long y)\\n {\\n return root_of(x) == root_of(y);\\n }\\n\\n long long size_of(long long x)\\n {\\n return size[root_of(x)];\\n }\\n bool is_cycle(long long x)\\n {\\n return edge_count[root_of(x)] >= size[root_of(x)];\\n }\\n };\\n} // namespace comavius::competitive::UnionFind\\n\\nnamespace comavius::competitive\\n{ // get_primes\\n\\n std::vector<long long> get_primes(long long n)\\n {\\n std::vector<bool> is_prime(n + 1, true);\\n std::vector<long long> primes;\\n is_prime[0] = false;\\n is_prime[1] = false;\\n for (long long i = 2; i <= n; i++)\\n {\\n if (is_prime[i])\\n {\\n primes.push_back(i);\\n for (long long j = 2 * i; j <= n; j += i)\\n {\\n is_prime[j] = false;\\n }\\n }\\n }\\n return primes;\\n }\\n} // namespace comavius::competitive::get_primes\\n\\nnamespace comavius::competitive\\n{ // fast pow (repeated squaring)\\n\\n template <typename T>\\n T fast_pow(T base, T neutral, long long exponent)\\n {\\n // check if T has multiply operator\\n static_assert(sfinae::has_multiply_operator<T>::value, \\\"comavius::competitive::fast_pow : T must have operator*\\\");\\n T ans = neutral;\\n while (exponent > 0)\\n {\\n if (exponent % 2 == 1)\\n {\\n ans *= base;\\n }\\n base *= base;\\n exponent /= 2;\\n }\\n return ans;\\n }\\n} // namespace comavius::competitive::fast_pow\\n\\nnamespace comavius::competitive\\n{ // bipartite matching\\n /*\\n class BipartiteMatching {\\n long long size, size_u, size_v;\\n std::vector<long long> nodes_u, nodes_v;\\n std::vector<std::vector<long long>> adjacency_list;\\n\\n };\\n */\\n}\\n\\nnamespace comavius::competitive\\n{ // chmax/chmin\\n template <typename T>\\n concept HasMaxOverload = requires(T a, T b) {\\n {\\n std::max(a, b)\\n } -> std::convertible_to<T>;\\n };\\n template <typename T>\\n concept HasMinOverload = requires(T a, T b) {\\n {\\n std::min(a, b)\\n } -> std::convertible_to<T>;\\n };\\n\\n template <HasMaxOverload T>\\n void chmax(T &a, T b)\\n {\\n a = std::max(a, b);\\n }\\n\\n template <HasMinOverload T>\\n void chmin(T &a, T b)\\n {\\n a = std::min(a, b);\\n }\\n\\n}\\n\\nnamespace comavius::competitive\\n{ // Print(stdout, stderr)\\n\\n#pragma region // formatting various type of values\\n // is_vector structure\\n template <typename T>\\n struct is_vector : std::false_type\\n {\\n };\\n template <typename T>\\n struct is_vector<std::vector<T>> : std::true_type\\n {\\n };\\n // is_pair structure\\n template <typename T>\\n struct is_pair : std::false_type\\n {\\n };\\n template <typename T, typename U>\\n struct is_pair<std::pair<T, U>> : std::true_type\\n {\\n };\\n // is_iterator structure\\n template <typename T, typename = void>\\n struct is_iterator : std::false_type\\n {\\n };\\n template <typename T>\\n struct is_iterator<\\n T,\\n typename std::enable_if<\\n !std::is_same<\\n typename std::iterator_traits<T>::value_type,\\n void>::value>::type> : std::true_type\\n {\\n };\\n // generate std::string for stdout/stderr\\n // std::string\\n std::string generate_string(std::string s)\\n {\\n return s + \\\" \\\";\\n }\\n // char\\n std::string generate_string(char c)\\n {\\n return std::string(1, c) + \\\" \\\";\\n }\\n // eger types\\n template <typename T>\\n typename std::enable_if_t<std::is_integral<T>::value, std::string>\\n generate_string(T t)\\n {\\n return std::to_string(t) + \\\" \\\";\\n }\\n // floating point types\\n template <typename T>\\n typename std::enable_if_t<std::is_floating_point<T>::value, std::string>\\n generate_string(T t)\\n {\\n return std::to_string(t) + \\\" \\\";\\n }\\n // container with forward iterator\\n template <typename T>\\n typename std::enable_if_t<sfinae::has_forward_iterator<T>::value, std::string>\\n generate_string(T t)\\n {\\n std::string s = \\\"\\\";\\n for (auto i = t.begin(); i != t.end(); i++)\\n {\\n s += generate_string(*i);\\n s += \\\" \\\";\\n }\\n s += \\\"\\\\n\\\";\\n return s;\\n }\\n // std::pair\\n template <typename T>\\n typename std::enable_if_t<is_pair<T>::value, std::string>\\n generate_string(T t)\\n {\\n return generate_string(t.first) + generate_string(t.second);\\n }\\n // std::iterator\\n template <typename T>\\n typename std::enable_if_t<is_iterator<T>::value, std::string>\\n generate_string(T begin, T end)\\n {\\n std::string s = \\\"\\\";\\n for (auto i = begin; i != end; i++)\\n {\\n s += generate_string(*i);\\n s += \\\" \\\";\\n }\\n s += \\\"\\\\n\\\";\\n return s;\\n }\\n#pragma endregion // formatting various type of values\\n\\n // color enum-class\\n enum class Color\\n {\\n BLACK,\\n RED,\\n GREEN,\\n YELLOW,\\n BLUE,\\n MAGENTA,\\n CYAN,\\n WHITE,\\n DEFAULT\\n };\\n\\n // ansi code color\\n std::string get_ansi_color(Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::string ansi_code;\\n switch (color)\\n {\\n case Color::BLACK:\\n ansi_code = \\\"\\\\033[30m\\\\033[1m\\\";\\n break;\\n case Color::RED:\\n ansi_code = \\\"\\\\033[31m\\\\033[1m\\\";\\n break;\\n case Color::GREEN:\\n ansi_code = \\\"\\\\033[32m\\\\033[1m\\\";\\n break;\\n case Color::YELLOW:\\n ansi_code = \\\"\\\\033[33m\\\\033[1m\\\";\\n break;\\n case Color::BLUE:\\n ansi_code = \\\"\\\\033[34m\\\\033[1m\\\";\\n break;\\n case Color::MAGENTA:\\n ansi_code = \\\"\\\\033[35m\\\\033[1m\\\";\\n break;\\n case Color::CYAN:\\n ansi_code = \\\"\\\\033[36m\\\\033[1m\\\";\\n break;\\n case Color::WHITE:\\n ansi_code = \\\"\\\\033[37m\\\";\\n break;\\n case Color::DEFAULT:\\n ansi_code = \\\"\\\\033[0m\\\";\\n break;\\n }\\n return ansi_code;\\n }\\n else\\n {\\n return \\\"\\\";\\n }\\n }\\n\\n#pragma region // Print to stdout\\n // default color(native)\\n template <typename T>\\n void print(T t)\\n {\\n std::cout << generate_string(t);\\n }\\n // with iterator range\\n template <typename T>\\n void print(T begin, T end)\\n {\\n std::cout << generate_string(begin, end);\\n }\\n // print\\\"ln\\\"\\n template <typename T>\\n void println(T t)\\n {\\n print(t);\\n std::cout << \\\"\\\\n\\\";\\n }\\n // print\\\"ln\\\" with iterator range\\n template <typename T>\\n void println(T begin, T end)\\n {\\n print(begin, end);\\n std::cout << \\\"\\\\n\\\";\\n }\\n // yes or no\\n void yneos(bool a)\\n {\\n if (a)\\n {\\n println(\\\"Yes\\\");\\n }\\n else\\n {\\n println(\\\"No\\\");\\n }\\n }\\n#pragma endregion // Print to stdout\\n\\n#pragma region // ePrint to stderr\\n // default color(Color::CYAN)\\n template <typename T>\\n void errprint(T t)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::cerr << get_ansi_color(Color::RED) << generate_string(t) << get_ansi_color(Color::DEFAULT);\\n }\\n }\\n // set color\\n template <typename T>\\n void errprint(T t, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::cerr << get_ansi_color(color) << generate_string(t) << get_ansi_color(Color::DEFAULT);\\n }\\n }\\n // print\\\"ln\\\"\\n template <typename T>\\n void errprintln(T t)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(t);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n template <typename T>\\n void errprintln(T t, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(t, color);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n // print\\\"ln\\\" with iterator range\\n template <typename T>\\n void errprintln(T begin, T end)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(begin, end);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n template <typename T>\\n void errprintln(T begin, T end, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(begin, end, color);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n // debug print\\n void debug()\\n {\\n errprintln(\\\"DEBUG\\\", Color::MAGENTA);\\n }\\n#pragma endregion // ePrint to stderr\\n\\n} // namespace comavius::competitive print\\n\\n\\n\\nnamespace comavius::competitive\\n{ // initial settings\\n void initial_settings()\\n {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::setprecision(15);\\n std::cerr << std::setprecision(15);\\n }\\n} // namespace comavius::competitive::initial_settings\\n\\n#pragma region // Read macro\\n#define GET_1_ARG(TYPE, ARG) \\\\\\n ; \\\\\\n TYPE ARG; \\\\\\n 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) \\\\\\n std::vector<TYPE> NAME(SIZE); \\\\\\n for (long long i = 0; i < SIZE; i++) \\\\\\n std::cin >> NAME[i];\\n#define readvv(TYPE, NAME, H, W) \\\\\\n std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); \\\\\\n for (long long i = 0; i < H; i++) \\\\\\n for (long long j = 0; j < W; j++) \\\\\\n 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\\nusing namespace std;\\nusing namespace comavius::competitive;\\n#pragma endregion // namespace expansion\\n\\n#pragma endregion // comavius::competitive library\\n\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//using mint = modint998244353;\\nusing vvpll = vec<vec<pll>>;\\n\\nusing namespace std;\\n\\nstr replace(str s, ll bits) {\\n str vs = \\\"abcedfghijk\\\";\\n ll n = s.size();\\n rep(i, n) {\\n rep(j, vs.size()) {\\n if (s[i] == vs[j]) {\\n if (((bits >> j) & 1) == 0) {\\n s[i] = 'T';\\n }\\n else {\\n s[i] = 'F';\\n }\\n }\\n }\\n }\\n str s2;\\n rep(i, n){\\n if (s[i] == '-' && i != n-1 && s[i+1] == '>') {\\n s2.push_back('&');\\n i++;\\n }\\n else {\\n s2.push_back(s[i]);\\n }\\n }\\n return s2;\\n}\\n\\nchar myminus(char c) {\\n if (c == 'T') {\\n return 'F';\\n }\\n else {\\n return 'T';\\n }\\n}\\n\\nchar myprod(char l, char r) {\\n if (l == 'T' && r == 'T') {\\n return 'T';\\n }\\n else {\\n return 'F';\\n }\\n}\\n\\nchar myadd(char l, char r) {\\n if (l == 'T' || r == 'T') {\\n return 'T';\\n }\\n else {\\n return 'F';\\n }\\n}\\n\\nchar myimply(char l, char r) {\\n if (l == 'T' && r == 'F') {\\n return 'F';\\n }\\n else {\\n return 'T';\\n }\\n}\\n\\nbool eval(str s) {\\n ll n = s.size();\\n str stack;\\n reverse(all(s));\\n while (s.size()) {\\n char c = s.back();\\n s.pop_back();\\n if (c == 'T' || c == 'F') {\\n if (stack.size() != 0) {\\n if (stack.back() == '(') {\\n stack.push_back(c);\\n }\\n else {\\n char op = stack.back();\\n stack.pop_back();\\n if (op == '-') {\\n s.push_back(myminus(c));\\n }\\n else {\\n char left = stack.back();\\n stack.pop_back();\\n if (op == '*') {\\n s.push_back(myprod(left, c));\\n }\\n else if (op == '+') {\\n s.push_back(myadd(left, c));\\n }\\n else {\\n s.push_back(myimply(left, c));\\n }\\n }\\n }\\n }\\n else {\\n stack.push_back(c);\\n }\\n }\\n else if (c == ')') {\\n char prev = stack.back();\\n stack.pop_back();\\n stack.pop_back();\\n s.push_back(prev);\\n }\\n else {\\n stack.push_back(c);\\n }\\n //cerr << stack << \\\" \\\" << s << endl;\\n }\\n //cerr <<\\\"finally \\\"<<stack << endl;\\n if (stack[0] == 'T') {\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\\n\\nint main() {\\n read(str, s);\\n do {\\n ll n = s.size();\\n ll eqidx;\\n rep(i, n) {\\n if (s[i] == '=') {\\n eqidx = i;\\n }\\n }\\n str left = s.substr(0, eqidx);\\n str right = s.substr(eqidx+1, n - eqidx);\\n //cerr << left << \\\"\\\\n\\\" << right << endl;\\n bool ok = true;\\n rep(bits, (1ll << 11)) {\\n str l = replace(left, bits);\\n str r = replace(right, bits);\\n //cerr << l << endl;\\n bool l_b = eval(l);\\n bool r_b = eval(r);\\n if (l_b != r_b) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n cout << \\\"YES\\\\n\\\";\\n }\\n else {\\n cout << \\\"NO\\\\n\\\";\\n }\\n cin >> s;\\n } while (s != \\\"#\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.2417,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2401_10418433\",\n \"code_snippet\": \"#pragma region // comavius::competitive library\\n\\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\\n{ // 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\\nnamespace comavius::competitive::sfinae\\n{ // SFINAE : breaking changes are prohibited\\n\\n#pragma region // has_mul_op\\n template <typename T, typename = void>\\n struct has_multiply_operator : std::false_type\\n {\\n };\\n template <typename T>\\n struct has_multiply_operator<T, std::void_t<decltype(std::declval<T>() * std::declval<T>())>> : std::true_type\\n {\\n };\\n#pragma endregion // has_mul_op\\n\\n#pragma region // has_forward_iterator\\n template <typename T, typename = void>\\n struct has_forward_iterator\\n {\\n static constexpr bool value = false;\\n };\\n\\n template <typename T>\\n struct has_forward_iterator<T, std::void_t<\\n decltype(std::begin(std::declval<T &>())),\\n decltype(std::end(std::declval<T &>())),\\n typename T::iterator, // Tがiterator型を持つ\\n decltype(++std::declval<typename T::iterator &>()),\\n decltype(*std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() == std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() != std::declval<typename T::iterator &>()),\\n decltype(std::declval<typename T::iterator &>() = std::declval<const typename T::iterator &>())>>\\n {\\n static constexpr bool value = true;\\n };\\n#pragma endregion // has_forward_iterator\\n}\\n\\nnamespace comavius::competitive::algebraic_structures\\n{\\n // work in progress\\n /*\\n template <typename T>\\n struct Monoid {\\n\\n };\\n */\\n}\\n\\nnamespace comavius::competitive\\n{ // BFS\\n\\n class BFS\\n {\\n std::vector<std::vector<long long>> adjacency_list;\\n long long number_of_nodes;\\n\\n public:\\n BFS(std::vector<std::vector<long long>> adjacency_list_, long long number_of_nodes_)\\n {\\n this->adjacency_list = adjacency_list_;\\n this->number_of_nodes = number_of_nodes_;\\n }\\n\\n long long run(long long start_node, long long end_node)\\n {\\n std::vector<bool> visited(number_of_nodes, false);\\n std::vector<long long> current_queue(1, start_node), next_queue;\\n visited[start_node] = true;\\n long long distance = 0;\\n if (start_node == end_node)\\n {\\n return distance;\\n }\\n while (current_queue.size() != 0)\\n {\\n distance++;\\n next_queue.clear();\\n for (auto i : current_queue)\\n {\\n if (i == end_node)\\n {\\n return distance;\\n }\\n for (auto j : adjacency_list[i])\\n {\\n if (!visited[j])\\n {\\n visited[j] = true;\\n next_queue.push_back(j);\\n if (j == end_node)\\n {\\n return distance;\\n }\\n }\\n }\\n }\\n current_queue = next_queue;\\n }\\n return (long long)-1;\\n }\\n };\\n} // namespace comavius::competitive::BFS\\n\\nnamespace comavius::competitive\\n{ // UnionFind\\n\\n class UnionFind\\n {\\n std::vector<long long> parent;\\n std::vector<long long> rank;\\n std::vector<long long> size;\\n std::vector<long long> edge_count;\\n\\n public:\\n UnionFind(long long num_nodes)\\n {\\n parent.resize(num_nodes, -1);\\n rank.resize(num_nodes, 0);\\n size.resize(num_nodes, 1);\\n edge_count.resize(num_nodes, 0);\\n }\\n\\n long long root_of(long long x)\\n {\\n if (parent[x] == -1)\\n {\\n return x;\\n }\\n else\\n {\\n return parent[x] = root_of(parent[x]);\\n }\\n }\\n\\n void unite(long long x, long long y)\\n {\\n long long rx = root_of(x);\\n long long ry = root_of(y);\\n if (rx == ry)\\n {\\n edge_count[rx]++;\\n return;\\n }\\n else if (rank[rx] < rank[ry])\\n {\\n parent[rx] = ry;\\n size[ry] += size[rx];\\n edge_count[ry] += edge_count[rx] + 1;\\n }\\n else\\n {\\n parent[ry] = rx;\\n size[rx] += size[ry];\\n if (rank[rx] == rank[ry])\\n rank[rx]++;\\n edge_count[rx] += edge_count[ry] + 1;\\n }\\n return;\\n }\\n\\n bool is_same(long long x, long long y)\\n {\\n return root_of(x) == root_of(y);\\n }\\n\\n long long size_of(long long x)\\n {\\n return size[root_of(x)];\\n }\\n bool is_cycle(long long x)\\n {\\n return edge_count[root_of(x)] >= size[root_of(x)];\\n }\\n };\\n} // namespace comavius::competitive::UnionFind\\n\\nnamespace comavius::competitive\\n{ // get_primes\\n\\n std::vector<long long> get_primes(long long n)\\n {\\n std::vector<bool> is_prime(n + 1, true);\\n std::vector<long long> primes;\\n is_prime[0] = false;\\n is_prime[1] = false;\\n for (long long i = 2; i <= n; i++)\\n {\\n if (is_prime[i])\\n {\\n primes.push_back(i);\\n for (long long j = 2 * i; j <= n; j += i)\\n {\\n is_prime[j] = false;\\n }\\n }\\n }\\n return primes;\\n }\\n} // namespace comavius::competitive::get_primes\\n\\nnamespace comavius::competitive\\n{ // fast pow (repeated squaring)\\n\\n template <typename T>\\n T fast_pow(T base, T neutral, long long exponent)\\n {\\n // check if T has multiply operator\\n static_assert(sfinae::has_multiply_operator<T>::value, \\\"comavius::competitive::fast_pow : T must have operator*\\\");\\n T ans = neutral;\\n while (exponent > 0)\\n {\\n if (exponent % 2 == 1)\\n {\\n ans *= base;\\n }\\n base *= base;\\n exponent /= 2;\\n }\\n return ans;\\n }\\n} // namespace comavius::competitive::fast_pow\\n\\nnamespace comavius::competitive\\n{ // bipartite matching\\n /*\\n class BipartiteMatching {\\n long long size, size_u, size_v;\\n std::vector<long long> nodes_u, nodes_v;\\n std::vector<std::vector<long long>> adjacency_list;\\n\\n };\\n */\\n}\\n\\nnamespace comavius::competitive\\n{ // chmax/chmin\\n template <typename T>\\n concept HasMaxOverload = requires(T a, T b) {\\n {\\n std::max(a, b)\\n } -> std::convertible_to<T>;\\n };\\n template <typename T>\\n concept HasMinOverload = requires(T a, T b) {\\n {\\n std::min(a, b)\\n } -> std::convertible_to<T>;\\n };\\n\\n template <HasMaxOverload T>\\n void chmax(T &a, T b)\\n {\\n a = std::max(a, b);\\n }\\n\\n template <HasMinOverload T>\\n void chmin(T &a, T b)\\n {\\n a = std::min(a, b);\\n }\\n\\n}\\n\\nnamespace comavius::competitive\\n{ // Print(stdout, stderr)\\n\\n#pragma region // formatting various type of values\\n // is_vector structure\\n template <typename T>\\n struct is_vector : std::false_type\\n {\\n };\\n template <typename T>\\n struct is_vector<std::vector<T>> : std::true_type\\n {\\n };\\n // is_pair structure\\n template <typename T>\\n struct is_pair : std::false_type\\n {\\n };\\n template <typename T, typename U>\\n struct is_pair<std::pair<T, U>> : std::true_type\\n {\\n };\\n // is_iterator structure\\n template <typename T, typename = void>\\n struct is_iterator : std::false_type\\n {\\n };\\n template <typename T>\\n struct is_iterator<\\n T,\\n typename std::enable_if<\\n !std::is_same<\\n typename std::iterator_traits<T>::value_type,\\n void>::value>::type> : std::true_type\\n {\\n };\\n // generate std::string for stdout/stderr\\n // std::string\\n std::string generate_string(std::string s)\\n {\\n return s + \\\" \\\";\\n }\\n // char\\n std::string generate_string(char c)\\n {\\n return std::string(1, c) + \\\" \\\";\\n }\\n // eger types\\n template <typename T>\\n typename std::enable_if_t<std::is_integral<T>::value, std::string>\\n generate_string(T t)\\n {\\n return std::to_string(t) + \\\" \\\";\\n }\\n // floating point types\\n template <typename T>\\n typename std::enable_if_t<std::is_floating_point<T>::value, std::string>\\n generate_string(T t)\\n {\\n return std::to_string(t) + \\\" \\\";\\n }\\n // container with forward iterator\\n template <typename T>\\n typename std::enable_if_t<sfinae::has_forward_iterator<T>::value, std::string>\\n generate_string(T t)\\n {\\n std::string s = \\\"\\\";\\n for (auto i = t.begin(); i != t.end(); i++)\\n {\\n s += generate_string(*i);\\n s += \\\" \\\";\\n }\\n s += \\\"\\\\n\\\";\\n return s;\\n }\\n // std::pair\\n template <typename T>\\n typename std::enable_if_t<is_pair<T>::value, std::string>\\n generate_string(T t)\\n {\\n return generate_string(t.first) + generate_string(t.second);\\n }\\n // std::iterator\\n template <typename T>\\n typename std::enable_if_t<is_iterator<T>::value, std::string>\\n generate_string(T begin, T end)\\n {\\n std::string s = \\\"\\\";\\n for (auto i = begin; i != end; i++)\\n {\\n s += generate_string(*i);\\n s += \\\" \\\";\\n }\\n s += \\\"\\\\n\\\";\\n return s;\\n }\\n#pragma endregion // formatting various type of values\\n\\n // color enum-class\\n enum class Color\\n {\\n BLACK,\\n RED,\\n GREEN,\\n YELLOW,\\n BLUE,\\n MAGENTA,\\n CYAN,\\n WHITE,\\n DEFAULT\\n };\\n\\n // ansi code color\\n std::string get_ansi_color(Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::string ansi_code;\\n switch (color)\\n {\\n case Color::BLACK:\\n ansi_code = \\\"\\\\033[30m\\\\033[1m\\\";\\n break;\\n case Color::RED:\\n ansi_code = \\\"\\\\033[31m\\\\033[1m\\\";\\n break;\\n case Color::GREEN:\\n ansi_code = \\\"\\\\033[32m\\\\033[1m\\\";\\n break;\\n case Color::YELLOW:\\n ansi_code = \\\"\\\\033[33m\\\\033[1m\\\";\\n break;\\n case Color::BLUE:\\n ansi_code = \\\"\\\\033[34m\\\\033[1m\\\";\\n break;\\n case Color::MAGENTA:\\n ansi_code = \\\"\\\\033[35m\\\\033[1m\\\";\\n break;\\n case Color::CYAN:\\n ansi_code = \\\"\\\\033[36m\\\\033[1m\\\";\\n break;\\n case Color::WHITE:\\n ansi_code = \\\"\\\\033[37m\\\";\\n break;\\n case Color::DEFAULT:\\n ansi_code = \\\"\\\\033[0m\\\";\\n break;\\n }\\n return ansi_code;\\n }\\n else\\n {\\n return \\\"\\\";\\n }\\n }\\n\\n#pragma region // Print to stdout\\n // default color(native)\\n template <typename T>\\n void print(T t)\\n {\\n std::cout << generate_string(t);\\n }\\n // with iterator range\\n template <typename T>\\n void print(T begin, T end)\\n {\\n std::cout << generate_string(begin, end);\\n }\\n // print\\\"ln\\\"\\n template <typename T>\\n void println(T t)\\n {\\n print(t);\\n std::cout << \\\"\\\\n\\\";\\n }\\n // print\\\"ln\\\" with iterator range\\n template <typename T>\\n void println(T begin, T end)\\n {\\n print(begin, end);\\n std::cout << \\\"\\\\n\\\";\\n }\\n // yes or no\\n void yneos(bool a)\\n {\\n if (a)\\n {\\n println(\\\"Yes\\\");\\n }\\n else\\n {\\n println(\\\"No\\\");\\n }\\n }\\n#pragma endregion // Print to stdout\\n\\n#pragma region // ePrint to stderr\\n // default color(Color::CYAN)\\n template <typename T>\\n void errprint(T t)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::cerr << get_ansi_color(Color::RED) << generate_string(t) << get_ansi_color(Color::DEFAULT);\\n }\\n }\\n // set color\\n template <typename T>\\n void errprint(T t, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n std::cerr << get_ansi_color(color) << generate_string(t) << get_ansi_color(Color::DEFAULT);\\n }\\n }\\n // print\\\"ln\\\"\\n template <typename T>\\n void errprintln(T t)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(t);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n template <typename T>\\n void errprintln(T t, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(t, color);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n // print\\\"ln\\\" with iterator range\\n template <typename T>\\n void errprintln(T begin, T end)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(begin, end);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n template <typename T>\\n void errprintln(T begin, T end, Color color)\\n {\\n if (IS_TEST_ENVIROMENT)\\n {\\n errprint(begin, end, color);\\n std::cerr << \\\"\\\\n\\\";\\n }\\n }\\n // debug print\\n void debug()\\n {\\n errprintln(\\\"DEBUG\\\", Color::MAGENTA);\\n }\\n#pragma endregion // ePrint to stderr\\n\\n} // namespace comavius::competitive print\\n\\n\\n\\nnamespace comavius::competitive\\n{ // initial settings\\n void initial_settings()\\n {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::setprecision(15);\\n std::cerr << std::setprecision(15);\\n }\\n} // namespace comavius::competitive::initial_settings\\n\\n#pragma region // Read macro\\n#define GET_1_ARG(TYPE, ARG) \\\\\\n ; \\\\\\n TYPE ARG; \\\\\\n 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) \\\\\\n std::vector<TYPE> NAME(SIZE); \\\\\\n for (long long i = 0; i < SIZE; i++) \\\\\\n std::cin >> NAME[i];\\n#define readvv(TYPE, NAME, H, W) \\\\\\n std::vector<std::vector<TYPE>> NAME(H, std::vector<TYPE>(W)); \\\\\\n for (long long i = 0; i < H; i++) \\\\\\n for (long long j = 0; j < W; j++) \\\\\\n 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\\nusing namespace std;\\nusing namespace comavius::competitive;\\n#pragma endregion // namespace expansion\\n\\n#pragma endregion // comavius::competitive library\\n\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//using mint = modint998244353;\\nusing vvpll = vec<vec<pll>>;\\n\\nusing namespace std;\\n\\nstr replace(str s, ll bits) {\\n str vs = \\\"abcedfghijk\\\";\\n ll n = s.size();\\n rep(i, n) {\\n rep(j, vs.size()) {\\n if (s[i] == vs[j]) {\\n if ((bits >> j) & 1) {\\n s[i] = 'T';\\n }\\n else {\\n s[i] = 'F';\\n }\\n }\\n }\\n }\\n str s2;\\n rep(i, n){\\n if (s[i] == '-' && i != n-1 && s[i+1] == '>') {\\n s2.push_back('&');\\n i++;\\n }\\n else {\\n s2.push_back(s[i]);\\n }\\n }\\n return s2;\\n}\\n\\nchar myminus(char c) {\\n if (c == 'T') {\\n return 'F';\\n }\\n else {\\n return 'T';\\n }\\n}\\n\\nchar myprod(char l, char r) {\\n if (l == 'T' && r == 'T') {\\n return 'T';\\n }\\n else {\\n return 'F';\\n }\\n}\\n\\nchar myadd(char l, char r) {\\n if (l == 'T' || r == 'T') {\\n return 'T';\\n }\\n else {\\n return 'F';\\n }\\n}\\n\\nchar myimply(char l, char r) {\\n if (l == 'T' && r == 'F') {\\n return 'F';\\n }\\n else {\\n return 'T';\\n }\\n}\\n\\nbool eval(str s) {\\n ll n = s.size();\\n str stack;\\n reverse(all(s));\\n while (s.size()) {\\n char c = s.back();\\n s.pop_back();\\n if (c == 'T' || c == 'F') {\\n if (stack.size() != 0) {\\n if (stack.back() == '(') {\\n stack.push_back(c);\\n }\\n else {\\n char op = stack.back();\\n stack.pop_back();\\n if (op == '-') {\\n s.push_back(myminus(c));\\n }\\n else {\\n char left = stack.back();\\n stack.pop_back();\\n if (op == '*') {\\n s.push_back(myprod(left, c));\\n }\\n else if (op == '+') {\\n s.push_back(myadd(left, c));\\n }\\n else {\\n s.push_back(myimply(left, c));\\n }\\n }\\n }\\n }\\n else {\\n stack.push_back(c);\\n }\\n }\\n else if (c == ')') {\\n char prev = stack.back();\\n stack.pop_back();\\n stack.pop_back();\\n s.push_back(prev);\\n }\\n else {\\n stack.push_back(c);\\n }\\n //cerr << stack << \\\" \\\" << s << endl;\\n }\\n //cerr <<\\\"finally \\\"<<stack << endl;\\n if (stack[0] == 'T') {\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\\n\\nint main() {\\n read(str, s);\\n do {\\n ll n = s.size();\\n ll eqidx;\\n rep(i, n) {\\n if (s[i] == '=') {\\n eqidx = i;\\n }\\n }\\n str left = s.substr(0, eqidx);\\n str right = s.substr(eqidx+1, n - eqidx);\\n //cerr << left << \\\"\\\\n\\\" << right << endl;\\n bool ok = true;\\n rep(bits, (1ll << 11)) {\\n str l = replace(left, bits);\\n str r = replace(right, bits);\\n //cerr << l << endl;\\n bool l_b = eval(l);\\n bool r_b = eval(r);\\n if (l_b != r_b) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n cout << \\\"YES\\\\n\\\";\\n }\\n else {\\n cout << \\\"NO\\\\n\\\";\\n }\\n cin >> s;\\n } while (s != \\\"#\\\");\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.2417,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2401_10418222\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\\n#define rep2(i, a, b) rep3(i, a, b, 1)\\n#define rep1(i, n) rep2(i, 0, n)\\n#define rep0(n) rep1(aaaaa, n)\\n#define ov4(a, b, c, d, name, ...) name\\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\\n#define fore(e, v) for (auto&& e : v)\\n#define all(a) begin(a), end(a)\\n#define sz(a) (int)(size(a))\\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\\n#define eb emplace_back\\n\\ntemplate <typename T, typename S>\\nbool chmin(T& a, const S& b) {\\n return a > b ? a = b, 1 : 0;\\n}\\ntemplate <typename T, typename S>\\nbool chmax(T& a, const S& b) {\\n return a < b ? a = b, 1 : 0;\\n}\\nconst int INF = 1e9 + 100;\\nconst ll INFL = 3e18 + 100;\\n#define i128 __int128_t\\nstruct _ {\\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\\n} __;\\n\\nvoid solve();\\nint main(){\\n while(1)solve();\\n}\\n\\narray<int,11> val;\\nbool TF(string S){\\n // cerr<<S<<endl;\\n int N=sz(S);\\n if(S[0]=='-'){\\n string ns;\\n rep(i,1,N)ns.push_back(S[i]);\\n return !TF(ns);\\n }\\n if(N==1){\\n switch(S[0]){\\n case 'T':return true;\\n case 'F':return false;\\n default :return val[S[0]-'a'];\\n }\\n }\\n if(!(S[0]=='('&&S.back()==')'))exit(0);\\n int c=0;\\n string L,R;\\n int idx;\\n char op='/';\\n for(idx=1;idx<N-1;idx++){\\n if(c==0&&(S[idx]=='*'||S[idx]=='+'||S.substr(idx,2)==\\\"->\\\")){\\n op=S[idx];\\n if(op=='-')idx++;\\n break;\\n }\\n if(S[idx]=='(')c++;\\n if(S[idx]==')')c--;\\n L.push_back(S[idx]);\\n }\\n for(++idx;idx<N-1;idx++){\\n R.push_back(S[idx]);\\n }\\n bool l=TF(L),r=TF(R);\\n if(op=='*')return l&&r;\\n if(op=='+')return l||r;\\n if(op=='-')return (!l)||r;\\n assert(false);\\n}\\n\\nvoid solve(){\\n string Si;\\n cin>>Si;\\n if(Si==\\\"#\\\")exit(0);\\n string S;\\n fore(i,Si){\\n if(!S.empty()&&S.back()=='-'&&i=='-')S.pop_back();\\n else S.push_back(i);\\n }\\n string L,R;\\n int idx=0;\\n for(;idx<sz(S);idx++){\\n if(S[idx]=='='){\\n idx++;\\n break;\\n }\\n L.push_back(S[idx]);\\n }\\n for(;idx<sz(S);idx++){\\n R.push_back(S[idx]);\\n }\\n rep(i,1<<11){\\n rep(j,11){\\n val[j]=i>>j&1;\\n if(TF(L)!=TF(R)){\\n cout<<\\\"NO\\\\n\\\";\\n return;\\n }\\n }\\n }\\n cout<<\\\"YES\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.176,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2401_10417982\",\n \"code_snippet\": \"/**\\n\\tauthor: shobonvip\\n\\tcreated: 2025.04.24 17:46:57\\n**/\\n\\n#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#define all(v) v.begin(), v.end()\\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\\nstring so;\\n\\nstring s;\\nint piv = 0;\\nint jokyo = 0;\\n\\nbool formula();\\n\\nbool formula() {\\n\\tif (s[piv]=='T'){\\n\\t\\tpiv++;\\n\\t\\treturn true;\\n\\t}\\n\\tif (s[piv]=='F'){\\n\\t\\tpiv++;\\n\\t\\treturn false;\\n\\t}\\n\\n\\tif ('a'<=s[piv]&&s[piv]<='k') {\\n\\t\\tint dar=s[piv]-'a';\\n\\t\\tpiv++;\\n\\t\\tif((jokyo>>dar)&1){\\n\\t\\t\\treturn true;\\n\\t\\t}else{\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\tif (s[piv]=='-'){\\n\\t\\tpiv++;\\n\\t\\tbool ret=formula();\\n\\t\\tif(ret)return false;\\n\\t\\telse return true;\\n\\t}\\n\\n\\tif (s[piv]=='(') {\\n\\n\\t\\tpiv++;\\n\\t\\tbool ret1=formula();\\n\\t\\tchar c=s[piv];\\n\\t\\tif(c=='-'){\\n\\t\\t\\tpiv++;\\n\\t\\t\\tc=s[piv];\\n\\t\\t}\\n\\t\\tpiv++;\\n\\t\\tbool ret2=formula();\\n\\t\\tpiv++;\\n\\t\\tif(c=='*'){\\n\\t\\t\\tif(ret1&&ret2){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}else if(c=='+'){\\n\\t\\t\\tif(ret1||ret2){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tif(!ret1)return true;\\n\\t\\t\\tif(ret2)return true;\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\tassert(false);\\n}\\n\\nvoid solve() {\\n\\tpiv = 0;\\n\\tstring t1 = \\\"\\\";\\n\\tstring t2 = \\\"\\\";\\n\\tbool modes = 0;\\n\\trep(i,0,(int)so.size()) {\\n\\t\\tif (so[i]=='=') {\\n\\t\\t\\tmodes=1;\\n\\t\\t}else{\\n\\t\\t\\tif(modes){\\n\\t\\t\\t\\tt2+=so[i];\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tt1+=so[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvector<bool> var1(1<<11);\\n\\tvector<bool> var2(1<<11);\\n\\n\\ts=t1;\\n\\trep(i,0,1<<11){\\n\\t\\tjokyo=i;\\n\\t\\tpiv=0;\\n\\t\\tvar1[i]=formula();\\n\\t}\\n\\ts=t2;\\n\\trep(i,0,1<<11){\\n\\t\\tjokyo=i;\\n\\t\\tpiv=0;\\n\\t\\tvar2[i]=formula();\\n\\t}\\n\\n\\tif(var1==var2){\\n\\t\\tcout<<\\\"YES\\\\n\\\";\\n\\t}else{\\n\\t\\tcout<<\\\"NO\\\\n\\\";\\n\\t}\\n}\\n\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n\\twhile(true) {\\n\\t\\tcin >> so;\\n\\t\\tif (so == \\\"#\\\") break;\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.0557,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2401_10308908\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n#define endl '\\\\n'\\ntypedef long long int ll;\\ntypedef long double ld;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntemplate <typename T> istream &operator >>(istream &in, pair<T,T> &a) {in >> a.first >> a.second; return in;}\\ntemplate <typename T> ostream &operator <<(ostream &out, pair<T,T> &a) {out << a.first << ' ' << a.second; return out;}\\ntemplate <typename T> pair<T,T> operator - (pair<T,T> a, pair<T,T> b){return {a.first-b.first, a.second-b.second};}\\n\\nvoid tokenize(const string& s, char delimiter, vector<string> &out) {\\n\\tvector<string> tokens;\\n\\tstringstream ss(s);\\n\\tstring token;\\n\\twhile (getline(ss, token, delimiter)) out.push_back(token);\\n}\\n\\nvoid parse(string &s, string &out)\\n{\\n\\tstack<char> op_stack;\\n\\tunordered_map<char, int> precedence = {{'-', 4}, {'*', 3}, {'+', 2}, {'>', 1}, {'(', 0} };\\n\\n\\tfor ( int i = 0 ; i < s.size() ; i ++ )\\n\\t{\\n\\t\\tauto c = s[i];\\n\\t\\tif ( c == 'T' || c == 'F' || 'a' <= c && c <= 'z' )\\n\\t\\t\\tout.push_back(c);\\n\\t\\telse if ( c == '(')\\n\\t\\t\\top_stack.emplace('(');\\n\\t\\telse if ( c == ')' )\\n\\t\\t{\\n\\t\\t\\twhile (!op_stack.empty() && op_stack.top() != '(') {\\n\\t\\t\\t\\tout.push_back(op_stack.top());\\n\\t\\t\\t\\top_stack.pop();\\n\\t\\t\\t}\\n\\t\\t\\top_stack.pop();\\n\\t\\t}\\n\\t\\telse if ( c == '-' || c == '+' || c == '*' )\\n\\t\\t{\\n\\t\\t\\tif ( i + 1 < s.size() && s[i+1] == '>' ) c = s[++i];\\n\\t\\t\\twhile (!op_stack.empty() && precedence[op_stack.top()] > precedence[c]) {\\n\\t\\t\\t\\tout.push_back(op_stack.top());\\n\\t\\t\\t\\top_stack.pop();\\n\\t\\t\\t}\\n\\t\\t\\top_stack.push(c);\\n\\t\\t}\\n\\t}\\n\\twhile (!op_stack.empty()) {\\n\\t\\tout.push_back(op_stack.top());\\n\\t\\top_stack.pop();\\n\\t}\\n}\\n\\nbool calc(string &expr, vector<bool> &val)\\n{\\n\\tbool b;\\n\\tstack<bool> st;\\n\\tfor (auto c: expr )\\n\\t{\\n\\t\\tif ( c == 'T' ) st.push(true);\\n\\t\\telse if ( c == 'F' ) st.push(false);\\n\\t\\telse if ( 'a' <= c && c <= 'z' ) st.push(val[c-'a']);\\n\\t\\telse if ( c == '-' ) st.top() = !st.top();\\n\\t\\telse if ( c == '*' )\\n\\t\\t{\\n\\t\\t\\tb = st.top(); st.pop();\\n\\t\\t\\tst.top() = st.top() && b;\\n\\t\\t}\\n\\t\\telse if ( c == '+' )\\n\\t\\t{\\n\\t\\t\\tb = st.top(); st.pop();\\n\\t\\t\\tst.top() = st.top() || b;\\n\\t\\t}\\n\\t\\telse if ( c == '>' )\\n\\t\\t{\\n\\t\\t\\tb = st.top(); st.pop();\\n\\t\\t\\tst.top() = ( !st.top() || ( b && st.top() ));\\n\\t\\t}\\n\\t}\\n\\tassert ( st.size() == 1 );\\n\\treturn st.top();\\n}\\nvoid sol(int Case) {\\n\\tstring s;\\n\\twhile ( getline(cin, s) && s != \\\"#\\\")\\n\\t{\\n\\t\\tvector<string> equations ;\\n\\t\\ttokenize(s, '=', equations);\\n\\t\\tvector<string> postfix(equations.size());\\n\\t\\tfor ( int i = 0 ; i < equations.size() ; i ++ )\\n\\t\\t\\tparse(equations[i], postfix[i]);\\n\\n\\t\\tvector<bool> val(11);\\n\\t\\tint MaxN = 1 << 11;\\n\\n\\t\\tvector<bool> answer(equations.size());\\n\\t\\tbool ans = true;\\n\\t\\tfor ( int v = 0 ; v < MaxN && ans ; v++ )\\n\\t\\t{\\n\\t\\t\\tfor ( int j = 0 ; j < 11 ; j ++ )\\n\\t\\t\\t\\tval[j] = ( ( v >> j ) & 1 ) ? true : false;\\n\\n\\t\\t\\tfor ( int j = 0 ; j < equations.size() && ans ; j ++ )\\n\\t\\t\\t\\tanswer[j] = calc(postfix[j], val);\\n\\n\\t\\t\\tfor ( int j = 1 ; j < equations.size() && ans ; j ++ )\\n\\t\\t\\t\\tans = answer[j-1] == answer[j];\\n\\t\\t}\\n\\t\\tif ( ans ) cout << \\\"YES\\\\n\\\";\\n\\t\\telse cout << \\\"NO\\\\n\\\";\\n\\t}\\n}\\n\\nint main()\\n{\\n#ifdef AJAVA_DEBUG\\nfreopen(\\\"input.txt\\\", \\\"rt\\\", stdin);freopen(\\\"output.txt\\\", \\\"wt\\\", stdout);\\n#endif\\n cin.tie(nullptr)->sync_with_stdio(false);\\n\\tint T=1; \\n\\t// cin >> T;\\n\\tfor (int i = 1 ; i <= T ; i ++ ) sol(i);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.1085,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2401_10010444\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\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 overload(a, b, c, d, ...) d\\n#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)\\n#define all(a) begin(a), end(a)\\n#define sz(a) ssize(a)\\nbool chmin(auto& a, auto b) {\\n return a > b ? a = b, 1 : 0;\\n}\\nbool chmax(auto& a, auto b) {\\n return a < b ? a = b, 1 : 0;\\n}\\n\\nstruct Parser {\\n using CopyIter = string::const_iterator;\\n using Iter = CopyIter&;\\n string line;\\n CopyIter ed;\\n Parser(string s): line(s) {}\\n bool parse() {\\n auto it = line.cbegin();\\n ed = line.cend();\\n return formula(it);\\n }\\n void skip(Iter it, char c) {\\n assert(*it == c);\\n // cerr << *it << ' ' << c << endl;\\n it++;\\n }\\n bool formula(Iter it) {\\n if (*it == 'T') {\\n skip(it, 'T');\\n return true;\\n } else if (*it == 'F') {\\n skip(it, 'F');\\n return false;\\n } else if (*it == '-') {\\n skip(it, '-');\\n return true ^ formula(it);\\n } else {\\n skip(it, '(');\\n bool L = formula(it);\\n if (*it == '*') {\\n skip(it, '*');\\n auto R = formula(it);\\n L = L && R;\\n } else if (*it == '+') {\\n skip(it, '+');\\n auto R = formula(it);\\n L = L || R;\\n } else {\\n skip(it, '-');\\n skip(it, '>');\\n auto R = formula(it);\\n L = !L || R;\\n }\\n skip(it, ')');\\n return L;\\n }\\n }\\n};\\n\\nbool solve() {\\n string s;\\n getline(cin, s);\\n if (s == \\\"#\\\") return 1;\\n\\n string alphabet;\\n const int N = 11;\\n const string TorF = \\\"TF\\\";\\n rep(i, 0, N) alphabet.push_back(i + 'a');\\n\\n rep(i, 0, 1 << N) {\\n string t = s;\\n for (auto& c: t) {\\n if ('a' <= c && c <= 'k') {\\n c = TorF[(i >> (c - 'a')) & 1];\\n }\\n }\\n int m = find(all(t), '=') - t.begin();\\n auto L = t.substr(0, m);\\n auto R = t.substr(m + 1);\\n if (Parser(L).parse() != Parser(R).parse()) {\\n cout << \\\"NO\\\" << '\\\\n';\\n return 0;\\n }\\n }\\n\\n cout << \\\"YES\\\" << '\\\\n';\\n return 0;\\n}\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0821,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2401_9416245\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n// #include \\\"qitoy/math/binomial.hpp\\\"\\n\\n#define rep(i, n) for (long long i = 0; i < (n); i++)\\n#define rep1(i, n) for (long long i = 1; i <= (n); i++)\\n#define all(v) v.begin(), v.end()\\n#define decimal(n) cout << fixed << setprecision(n);\\nusing namespace std;\\n// using namespace atcoder;\\nusing vi = vector<int>; using vvi = vector<vi>; using vs = vector<string>;\\nusing ll = long long; using vl = vector<ll>; using vvl = vector<vl>; \\n// using mint = modint998244353;\\n// const ll MOD = 998244353;\\n// using mint = modint;\\n// const ll MOD = 998244353;\\n// using mint = modint1000000007;\\n// const ll MOD = 1000000007;\\n// using vm = vector<mint>; using vvm = vector<vm>;\\nusing vll = vl;\\nusing P = pair<ll, ll>; using T = tuple<ll, ll, ll>;\\nusing vc = vector<char>; using vvc = vector<vc>;\\nconst ll MAX = 2000100; const ll llINF = 2e18;\\nconst int intINF = 2e9; const long double pi = acos(-1);\\nll di[] = {0, -1, 0, 1, -1, -1, 1, 1};\\nll dj[] = {1, 0, -1, 0, 1, -1, -1, 1};\\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\\n\\n#include <string>\\n#include <cctype>\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\n// プロトタイプ宣言\\nbool equation (State &begin);\\nbool formula (State &begin);\\nbool element (State &begin);\\nvoid consume(State &begin, char expected);\\n\\n\\nvector<bool> value(11);\\n\\n// 四則演算の式をパースして、その評価結果を返す。\\nbool equation (State &begin) {\\n bool ret = formula(begin);\\n\\n consume(begin, '=');\\n\\n bool ret2 = formula(begin);\\n return (ret == ret2 ? true : false);\\n}\\n\\n// 乗算除算の式をパースして、その評価結果を返す。\\nbool formula (State &begin) {\\n bool ret;\\n \\n if(*begin == '-') {\\n consume(begin, '-');\\n ret = !(formula(begin));\\n }\\n else if(*begin == '(') {\\n consume(begin, '(');\\n bool temp1 = formula(begin);\\n if(*begin == '*') {\\n consume(begin, '*');\\n bool temp2 = formula(begin);\\n ret = (temp1 & temp2);\\n }\\n else if(*begin == '+') {\\n consume(begin, '+');\\n bool temp2 = formula(begin);\\n ret = (temp1 | temp2);\\n }\\n else if(*begin == '-') {\\n consume(begin, '-');\\n consume(begin, '>');\\n bool temp2 = formula(begin);\\n ret = ((!temp1) | temp2);\\n }\\n consume(begin, ')');\\n\\n }\\n else {\\n ret = element(begin);\\n }\\n\\n return ret;\\n}\\n\\nbool element (State &begin) {\\n if(*begin == 'T') {\\n consume(begin, 'T');\\n return true;\\n }\\n else if(*begin == 'F') {\\n consume(begin, 'F');\\n return false;\\n }\\n else {\\n bool ret = value[*begin - 'a'];\\n begin++;\\n return ret;\\n }\\n}\\n\\n// beginがexpectedを指していたらbeginを一つ進める。\\nvoid consume(State &begin, char expected) {\\n if (*begin == expected) {\\n begin++;\\n } else {\\n cerr << \\\"Expected '\\\" << expected << \\\"' but got '\\\" << *begin << \\\"'\\\"\\n << endl;\\n cerr << \\\"Rest string is '\\\";\\n while (*begin) {\\n cerr << *begin++;\\n }\\n cerr << \\\"'\\\" << endl;\\n throw ParseError();\\n }\\n}\\n\\nint main() {\\n while(true) {\\n string s;\\n cin >> s;\\n if(s == \\\"#\\\") break;\\n bool flag = true;\\n rep(bit, (1ll << 11)) {\\n rep(mask, 11) {\\n if(bit & (1ll << mask)) value[mask] = true;\\n else value[mask] = false;\\n }\\n State begin = s.begin();\\n if(!equation(begin)) {\\n flag = false;\\n break;\\n };\\n }\\n cout << (flag ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.0968,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2401_9370184\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = 1e9 + 10;\\nconst ll INFL = 4e18;\\n\\nbool v[11];\\n\\nusing State = string::const_iterator;\\nclass ParseError {};\\nvoid consume(State &begin, char expected) {\\n if (*begin == expected) {\\n begin++;\\n } else {\\n cerr << \\\"Expected '\\\" << expected << \\\"' but got '\\\" << *begin << \\\"'\\\" << endl;\\n cerr << \\\"Rest string is '\\\";\\n while (*begin) {\\n cerr << *begin++;\\n }\\n cerr << \\\"'\\\" << endl;\\n throw ParseError();\\n }\\n}\\n\\nbool contain(bool a, bool b) {\\n if (a && !b) {\\n return false;\\n }\\n return true;\\n}\\n\\nbool formula(State &begin);\\n\\nbool formula(State &begin) {\\n if (*begin == 'T') {\\n begin++;\\n return true;\\n }\\n if (*begin == 'F') {\\n begin++;\\n return false;\\n }\\n if ('a' <= *begin && *begin <= 'k') {\\n bool ret = v[*begin - 'a'];\\n begin++;\\n return ret;\\n }\\n if (*begin == '-') {\\n begin++;\\n return !formula(begin);\\n }\\n if (*begin == '(') {\\n begin++;\\n bool ret = formula(begin);\\n if (*begin == '+') {\\n begin++;\\n ret |= formula(begin);\\n } else if (*begin == '*') {\\n begin++;\\n ret &= formula(begin);\\n } else if (*begin == '-' && *next(begin) == '>') {\\n begin++;\\n begin++;\\n bool ret2 = formula(begin);\\n ret = contain(ret, ret2);\\n }\\n consume(begin, ')');\\n return ret;\\n }\\n return true;\\n}\\n\\nint main() {\\n while (true) {\\n string S;\\n cin >> S;\\n\\n if (S == \\\"#\\\") {\\n break;\\n }\\n\\n string A, B;\\n int N = S.size();\\n {\\n int i = 0;\\n for (i = 0; i < N; i++) {\\n if (S[i] == '=') {\\n i++;\\n break;\\n }\\n A.push_back(S[i]);\\n }\\n for (; i < N; i++) {\\n B.push_back(S[i]);\\n }\\n }\\n\\n bool ok = true;\\n for (int i = 0; i < 1 << 11; i++) {\\n for (int j = 0; j < 11; j++) {\\n if (i >> j & 1) {\\n v[j] = true;\\n } else {\\n v[j] = false;\\n }\\n }\\n State a = A.begin();\\n State b = B.begin();\\n\\n ok &= formula(a) == formula(b);\\n }\\n\\n if (ok) {\\n cout << \\\"YES\\\" << endl;\\n } else {\\n cout << \\\"NO\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.0997,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2401_9370053\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct Parser{\\n string s;\\n int var;\\n string::const_iterator itr;\\n\\n Parser(string s, int var) : s(s), var(var), itr(s.begin()){}\\n\\n bool parse(){\\n return equation();\\n }\\n\\n bool val(char ch){\\n if(ch == 'T') return true;\\n if(ch == 'F') return false;\\n return (var & (1 << (ch - 'a'))) > 0;\\n }\\n\\n bool equation(){\\n bool left = formula();\\n ++itr;\\n bool right = formula();\\n return left == right;\\n }\\n\\n bool formula(){\\n bool ret;\\n if(*itr == '-'){\\n ++itr;\\n ret = !formula();\\n }\\n else if(*itr == '('){\\n ++itr;\\n bool left = formula(), right;\\n if(*itr == '+'){\\n ++itr;\\n right = formula();\\n ret = left | right;\\n }\\n else if(*itr == '*'){\\n ++itr;\\n right = formula();\\n ret = left & right;\\n }\\n else{\\n ++itr; ++itr;\\n right = formula();\\n ret = !(left & (!right));\\n }\\n ++itr;\\n }\\n else{\\n ret = val(*itr);\\n ++itr;\\n }\\n return ret;\\n }\\n};\\n\\nint main(){\\n string s;\\n while(getline(cin, s)){\\n if(s == \\\"#\\\") break;\\n bool ans = true;\\n for(int i = 0; i < 1 << 11; ++i){\\n ans &= Parser(s, i).parse();\\n }\\n cout << (ans ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.1056,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2401_9369324\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = (int)1e9 + 1001010;\\nconst ll llINF = (long long)4e18 + 22000020;\\nconst string endn = \\\"\\\\n\\\";\\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\\nconst string ELEM_SEPARATION = \\\" \\\", VEC_SEPARATION = endn;\\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \\\"\\\");} return o;}\\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\\n#ifdef DEBUG\\n#include <debug_slephy.cpp>\\n#else\\n#define debug(...)\\n#endif\\n// ================================== ここまでテンプレ ==================================\\n\\n// Parser (T must have constructor T(long long))\\ntemplate<class T> struct Parser {\\n /* basic settings */\\n vector<vector<string>> OPERATORS; // binary operator priority\\n function<T(const string&, T, T)> OPERATION; // binary operation\\n\\n /* optional settings */\\n function<T(const string&, int&)> GET_LEAF; // leaf parser\\n vector<string> UNARY_OPERATORS; // unary operator (ex: \\\"-\\\", \\\"log\\\")\\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\\n const string OPERATOR_NUMBER = \\\"num\\\";\\n\\n /* result: parse tree */\\n int root; // vals[root] is the answer\\n vector<T> vals; // value of each node\\n vector<string> ops; // operator of each node\\n vector<int> left, right; // the index of left-node, right-node\\n vector<int> ids; // the node-index of the i-th value\\n\\n /* constructor */\\n string S;\\n Parser() {}\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n init(operators, operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n init(operators, operation, get_leaf);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, unary_operators, unary_operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, get_leaf, unary_operators, unary_operation);\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n OPERATORS = operators, OPERATION = operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void clear() {\\n S = \\\"\\\";\\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\\n }\\n\\n /* eval */\\n T eval(const string &str, bool default_parse_numeric = true) {\\n clear();\\n S = str;\\n int p = 0, id = 0;\\n root = parse(p, id, default_parse_numeric);\\n return vals[root];\\n }\\n\\n /* node generator */\\n // value\\n int new_leaf(T val, int &id) {\\n vals.push_back(val);\\n ops.push_back(OPERATOR_NUMBER);\\n left.push_back(-1);\\n right.push_back(-1);\\n ids.push_back(id++);\\n return (int)vals.size() - 1;\\n }\\n // FUNC(lp)\\n int new_node_with_left(T val, const string &op, int lp) {\\n vals.push_back(val);\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(-1);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n // (lp) op (rp)\\n int new_node_with_left_right(const string &op, int lp, int rp) {\\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(rp);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n\\n /* parser */\\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\\n assert(p >= 0 && p < (int)S.size());\\n string op;\\n if (depth < (int)OPERATORS.size()) {\\n // recursive descent\\n int lp = parse(p, id, default_parse_numeric, depth + 1);\\n bool update = false;\\n do {\\n update = false;\\n if (is_in_the_operators(p, op,\\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\\n int rp = parse(p, id, default_parse_numeric, depth + 1);\\n lp = new_node_with_left_right(op, lp, rp);\\n update = true;\\n }\\n } while (p < (int)S.size() && update);\\n return lp;\\n }\\n else if (default_parse_numeric && isdigit(S[p])) {\\n return get_number(p, id);\\n }\\n else if (S[p] == '(') {\\n return get_bracket(p, id, default_parse_numeric);\\n }\\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\\n return get_unary_operation(p, id, op, default_parse_numeric);\\n }\\n else {\\n return new_leaf(GET_LEAF(S, p), id);\\n }\\n }\\n bool is_the_operator(int &p, const string &op) {\\n if (op != \\\"\\\" && S.substr(p, op.size()) == op) {\\n p += op.size();\\n return true;\\n }\\n return false;\\n }\\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\\n for (const auto &op : ops) {\\n if (is_the_operator(p, op)) {\\n res_op = op;\\n return true;\\n }\\n }\\n return false;\\n }\\n int get_number(int &p, int &id) {\\n long long val = 0, sign = 1;\\n if (S[p] == '-') sign = -1, ++p;\\n while (p < (int)S.size() && isdigit(S[p])) {\\n val = val * 10 + (int)(S[p++] - '0');\\n }\\n return new_leaf(T(val * sign), id);\\n }\\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\\n ++p; // skip \\\"(\\\"\\n int lp = parse(p, id, default_parse_numeric, 0);\\n ++p; // skip \\\")\\\"\\n return lp;\\n }\\n int get_unary_operation(int &p, int &id, const string &op,\\n bool default_parse_numeric) {\\n int lp;\\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\\n }\\n\\n /* dump */\\n void dump() {\\n dump_rec(root);\\n }\\n void dump_rec(int v, string space = \\\"\\\") {\\n cout << space << v << \\\": (\\\" << ops[v] << \\\", \\\" << vals[v]\\n << \\\") -> left: \\\" << left[v] << \\\", right: \\\" << right[v] << endl;\\n if (left[v] != -1) dump_rec(left[v], space + \\\" \\\");\\n if (right[v] != -1) dump_rec(right[v], space + \\\" \\\");\\n }\\n};\\n\\nvoid solve(){\\n string s; cin >> s;\\n if(s == \\\"#\\\") exit(0);\\n\\n string s1, s2;\\n {\\n int pos = s.find(\\\"=\\\");\\n s1 = {s.begin(), s.begin()+pos};\\n s2 = {s.begin()+pos+1, s.end()};\\n debug(s1, s2);\\n }\\n\\n vector<vector<string>> operators = {{\\\"*\\\", \\\"+\\\", \\\"->\\\"}};\\n auto operation = [&](const string &op, bool l, bool r) -> bool {\\n if(op == \\\"*\\\") return (l & r);\\n else if(op == \\\"+\\\") return (l | r);\\n else if(op == \\\"->\\\") return (!l | r);\\n else exit(1);\\n };\\n\\n vector<string> unary_operators = {\\\"-\\\"};\\n auto unary_operation = [&](const string &op, bool l) -> bool {\\n if(op == \\\"-\\\") return !l;\\n else exit(1);\\n };\\n\\n\\n for(ll bt = 0; bt < (1LL<<11); bt++){\\n auto get_leaf = [&](const string &s, int &p) -> bool {\\n if(s[p] == 'T'){\\n p++;\\n return true;\\n }\\n else if(s[p] == 'F'){\\n p++;\\n return false;\\n }\\n else if('a' <= s[p] && s[p] <= 'k'){\\n int idx = s[p++] - 'a';\\n if(bit(bt, idx)) return true;\\n else return false;\\n }\\n else{\\n exit(1);\\n }\\n };\\n\\n Parser<bool> parser(operators, operation, get_leaf, unary_operators, unary_operation);\\n bool ans1 = parser.eval(s1, false);\\n bool ans2 = parser.eval(s2, false);\\n\\n if(ans1 != ans2){\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n }\\n\\n cout << \\\"YES\\\" << endl;\\n}\\n\\nint main() {\\n while(true) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.5463,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2401_9367458\",\n \"code_snippet\": \"//\\n// LL1 再帰降下パーサー\\n// 計算結果を出力するだけでなく、構文解析木を構築する\\n//\\n// verified:\\n// AOJ 0109 スマート計算機 (for basic expression)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0109&lang=jp\\n//\\n// AOJ 2613 Unordered Operators (for operator priority)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2613\\n//\\n// AOJ 2401 恒等式 (for unary \\\"not\\\" operator)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2401\\n//\\n// AOJ 1346 Miscalculation (for operator priority)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1346\\n//\\n// TTPC 2023 F - N^a (log N)^b (for unary \\\"log\\\" operator)\\n// https://atcoder.jp/contests/ttpc2023/tasks/ttpc2023_f\\n//\\n// AtCoder codeFlyer E - 数式とクエリ (for parse-tree)\\n// https://atcoder.jp/contests/bitflyer2018-final-open/tasks/bitflyer2018_final_e\\n//\\n\\n\\n/*\\n basic settings:\\n ・vector<set<string>> OPERATORS\\n - 登場する二項演算子と、その優先順位を設定する\\n ・function<T(const string&, T, T)> OPERATION\\n - 二項演算子に応じた二項演算の結果を出力する処理を設定する\\n\\n optional settings:\\n ・function<T(const string&, int&)> GET_LEAF\\n - 構文解析木において葉となる部分のパース方法を外部から指示したい場合に設定する\\n - 第二引数は文字列中の index を表す\\n ・string UNARY_OPERATORS\\n - パースする文字列に単項演算子 (\\\"-\\\" や \\\"log\\\" など) が含まれる場合、その関数を表す文字列を設定\\n ・function<T(T)> UNARY_OPERATION\\n - パースする文字列に単項演算子 (\\\"-\\\" や \\\"log\\\" など) が含まれる場合、その関数の中身を設定\\n\\n usage:\\n ・eval(const string &str, bool default_parse_numeric = true)\\n - 与えられた文字列 S をパースして、計算結果を出力する\\n - root, left, right などに構文解析木の構造が格納される (詳細は dump() を参照)\\n - 引数 default_parse_numeric について\\n - true：文字列 S 中の \\\"927\\\" などの通常の数値情報を long long 型にパースする\\n - false：数値情報などをパースする関数オブジェクトを外部で定義して渡す\\n ・dump()\\n - 文字列 S の構文解析木を出力する\\n */\\n\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n// Parser (T must have constructor T(long long))\\ntemplate<class T> struct Parser {\\n /* basic settings */\\n vector<vector<string>> OPERATORS; // binary operator priority\\n function<T(const string&, T, T)> OPERATION; // binary operation\\n\\n /* optional settings */\\n function<T(const string&, int&)> GET_LEAF; // leaf parser\\n vector<string> UNARY_OPERATORS; // unary operator (ex: \\\"-\\\", \\\"log\\\")\\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\\n const string OPERATOR_NUMBER = \\\"num\\\";\\n\\n /* result: parse tree */\\n int root; // vals[root] is the answer\\n vector<T> vals; // value of each node\\n vector<string> ops; // operator of each node\\n vector<int> left, right; // the index of left-node, right-node\\n vector<int> ids; // the node-index of the i-th value\\n\\n /* constructor */\\n string S;\\n Parser() {}\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n init(operators, operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n init(operators, operation, get_leaf);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, unary_operators, unary_operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, get_leaf, unary_operators, unary_operation);\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n OPERATORS = operators, OPERATION = operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void clear() {\\n S = \\\"\\\";\\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\\n }\\n\\n /* eval */\\n T eval(const string &str, bool default_parse_numeric = true) {\\n clear();\\n S = str;\\n int p = 0, id = 0;\\n root = parse(p, id, default_parse_numeric);\\n return vals[root];\\n }\\n\\n /* node generator */\\n // value\\n int new_leaf(T val, int &id) {\\n vals.push_back(val);\\n ops.push_back(OPERATOR_NUMBER);\\n left.push_back(-1);\\n right.push_back(-1);\\n ids.push_back(id++);\\n return (int)vals.size() - 1;\\n }\\n // FUNC(lp)\\n int new_node_with_left(T val, const string &op, int lp) {\\n vals.push_back(val);\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(-1);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n // (lp) op (rp)\\n int new_node_with_left_right(const string &op, int lp, int rp) {\\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(rp);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n\\n /* parser */\\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\\n assert(p >= 0 && p < (int)S.size());\\n string op;\\n if (depth < (int)OPERATORS.size()) {\\n // recursive descent\\n int lp = parse(p, id, default_parse_numeric, depth + 1);\\n bool update = false;\\n do {\\n update = false;\\n if (is_in_the_operators(p, op,\\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\\n int rp = parse(p, id, default_parse_numeric, depth + 1);\\n lp = new_node_with_left_right(op, lp, rp);\\n update = true;\\n }\\n } while (p < (int)S.size() && update);\\n return lp;\\n }\\n else if (default_parse_numeric && isdigit(S[p])) {\\n return get_number(p, id);\\n }\\n else if (S[p] == '(') {\\n return get_bracket(p, id, default_parse_numeric);\\n }\\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\\n return get_unary_operation(p, id, op, default_parse_numeric);\\n }\\n else {\\n return new_leaf(GET_LEAF(S, p), id);\\n }\\n }\\n bool is_the_operator(int &p, const string &op) {\\n if (op != \\\"\\\" && S.substr(p, op.size()) == op) {\\n p += op.size();\\n return true;\\n }\\n return false;\\n }\\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\\n for (const auto &op : ops) {\\n if (is_the_operator(p, op)) {\\n res_op = op;\\n return true;\\n }\\n }\\n return false;\\n }\\n int get_number(int &p, int &id) {\\n long long val = 0, sign = 1;\\n if (S[p] == '-') sign = -1, ++p;\\n while (p < (int)S.size() && isdigit(S[p])) {\\n val = val * 10 + (int)(S[p++] - '0');\\n }\\n return new_leaf(T(val * sign), id);\\n }\\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\\n ++p; // skip \\\"(\\\"\\n int lp = parse(p, id, default_parse_numeric, 0);\\n ++p; // skip \\\")\\\"\\n return lp;\\n }\\n int get_unary_operation(int &p, int &id, const string &op,\\n bool default_parse_numeric) {\\n int lp;\\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\\n }\\n\\n /* dump */\\n void dump() {\\n dump_rec(root);\\n }\\n void dump_rec(int v, string space = \\\"\\\") {\\n cout << space << v << \\\": (\\\" << ops[v] << \\\", \\\" << vals[v]\\n << \\\") -> left: \\\" << left[v] << \\\", right: \\\" << right[v] << endl;\\n if (left[v] != -1) dump_rec(left[v], space + \\\" \\\");\\n if (right[v] != -1) dump_rec(right[v], space + \\\" \\\");\\n }\\n};\\n\\n\\n\\n//------------------------------//\\n// Examples\\n//------------------------------//\\n\\n/* user small test */\\nvoid small_test() {\\n // set parser\\n vector<vector<string>> operators = {{\\\"*\\\", \\\"/\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else if (op == \\\"/\\\") return a / b;\\n else return 0;\\n };\\n vector<string> unary_operators = {\\\"-\\\"};\\n auto unary_operation = [&](const string &op, long long a) -> long long {\\n return -a;\\n };\\n Parser<long long> ps(operators, operation, unary_operators, unary_operation);\\n\\n vector<string> tests = {\\n \\\"-(-3)\\\",\\n \\\"-(-9+3*(-4))\\\",\\n \\\"-5-(-3)\\\",\\n \\\"-4-99\\\"\\n };\\n for (const auto &S : tests) {\\n cout << S << \\\" = \\\" << ps.eval(S) << endl;\\n }\\n}\\n\\n\\n/* AOJ 0109 */\\nvoid AOJ_0109() {\\n vector<vector<string>> operators = {{\\\"*\\\", \\\"/\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else if (op == \\\"/\\\") return a / b;\\n else return 0;\\n };\\n Parser<long long> ps(operators, operation);\\n\\n int N;\\n cin >> N;\\n for (int i = 0; i < N; ++i) {\\n string S;\\n cin >> S;\\n S.pop_back();\\n cout << ps.eval(S) << endl;\\n }\\n}\\n\\n\\n/* AOJ 2613 */\\nvoid AOJ_2613() {\\n string S;\\n cin >> S;\\n\\n // 二項演算を設定\\n auto operation = [&](const string &op, long long l, long long r) -> long long {\\n if (op == \\\"+\\\") return l + r;\\n else if (op == \\\"-\\\") return l - r;\\n else return l * r;\\n };\\n\\n // 演算子の優先順位をすべて試す\\n long long res = -LONG_MAX;\\n for (int i = 0; i < 3; ++i) {\\n for (int j = 0; j < 3; ++j) {\\n for (int k = 0; k < 3; ++k) {\\n vector<vector<string>> operators(3);\\n operators[i].push_back(\\\"+\\\");\\n operators[j].push_back(\\\"-\\\");\\n operators[k].push_back(\\\"*\\\");\\n Parser<long long> ps(operators, operation);\\n res = max(res, ps.eval(S));\\n }\\n }\\n }\\n cout << res << endl;\\n}\\n\\n\\n/* AOJ 2401 */\\nvoid AOJ_2401() {\\n // parser settings //\\n vector<vector<string>> ops = {{\\\"+\\\", \\\"*\\\", \\\"->\\\"}};\\n auto operation = [&](const string &op, bool l, bool r) -> bool {\\n if (op == \\\"+\\\") return (l || r);\\n else if (op == \\\"*\\\") return (l && r);\\n else if (op == \\\"->\\\") return (!l || r);\\n else exit(1);\\n };\\n auto get_leaf = [&](const string &S, int &p) -> bool {\\n return (S[p++] == 'T' ? true : false);\\n };\\n vector<string> unary_ops = {\\\"-\\\"};\\n auto unary_operation = [&](const string &op, bool l) -> bool {\\n if (op == \\\"-\\\") return !l;\\n else exit(1);\\n };\\n Parser<bool> ps1(ops, operation, get_leaf, unary_ops, unary_operation);\\n Parser<bool> ps2(ops, operation, get_leaf, unary_ops, unary_operation);\\n\\n string S;\\n while (cin >> S) {\\n if (S == \\\"#\\\") break;\\n for (int i = 0; i < S.size(); ++i) if (S[i] == '=') S[i] = ' ';\\n\\n bool res = true;\\n for (int bit = 0; bit < (1<<11); ++bit) {\\n string SS = S;\\n for (int i = 0; i < SS.size(); ++i) {\\n if (SS[i] >= 'a' && SS[i] <= 'k') {\\n int id = SS[i] - 'a';\\n if (bit & (1<<id)) SS[i] = 'T';\\n else SS[i] = 'F';\\n }\\n }\\n istringstream si(SS);\\n string s1, s2;\\n si >> s1 >> s2;\\n bool r1 = ps1.eval(s1, false), r2 = ps2.eval(s2, false);\\n if (r1 != r2) {\\n res = false;\\n }\\n\\n }\\n if (res) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n }\\n}\\n\\n\\n/* AOJ 1346 */\\nvoid AOJ_1346() {\\n // multiplication-rool parser, left-to-right parser\\n vector<vector<string>> operator_mul = {{\\\"*\\\"}, {\\\"+\\\"}};\\n vector<vector<string>> operator_left_right = {{\\\"+\\\", \\\"*\\\"}};\\n auto operation = [&](string op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else return a * b;\\n };\\n Parser<long long> ps_mul(operator_mul, operation);\\n Parser<long long> ps_left_right(operator_left_right, operation);\\n\\n string S;\\n long long ans;\\n cin >> S >> ans;\\n\\n bool mul = false, left_right = false;\\n if (ps_mul.eval(S) == ans) mul = true;\\n if (ps_left_right.eval(S) == ans) left_right = true;\\n\\n if (mul && left_right) cout << \\\"U\\\" << endl;\\n else if (mul) cout << \\\"M\\\" << endl;\\n else if (left_right) cout << \\\"L\\\" << endl;\\n else cout << \\\"I\\\" << endl;\\n}\\n\\n\\n/* TTPC 2023 F */\\nstruct Node {\\n long long n, l, val;\\n bool eps;\\n Node(long long n = 0, long long l = 0, long long e = 0, long long v = 0)\\n : n(n), l(l), eps(e), val(v) {}\\n friend ostream& operator << (ostream &s, Node node) {\\n return s << \\\"(\\\" << node.n << \\\", \\\" << node.l << \\\", \\\" << node.eps\\n << \\\", \\\" << node.val << \\\")\\\";\\n }\\n};\\n\\nvoid TTPC_2023_F() {\\n // operators\\n vector<vector<string>> operators = {{\\\"^\\\"}, {\\\"*\\\"}, {\\\"+\\\"}};\\n\\n // define binary operation\\n auto operation = [&](const string &op, const Node &l, const Node &r) -> Node {\\n if (op == \\\"+\\\") {\\n vector<long long> vl({l.n, l.l, (long long)l.eps, l.val});\\n vector<long long> vr({r.n, r.l, (long long)r.eps, r.val});\\n return (vl > vr ? l : r);\\n }\\n else if (op == \\\"*\\\") return Node(l.n + r.n, l.l + r.l, l.eps | r.eps, 1);\\n else if (op == \\\"^\\\") return Node(l.n * r.val, l.l * r.val, l.eps, 1);\\n else return Node();\\n };\\n\\n // define number process\\n auto get_leaf = [&](const string &S, int &p) -> Node {\\n if (S[p] == 'N') {\\n ++p;\\n return Node(1, 0, false, 1);\\n } else {\\n long long val = 0;\\n do {\\n val = val * 10 + (int)(S[p++] - '0');\\n } while (S[p] >= '0' && S[p] <= '9');\\n return Node(0, 0, false, val);\\n }\\n };\\n\\n // define function (log)\\n vector<string> unary_operators = {\\\"log\\\"};\\n auto unary_operation = [&](const string &op, const Node &node) -> Node {\\n if (op == \\\"log\\\") {\\n if (node.n >= 1) return Node(0, 1, false, 1);\\n else return Node(0, 0, true, 0);\\n } else return Node();\\n };\\n\\n // 入力\\n string S;\\n cin >> S;\\n Parser<Node> ps(operators, operation, get_leaf, unary_operators, unary_operation);\\n auto res = ps.eval(S, false);\\n //ps.dump();\\n\\n if (res.eps) ++res.l;\\n cout << res.n << \\\" \\\" << res.l << endl;\\n}\\n\\n\\n/* codeFloyer E */\\ntemplate<int MOD> struct Fp {\\n // inner value\\n long long val;\\n\\n // constructor\\n constexpr Fp() : val(0) { }\\n constexpr Fp(long long v) : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr long long get() const { return val; }\\n constexpr int get_mod() const { return MOD; }\\n\\n // arithmetic operators\\n constexpr Fp operator + () const { return Fp(*this); }\\n constexpr Fp operator - () const { return Fp(0) - Fp(*this); }\\n constexpr Fp operator + (const Fp &r) const { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp &r) const { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp &r) const { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp &r) const { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp &r) {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp &r) {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp &r) {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp &r) {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp pow(long long n) const {\\n Fp res(1), mul(*this);\\n while (n > 0) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr Fp inv() const {\\n Fp res(1), div(*this);\\n return res / div;\\n }\\n\\n // other operators\\n constexpr bool operator == (const Fp &r) const {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp &r) const {\\n return this->val != r.val;\\n }\\n constexpr Fp& operator ++ () {\\n ++val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -- () {\\n if (val == 0) val += MOD;\\n --val;\\n return *this;\\n }\\n constexpr Fp operator ++ (int) const {\\n Fp res = *this;\\n ++*this;\\n return res;\\n }\\n constexpr Fp operator -- (int) const {\\n Fp res = *this;\\n --*this;\\n return res;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD> &x) {\\n is >> x.val;\\n x.val %= MOD;\\n if (x.val < 0) x.val += MOD;\\n return is;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD> &x) {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> pow(const Fp<MOD> &r, long long n) {\\n return r.pow(n);\\n }\\n friend constexpr Fp<MOD> inv(const Fp<MOD> &r) {\\n return r.inv();\\n }\\n};\\n\\nvoid codeFloyer_E() {\\n const int MOD = 1000000007;\\n using mint = Fp<MOD>;\\n\\n // 入力\\n string S;\\n int Q;\\n cin >> S >> Q;\\n int N = 0;\\n for (int i = 0; i < S.size(); ++i) if (S[i] == 'a') ++N;\\n vector<long long> given(N);\\n for (int i = 0; i < N; ++i) cin >> given[i];\\n\\n // set Parser\\n vector<vector<string>> operators = {{\\\"*\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, mint a, mint b) -> mint {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else return 0;\\n };\\n int id = 0;\\n auto get_leaf = [&](const string &S, int &p) -> mint {\\n if (S[p] == 'a') {\\n ++p;\\n return given[id++];\\n } else return 0;\\n };\\n Parser<mint> ps(operators, operation, get_leaf);\\n mint base = ps.eval(S);\\n\\n // DP\\n vector<mint> dp(N);\\n auto rec = [&](auto self, int v, mint w) -> void {\\n if (ps.ops[v] == ps.OPERATOR_NUMBER) dp[ps.ids[v]] = w;\\n else if (ps.ops[v] == \\\"+\\\") {\\n self(self, ps.left[v], w);\\n self(self, ps.right[v], w);\\n }\\n else if (ps.ops[v] == \\\"-\\\") {\\n self(self, ps.left[v], w);\\n self(self, ps.right[v], -w);\\n }\\n else if (ps.ops[v] == \\\"*\\\") {\\n self(self, ps.left[v], w * ps.vals[ps.right[v]]);\\n self(self, ps.right[v], w * ps.vals[ps.left[v]]);\\n }\\n };\\n rec(rec, ps.root, mint(1));\\n\\n // 出力\\n for (int q = 0; q < Q; ++q) {\\n long long id, x;\\n cin >> id >> x;\\n --id;\\n mint res = base + dp[id] * (x - given[id]);\\n cout << res << endl;\\n }\\n}\\n\\n\\nint main() {\\n // small_test();\\n //AOJ_0109();\\n //AOJ_2613();\\n AOJ_2401();\\n //AOJ_1346();\\n //TTPC_2023_F();\\n //codeFloyer_E();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3824,\n \"score_of_the_acc\": -0.7466,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2401_9365588\",\n \"code_snippet\": \"//\\n// LL1 再帰降下パーサー\\n// 計算結果を出力するだけでなく、構文解析木を構築する\\n//\\n// verified:\\n// AOJ 0109 スマート計算機 (for basic expression)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0109&lang=jp\\n//\\n// AOJ 2613 Unordered Operators (for operator priority)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2613\\n//\\n// AOJ 2401 恒等式 (for unary \\\"not\\\" operator)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2401\\n//\\n// AOJ 1346 Miscalculation (for operator priority)\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1346\\n//\\n// TTPC 2023 F - N^a (log N)^b (for unary \\\"log\\\" operator)\\n// https://atcoder.jp/contests/ttpc2023/tasks/ttpc2023_f\\n//\\n// AtCoder codeFlyer E - 数式とクエリ (for parse-tree)\\n// https://atcoder.jp/contests/bitflyer2018-final-open/tasks/bitflyer2018_final_e\\n//\\n\\n\\n/*\\n basic settings:\\n ・vector<set<string>> OPERATORS\\n - 登場する二項演算子と、その優先順位を設定する\\n ・function<T(const string&, T, T)> OPERATION\\n - 二項演算子に応じた二項演算の結果を出力する処理を設定する\\n\\n optional settings:\\n ・function<T(const string&, int&)> GET_LEAF\\n - 構文解析木において葉となる部分のパース方法を外部から指示したい場合に設定する\\n - 第二引数は文字列中の index を表す\\n ・string UNARY_OPERATORS\\n - パースする文字列に単項演算子 (\\\"-\\\" や \\\"log\\\" など) が含まれる場合、その関数を表す文字列を設定\\n ・function<T(T)> UNARY_OPERATION\\n - パースする文字列に単項演算子 (\\\"-\\\" や \\\"log\\\" など) が含まれる場合、その関数の中身を設定\\n\\n usage:\\n ・eval(const string &str, bool default_parse_numeric = true)\\n - 与えられた文字列 S をパースして、計算結果を出力する\\n - root, left, right などに構文解析木の構造が格納される (詳細は dump() を参照)\\n - 引数 default_parse_numeric について\\n - true：文字列 S 中の \\\"927\\\" などの通常の数値情報を long long 型にパースする\\n - false：数値情報などをパースする関数オブジェクトを外部で定義して渡す\\n ・dump()\\n - 文字列 S の構文解析木を出力する\\n */\\n\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n// Parser (T must have constructor T(long long))\\ntemplate<class T> struct Parser {\\n /* basic settings */\\n vector<vector<string>> OPERATORS; // binary operator priority\\n function<T(const string&, T, T)> OPERATION; // binary operation\\n\\n /* optional settings */\\n function<T(const string&, int&)> GET_LEAF; // leaf parser\\n vector<string> UNARY_OPERATORS; // unary operator (ex: \\\"-\\\", \\\"log\\\")\\n function<T(const string&, T)> UNARY_OPERATION; // unary operation\\n const string OPERATOR_NUMBER = \\\"num\\\";\\n\\n /* result: parse tree */\\n int root; // vals[root] is the answer\\n vector<T> vals; // value of each node\\n vector<string> ops; // operator of each node\\n vector<int> left, right; // the index of left-node, right-node\\n vector<int> ids; // the node-index of the i-th value\\n\\n /* constructor */\\n string S;\\n Parser() {}\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n init(operators, operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n init(operators, operation, get_leaf);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, unary_operators, unary_operation);\\n }\\n Parser(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n init(operators, operation, get_leaf, unary_operators, unary_operation);\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation) {\\n OPERATORS = operators, OPERATION = operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void init(const vector<vector<string>> &operators,\\n const function<T(const string&, T, T)> operation,\\n const function<T(const string&, int&)> get_leaf,\\n const vector<string> &unary_operators,\\n const function<T(const string &op, T)> unary_operation) {\\n OPERATORS = operators, OPERATION = operation;\\n GET_LEAF = get_leaf;\\n UNARY_OPERATORS = unary_operators, UNARY_OPERATION = unary_operation;\\n }\\n void clear() {\\n S = \\\"\\\";\\n vals.clear(), ops.clear(), left.clear(), right.clear(), ids.clear();\\n }\\n\\n /* eval */\\n T eval(const string &str, bool default_parse_numeric = true) {\\n clear();\\n S = str;\\n int p = 0, id = 0;\\n root = parse(p, id, default_parse_numeric);\\n return vals[root];\\n }\\n\\n /* node generator */\\n // value\\n int new_leaf(T val, int &id) {\\n vals.push_back(val);\\n ops.push_back(OPERATOR_NUMBER);\\n left.push_back(-1);\\n right.push_back(-1);\\n ids.push_back(id++);\\n return (int)vals.size() - 1;\\n }\\n // FUNC(lp)\\n int new_node_with_left(T val, const string &op, int lp) {\\n vals.push_back(val);\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(-1);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n // (lp) op (rp)\\n int new_node_with_left_right(const string &op, int lp, int rp) {\\n vals.push_back(OPERATION(op, vals[lp], vals[rp]));\\n ops.push_back(op);\\n left.push_back(lp);\\n right.push_back(rp);\\n ids.push_back(-1);\\n return (int)vals.size() - 1;\\n }\\n\\n /* parser */\\n int parse(int &p, int &id, bool default_parse_numeric, int depth = 0) {\\n assert(p >= 0 && p < (int)S.size());\\n string op;\\n if (depth < (int)OPERATORS.size()) {\\n // recursive descent\\n int lp = parse(p, id, default_parse_numeric, depth + 1);\\n bool update = false;\\n do {\\n update = false;\\n if (is_in_the_operators(p, op,\\n OPERATORS[(int)OPERATORS.size() - depth - 1])) {\\n int rp = parse(p, id, default_parse_numeric, depth + 1);\\n lp = new_node_with_left_right(op, lp, rp);\\n update = true;\\n }\\n } while (p < (int)S.size() && update);\\n return lp;\\n }\\n else if (default_parse_numeric && isdigit(S[p])) {\\n return get_number(p, id);\\n }\\n else if (S[p] == '(') {\\n return get_bracket(p, id, default_parse_numeric);\\n }\\n else if (is_in_the_operators(p, op, UNARY_OPERATORS)) {\\n return get_unary_operation(p, id, op, default_parse_numeric);\\n }\\n else {\\n return new_leaf(GET_LEAF(S, p), id);\\n }\\n }\\n bool is_the_operator(int &p, const string &op) {\\n if (op != \\\"\\\" && S.substr(p, op.size()) == op) {\\n p += op.size();\\n return true;\\n }\\n return false;\\n }\\n bool is_in_the_operators(int &p, string &res_op, const vector<string> &ops) {\\n for (const auto &op : ops) {\\n if (is_the_operator(p, op)) {\\n res_op = op;\\n return true;\\n }\\n }\\n return false;\\n }\\n int get_number(int &p, int &id) {\\n long long val = 0, sign = 1;\\n if (S[p] == '-') sign = -1, ++p;\\n while (p < (int)S.size() && isdigit(S[p])) {\\n val = val * 10 + (int)(S[p++] - '0');\\n }\\n return new_leaf(T(val * sign), id);\\n }\\n int get_bracket(int &p, int &id, bool default_parse_numeric) {\\n ++p; // skip \\\"(\\\"\\n int lp = parse(p, id, default_parse_numeric, 0);\\n ++p; // skip \\\")\\\"\\n return lp;\\n }\\n int get_unary_operation(int &p, int &id, const string &op,\\n bool default_parse_numeric) {\\n int lp;\\n if (S[p] == '(') lp = get_bracket(p, id, default_parse_numeric);\\n else lp = parse(p, id, default_parse_numeric, (int)OPERATORS.size());\\n return new_node_with_left(UNARY_OPERATION(op, vals[lp]), op, lp);\\n }\\n\\n /* dump */\\n void dump() {\\n dump_rec(root);\\n }\\n void dump_rec(int v, string space = \\\"\\\") {\\n cout << space << v << \\\": (\\\" << ops[v] << \\\", \\\" << vals[v]\\n << \\\") -> left: \\\" << left[v] << \\\", right: \\\" << right[v] << endl;\\n if (left[v] != -1) dump_rec(left[v], space + \\\" \\\");\\n if (right[v] != -1) dump_rec(right[v], space + \\\" \\\");\\n }\\n};\\n\\n\\n\\n//------------------------------//\\n// Examples\\n//------------------------------//\\n\\n/* user small test */\\nvoid small_test() {\\n // set parser\\n vector<vector<string>> operators = {{\\\"*\\\", \\\"/\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else if (op == \\\"/\\\") return a / b;\\n else return 0;\\n };\\n vector<string> unary_operators = {\\\"-\\\"};\\n auto unary_operation = [&](const string &op, long long a) -> long long {\\n return -a;\\n };\\n Parser<long long> ps(operators, operation, unary_operators, unary_operation);\\n\\n vector<string> tests = {\\n \\\"-(-3)\\\",\\n \\\"-(-9+3*(-4))\\\",\\n \\\"-5-(-3)\\\",\\n \\\"-4-99\\\"\\n };\\n for (const auto &S : tests) {\\n cout << S << \\\" = \\\" << ps.eval(S) << endl;\\n }\\n}\\n\\n\\n/* AOJ 0109 */\\nvoid AOJ_0109() {\\n vector<vector<string>> operators = {{\\\"*\\\", \\\"/\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else if (op == \\\"/\\\") return a / b;\\n else return 0;\\n };\\n Parser<long long> ps(operators, operation);\\n\\n int N;\\n cin >> N;\\n for (int i = 0; i < N; ++i) {\\n string S;\\n cin >> S;\\n S.pop_back();\\n cout << ps.eval(S) << endl;\\n }\\n}\\n\\n\\n/* AOJ 2613 */\\nvoid AOJ_2613() {\\n string S;\\n cin >> S;\\n\\n // 二項演算を設定\\n auto operation = [&](const string &op, long long l, long long r) -> long long {\\n if (op == \\\"+\\\") return l + r;\\n else if (op == \\\"-\\\") return l - r;\\n else return l * r;\\n };\\n\\n // 演算子の優先順位をすべて試す\\n long long res = -LONG_MAX;\\n for (int i = 0; i < 3; ++i) {\\n for (int j = 0; j < 3; ++j) {\\n for (int k = 0; k < 3; ++k) {\\n vector<vector<string>> operators(3);\\n operators[i].push_back(\\\"+\\\");\\n operators[j].push_back(\\\"-\\\");\\n operators[k].push_back(\\\"*\\\");\\n Parser<long long> ps(operators, operation);\\n res = max(res, ps.eval(S));\\n }\\n }\\n }\\n cout << res << endl;\\n}\\n\\n\\n/* AOJ 2401 */\\nvoid AOJ_2401() {\\n // parser settings //\\n vector<vector<string>> ops = {{\\\"+\\\", \\\"*\\\", \\\"->\\\"}};\\n auto operation = [&](const string &op, bool l, bool r) -> bool {\\n if (op == \\\"+\\\") return (l || r);\\n else if (op == \\\"*\\\") return (l && r);\\n else if (op == \\\"->\\\") return (!l || r);\\n else return true;\\n };\\n auto get_leaf = [&](const string &S, int &p) -> bool {\\n return (S[p++] == 'T' ? true : false);\\n };\\n vector<string> unary_ops = {\\\"-\\\"};\\n auto unary_operation = [&](const string &op, bool l) -> bool {\\n if (op == \\\"-\\\") return !l;\\n else return l;\\n };\\n Parser<bool> ps1(ops, operation, get_leaf, unary_ops, unary_operation);\\n Parser<bool> ps2(ops, operation, get_leaf, unary_ops, unary_operation);\\n\\n string S;\\n while (cin >> S) {\\n if (S == \\\"#\\\") break;\\n for (int i = 0; i < S.size(); ++i) if (S[i] == '=') S[i] = ' ';\\n\\n bool res = true;\\n for (int bit = 0; bit < (1<<11); ++bit) {\\n string SS = S;\\n for (int i = 0; i < SS.size(); ++i) {\\n if (SS[i] >= 'a' && SS[i] <= 'k') {\\n int id = SS[i] - 'a';\\n if (bit & (1<<id)) SS[i] = 'T';\\n else SS[i] = 'F';\\n }\\n }\\n istringstream si(SS);\\n string s1, s2;\\n si >> s1 >> s2;\\n bool r1 = ps1.eval(s1, false), r2 = ps2.eval(s2, false);\\n if (r1 != r2) {\\n res = false;\\n }\\n }\\n if (res) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n }\\n}\\n\\n\\n/* AOJ 1346 */\\nvoid AOJ_1346() {\\n // multiplication-rool parser, left-to-right parser\\n vector<vector<string>> operator_mul = {{\\\"*\\\"}, {\\\"+\\\"}};\\n vector<vector<string>> operator_left_right = {{\\\"+\\\", \\\"*\\\"}};\\n auto operation = [&](string op, long long a, long long b) -> long long {\\n if (op == \\\"+\\\") return a + b;\\n else return a * b;\\n };\\n Parser<long long> ps_mul(operator_mul, operation);\\n Parser<long long> ps_left_right(operator_left_right, operation);\\n\\n string S;\\n long long ans;\\n cin >> S >> ans;\\n\\n bool mul = false, left_right = false;\\n if (ps_mul.eval(S) == ans) mul = true;\\n if (ps_left_right.eval(S) == ans) left_right = true;\\n\\n if (mul && left_right) cout << \\\"U\\\" << endl;\\n else if (mul) cout << \\\"M\\\" << endl;\\n else if (left_right) cout << \\\"L\\\" << endl;\\n else cout << \\\"I\\\" << endl;\\n}\\n\\n\\n/* TTPC 2023 F */\\nstruct Node {\\n long long n, l, val;\\n bool eps;\\n Node(long long n = 0, long long l = 0, long long e = 0, long long v = 0)\\n : n(n), l(l), eps(e), val(v) {}\\n friend ostream& operator << (ostream &s, Node node) {\\n return s << \\\"(\\\" << node.n << \\\", \\\" << node.l << \\\", \\\" << node.eps\\n << \\\", \\\" << node.val << \\\")\\\";\\n }\\n};\\n\\nvoid TTPC_2023_F() {\\n // operators\\n vector<vector<string>> operators = {{\\\"^\\\"}, {\\\"*\\\"}, {\\\"+\\\"}};\\n\\n // define binary operation\\n auto operation = [&](const string &op, const Node &l, const Node &r) -> Node {\\n if (op == \\\"+\\\") {\\n vector<long long> vl({l.n, l.l, (long long)l.eps, l.val});\\n vector<long long> vr({r.n, r.l, (long long)r.eps, r.val});\\n return (vl > vr ? l : r);\\n }\\n else if (op == \\\"*\\\") return Node(l.n + r.n, l.l + r.l, l.eps | r.eps, 1);\\n else if (op == \\\"^\\\") return Node(l.n * r.val, l.l * r.val, l.eps, 1);\\n else return Node();\\n };\\n\\n // define number process\\n auto get_leaf = [&](const string &S, int &p) -> Node {\\n if (S[p] == 'N') {\\n ++p;\\n return Node(1, 0, false, 1);\\n } else {\\n long long val = 0;\\n do {\\n val = val * 10 + (int)(S[p++] - '0');\\n } while (S[p] >= '0' && S[p] <= '9');\\n return Node(0, 0, false, val);\\n }\\n };\\n\\n // define function (log)\\n vector<string> unary_operators = {\\\"log\\\"};\\n auto unary_operation = [&](const string &op, const Node &node) -> Node {\\n if (op == \\\"log\\\") {\\n if (node.n >= 1) return Node(0, 1, false, 1);\\n else return Node(0, 0, true, 0);\\n } else return Node();\\n };\\n\\n // 入力\\n string S;\\n cin >> S;\\n Parser<Node> ps(operators, operation, get_leaf, unary_operators, unary_operation);\\n auto res = ps.eval(S, false);\\n //ps.dump();\\n\\n if (res.eps) ++res.l;\\n cout << res.n << \\\" \\\" << res.l << endl;\\n}\\n\\n\\n/* codeFloyer E */\\ntemplate<int MOD> struct Fp {\\n // inner value\\n long long val;\\n\\n // constructor\\n constexpr Fp() : val(0) { }\\n constexpr Fp(long long v) : val(v % MOD) {\\n if (val < 0) val += MOD;\\n }\\n constexpr long long get() const { return val; }\\n constexpr int get_mod() const { return MOD; }\\n\\n // arithmetic operators\\n constexpr Fp operator + () const { return Fp(*this); }\\n constexpr Fp operator - () const { return Fp(0) - Fp(*this); }\\n constexpr Fp operator + (const Fp &r) const { return Fp(*this) += r; }\\n constexpr Fp operator - (const Fp &r) const { return Fp(*this) -= r; }\\n constexpr Fp operator * (const Fp &r) const { return Fp(*this) *= r; }\\n constexpr Fp operator / (const Fp &r) const { return Fp(*this) /= r; }\\n constexpr Fp& operator += (const Fp &r) {\\n val += r.val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -= (const Fp &r) {\\n val -= r.val;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp& operator *= (const Fp &r) {\\n val = val * r.val % MOD;\\n return *this;\\n }\\n constexpr Fp& operator /= (const Fp &r) {\\n long long a = r.val, b = MOD, u = 1, v = 0;\\n while (b) {\\n long long t = a / b;\\n a -= t * b, swap(a, b);\\n u -= t * v, swap(u, v);\\n }\\n val = val * u % MOD;\\n if (val < 0) val += MOD;\\n return *this;\\n }\\n constexpr Fp pow(long long n) const {\\n Fp res(1), mul(*this);\\n while (n > 0) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr Fp inv() const {\\n Fp res(1), div(*this);\\n return res / div;\\n }\\n\\n // other operators\\n constexpr bool operator == (const Fp &r) const {\\n return this->val == r.val;\\n }\\n constexpr bool operator != (const Fp &r) const {\\n return this->val != r.val;\\n }\\n constexpr Fp& operator ++ () {\\n ++val;\\n if (val >= MOD) val -= MOD;\\n return *this;\\n }\\n constexpr Fp& operator -- () {\\n if (val == 0) val += MOD;\\n --val;\\n return *this;\\n }\\n constexpr Fp operator ++ (int) const {\\n Fp res = *this;\\n ++*this;\\n return res;\\n }\\n constexpr Fp operator -- (int) const {\\n Fp res = *this;\\n --*this;\\n return res;\\n }\\n friend constexpr istream& operator >> (istream &is, Fp<MOD> &x) {\\n is >> x.val;\\n x.val %= MOD;\\n if (x.val < 0) x.val += MOD;\\n return is;\\n }\\n friend constexpr ostream& operator << (ostream &os, const Fp<MOD> &x) {\\n return os << x.val;\\n }\\n friend constexpr Fp<MOD> pow(const Fp<MOD> &r, long long n) {\\n return r.pow(n);\\n }\\n friend constexpr Fp<MOD> inv(const Fp<MOD> &r) {\\n return r.inv();\\n }\\n};\\n\\nvoid codeFloyer_E() {\\n const int MOD = 1000000007;\\n using mint = Fp<MOD>;\\n\\n // 入力\\n string S;\\n int Q;\\n cin >> S >> Q;\\n int N = 0;\\n for (int i = 0; i < S.size(); ++i) if (S[i] == 'a') ++N;\\n vector<long long> given(N);\\n for (int i = 0; i < N; ++i) cin >> given[i];\\n\\n // set Parser\\n vector<vector<string>> operators = {{\\\"*\\\"}, {\\\"+\\\", \\\"-\\\"}};\\n auto operation = [&](const string &op, mint a, mint b) -> mint {\\n if (op == \\\"+\\\") return a + b;\\n else if (op == \\\"-\\\") return a - b;\\n else if (op == \\\"*\\\") return a * b;\\n else return 0;\\n };\\n int id = 0;\\n auto get_leaf = [&](const string &S, int &p) -> mint {\\n if (S[p] == 'a') {\\n ++p;\\n return given[id++];\\n } else return 0;\\n };\\n Parser<mint> ps(operators, operation, get_leaf);\\n mint base = ps.eval(S);\\n\\n // DP\\n vector<mint> dp(N);\\n auto rec = [&](auto self, int v, mint w) -> void {\\n if (ps.ops[v] == ps.OPERATOR_NUMBER) dp[ps.ids[v]] = w;\\n else if (ps.ops[v] == \\\"+\\\") {\\n self(self, ps.left[v], w);\\n self(self, ps.right[v], w);\\n }\\n else if (ps.ops[v] == \\\"-\\\") {\\n self(self, ps.left[v], w);\\n self(self, ps.right[v], -w);\\n }\\n else if (ps.ops[v] == \\\"*\\\") {\\n self(self, ps.left[v], w * ps.vals[ps.right[v]]);\\n self(self, ps.right[v], w * ps.vals[ps.left[v]]);\\n }\\n };\\n rec(rec, ps.root, mint(1));\\n\\n // 出力\\n for (int q = 0; q < Q; ++q) {\\n long long id, x;\\n cin >> id >> x;\\n --id;\\n mint res = base + dp[id] * (x - given[id]);\\n cout << res << endl;\\n }\\n}\\n\\n\\nint main() {\\n // small_test();\\n //AOJ_0109();\\n //AOJ_2613();\\n AOJ_2401();\\n //AOJ_1346();\\n //TTPC_2023_F();\\n //codeFloyer_E();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.8156,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2401_9291233\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = 1e9 + 10;\\nconst ll INFL = 4e18;\\n\\nconst int V = 11;\\nbool v[V];\\n\\nbool contain(bool a, bool b) {\\n if (a && !b) return false;\\n return true;\\n}\\n\\nbool parse_formula(const string &s, int &i);\\nbool parse_equation(const string &s) {\\n int i = 0;\\n bool L = parse_formula(s, i);\\n assert(s[i] == '=');\\n i++;\\n bool R = parse_formula(s, i);\\n return L == R;\\n}\\n\\nbool parse_formula(const string &s, int &i) {\\n if (s[i] == 'T') {\\n i++;\\n return true;\\n } else if (s[i] == 'F') {\\n i++;\\n return false;\\n } else if ('a' <= s[i] && s[i] <= 'k') {\\n bool ret = v[s[i] - 'a'];\\n i++;\\n return ret;\\n } else if (s[i] == '-') {\\n i++;\\n return !parse_formula(s, i);\\n } else if (s[i] == '(') {\\n i++;\\n bool ret = parse_formula(s, i);\\n if (s[i] == '+') {\\n i++;\\n ret |= parse_formula(s, i);\\n } else if (s[i] == '*') {\\n i++;\\n ret &= parse_formula(s, i);\\n } else if (s[i] == '-' && s[i + 1] == '>') {\\n i += 2;\\n bool ret2 = parse_formula(s, i);\\n ret = contain(ret, ret2);\\n } else {\\n exit(1);\\n }\\n assert(s[i] == ')');\\n i++;\\n return ret;\\n }\\n return true;\\n}\\n\\nint main() {\\n while (true) {\\n string S;\\n cin >> S;\\n\\n if (S == \\\"#\\\") break;\\n\\n bool ok = true;\\n parse_equation(S);\\n for (int i = 0; i < 1 << V; i++) {\\n for (int j = 0; j < V; j++) {\\n if (i >> j & 1)\\n v[j] = true;\\n else\\n v[j] = false;\\n }\\n ok &= parse_equation(S);\\n }\\n\\n cout << (ok ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.0132,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2401_9056235\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef string::const_iterator state;\\nint expression(state &begin);\\nint term(state &begin);\\nint term2(state &begin);\\nint factor(state &begin);\\nint number(state &begin);\\n\\nint expression(state &begin) {\\n int ret = term(begin);\\n for (;;) {\\n if (*begin == '+') {\\n begin++;\\n ret = min(1, ret + term(begin));\\n } else {\\n break;\\n }\\n }\\n return ret;\\n}\\n\\nint term(state &begin) {\\n int ret = term2(begin);\\n for (;;) {\\n if (*begin == '*') {\\n begin++;\\n ret *= term2(begin);\\n } else if (*begin == '/') {\\n begin++;\\n int b = term2(begin);\\n if (ret == 1 && b == 1) {\\n ret = 1;\\n } else if (ret == 1 && b == 0) {\\n ret = 0;\\n } else if (ret == 0 && b == 1) {\\n ret = 1;\\n } else {\\n ret = 1;\\n }\\n } else {\\n break;\\n }\\n }\\n return ret;\\n}\\n\\nint term2(state &begin) {\\n int b = 1;\\n if (*begin == '-') {\\n begin++;\\n return b ^ term2(begin);\\n } else {\\n return factor(begin);\\n }\\n}\\n\\nint factor(state &begin) {\\n if (*begin == '(') {\\n begin++;\\n int ret = expression(begin);\\n begin++;\\n return ret;\\n } else {\\n int ret = number(begin);\\n return ret;\\n }\\n}\\n\\nint number(state &begin) {\\n int ret = 0;\\n if (isdigit(*begin)) {\\n ret *= 10;\\n ret += *begin - '0';\\n begin++;\\n }\\n return ret;\\n}\\n\\nint main() {\\n while (true) {\\n string s;\\n cin >> s;\\n if (s == \\\"#\\\") {\\n break;\\n }\\n string str;\\n for (int i = 0; i < s.size(); i++) {\\n if (i < s.size() - 1 && s[i] == '-' && s[i + 1] == '>') {\\n str.push_back('/');\\n i++;\\n } else {\\n if (s[i] == 'T') {\\n str.push_back('1');\\n } else if (s[i] == 'F') {\\n str.push_back('0');\\n } else {\\n str.push_back(s[i]);\\n }\\n }\\n }\\n bool flg = true;\\n for (int i = 0; i < (1 << 11); i++) {\\n bool b[12] = {};\\n for (int j = 0; j < 11; j++) {\\n if (i & (1 << j)) {\\n b[j] = 1;\\n }\\n }\\n string bufstr;\\n for (int j = 0; j < str.size(); j++) {\\n if ('a' <= str[j] && str[j] <= 'k') {\\n int num = str[j] - 'a';\\n bufstr.push_back(b[num] + '0');\\n } else {\\n bufstr.push_back(str[j]);\\n }\\n }\\n string str1, str2;\\n bool flag = false;\\n for (int j = 0; j < bufstr.size(); j++) {\\n if (bufstr[j] == '=') {\\n flag = true;\\n } else if (!flag) {\\n str1.push_back(bufstr[j]);\\n } else {\\n str2.push_back(bufstr[j]);\\n }\\n }\\n state begin = str1.begin();\\n state begin2 = str2.begin();\\n int ans1 = expression(begin);\\n int ans2 = expression(begin2);\\n if (ans1 != ans2) {\\n flg = false;\\n }\\n }\\n if (flg) {\\n cout << \\\"YES\\\" << endl;\\n } else {\\n cout << \\\"NO\\\" << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.0702,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2401_8862245\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cctype>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nint mask;\\nstruct Parser {\\n typedef string::const_iterator State;\\n bool solve(const string &S) {\\n State begin = S.begin();\\n return equation(begin);\\n }\\n bool equation(State &begin) {\\n bool left = formula(begin);\\n begin++;\\n bool right = formula(begin);\\n return left == right;\\n }\\n bool formula(State &begin) {\\n if (*begin == '(') {\\n begin++;\\n bool left = formula(begin);\\n char op = *begin;\\n begin++;\\n if (op == '-')\\n begin++;\\n bool right = formula(begin);\\n begin++;\\n bool ret = deduce(left, op, right);\\n return ret;\\n } else if (*begin == '-') {\\n begin++;\\n return !formula(begin);\\n } else {\\n return boolean(begin);\\n }\\n }\\n bool deduce(bool x, char op, bool y) {\\n if (op == '*') {\\n return x & y;\\n } else if (op == '+') {\\n return x | y;\\n } else {\\n return !x | y;\\n }\\n }\\n bool boolean(State &begin) {\\n bool ret;\\n if (*begin == 'T')\\n ret = 1;\\n else if (*begin == 'F')\\n ret = 0;\\n else\\n ret = (mask >> (*begin - 'a')) & 1;\\n begin++;\\n return ret;\\n }\\n};\\nvoid solve(string S) {\\n Parser ps;\\n for (mask = 0; mask < (1 << 11); mask++) {\\n if (!ps.solve(S)) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n }\\n cout << \\\"YES\\\" << endl;\\n}\\nint main() {\\n string S;\\n while (cin >> S && S != \\\"#\\\") {\\n solve(S);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.0528,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2401_8862244\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cctype>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nint mask;\\ntemplate <class T> struct Parser {\\n typedef string::const_iterator State;\\n T solve(const string &S) {\\n State begin = S.begin();\\n return equation(begin);\\n }\\n T equation(State &begin) {\\n T left = formula(begin);\\n ++begin;\\n T right = formula(begin);\\n return left == right;\\n }\\n T formula(State &begin) {\\n if (*begin == '(') {\\n ++begin;\\n T left = formula(begin);\\n char op = *begin;\\n ++begin;\\n if (op == '-')\\n ++begin;\\n T right = formula(begin);\\n ++begin;\\n T ret = deduce(left, op, right);\\n return ret;\\n } else if (*begin == '-') {\\n ++begin;\\n return !formula(begin);\\n } else {\\n return boolean(begin);\\n }\\n }\\n T deduce(T x, char op, T y) {\\n if (op == '*') {\\n return x and y;\\n } else if (op == '+') {\\n return x or y;\\n } else {\\n return !x or y;\\n }\\n }\\n T boolean(State &begin) {\\n T ret;\\n if (*begin == 'T')\\n ret = 1;\\n else if (*begin == 'F')\\n ret = 0;\\n else\\n ret = (mask >> (*begin - 'a')) & 1;\\n ++begin;\\n return ret;\\n }\\n};\\nvoid solve(string S) {\\n Parser<bool> ps;\\n for (mask = 0; mask < (1 << 11); mask++) {\\n if (!ps.solve(S)) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n }\\n cout << \\\"YES\\\" << endl;\\n}\\nint main() {\\n string S;\\n while (cin >> S && S != \\\"#\\\") {\\n solve(S);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.1085,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2401_8862242\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cctype>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\nint mask;\\ntemplate <class T> struct Parser {\\n typedef string::const_iterator State;\\n T solve(const string &S) {\\n State begin = S.begin();\\n return equation(begin);\\n }\\n T equation(State &begin) {\\n T left = formula(begin);\\n begin++;\\n T right = formula(begin);\\n return left == right;\\n }\\n T formula(State &begin) {\\n if (*begin == '(') {\\n begin++;\\n T left = formula(begin);\\n char op = *begin;\\n begin++;\\n if (op == '-')\\n begin++;\\n T right = formula(begin);\\n begin++;\\n return deduce(left, op, right);\\n } else if (*begin == '-') {\\n begin++;\\n T ret = !formula(begin);\\n return ret;\\n } else {\\n return boolean(begin);\\n }\\n }\\n T deduce(T x, char op, T y) {\\n if (op == '*') {\\n return x and y;\\n } else if (op == '+') {\\n return x or y;\\n } else {\\n return !x or y;\\n }\\n }\\n T boolean(State &begin) {\\n T ret;\\n if (*begin == 'T')\\n ret = 1;\\n else if (*begin == 'F')\\n ret = 0;\\n else\\n ret = (mask >> (*begin - 'a')) & 1;\\n begin++;\\n return ret;\\n }\\n};\\n\\nvoid solve(string S) {\\n Parser<bool> ps;\\n #pragma omp parallel for\\n for (mask = 0; mask < (1 << 11); mask++) {\\n if (!ps.solve(S)) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n }\\n cout << \\\"YES\\\" << endl;\\n}\\n\\nint main() {\\n string S;\\n while (cin >> S && S != \\\"#\\\") {\\n solve(S);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.1114,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1369,"cells":{"group_id":{"kind":"string","value":"aoj_2402_cpp"},"problem_description":{"kind":"string","value":"Milky Way\n天の川\nEnglish text is not available in this practice contest.\n天の川交通公社は星間旅行ツアーの企画・運営を行う旅行会社である。\n天の川交通公社では「天の川横断織姫彦星体験ツアー」という企画を計画中である。\nこのツアーは琴座のベガを出発し、\n星々を巡って鷲座のアルタイルに向かうというものである。\nあなたは天の川交通公社に社員であり、\nツアーの経路の選択を任されている。\n簡単のため天の川は2次元座標上にあるものとし、\n星は五芒星で表現されるものとする。\nツアーに使用する宇宙船には特殊なエンジンが搭載されており、\n五芒星の線分上はエネルギー無しで移動することができる。\n一方、五芒星の間を移動する際には、その距離に比例したエネルギーが必要となる。\n近年、天の川交通公社の売上は低迷しており、\n宇宙船のエネルギー代を始めとした各種必要経費の節約を迫られている。\nあなたの仕事は、ベガからアルタイルに移動する際、\n星間移動距離の総和が最小になるような経路を求め、\nその総和を出力するプログラムを書くことである。\nある五芒星からその内部に含まれる別の五芒星に移動する場合、\n五芒星同士が接していない場合は星間の移動として扱われることに注意せよ。\n図D-1は3つ目のSample Inputを図示したものである。\n図中、赤色の線分は星間移動距離の総和が最小になるような経路の、\n星間移動の部分を表している。\n図 D-1: 星間の移動\nInput\n入力は1つ以上のデータセットからなる。1つのデータセットは次の形式をしている。\nN\nM\nL\nx\n1\ny\n1\na\n1\nr\n1\nx\n2\ny\n2\na\n2\nr\n2\n...\nx\nN\ny\nN\na\nN\nr\nN\n各テストケースの初めの1行は整数N、M、Lからなり、\nNは星の数(1 ≤ N ≤ 100)、\nMはベガの番号(1 ≤ M ≤ N)、\nLはアルタイルの番号(1 ≤ L ≤ N)を表す。\n続くN行には各星の情報が与えられる。\n各行はx\ni\n、y\ni\n、a\ni\n、r\ni\nの4つの整数からなり、\nx\ni\nはi番目の星の中心のx座標(0 ≤ x\ni\n≤ 1,000)、\ny\ni\nはi番目の星の中心のy座標(0 ≤ y\ni\n≤ 1,000)、\na\ni\nはi番目の星の中心座標と星の先端を結んだ直線がy軸となす角度(0 ≤ a\ni\n< 72)、\nr\ni\nはi番目の星の中心座標から星の先端までの長さ(1 ≤ r\ni\n≤ 1,000)である。\n入力の終わりは3つのゼロを含む行で表される。\n図 D-2の左の星はx=5, y=10, a=0, r=5の星を表しており、右の星はx=15, y=10, a=30, r=5の星を表している。\n図 D-2: 星の例\nOutput\n各入力ごとに、ベガからアルタイルに移動する際に必要な星間移動距離の総和の最小値を1行に出力せよ。\n出力には、0.000001を超える誤差があってはならない。\nSample Input\n1 1 1\n5 5 0 5\n2 1 2\n5 5 0 5\n15 5 0 5\n3 2 3\n15 15 0 5\n5 5 10 5\n25 25 20 5\n0 0 0\nOutput for Sample Input\n0.00000000000000000000\n0.48943483704846357796\n9.79033725601359705593"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2402_10668015","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// 型関連\nusing ll = long long;\nusing lint = long long;\nusing pll = pair<ll, ll>;\nusing plll = tuple<ll, ll, ll>;\nusing pii = pair<int, int>;\nusing piii = tuple<ll, ll, ll>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vvvvi = vector<vector<vector<vector<int>>>>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\n\ntemplate <class T> using prique = priority_queue<T>;\n\n// 型定数\nconstexpr ll mod = 998244353;\nconstexpr ll MOD = 1000000007;\nint INF32 = 2e9;\nll INF64 = 9e18;\n#define endl '\\n';\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n/////////////////////////// print関連\ntemplate <typename T> void print(vector<T> A);\nvoid print();\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\nvoid print(string S);\ntemplate <typename T> void print(vector<vector<T>> &F);\n\ninline void Yes(bool f);\n\n#define equals(a, b) (fabs((a) - (b)) < EPS)\n\nconst double EPS = 1e-10;\nconst double PI = asinl(1) * 2;\n\nstruct Point {\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(double k) { return Point(x * k, y * k); }\n Point operator/(double k) { return Point(x / k, y / k); }\n double norm() { return x * x + y * y; }\n double abs() { return sqrt(norm()); }\n\n bool operator<(const Point &p) const {\n return x != p.x ? x < p.x : y < p.y;\n // grid-point only\n // return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\n }\n\n bool operator==(const Point &p) const {\n return fabs(x - p.x) < EPS and fabs(y - p.y) < EPS;\n }\n};\n\nbool sort_x(Point a, Point b) { return a.x != b.x ? a.x < b.x : a.y < b.y; }\n\nbool sort_y(Point a, Point b) { return a.y != b.y ? a.y < b.y : a.x < b.x; }\n\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\nstruct Segment {\n Point p1, p2;\n Segment() {}\n Segment(Point p1, Point p2) : p1(p1), p2(p2) {}\n};\ntypedef Segment Line;\n\nstruct Circle {\n Point c;\n double r;\n Circle() {}\n Circle(Point c, double r) : c(c), r(r) {}\n};\n\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\n\ndouble abs(Vector a) { return sqrt(norm(a)); }\n\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\n\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\n\nPoint orth(Point p) { return Point(-p.y, p.x); }\n\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\n\nbool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {\n return isOrthogonal(a1 - a2, b1 - b2);\n}\n\nbool isOrthogonal(Segment s1, Segment s2) {\n return equals(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\n\nbool isParallel(Point a1, Point a2, Point b1, Point b2) {\n return isParallel(a1 - a2, b1 - b2);\n}\n\nbool isParallel(Segment s1, Segment s2) {\n return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\n}\n\nPoint project(Segment s, Point p) {\n Vector base = s.p2 - s.p1;\n double r = dot(p - s.p1, base) / norm(base);\n return s.p1 + base * r;\n}\n\nPoint reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }\n\ndouble arg(Vector p) { return atan2(p.y, p.x); }\n\nVector polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }\n\n// COUNTER CLOCKWISE\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\nstatic const int CCW_CLOCKWISE = -1;\nstatic const int CCW_ONLINE_BACK = 2;\nstatic const int CCW_ONLINE_FRONT = -2;\nstatic const int CCW_ON_SEGMENT = 0;\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)\n return CCW_COUNTER_CLOCKWISE;\n if (cross(a, b) < -EPS)\n return CCW_CLOCKWISE;\n if (dot(a, b) < -EPS)\n return CCW_ONLINE_BACK;\n if (a.norm() < b.norm())\n return CCW_ONLINE_FRONT;\n return CCW_ON_SEGMENT;\n}\n\nbool intersectSS(Point p1, Point p2, Point p3, Point p4) {\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 and\n ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\n}\n\nbool intersectSS(Segment s1, Segment s2) {\n return intersectSS(s1.p1, s1.p2, s2.p1, s2.p2);\n}\n\nbool intersectPS(Polygon p, Segment l) {\n int n = p.size();\n for (int i = 0; i < n; ++i)\n if (intersectSS(Segment(p[i], p[(i + 1) % n]), l))\n return 1;\n return 0;\n}\n\ndouble getDistanceLP(Line l, Point p) {\n return fabs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\n}\n\ndouble getDistanceSP(Segment s, Point p) {\n if (dot(s.p2 - s.p1, p - s.p1) < 0.0)\n return abs(p - s.p1);\n if (dot(s.p1 - s.p2, p - s.p2) < 0.0)\n return abs(p - s.p2);\n return getDistanceLP(s, p);\n}\n\ndouble getDistanceSS(Segment s1, Segment s2) {\n if (intersectSS(s1, s2))\n return 0.0;\n return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),\n min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));\n}\n\n// intercsect of circles\nstatic const int ICC_SEPERATE = 4;\nstatic const int ICC_CIRCUMSCRIBE = 3;\nstatic const int ICC_INTERSECT = 2;\nstatic const int ICC_INSCRIBE = 1;\nstatic const int ICC_CONTAIN = 0;\n\nint intersectCC(Circle c1, Circle c2) {\n if (c1.r < c2.r)\n swap(c1, c2);\n double d = abs(c1.c - c2.c);\n double r = c1.r + c2.r;\n if (equals(d, r))\n return ICC_CIRCUMSCRIBE;\n if (d > r)\n return ICC_SEPERATE;\n if (equals(d + c2.r, c1.r))\n return ICC_INSCRIBE;\n if (d + c2.r < c1.r)\n return ICC_CONTAIN;\n return ICC_INTERSECT;\n}\n\nbool intersectSC(Segment s, Circle c) { return getDistanceSP(s, c.c) <= c.r; }\n\nint intersectCS(Circle c, Segment s) {\n if (norm(project(s, c.c) - c.c) - c.r * c.r > EPS)\n return 0;\n double d1 = abs(c.c - s.p1), d2 = abs(c.c - s.p2);\n if (d1 < c.r + EPS and d2 < c.r + EPS)\n return 0;\n if ((d1 < c.r - EPS and d2 > c.r + EPS) or\n (d1 > c.r + EPS and d2 < c.r - EPS))\n return 1;\n Point h = project(s, c.c);\n if (dot(s.p1 - h, s.p2 - h) < 0)\n return 2;\n return 0;\n}\n\nPoint getCrossPointSS(Segment s1, Segment s2) {\n for (int k = 0; k < 2; ++k) {\n if (getDistanceSP(s1, s2.p1) < EPS)\n return s2.p1;\n if (getDistanceSP(s1, s2.p2) < EPS)\n return s2.p2;\n swap(s1, s2);\n }\n Vector base = s2.p2 - s2.p1;\n double d1 = fabs(cross(base, s1.p1 - s2.p1));\n double d2 = fabs(cross(base, s1.p2 - s2.p1));\n double t = d1 / (d1 + d2);\n return s1.p1 + (s1.p2 - s1.p1) * t;\n}\n\nPoint getCrossPointLL(Line l1, Line l2) {\n double a = cross(l1.p2 - l1.p1, l2.p2 - l2.p1);\n double b = cross(l1.p2 - l1.p1, l1.p2 - l2.p1);\n if (fabs(a) < EPS and fabs(b) < EPS)\n return l2.p1;\n return l2.p1 + (l2.p2 - l2.p1) * (b / a);\n}\n\nPolygon getCrossPointCL(Circle c, Line l) {\n Polygon ps;\n Point pr = project(l, c.c);\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\n if (equals(getDistanceLP(l, c.c), c.r)) {\n ps.emplace_back(pr);\n return ps;\n }\n double base = sqrt(c.r * c.r - norm(pr - c.c));\n ps.emplace_back(pr + e * base);\n ps.emplace_back(pr - e * base);\n return ps;\n}\n\nPolygon getCrossPointCS(Circle c, Segment s) {\n Line l(s);\n Polygon res = getCrossPointCL(c, l);\n if (intersectCS(c, s) == 2)\n return res;\n if (res.size() > 1u) {\n if (dot(l.p1 - res[0], l.p2 - res[0]) > 0)\n swap(res[0], res[1]);\n res.pop_back();\n }\n return res;\n}\n\nPolygon getCrossPointCC(Circle c1, Circle c2) {\n Polygon p(2);\n double d = abs(c1.c - c2.c);\n double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n double t = arg(c2.c - c1.c);\n p[0] = c1.c + polar(c1.r, t + a);\n p[1] = c1.c + polar(c1.r, t - a);\n return p;\n}\n\n// IN:2 ON:1 OUT:0\nint contains(Polygon g, Point p) {\n int n = g.size();\n bool x = false;\n for (int i = 0; i < n; ++i) {\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\n if (fabs(cross(a, b)) < EPS and dot(a, b) < EPS)\n return 1;\n if (a.y > b.y)\n swap(a, b);\n if (a.y < EPS and EPS < b.y and cross(a, b) > EPS)\n x = !x;\n }\n return (x ? 2 : 0);\n}\n\n// BEGIN IGNORE\nPolygon andrewScan(Polygon s) {\n Polygon u, l;\n if (s.size() < 3)\n return s;\n sort(s.begin(), s.end());\n u.push_back(s[0]);\n u.push_back(s[1]);\n l.push_back(s[s.size() - 1]);\n l.push_back(s[s.size() - 2]);\n for (int i = 2; i < (int)s.size(); ++i) {\n for (int n = u.size();\n n >= 2 and ccw(u[n - 2], u[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\n u.pop_back();\n }\n u.push_back(s[i]);\n }\n for (int i = s.size() - 3; i >= 0; i--) {\n for (int n = l.size();\n n >= 2 and ccw(l[n - 2], l[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\n l.pop_back();\n }\n l.push_back(s[i]);\n }\n reverse(l.begin(), l.end());\n for (int i = u.size() - 2; i >= 1; i--)\n l.push_back(u[i]);\n return l;\n}\n// END IGNORE\n\nPolygon convex_hull(Polygon ps) {\n int n = ps.size();\n sort(ps.begin(), ps.end(), sort_y);\n int k = 0;\n Polygon qs(n * 2);\n for (int i = 0; i < n; ++i) {\n while (k > 1 and cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0)\n k--;\n qs[k++] = ps[i];\n }\n for (int i = n - 2, t = k; i >= 0; i--) {\n while (k > t and cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0)\n k--;\n qs[k++] = ps[i];\n }\n qs.resize(k - 1);\n return qs;\n}\n\ndouble diameter(Polygon s) {\n Polygon p = s;\n int n = p.size();\n if (n == 2)\n return abs(p[0] - p[1]);\n int i = 0, j = 0;\n for (int k = 0; k < n; ++k) {\n if (p[i] < p[k])\n i = k;\n if (!(p[j] < p[k]))\n j = k;\n }\n double res = 0;\n int si = i, sj = j;\n while (i != sj or j != si) {\n res = max(res, abs(p[i] - p[j]));\n if (cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) < 0.0) {\n i = (i + 1) % n;\n } else {\n j = (j + 1) % n;\n }\n }\n return res;\n}\n\nbool isConvex(Polygon p) {\n bool f = 1;\n int n = p.size();\n for (int i = 0; i < n; ++i) {\n int t = ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]);\n f &= t != CCW_CLOCKWISE;\n }\n return f;\n}\n\ndouble area(Polygon s) {\n double res = 0;\n for (int i = 0; i < (int)s.size(); ++i) {\n res += cross(s[i], s[(i + 1) % s.size()]) / 2.0;\n }\n return res;\n}\n\ndouble area(Circle c1, Circle c2) {\n double d = abs(c1.c - c2.c);\n if (c1.r + c2.r <= d + EPS)\n return 0;\n if (d <= fabs(c1.r - c2.r)) {\n double r = min(c1.r, c2.r);\n return PI * r * r;\n }\n double res = 0;\n for (int k = 0; k < 2; ++k) {\n double rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d * c1.r);\n double th = acosl(rc) * 2;\n res += (th - sinl(th)) * c1.r * c1.r / 2;\n swap(c1, c2);\n }\n return res;\n}\n\nPolygon convexCut(Polygon p, Line l) {\n Polygon q;\n for (int i = 0; i < (int)p.size(); ++i) {\n Point a = p[i], b = p[(i + 1) % p.size()];\n if (ccw(l.p1, l.p2, a) != -1)\n q.push_back(a);\n if (ccw(l.p1, l.p2, a) * ccw(l.p1, l.p2, b) < 0)\n q.push_back(getCrossPointLL(Line(a, b), l));\n }\n return q;\n}\n\nLine bisector(Point p1, Point p2) {\n Circle c1 = Circle(p1, abs(p1 - p2)), c2 = Circle(p2, abs(p1 - p2));\n Polygon p = getCrossPointCC(c1, c2);\n if (cross(p2 - p1, p[0] - p1) > 0)\n swap(p[0], p[1]);\n return Line(p[0], p[1]);\n}\n\nVector translate(Vector v, double theta) {\n Vector res;\n res.x = cos(theta) * v.x - sin(theta) * v.y;\n res.y = sin(theta) * v.x + cos(theta) * v.y;\n return res;\n}\n\nvector<Line> corner(Line l1, Line l2) {\n vector<Line> res;\n if (isParallel(l1, l2)) {\n double d = getDistanceLP(l1, l2.p1) / 2.0;\n Vector v1 = l1.p2 - l1.p1;\n v1 = v1 / v1.abs() * d;\n Point p = l2.p1 + translate(v1, 90.0 * (PI / 180.0));\n double d1 = getDistanceLP(l1, p);\n double d2 = getDistanceLP(l2, p);\n if (fabs(d1 - d2) > d) {\n p = l2.p1 + translate(v1, -90.0 * (PI / 180.0));\n }\n res.push_back(Line(p, p + v1));\n } else {\n Point p = getCrossPointLL(l1, l2);\n Vector v1 = l1.p2 - l1.p1, v2 = l2.p2 - l2.p1;\n v1 = v1 / v1.abs();\n v2 = v2 / v2.abs();\n res.push_back(Line(p, p + (v1 + v2)));\n res.push_back(Line(p, p + translate(v1 + v2, 90.0 * (PI / 180.0))));\n }\n return res;\n}\n\nPolygon tangent(Circle c1, Point p2) {\n Circle c2 = Circle(p2, sqrt(norm(c1.c - p2) - c1.r * c1.r));\n Polygon p = getCrossPointCC(c1, c2);\n sort(p.begin(), p.end());\n return p;\n}\n\nvector<Line> tangent(Circle c1, Circle c2) {\n vector<Line> ls;\n if (c1.r < c2.r)\n swap(c1, c2);\n double g = norm(c1.c - c2.c);\n if (equals(g, 0))\n return ls;\n Point u = (c2.c - c1.c) / sqrt(g);\n Point v = orth(u);\n for (int s = 1; s >= -1; s -= 2) {\n double h = (c1.r + s * c2.r) / sqrt(g);\n if (equals(1 - h * h, 0)) {\n ls.emplace_back(c1.c + u * c1.r, c1.c + (u + v) * c1.r);\n } else if (1 - h * h > 0) {\n Point uu = u * h, vv = v * sqrt(1 - h * h);\n ls.emplace_back(c1.c + (uu + vv) * c1.r,\n c2.c - (uu + vv) * c2.r * s);\n ls.emplace_back(c1.c + (uu - vv) * c1.r,\n c2.c - (uu - vv) * c2.r * s);\n }\n }\n\n return ls;\n}\n\ndouble closest_pair(Polygon &a, int l = 0, int r = -1) {\n if (r < 0) {\n r = a.size();\n sort(a.begin(), a.end(), sort_x);\n }\n if (r - l <= 1)\n return abs(a[0] - a[1]);\n int m = (l + r) >> 1;\n double x = a[m].x;\n double d = min(closest_pair(a, l, m), closest_pair(a, m, r));\n inplace_merge(a.begin() + l, a.begin() + m, a.begin() + r, sort_y);\n\n Polygon b;\n for (int i = l; i < r; ++i) {\n if (fabs(a[i].x - x) >= d)\n continue;\n for (int j = 0; j < (int)b.size(); ++j) {\n double dy = a[i].y - next(b.rbegin(), j)->y;\n if (dy >= d)\n break;\n d = min(d, abs(a[i] - *next(b.rbegin(), j)));\n }\n b.emplace_back(a[i]);\n }\n return d;\n}\n\nvector<vector<int>> segmentArrangement(vector<Segment> &ss, Polygon &ps) {\n int n = ss.size();\n for (int i = 0; i < n; ++i) {\n ps.emplace_back(ss[i].p1);\n ps.emplace_back(ss[i].p2);\n for (int j = i + 1; j < n; ++j)\n if (intersectSS(ss[i], ss[j]))\n ps.emplace_back(getCrossPointSS(ss[i], ss[j]));\n }\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n\n vector<vector<int>> G(ps.size());\n for (int i = 0; i < n; ++i) {\n vector<pair<double, int>> ls;\n for (int j = 0; j < (int)ps.size(); ++j)\n if (getDistanceSP(ss[i], ps[j]) < EPS)\n ls.emplace_back(make_pair(norm(ss[i].p1 - ps[j]), j));\n\n sort(ls.begin(), ls.end());\n for (int j = 0; j + 1 < (int)ls.size(); ++j) {\n int a = ls[j].second, b = ls[j + 1].second;\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n }\n for (auto &v : G) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n }\n return G;\n}\n\nstruct EndPoint {\n Point p;\n int seg, st;\n EndPoint() {}\n EndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\n bool operator<(const EndPoint &ep) const {\n if (p.y == ep.p.y)\n return st < ep.st;\n return p.y < ep.p.y;\n }\n};\n\nint manhattan_intersection(vector<Segment> ss, const int INF) {\n const int BTM = 0;\n const int LFT = 1;\n const int RGH = 2;\n const int TOP = 3;\n\n int n = ss.size();\n vector<EndPoint> ep;\n for (int i = 0; i < n; ++i) {\n if (ss[i].p1.y == ss[i].p2.y) {\n if (ss[i].p1.x > ss[i].p2.x)\n swap(ss[i].p1, ss[i].p2);\n ep.emplace_back(ss[i].p1, i, LFT);\n ep.emplace_back(ss[i].p2, i, RGH);\n } else {\n if (ss[i].p1.y > ss[i].p2.y)\n swap(ss[i].p1, ss[i].p2);\n ep.emplace_back(ss[i].p1, i, BTM);\n ep.emplace_back(ss[i].p2, i, TOP);\n }\n }\n sort(ep.begin(), ep.end());\n\n set<int> bt;\n bt.insert(INF);\n\n int cnt = 0;\n for (int i = 0; i < n * 2; ++i) {\n if (ep[i].st == TOP) {\n bt.erase(ep[i].p.x);\n } else if (ep[i].st == BTM) {\n bt.emplace(ep[i].p.x);\n } else if (ep[i].st == LFT) {\n auto b = bt.lower_bound(ss[ep[i].seg].p1.x);\n auto e = bt.upper_bound(ss[ep[i].seg].p2.x);\n cnt += distance(b, e);\n }\n }\n\n return cnt;\n}\n\ndouble area(Polygon ps, Circle c) {\n if (ps.size() < 3u)\n return 0;\n function<double(Circle, Point, Point)> dfs = [&](Circle c, Point a,\n Point b) {\n Vector va = c.c - a, vb = c.c - b;\n double f = cross(va, vb), res = 0;\n if (equals(f, 0.0))\n return res;\n if (max(abs(va), abs(vb)) < c.r + EPS)\n return f;\n Vector d(dot(va, vb), cross(va, vb));\n if (getDistanceSP(Segment(a, b), c.c) > c.r - EPS)\n return c.r * c.r * atan2(d.y, d.x);\n auto u = getCrossPointCS(c, Segment(a, b));\n if (u.empty())\n return res;\n if (u.size() > 1u and dot(u[1] - u[0], a - u[0]) > 0)\n swap(u[0], u[1]);\n u.emplace(u.begin(), a);\n u.emplace_back(b);\n for (int i = 1; i < (int)u.size(); ++i)\n res += dfs(c, u[i - 1], u[i]);\n return res;\n };\n double res = 0;\n for (int i = 0; i < (int)ps.size(); ++i)\n res += dfs(c, ps[i], ps[(i + 1) % ps.size()]);\n return res / 2;\n}\n\ndouble dis(Point a, Point b) {\n return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\n}\n\n///////////////////ここから//////////////////////\nbool solve() {\n int N, M, L;\n cin >> N >> M >> L;\n if (N == 0) {\n return false;\n }\n M--;\n L--;\n vector<vector<Point>> vvP(N);\n for (int i = 0; i < N; i++) {\n double x, y, a, r;\n cin >> x >> y >> a >> r;\n for (int j = 0; j < 5; j++) {\n double theta = -a * M_PI / 180 - 2 * M_PI * j / 5;\n double xj = x + r * sin(theta), yj = y + r * cos(theta);\n vvP[i].emplace_back(xj, yj);\n }\n }\n vector<vector<double>> E(N, vector<double>(N, INF32));\n for (int i = 0; i < N; i++) {\n for (int j = i; j < N; j++) {\n for (int k = 0; k < 5; k++) {\n for (int l = 0; l < 5; l++) {\n \n \n Segment S1(vvP[i][k], vvP[i][(k + 2) % 5]);\n Segment S2(vvP[j][l], vvP[j][(l + 2) % 5]);\n if (intersectSS(S1, S2)) {\n E[i][j] = 0;\n E[j][i] = 0;\n }\n\n\n double d = min(getDistanceSP(S1, vvP[j][l]),getDistanceSP(S2, vvP[i][k]));\n \n E[i][j] = min(E[i][j], d);\n E[j][i] = min(E[j][i], d);\n }\n }\n }\n }\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (E[i][j] > E[i][k] + E[k][j]) {\n E[i][j] = E[i][k] + E[k][j];\n }\n }\n }\n }\n cout << fixed << setprecision(10);\n cout << E[M][L] << endl;\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n while (solve())\n ;\n}\n\n////////////////////print/////////////////////////\n// 1次元ベクトルを出力する\ntemplate <typename T> void print(vector<T> A) {\n if (A.size() == 0) {\n return;\n }\n for (size_t i = 0; i < A.size() - 1; i++) {\n cout << A[i] << ' ';\n }\n cout << A[A.size() - 1] << endl;\n return;\n}\n\n// 2次元ベクトルを出力する\ntemplate <typename T> void print(vector<vector<T>> &F) {\n for (size_t i = 0; i < F.size(); i++) {\n for (size_t j = 0; j < F[i].size(); j++) {\n cout << F[i][j];\n if (j < F[i].size() - 1) {\n cout << ' ';\n }\n }\n cout << endl;\n }\n}\n\n// 空白行を出力するprint\nvoid print() { cout << endl; }\n\n// 数値・文字列を空白区切りで出力する. print(a,b)など\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid print(string S) { cout << S << endl; }\n\n//////////////出力関連\n\ninline void Yes(bool f) {\n if (f) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":4224,"score_of_the_acc":-0.0224,"final_rank":2},{"submission_id":"aoj_2402_10649930","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// 書きかけの幾何ライブラリ\n// バグがあるかも\n\nnamespace geometry {\n\nusing Real = long double;\nconstexpr Real eps = 1e-12;\nconstexpr Real PI = acosl(-1);\nconstexpr Real INF_REAL = numeric_limits<Real>::max();\n\nbool equal_eps(Real a, Real b) {\n return abs(a - b) < eps;\n}\n\nint sgn(Real a) {\n return equal_eps(a, 0) ? 0 : a > 0 ? 1 : -1;\n}\n\nstruct Point {\n Real x, y;\n constexpr Point() : Point(0, 0) {}\n constexpr Point(Real _x, Real _y) : x(_x), y(_y) {}\n constexpr Point(const pair<Real, Real> &p) : x(p.first), y(p.second) {}\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*=(const Real &r) {\n x *= r;\n y *= r;\n return *this;\n }\n Point &operator/=(const Real &r) {\n assert(!equal_eps(r, 0));\n x /= r;\n y /= r;\n return *this;\n }\n Point operator+(const Point &p) const { return Point(*this) += p; }\n Point operator-(const Point &p) const { return Point(*this) -= p; }\n Point operator*(const Real &r) const { return Point(*this) *= r; }\n Point operator/(const Real &r) const { return Point(*this) /= r; }\n Point operator-() const { return Point() - *this; }\n bool operator==(const Point &p) const {\n return equal_eps(x, p.x) && equal_eps(y, p.y);\n }\n bool operator!=(const Point &p) const {\n return !equal_eps(x, p.x) || !equal_eps(y, p.y);\n }\n Point rotate(Real rad) const {\n Real c = cosl(rad), s = sinl(rad);\n Real tx = x * c - y * s;\n Real ty = x * s + y * c;\n return Point(tx, ty);\n }\n Point unit() const {\n return (*this) / metric();\n }\n Real Re() const { return x; }\n Real Im() const { return y; }\n Real norm() const { return x * x + y * y; }\n Real metric() const { return sqrtl(norm()); }\n Real arg() const { return atan2l(y, x); }\n Real arg(Point q1, Point q2) const {\n q1 -= *this, q2 -= *this;\n return abs(q1.arg() - q2.arg());\n }\n friend Point operator*(Real r, const Point &p) {\n return p * r;\n }\n friend Point operator/(Real r, const Point &p) {\n return p / r;\n }\n};\n\nReal Re(const Point &p) { return p.Re(); }\nReal Im(const Point &p) { return p.Im(); }\nReal dot(const Point &p, const Point &q) {\n return p.x * q.x + p.y * q.y;\n}\nReal cross(const Point &p, const Point &q) {\n return p.x * q.y - p.y * q.x;\n}\nReal norm(const Point &p) {\n return p.norm();\n}\nReal metric(const Point &p) {\n return p.metric();\n}\nReal metric(const Point &p, const Point &q) {\n return metric(p - q);\n}\nReal arg(const Point &p) {\n return p.arg();\n}\n\nbool equal_point(const Point &p, const Point &q) {\n return equal_eps(p.x, q.x) && equal_eps(p.y, q.y);\n}\n\nconstexpr Point INF_POINT = Point(INF_REAL, INF_REAL);\n\n// a を基準にした b と c の位置関係\nint ccw(const Point &a, const Point &b, const Point &c) {\n Point p = b - a, q = c - a;\n if (cross(p, q) > eps) return 1; // a, b, c の順で反時計回り\n if (cross(p, q) < -eps) return -1; // a, b, c の順で時計回り\n if (min(norm(p), norm(q)) < eps * eps) return 0; // a = c or b = c\n if (dot(p, q) < eps) return 2; // c, a, b の順で一直線\n if (norm(p) < norm(q)) return -2; // a, b, c の順で一直線\n return 0; // a, c, b の順で一直線\n}\n\nistream &operator>>(istream &is, Point& p) {\n Real x, y;\n is >> x >> y;\n p = Point(x, y);\n return is;\n}\n\n} // namespace geometry\n\nnamespace geometry {\n\nstruct Line {\n // Line : ax + by = c\n Real a, b, c;\n constexpr Line() = default;\n constexpr Line(Real _a, Real _b, Real _c) : a(_a), b(_b), c(_c) {}\n constexpr Line(const Point &p, const Point &q) : a(q.y - p.y), b(p.x - q.x), c(p.x * q.y - p.y * q.x) {}\n constexpr Line(Real _a, const Point &p) : a(_a), b(-1), c(_a * p.x - p.y) {}\n bool online(const Point &p) const {\n return equal_eps(a * p.x + b * p.y, c);\n }\n Real get_x(Real y) const {\n if (equal_eps(a, 0)) return INF_REAL;\n return (c - b * y) / a;\n }\n Real get_y(Real x) const {\n if (equal_eps(b, 0)) return INF_REAL;\n return (c - a * x) / b;\n }\n Line perpendicular(const Point &p) const {\n if (equal_eps(a, 0)) return Line(1, 0, p.x);\n if (equal_eps(0, b)) return Line(0, 1, p.y);\n return Line(b / a, p);\n }\n Point crossppoint(const Line &l) const {\n if (equal_eps(a * l.b, l.a * b)) return INF_POINT;\n Real d = a * l.b - l.a * b;\n return Point(l.b * c - b * l.c, l.c * a - c * l.a) / d;\n }\n Point projection(const Point &p) const {\n return crossppoint(perpendicular(p));\n }\n Point reflection(const Point &p) const {\n Point q = projection(p);\n return 2 * q - p;\n }\n Point unit() const {\n if (equal_eps(b, 0)) {\n return Point(0, 1);\n }\n Point p(0, get_y(0)), q(1, get_y(1));\n return (p - q) / metric(p - q);\n }\n bool is_orthogonal(const Line &l) const {\n return equal_eps(a * l.a + b * l.b, 0);\n }\n bool is_parallel(const Line &l) const {\n return equal_eps(a * l.b, l.a * b);\n }\n Real dist(const Point &p) const {\n Point q = projection(p);\n return metric(p - q);\n }\n};\n\nbool is_orthogonal(const Line &l1, const Line &l2) {\n return l1.is_orthogonal(l2);\n}\nbool is_parallel(const Line &l1, const Line &l2) {\n return l1.is_parallel(l2);\n}\nPoint crosspoint(const Line &l1, const Line &l2) {\n return l1.crossppoint(l2);\n}\n\n} // namespace geometry\n\nnamespace geometry {\n\nstruct Segment {\n Line l;\n Point p, q;\n Segment() = default;\n Segment(const Point &_p, const Point &_q) : l(_p, _q), p(_p), q(_q) {}\n bool cross(const Segment &s) const {\n bool f1 = ccw(p, q, s.p) * ccw(p, q, s.q) <= 0;\n bool f2 = ccw(s.p, s.q, p) * ccw(s.p, s.q, q) <= 0;\n return f1 && f2;\n }\n Point crosspoint(const Segment &s) const {\n if (cross(s)) return l.crossppoint(s.l);\n return INF_POINT;\n }\n Real dist(const Point &r) const {\n if (dot(q - p, r - p) < eps) return (r - p).metric();\n if (dot(p - q, r - q) < eps) return (r - q).metric();\n return l.dist(r);\n }\n Real dist(const Segment &s) const {\n if (cross(s)) return 0;\n Real res = INF_REAL;\n res = min(res, dist(s.p));\n res = min(res, dist(s.q));\n res = min(res, s.dist(p));\n res = min(res, s.dist(q));\n return res;\n }\n};\n\nbool cross(const Segment &s, const Segment &t) {\n return s.cross(t);\n}\n\nPoint crosspoint(const Segment &s, const Segment &t) {\n return s.crosspoint(t);\n}\n\nReal dist(const Segment &s, const Segment &t) {\n return s.dist(t);\n}\n\n} // nemespace geometry\nusing namespace geometry;\n\nReal theta(Real t) {\n return t * PI / 180;\n}\n\nbool solve() {\n int N, M, L;\n cin >> N >> M >> L;\n if (N == 0) return false;\n M--, L--;\n vector<array<Segment, 5>> stars(N);\n for (int i = 0; i < N; i++) {\n Point p;\n Real a, r;\n cin >> p >> a >> r;\n a += 90;\n auto &S = stars[i];\n for (int j = 0; j < 5; j++) {\n int k = j + 2;\n S[j] = Segment(\n p + r * Point(cosl(theta(a + j * 72)), sinl(theta(a + j * 72))),\n p + r * Point(cosl(theta(a + k * 72)), sinl(theta(a + k * 72)))\n );\n }\n }\n vector<vector<Real>> D(N, vector<Real>(N, INF_REAL / 3));\n for (int i = 0; i < N; i++) {\n for (int j = i; j < N; j++) {\n for (auto s : stars[i]) {\n for (auto t : stars[j]) {\n D[i][j] = D[j][i] = min(D[i][j], s.dist(t));\n }\n }\n }\n }\n for (int k = 0; k < N; k++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n D[i][j] = min(D[i][j], D[i][k] + D[k][j]);\n }\n }\n }\n cout << fixed << setprecision(16) << D[M][L] << '\\n';\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":160,"memory_kb":4480,"score_of_the_acc":-0.086,"final_rank":5},{"submission_id":"aoj_2402_10556324","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<ll>> vvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\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<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n\n\n//参考 https://github.com/saphmitchy/deliair-lib\n// 型名\n// R:Real, P:Point, L:Line, S:Segment, C:Circle, VP:vector<Point>\n\n#define X(p) real(p)\n#define Y(p) imag(p)\n\nusing R = ld;\nusing P = complex<R>;\nusing VP = vector<P>;\n\n//const R EPS = 1e-9; // ここは適宜調節する,いつものやつから消す\nconst R pi = acos(-1.0);\n\nint sgn(R a) {\n return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;\n} // 符号関数\n\nbool eq(R a, R b) {//実数の一致判定\n return sgn(b - a) == 0;\n}\n\nP operator*(P p, R d) {//ベクトルのd倍\n return P(X(p) * d, Y(p) * d);\n}\n\nP operator/(P p, R d) {//ベクトルの1/d倍\n return p * (1 / d);\n}\n\nistream &operator>>(istream &is, P &p) {\n // R a, b; // 入力が小数\n int a, b; // 入力が整数\n is >> a >> b;\n p = P(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, P p) {\n return os << X(p) << ' ' << Y(p);\n}\n\nR getarg(P b,P a){//ベクトルbはベクトルaを何radian回転させる必要があるか\n assert(sgn(abs(a)) != 0);//長さが0はだめ\n return arg(b/a);\n}\n\nbool cp_x(P p, P q) {//ベクトルの比較x軸で比較->y軸で比較\n if (!eq(X(p), X(q)))\n return X(p) < X(q);\n return Y(p) < Y(q);\n}\n\nbool cp_y(P p, P q) {//ベクトルの比較y軸で比較->x軸で比較\n if (!eq(Y(p), Y(q)))\n return Y(p) < Y(q);\n return X(p) < X(q);\n}\n\nstruct L {//直線ab\n P a, b;\n L() {}\n L(P a, P b) : a(a), b(b) {}\n\n // 入出力（必要なら）\n friend ostream &operator<<(ostream &os, L &l) {\n return os << l.a << ' ' << l.b;\n }\n friend istream &operator>>(istream &is, L &l) {\n return is >> l.a >> l.b;\n }\n};\n\nstruct S : L {//線分ab\n S() {}\n S(P a, P b) : L(a, b) {}\n};\n\nstruct C {//中心p 半径rの円\n P p;\n R r;\n C() {}\n C(P p, R r) : p(p), r(r) {}\n};\n\nP rot(P p, R t) {//ベクトルの回転\n return p * P(cos(t), sin(t));\n}\n\n//2つのベクトルの内積\nR dot(P p, P q) {\n return X(p) * X(q) + Y(p) * Y(q);\n}\n\n//2つのベクトルの外積\nR det(P p, P q) {\n return X(p) * Y(q) - Y(p) * X(q);\n}\n\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C&lang=jp\nint ccw(P a, P b, P c) { // 線分 ab に対する c の位置関係 \n b -= a, c -= a;//ベクトルab,ベクトルacにした\n if (sgn(det(b, c)) == 1)//外積右ねじ正\n return +1; // COUNTER_CLOCKWISE a,b,cが反時計回り\n if (sgn(det(b, c)) == -1)\n return -1; // CLOCKWISE\n if (dot(b, c) < 0.0)\n return +2; // ONLINE_BACK\n if (norm(b) < norm(c))\n return -2; // ONLINE_FRONT\n return 0; // ON_SEGMENT\n}\n\nbool para(L a, L b) { // 平行判定\n return eq(det(a.b - a.a, b.b - b.a), 0.0);\n}\n\nbool orth(L a, L b) { // 垂直判定\n return eq(dot(a.b - a.a, b.b - b.a), 0.0);\n}\n\nP proj(L l, P p) { // 垂線の足\n R t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\n return l.a + (l.b - l.a) * t;\n}\n\n// これいる？\n// P proj(S s, P p) {\n// R t = dot(p - s.a, s.b - s.a) / norm(s.b - s.a);\n// return s.a + (s.b - s.a) * t;\n// }\n\nP refl(L l, P p) { // 線対称の位置にある点\n return p + (proj(l, p) - p) * 2.0;\n}\n\nbool inter(L l, P p) { // 交点を持つか判定\n return abs(ccw(l.a, l.b, p)) != 1;\n}\n\nbool inter(S s, P p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\nbool inter(L l, L m) {\n if (!eq(det(l.b - l.a, m.b - m.a), 0.0))\n return true;\n return eq(det(l.b - l.a, m.b - l.a), 0.0);\n}\n\nbool inter(L l, S s) {\n return sgn(det(l.b - l.a, s.a - l.a) * det(l.b - l.a, s.b - l.a)) <= 0;\n}\n\nbool inter(S s, L l) {\n return inter(l, s);\n}\n\nbool inter(S s, S t) {\n if (ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) > 0)\n return false;\n return ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\nR dist(P p, P q) {\n return abs(q - p);\n}\n\nR dist(L l, P p) {\n return abs(p - P(proj(l, p)));\n}\n\n//R dist(S s, P p) {\n// P h = proj(s, p);\n// if (inter(s, h))\n// return abs(h - p);\n// return min(abs(s.a - p), abs(s.b - p));\n//}\n\nR dist(S s, P p) {\n P h = proj(s, p);\n if(dot(p-s.a,s.b-s.a) <= 0) return abs(s.a-p);\n if(dot(p-s.b,s.a-s.b) <= 0) return abs(s.b-p);\n return abs(p - h);\n}\n\nR dist(L l, L m) {\n return inter(l, m) ? 0.0 : dist(l, m.a);\n}\n\nR dist(S s, S t) {\n if (inter(s, t))\n return 0.0;\n return min({dist(s, t.a), dist(s, t.b), dist(t, s.a), dist(t, s.b)});\n}\n\nR dist(L l, S s) {\n if (inter(l, s))\n return 0.0;\n return min(dist(l, s.a), dist(l, s.b));\n}\n\nR dist(S s, L l) {\n return dist(l, s);\n}\n\nbool inter(C c, L l) {\n return sgn(c.r - dist(l, c.p)) >= 0;\n}\n\nbool inter(C c, P p) {\n return eq(abs(p - c.p), c.r);\n}\n\n// 共通接線の本数\n// 交点なし:4\n// 外接:3\n// 2点で交わる:2\n// 内接:1\n// 一方がもう一方を内包:0\nint inter(C c1, C c2) {\n if (c1.r < c2.r)\n swap(c1, c2);\n R d = abs(c1.p - c2.p);\n int a = sgn(d - c1.r - c2.r);\n if (a >= 0)\n return 3 + a;\n return 1 + sgn(d - c1.r + c2.r);\n}\n\nVP crosspoint(L l, L m) {\n VP ret;\n if (!inter(l, m))\n return ret;\n R A = det(l.b - l.a, m.b - m.a);\n R B = det(l.b - l.a, l.b - m.a);\n if (eq(A, 0.0) && eq(B, 0.0)) {\n ret.emplace_back(m.a);\n } else {\n ret.emplace_back(m.a + (m.b - m.a) * B / A);\n }\n return ret;\n}\n\nVP crosspoint(S s, S t) {\n return inter(s, t) ? crosspoint(L(s), L(t)) : VP();\n}\n\nVP crosspoint(C c, L l) {//円と直線の交点\n P h = proj(l, c.p);\n P e = (l.b - l.a) / abs(l.b - l.a);\n VP ret;\n if (!inter(c, l))\n return ret;\n if (eq(dist(l, c.p), c.r)) {\n ret.emplace_back(h);\n } else {\n R b = sqrt(c.r * c.r - norm(h - c.p));\n ret.push_back(h + e * b), ret.push_back(h - e * b);\n }\n return ret;\n}\n\nVP crosspoint(C c, S s) {//円と線分の交点\n P h = proj(s, c.p);\n P e = (s.b - s.a) / abs(s.b - s.a);\n VP ret;\n if (!inter(c, s))\n return ret;\n if (eq(dist(s, c.p), c.r)) {\n ret.emplace_back(h);\n } else {\n R b = sqrt(c.r * c.r - norm(h - c.p));\n if(ccw(s.a,s.b,h - e * b) == 0){//s.aに近い方から線分上なら追加する\n ret.push_back(h - e * b);\n }\n if(ccw(s.a,s.b,h + e * b)==0){\n ret.push_back(h + e * b);\n }\n }\n return ret;\n}\n\nVP crosspoint(C c1, C c2) {//2つの円の交わる点\n R d = abs(c1.p - c2.p);\n R a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n R t = atan2(Y(c2.p) - Y(c1.p), X(c2.p) - X(c1.p));\n VP ret;\n if (inter(c1, c2) % 4 == 0) // 交わらないとき\n return ret;\n if (eq(a, 0.0)) {\n ret.emplace_back(P(c1.p + rot(P(c1.r, 0.0), t)));\n } else {\n P p1 = c1.p + rot(P(c1.r, 0.0), t + a);\n P p2 = c1.p + rot(P(c1.r, 0.0), t - a);\n ret.emplace_back(p1), ret.emplace_back(p2);\n }\n return ret;\n}\n\nVP cut(VP p, L l, bool border = true) { // 直線が多角形に切り取られる区間\n int n = sz(p);\n p.emplace_back(p[0]), p.emplace_back(p[1]);\n VP ret;\n rep(i, n) {\n if (!eq(dist(l, p[i]), 0) && !eq(dist(l, p[i + 1]), 0)) {\n S s(p[i], p[i + 1]);\n if (eq(dist(l, s), 0)) {\n auto res = crosspoint(l, s);\n ret.emplace_back(res[0]);\n }\n }\n if (eq(dist(l, p[i + 1]), 0)) {\n if ((eq(dist(l, p[i]), 0) || eq(dist(l, p[i + 2]), 0)) && !border)\n continue;\n S s(p[i], p[i + 2]);\n if (eq(dist(l, s), 0))\n ret.emplace_back(p[i + 1]);\n }\n }\n return ret;\n}\n\nVP rectangle(S s, R r) { // sを軸とした幅rの長方形\n P d = (s.a - s.b) * P(0, 1);\n d *= r / sqrt(norm(d));\n return VP{s.a + d, s.a - d, s.b - d, s.b + d};\n}\n\nL vertical_bisector(P p, P q) { // 垂直二等分線\n L l;\n l.a = (p + q) * 0.5;\n l.b = l.a + rot(q - p, pi * 0.5);\n return l;\n}\n\nL angle_bisector(P a,P b,P c){//角abcの二等分線(角bの２等分線)\n L l;\n l.a = b;\n R ang = atan2(Y(c-b),X(c-b)) - atan2(Y(a-b),X(a-b));//なす角\n ang/=2.0;\n l.b = l.a + rot(a-b,ang);\n return l;\n}\n\nC Apollonius(P p, P q, R a, R b) { // アポロニウスの円\n P p1 = (p * b + q * a) / (a + b), p2 = (-p * b + q * a) / (a - b);\n C c;\n c.p = (p1 + p2) * 0.5;\n c.r = abs(p1 - p2) * 0.5;\n return c;\n}\n\nR area(VP p) { // 多角形の面積\n R ret = 0.0;\n int n = sz(p);\n rep(i, n) ret += det(p[i], p[(i + 1) % n]);\n return abs(ret * 0.5);\n}\n\nint in_polygon(VP p, P q) { // IN:2, ON:1, OUT:0\n int n = sz(p);\n int ret = 0;\n rep(i, n) {\n P a = p[i] - q, b = p[(i + 1) % n] - q;\n if (eq(det(a, b), 0.0) && sgn(dot(a, b)) <= 0)\n return 1;\n if (Y(a) > Y(b))\n swap(a, b);\n if (sgn(Y(a)) <= 0 && sgn(Y(b)) == 1 && sgn(det(a, b)) == 1)\n ret ^= 2;\n }\n return ret;\n}\n\nVP tangent(C c, P p) { // 点 p を通る円 c の接線と c の接点\n return crosspoint(c, C(p, sqrt(norm(p - c.p) - c.r * c.r)));\n}\n\nvector<L> tangent(C c1, C c2) { // 共通接線\n vector<L> ret;\n if (c1.r < c2.r)\n swap(c1, c2);\n R r = abs(c2.p - c1.p);\n if (eq(r, 0.0))\n return ret;\n P u = (c2.p - c1.p) / r;\n P v = rot(u, pi * 0.5);\n for (R s : {1.0, -1.0}) {\n R h = (c1.r + c2.r * s) / r;\n if (eq(abs(h), 1.0)) {\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n } else if (abs(h) < 1.0) {\n P uu = u * h, vv = v * sqrt(1.0 - 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\nVP convex_hull(VP p) { // 凸包\n sort(all(p), cp_x);\n p.erase(unique(all(p)), end(p));\n int n = sz(p), k = 0;\n if (n == 1)\n return p;\n VP ch(2 * n);\n for (int i = 0; i < n; ch[k++] = p[i++]) {\n while (k >= 2 && sgn(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) <= 0)\n k--;\n }\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\n while (k >= t && sgn(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) <= 0)\n k--;\n }\n ch.resize(k - 1);\n return ch;\n}\n\nR closest_pair(VP p) { // 最近点対の距離\n if (sz(p) <= 1)\n return 1e18;\n sort(all(p), cp_x);\n VP memo(sz(p));\n\n function<R(int, int)> rec = [&](int l, int r) {\n if (r - l <= 1)\n return R(1e18);\n int m = (l + r) >> 1;\n R x = X(p[m]);\n R ret = min(rec(l, m), rec(m, r));\n inplace_merge(p.begin() + l, p.begin() + m, p.begin() + r, cp_y);\n int cnt = 0;\n reps(i, l, r) {\n if (abs(X(p[i]) - x) >= ret)\n continue;\n rep(j, cnt) {\n P d = p[i] - memo[cnt - j - 1];\n if (Y(d) >= ret)\n break;\n chmin(ret, abs(d));\n }\n memo[cnt++] = p[i];\n }\n return ret;\n };\n\n return rec(0, sz(p));\n}\n\nR farthest_pair(VP p) {//最遠点対の距離\n VP ps = convex_hull(p);\n ll n = ps.size();\n if(n == 2){//凸包が潰れてる\n return dist(ps[0],ps[1]);\n }\n ll i = 0,j = 0;\n rep(k,n){//x軸方向に最も遠い点対を求める\n if(cp_x(ps[k],ps[i]))i = k;\n if(cp_x(ps[j],ps[k]))j = k;\n }\n R ret = 0;\n ll si = i,sj = j;\n while(i != sj || j != si){//180度反転しきるまで\n ret = max(ret,dist(ps[i],ps[j]));\n if(det(ps[(i+1)%n] - ps[i],ps[(j+1)%n]-ps[j]) < 0){\n i = (i + 1) % n;\n }else{\n j = (j + 1) % n;\n }\n }\n return ret;\n}\n\n// 原点, 点 a, 点 b とで囲まれる領域の面積 (三角形 ver と扇型 ver)\nR calc_element(P a, P b, R cr,bool triangle){\n if(triangle)return det(a,b)/2;\n else{\n P tmp = b * (P(X(a),-Y(a)));\n R ang = atan2(Y(tmp),X(tmp));\n return cr * cr * ang/2;\n }\n}\n\n// 円 C と、三角形 ((0, 0), ia, ib) との共通部分の面積\nR common_area(C c, P ia,P ib){\n P a = ia - c.p , b = ib - c.p;\n if(eq(abs(a-b),0))return 0;\n bool isin_a = (sgn(c.r - abs(a))>= 0);\n bool isin_b = (sgn(c.r - abs(b))>= 0);\n if(isin_a && isin_b)return calc_element(a,b,c.r,true);//aもbも円の中\n\n C oc(P(0,0),c.r);\n S seg(a,b);\n VP cr = crosspoint(oc,seg);\n if(cr.empty())return calc_element(a,b,c.r,false);\n P s = cr[0],t = cr.back();\n return calc_element(s,t,c.r,true) + calc_element(a,s,c.r,isin_a) + calc_element(t,b,c.r,isin_b);\n\n}\n\n\nR common_area(C c, VP vp){// 円cと多角形の共通部分の面積\n R ret = 0;\n ll n = vp.size();\n rep(i,n){\n ret += common_area(c,vp[i],vp[(i+1)%n]);\n }\n return ret;\n}\n\nR common_area(C p, C q) {// 円と円の共通部分の面積\n R d = abs(p.p - q.p);\n if (d >= p.r + q.r - EPS) return 0;\n else if (d <= abs(p.r - q.r) + EPS) return min(p.r, q.r) * min(p.r, q.r) * pi;\n R pcos = (p.r*p.r + d*d - q.r*q.r) / (p.r*d*2);\n R pang = acosl(pcos);\n R parea = p.r*p.r*pang - p.r*p.r*sin(pang*2)/2;\n R qcos = (q.r*q.r + d*d - p.r*p.r) / (q.r*d*2);\n R qang = acosl(qcos);\n R qarea = q.r*q.r*qang - q.r*q.r*sin(qang*2)/2;\n return parea + qarea;\n}\n\nvector<VP> divisions(vector<L> lf, R lim = 1e9) {\n vector<L> ls;\n each(l, lf) {\n bool ok = true;\n each(m, ls) {\n if (para(l, m) & inter(l, m.a)) {\n ok = false;\n break;\n }\n }\n if (ok)\n ls.emplace_back(l);\n }\n VP lc{P(-lim, -lim), P(lim, -lim), P(lim, lim), P(-lim, lim)};\n rep(i, 4) ls.emplace_back(lc[i], lc[(i + 1) % 4]);\n int m = sz(ls);\n VP ps;\n vector<vector<int>> lp(m);\n rep(i, m) {\n reps(j, i + 1, m) {\n each(p, crosspoint(ls[i], ls[j])) {\n if (max(abs(X(p)), abs(Y(p))) < lim + EPS) {\n lp[i].emplace_back(sz(ps)), lp[j].emplace_back(sz(ps));\n ps.emplace_back(p);\n }\n }\n }\n }\n int n = sz(ps);\n vector<int> id(n, -1), to;\n vector<R> rg;\n vector<vector<pair<R, int>>> li(n);\n rep(i, m) {\n sort(all(lp[i]), [&ps](int a, int b) { return cp_x(ps[a], ps[b]); });\n vector<int> q;\n rep(j, sz(lp[i])) {\n int me = id[lp[i][j]], st = j;\n auto np = ps[lp[i][j]];\n while (j + 1 < sz(lp[i])) {\n if (abs(ps[lp[i][j + 1]] - np) < EPS) {\n j++;\n if (id[lp[i][j]] != -1)\n me = id[lp[i][j]];\n } else\n break;\n }\n if (me == -1)\n me = lp[i][st];\n reps(k, st, j + 1) id[lp[i][k]] = me;\n q.emplace_back(me);\n }\n rep(i, sz(q) - 1) {\n P d = ps[q[i + 1]] - ps[q[i]];\n R s = atan2(Y(d), X(d)), t = atan2(-Y(d), -X(d));\n int x = q[i], y = q[i + 1];\n li[x].emplace_back(s, sz(to));\n li[x].emplace_back(s + pi * 2, sz(to));\n to.emplace_back(y), rg.emplace_back(t);\n li[y].emplace_back(t, sz(to));\n li[y].emplace_back(t + pi * 2, sz(to));\n to.emplace_back(x), rg.emplace_back(s);\n }\n }\n rep(i, n) sort(all(li[i]));\n vector<bool> u(sz(to), false);\n vector<VP> ret;\n rep(i, n) {\n each(l, li[i]) {\n int ns = l.second;\n if (u[ns])\n continue;\n VP nv;\n int no = ns;\n bool ok = true;\n while (1) {\n if (sz(nv) > 1) {\n P x = nv[sz(nv) - 2], y = nv[sz(nv) - 1], z = ps[to[no]];\n int c = ccw(x, y, z);\n if (c == 1)\n ok = false;\n if (c != -1)\n nv.pop_back();\n }\n nv.emplace_back(ps[to[no]]);\n u[no] = true;\n no = upper_bound(all(li[to[no]]), pair(rg[no] + EPS, -1))->second;\n if (no == ns)\n break;\n }\n if (ok)\n ret.emplace_back(nv);\n }\n }\n return ret;\n}\n\n//ref https://github.com/drken1215/algorithm/blob/master/Geometry/arg_sort.cpp\n//verify https://atcoder.jp/contests/abc139/submissions/me\n//点列を偏角ソート\nvoid arg_sort(VP &v){\n //原点=0,(pi,2pi] = -1 (0pi,pi] = 1\n auto sign = [&](const P &p){\n if(sgn(X(p)) == 0 && sgn(Y(p)) == 0){\n return 0;\n }else if(sgn(Y(p)) == -1 || (sgn(Y(p)) == 0 && sgn(X(p)) == 1)){\n return -1;\n }else{\n return 1;\n }\n };\n auto cp = [&](const P &p,const P &q){\n if(sign(p) != sign(q)){\n return sign(p) < sign(q);\n }else{//外積>0で判定\n //同じ向きにあるときは未定義、それぞれ決める\n return X(p) * Y(q) - Y(p) * X(q) > 0;\n }\n };\n sort(v.begin(),v.end(),cp);\n}\n\n\nusing tpl4 = tuple<ll,ll,ll,ll>;\nvoid solve(ll n,ll m,ll l){\n vector<tpl4> xyar(n);\n rep(i,n){\n LL(x,y,a,r);\n xyar[i] ={x,y,a,r};\n }\n vector<vector<P>> nodes(n,vector<P>(5));\n rep(i,n){\n auto [x,y,a,r] = xyar[i];\n ld baserad = (ld)(a+90)/180 * M_PI;\n ld drad = (ld)72/180 * M_PI;\n rep(j,5){\n nodes[i][j] = P(x+ r *cos(baserad + drad * j),y + r * sin(baserad + drad * j));\n }\n }\n vector<vector<S>> segs(n,vector<S>(5));\n rep(i,n){\n rep(j,5){\n ll k = (j+2) % 5;\n segs[i][j] = S(nodes[i][j],nodes[i][k]);\n }\n }\n \n \n ld limit = 100000;\n vector<vector<ld>> distance(n,vector<ld>(n,limit));\n\n rep(i,n){\n rep(j,i){\n // 線分と線分の距離だけ見ればいい\n rep(a,5)rep(b,5){\n chmin(distance[i][j], dist(segs[j][b],segs[i][a]));\n }\n\n //逆\n distance[j][i] = distance[i][j];\n }\n }\n\n\n //warshal floyd\n\n int size = (int)distance.size();\n rep(k,size){\n rep(i,size){\n rep(j,size){\n if(i == j){\n chmin(distance[i][j],ld(0));\n }\n if(!eq(distance[i][k],limit) && !eq(distance[k][j],limit)){\n chmin(distance[i][j],distance[i][k] + distance[k][j]);\n }\n }\n }\n }\n cout << std::fixed << std::setprecision(10) << distance[m-1][l-1] << endl;\n\n\n\n}\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true){\n LL(n,m,l);\n if(n == 0 && m == 0 && l == 0)break;\n solve(n,m,l);\n } \n}","accuracy":1,"time_ms":350,"memory_kb":4480,"score_of_the_acc":-0.1635,"final_rank":11},{"submission_id":"aoj_2402_10418458","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T>\nbool chmin(T& a, T b) {\n return a > b ? a = b, true : false;\n}\ntemplate <class T>\nbool chmax(T& a, T b) {\n return a < b ? a = b, true : false;\n}\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\ntemplate <class T = ll>\nstruct Edge {\n int to;\n T weight;\n bool operator==(Edge e) {\n return this->to == e.to and this->weight == e.weight;\n }\n bool operator<(Edge e) {\n return this->to == e.to ? this->weight < e.weight : this->to < e.to;\n }\n};\n#ifdef _DEBUG\n#define SHOW(n) \\\n { \\\n const auto& _ret = n; \\\n cerr << #n << \": \" << _ret << endl; \\\n }\n#define MSG(x) cerr << x << endl;\n#else\n#define SHOW(n)\n#define MSG(x)\n#endif\n\n////AtCoder Library\n// #include <atcoder/all>\n// using namespace atcoder;\n////using mint = modint998244353;\n////using mint = modint1000000007;\n////using mint1 = dynamic_modint<0>;\n// using mint = modint;\n////mint::set_mod();\n// istream& operator>>(istream& is, mint& x) { ll r; is >> r; x = r; return is;\n// } ostream& operator<<(ostream& os, mint& x) { os << x.val(); return os; }\n\n// boost\n// #include <boost/multiprecision/cpp_int.hpp>\n// using namespace boost::multiprecision;\n// using l3 = int128_t;\n\nusing Real = double;\nusing Point = complex<Real>;\nusing Polygon = vector<Point>;\nconst Real EPS = 1e-8, PI = acos(-1);\nPoint operator*(const Point& p, const Real& d) {\n return Point(p.real() * d, p.imag() * d);\n}\nPoint operator/(const Point& p, const Real& d) {\n return Point(p.real() / d, p.imag() / d);\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}\nint sign(const Real& r) {\n if (r <= -EPS) return -1;\n if (r >= +EPS) return +1;\n return 0;\n}\nbool equals(const Real& a, const Real& b) { return sign(a - b) == 0; }\nnamespace std {\nbool operator<(const Point& a, const Point& b) {\n if (equals(a.real(), b.real())) return a.imag() < b.imag();\n return a.real() < b.real();\n}\n} // namespace std\n// namespace std\nReal dot(const Point& a, const Point& b) { return (conj(a) * b).real(); }\nReal cross(const Point& a, const Point& b) { return (conj(a) * b).imag(); }\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n};\nusing Segment = Line;\n\n// 直線 l に対する点 p の射影\nPoint projection(const Line& l, const Point& p) {\n return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n}\n// 直線 l に対する点 p の反射 (l と反対側にある点)\nPoint reflection(const Line& l, const Point& p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n// 直線 l に対する点 p の射影\n\n// 点 a から見た点 b,c の位置関係\n// +1: b,c が反時計回り\n// -1: b,c が時計回り\n// +2: c,a,b がこの順で同一直線上にある\n// -2: a,b,c がこの順で同一直線上にある\n// 0: a,c,b がこの順で同一直線上にある\nint ccw(const Point& a, Point b, Point c) {\n b -= a, c -= a;\n if (sign(cross(b, c)) == +1) return +1;\n if (sign(cross(b, c)) == -1) return -1;\n if (sign(dot(b, c)) == -1) return +2;\n if (norm(b) < norm(c)) return -2;\n return 0;\n}\n\n// 直線 a,b が直交するか判定\nbool is_orthogonal(const Line& a, const Line& b) {\n return equals(dot(a.b - a.a, b.b - b.a), 0);\n}\n// 直線 a,b が並行か判定\nbool is_parallel(const Line& a, const Line& b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0);\n}\n// 線分 s,t が交差するか判定\nbool is_intersect_ss(const Segment& s, const Segment& t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n// 直線 l,m の交点を求める\nPoint cross_point_ll(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 (equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n// 線分 s と点 p の距離を求める\nReal distance_sp(const Segment& s, const Point& p) {\n Point r = projection(s, p);\n if (ccw(s.a, s.b, r) == 0) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n// 線分 a,b の距離を求める\nReal distance_ss(const Segment& a, const Segment& b) {\n if (is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a),\n distance_sp(b, a.b)});\n}\n\nvoid solve() {\n int n, m, l;\n cin >> n >> m >> l;\n\n if (n == 0) {\n exit(0);\n }\n\n double pi = acos(-1);\n\n vector<vector<Segment>> sgs(n);\n for (int i = 0; i < n; ++i) {\n int x, y, a, r;\n cin >> x >> y >> a >> r;\n vector<Point> pts(5);\n for (int j = 0; j < 5; ++j) {\n double X = x + r * sin((2 * pi * j) / 5 - (pi * a) / 180);\n double Y = y + r * cos((2 * pi * j) / 5 - (pi * a) / 180);\n pts[j] = Point(X, Y);\n }\n\n for (int j = 0; j < 5; ++j) {\n sgs[i].emplace_back(pts[j], pts[(j + 2) % 5]);\n }\n }\n\n auto eval = [&](vector<Segment>& a, vector<Segment>& b) {\n double res = 1e9;\n for (int i = 0; i < 5; ++i) {\n for (int j = 0; j < 5; ++j) {\n chmin(res, distance_ss(a[i], b[j]));\n }\n }\n return res;\n };\n\n vector<vector<double>> dist(n, vector<double>(n, 1e9));\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n dist[i][j] = eval(sgs[i], sgs[j]);\n }\n }\n\n for (int k = 0; k < n; ++k) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n chmin(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n\n cout << fixed << setprecision(12);\n cout << dist[m - 1][l - 1] << endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while (true) {\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":4224,"score_of_the_acc":-0.149,"final_rank":9},{"submission_id":"aoj_2402_10418388","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 2 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\n#line 6 \"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\"\n\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 << std::min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::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(std::vector<T> &v){\n std::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#line 2 \"/Users/noya2/Desktop/Noya2_library/geometry/float_geometry.hpp\"\n\n#include <type_traits>\n#include <concepts>\n#include <compare>\n#line 12 \"/Users/noya2/Desktop/Noya2_library/geometry/float_geometry.hpp\"\n#include <ranges>\n\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\n\n#include<boost/multiprecision/cpp_bin_float.hpp>\n\n#endif\n\nnamespace float_geometry {\n\ntemplate<class T>\nstruct is_floating_point_number : std::bool_constant<false> {};\n\ntemplate<std::floating_point F>\nstruct is_floating_point_number<F> : std::bool_constant<true> {};\n\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\n\ntemplate<unsigned D>\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_bin_float<D>>> : std::bool_constant<true> {};\n\ntemplate<unsigned D>\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<D>>> : std::bool_constant<true> {};\n\n#endif\n\ntemplate<class F>\nconcept FloatingPoint = is_floating_point_number<F>::value;\n\ntemplate<FloatingPoint Float>\nconstexpr Float EPS = Float{1e-8};\n\ntemplate<FloatingPoint Float>\nconstexpr int sign(const Float &x, Float eps = EPS<Float>){\n return (x < -eps ? -1 : x > eps ? 1 : 0);\n}\n\ntemplate<FloatingPoint Float>\nstruct point {\n Float x, y;\n point () {}\n point (Float _x, Float _y) : x(_x), y(_y) {}\n point &operator+=(const point &r){\n x += r.x;\n y += r.y;\n return *this;\n }\n point &operator-=(const point &r){\n x -= r.x;\n y -= r.y;\n return *this;\n }\n point operator+() const {\n return *this;\n }\n point operator-() const {\n x = -x;\n y = -y;\n return *this;\n }\n point &operator*=(const Float &a){\n x *= a;\n y *= a;\n return *this;\n }\n\tpoint &operator/=(const Float &a){\n x /= a;\n y /= a;\n return *this;\n }\n friend point operator+(const point& lhs, const point& rhs){\n return point(lhs) += rhs;\n }\n friend point operator-(const point& lhs, const point& rhs){\n return point(lhs) -= rhs;\n }\n friend point operator*(const point& lhs, const Float& a){\n return point(lhs) *= a;\n }\n friend point operator*(const Float& a, const point& rhs){\n return point(rhs) *= a;\n }\n\tfriend point operator/(const point& lhs, const Float& a){\n return point(lhs) /= a;\n }\n auto operator<=>(const point&) const = default;\n // friend bool operator<(const point &lhs, const point &rhs){\n // if (lhs.x == rhs.x) return lhs.y < rhs.y;\n // return lhs.x < rhs.x;\n // }\n // friend bool operator==(const point &lhs, const point &rhs){\n // return (lhs.x == rhs.x && lhs.y == rhs.y);\n // }\n friend std::ostream &operator<<(std::ostream &os, const point& p){\n return os << p.x << ' ' << p.y;\n }\n friend std::istream &operator>>(std::istream &is, point &a){\n Float _x, _y; is >> _x >> _y;\n a = point(_x, _y);\n return (is);\n }\n friend Float norm(const point &a) {\n return a.x*a.x + a.y*a.y;\n }\n friend Float dot(const point &a, const point &b){\n return a.x*b.x + a.y*b.y;\n }\n friend Float cross(const point &a, const point &b){\n return a.x*b.y - a.y*b.x;\n }\n\tfriend point rot90(const point &a){\n\t\treturn point(-a.y, a.x);\n\t}\n friend point rot(const point &a, const Float rad){\n using std::cos, std::sin;\n Float cosrad = cos(rad);\n Float sinrad = sin(rad);\n return point(a.x * cosrad - a.y * sinrad, a.x * sinrad + a.y * cosrad);\n }\n friend Float abs(const point &a){\n using std::sqrt;\n return sqrt(norm(a));\n }\n\n friend int quadrant_atan2(const point &a){\n // not origin point\n // ceil ( atan2(y,x) / (pi/2) )\n\t\tint signx = sign(a.x);\n\t\tint signy = sign(a.y);\n\t\tif (signx <= 0 && signy < 0) return -1;\n\t\tif (signx > 0 && signy <= 0) return 0;\n\t\tif (signx >= 0 && signy > 0) return 1;\n\t\tif (signx < 0 && signy >= 0) return 2;\n // origin point x == 0 && y == 0\n return 0;\n }\n\n friend int sign_cross(const point &a, const point &b){\n using std::abs;\n return sign(cross(a, b), EPS<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\n // return sign(cross(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(b.y)));\n }\n\n friend int sign_dot(const point &a, const point &b){\n using std::abs;\n return sign(dot(a, b), EPS<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\n // return sign(dot(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(b.y)));\n }\n\n\tfriend int ccw(const point &a, point b, point c){\n\t\tb -= a;\n\t\tc -= a;\n\t\tint signcr = sign_cross(b, c);\n\t\tif (signcr > 0){\n\t\t\t// ccw \n\t\t\t// c\n\t\t\t// a --> b \n\t\t\treturn 1;\n\t\t}\n\t\tif (signcr < 0){\n\t\t\t// cw\n\t\t\t// a --> b\n\t\t\t// c\n\t\t\treturn -1;\n\t\t}\n\t\tif (sign_dot(b, c) < 0){\n\t\t\t// c a --> b\n\t\t\treturn 2;\n\t\t}\n\t\tif (norm(b) < norm(c)){\n\t\t\t// a --> b c\n\t\t\treturn -2;\n\t\t}\n\t\t// a - c -> b\n\t\treturn 0;\n\t}\n friend bool has_common_point(const point &a, const point &b){\n return sign(a.x - b.x) == 0 && sign(a.y - b.y) == 0;\n }\n\n ld arg() const {\n std::complex<ld> a(x, y);\n return std::arg(a);\n }\n};\n\ntemplate<FloatingPoint Float>\nstruct arg_less {\n constexpr bool operator()(const point<Float> &l, const point<Float> &r){\n using std::atan2;\n return atan2(l.y, l.x) < atan2(r.y, r.x);\n }\n};\n\ntemplate<FloatingPoint Float>\nvoid arg_sort(std::vector<point<Float>> &a){\n\tstd::sort(a.begin(), a.end(), arg_less<Float>{});\n}\n\n\ntemplate<FloatingPoint Float>\nstd::vector<int> upper_convex_hull_index(const std::vector<point<Float>> &a){\n\tif (a.empty()) return {};\n\tstd::vector<int> ids(a.size());\n std::iota(ids.begin(), ids.end(), 0);\n\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\n\t\treturn a[l] < a[r];\n\t});\n\tstd::vector<int> st(a.size());\n\tint ptr = 0;\n\tfor (int i : ids){\n\t\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) ptr--;\n\t\twhile (ptr >= 2){\n\t\t\tint c = st[ptr-1];\n\t\t\tint p = st[ptr-2];\n\t\t\tif (sign_cross(a[i] - a[c], a[c] - a[p]) > 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tptr--;\n\t\t}\n\t\tst[ptr++] = i;\n\t}\n\tst.resize(ptr);\n\treturn st;\n}\n\ntemplate<FloatingPoint Float>\nstd::vector<int> lower_convex_hull_index(const std::vector<point<Float>> &a){\n\tif (a.empty()) return {};\n\tstd::vector<int> ids(a.size());\n std::iota(ids.begin(), ids.end(), 0);\n\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\n\t\treturn a[l] < a[r];\n\t});\n\tstd::vector<int> st(a.size());\n\tint ptr = 0;\n\tfor (int i : ids){\n\t\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) continue;\n\t\twhile (ptr >= 2){\n\t\t\tint c = st[ptr-1];\n\t\t\tint p = st[ptr-2];\n\t\t\tif (sign_cross(a[c] - a[p], a[i] - a[c]) > 0){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tptr--;\n\t\t}\n\t\tst[ptr++] = i;\n\t}\n\tst.resize(ptr);\n\treturn st;\n}\n\ntemplate<FloatingPoint Float>\nstd::vector<int> convex_hull_index(const std::vector<point<Float>> &a){\n\tif (a.empty()) return {};\n\tauto upper = upper_convex_hull_index(a);\n\tauto lower = lower_convex_hull_index(a);\n\tif (upper.size() == 1u){\n\t\t// lower.size() == 1u\n\t\tif (a[upper.front()] == a[lower.front()]){\n\t\t\treturn {upper.front()};\n\t\t}\n\t\treturn {lower.front(), upper.front()};\n\t}\n\tif (a[upper.back()] == a[lower.back()]){\n\t\tlower.pop_back();\n\t}\n\tlower.insert(lower.end(), upper.rbegin(), upper.rend());\n\tif (a[upper.front()] == a[lower.front()]) lower.pop_back();\n\treturn lower;\n}\n\n\ntemplate<FloatingPoint Float>\nstruct line {\n\tpoint<Float> end0, end1;\n line () {}\n\tline (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\n\t\tassert(end0 != end1);\n\t}\n\t// auto operator<=>(const line &) const = default;\n\tpoint<Float> direction() const {\n\t\treturn end1 - end0;\n\t}\n friend bool is_parallel(const line &a, const line &b){\n return sign_cross(a.direction(), b.direction()) == 0;\n }\n friend bool is_orthgonal(const line &a, const line &b){\n return sign_dot(a.direction(), b.direction()) == 0;\n }\n\tfriend bool has_common_point(const line &a, const point<Float> &b){\n\t\treturn sign(cross(a.direction(), b - a.end0)) == 0;\n\t}\n\tfriend bool has_common_point(const line &a, const line &b){\n\t\treturn !is_parallel(a, b) || has_common_point(a, b.end0);\n\t}\n\tfriend point<Float> common_point(const line &a, const line &b){\n\t\t// assert(has_common_point(a, b));\n\t\tif (is_parallel(a, b)){\n\t\t\treturn a.end0;\n\t\t}\n\t\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\n\t}\n\tfriend point<Float> projection(const line &a, const point<Float> &b){\n\t\tauto dir = a.direction();\n\t\treturn a.end0 + dir * (dot(dir, b - a.end0) / norm(dir));\n\t}\n\tfriend point<Float> reflection(const line &a, const point<Float> &b){\n\t\tauto prj = projection(a, b);\n\t\treturn prj + prj - b;\n\t}\n friend line<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\n auto ctr = (p1 + p2) / Float{2};\n auto dir = rot90(p2 - p1);\n return line<Float>(ctr, ctr + dir);\n }\n};\n\ntemplate<FloatingPoint Float>\nline<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\n auto ctr = (p1 + p2) / Float{2};\n auto dir = rot90(p2 - p1);\n return line<Float>(ctr, ctr + dir);\n}\n\n\ntemplate<FloatingPoint Float>\nstruct segment {\n\tpoint<Float> end0, end1;\n segment () {}\n\tsegment (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\n\t\tassert(end0 != end1);\n\t}\n\t// auto operator<=>(const segment &) const = default;\n\tpoint<Float> direction() const {\n\t\treturn end1 - end0;\n\t}\n friend bool is_parallel(const segment &a, const segment &b){\n return sign_cross(a.direction(), b.direction()) == 0;\n }\n friend bool is_orthgonal(const segment &a, const segment &b){\n return sign_dot(a.direction(), b.direction()) == 0;\n }\n\tfriend bool has_common_point(const segment &a, const segment &b){\n\t\treturn ccw(a.end0, a.end1, b.end0) * ccw(a.end0, a.end1, b.end1) <= 0\n\t\t\t&& ccw(b.end0, b.end1, a.end0) * ccw(b.end0, b.end1, a.end1) <= 0;\n\t}\n\tfriend bool has_common_point(const segment &a, const point<Float> &b){\n\t\treturn ccw(a.end0, a.end1, b) == 0;\n\t}\n\tfriend point<Float> common_point(const segment &a, const segment &b){\n\t\t// assert(has_common_point(a, b));\n\t\tif (is_parallel(a, b)){\n\t\t\tif (has_common_point(a, b.end0)){\n\t\t\t\treturn b.end0;\n\t\t\t}\n\t\t\tif (has_common_point(a, b.end1)){\n\t\t\t\treturn b.end1;\n\t\t\t}\n\t\t\treturn a.end0;\n\t\t}\n\t\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\n\t}\n\tline<Float> as_line() const {\n\t\treturn line<Float>(end0, end1);\n\t}\n};\n\n} // float_geometry\n#line 4 \"c.cpp\"\n\nusing namespace float_geometry;\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\"\n\n#line 2 \"/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp\"\n\n#line 7 \"/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp\"\n\nnamespace noya2::internal {\n\ntemplate<class E>\nstruct csr {\n csr () {}\n csr (int _n) : n(_n) {}\n csr (int _n, int m) : n(_n){\n start.reserve(m);\n elist.reserve(m);\n }\n // ACL style constructor (do not have to call build)\n csr (int _n, const std::vector<std::pair<int,E>> &idx_elem) : n(_n), start(_n + 2), elist(idx_elem.size()) {\n for (auto &[i, e] : idx_elem){\n start[i + 2]++;\n }\n for (int i = 1; i < n; i++){\n start[i + 2] += start[i + 1];\n }\n for (auto &[i, e] : idx_elem){\n elist[start[i + 1]++] = e;\n }\n prepared = true;\n }\n int add(int idx, E elem){\n int eid = start.size();\n start.emplace_back(idx);\n elist.emplace_back(elem);\n return eid;\n }\n void build(){\n if (prepared) return ;\n int m = start.size();\n std::vector<E> nelist(m);\n std::vector<int> nstart(n + 2, 0);\n for (int i = 0; i < m; i++){\n nstart[start[i] + 2]++;\n }\n for (int i = 1; i < n; i++){\n nstart[i + 2] += nstart[i + 1];\n }\n for (int i = 0; i < m; i++){\n nelist[nstart[start[i] + 1]++] = elist[i];\n }\n swap(elist,nelist);\n swap(start,nstart);\n prepared = true;\n }\n const auto operator[](int idx) const {\n return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);\n }\n auto operator[](int idx){\n return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);\n }\n const auto operator()(int idx, int l, int r) const {\n return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);\n }\n auto operator()(int idx, int l, int r){\n return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);\n }\n size_t size() const {\n return n;\n }\n int n;\n std::vector<int> start;\n std::vector<E> elist;\n bool prepared = false;\n};\n\n} // namespace noya2::internal\n#line 2 \"/Users/noya2/Desktop/Noya2_library/graph/unweighted_type.hpp\"\n\nnamespace noya2 {\n\nstruct unweighted {};\n\n} // namespace noya2\n#line 6 \"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\"\n\n#line 12 \"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\"\n\nnamespace noya2 {\n\ntemplate<typename Cost>\nstruct graph {\n int n;\n internal::csr<std::pair<int,Cost>> g;\n Cost dist_inf = std::numeric_limits<Cost>::max() / 3;\n graph (int _n = 0) : n(_n), g(_n) {}\n graph (int _n, int _m) : n(_n), g(_n,_m) {}\n // 有向辺を追加 (無向辺ではないことに注意！)\n int add_edge(int u, int v, Cost cost = 1){\n int id = g.add(u, {v,cost});\n return id;\n }\n template<bool directed>\n static graph input(int _n, int _m, int indexed = 1){\n if constexpr (directed){\n graph g(_n, _m*2);\n for (int i = 0; i < _m; i++){\n int u, v; std::cin >> u >> v;\n u -= indexed, v -= indexed;\n Cost c; std::cin >> c;\n g.add_edge(u, v, c);\n g.add_edge(v, u, c);\n }\n g.build();\n return g;\n }\n else {\n graph g(_n, _m);\n for (int i = 0; i < _m; i++){\n int u, v; std::cin >> u >> v;\n u -= indexed, v -= indexed;\n Cost c; std::cin >> c;\n g.add_edge(u, v, c);\n }\n g.build();\n return g;\n }\n }\n void build(){\n g.build();\n }\n void set_inf(Cost new_inf){\n dist_inf = new_inf;\n }\n std::vector<Cost> dijkstra(int s){\n g.build();\n std::vector<Cost> dist(n,dist_inf);\n dist[s] = 0;\n using P = std::pair<Cost,int>;\n std::priority_queue<P,std::vector<P>,std::greater<P>> pque;\n pque.push(P(0,s));\n while (!pque.empty()){\n auto [d, v] = pque.top(); pque.pop();\n if (dist[v] < d-ld(1e-8)) continue;\n for (auto [u, c] : g[v]){\n if (chmin(dist[u],d+c)){\n pque.push(P(dist[u],u));\n }\n }\n }\n return dist;\n }\n std::vector<int> reconstruct(int s, int t, const std::vector<Cost> &dist){\n if (dist[t] == dist_inf) return {};\n g.build();\n std::vector<int> from(n,-1);\n std::queue<int> que;\n que.push(s);\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (auto [u, c] : g[v]){\n if (from[u] == -1 && dist[u] == dist[v] + c){\n from[u] = v;\n que.push(u);\n }\n }\n }\n std::vector<int> ans = {t};\n while (t != s){\n t = from[t];\n ans.emplace_back(t);\n }\n std::reverse(ans.begin(),ans.end());\n return ans;\n }\n std::vector<Cost> bfs01(int s){\n g.build();\n std::vector<Cost> dist(n,dist_inf);\n dist[s] = 0;\n std::deque<int> que;\n que.push_back(s);\n while (!que.empty()){\n int v = que.front(); que.pop_front();\n for (auto [u, c] : g[v]){\n if (chmin(dist[u],dist[v]+c)){\n if (c == 0) que.push_front(u);\n else que.push_back(u);\n }\n }\n }\n return dist;\n }\n std::vector<Cost> bfs1(int s){\n g.build();\n std::vector<Cost> dist(n,dist_inf);\n dist[s] = 0;\n std::queue<int> que;\n que.push(s);\n while (!que.empty()){\n int v = que.front(); que.pop();\n for (auto [u, c] : g[v]){\n if (chmin(dist[u],dist[v]+c)){\n que.push(u);\n }\n }\n }\n return dist;\n }\n std::vector<Cost> bellman_ford(int s, bool &ng_cycle){\n g.build();\n std::vector<Cost> dist(n,dist_inf);\n std::vector<int> ng;\n dist[s] = 0;\n int tm = 0;\n while (tm < n){\n bool finish = true;\n for (int v = 0; v < n; v++){\n if (dist[v] == dist_inf) continue;\n for (auto [u, c] : g[v]){\n if (chmin(dist[u],dist[v]+c)){\n finish = false;\n if (tm == n-1) ng.emplace_back(u);\n }\n }\n }\n if (finish) break;\n tm++;\n }\n ng_cycle = (tm == n);\n if (ng_cycle){\n for (auto v : ng) dist[v] = -dist_inf;\n tm = n;\n while (tm--){\n for (int v = 0; v < n; v++){\n if (dist[v] != -dist_inf) continue;\n for (auto [u, c] : g[v]){\n dist[u] = -dist_inf;\n }\n }\n }\n }\n return dist;\n }\n std::vector<std::vector<Cost>> warshall_floyd(){\n g.build();\n std::vector<std::vector<Cost>> dist(n,std::vector<Cost>(n,dist_inf));\n for (int v = 0; v < n; v++){\n dist[v][v] = 0;\n for (auto [u, c] : g[v]){\n chmin(dist[v][u],c);\n }\n }\n for (int k = 0; k < n; k++){\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n chmin(dist[i][j],dist[i][k]+dist[k][j]);\n }\n }\n }\n return dist;\n }\n const auto operator[](int idx) const { return g[idx]; }\n auto operator[](int idx) { return g[idx]; }\n};\n\n\n} // namespace noya2\n#line 8 \"c.cpp\"\n\npoint<ld> proj(const line<ld> &l, const point<ld> &p) {\n auto ab = l.end1 - l.end0;\n return l.end0 + ab * (dot(ab, p - l.end0) / norm(ab));\n}\n\nld calc2(segment<ld> a, point<ld> b){\n ld len = abs(a.end0 - a.end1);\n auto p = proj(a.as_line(), b);\n ld d1 = abs(a.end0 - p);\n ld d2 = abs(a.end1 - p);\n if (sign(d1+d2-len) == 0){\n return abs(b-p);\n }\n return min(abs(a.end0-b),abs(a.end1-b));\n}\n\nld calc(segment<ld> a, point<ld> b){\n ld le = 0, ri = 1;\n int many = 60;\n auto val = [&](ld p){\n return norm(a.end0 * p + a.end1 * (1-p) - b);\n };\n while (many--){\n ld m1 = (le + le + ri) / 3;\n ld m2 = (le + ri + ri) / 3;\n if (val(m1) < val(m2)){\n ri = m2;\n }\n else {\n le = m1;\n }\n }\n return sqrt(val(le));\n}\n\nld dist(segment<ld> a, segment<ld> b){\n if (has_common_point(a,b)){\n return 0;\n }\n ld ret = 1e18;\n rep(i,2){\n rep(j,2){\n chmin(ret,calc2(b,a.end0));\n swap(a.end0,a.end1);\n }\n swap(a,b);\n }\n return ret;\n}\n\n\nvoid solve1(int n, int m, int l){\n m--, l--;\n vector<point<ld>> ctr(n);\n vector<ld> a(n), r(n);\n rep(i,n){\n in(ctr[i]);\n in(a[i],r[i]);\n }\n graph<ld> g(n*6);\n g.set_inf(1e18);\n auto idx = [&](int i, int e){\n return i * 6 + e;\n };\n rep(i,n){\n rep(j,5){\n g.add_edge(idx(i,j),idx(i,5),0);\n g.add_edge(idx(i,5),idx(i,j),0);\n }\n }\n vector<vector<point<ld>>> vs(n,vector<point<ld>>(5));\n rep(i,n) rep(j,5){\n ld th = pi/2 + a[i]*pi/180 + 4./5*pi * j;\n vs[i][j] = ctr[i] + rot(point<ld>(r[i],0),th);\n }\n vector<vector<segment<ld>>> segs(n,vector<segment<ld>>(5));\n rep(i,n) rep(j,5){\n segs[i][j] = segment<ld>(vs[i][j],vs[i][(j+1)%5]);\n }\n rep(i,n) rep(j,5) rep(ii,n) rep(jj,5){\n g.add_edge(idx(i,j),idx(ii,jj),dist(segs[i][j],segs[ii][jj]));\n }\n ld ans = g.dijkstra(idx(m,5))[idx(l,5)];\n out(ans);\n}\n\nvoid solve(){\n int n, m, l;\n while (true){\n in(n,m,l);\n if (n == 0) return ;\n solve1(n,m,l);\n }\n}\n\nint main(){\n int t = 1; //in(t);\n while (t--) { solve(); }\n}","accuracy":1,"time_ms":810,"memory_kb":28104,"score_of_the_acc":-1.3184,"final_rank":20},{"submission_id":"aoj_2402_10418386","code_snippet":"// #pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace atcoder;\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing vecint = std::vector<int>;\nusing vecll = std::vector<long long>;\nusing vecstr = std::vector<string>;\nusing vecbool = std::vector<bool>;\nusing vecdou = std::vector<double>;\nusing vecpl = std::vector<pair<ll,ll>>;\nusing vec2d = std::vector<vecll>;\nusing vec2di = std::vector<vecint>;\nusing vec2dd = std::vector<vecdou>;\nusing vec2db = std::vector<vecbool>;\nusing pl = pair<long long,long long>;\nusing mint998 = modint998244353;\nusing mint107 = modint1000000007;\nusing mint = modint;\nusing vecmint = std::vector<mint>;\nusing vecmint998 = std::vector<mint998>;\nusing vecmint107 = std::vector<mint107>;\nusing vec2dmint = std::vector<vecmint>; \nusing vec2dmint998 = std::vector<vecmint998>;\nusing vec2dmint107 = std::vector<vecmint107>;\n#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)\n#define rep1(i,n) for (ll i = 1; i <= (ll)(n); i++)\n#define REP(i,l,r) for (ll i = (ll)(l); i < (ll)(r); i++)\n#define rrep(i,n) for (ll i = (ll)(n)-1; i >= 0; i--)\n#define rrep1(i,n) for (ll i = (ll)(n); i > 0; i--)\n#define RREP(i,l,r) for (ll i = (ll)(r)-1; i >= (ll)(l); i--)\n#define all(a) (a).begin(), (a).end()\n#define INF ((1LL<<62)-(1LL<<31))\n#define inr(a,x,b) ((a) <= (x) && (x) < (b))\ntemplate <typename T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvoid ynout(bool x,string Tru=\"Yes\",string Wro=\"No\"){\n if(x){\n cout << Tru << '\\n';\n }else{\n cout << Wro << '\\n';\n }\n}\nll power(ll a,ll b,ll mod=INF){\n long long x=1,y=a%mod;\n while(b>0){\n if(b&1ll){\n x=(x*y)%mod;\n }\n y=(y*y)%mod;\n b>>=1;\n }\n return x%mod;\n}\nll Pdist2(pair<ll,ll> a,pair<ll,ll> b){\n return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);\n}\ndouble Pdist(pair<ll,ll> a,pair<ll,ll> b){\n return sqrt(Pdist2(a,b));\n}\nll PdistM(pair<ll,ll> a,pair<ll,ll> b){\n return abs(a.first-b.first)+abs(a.second-b.second);\n}\nll gcd(ll a,ll b){\n if(b==0){\n return a;\n }else{\n return gcd(b,a%b);\n }\n}\nll lcm(ll a,ll b){\n return a/gcd(a,b)*b;\n}\n\nnamespace geometry {\n // Point : 複素数型を位置ベクトルとして扱う\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\n using D = double;\n using Point = std::complex<D>;\n const D EPS = 1e-7;\n const D PI = std::acos(D(-1));\n\n inline bool equal(const D &a, const D &b) { return std::fabs(a - b) < EPS; }\n\n // 単位ベクトル(unit vector)を求める\n Point unitVector(const Point &a) { return a / std::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(std::cos(theta) * p.real() - std::sin(theta) * p.imag(),\n std::sin(theta) * p.real() + std::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(std::norm(b) < std::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 a = Point(C / A, 0), b = Point(C / A, 1);\n } else if(equal(C, 0)) {\n a = Point(0, C / B), b = Point(1, (C - A) / B);\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 D get_dist() { return std::abs(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 (std::abs(a - c) + std::abs(c - b) < std::abs(a - b) + EPS);\n }\n\n // 直線lと点pの距離を求める\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\n return std::abs(cross(l.b - l.a, p - l.a)) / std::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 std::abs(p - l.a);\n if(dot(l.a - l.b, p - l.b) < EPS) return std::abs(p - l.b);\n return std::abs(cross(l.b - l.a, p - l.a)) / std::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(std::abs(d1), 0) && equal(std::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 ans = std::min(ans, distanceBetweenSegmentAndPoint(s, t.b));\n ans = std::min(ans, distanceBetweenSegmentAndPoint(t, s.a));\n ans = std::min(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) / std::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) / std::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 = std::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, std::abs(c1.r - c2.r))) return 1;\n // 内包している場合\n if(d < std::abs(c1.r - c2.r) - EPS) return 0;\n return 2;\n }\n\n // 2つの円の交点\n std::vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\n std::vector<Point> res;\n int mode = isIntersect(c1, c2);\n // 2つの中心の距離\n D d = std::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 = std::sqrt(c1.r * c1.r - rc1 * rc1);\n if(c1.r - std::abs(rc1) < EPS) rs1 = 0;\n Point e12 = (c2.p - c1.p) / std::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 = std::abs(c.p - p);\n return (equal(d, c.r) || d < c.r - EPS);\n }\n\n // 円cと直線lの交点\n std::vector<Point> crossPoint(const Circle &c, const Line &l) {\n std::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 = std::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 std::vector<Point> tangentToCircle(const Point &p, const Circle &c) {\n return crossPoint(c,\n Circle(p, std::sqrt(std::norm(c.p - p) - c.r * c.r)));\n }\n\n // 円の共通接線\n std::vector<Line> tangent(const Circle &a, const Circle &b) {\n std::vector<Line> ret;\n // 2円の中心間の距離\n D g = std::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 * std::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 std::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 std::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 std::vector<Point> ConvexHull(std::vector<Point> p) {\n int n = (int)p.size(), k = 0;\n std::sort(p.begin(), p.end(), [](const Point &a, const Point &b) {\n return (a.real() != b.real() ? a.real() < b.real()\n : a.imag() < b.imag());\n });\n std::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 std::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 // 凸多角形pを直線lで切断し、その左側を返す\n std::vector<Point> ConvexCut(std::vector<Point> p, Line l) {\n std::vector<Point> ret;\n int sz = (int)p.size();\n for(int i = 0; i < sz; i++) {\n Point now = p[i];\n Point nxt = p[i == sz - 1 ? 0 : i + 1];\n if(ccw(l.a, l.b, now) != -1) ret.emplace_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\n ret.emplace_back(crossPoint(Line(now, nxt), l));\n }\n }\n return ret;\n }\n\n} // namespace geometry\n\nvoid solve(ll n,ll m,ll l);\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n std::cout << std::fixed << std::setprecision(20);\n while(1){\n ll t,p,r;\n cin>>t>>p>>r;\n if(t==0)return 0;\n solve(t,p,r);\n }\n}\n\nvecll dx = {1,0,-1,0};\nvecll dy = {0,1,0,-1};\n\nstruct star{\n ll x,y,a,r;\n vector<geometry::Point> p;\n void f(){\n p.resize(5);\n rep(i,5){\n p[i] = geometry::Point(x-r*sin(geometry::degreeToRadian(a+72*i)),y+r*cos(geometry::degreeToRadian(a+72*i)));\n }\n }\n};\n\ndouble ds(star a,star b){\n double res=INF;\n rep(i,5)rep(j,5){\n geometry::Segment l1(a.p[i],a.p[(i+2)%5]);\n geometry::Segment l2(b.p[j],b.p[(j+2)%5]);\n chmin(res,geometry::distanceBetweenSegments(l1,l2));\n }\n return res;\n}\n\nvoid solve(ll n,ll m,ll l){\n m--;l--;\n vector<star> s(n);\n rep(i,n)cin>>s[i].x>>s[i].y>>s[i].a>>s[i].r;\n rep(i,n)s[i].f();\n vector<vecdou> di(n,vecdou(n,INF));\n rep(i,n)di[i][i]=0;\n rep(i,n)for(int j=i+1;j<n;j++){\n di[i][j]=ds(s[i],s[j]);\n di[j][i]=di[i][j];\n }\n vecdou dist(n,INF);\n dist[m]=0;\n priority_queue<pair<double, ll>, vector<pair<double, ll>>, greater<pair<double, ll>>> pq;\n pq.push({0,m});\n while(!pq.empty()){\n ll pos = pq.top().second; pq.pop();\n rep(to,n){\n if(to==pos)continue;\n double cost = di[pos][to];\n if (dist[to] > dist[pos] + cost) {\n dist[to] = dist[pos] + cost;\n pq.push(make_pair(dist[to], to));\n }\n }\n }\n cout<<dist[l]<<'\\n';\n}","accuracy":1,"time_ms":80,"memory_kb":4224,"score_of_the_acc":-0.0428,"final_rank":4},{"submission_id":"aoj_2402_10417473","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=2100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,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;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n// https://github.com/kth-competitive-programming/kactl/tree/main/content/geometry\ntemplate<class T> ll sgn(T x) { return (x > 0) - (x < 0); }\ntemplate<class T> struct Point {\n using P = Point;\n T x, y;\n explicit Point(T x = 0, T y = 0) : x(x), y(y) {}\n bool operator<(P p) const { return tie(x, y) < tie(p.x, p.y); }\n bool operator==(P p) const { return tie(x, y) == tie(p.x, p.y); }\n P operator+(P p) const { return P(x + p.x, y + p.y); }\n P operator-(P p) const { return P(x - p.x, y - p.y); }\n P operator*(T d) const { return P(x * d, y * d); }\n P operator/(T d) const { return P(x / d, y / d); }\n T dot(P p) const { return x * p.x + y * p.y; }\n T cross(P p) const { return x * p.y - y * p.x; }\n T cross(P a, P b) const { return (a - *this).cross(b - *this); }\n T dist2() const { return x * x + y * y; }\n long double dist() const { return sqrtl(dist2()); }\n // angle to x-axis in interval [-pi, pi]\n double angle() const { return atan2(y, x); }\n P unit() const { return *this / dist(); } // makes dist()=1\n P perp() const { return P(-y, x); } // rotates +90 degrees\n P normal() const { return perp().unit(); }\n // returns point rotated 'a' radians ccw around the origin\n P rotate(double a) const {\n return P(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a));\n }\n friend ostream& operator<<(ostream& os, P p) {\n return os << \"(\" << p.x << \",\" << p.y << \")\";\n }\n};\n\ntemplate<class P> bool onSegment(P s, P e, P p) {\n return p.cross(s, e) == 0 && (s - p).dot(e - p) <= 0;\n}\n\ntemplate<class P> vector<P> segInter(P a, P b, P c, P d) {\n auto oa = c.cross(d, a), ob = c.cross(d, b),\n oc = a.cross(b, c), od = a.cross(b, d);\n // Checks if intersection is single non-endpoint point.\n if(sgn(oa) * sgn(ob) < 0 && sgn(oc) * sgn(od) < 0)\n return {(a * ob - b * oa) / (ob - oa)};\n set<P> s;\n if(onSegment(c, d, a)) s.insert(a);\n if(onSegment(c, d, b)) s.insert(b);\n if(onSegment(a, b, c)) s.insert(c);\n if(onSegment(a, b, d)) s.insert(d);\n return {all(s)};\n}\nusing P = Point<long double>;\nlong double segDist(P& s, P& e, P& p) {\n if(s == e) return (p - s).dist();\n auto d = (e - s).dist2(), t = min(d, max((long double)(0), (p - s).dot(e - s)));\n return ((p - s) * d - (e - s) * t).dist() / d;\n}\n\n\nint N, M, L;\n\nvoid solve();\n// CITRUS CURIO CITY / FREDERIC\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (cin >> N >> M >> L, N) solve();\n}\n\nvoid solve(){\n using ld = long double;\n using P = Point<ld>;\n vector<vector<P>> pts(N);\n const ld pi = acos(-1);\n ld diff = (pi * 144) / 180;\n rep(i, 0, N){\n ld x, y, a, r;\n cin >> x >> y >> a >> r;\n a += 90;\n a /= 180;\n a *= pi;\n rep(j, 0, 6){\n ld X = x + r * cosl(a);\n ld Y = y + r * sinl(a);\n pts[i].push_back(Point<ld>{X, Y});\n a += diff;\n // cout << X << \" \" << Y << \"\\n\";\n }\n }\n vector G(N, vector<ld>(N, INF));\n rep(i, 0, N) rep(j, 0, N){\n rep(k, 0, 5) rep(l, 0, 5){\n\n if (i == j){\n G[i][j] = 0;\n continue;\n }\n if (segInter(pts[i][k], pts[i][k + 1], pts[j][l], pts[j][l + 1]).empty()){\n rep(di, 0, 2) rep(dj, 0, 2){\n chmin(G[i][j], (pts[i][k + di] - pts[j][l + dj]).dist());\n }\n }\n else{\n G[i][j] = 0;\n }\n ld tmp = segDist(pts[i][k], pts[i][k + 1], pts[j][l]);\n chmin(G[i][j], tmp);\n chmin(G[j][i], tmp);\n }\n }\n M--, L--;\n vector<ld> dist(N, INF);\n dist[M] = 0;\n vector<int> seen(N, 0);\n // rep(i, 0, N) vec_out(G[i]);\n rep(rp, 0, N){\n int ind = -1;\n rep(j, 0, N) if (seen[j] == 0){\n if (ind == -1 || dist[ind] > dist[j]) ind = j;\n }\n rep(i, 0, N) chmin(dist[i], dist[ind] + G[ind][i]);\n seen[ind] = 1;\n }\n cout << fixed << setprecision(20) << dist[L] << \"\\n\";\n}","accuracy":1,"time_ms":240,"memory_kb":4216,"score_of_the_acc":-0.1078,"final_rank":7},{"submission_id":"aoj_2402_9556605","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\nusing T = double;\nconst T eps = 1e-12;\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\ndouble PI = 3.14159265358979;\n\nint main() {\nwhile(1) {\n int N, S, G;\n cin >> N >> S >> G;\n if (N == 0) return 0;\n S--, G--;\n vector<vector<Segment>> Seg(N);\n rep(i,0,N) {\n double PX, PY, A, R;\n cin >> PY >> PX >> A >> R;\n A = 72 - A;\n Point p(PX,PY);\n vector<Point> PS;\n rep(j,0,5) {\n double Arg = PI * (j * 144.0 + A) / 180.0;\n PS.push_back(p + polar(R,Arg));\n }\n rep(j,0,5) {\n Seg[i].push_back(Segment(PS[j],PS[(j+1)%5]));\n }\n }\n vector<vector<double>> D(N, vector<double>(N,inf));\n rep(i,0,N) {\n rep(j,0,N) {\n rep(k,0,5) {\n rep(l,0,5) {\n chmin(D[i][j], Dist(Seg[i][k], Seg[j][l]));\n }\n }\n }\n }\n vector<double> DP(N,inf);\n priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> PQ;\n DP[S] = 0;\n PQ.push({0,S});\n while(!PQ.empty()) {\n auto [A,B] = PQ.top();\n PQ.pop();\n if (DP[B] < A) continue;\n rep(i,0,N) {\n if (i == B) continue;\n double NA = A + D[B][i];\n if (chmin(DP[i],NA)) {\n PQ.push({NA,i});\n }\n }\n }\n printf(\"%.12lf\\n\", DP[G]);\n}\n}","accuracy":1,"time_ms":210,"memory_kb":4168,"score_of_the_acc":-0.0936,"final_rank":6},{"submission_id":"aoj_2402_9378491","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing ll = long long;\n#define MOD 1000000007\n#define Mod 998244353\nconst int MAX = 1000000005;\nconst long long INF = 1000000000000000005LL;\nusing namespace std;\n//using namespace atcoder;\n\n\nconst double EPS = 1e-8;\n\nstruct Point {\n\tdouble x, y;\n};\nPoint operator+(const Point& a, const Point& b) {\n return {a.x + b.x, a.y + b.y};\n}\nPoint operator-(const Point& a, const Point& b) {\n return {a.x - b.x, a.y - b.y};\n}\nPoint operator*(const Point& p, const double& a) {\n return {p.x * a, p.y * a};\n}\n\ndouble norm(Point P) {return sqrt(P.x*P.x + P.y*P.y);}\ndouble arg(Point P) {return atan2(P.y, P.x);}\n\ndouble dot(Point P, Point Q) {\n\treturn P.x*Q.x + P.y*Q.y;\n}\n\ndouble cross(Point P, Point Q) {\n\treturn P.x*Q.y - P.y*Q.x;\n}\n\nint ccw(Point a, Point b, Point c) {\n\tif (cross(b - a, c - a) > EPS) return 1;\n\tif (cross(b - a, c - a) < -EPS) return -1;\n\tif (dot(b - a, c - a) < -EPS) return 2;\n\tif (norm(b - a) + EPS < norm(c - a)) return -2;\n\treturn 0;\n}\n\nstruct Segment {\n\tPoint a, b;\n};\n\nbool intersect(Segment s1, Segment s2) {\n bool b1 = (ccw(s1.a, s1.b, s2.a)*ccw(s1.a, s1.b, s2.b) <= 0);\n bool b2 = (ccw(s2.a, s2.b, s1.a)*ccw(s2.a, s2.b, s1.b) <= 0);\n return b1 && b2;\n}\n\nPoint cross_point(Segment s1, Segment s2) {\n\tPoint a = s1.a, b = s1.b, c = s2.a, d = s2.b;\n\tPoint p;\n\tp.x = a.x + cross(a-c, d-c)/cross(d-c, b-a) * (b-a).x;\n\tp.y = a.y + cross(a-c, d-c)/cross(d-c, b-a) * (b-a).y;\n\treturn p;\n}\n\nPoint projection(Point p1, Point p2, Point p) {\n return p1 + (p2 - p1) * (dot(p - p1, p2 - p1)/pow(norm(p2 - p1), 2));\n}\n\nbool on_line(Segment s, Point p) {\n double norm1 = norm(p - s.a), norm2 = norm(p - s.b), norm3 = norm(s.b - s.a);\n return (norm1 + EPS < norm3 && norm2 + EPS < norm3);\n}\n\ndouble distance(Segment s, Point p) {\n Point q = projection(s.a, s.b, p);\n if (on_line(s, q)) return norm(p - q);\n else return min(norm(s.a - p), norm(s.b - p));\n}\n\ndouble distance(Segment s1, Segment s2) {\n if (intersect(s1, s2)) return 0;\n return min({\n distance(s1, s2.a), distance(s1, s2.b), distance(s2, s1.a), distance(s2, s1.b)\n });\n}\n\nusing d_i = pair<double, int>;\n\n\nbool solve() {\n int N, M, L;\n cin >> N >> M >> L;\n if (N == 0 && M == 0 && L == 0) return false;\n M--; L--;\n vector<int> X(N), Y(N), A(N), R(N);\n for (int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> A[i] >> R[i];\n vector<vector<double>> cost(N, vector<double>(N, 1e+10));\n for (int i = 0; i < N-1; i++) {\n for (int j = i+1; j < N; j++) {\n for (int k = 0; k < 5; k++) {\n for (int l = 0; l < 5; l++) {\n vector<Point> P(4);\n vector<double> angle(4);\n angle[0] = (double)(A[i] + 72*k)/180*M_PI; angle[1] = (double)(A[i] + 72*(k + 2))/180*M_PI;\n angle[2] = (double)(A[j] + 72*l)/180*M_PI; angle[3] = (double)(A[j] + 72*(l + 2))/180*M_PI;\n for (int idx = 0; idx < 2; idx++) P[idx] = {X[i] - R[i]*sin(angle[idx]), Y[i] + R[i]*cos(angle[idx])};\n for (int idx = 0; idx < 2; idx++) P[idx+2] = {X[j] - R[j]*sin(angle[idx+2]), Y[j] + R[j]*cos(angle[idx+2])};\n Segment s1 = {P[0], P[1]}, s2 = {P[2], P[3]};\n cost[i][j] = min(cost[i][j], distance(s1, s2));\n cost[j][i] = min(cost[j][i], distance(s1, s2));\n }\n }\n }\n }\n priority_queue<d_i, vector<d_i>, greater<d_i>> pq;\n vector<double> dist(N, 1e+10);\n pq.push({0, M});\n dist[M] = 0;\n while (pq.size()) {\n auto [d, v] = pq.top();\n pq.pop();\n if (d > dist[v] + EPS) continue;\n for (int nv = 0; nv < N; nv++) {\n if (nv == v) continue;\n if (d + cost[v][nv] > dist[nv] - EPS) continue;\n dist[nv] = d + cost[v][nv];\n pq.push({dist[nv], nv});\n }\n }\n cout << fixed << setprecision(12) << dist[L] << endl;\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(0); cin.tie();\n while (solve()) {}\n}","accuracy":1,"time_ms":490,"memory_kb":4036,"score_of_the_acc":-0.2025,"final_rank":13},{"submission_id":"aoj_2402_9333587","code_snippet":"#include <bits/stdc++.h>\n\n#include <algorithm>\n#include <cmath>\n#include <iterator>\n#include <utility>\n#include <vector>\n\nusing Real = long double;\nconstexpr Real EPS = 1e-10;\nconst Real PI = std::acos(-1);\n\nint sign(Real x) {\n return x < -EPS ? -1 : x > EPS ? 1 : 0;\n}\n\nbool eq(Real lhs, Real rhs) {\n return sign(rhs - lhs) == 0;\n}\n\nbool lte(Real lhs, Real rhs) {\n return sign(rhs - lhs) >= 0;\n}\n\nbool lt(Real lhs, Real rhs) {\n return sign(rhs - lhs) > 0;\n}\n\nbool gte(Real lhs, Real rhs) {\n return lte(rhs, lhs);\n}\n\nbool gt(Real lhs, Real rhs) {\n return lt(rhs, lhs);\n}\n\nstruct Point {\n Real x;\n Real y;\n Point(Real x = 0, Real y = 0): x(x), y(y) {}\n Point& operator+=(Point rhs) {\n this->x += rhs.x;\n this->y += rhs.y;\n return *this;\n }\n Point& operator-=(Point rhs) {\n this->x -= rhs.x;\n this->y -= rhs.y;\n return *this;\n }\n Point& operator*=(Real k) {\n this->x *= k;\n this->y *= k;\n return *this;\n }\n Point& operator/=(Real k) {\n this->x /= k;\n this->y /= k;\n return *this;\n }\n friend Point operator+(Point lhs, Point rhs) {\n return lhs += rhs;\n }\n friend Point operator-(Point lhs, Point rhs) {\n return lhs -= rhs;\n }\n friend Point operator*(Point p, Real k) {\n return p *= k;\n }\n friend Point operator/(Point p, Real k) {\n return p /= k;\n }\n friend Point operator*(Real k, Point p) {\n return p * k;\n }\n friend Point operator/(Real k, Point p) {\n return p / k;\n }\n friend bool operator==(Point lhs, Point rhs) {\n return eq(lhs.x, rhs.x) && eq(lhs.y, rhs.y);\n }\n friend bool operator<(Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n }\n friend bool operator>(Point lhs, Point rhs) {\n return rhs < lhs;\n }\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = Points;\nusing Vector = Point;\n\nReal norm(Vector p) {\n return p.x * p.x + p.y * p.y;\n}\n\nReal abs(Vector p) {\n return std::sqrt(norm(p));\n}\n\nReal dot(Vector lhs, Vector rhs) {\n return lhs.x * rhs.x + lhs.y * rhs.y;\n}\n\nReal cross(Vector lhs, Vector rhs) {\n return lhs.x * rhs.y - lhs.y * rhs.x;\n}\n\nint ccw(Point p0, Point p1, Point p2) {\n Vector a = p1 - p0;\n Vector b = p2 - p0;\n\n if (cross(a, b) > EPS) return 1;\n\n if (cross(a, b) < -EPS) return -1;\n\n if (dot(a, b) < 0) return 2;\n\n if (norm(a) < norm(b)) return -2;\n\n return 0;\n}\n\nstruct Circle {\n Real r;\n Point c;\n Circle() {}\n Circle(Real r, Point c): r(r), c(c) {}\n};\n\nstruct Segment {\n Segment() {}\n Segment(Point p0, Point p1): p0(p0), p1(p1) {}\n Point p0, p1;\n};\n\nstruct Line {\n Line() {}\n Line(Point p0, Point p1): p0(p0), p1(p1) {}\n explicit Line(Segment s): p0(s.p0), p1(s.p1) {}\n Point p0, p1;\n};\n\nReal distance(Point lhs, Point rhs) {\n return abs(rhs - lhs);\n}\n\nReal distance(Line l, Point p) {\n return std::abs(cross(l.p1 - l.p0, p - l.p0)) / abs(l.p1 - l.p0);\n}\n\nReal distance(Segment s, Point p) {\n if (dot(s.p1 - s.p0, p - s.p0) < 0) {\n return distance(p, s.p0);\n }\n if (dot(s.p0 - s.p1, p - s.p1) < 0) {\n return distance(p, s.p1);\n }\n return distance(Line(s), p);\n}\n\nbool intersect(Segment lhs, Segment rhs) {\n return ccw(lhs.p0, lhs.p1, rhs.p0) * ccw(lhs.p0, lhs.p1, rhs.p1) <= 0\n && ccw(rhs.p0, rhs.p1, lhs.p0) * ccw(rhs.p0, rhs.p1, lhs.p1) <= 0;\n}\n\nbool intersect(Segment s, Point p) {\n return ccw(s.p0, s.p1, p) == 0;\n}\n\nReal distance(Segment lhs, Segment rhs) {\n if (intersect(lhs, rhs)) {\n return Real(0);\n }\n return std::min({distance(lhs, rhs.p0), distance(lhs, rhs.p1), distance(rhs, lhs.p0), distance(rhs, lhs.p1)});\n}\n\nbool parallel(Vector lhs, Vector rhs) {\n return eq(cross(lhs, rhs), 0);\n}\n\nbool parallel(Segment lhs, Segment rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool parallel(Line lhs, Line rhs) {\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Line lhs, Line rhs) {\n Real a = cross(lhs.p1 - lhs.p0, rhs.p1 - rhs.p0);\n Real b = cross(lhs.p1 - lhs.p0, lhs.p1 - rhs.p0);\n return rhs.p0 + (rhs.p1 - rhs.p0) * b / a;\n}\n\nbool intersect(Line l, Segment s) {\n return ccw(l.p0, l.p1, s.p0) * ccw(l.p0, l.p1, s.p1) <= 0;\n}\n\nbool intersect(Circle c, Line l) {\n return lte(distance(l, c.c), c.r);\n}\n\nbool intersect(Circle c, Point p) {\n return eq(distance(c.c, p), c.r);\n}\n\nint intersect(Circle lhs, Circle rhs) {\n if (gt(lhs.r, rhs.r)) std::swap(lhs, rhs);\n Real d = distance(lhs.c, rhs.c);\n if (lt(lhs.r + rhs.r, d)) return 4;\n if (eq(lhs.r + rhs.r, d)) return 3;\n if (gt(lhs.r + d, rhs.r)) return 2;\n if (eq(lhs.r + d, rhs.r)) return 1;\n return 0;\n}\n\nbool orthogonal(Vector lhs, Vector rhs) {\n return eq(dot(lhs, rhs), 0);\n}\n\nbool orthogonal(Segment lhs, Segment rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nbool orthogonal(Line lhs, Line rhs) {\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\n}\n\nPoint crosspoint(Segment lhs, Segment rhs) {\n Real d0 = distance(Line(lhs.p0, lhs.p1), rhs.p0);\n Real d1 = distance(Line(lhs.p0, lhs.p1), rhs.p1);\n return rhs.p0 + (rhs.p1 - rhs.p0) * (d0 / (d0 + d1));\n}\n\nReal arg(Vector p) {\n return std::atan2(p.y, p.x);\n}\n\nVector polar(Real a, Real r) {\n return Point(std::cos(r) * a, std::sin(r) * a);\n}\n\nPoint rotate(Point p, Real t) {\n Point v = polar(1, t);\n return Point(p.x * v.x - p.y * v.y, p.x * v.y + p.y * v.x);\n}\n\nReal angle(Point p0, Point p1, Point p2) {\n Real a = arg(p0 - p1);\n Real b = arg(p2 - p1);\n if (gt(a, b)) std::swap(a, b);\n return std::min(b - a, 2 * PI - (b - a));\n}\n\nPoints crosspoint(Circle lhs, Circle rhs) {\n Real d = abs(lhs.c - rhs.c);\n if (eq(d, lhs.r + rhs.r)) return {lhs.c + lhs.r * (rhs.c - lhs.c) / d};\n Real a = std::acos((lhs.r * lhs.r + d * d - rhs.r * rhs.r) / (2 * lhs.r * d));\n Real t = arg(rhs.c - lhs.c);\n return {lhs.c + polar(lhs.r, t + a), lhs.c + polar(lhs.r, t - a)};\n}\n\nPoint projection(Segment s, Point p) {\n Vector a = p - s.p0;\n Vector b = s.p1 - s.p0;\n Real t = dot(a, b) / norm(b);\n return s.p0 + t * b;\n}\n\nPoint projection(Line l, Point p) {\n Vector a = p - l.p0;\n Vector b = l.p1 - l.p0;\n Real t = dot(a, b) / norm(b);\n return l.p0 + t * b;\n}\n\nPoint reflection(Segment s, Point p) {\n return p + (projection(s, p) - p) * Real(2);\n}\n\nPoint reflection(Line l, Point p) {\n return p + (projection(l, p) - p) * Real(2);\n}\n\nPoints crosspoint(Circle c, Line l) {\n Vector p = projection(l, c.c);\n Real t = std::sqrt(c.r * c.r - norm(c.c - p));\n if (eq(t, 0)) return {p};\n Vector e = (l.p1 - l.p0) / abs(l.p1 - l.p0);\n return {p + t * e, p + -t * e};\n}\n\nReal area(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += cross(poly[i], poly[(i + 1) % n]);\n }\n return result / 2;\n}\n\nReal perimeter(Polygon poly) {\n int n = poly.size();\n Real result = 0;\n for (int i = 0; i < n; i++) {\n result += abs(poly[i] - poly[(i + 1) % n]);\n }\n return result;\n}\n\nbool convex(Polygon poly) {\n int n = poly.size();\n for (int i = 0; i < n; i++) {\n if (ccw(poly[i], poly[(i + 1) % n], poly[(i + 2) % n]) == -1) return false;\n }\n return true;\n}\n\nint contain(Polygon poly, Point p) {\n int n = poly.size();\n bool parity = false;\n for (int i = 0; i < n; i++) {\n Point a = poly[i] - p;\n Point b = poly[(i + 1) % n] - p;\n if (gt(a.y, b.y)) std::swap(a, b);\n if (lte(a.y, 0) && lt(0, b.y) && lt(cross(a, b), 0)) parity ^= true;\n if (eq(cross(a, b), 0) && lte(dot(a, b), 0)) return 1;\n }\n return (parity ? 2 : 0);\n}\n\nPolygon convex_hull(Points points) {\n std::sort(points.begin(), points.end(), [](Point lhs, Point rhs) {\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\n return lt(lhs.x, rhs.x);\n });\n int n = points.size();\n Points lower, upper;\n lower.push_back(points[n - 1]);\n lower.push_back(points[n - 2]);\n upper.push_back(points[0]);\n upper.push_back(points[1]);\n for (int i = n - 3; i >= 0; i--) {\n for (int m = lower.size(); m >= 2 && ccw(lower[m - 2], lower[m - 1], points[i]) >= 0; m--) {\n lower.pop_back();\n }\n lower.push_back(points[i]);\n }\n for (int i = 2; i < n; i++) {\n for (int m = upper.size(); m >= 2 && ccw(upper[m - 2], upper[m - 1], points[i]) >= 0; m--) {\n upper.pop_back();\n }\n upper.push_back(points[i]);\n }\n std::reverse(lower.begin(), lower.end());\n std::copy(std::next(upper.rbegin()), std::prev(upper.rend()), std::back_inserter(lower));\n return lower;\n}\n\nPolygon convex_cut(Polygon poly, Line l) {\n int n = poly.size();\n Polygon res;\n for (int i = 0; i < n; i++) {\n Point a = poly[i];\n Point b = poly[(i + 1) % n];\n if (ccw(l.p0, l.p1, a) != -1) res.push_back(a);\n if (ccw(l.p0, l.p1, a) * ccw(l.p0, l.p1, b) == -1) {\n res.push_back(crosspoint(l, Line(a, b)));\n }\n }\n return res;\n}\n\nLine bisector(Point p0, Point p1, Point p2) {\n return Line(p1, p1 + polar(1, angle(p0, p1, p2) / 2));\n}\n\nCircle incircle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(bisector(p0, p1, p2), bisector(p1, p2, p0));\n Real r = std::abs(2 * area({p0, p1, p2}) / perimeter({p0, p1, p2}));\n return Circle(r, c);\n}\n\nLine perpendicular(Line l, Point p) {\n Vector v = l.p1 - l.p0;\n return Line(p, p + Vector(-v.y, v.x));\n}\n\nLine perpendicular_bisector(Segment s) {\n return perpendicular(Line(s), (s.p0 + s.p1) / 2);\n}\n\nCircle circumscribed_circle(Point p0, Point p1, Point p2) {\n Point c = crosspoint(perpendicular_bisector(Segment(p0, p1)), perpendicular_bisector(Segment(p0, p2)));\n return Circle(distance(p0, c), c);\n}\n\nReal area(Circle c) {\n return c.r * c.r * PI;\n}\n\nPoints tangent(Circle c, Point p) {\n return crosspoint(c, Circle(std::sqrt(norm(c.c - p) - c.r * c.r), p));\n}\n\nReal calc(std::vector<Segment> lhs, std::vector<Segment> rhs) {\n Real result = 1e18;\n for (int i = 0; i < 5; i++) {\n for (int j = 0; j < 5; j++) {\n result = std::min(result, distance(lhs[i], rhs[j]));\n }\n }\n return result;\n}\n\nint solve() {\n int n, s, t;\n std::cin >> n >> s >> t;\n s--;\n t--;\n if (n == 0) return 1;\n using Segments = std::vector<Segment>;\n std::vector<Segments> stars;\n for (int i = 0; i < n; i++) {\n Point c;\n std::cin >> c.x >> c.y;\n int a, r;\n std::cin >> a >> r;\n Polygon poly;\n Point init(0, r);\n for (int j = 0; j < 360; j += 72) {\n Real t = (2 * PI) * (Real((j + a) % 360) / 360);\n poly.push_back(c + rotate(init, t));\n }\n Segments segments;\n segments.push_back(Segment(poly[0], poly[2]));\n segments.push_back(Segment(poly[0], poly[3]));\n segments.push_back(Segment(poly[1], poly[3]));\n segments.push_back(Segment(poly[1], poly[4]));\n segments.push_back(Segment(poly[2], poly[4]));\n stars.push_back(segments);\n }\n constexpr Real INF = 1e18;\n std::vector dist(n, std::vector<Real>(n, INF));\n for (int i = 0; i < n; i++) dist[i][i] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i == j) continue;\n dist[i][j] = calc(stars[i], stars[j]);\n }\n }\n for (int k = 0; k < n; k++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n dist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n std::cout << std::fixed << std::setprecision(10);\n std::cout << dist[s][t] << std::endl;\n return 0;\n}\n\nint main() {\n while (!solve())\n ;\n}","accuracy":1,"time_ms":350,"memory_kb":4124,"score_of_the_acc":-0.149,"final_rank":8},{"submission_id":"aoj_2402_9309743","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\n// template<class T>\n// void chmax(T& p, T q) { if (p < q)p = q; };\n\n#include<complex>\n#define mod 1000000007\nusing ll = long long;\nconst int INF = 1000000000;\nconst ll LINF = 1001002003004005006ll;\nint dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 };\n// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\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\nstruct IOSetup {\n IOSetup() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n }\n} iosetup;\n\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v)is >> x;\n return is;\n}\n\n#line 1 \"Geometry/template.cpp\"\n// Real\nusing Real = double;\nconst Real EPS = 1e-6;\nconst Real pi = acosl(-1);\n\n// Point\nusing Point = complex<Real>;\nistream& operator>>(istream& is, Point& p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\nostream& operator<<(ostream& os, Point& p) {\n return os << fixed << setprecision(12) << p.real() << ' ' << p.imag();\n}\ninline bool eq(Real a, Real b) {\n return fabs(a - b) < EPS;\n}\nPoint operator*(const Point& p, const Real& d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\n// Line\nstruct Line {\n Point p1, p2;\n Line() = default;\n Line(Point p1, Point p2) :p1(p1), p2(p2) {}\n //Ax + By = C\n Line(Real A, Real B, Real C) {\n if (eq(A, 0)) p1 = Point(0, C / B), p2 = Point(1, C / B);\n else if (eq(B, 0))p1 = Point(C / A, 0), p2 = Point(C / A, 1);\n else p1 = Point(0, C / B), p2 = Point(C / A, 0);\n }\n};\n\n// Segment\nstruct Segment :Line {\n Segment() = default;\n Segment(Point p1, Point p2) :Line(p1, p2) {}\n};\n\nPoint rotate(Real theta, Point p) {\n return Point(cos(theta) * real(p) - sin(theta) * imag(p), sin(theta) * real(p) + cos(theta) * imag(p));\n}\nReal dot(Point a, Point b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n#line 1 \"Geometry/Cross.cpp\"\n// Cross\nReal cross(Point a, Point b) {\n return real(a) * imag(b) - imag(a) * real(b);\n}\n#line 1 \"Geometry/CounterClockWise.cpp\"\n// ccw (counter clockwise) (Requires: cross, dot)\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_1_C\nint ccw(Point a, Point b, Point c) {\n b -= a; c -= a;\n if (cross(b, c) > EPS) return 1;//COUNTER CLOCKWISE\n else if (cross(b, c) < -EPS) return -1;//CLOCKWISE\n else if (dot(b, c) < 0) return 2;//c--a--b ONLINE BACK\n else if (norm(b) < norm(c)) return -2;//a--b--c ONLINE FRONT\n else return 0;//a--c--b ON SEGMENT\n}\n\nPoint projection(Segment l, Point p) {\n Real k = dot(l.p1 - l.p2, p - l.p1) / norm(l.p1 - l.p2);\n return l.p1 + (l.p1 - l.p2) * k;\n}\n\nbool intersect(Line l, Point p) {\n return abs(ccw(l.p1, l.p2, p)) != 1;\n}\nbool intersect(Segment s, Point p) {\n return ccw(s.p1, s.p2, p) == 0;\n}\nbool intersect(Segment s, Segment t) {\n return ccw(s.p1, s.p2, t.p1) * ccw(s.p1, s.p2, t.p2) <= 0 && ccw(t.p1, t.p2, s.p1) * ccw(t.p1, t.p2, s.p2) <= 0;\n}\nReal dis(Segment s, Point p) {\n Point r = projection(s, p);\n if (intersect(s, r)) return abs(r - p);\n return min(abs(s.p1 - p), abs(s.p2 - p));\n}\nReal dis(Segment a, Segment b) {\n if (intersect(a, b)) return 0;\n return min({ dis(a,b.p1),dis(a,b.p2),dis(b,a.p1),dis(b,a.p2) });\n}\n\nll N,M,L;\nvoid solve(ll N,ll M,ll L) {\n vector<Point> P(5*N);\n rep(i,N){\n double x,y,a,r;\n cin>>x>>y>>a>>r;\n rep(j,5)P[i*5+j]={x,y};\n Point Q={r,0};\n Q=rotate(a/180.0*pi+pi/2.0,Q);\n rep(j,5){\n P[i*5+j]+=Q;\n Q=rotate(pi/5.0*2.0,Q);\n }\n }\n vector<Segment> S(5*N);\n rep(i,N){\n rep(j,5){\n S[i*5+j]=Segment(P[i*5+j],P[i*5+(j+2)%5]);\n }\n }\n priority_queue<pair<double,ll>,vector<pair<double,ll>>,greater<pair<double,ll>>> Q;\n vector<double> D(5*N,1e18);\n rep(j,5){\n Q.push({0,M*5-5+j});\n D[M*5-5+j]=0.0;\n }\n vector<bool> seen(5*N,0);\n while(!Q.empty()){\n double d=Q.top().first;\n ll n=Q.top().second;\n Q.pop();\n if(seen[n])continue;\n seen[n]=1;\n rep(i,5*N){\n double nd=d+dis(S[i],S[n]);\n if(D[i]>nd+EPS){\n D[i]=nd;\n Q.push({D[i],i});\n }\n }\n }\n double an=1e18;\n rep(j,5)chmin(an,D[L*5-5+j]);\n cout<<fixed<<setprecision(15)<<an<<endl;\n\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n \n while (cin >> N>>M>>L) {\n if (N == 0)return 0;\n solve(N,M,L);\n }\n\n}","accuracy":1,"time_ms":800,"memory_kb":3880,"score_of_the_acc":-0.3226,"final_rank":16},{"submission_id":"aoj_2402_9156234","code_snippet":"// (◕ᴗ◕✿)\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nusing P = complex<ld>;\nusing L = pair<P, P>;\nconst ld eps = 1e-9;\nld dot(P a, P b){return (conj(a) * b).real();}\nld cross(P a, P b){return (conj(a) * b).imag();}\n\nP proj(P a, L b){ //bに対するaの射影\n P p1 = b.second - b.first, p2 = a - b.first;\n return (dot(p1, p2) / (abs(p1) * abs(p1))) * p1 + b.first;\n}\nP refl(P a, L b){return a + P{2, 0} * (proj(a, b) - a);} //bに対するaの反射\n\nint ccw(P a, P b, P c) { // 点の進行方向\n b -= a; 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) < -eps) return +2; // c--a--b on line\n if (abs(b) < abs(c)) return -2; // a--b--c on line or a==b\n return 0; // a--c--b on line or a==c or b==c\n}\n\n// 直線と点\nbool isecLP(P a1, P a2, P b) {\n return abs(ccw(a1, a2, b)) != 1; // return EQ(cross(a2-a1, b-a1), 0); と等価\n}\n\n// 直線と直線\nbool isecLL(P a1, P a2, P b1, P b2) {\n return !isecLP(a2-a1, b2-b1, 0) || isecLP(a1, b1, b2);\n}\n\n// 直線と線分\nbool isecLS(P a1, P a2, P b1, P b2) {\n return cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < eps;\n}\n\n// 線分と線分\nbool isecSS(P a1, P a2, P b1, P b2) {\n return ccw(a1, a2, b1)*ccw(a1, a2, b2) <= 0 &&\n ccw(b1, b2, a1)*ccw(b1, b2, a2) <= 0;\n}\n\n// 線分と点\nbool isecSP(P a1, P a2, P b) {\n return !ccw(a1, a2, b);\n}\n\nld distLP(P a1, P a2, P p) {\n return abs(proj(p, {a1, a2}) - p);\n}\n\nld distLL(P a1, P a2, P b1, P b2) {\n return isecLL(a1, a2, b1, b2) ? 0 : distLP(a1, a2, b1);\n}\n\nld distLS(P a1, P a2, P b1, P b2) {\n return isecLS(a1, a2, b1, b2) ? 0 : min(distLP(a1, a2, b1), distLP(a1, a2, b2));\n}\n\nld distSP(P a1, P a2, P p) {\n P r = proj(p, {a1, a2});\n if (isecSP(a1, a2, r)) return abs(r-p);\n return min(abs(a1-p), abs(a2-p));\n}\n\nld distSS(P a1, P a2, P b1, P b2) {\n if (isecSS(a1, a2, b1, b2)) return 0;\n return min(min(distSP(a1, a2, b1), distSP(a1, a2, b2)),\n min(distSP(b1, b2, a1), distSP(b1, b2, a2)));\n}\n\ntuple<vld, vi> dijkstra(int s, int N, vv<pair<int, ld>> &g){\n using P = pair<ld, int>;\n vld dist(N, INF);\n vi bef(N);\n priority_queue<P, vc<P>, greater<P>> q;\n dist[s] = 0;\n q.push({0, s});\n while (!q.empty()){\n auto [c, now] = q.top();q.pop();\n if (dist[now] < c) continue;\n for (auto&& [nxt, nc]: g[now]) if (dist[nxt] > c + nc){\n dist[nxt] = c + nc;\n bef[nxt] = now;\n q.push({dist[nxt], nxt}); \n }\n }\n return {dist, bef};\n}\n\n\nld solve(int N, int s, int t){\n vc<tuple<P, ld, ld>> point;\n rep(i, N){\n ld x, y, a, r; cin >> x >> y >> a >> r;\n point.push_back({{x, y}, a, r});\n }\n vv<pair<int, ld>> g(N);\n vv<P> ele;\n for (auto [o, a, r] : point){\n ele.push_back({});\n rep(i, 5){\n ele.back().push_back(o + P{r, 0} * P{cos((90 + a + 144 * i) * pi / (ld)180), sin((90 + a + 144 * i) * pi / (ld)180)});\n }\n }\n rep(j, N) rep(i, j){\n ld mini = inf;\n rep(a, 5) rep(b, 5){\n mini = min(mini, abs(ele[i][a] - ele[j][b]));\n mini = min(mini, distSP(ele[i][a], ele[i][(a + 1) % 5], ele[j][b]));\n mini = min(mini, distSP(ele[j][b], ele[j][(b + 1) % 5], ele[i][a]));\n if (isecSS(ele[i][a], ele[i][(a + 1) % 5], ele[j][b], ele[j][(b + 1) % 5])) mini = 0;\n }\n g[i].push_back({j, mini});\n g[j].push_back({i, mini});\n }\n auto [dist, bef] = dijkstra(s, N, g);\n return dist[t];\n}\n\nint main(){\n vc<ld> ans;\n while (true){\n int N, s, t; cin >> N >> s >> t; s--; t--;\n if (N == 0) break;\n ans.push_back(solve(N, s, t));\n }\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\n}","accuracy":1,"time_ms":700,"memory_kb":4320,"score_of_the_acc":-0.2998,"final_rank":14},{"submission_id":"aoj_2402_8496300","code_snippet":"#include <bits/stdc++.h>\n\n\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nusing Real = long double;\nconstexpr Real EPS{1e-12};\n\nnamespace internal {\n\nconstexpr i32 negative{-1};\nconstexpr i32 zero{};\nconstexpr i32 positive{1};\n\n} // namespace internal\n\nconstexpr i32 Sign(Real value) {\n if (value < -EPS) return internal::negative;\n if (value > EPS) return internal::positive;\n return internal::zero;\n}\n\nconstexpr bool Zero(Real value) {\n return Sign(value) == internal::zero;\n}\n\nconstexpr bool Positive(Real value) {\n return Sign(value) == internal::positive;\n}\n\nconstexpr bool Negative(Real value) {\n return Sign(value) == internal::negative;\n}\n\nconstexpr bool Equal(Real a, Real b) {\n return Zero(a - b);\n}\n\nconstexpr bool Smaller(Real a, Real b) {\n return Negative(a - b);\n}\n\nconstexpr bool Bigger(Real a, Real b) {\n return Positive(a - b);\n}\n\nconstexpr Real Square(Real value) {\n return (Zero(value) ? value : value * value);\n}\n\nconstexpr Real Sqrt(Real value) {\n assert(!Negative(value));\n return (Zero(value) ? value : sqrtl(value));\n}\n\nconstexpr Real Abs(Real value) {\n return (Negative(value) ? -value : value);\n}\n\n} // namespace geometryR2\n \n} // namespace zawa\n\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nconstexpr Real PI{acosl(-1)};\nconstexpr Real TAU{static_cast<Real>(2) * PI};\n\nconstexpr Real ArcToRadian(Real arc) {\n return (arc * PI) / static_cast<Real>(180);\n}\n\nconstexpr Real RadianToArc(Real radian) {\n return (radian * static_cast<Real>(180)) / PI;\n}\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nclass Point {\nprivate:\n Real x_{}, y_{};\npublic:\n /* constructor */\n Point() = default;\n Point(Real x, Real y) : x_{x}, y_{y} {}\n\n /* getter, setter */\n Real x() const {\n return x_;\n }\n Real& x() {\n return x_;\n }\n Real y() const {\n return y_;\n }\n Real& y() {\n return y_;\n }\n\n /* operator */\n Point& operator+=(const Point& rhs) {\n x_ += rhs.x();\n y_ += rhs.y();\n return *this;\n }\n friend Point operator+(const Point& lhs, const Point& rhs) {\n return Point{lhs} += rhs;\n }\n Point operator+() const {\n return *this;\n }\n Point& operator-=(const Point& rhs) {\n x_ -= rhs.x();\n y_ -= rhs.y();\n return *this;\n }\n friend Point operator-(const Point& lhs, const Point& rhs) {\n return Point{lhs} -= rhs;\n }\n Point operator-() const {\n return Point{} - *this;\n }\n Point& operator*=(Real k) {\n x_ *= k;\n y_ *= k;\n return *this;\n }\n friend Point operator*(Real k, const Point& p) {\n return Point{p} *= k;\n }\n friend Point operator*(const Point& p, Real k) {\n return Point{p} *= k;\n }\n Point& operator/=(Real k) {\n assert(!Zero(k));\n x_ /= k;\n y_ /= k;\n return *this;\n }\n friend Point operator/(Real k, const Point& p) {\n return Point{p} /= k;\n }\n friend Point operator/(const Point& p, Real k) {\n return Point{p} /= k;\n }\n friend bool operator==(const Point& lhs, const Point& rhs) {\n return Equal(lhs.x(), rhs.x()) and Equal(lhs.y(), rhs.y());\n }\n friend bool operator!=(const Point& lhs, const Point& rhs) {\n return !Equal(lhs.x(), rhs.x()) or !Equal(lhs.y(), rhs.y());\n }\n friend bool operator<(const Point& lhs, const Point& rhs) {\n return Smaller(lhs.x(), rhs.x()) or \n (Equal(lhs.x(), rhs.x()) and Smaller(lhs.y(), rhs.y()));\n }\n friend bool operator<=(const Point& lhs, const Point& rhs) {\n return Smaller(lhs.x(), rhs.x()) or \n (Equal(lhs.x(), rhs.x()) and (Smaller(lhs.y(), rhs.y()) or Equal(lhs.y(), rhs.y())));\n }\n friend bool operator>(const Point& lhs, const Point& rhs) {\n return Bigger(lhs.x(), rhs.x()) or\n (Equal(lhs.x(), rhs.x()) and Bigger(lhs.y(), rhs.y()));\n }\n friend bool operator>=(const Point& lhs, const Point& rhs) {\n return Bigger(lhs.x(), rhs.x()) or\n (Equal(lhs.x(), rhs.x()) and (Bigger(lhs.y(), rhs.y()) or Equal(lhs.y(), rhs.y())));\n }\n friend std::istream& operator>>(std::istream& is, Point& p) {\n is >> p.x_ >> p.y_;\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const Point& p) {\n os << '(' << p.x_ << ',' << p.y_ << ')';\n return os;\n }\n \n /* member function */\n Real normSquare() const {\n return Square(x_) + Square(y_);\n }\n Real norm() const {\n return Sqrt(normSquare());\n }\n void normalize() {\n assert((*this) != Point{});\n (*this) /= norm(); \n }\n Point normalized() const {\n Point res{*this};\n res.normalize();\n return res;\n }\n Point rotated(Real radian) const {\n return Point{\n x_ * cosl(radian) - y_ * sinl(radian),\n x_ * sinl(radian) + y_ * cosl(radian)\n };\n }\n void rotate(Real radian) {\n *this = rotated(radian); \n }\n Point rotatedByArc(Real arc) const {\n return rotated(ArcToRadian(arc));\n }\n void rotateByArc(Real arc) {\n *this = rotatedByArc(arc);\n }\n Real argument() const {\n return (Negative(y_) ? TAU : static_cast<Real>(0)) + atan2l(y_, x_);\n }\n Real argumentByArc() const {\n return RadianToArc(argument());\n }\n\n /* friend function */\n friend Real Dot(const Point& lhs, const Point& rhs) {\n return lhs.x() * rhs.x() + lhs.y() * rhs.y();\n }\n friend Real Cross(const Point& lhs, const Point& rhs) {\n return lhs.x() * rhs.y() - lhs.y() * rhs.x();\n }\n friend Real Argument(const Point& lhs, const Point& rhs) {\n return rhs.argument() - lhs.argument();\n }\n friend bool ArgComp(const Point& lhs, const Point& rhs) {\n return Smaller(lhs.argument(), rhs.argument());\n }\n};\n\nusing Vector = Point;\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nenum RELATION {\n // p0 -> p1 -> p2の順で直線上に並んでいる\n ONLINE_FRONT = -2,\n // (p1 - p0) -> (p2 - p0)が時計回りになっている\n CLOCKWISE,\n // p0 -> p2 -> p1の順で直線上に並んでいる\n ON_SEGMENT,\n // (p1 - p0) -> (p2 - p0)が反時計回りになっている\n COUNTER_CLOCKWISE,\n // p2 -> p0 -> p1、またはp1 -> p0 -> p2の順で直線上に並んでいる\n ONLINE_BACK\n};\n\nRELATION Relation(const Point& p0, const Point& p1, const Point& p2) {\n Point a{p1 - p0}, b{p2 - p0};\n if (Positive(Cross(a, b))) return COUNTER_CLOCKWISE;\n if (Negative(Cross(a, b))) return CLOCKWISE;\n if (Negative(Dot(a, b))) return ONLINE_BACK;\n if (Smaller(a.normSquare(), b.normSquare())) return ONLINE_FRONT;\n return ON_SEGMENT;\n};\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nReal Distance(const Point& p0, const Point& p1) {\n return Point{p1 - p0}.norm();\n}\n\nReal DistanceSquare(const Point& p0, const Point& p1) {\n return Point{p1 - p0}.normSquare();\n}\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nclass Segment {\nprivate:\n Point p0_{}, p1_{};\npublic:\n /* constructor */\n Segment() = default;\n Segment(const Point& p0, const Point& p1) : p0_{p0}, p1_{p1} {}\n Segment(Real x0, Real y0, Real x1, Real y1) : p0_{x0, y0}, p1_{x1, y1} {}\n\n /* getter setter */\n const Point& p0() const {\n return p0_;\n }\n Point& p0() {\n return p0_;\n }\n const Point& p1() const {\n return p1_;\n }\n Point& p1() {\n return p1_;\n }\n\n /* member function */\n bool valid() const {\n return p0_ != p1_;\n }\n bool straddle(const Segment& s) const {\n return Relation(p0_, p1_, s.p0()) * Relation(p0_, p1_, s.p1()) <= 0;\n }\n Real length() const {\n assert(valid());\n return Distance(p0_, p1_);\n }\n};\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nbool Intersect(const Segment& s0, const Segment& s1) {\n assert(s0.valid());\n assert(s1.valid());\n return s0.straddle(s1) and s1.straddle(s0);\n}\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nReal Distance(const Point& p, const Segment& s) {\n assert(s.valid());\n if (Negative(Dot(s.p1() - s.p0(), p - s.p0()))) {\n return Distance(p, s.p0());\n }\n if (Negative(Dot(s.p0() - s.p1(), p - s.p1()))) {\n return Distance(p, s.p1());\n }\n return Abs(Cross(s.p1() - s.p0(), p - s.p0())) / s.length();\n}\n\nbool PointOnSegment(const Point& p, const Segment& s) {\n assert(s.valid());\n return Zero(Distance(p, s));\n}\n\n} // namespace geometryR2\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace geometryR2 {\n\nReal Distance(const Segment& s0, const Segment& s1) {\n assert(s0.valid());\n assert(s1.valid());\n if (Intersect(s0, s1)) {\n return static_cast<Real>(0);\n }\n else {\n return std::min({ \n Distance(s1.p0(), s0), \n Distance(s1.p1(), s0),\n Distance(s0.p0(), s1),\n Distance(s0.p1(), s1) });\n }\n}\n\n} // namespace geometryR2\n\n} // namespace zawa\n\nusing namespace zawa::geometryR2;\n\nstruct Star {\n Point vs[5];\n Star() = default;\n Star(const Point& center, Real arg, Real r) {\n Point tmp[5];\n Point dir{0, r};\n for (int i{} ; i < 5 ; i++) {\n tmp[i] = dir;\n dir.rotateByArc(-(360 / 5));\n }\n for (auto& t : tmp) t.rotateByArc(arg);\n for (auto& t : tmp) t += center;\n vs[0] = tmp[0];\n vs[1] = tmp[2];\n vs[2] = tmp[4];\n vs[3] = tmp[1];\n vs[4] = tmp[3];\n }\n\n Segment operator[](int i) const {\n return Segment{vs[i], vs[i==4?0:i+1]};\n }\n};\n\nReal distance(const Star& s0, const Star& s1) {\n Real res{1e18};\n for (int i{} ; i < 5 ; i++) {\n for (int j{} ; j < 5 ; j++) {\n res = std::min(res, Distance(s0[i], s1[j]));\n }\n }\n return res;\n}\n\nbool solve() {\n int n, m, l; std::cin >> n >> m >> l;\n if (n == 0) return false;\n m--; l--;\n std::vector<Star> stars(n);\n Star(Point{0, 0}, 0, 1);\n for (int i{} ; i < n ; i++) {\n Point p; std::cin >> p;\n Real a, r; std::cin >> a >> r;\n stars[i] = Star{p, a, r};\n }\n std::vector g(n, std::vector<Real>(n, 1e18));\n for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) {\n if (i == j) g[i][j] = 0;\n else g[i][j] = distance(stars[i], stars[j]);\n }\n // for (int i{} ; i < n ; i++) {\n // for (int j{} ; j < n ; j++) {\n // std::cerr << g[i][j] << (j + 1 == n ? '\\n' : ' ');\n // }\n // }\n for (int k{} ; k < n ; k++) for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) {\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\n }\n Real ans{g[m][l]};\n std::cout << ans << '\\n';\n return true;\n}\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n std::cout << std::fixed << std::setprecision(10);\n\n for (int i{} ; solve() ; i++) {\n // std::cerr << \"case \" << i + 1 << \" end-----------\\n\"; \n }\n}","accuracy":1,"time_ms":420,"memory_kb":4172,"score_of_the_acc":-0.1795,"final_rank":12},{"submission_id":"aoj_2402_8451728","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\nusing Real = double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-8, PI = acos(-1.0);\n\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\nPoint operator/(const Point &p, const Real &d) { return Point(real(p) / d, imag(p) / d); }\nint sign(const Real &r) {\n if (r <= -EPS) return -1;\n if (r >= EPS) return 1;\n return 0;\n}\nbool equals(const Real &a, const Real &b) { return sign(a - b) == 0; }\nbool operator<(const Point &a, const Point &b) { return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b); }\nReal dot(const Point &a, const Point &b) { return real(conj(a) * b); }\nReal cross(const Point &a, const Point &b) { return imag(conj(a) * b); }\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n};\nPoint projection(const Line &l, const Point &p) { return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b); }\nPoint reflection(const Line &l, const Point &p) { return p * (projection(l, p) - p) * 2.0; }\nint ccw(const Point &a, Point b, Point c) {\n b -= a, c -= a;\n if (sign(cross(b, c)) == 1) return 1;\n if (sign(cross(b, c)) == -1) return -1;\n if (sign(dot(b, c)) == -1) return 2;\n if (norm(b) < norm(c)) return -2;\n return 0;\n}\nbool is_intersect_ss(const Line &s, const Line &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\nReal distance_sp(const Line &s, const Point &p) {\n Point r = projection(s, p);\n if (ccw(s.a, s.b, r) == 0) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\nReal distance_ss(const Line &a, const Line &b) {\n if (is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\n}\n\ntemplate <class T>\nstruct edge {\n int from, to;\n T cost;\n edge(int to, T cost = {}) : from(-1), to(to), cost(cost) {}\n};\n\nvoid solve(int N, int M, int L) {\n M--, L--;\n vector<vector<Line>> lines(N);\n rep(i, N) {\n int X, Y, A, R;\n cin >> X >> Y >> A >> R;\n\n vector<Point> ps(5);\n rep(j, 5) {\n Real rad = ((A + 72 * j + 90) % 360) * PI / 180;\n ps[j] = Point(X + R * cos(rad), Y + R * sin(rad));\n }\n rep(j, 5) lines[i].emplace_back(ps[j], ps[(j + 2) % 5]);\n }\n\n vector<vector<edge<Real>>> G(N);\n rep(i, N) rep(j, i) {\n Real d = 1e18;\n rep(k, 5) rep(l, 5) d = min(d, distance_ss(lines[i][k], lines[j][l]));\n G[i].emplace_back(j, d);\n G[j].emplace_back(i, d);\n }\n\n using T = Real;\n auto dijkstra = [](auto &G, int s, T mx) {\n using P = pair<T, int>;\n\n int N = G.size();\n vector<T> d(N, mx);\n d[s] = 0;\n\n priority_queue<P, vector<P>, greater<P>> pq;\n pq.push({0, s});\n while (!pq.empty()) {\n auto [dist, u] = pq.top();\n pq.pop();\n\n if (d[u] < dist) continue;\n for (auto &e : G[u]) {\n int v = e.to;\n T cost = e.cost;\n if (d[v] > d[u] + cost) {\n d[v] = d[u] + cost;\n pq.push({d[v], v});\n }\n }\n }\n return d;\n };\n auto dist = dijkstra(G, M, 1e18);\n printf(\"%.10f\\n\", dist[L]);\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int N, M, L;\n while (cin >> N >> M >> L) {\n if (N == 0 && M == 0 && L == 0) continue;\n solve(N, M, L);\n }\n\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":4080,"score_of_the_acc":-0.1635,"final_rank":10},{"submission_id":"aoj_2402_8391638","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst double EPS = 1e-10;\ndouble dist(double x, double y){\n return sqrt(x*x+y*y);\n}\ndouble d(double lx, double ly, double rx, double ry, double x, double y){\n if(lx==rx){\n swap(lx, ly);\n swap(rx, ry);\n swap(x, y);\n }\n lx -= EPS;\n rx += EPS;\n double a = (ly-ry)/(lx-rx);\n double b = ly-a*lx;\n if(lx > rx) swap(lx, rx);\n while(fabs(lx-rx)>EPS){\n double d1 = dist(lx-x, a*lx+b-y);\n double d2 = dist(rx-x, a*rx+b-y);\n if(d1 > d2) lx = (lx+rx)*0.5;\n else rx = (lx+rx)*0.5;\n }\n return dist(lx-x, a*lx+b-y);\n}\nbool crs(double x0, double y0, double x1, double y1, double x2, double y2, double x3, double y3){\n double c0 = (x2-x3)*(y0-y2)+(x2-x0)*(y2-y3);\n double c1 = (x2-x3)*(y1-y2)+(x2-x1)*(y2-y3);\n double c2 = (x0-x1)*(y2-y0)+(x0-x2)*(y0-y1);\n double c3 = (x0-x1)*(y3-y0)+(x0-x3)*(y0-y1);\n return c0*c1<0 && c2*c3<0;\n}\nint main(){\n int n, s, t;\n double x[102], y[102], a[102], r[102];\n double edge[102][102];\n while(cin >> n >> s >> t, n){\n for(int i=1;i<=n;i++){\n cin >> x[i] >> y[i] >> a[i] >> r[i];\n edge[i][i] = 0;\n }\n for(int i=1;i<=n-1;i++){\n for(int j=i+1;j<=n;j++){\n edge[i][j] = 1000000;\n for(int k=0;k<5;k++){\n for(int l=0;l<5;l++){\n double p1 = a[i]*M_PI/180 + M_PI*0.5 + M_PI*k*0.4;\n double p2 = a[i]*M_PI/180 + M_PI*0.5 + M_PI*((k+2)%5)*0.4;\n double q1 = a[j]*M_PI/180 + M_PI*0.5 + M_PI*l*0.4;\n double q2 = a[j]*M_PI/180 + M_PI*0.5 + M_PI*((l+2)%5)*0.4;\n double px1 = x[i] + r[i]*cos(p1);\n double py1 = y[i] + r[i]*sin(p1);\n double px2 = x[i] + r[i]*cos(p2);\n double py2 = y[i] + r[i]*sin(p2);\n double qx1 = x[j] + r[j]*cos(q1);\n double qy1 = y[j] + r[j]*sin(q1);\n double qx2 = x[j] + r[j]*cos(q2);\n double qy2 = y[j] + r[j]*sin(q2);\n if(crs(px1, py1, px2, py2, qx1, qy1, qx2, qy2)) edge[i][j] = 0;\n else{\n edge[i][j] = min(edge[i][j], d(px1, py1, px2, py2, qx1, qy1));\n edge[i][j] = min(edge[i][j], d(px1, py1, px2, py2, qx2, qy2));\n edge[i][j] = min(edge[i][j], d(qx1, qy1, qx2, qy2, px1, py1));\n edge[i][j] = min(edge[i][j], d(qx1, qy1, qx2, qy2, px2, py2));\n }\n edge[j][i] = edge[i][j];\n }\n }\n }\n }\n for(int i=1;i<=n;i++){\n for(int j=1;j<=n;j++){\n for(int k=1;k<=n;k++){\n edge[j][k] = min(edge[j][k], edge[j][i]+edge[i][k]);\n }\n }\n }\n printf(\"%.10lf\\n\", edge[s][t]);\n }\n return(0);\n}","accuracy":1,"time_ms":2480,"memory_kb":3676,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_2402_8293821","code_snippet":"#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nclass point2d {\npublic:\n\tdouble x, y;\n\tpoint2d() : x(0.0), y(0.0) {}\n\tpoint2d(double x_, double y_) : x(x_), y(y_) {}\n\tpoint2d& operator+=(const point2d& p) { x += p.x; y += p.y; return *this; }\n\tpoint2d& operator-=(const point2d& p) { x -= p.x; y -= p.y; return *this; }\n\tpoint2d& operator*=(double v) { x *= v; y *= v; return *this; }\n\tpoint2d& operator/=(double v) { x /= v; y /= v; return *this; }\n\tpoint2d operator+(const point2d& p) const { return point2d(*this) += p; }\n\tpoint2d operator-(const point2d& p) const { return point2d(*this) -= p; }\n\tpoint2d operator*(double v) { return point2d(*this) *= v; }\n\tpoint2d operator/(double v) { return point2d(*this) /= v; }\n\tdouble abs() const {\n\t\treturn sqrt(x * x + y * y);\n\t}\n\tdouble dot(const point2d& p) const {\n\t\treturn x * p.x + y * p.y;\n\t}\n\tdouble cross(const point2d& p) const {\n\t\treturn x * p.y - y * p.x;\n\t}\n};\n\nconst double pi = acos(-1.0);\n\ndouble segment_point(const point2d& p1, const point2d& p2, const point2d& p3) {\n\tif ((p2 - p1).dot(p3 - p1) < 0.0) {\n\t\treturn (p3 - p1).abs();\n\t}\n\tif ((p1 - p2).dot(p3 - p2) < 0.0) {\n\t\treturn (p3 - p2).abs();\n\t}\n\treturn abs((p2 - p1).cross(p3 - p1)) / (p2 - p1).abs();\n}\n\nbool check_cross(const point2d& p1, const point2d& p2, const point2d& p3, const point2d& p4) {\n\tauto ccw = [](const point2d& v1, const point2d& v2) -> int {\n\t\tdouble cross = v1.cross(v2);\n\t\tif (cross < 0.0) return +1;\n\t\tif (cross > 0.0) return -1;\n\t\tif (v1.dot(v2) < 0.0) return +2;\n\t\tif (v1.abs() < v2.abs()) return -2;\n\t\treturn 0;\n\t};\n\treturn ccw(p2 - p1, p3 - p1) * ccw(p2 - p1, p4 - p1) <= 0 && ccw(p4 - p3, p1 - p3) * ccw(p4 - p3, p2 - p3) <= 0;\n}\n\ndouble segment_segment(const point2d& p1, const point2d& p2, const point2d& p3, const point2d& p4) {\n\tif (check_cross(p1, p2, p3, p4)) {\n\t\treturn 0.0;\n\t}\n\tdouble d1 = segment_point(p1, p2, p3);\n\tdouble d2 = segment_point(p1, p2, p4);\n\tdouble d3 = segment_point(p3, p4, p1);\n\tdouble d4 = segment_point(p3, p4, p2);\n\treturn min({ d1, d2, d3, d4 });\n}\n\nint main() {\n\tcout.precision(15);\n\tint N, S, T;\n\twhile (true) {\n\t\tcin >> N >> S >> T;\n\t\tif (N == 0 && S == 0 && T == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tS -= 1;\n\t\tT -= 1;\n\t\tvector<int> X(N), Y(N), A(N), R(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> X[i] >> Y[i] >> A[i] >> R[i];\n\t\t}\n\t\tvector<point2d> P(5 * N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < 5; j++) {\n\t\t\t\tdouble arg = (A[i] + 144 * j + 90) * (pi / 180.0);\n\t\t\t\tP[5 * i + j] = point2d(X[i], Y[i]) + point2d(cos(arg), sin(arg)) * R[i];\n\t\t\t}\n\t\t}\n\t\tauto next = [&](int id) {\n\t\t\treturn (id % 5 != 4 ? id + 1 : id - 4);\n\t\t};\n\t\tvector<vector<double> > d(N, vector<double>(N));\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (i == j) {\n\t\t\t\t\td[i][j] = 0.0;\n\t\t\t\t}\n\t\t\t\tif (i > j) {\n\t\t\t\t\td[i][j] = d[j][i];\n\t\t\t\t}\n\t\t\t\tif (i < j) {\n\t\t\t\t\td[i][j] = 1.0e+99;\n\t\t\t\t\tfor (int k = 0; k < 5; k++) {\n\t\t\t\t\t\tfor (int l = 0; l < 5; l++) {\n\t\t\t\t\t\t\td[i][j] = min(d[i][j], segment_segment(P[5 * i + k], P[next(5 * i + k)], P[5 * j + l], P[next(5 * j + l)]));\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\tvector<double> dist(N, 1.0e+99);\n\t\tdist[S] = 0.0;\n\t\tvector<bool> vis(N, false);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint id = -1;\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tif (!vis[j] && (id == -1 || dist[id] > dist[j])) {\n\t\t\t\t\tid = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tvis[id] = true;\n\t\t\tfor (int j = 0; j < N; j++) {\n\t\t\t\tdist[j] = min(dist[j], dist[id] + d[id][j]);\n\t\t\t}\n\t\t}\n\t\tcout << fixed << dist[T] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3732,"score_of_the_acc":-0.0105,"final_rank":1},{"submission_id":"aoj_2402_6760607","code_snippet":"/*\n\nThanks for ei1333\n\n*/\n\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <deque>\n#include <queue>\n#include <string>\n#include <iomanip>\n#include <set>\n#include <unordered_set>\n#include <map>\n#include <unordered_map>\n#include <utility>\n#include <stack>\n#include <random>\n#include <complex>\n#include <functional>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <math.h>\n#include <assert.h>\n// #if __has_include(<atcoder/all>)\n// #include <atcoder/all>\n// using namespace atcoder;\n// #endif\nusing namespace std;\nusing ll=long long;\n#define read(x) cin>>(x);\n#define readll(x) ll (x);cin>>(x);\n#define readS(x) string (x);cin>>(x);\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\n#define yn {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define double_out(x) fixed << setprecision(x)\ninline ll powll(ll x,ll n){ll r=1;while(n>0){if(n&1){r*=x;};x*=x;n>>=1;};return r;}\n\nusing Real = double;\nusing Point = complex< Real >;\nconst Real EPS = 1e-8, PI = acos(-1);\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\nistream &operator>>(istream &is, Point &p) {\n Real a, b;\n is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, Point &p) {\n return os << fixed << setprecision(10) << p.real() << \" \" << p.imag();\n}\n\n// 点 p を反時計回りに theta 回転\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\nReal radian_to_degree(Real r) {\n return (r * 180.0 / PI);\n}\n\nReal degree_to_radian(Real d) {\n return (d * PI / 180.0);\n}\n\n// a-b-c の角度のうち小さい方を返す\nReal get_angle(const Point &a, const Point &b, const Point &c) {\n const Point v(b - a), w(c - b);\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\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n\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// 線分\nstruct Segment : Line {\n Segment() = default;\n\n Segment(Point a, Point b) : Line(a, b) {}\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 friend ostream &operator<<(ostream &os,Circle &a){\n return os << \"( \" << a.p.real() << \" , \" << a.p.imag() << \" ) r: \"<< a.r ;\n }\n\n friend istream &operator>>(istream &is,Circle &a){\n return is >> a.p >> a.r;\n }\n};\n\nusing Points = vector< Point >;\nusing Polygon = vector< Point >;\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\n// 点の回転方向\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\" // p0,p1,p2が反時計回りになる場合\n if(cross(b, c) < -EPS) return -1; // \"CLOCKWISE\" // p0,p1,p2が時計回りになる場合\n if(dot(b, c) < 0) return +2; // \"ONLINE_BACK\" // p2,p0,p1がこの順で同一直線上にある場合\n if(norm(b) < norm(c)) return -2; // \"ONLINE_FRONT\" // p0,p1,p2がこの順で同一直線上にある場合\n return 0; // \"ON_SEGMENT\" // p2が線分p0,p1上にある場合\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 平行判定\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\n// 垂直判定\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\n// 射影\n// 直線 l に p から垂線を引いた交点を求める\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\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\n// 反射\n// 直線 l を対称軸として点 p と線対称にある点を求める\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\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\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\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\nReal distance(const Line &l, const Point &p);\n\nbool intersect(const Circle &c, const Line &l) {\n return distance(l, c.p) <= c.r + EPS;\n}\n\nbool intersect(const Circle &c, const Point &p) {\n return abs(abs(p - c.p) - c.r) < EPS;\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\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// 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;// 離れている (共通接線 4)\n if(eq(c1.r + c2.r, d)) return 3;// 外接する (共通接線 3)\n if(c1.r - c2.r < d) return 2;// 交わる (共通接線 2)\n if(eq(c1.r - c2.r, d)) return 1;// 内接する (共通接線 1)\n return 0;// 内包する (共通接線 0)\n}\n\nReal distance(const Point &a, const Point &b) {\n return abs(a - b);\n}\n\nReal distance(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\nReal distance(const Line &l, const Line &m) {\n return intersect(l, m) ? 0 : distance(l, m.a);\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// 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\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// 交点\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// 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// 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\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// 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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// 点 p を通る円 c の接線\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\n// 円 c1, c2 の共通接線\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\n// 凸性判定\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// 凸包\n// 頂点が全て整数のときはEPS=0にしないとバグる\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]) < EPS) --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]) < EPS) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\n// 多角形と点の包含判定\nenum {\n OUT, ON, IN\n};\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\nint contains(const Circle &Q, const Point &p){\n Real left=(p.real()-Q.p.real())*(p.real()-Q.p.real())+(p.imag()-Q.p.imag())*(p.imag()-Q.p.imag());\n Real right=Q.r*Q.r;\n if(fabs(left-right)<EPS){\n return ON;\n }else if(left<right){\n return IN;\n }else{\n return OUT;\n }\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分の重複除去\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\n// 線分アレンジメント\n// 任意の2線分の交点を頂点としたグラフを構築する\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\n// 凸多角形の切断\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// 多角形の面積\nReal area(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 * 0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\n// 円と多角形の共通部分の面積\nReal area(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*0.5;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\n// 凸多角形の直径(最遠頂点対間距離)\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\n// 最近点対\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\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\nconst vector<pair<ll,ll>> star_lines={{0,2},{0,3},{1,3},{1,4},{2,4}};\n\n#include <vector>\n#include <utility>\n#include <queue>\n#include <algorithm>\nstruct Dijkstra{\n private:\n double INF=10000000000000LL;\n std::vector<std::vector<std::pair<long long,double>>> G;\n int V;\n inline void _add(long long s,long long t,double c){\n G[s].emplace_back(std::make_pair(t,c));\n }\n public:\n Dijkstra(int N):V(N) {\n G.resize(V);\n }\n void add1(long long s,long long t,double c){\n _add(s,t,c);\n }\n void add2(long long s,long long t,double c){\n _add(s,t,c);\n _add(t,s,c);\n }\n std::vector<double> run(long long s){\n std::vector<double> res(V,INF);\n std::priority_queue<std::pair<double,long long>,std::vector<std::pair<double,long long>>,std::greater<std::pair<double,long long>>> que;\n res[s]=0;\n que.push(std::make_pair(0,s));\n while(!que.empty()){\n std::pair<double,long long> p=que.top();\n que.pop();\n long long v=p.second;\n if(res[v]<p.first){\n continue;\n }\n for(const std::pair<long long,double>& e:G[v]){\n if(res[e.first]>res[v]+e.second){\n res[e.first]=res[v]+e.second;\n que.push(std::make_pair(res[e.first],e.first));\n }\n }\n }\n return res;\n }\n};\n\nstruct Star{\n Polygon pol;\n ll cx,cy;\n Segments segm;\n Star(){\n pol.resize(5);\n segm.resize(5);\n }\n Star(ll x,ll y,ll a,ll r){\n pol.resize(5);\n cx=x;\n cy=y;\n vector<Point> tmp(5);\n tmp[0]=Point(0,r);\n tmp[0]=rotate(degree_to_radian(a),tmp[0]);\n for(int i=0;i<4;i++){\n tmp[i+1]=rotate(degree_to_radian(72),tmp[i]);\n }\n for(int i=0;i<5;i++){\n pol[i]=Point(tmp[i].real()+cx,tmp[i].imag()+cy);\n }\n segm.resize(5);\n for(ll i=0;i<5;i++){\n segm[i]=Segment(pol[star_lines[i].first],pol[star_lines[i].second]);\n }\n }\n};\n\nstruct Union{\n vector<Point> ps;\n Segments segms;\n};\n\nvoid solve(ll N,ll M,ll L){\n vector<Star> S(N);\n for(ll i=0;i<N;i++){\n ll x,y,a,r;\n cin>>x>>y>>a>>r;\n S[i]=Star(x,y,a,r);\n }\n atcoder::dsu uf(N);\n for(ll i=0;i<N;i++){\n for(ll j=i+1;j<N;j++){\n ll f=0;\n for(ll x=0;x<5;x++){\n for(ll y=0;y<5;y++){\n if(intersect(S[i].segm[x],S[j].segm[y])){\n f=1;\n break;\n }\n }\n if(f){\n break;\n }\n }\n if(f){\n uf.merge(i,j);\n }\n }\n }\n vector<vector<int>> grps=uf.groups();\n vector<Union> uni(grps.size());\n ll start,end;\n for(unsigned i=0;i<grps.size();i++){\n for(int j:grps[i]){\n if(j==M-1){\n start=i;\n }\n if(j==L-1){\n end=i;\n }\n for(ll k=0;k<5;k++){\n uni[i].ps.push_back(S[j].pol[k]);\n uni[i].segms.push_back(S[j].segm[k]);\n }\n }\n }\n ll B=uni.size();\n //cerr<<\"uni_size: \"<<B<<endl;\n //cerr<<start<<\" \"<<end<<endl;\n Dijkstra ijk(B);\n for(ll i=0;i<B;i++){\n for(ll j=0;j<B;j++){\n if(i==j){\n continue;\n }\n for(Point x:uni[i].ps){\n for(Segment y:uni[j].segms){\n ijk.add2(i,j,distance(y,x));\n //cerr<<i<<\" \"<<j<<\" \"<<double_out(10)<<distance(y,x)<<endl;\n }\n }\n }\n }\n cout<<double_out(10)<<ijk.run(start)[end]<<endl;\n}\n\n\nint main(){\n ll N,M,L;\n while(1){\n cin>>N>>M>>L;\n if(N==0){\n break;\n }\n solve(N,M,L);\n }\n}","accuracy":1,"time_ms":190,"memory_kb":14400,"score_of_the_acc":-0.5043,"final_rank":17},{"submission_id":"aoj_2402_6243498","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// はじめに\nusing Double = double;\nconst Double EPS = 1e-8;\nconst Double PI = acos(-1);\ninline int sign(const Double &x) { return x <= -EPS ? -1 : (x >= EPS ? 1 : 0); }\ninline bool equals(const Double &a, const Double &b) { return sign(a - b) == 0; }\nDouble radian_to_degree(Double r) { return r * 180.0 / PI; }\nDouble degree_to_radian(Double d) { return d * PI / 180.0; }\n\n// 点\nusing Point = complex<Double>;\n// Point operator*(const Point &p, const Double &d) { return Point(p.real() * d, p.imag() * d); } // 定数を掛ける\n// Point operator/(const Point &p, const Double &d) { return Point(p.real() / d, p.imag() / d); } // 定数で割る\nistream &operator>>(istream &is, Point &p) {\n Double x, y;\n is >> x >> y;\n p = Point(x, y);\n return is;\n}\nDouble dot(const Point &a, const Point &b) { return a.real() * b.real() + a.imag() * b.imag(); } // 内積\nDouble cross(const Point &a, const Point &b) { return a.real() * b.imag() - a.imag() * b.real(); } // 外積\n// thetaだけ反時計回りに回転させる(thetaは弧度法なので、例えば90度回転させたいときにはtheta=PI/2とする)\nPoint rotate(const Point &p, const Double &theta) { return p * Point(cos(theta), sin(theta)); }\n\n// 直線\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n friend ostream &operator<<(ostream &os, const Line &p) { return os << p.a << \"->\" << p.b; }\n friend istream &operator>>(istream &is, Line &p) { return is >> p.a >> p.b; }\n};\n\n// 線分\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\n// 円\nstruct Circle {\n Point o;\n Double r;\n Circle() = default;\n Circle(Point o, Double r) : o(o), r(r) {}\n friend ostream &operator<<(ostream &os, const Circle &c) { return os << c.o << \" \" << c.r; }\n friend istream &operator>>(istream &is, Circle &c) { return is >> c.o >> c.r; } // (x,y),rの順\n};\n\n// 射影(projection):CGL_1_A\n// 直線lに点pから引いた垂線の足を求める\nPoint projection(const Line &l, const Point &p) {\n Double t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\n return l.a + t * (l.b - l.a);\n}\n\n// 反射(reflection):CGL_1_B\n// 直線lについて点pと線対称の点を求める\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * (Double)2.0; }\n\n// 反時計回り(ccw):CGL_1_C\n// 点a,b,cの位置関係を調べる(aを基準とする)\nconstexpr int COUNTER_CLOCKWISE = 1; // a-b-cが反時計回り\nconstexpr int CLOCKWISE = -1; // a-b-cが時計回り\nconstexpr int ONLINE_BACK = 2; // c-a-b(一直線上)\nconstexpr int ONLINE_FRONT = -2; // a-b-c(一直線上)\nconstexpr int ON_SEGMENT = 0; // a-c-b(一直線上)\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if (sign(cross(b, c)) == 1) return COUNTER_CLOCKWISE;\n if (sign(cross(b, c)) == -1) return CLOCKWISE;\n if (sign(dot(b, c)) == -1) return ONLINE_BACK;\n if (norm(b) < norm(c)) return ONLINE_FRONT;\n return ON_SEGMENT;\n}\n\n// 平行・垂直(parallel/orthogonal):CGL_2_A\n// 2直線l1,l2が平行・垂直か判定する(それぞれ外積・内積が0)\nbool is_parallel(const Line &l1, const Line &l2) { return sign(cross(l1.b - l1.a, l2.b - l2.a)) == 0; }\nbool is_orthogonal(const Line &l1, const Line &l2) { return sign(dot(l1.b - l1.a, l2.b - l2.a)) == 0; }\n\n// 交差判定(intersection):CGL_2_B\n// 2線分s1,s2が交差するか判定する\nbool intersection_ss(const Segment &s1, const Segment &s2) { return (ccw(s1.a, s1.b, s2.a) * ccw(s1.a, s1.b, s2.b) <= 0 && ccw(s2.a, s2.b, s1.a) * ccw(s2.a, s2.b, s1.b) <= 0); }\n// 線分sと点pの場合(一応distance_spの実装でverify)\nbool intersection_sp(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == ON_SEGMENT; }\n// 直線lと点pの場合(absが1でない<=>ccwがONLINE_BACKかONLINE_FRONTかON_SEGMENT)(未verify)\nbool intersection_lp(const Line &l, const Point &p) {\n int res = ccw(l.a, l.b, p);\n return (res == ONLINE_BACK || res == ONLINE_FRONT || res == ON_SEGMENT);\n}\n// 直線l1,l2の場合(未verify)\nbool intersection_ll(const Line &l1, const Line &l2) {\n // cross_point_llの説明を参考に\n Point base = l1.b - l1.a;\n Double d12 = cross(base, l2.b - l2.a);\n Double d1 = cross(base, l1.b - l2.a);\n if (sign(d12) == 0 && sign(d1) == 0) return true; // 一致\n // 平行か1点で交わるか\n return !is_parallel(l1, l2);\n}\n\n// 線分の交点(cross point):CGL_2_C\n// 2直線l1,l2の交点を求める(未verify)\nPoint cross_point_ll(const Line &l1, const Line &l2) {\n // 2直線の関係:1点で交わるor平行or一致\n Point base = l1.b - l1.a;\n Double d12 = cross(base, l2.b - l2.a);\n Double d1 = cross(base, l1.b - l2.a);\n // 一致(sign(d12) == 0 は is_parallelと本質的に同じ, sign(d1) == 0は重なっているか)\n if (sign(d12) == 0 && sign(d1) == 0) return l2.a; // 2直線が一致するので適当に点を返す\n assert(is_parallel(l1, l2) == false); // assert(sign(d12) != 0);と同じ\n return l2.a + (l2.b - l2.a) * (d1 / d12);\n}\n// 2線分s1,s2の交点を求める\nPoint cross_point_ss(const Segment &s1, const Segment &s2) {\n assert(intersection_ss(s1, s2)); // 交点を持つかまず判定する\n // 1点で交わるor無数の点で交わる\n Point base = s1.b - s1.a;\n Double d12 = cross(base, s2.b - s2.a);\n Double d1 = cross(base, s1.b - s2.a);\n if (sign(d12) == 0 && sign(d1) == 0) {\n // 無数の点で交わる(未verify)\n if (intersection_sp(s1, s2.a)) return s2.a;\n if (intersection_sp(s1, s2.b)) return s2.b;\n if (intersection_sp(s2, s1.a)) return s1.a;\n assert(intersection_sp(s2, s1.b));\n return s1.b;\n }\n return s2.a + (s2.b - s2.a) * (d1 / d12);\n}\n\n// 距離(distance):CGL_2_D\n// 2点a,bの距離を求める(未verify)\nDouble distance_pp(const Point &a, const Point &b) { return abs(a - b); }\n// 直線lと点pの距離を求める(未verify)\nDouble distance_lp(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n// 線分sと点pの距離を求める\nDouble distance_sp(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if (intersection_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n// 線分s1,s2の距離を求める\nDouble distance_ss(const Segment &s1, const Segment &s2) {\n if (intersection_ss(s1, s2)) return 0.0;\n return min({distance_sp(s1, s2.a), distance_sp(s1, s2.b), distance_sp(s2, s1.a), distance_sp(s2, s1.b)});\n}\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define ALL(x) x.begin(), x.end()\n\nstruct star5 {\n vector<Segment> Segs;\n Double x, y, deg, r;\n star5() {}\n star5(Double x, Double y, Double deg, Double r) : x(x), y(y), deg(deg), r(r) {\n Point a1 = polar(r, PI / 2 + degree_to_radian(deg));\n Point p = Point(x, y);\n for (int i = 0; i < 5; i++) {\n Point a2 = rotate(a1, degree_to_radian(144));\n Segs.push_back(Segment(a1 + p, a2 + p));\n a1 = a2;\n }\n }\n};\n\nDouble distance_star5(const star5 &s1, const star5 &s2) {\n Double ret = numeric_limits<Double>::infinity();\n for (int i = 0; i < 5; i++) {\n for (int j = 0; j < 5; j++) {\n ret = min(ret, distance_ss(s1.Segs[i], s2.Segs[j]));\n }\n }\n return ret;\n}\n\nconst Double INF = numeric_limits<Double>::infinity();\n\nvoid solve(int N, int M, int L) {\n M--, L--;\n vector<star5> S(N);\n rep(i, N) {\n Double x, y, a, r;\n cin >> x >> y >> a >> r;\n S[i] = star5(x, y, a, r);\n }\n vector<vector<Double>> dist(N, vector<Double>(N, INF));\n rep(i, N) rep(j, N) dist[i][j] = distance_star5(S[i], S[j]);\n rep(k, N) rep(i, N) rep(j, N) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n cout << fixed << setprecision(15) << dist[M][L] << '\\n';\n return;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N, M, L;\n while (cin >> N >> M >> L, N) solve(N, M, L);\n return 0;\n}","accuracy":1,"time_ms":730,"memory_kb":4060,"score_of_the_acc":-0.3014,"final_rank":15},{"submission_id":"aoj_2402_6192052","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nstruct Point{\n double x;\n double y;\n \n void rot(double theta){\n theta = theta / 180 * M_PI;\n double nx = x * cos(theta) - y * sin(theta);\n double ny = y * cos(theta) + x * sin(theta);\n x = nx;\n y = ny;\n }\n};\n\nint n, m, l;\n\ndouble cross3(Point &p, Point &a, Point &b){\n return (a.x - p.x) * (b.y - p.y) - (a.y - p.y) * (b.x - p.x);\n}\n\nbool iscross(Point &a1, Point &a2, Point &b1, Point &b2){\n bool flg1 = cross3(a1, a2, b1) * cross3(a1, a2, b2) < 0;\n bool flg2 = cross3(b1, b2, a1) * cross3(b1, b2, a2) < 0;\n return flg1 & flg2;\n}\n\ndouble dot_dist(Point &a, Point &b){\n double dx = b.x - a.x;\n double dy = b.y - a.y;\n return sqrt(dx * dx + dy * dy);\n}\n\ndouble dot_line_dist(Point &p, Point &a, Point &b){\n Point d0 = {b.x - a.x, b.y - a.y};\n Point d1 = {p.x - a.x, p.y - a.y};\n double dot = d0.x * d1.x + d0.y * d1.y;\n double dd = d0.x * d0.x + d0.y * d0.y;\n if(0 <= dot && dot <= dd){\n double cross = d0.x * d1.y - d0.y * d1.x;\n return abs(cross) / sqrt(dd);\n }\n else return min(dot_dist(p, a), dot_dist(p, b));\n}\n\ndouble line_dist(Point &a1, Point &a2, Point &b1, Point &b2){\n if(iscross(a1, a2, b1, b2)) return 0;\n double ret = dot_line_dist(a1, b1, b2);\n ret = min(ret, dot_line_dist(a2, b1, b2));\n ret = min(ret, dot_line_dist(b1, a1, a2));\n ret = min(ret, dot_line_dist(b2, a1, a2));\n return ret;\n}\n\nvoid solve(){\n vector<vector<Point>> star(n, vector<Point>(5));\n double x, y, a, r;\n for(int i = 0; i < n; i++){\n cin >> x >> y >> a >> r;\n Point v = {0, r};\n v.rot(a);\n for(int j = 0; j < 5; j++){\n star[i][j] = {v.x + x, v.y + y};\n v.rot(144);\n }\n }\n vector<vector<double>> dist(n, vector<double>(n, 0));\n for(int i = 0; i < n; i++) for(int j = 0; j < n; j++){\n if(i == j) continue;\n double min_ = 1 << 30;\n for(int k = 0; k < 5; k++) for(int o = 0; o < 5; o++){\n double tmp = line_dist(star[i][k], star[i][(k + 1) % 5], star[j][o], star[j][(o + 1) % 5]);\n min_ = min(min_, tmp);\n }\n dist[i][j] = min_;\n dist[j][i] = min_;\n }\n for(int k = 0; k < n; k++) for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n cout << dist[m][l] << \"\\n\";\n}\n\nint main(void){\n cout << fixed << setprecision(20);\n while(1){\n cin >> n >> m >> l;\n if(n == 0) break;\n m--; l--;\n solve();\n }\n \n}","accuracy":1,"time_ms":90,"memory_kb":3892,"score_of_the_acc":-0.0333,"final_rank":3},{"submission_id":"aoj_2402_6029780","code_snippet":"#line 1 \"main.cpp\"\n#include <algorithm>\n#include <cassert>\n#include <cfloat>\n#include <cmath>\n#include <cstdint>\n#include <cstdio>\n#include <deque>\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 = int64_t;\nusing uint = uint32_t;\nusing ulint = uint64_t;\n\ntemplate <class T>\nusing vector2d = vector<vector<T>>;\n\ntemplate <class T>\nbool UpdateMax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool UpdateMin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nvoid OutVec(const vector<T> &vec) {\n for (int i = 0; i < vec.size() - 1; ++i) {\n cout << vec[i] << \" \";\n }\n cout << vec.back() << endl;\n}\n\ntemplate <class T>\nvoid OutVec2d(const vector2d<T> &vec) {\n for (auto v : vec) {\n OutVec(v);\n }\n}\n\n#line 2 \"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\"\n\n#line 4 \"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\"\n\n#line 2 \"/home/arc/project/comppro/cplib/geometry/circle.cpp\"\n\n#include <stdexcept>\n\n#line 2 \"/home/arc/project/comppro/cplib/geometry/base.cpp\"\n\nnamespace geometry {\n\nconst double EPS = 1e-8;\n/**\n * @brief double比較用関数\n *\n * @param a\n * @param b\n * @return int a>bなら1, a<bなら-1, a=bなら0\n */\nint doubleComp(double a, double b) {\n if (a > b + EPS)\n return 1;\n else if (b > a + EPS) {\n return -1;\n }\n return 0;\n}\n\nbool equals(double a, double b) {\n return doubleComp(a, b)==0;\n}\n} // namespace geometry\n#line 2 \"/home/arc/project/comppro/cplib/geometry/distance.cpp\"\n\n#line 2 \"/home/arc/project/comppro/cplib/geometry/line.cpp\"\n\n#line 2 \"/home/arc/project/comppro/cplib/geometry/vector.cpp\"\n\n#include <complex>\n#include <limits>\n\n#line 7 \"/home/arc/project/comppro/cplib/geometry/vector.cpp\"\n\nnamespace geometry {\nusing Vector2 = std::complex<double>;\n\n/**\n * @brief aとbの内積 |a||b|cosΘ を求める \n *\n * @param a\n * @param b\n * @return double\n */\ndouble dot(const Vector2 &a, const Vector2 &b) {\n return a.real() * b.real() + a.imag() * b.imag();\n}\n\n/**\n * @brief aとbの外積 |a||b|sinΘ を求める\n *\n * @param a\n * @param b\n * @return double\n */\ndouble cross(const Vector2 &a, const Vector2 &b) {\n return a.real() * b.imag() - a.imag() * b.real();\n}\n\n/**\n * @brief pを反時計回りにrad回転したベクトルを求める\n *\n * @param p 元のベクトル\n * @param rad 回転角(単位ラジアン)\n * @return Vector2 回転後のベクトル\n */\nVector2 rotate(const Vector2 &p, const double rad) {\n double c = cos(rad), s = sin(rad);\n return Vector2(c * p.real() - s * p.imag(), s * p.real() + c * p.imag());\n}\n\n/**\n * @brief aを基準点としたb, cの位置関係を調べる\n *\n * @param a\n * @param b\n * @param c\n * @return int\n * cがbの反時計回りの位置: 1\n * 時計回りの位置: -1\n * c,a,bがこの順番で同一直線上: 2\n * a,b,cがこの順番で同一直線上: -2\n * cが線分ab上: 0\n */\nint ccw(const Vector2 &a, Vector2 b, Vector2 c) {\n b -= a;\n c -= a;\n if (doubleComp(cross(b, c), 0) == 1) {\n return 1;\n }\n if (doubleComp(cross(b, c), 0) == -1) {\n return -1;\n }\n if (doubleComp(dot(b, c), 0) == -1) {\n return 2;\n }\n if (norm(b) < norm(c)) {\n return -2;\n }\n return 0;\n}\n\nbool isNaN(const Vector2 &a) {\n return std::isnan(a.imag()) || std::isnan(a.real());\n}\n\nVector2 unitVector(const Vector2 &a) {\n return a / std::abs(a);\n}\n\nVector2 normalVector(const Vector2 &a) {\n return a * Vector2(0, 1);\n}\n\nstatic double nan = std::numeric_limits<double>::quiet_NaN();\nconst Vector2 NaN = Vector2(nan, nan);\n} // namespace geometry\n#line 5 \"/home/arc/project/comppro/cplib/geometry/line.cpp\"\n\nnamespace geometry {\nstruct Line {\n Vector2 a, b;\n Line() = default;\n Line(Vector2 _a, Vector2 _b) : a(_a), b(_b) {\n }\n\n /**\n * @brief ax+by=cの直線を作成\n *\n * @param a\n * @param b\n * @param c\n */\n Line(double _a, double _b, double _c) {\n if (equals(_a, 0)) {\n a = Vector2(0, _c / _b);\n b = Vector2(1, _c / _b);\n } else if (equals(_b, 0)) {\n a = Vector2(_c / _a, 0);\n b = Vector2(_c / _a, 1);\n } else {\n a = Vector2(0, _c / _b);\n b = Vector2(_c / _a, 0);\n }\n }\n\n Vector2 vector() const {\n return b - a;\n }\n};\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Vector2 a, Vector2 b) : Line(a, b) {\n }\n};\n\n/**\n * @brief 2直線が平行であるかを返します\n *\n * @param s\n * @param t\n * @return true\n * @return false\n */\nbool isParallel(const Line &s, const Line &t) {\n return equals(0, cross(s.vector(), t.vector()));\n}\n\n/**\n * @brief 2直線が垂直であるかを返します\n *\n * @param s\n * @param t\n * @return true\n * @return false\n */\nbool isOrthogonal(const Line &s, const Line &t) {\n return equals(0, dot(s.vector(), t.vector()));\n}\n\n/**\n * @brief 2線分が交差しているかを返します\n *\n * @param s\n * @param t\n * @return true\n * @return false\n */\nbool hasIntersect(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n} // namespace geometry\n#line 6 \"/home/arc/project/comppro/cplib/geometry/distance.cpp\"\n\nnamespace geometry {\ndouble distance(const Vector2 &a, const Vector2 &b) {\n double x = a.real() - b.real();\n double y = a.imag() - b.imag();\n return sqrt(x * x + y * y);\n}\n\n/**\n * @brief 点と直線の距離を求めます\n *\n * @param p 点\n * @param l 直線\n * @return double 点と直線の距離\n */\ndouble distance(const Vector2 &p, const Line &l) {\n return std::abs(cross(l.vector(), p - l.a) / abs(l.vector()));\n}\n\n/**\n * @brief 点と線分の距離を求めます\n * \n * @param p 点\n * @param l 線分\n * @return double 点と線分の距離 \n */\ndouble distance(const Vector2 &p, const Segment &l) {\n if (dot(l.b - l.a, p - l.a) < EPS) {\n return abs(p-l.a);\n }\n if (dot(l.a - l.b, p - l.b) < EPS) {\n return abs(p-l.b);\n }\n return std::abs(cross(l.vector(), p - l.a) / abs(l.vector()));\n}\n\n/**\n * @brief 線分間の最短距離を求めます\n * \n * @param s \n * @param t \n * @return double \n */\ndouble distance(const Segment &s, const Segment &t) {\n if (hasIntersect(s, t)) {\n return (double)0;\n }\n double ans = distance(t.a, s);\n ans = std::min(ans, distance(t.b, s));\n ans = std::min(ans, distance(s.a, t));\n ans = std::min(ans, distance(s.b, t));\n return ans;\n}\n\n} // namespace geometry\n#line 2 \"/home/arc/project/comppro/cplib/geometry/polygon.cpp\"\n\n#line 5 \"/home/arc/project/comppro/cplib/geometry/polygon.cpp\"\n\n#line 7 \"/home/arc/project/comppro/cplib/geometry/polygon.cpp\"\nnamespace geometry {\n\nusing Polygon = std::vector<Vector2>;\n\n/**\n * @brief 多角形の面積を求めます\n *\n * @param p 多角形の頂点を反時計回りに並べたもの\n * @return double\n */\ndouble area(const Polygon &p) {\n double res = 0;\n int n = p.size();\n for (int i = 0; i < n - 1; i++) {\n res += cross(p[i], p[i + 1]);\n }\n res += cross(p[n - 1], p[0]);\n return res * 0.5;\n}\n\n/**\n * @brief 多角形が凸かどうか判定します\n *\n * @param p 多角形の頂点を反時計回りに並べたもの\n * @return true 凸である場合\n * @return false 凸でない場合\n */\nbool isConvex(const Polygon &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) {\n return false;\n }\n }\n return true;\n}\n\n/**\n * @brief 多角形に点が含まれているか判定します\n *\n * @param g 多角形の頂点を反時計回りに並べたもの\n * @param p 対象の点\n * @return int 含まれるなら2, 辺上にあるなら1, それ以外なら0\n */\nint isContained(const Polygon &g, const Vector2 &p) {\n bool in = false;\n int n = (int)g.size();\n for (int i = 0; i < n; i++) {\n Vector2 a = g[i] - p, b = g[(i + 1) % n] - p;\n if (imag(a) > imag(b)) {\n swap(a, b);\n }\n if (imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) {\n in = !in;\n }\n if (equals(cross(a, b), 0) && doubleComp(dot(a, b), 0) <= 0) {\n return 1;\n }\n }\n return (in ? 2 : 0);\n}\n\n/**\n * @brief 凸包を求めます (O(N log N))\n *\n * @param p 多角形の頂点を反時計回りに並べたもの\n * @return Polygon pの凸包\n */\nPolygon convexHull(Polygon &p) {\n int n = (int)p.size(), k = 0;\n std::sort(p.begin(), p.end(), [](const Vector2 &a, const Vector2 &b) {\n return (!equals(a.real(), b.real()) ? a.real() < b.real()\n : a.imag() < b.imag());\n });\n Polygon ch(2 * n);\n // 一直線上の3点を含める -> (< -EPS)\n // 含めない -> (< EPS)\n for (int i = 0; i < n; ch[k++] = p[i++]) { // lower\n while (k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n }\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\n while (k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n} // namespace geometry\n#line 2 \"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\"\n\n#line 4 \"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\"\n\n#line 7 \"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\"\n\nnamespace geometry {\n/**\n * @brief pからlに降ろした垂線の足を求める\n *\n * @param l\n * @param p\n * @return Vector2\n */\nVector2 projection(const Line &l, const Vector2 &p) {\n double t = dot(p - l.a, l.a - l.b) / std::norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n/**\n * @brief lを対称軸としてpと線対称の位置にある点を求める\n *\n * @param l\n * @param p\n * @return Vector2\n */\nVector2 reflection(const Line &l, const Vector2 &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n} // namespace geometry\n#line 10 \"/home/arc/project/comppro/cplib/geometry/circle.cpp\"\n\nnamespace geometry {\nstruct Circle {\n Vector2 c;\n double r;\n Circle() = default;\n Circle(Vector2 _c, double _r) : c(_c), r(_r) {\n }\n};\n\n/**\n * @brief 円の交差判定を行います\n *\n * @param c1\n * @param c2\n * @return int 2つの円が離れている: 4, 外接: 3, 2点交差: 2, 内接: 1, 内包: 0\n */\nint checkIntersect(const Circle &c1, const Circle &c2) {\n double d = abs(c1.c - c2.c);\n if (d > c1.r + c2.r + EPS) {\n return 4;\n }\n // 外接している場合\n if (equals(d, c1.r + c2.r)) {\n return 3;\n }\n // 内接している場合\n if (equals(d, std::abs(c1.r - c2.r))) {\n return 1;\n }\n // 内包している場合\n if (d < std::abs(c1.r - c2.r) - EPS) {\n return 0;\n }\n return 2;\n}\n\nCircle incircle(const Vector2 &a, const Vector2 &b, const Vector2 &c) {\n double A = std::abs(b - c), B = std::abs(a - c), C = std::abs(a - b);\n Vector2 p(A * real(a) + B * real(b) + C * real(c),\n A * imag(a) + B * imag(b) + C * imag(c));\n p /= (A + B + C);\n double r = distance(p, Line(a, b));\n return Circle(p, r);\n}\n\nCircle incircle(const Polygon &p) {\n if (p.size() != 3) {\n throw std::invalid_argument(\"The size of p must be 3\");\n }\n return incircle(p[0], p[1], p[2]);\n}\n\n} // namespace geometry\n#line 7 \"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\"\n\nnamespace geometry {\n/**\n * @brief 円と直線の交点を求める\n *\n * @param c\n * @param l\n * @return std::vector<Vector2>\n */\nstd::vector<Vector2> crossPoint(const Circle &c, const Line &l) {\n std::vector<Vector2> res;\n double d = distance(c.c, l);\n // 交点を持たない\n if (d > c.r + EPS) {\n return res;\n }\n // 接する\n Vector2 h = projection(l, c.c);\n if (equals(d, c.r)) {\n res.emplace_back(h);\n return res;\n }\n Vector2 e = unitVector(l.b - l.a);\n double 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 * @brief 2直線の交点を求める\n *\n * @param s\n * @param t\n * @return Vector2 2直線が平行であればNaN, そうでなければ交点\n */\nVector2 crossPoint(const Line &s, const Line &t) {\n if (isParallel(s, t)) {\n return NaN;\n }\n double d1 = cross(s.b - s.a, t.b - t.a);\n double d2 = cross(s.b - s.a, s.b - t.a);\n if (equals(std::abs(d1), 0) && equals(std::abs(d2), 0)) {\n return t.a;\n }\n return t.a + (t.b - t.a) * (d2 / d1);\n}\n\n/**\n * @brief 2線分の交点を求める\n *\n * @param s\n * @param t\n * @return Vector2 2線分が交点を持たなければNaN, そうでなければ交点\n */\nVector2 crossPoint(const Segment &s, const Segment &t) {\n if (!hasIntersect(s, t)) {\n return NaN;\n }\n return crossPoint(Line(s), Line(t));\n}\n\n/**\n * @brief 2つの円の交点を求める\n *\n * @param c1\n * @param c2\n * @return vector<Point>\n */\nstd::vector<Vector2> crossPoint(const Circle &c1, const Circle &c2) {\n std::vector<Vector2> res;\n int mode = checkIntersect(c1, c2);\n // 2つの中心の距離\n double d = abs(c1.c - c2.c);\n // 2円が離れている場合\n if (mode == 4) {\n return res;\n }\n // 1つの円がもう1つの円に内包されている場合\n if (mode == 0) {\n return res;\n }\n // 2円が外接する場合\n if (mode == 3) {\n double t = c1.r / (c1.r + c2.r);\n res.emplace_back(c1.c + (c2.c - c1.c) * t);\n return res;\n }\n // 内接している場合\n if (mode == 1) {\n if (c2.r < c1.r - EPS) {\n res.emplace_back(c1.c + (c2.c - c1.c) * (c1.r / d));\n } else {\n res.emplace_back(c2.c + (c1.c - c2.c) * (c2.r / d));\n }\n return res;\n }\n // 2円が重なる場合\n double rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\n double rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\n if (c1.r - abs(rc1) < EPS) {\n rs1 = 0;\n }\n Vector2 e12 = (c2.c - c1.c) / abs(c2.c - c1.c);\n res.emplace_back(c1.c + rc1 * e12 + rs1 * e12 * Vector2(0, 1));\n res.emplace_back(c1.c + rc1 * e12 + rs1 * e12 * Vector2(0, -1));\n return res;\n}\n\n} // namespace geometry\n#line 2 \"/home/arc/project/comppro/cplib/geometry/util.cpp\"\n\n#line 4 \"/home/arc/project/comppro/cplib/geometry/util.cpp\"\nnamespace geometry {\n/**\n * @brief ラジアンから度に変換\n * \n * @param rad ラジアン\n * @return double 度\n */\ndouble radToDeg(const double rad) { return rad * 180.0 / M_PI; }\n\n/**\n * @brief 度からラジアンに変換\n * \n * @param deg 度\n * @return double ラジアン\n */\ndouble degToRad(const double deg) { return deg * M_PI / 180; }\n\n\n\n} // namespace geometry\n#line 2 \"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\"\n\n#line 4 \"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\"\n\n#line 2 \"/home/arc/project/comppro/cplib/graph/graph.cpp\"\n\n#line 6 \"/home/arc/project/comppro/cplib/graph/graph.cpp\"\n\ntemplate<typename CostType>\n/// \\brief 辺の情報\nstruct Edge{\n int to;\n CostType cost;\n\n Edge(int t, CostType c): to(t), cost(c){\n }\n};\n\ntemplate<typename CostType>\nclass Graph{\n\nprivate:\n\n /// \\brief adjacent_list_[n]=ノードnの隣接リストを表すvector<Edge>\n std::vector<std::vector<Edge<CostType>>> adjacent_list_;\n\npublic:\n\n /// \\brief 頂点数\n const int NODE_SIZE_;\n\n /// \\brief コンストラクタ\n /// \\param node_size 頂点数\n explicit Graph(const int node_size): NODE_SIZE_(node_size),\n adjacent_list_(node_size){\n }\n\n /// \\brief 有向グラフの辺を生やす\n /// \\param from 辺の根本の頂点の番号\n /// \\param to 辺の先の頂点の番号\n /// \\param cost 辺のコスト\n void SetDirectedEdge(const int from, const int to, const CostType cost){\n adjacent_list_[from].push_back(Edge<CostType>(to, cost));\n }\n\n /// \\brief 無向グラフの辺を生やす\n /// \\param node_a 一方の頂点の番号\n /// \\param node_b もう一方の頂点の番号\n /// \\param cost 辺のコスト\n void\n SetUndirectedEdge(const int node_a, const int node_b, const CostType cost){\n SetDirectedEdge(node_a, node_b, cost);\n SetDirectedEdge(node_b, node_a, cost);\n }\n\n /// \\brief ある頂点の隣接リストを取得\n /// \\param node_num 頂点の番号\n /// \\return 隣接リスト\n std::vector<Edge<CostType>> GetAdjacentList(int node_num) const{\n return adjacent_list_[node_num];\n }\n};\n\n\n\n\n\n#line 6 \"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\"\n\n/// \\brief ダイクストラ法により，ある頂点からの最短経路を求める\n/// \\tparam CostType 辺のコストの型\n/// \\param graph グラフ\n/// \\param start_node どの頂点から最短経路を求めるか\n/// \\param INF CostType型で十分大きい値\n/// \\param Identity 単位元(0など)\n/// \\return\n/// 1要素目:\n/// グラフの各頂点への最短経路を示す配列(到達不可能なときはINF)，負の辺が入っていた場合はsize0の配列\n/// 2要素目: 各頂点の前の頂点を示す配列(開始点は-1)\n/// 負の辺が入っていた場合はsize0の配列\ntemplate <typename CostType>\nstd::pair<std::vector<CostType>, std::vector<int>> Dijkstra(\n const Graph<CostType> &graph, const int start_node,\n CostType Identity, CostType INF) {\n struct Info {\n int node;\n CostType cost;\n\n Info(int n, CostType c) : node(n), cost(c){};\n\n bool operator>(const Info &another) const {\n return cost > another.cost;\n }\n };\n\n std::vector<CostType> min_cost(graph.NODE_SIZE_);\n std::vector<int> prev(graph.NODE_SIZE_, -1);\n std::priority_queue<Info, std::vector<Info>, std::greater<Info>> pq;\n for (int i = 0; i < min_cost.size(); i++) {\n min_cost[i] = (i == start_node) ? Identity : INF;\n }\n pq.push(Info(start_node, Identity));\n\n while (!pq.empty()) {\n Info current_info = pq.top();\n pq.pop();\n if (min_cost[current_info.node] < current_info.cost) {\n continue;\n }\n const std::vector<Edge<CostType>> &adjacency_list =\n graph.GetAdjacentList(current_info.node);\n for (auto e : adjacency_list) {\n if (min_cost[e.to] > min_cost[current_info.node] + e.cost) {\n min_cost[e.to] = min_cost[current_info.node] + e.cost;\n prev[e.to] = current_info.node;\n pq.push(Info(e.to, min_cost[e.to]));\n }\n }\n }\n\n return {min_cost, prev};\n}\n\n/**\n * @brief 経路復元を行う\n *\n * @param prev ダイクストラで得た戻り値のprev\n * @param g 最終ノード\n * @return std::vector<int> 開始点からgまでの最短パス\n */\nstd::vector<int> getPath(const std::vector<int> &prev, int g) {\n std::vector<int> res;\n int curr = g;\n while (prev[curr] != -1) {\n res.push_back(curr);\n curr = prev[curr];\n }\n res.push_back(curr);\n std::reverse(res.begin(), res.end());\n return res;\n}\n#line 69 \"main.cpp\"\n\n// 各線分ペアに対して: 交点を持っていればコスト0, そうでなければ4つの距離のmin で両端を結ぶ\n\nusing namespace geometry;\nstruct Star {\n vector<Vector2> points;\n Star(double x, double y, double a, double r) {\n points = vector<Vector2>(5);\n // 原点中心で☆を書く\n points[0] = rotate(Vector2(0, r), degToRad(a));\n for (int i = 1; i <= 4; i++) {\n points[i] = rotate(points[i-1], degToRad(144));\n }\n\n // 平行移動\n Vector2 move(x, y);\n for (auto &p : points) {\n p += move;\n }\n }\n Star() = default;\n};\n\nint getNode(int starId, int posId) {\n return starId * 5 + posId;\n}\n\ndouble solve(int n, int m, int L) {\n vector<Star> stars(n);\n for (int i = 0; i < n; i++) {\n int x, y, a, r;\n cin >> x >> y >> a >> r;\n stars[i] = Star(x, y, a, r);\n }\n\n Graph<double> graph(n * 5);\n for (int i = 0; i < stars.size(); i++) {\n for (int j = 0; j < 5; j++) {\n for (int k = j + 1; k < 5; k++) {\n graph.SetUndirectedEdge(getNode(i, j), getNode(i, k), 0);\n }\n }\n }\n\n for (int i = 0; i < stars.size(); i++) {\n for (int j = i + 1; j < stars.size(); j++) {\n for (int k = 0; k < 5; k++) {\n int siai = k;\n int sibi = (k + 1) % 5;\n Vector2 sia = stars[i].points[siai];\n Vector2 sib = stars[i].points[sibi];\n Segment segI(sia, sib);\n for (int l = 0; l < 5; l++) {\n int sjai = l;\n int sjbi = (l + 1) % 5;\n Vector2 sja = stars[j].points[sjai];\n Vector2 sjb = stars[j].points[sjbi];\n Segment segJ(sja, sjb);\n\n double cost;\n\n if (!hasIntersect(segI, segJ)) {\n // 4点距離\n cost = min({abs(sia - sja), abs(sia - sjb), abs(sib - sja),\n abs(sib - sjb),\n distance(sia, segJ),\n distance(sib, segJ),\n distance(sja, segI),\n distance(sjb, segI)});\n\n } else {\n cost = 0;\n }\n\n graph.SetUndirectedEdge(getNode(i, siai), getNode(j, sjai), cost);\n graph.SetUndirectedEdge(getNode(i, sibi), getNode(j, sjai), cost);\n graph.SetUndirectedEdge(getNode(i, siai), getNode(j, sjbi), cost);\n graph.SetUndirectedEdge(getNode(i, sibi), getNode(j, sjbi), cost);\n }\n }\n }\n }\n\n auto [res, _] = Dijkstra(graph, getNode(m - 1, 0), 0.0,\n numeric_limits<double>::infinity());\n\n return res[getNode(L - 1, 0)];\n}\n\nint main() {\n cout << std::fixed << std::setprecision(16);\n cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n // Segment seg(Vector2(0,0), Vector2(3,0)), seg2(Vector2(1,0), Vector2(2,0));\n // Vector2 cp = crossPoint(seg, seg2);\n // bool hasint = hasIntersect(seg, seg2);\n // cout<<cp.real()<<cp.imag()<<endl;\n // cout<<hasint<<endl;\n\n while (true) {\n int n, m, l;\n cin >> n >> m >> l;\n if (n == 0) {\n break;\n }\n cout << solve(n, m, l) << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":320,"memory_kb":20368,"score_of_the_acc":-0.8017,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2402_10668015\",\n \"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// 型関連\\nusing ll = long long;\\nusing lint = long long;\\nusing pll = pair<ll, ll>;\\nusing plll = tuple<ll, ll, ll>;\\nusing pii = pair<int, int>;\\nusing piii = tuple<ll, ll, ll>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vvvvi = vector<vector<vector<vector<int>>>>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\\n\\ntemplate <class T> using prique = priority_queue<T>;\\n\\n// 型定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll MOD = 1000000007;\\nint INF32 = 2e9;\\nll INF64 = 9e18;\\n#define endl '\\\\n';\\n\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\n\\n/////////////////////////// print関連\\ntemplate <typename T> void print(vector<T> A);\\nvoid print();\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\\nvoid print(string S);\\ntemplate <typename T> void print(vector<vector<T>> &F);\\n\\ninline void Yes(bool f);\\n\\n#define equals(a, b) (fabs((a) - (b)) < EPS)\\n\\nconst double EPS = 1e-10;\\nconst double PI = asinl(1) * 2;\\n\\nstruct Point {\\n double x, y;\\n Point() {}\\n Point(double x, double y) : x(x), y(y) {}\\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\\n Point operator*(double k) { return Point(x * k, y * k); }\\n Point operator/(double k) { return Point(x / k, y / k); }\\n double norm() { return x * x + y * y; }\\n double abs() { return sqrt(norm()); }\\n\\n bool operator<(const Point &p) const {\\n return x != p.x ? x < p.x : y < p.y;\\n // grid-point only\\n // return !equals(x,p.x)?x<p.x:!equals(y,p.y)?y<p.y:0;\\n }\\n\\n bool operator==(const Point &p) const {\\n return fabs(x - p.x) < EPS and fabs(y - p.y) < EPS;\\n }\\n};\\n\\nbool sort_x(Point a, Point b) { return a.x != b.x ? a.x < b.x : a.y < b.y; }\\n\\nbool sort_y(Point a, Point b) { return a.y != b.y ? a.y < b.y : a.x < b.x; }\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Segment {\\n Point p1, p2;\\n Segment() {}\\n Segment(Point p1, Point p2) : p1(p1), p2(p2) {}\\n};\\ntypedef Segment Line;\\n\\nstruct Circle {\\n Point c;\\n double r;\\n Circle() {}\\n Circle(Point c, double r) : c(c), r(r) {}\\n};\\n\\ndouble norm(Vector a) { return a.x * a.x + a.y * a.y; }\\n\\ndouble abs(Vector a) { return sqrt(norm(a)); }\\n\\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\\n\\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\\n\\nPoint orth(Point p) { return Point(-p.y, p.x); }\\n\\nbool isOrthogonal(Vector a, Vector b) { return equals(dot(a, b), 0.0); }\\n\\nbool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {\\n return isOrthogonal(a1 - a2, b1 - b2);\\n}\\n\\nbool isOrthogonal(Segment s1, Segment s2) {\\n return equals(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\\n}\\n\\nbool isParallel(Vector a, Vector b) { return equals(cross(a, b), 0.0); }\\n\\nbool isParallel(Point a1, Point a2, Point b1, Point b2) {\\n return isParallel(a1 - a2, b1 - b2);\\n}\\n\\nbool isParallel(Segment s1, Segment s2) {\\n return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);\\n}\\n\\nPoint project(Segment s, Point p) {\\n Vector base = s.p2 - s.p1;\\n double r = dot(p - s.p1, base) / norm(base);\\n return s.p1 + base * r;\\n}\\n\\nPoint reflect(Segment s, Point p) { return p + (project(s, p) - p) * 2.0; }\\n\\ndouble arg(Vector p) { return atan2(p.y, p.x); }\\n\\nVector polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }\\n\\n// COUNTER CLOCKWISE\\nstatic const int CCW_COUNTER_CLOCKWISE = 1;\\nstatic const int CCW_CLOCKWISE = -1;\\nstatic const int CCW_ONLINE_BACK = 2;\\nstatic const int CCW_ONLINE_FRONT = -2;\\nstatic const int CCW_ON_SEGMENT = 0;\\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)\\n return CCW_COUNTER_CLOCKWISE;\\n if (cross(a, b) < -EPS)\\n return CCW_CLOCKWISE;\\n if (dot(a, b) < -EPS)\\n return CCW_ONLINE_BACK;\\n if (a.norm() < b.norm())\\n return CCW_ONLINE_FRONT;\\n return CCW_ON_SEGMENT;\\n}\\n\\nbool intersectSS(Point p1, Point p2, Point p3, Point p4) {\\n return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 and\\n ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);\\n}\\n\\nbool intersectSS(Segment s1, Segment s2) {\\n return intersectSS(s1.p1, s1.p2, s2.p1, s2.p2);\\n}\\n\\nbool intersectPS(Polygon p, Segment l) {\\n int n = p.size();\\n for (int i = 0; i < n; ++i)\\n if (intersectSS(Segment(p[i], p[(i + 1) % n]), l))\\n return 1;\\n return 0;\\n}\\n\\ndouble getDistanceLP(Line l, Point p) {\\n return fabs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));\\n}\\n\\ndouble getDistanceSP(Segment s, Point p) {\\n if (dot(s.p2 - s.p1, p - s.p1) < 0.0)\\n return abs(p - s.p1);\\n if (dot(s.p1 - s.p2, p - s.p2) < 0.0)\\n return abs(p - s.p2);\\n return getDistanceLP(s, p);\\n}\\n\\ndouble getDistanceSS(Segment s1, Segment s2) {\\n if (intersectSS(s1, s2))\\n return 0.0;\\n return min(min(getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2)),\\n min(getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)));\\n}\\n\\n// intercsect of circles\\nstatic const int ICC_SEPERATE = 4;\\nstatic const int ICC_CIRCUMSCRIBE = 3;\\nstatic const int ICC_INTERSECT = 2;\\nstatic const int ICC_INSCRIBE = 1;\\nstatic const int ICC_CONTAIN = 0;\\n\\nint intersectCC(Circle c1, Circle c2) {\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n double d = abs(c1.c - c2.c);\\n double r = c1.r + c2.r;\\n if (equals(d, r))\\n return ICC_CIRCUMSCRIBE;\\n if (d > r)\\n return ICC_SEPERATE;\\n if (equals(d + c2.r, c1.r))\\n return ICC_INSCRIBE;\\n if (d + c2.r < c1.r)\\n return ICC_CONTAIN;\\n return ICC_INTERSECT;\\n}\\n\\nbool intersectSC(Segment s, Circle c) { return getDistanceSP(s, c.c) <= c.r; }\\n\\nint intersectCS(Circle c, Segment s) {\\n if (norm(project(s, c.c) - c.c) - c.r * c.r > EPS)\\n return 0;\\n double d1 = abs(c.c - s.p1), d2 = abs(c.c - s.p2);\\n if (d1 < c.r + EPS and d2 < c.r + EPS)\\n return 0;\\n if ((d1 < c.r - EPS and d2 > c.r + EPS) or\\n (d1 > c.r + EPS and d2 < c.r - EPS))\\n return 1;\\n Point h = project(s, c.c);\\n if (dot(s.p1 - h, s.p2 - h) < 0)\\n return 2;\\n return 0;\\n}\\n\\nPoint getCrossPointSS(Segment s1, Segment s2) {\\n for (int k = 0; k < 2; ++k) {\\n if (getDistanceSP(s1, s2.p1) < EPS)\\n return s2.p1;\\n if (getDistanceSP(s1, s2.p2) < EPS)\\n return s2.p2;\\n swap(s1, s2);\\n }\\n Vector base = s2.p2 - s2.p1;\\n double d1 = fabs(cross(base, s1.p1 - s2.p1));\\n double d2 = fabs(cross(base, s1.p2 - s2.p1));\\n double t = d1 / (d1 + d2);\\n return s1.p1 + (s1.p2 - s1.p1) * t;\\n}\\n\\nPoint getCrossPointLL(Line l1, Line l2) {\\n double a = cross(l1.p2 - l1.p1, l2.p2 - l2.p1);\\n double b = cross(l1.p2 - l1.p1, l1.p2 - l2.p1);\\n if (fabs(a) < EPS and fabs(b) < EPS)\\n return l2.p1;\\n return l2.p1 + (l2.p2 - l2.p1) * (b / a);\\n}\\n\\nPolygon getCrossPointCL(Circle c, Line l) {\\n Polygon ps;\\n Point pr = project(l, c.c);\\n Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);\\n if (equals(getDistanceLP(l, c.c), c.r)) {\\n ps.emplace_back(pr);\\n return ps;\\n }\\n double base = sqrt(c.r * c.r - norm(pr - c.c));\\n ps.emplace_back(pr + e * base);\\n ps.emplace_back(pr - e * base);\\n return ps;\\n}\\n\\nPolygon getCrossPointCS(Circle c, Segment s) {\\n Line l(s);\\n Polygon res = getCrossPointCL(c, l);\\n if (intersectCS(c, s) == 2)\\n return res;\\n if (res.size() > 1u) {\\n if (dot(l.p1 - res[0], l.p2 - res[0]) > 0)\\n swap(res[0], res[1]);\\n res.pop_back();\\n }\\n return res;\\n}\\n\\nPolygon getCrossPointCC(Circle c1, Circle c2) {\\n Polygon p(2);\\n double d = abs(c1.c - c2.c);\\n double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n double t = arg(c2.c - c1.c);\\n p[0] = c1.c + polar(c1.r, t + a);\\n p[1] = c1.c + polar(c1.r, t - a);\\n return p;\\n}\\n\\n// IN:2 ON:1 OUT:0\\nint contains(Polygon g, Point p) {\\n int n = g.size();\\n bool x = false;\\n for (int i = 0; i < n; ++i) {\\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\\n if (fabs(cross(a, b)) < EPS and dot(a, b) < EPS)\\n return 1;\\n if (a.y > b.y)\\n swap(a, b);\\n if (a.y < EPS and EPS < b.y and cross(a, b) > EPS)\\n x = !x;\\n }\\n return (x ? 2 : 0);\\n}\\n\\n// BEGIN IGNORE\\nPolygon andrewScan(Polygon s) {\\n Polygon u, l;\\n if (s.size() < 3)\\n return s;\\n sort(s.begin(), s.end());\\n u.push_back(s[0]);\\n u.push_back(s[1]);\\n l.push_back(s[s.size() - 1]);\\n l.push_back(s[s.size() - 2]);\\n for (int i = 2; i < (int)s.size(); ++i) {\\n for (int n = u.size();\\n n >= 2 and ccw(u[n - 2], u[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\\n u.pop_back();\\n }\\n u.push_back(s[i]);\\n }\\n for (int i = s.size() - 3; i >= 0; i--) {\\n for (int n = l.size();\\n n >= 2 and ccw(l[n - 2], l[n - 1], s[i]) != CCW_CLOCKWISE; n--) {\\n l.pop_back();\\n }\\n l.push_back(s[i]);\\n }\\n reverse(l.begin(), l.end());\\n for (int i = u.size() - 2; i >= 1; i--)\\n l.push_back(u[i]);\\n return l;\\n}\\n// END IGNORE\\n\\nPolygon convex_hull(Polygon ps) {\\n int n = ps.size();\\n sort(ps.begin(), ps.end(), sort_y);\\n int k = 0;\\n Polygon qs(n * 2);\\n for (int i = 0; i < n; ++i) {\\n while (k > 1 and cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0)\\n k--;\\n qs[k++] = ps[i];\\n }\\n for (int i = n - 2, t = k; i >= 0; i--) {\\n while (k > t and cross(qs[k - 1] - qs[k - 2], ps[i] - qs[k - 1]) < 0)\\n k--;\\n qs[k++] = ps[i];\\n }\\n qs.resize(k - 1);\\n return qs;\\n}\\n\\ndouble diameter(Polygon s) {\\n Polygon p = s;\\n int n = p.size();\\n if (n == 2)\\n return abs(p[0] - p[1]);\\n int i = 0, j = 0;\\n for (int k = 0; k < n; ++k) {\\n if (p[i] < p[k])\\n i = k;\\n if (!(p[j] < p[k]))\\n j = k;\\n }\\n double res = 0;\\n int si = i, sj = j;\\n while (i != sj or j != si) {\\n res = max(res, abs(p[i] - p[j]));\\n if (cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) < 0.0) {\\n i = (i + 1) % n;\\n } else {\\n j = (j + 1) % n;\\n }\\n }\\n return res;\\n}\\n\\nbool isConvex(Polygon p) {\\n bool f = 1;\\n int n = p.size();\\n for (int i = 0; i < n; ++i) {\\n int t = ccw(p[(i + n - 1) % n], p[i], p[(i + 1) % n]);\\n f &= t != CCW_CLOCKWISE;\\n }\\n return f;\\n}\\n\\ndouble area(Polygon s) {\\n double res = 0;\\n for (int i = 0; i < (int)s.size(); ++i) {\\n res += cross(s[i], s[(i + 1) % s.size()]) / 2.0;\\n }\\n return res;\\n}\\n\\ndouble area(Circle c1, Circle c2) {\\n double d = abs(c1.c - c2.c);\\n if (c1.r + c2.r <= d + EPS)\\n return 0;\\n if (d <= fabs(c1.r - c2.r)) {\\n double r = min(c1.r, c2.r);\\n return PI * r * r;\\n }\\n double res = 0;\\n for (int k = 0; k < 2; ++k) {\\n double rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d * c1.r);\\n double th = acosl(rc) * 2;\\n res += (th - sinl(th)) * c1.r * c1.r / 2;\\n swap(c1, c2);\\n }\\n return res;\\n}\\n\\nPolygon convexCut(Polygon p, Line l) {\\n Polygon q;\\n for (int i = 0; i < (int)p.size(); ++i) {\\n Point a = p[i], b = p[(i + 1) % p.size()];\\n if (ccw(l.p1, l.p2, a) != -1)\\n q.push_back(a);\\n if (ccw(l.p1, l.p2, a) * ccw(l.p1, l.p2, b) < 0)\\n q.push_back(getCrossPointLL(Line(a, b), l));\\n }\\n return q;\\n}\\n\\nLine bisector(Point p1, Point p2) {\\n Circle c1 = Circle(p1, abs(p1 - p2)), c2 = Circle(p2, abs(p1 - p2));\\n Polygon p = getCrossPointCC(c1, c2);\\n if (cross(p2 - p1, p[0] - p1) > 0)\\n swap(p[0], p[1]);\\n return Line(p[0], p[1]);\\n}\\n\\nVector translate(Vector v, double theta) {\\n Vector res;\\n res.x = cos(theta) * v.x - sin(theta) * v.y;\\n res.y = sin(theta) * v.x + cos(theta) * v.y;\\n return res;\\n}\\n\\nvector<Line> corner(Line l1, Line l2) {\\n vector<Line> res;\\n if (isParallel(l1, l2)) {\\n double d = getDistanceLP(l1, l2.p1) / 2.0;\\n Vector v1 = l1.p2 - l1.p1;\\n v1 = v1 / v1.abs() * d;\\n Point p = l2.p1 + translate(v1, 90.0 * (PI / 180.0));\\n double d1 = getDistanceLP(l1, p);\\n double d2 = getDistanceLP(l2, p);\\n if (fabs(d1 - d2) > d) {\\n p = l2.p1 + translate(v1, -90.0 * (PI / 180.0));\\n }\\n res.push_back(Line(p, p + v1));\\n } else {\\n Point p = getCrossPointLL(l1, l2);\\n Vector v1 = l1.p2 - l1.p1, v2 = l2.p2 - l2.p1;\\n v1 = v1 / v1.abs();\\n v2 = v2 / v2.abs();\\n res.push_back(Line(p, p + (v1 + v2)));\\n res.push_back(Line(p, p + translate(v1 + v2, 90.0 * (PI / 180.0))));\\n }\\n return res;\\n}\\n\\nPolygon tangent(Circle c1, Point p2) {\\n Circle c2 = Circle(p2, sqrt(norm(c1.c - p2) - c1.r * c1.r));\\n Polygon p = getCrossPointCC(c1, c2);\\n sort(p.begin(), p.end());\\n return p;\\n}\\n\\nvector<Line> tangent(Circle c1, Circle c2) {\\n vector<Line> ls;\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n double g = norm(c1.c - c2.c);\\n if (equals(g, 0))\\n return ls;\\n Point u = (c2.c - c1.c) / sqrt(g);\\n Point v = orth(u);\\n for (int s = 1; s >= -1; s -= 2) {\\n double h = (c1.r + s * c2.r) / sqrt(g);\\n if (equals(1 - h * h, 0)) {\\n ls.emplace_back(c1.c + u * c1.r, c1.c + (u + v) * c1.r);\\n } else if (1 - h * h > 0) {\\n Point uu = u * h, vv = v * sqrt(1 - h * h);\\n ls.emplace_back(c1.c + (uu + vv) * c1.r,\\n c2.c - (uu + vv) * c2.r * s);\\n ls.emplace_back(c1.c + (uu - vv) * c1.r,\\n c2.c - (uu - vv) * c2.r * s);\\n }\\n }\\n\\n return ls;\\n}\\n\\ndouble closest_pair(Polygon &a, int l = 0, int r = -1) {\\n if (r < 0) {\\n r = a.size();\\n sort(a.begin(), a.end(), sort_x);\\n }\\n if (r - l <= 1)\\n return abs(a[0] - a[1]);\\n int m = (l + r) >> 1;\\n double x = a[m].x;\\n double d = min(closest_pair(a, l, m), closest_pair(a, m, r));\\n inplace_merge(a.begin() + l, a.begin() + m, a.begin() + r, sort_y);\\n\\n Polygon b;\\n for (int i = l; i < r; ++i) {\\n if (fabs(a[i].x - x) >= d)\\n continue;\\n for (int j = 0; j < (int)b.size(); ++j) {\\n double dy = a[i].y - next(b.rbegin(), j)->y;\\n if (dy >= d)\\n break;\\n d = min(d, abs(a[i] - *next(b.rbegin(), j)));\\n }\\n b.emplace_back(a[i]);\\n }\\n return d;\\n}\\n\\nvector<vector<int>> segmentArrangement(vector<Segment> &ss, Polygon &ps) {\\n int n = ss.size();\\n for (int i = 0; i < n; ++i) {\\n ps.emplace_back(ss[i].p1);\\n ps.emplace_back(ss[i].p2);\\n for (int j = i + 1; j < n; ++j)\\n if (intersectSS(ss[i], ss[j]))\\n ps.emplace_back(getCrossPointSS(ss[i], ss[j]));\\n }\\n sort(ps.begin(), ps.end());\\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\\n\\n vector<vector<int>> G(ps.size());\\n for (int i = 0; i < n; ++i) {\\n vector<pair<double, int>> ls;\\n for (int j = 0; j < (int)ps.size(); ++j)\\n if (getDistanceSP(ss[i], ps[j]) < EPS)\\n ls.emplace_back(make_pair(norm(ss[i].p1 - ps[j]), j));\\n\\n sort(ls.begin(), ls.end());\\n for (int j = 0; j + 1 < (int)ls.size(); ++j) {\\n int a = ls[j].second, b = ls[j + 1].second;\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n }\\n for (auto &v : G) {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n }\\n return G;\\n}\\n\\nstruct EndPoint {\\n Point p;\\n int seg, st;\\n EndPoint() {}\\n EndPoint(Point p, int seg, int st) : p(p), seg(seg), st(st) {}\\n bool operator<(const EndPoint &ep) const {\\n if (p.y == ep.p.y)\\n return st < ep.st;\\n return p.y < ep.p.y;\\n }\\n};\\n\\nint manhattan_intersection(vector<Segment> ss, const int INF) {\\n const int BTM = 0;\\n const int LFT = 1;\\n const int RGH = 2;\\n const int TOP = 3;\\n\\n int n = ss.size();\\n vector<EndPoint> ep;\\n for (int i = 0; i < n; ++i) {\\n if (ss[i].p1.y == ss[i].p2.y) {\\n if (ss[i].p1.x > ss[i].p2.x)\\n swap(ss[i].p1, ss[i].p2);\\n ep.emplace_back(ss[i].p1, i, LFT);\\n ep.emplace_back(ss[i].p2, i, RGH);\\n } else {\\n if (ss[i].p1.y > ss[i].p2.y)\\n swap(ss[i].p1, ss[i].p2);\\n ep.emplace_back(ss[i].p1, i, BTM);\\n ep.emplace_back(ss[i].p2, i, TOP);\\n }\\n }\\n sort(ep.begin(), ep.end());\\n\\n set<int> bt;\\n bt.insert(INF);\\n\\n int cnt = 0;\\n for (int i = 0; i < n * 2; ++i) {\\n if (ep[i].st == TOP) {\\n bt.erase(ep[i].p.x);\\n } else if (ep[i].st == BTM) {\\n bt.emplace(ep[i].p.x);\\n } else if (ep[i].st == LFT) {\\n auto b = bt.lower_bound(ss[ep[i].seg].p1.x);\\n auto e = bt.upper_bound(ss[ep[i].seg].p2.x);\\n cnt += distance(b, e);\\n }\\n }\\n\\n return cnt;\\n}\\n\\ndouble area(Polygon ps, Circle c) {\\n if (ps.size() < 3u)\\n return 0;\\n function<double(Circle, Point, Point)> dfs = [&](Circle c, Point a,\\n Point b) {\\n Vector va = c.c - a, vb = c.c - b;\\n double f = cross(va, vb), res = 0;\\n if (equals(f, 0.0))\\n return res;\\n if (max(abs(va), abs(vb)) < c.r + EPS)\\n return f;\\n Vector d(dot(va, vb), cross(va, vb));\\n if (getDistanceSP(Segment(a, b), c.c) > c.r - EPS)\\n return c.r * c.r * atan2(d.y, d.x);\\n auto u = getCrossPointCS(c, Segment(a, b));\\n if (u.empty())\\n return res;\\n if (u.size() > 1u and dot(u[1] - u[0], a - u[0]) > 0)\\n swap(u[0], u[1]);\\n u.emplace(u.begin(), a);\\n u.emplace_back(b);\\n for (int i = 1; i < (int)u.size(); ++i)\\n res += dfs(c, u[i - 1], u[i]);\\n return res;\\n };\\n double res = 0;\\n for (int i = 0; i < (int)ps.size(); ++i)\\n res += dfs(c, ps[i], ps[(i + 1) % ps.size()]);\\n return res / 2;\\n}\\n\\ndouble dis(Point a, Point b) {\\n return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\\n}\\n\\n///////////////////ここから//////////////////////\\nbool solve() {\\n int N, M, L;\\n cin >> N >> M >> L;\\n if (N == 0) {\\n return false;\\n }\\n M--;\\n L--;\\n vector<vector<Point>> vvP(N);\\n for (int i = 0; i < N; i++) {\\n double x, y, a, r;\\n cin >> x >> y >> a >> r;\\n for (int j = 0; j < 5; j++) {\\n double theta = -a * M_PI / 180 - 2 * M_PI * j / 5;\\n double xj = x + r * sin(theta), yj = y + r * cos(theta);\\n vvP[i].emplace_back(xj, yj);\\n }\\n }\\n vector<vector<double>> E(N, vector<double>(N, INF32));\\n for (int i = 0; i < N; i++) {\\n for (int j = i; j < N; j++) {\\n for (int k = 0; k < 5; k++) {\\n for (int l = 0; l < 5; l++) {\\n \\n \\n Segment S1(vvP[i][k], vvP[i][(k + 2) % 5]);\\n Segment S2(vvP[j][l], vvP[j][(l + 2) % 5]);\\n if (intersectSS(S1, S2)) {\\n E[i][j] = 0;\\n E[j][i] = 0;\\n }\\n\\n\\n double d = min(getDistanceSP(S1, vvP[j][l]),getDistanceSP(S2, vvP[i][k]));\\n \\n E[i][j] = min(E[i][j], d);\\n E[j][i] = min(E[j][i], d);\\n }\\n }\\n }\\n }\\n for (int k = 0; k < N; k++) {\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (E[i][j] > E[i][k] + E[k][j]) {\\n E[i][j] = E[i][k] + E[k][j];\\n }\\n }\\n }\\n }\\n cout << fixed << setprecision(10);\\n cout << E[M][L] << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n while (solve())\\n ;\\n}\\n\\n////////////////////print/////////////////////////\\n// 1次元ベクトルを出力する\\ntemplate <typename T> void print(vector<T> A) {\\n if (A.size() == 0) {\\n return;\\n }\\n for (size_t i = 0; i < A.size() - 1; i++) {\\n cout << A[i] << ' ';\\n }\\n cout << A[A.size() - 1] << endl;\\n return;\\n}\\n\\n// 2次元ベクトルを出力する\\ntemplate <typename T> void print(vector<vector<T>> &F) {\\n for (size_t i = 0; i < F.size(); i++) {\\n for (size_t j = 0; j < F[i].size(); j++) {\\n cout << F[i][j];\\n if (j < F[i].size() - 1) {\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\\n\\n// 空白行を出力するprint\\nvoid print() { cout << endl; }\\n\\n// 数値・文字列を空白区切りで出力する. print(a,b)など\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n cout << head;\\n if (sizeof...(tail) != 0)\\n cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid print(string S) { cout << S << endl; }\\n\\n//////////////出力関連\\n\\ninline void Yes(bool f) {\\n if (f) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.0224,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2402_10649930\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 書きかけの幾何ライブラリ\\n// バグがあるかも\\n\\nnamespace geometry {\\n\\nusing Real = long double;\\nconstexpr Real eps = 1e-12;\\nconstexpr Real PI = acosl(-1);\\nconstexpr Real INF_REAL = numeric_limits<Real>::max();\\n\\nbool equal_eps(Real a, Real b) {\\n return abs(a - b) < eps;\\n}\\n\\nint sgn(Real a) {\\n return equal_eps(a, 0) ? 0 : a > 0 ? 1 : -1;\\n}\\n\\nstruct Point {\\n Real x, y;\\n constexpr Point() : Point(0, 0) {}\\n constexpr Point(Real _x, Real _y) : x(_x), y(_y) {}\\n constexpr Point(const pair<Real, Real> &p) : x(p.first), y(p.second) {}\\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*=(const Real &r) {\\n x *= r;\\n y *= r;\\n return *this;\\n }\\n Point &operator/=(const Real &r) {\\n assert(!equal_eps(r, 0));\\n x /= r;\\n y /= r;\\n return *this;\\n }\\n Point operator+(const Point &p) const { return Point(*this) += p; }\\n Point operator-(const Point &p) const { return Point(*this) -= p; }\\n Point operator*(const Real &r) const { return Point(*this) *= r; }\\n Point operator/(const Real &r) const { return Point(*this) /= r; }\\n Point operator-() const { return Point() - *this; }\\n bool operator==(const Point &p) const {\\n return equal_eps(x, p.x) && equal_eps(y, p.y);\\n }\\n bool operator!=(const Point &p) const {\\n return !equal_eps(x, p.x) || !equal_eps(y, p.y);\\n }\\n Point rotate(Real rad) const {\\n Real c = cosl(rad), s = sinl(rad);\\n Real tx = x * c - y * s;\\n Real ty = x * s + y * c;\\n return Point(tx, ty);\\n }\\n Point unit() const {\\n return (*this) / metric();\\n }\\n Real Re() const { return x; }\\n Real Im() const { return y; }\\n Real norm() const { return x * x + y * y; }\\n Real metric() const { return sqrtl(norm()); }\\n Real arg() const { return atan2l(y, x); }\\n Real arg(Point q1, Point q2) const {\\n q1 -= *this, q2 -= *this;\\n return abs(q1.arg() - q2.arg());\\n }\\n friend Point operator*(Real r, const Point &p) {\\n return p * r;\\n }\\n friend Point operator/(Real r, const Point &p) {\\n return p / r;\\n }\\n};\\n\\nReal Re(const Point &p) { return p.Re(); }\\nReal Im(const Point &p) { return p.Im(); }\\nReal dot(const Point &p, const Point &q) {\\n return p.x * q.x + p.y * q.y;\\n}\\nReal cross(const Point &p, const Point &q) {\\n return p.x * q.y - p.y * q.x;\\n}\\nReal norm(const Point &p) {\\n return p.norm();\\n}\\nReal metric(const Point &p) {\\n return p.metric();\\n}\\nReal metric(const Point &p, const Point &q) {\\n return metric(p - q);\\n}\\nReal arg(const Point &p) {\\n return p.arg();\\n}\\n\\nbool equal_point(const Point &p, const Point &q) {\\n return equal_eps(p.x, q.x) && equal_eps(p.y, q.y);\\n}\\n\\nconstexpr Point INF_POINT = Point(INF_REAL, INF_REAL);\\n\\n// a を基準にした b と c の位置関係\\nint ccw(const Point &a, const Point &b, const Point &c) {\\n Point p = b - a, q = c - a;\\n if (cross(p, q) > eps) return 1; // a, b, c の順で反時計回り\\n if (cross(p, q) < -eps) return -1; // a, b, c の順で時計回り\\n if (min(norm(p), norm(q)) < eps * eps) return 0; // a = c or b = c\\n if (dot(p, q) < eps) return 2; // c, a, b の順で一直線\\n if (norm(p) < norm(q)) return -2; // a, b, c の順で一直線\\n return 0; // a, c, b の順で一直線\\n}\\n\\nistream &operator>>(istream &is, Point& p) {\\n Real x, y;\\n is >> x >> y;\\n p = Point(x, y);\\n return is;\\n}\\n\\n} // namespace geometry\\n\\nnamespace geometry {\\n\\nstruct Line {\\n // Line : ax + by = c\\n Real a, b, c;\\n constexpr Line() = default;\\n constexpr Line(Real _a, Real _b, Real _c) : a(_a), b(_b), c(_c) {}\\n constexpr Line(const Point &p, const Point &q) : a(q.y - p.y), b(p.x - q.x), c(p.x * q.y - p.y * q.x) {}\\n constexpr Line(Real _a, const Point &p) : a(_a), b(-1), c(_a * p.x - p.y) {}\\n bool online(const Point &p) const {\\n return equal_eps(a * p.x + b * p.y, c);\\n }\\n Real get_x(Real y) const {\\n if (equal_eps(a, 0)) return INF_REAL;\\n return (c - b * y) / a;\\n }\\n Real get_y(Real x) const {\\n if (equal_eps(b, 0)) return INF_REAL;\\n return (c - a * x) / b;\\n }\\n Line perpendicular(const Point &p) const {\\n if (equal_eps(a, 0)) return Line(1, 0, p.x);\\n if (equal_eps(0, b)) return Line(0, 1, p.y);\\n return Line(b / a, p);\\n }\\n Point crossppoint(const Line &l) const {\\n if (equal_eps(a * l.b, l.a * b)) return INF_POINT;\\n Real d = a * l.b - l.a * b;\\n return Point(l.b * c - b * l.c, l.c * a - c * l.a) / d;\\n }\\n Point projection(const Point &p) const {\\n return crossppoint(perpendicular(p));\\n }\\n Point reflection(const Point &p) const {\\n Point q = projection(p);\\n return 2 * q - p;\\n }\\n Point unit() const {\\n if (equal_eps(b, 0)) {\\n return Point(0, 1);\\n }\\n Point p(0, get_y(0)), q(1, get_y(1));\\n return (p - q) / metric(p - q);\\n }\\n bool is_orthogonal(const Line &l) const {\\n return equal_eps(a * l.a + b * l.b, 0);\\n }\\n bool is_parallel(const Line &l) const {\\n return equal_eps(a * l.b, l.a * b);\\n }\\n Real dist(const Point &p) const {\\n Point q = projection(p);\\n return metric(p - q);\\n }\\n};\\n\\nbool is_orthogonal(const Line &l1, const Line &l2) {\\n return l1.is_orthogonal(l2);\\n}\\nbool is_parallel(const Line &l1, const Line &l2) {\\n return l1.is_parallel(l2);\\n}\\nPoint crosspoint(const Line &l1, const Line &l2) {\\n return l1.crossppoint(l2);\\n}\\n\\n} // namespace geometry\\n\\nnamespace geometry {\\n\\nstruct Segment {\\n Line l;\\n Point p, q;\\n Segment() = default;\\n Segment(const Point &_p, const Point &_q) : l(_p, _q), p(_p), q(_q) {}\\n bool cross(const Segment &s) const {\\n bool f1 = ccw(p, q, s.p) * ccw(p, q, s.q) <= 0;\\n bool f2 = ccw(s.p, s.q, p) * ccw(s.p, s.q, q) <= 0;\\n return f1 && f2;\\n }\\n Point crosspoint(const Segment &s) const {\\n if (cross(s)) return l.crossppoint(s.l);\\n return INF_POINT;\\n }\\n Real dist(const Point &r) const {\\n if (dot(q - p, r - p) < eps) return (r - p).metric();\\n if (dot(p - q, r - q) < eps) return (r - q).metric();\\n return l.dist(r);\\n }\\n Real dist(const Segment &s) const {\\n if (cross(s)) return 0;\\n Real res = INF_REAL;\\n res = min(res, dist(s.p));\\n res = min(res, dist(s.q));\\n res = min(res, s.dist(p));\\n res = min(res, s.dist(q));\\n return res;\\n }\\n};\\n\\nbool cross(const Segment &s, const Segment &t) {\\n return s.cross(t);\\n}\\n\\nPoint crosspoint(const Segment &s, const Segment &t) {\\n return s.crosspoint(t);\\n}\\n\\nReal dist(const Segment &s, const Segment &t) {\\n return s.dist(t);\\n}\\n\\n} // nemespace geometry\\nusing namespace geometry;\\n\\nReal theta(Real t) {\\n return t * PI / 180;\\n}\\n\\nbool solve() {\\n int N, M, L;\\n cin >> N >> M >> L;\\n if (N == 0) return false;\\n M--, L--;\\n vector<array<Segment, 5>> stars(N);\\n for (int i = 0; i < N; i++) {\\n Point p;\\n Real a, r;\\n cin >> p >> a >> r;\\n a += 90;\\n auto &S = stars[i];\\n for (int j = 0; j < 5; j++) {\\n int k = j + 2;\\n S[j] = Segment(\\n p + r * Point(cosl(theta(a + j * 72)), sinl(theta(a + j * 72))),\\n p + r * Point(cosl(theta(a + k * 72)), sinl(theta(a + k * 72)))\\n );\\n }\\n }\\n vector<vector<Real>> D(N, vector<Real>(N, INF_REAL / 3));\\n for (int i = 0; i < N; i++) {\\n for (int j = i; j < N; j++) {\\n for (auto s : stars[i]) {\\n for (auto t : stars[j]) {\\n D[i][j] = D[j][i] = min(D[i][j], s.dist(t));\\n }\\n }\\n }\\n }\\n for (int k = 0; k < N; k++) {\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n D[i][j] = min(D[i][j], D[i][k] + D[k][j]);\\n }\\n }\\n }\\n cout << fixed << setprecision(16) << D[M][L] << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4480,\n \"score_of_the_acc\": -0.086,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2402_10556324\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 60;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\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<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\n\\n\\n//参考 https://github.com/saphmitchy/deliair-lib\\n// 型名\\n// R:Real, P:Point, L:Line, S:Segment, C:Circle, VP:vector<Point>\\n\\n#define X(p) real(p)\\n#define Y(p) imag(p)\\n\\nusing R = ld;\\nusing P = complex<R>;\\nusing VP = vector<P>;\\n\\n//const R EPS = 1e-9; // ここは適宜調節する,いつものやつから消す\\nconst R pi = acos(-1.0);\\n\\nint sgn(R a) {\\n return (a < -EPS) ? -1 : (a > EPS) ? 1 : 0;\\n} // 符号関数\\n\\nbool eq(R a, R b) {//実数の一致判定\\n return sgn(b - a) == 0;\\n}\\n\\nP operator*(P p, R d) {//ベクトルのd倍\\n return P(X(p) * d, Y(p) * d);\\n}\\n\\nP operator/(P p, R d) {//ベクトルの1/d倍\\n return p * (1 / d);\\n}\\n\\nistream &operator>>(istream &is, P &p) {\\n // R a, b; // 入力が小数\\n int a, b; // 入力が整数\\n is >> a >> b;\\n p = P(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, P p) {\\n return os << X(p) << ' ' << Y(p);\\n}\\n\\nR getarg(P b,P a){//ベクトルbはベクトルaを何radian回転させる必要があるか\\n assert(sgn(abs(a)) != 0);//長さが0はだめ\\n return arg(b/a);\\n}\\n\\nbool cp_x(P p, P q) {//ベクトルの比較x軸で比較->y軸で比較\\n if (!eq(X(p), X(q)))\\n return X(p) < X(q);\\n return Y(p) < Y(q);\\n}\\n\\nbool cp_y(P p, P q) {//ベクトルの比較y軸で比較->x軸で比較\\n if (!eq(Y(p), Y(q)))\\n return Y(p) < Y(q);\\n return X(p) < X(q);\\n}\\n\\nstruct L {//直線ab\\n P a, b;\\n L() {}\\n L(P a, P b) : a(a), b(b) {}\\n\\n // 入出力（必要なら）\\n friend ostream &operator<<(ostream &os, L &l) {\\n return os << l.a << ' ' << l.b;\\n }\\n friend istream &operator>>(istream &is, L &l) {\\n return is >> l.a >> l.b;\\n }\\n};\\n\\nstruct S : L {//線分ab\\n S() {}\\n S(P a, P b) : L(a, b) {}\\n};\\n\\nstruct C {//中心p 半径rの円\\n P p;\\n R r;\\n C() {}\\n C(P p, R r) : p(p), r(r) {}\\n};\\n\\nP rot(P p, R t) {//ベクトルの回転\\n return p * P(cos(t), sin(t));\\n}\\n\\n//2つのベクトルの内積\\nR dot(P p, P q) {\\n return X(p) * X(q) + Y(p) * Y(q);\\n}\\n\\n//2つのベクトルの外積\\nR det(P p, P q) {\\n return X(p) * Y(q) - Y(p) * X(q);\\n}\\n\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C&lang=jp\\nint ccw(P a, P b, P c) { // 線分 ab に対する c の位置関係 \\n b -= a, c -= a;//ベクトルab,ベクトルacにした\\n if (sgn(det(b, c)) == 1)//外積右ねじ正\\n return +1; // COUNTER_CLOCKWISE a,b,cが反時計回り\\n if (sgn(det(b, c)) == -1)\\n return -1; // CLOCKWISE\\n if (dot(b, c) < 0.0)\\n return +2; // ONLINE_BACK\\n if (norm(b) < norm(c))\\n return -2; // ONLINE_FRONT\\n return 0; // ON_SEGMENT\\n}\\n\\nbool para(L a, L b) { // 平行判定\\n return eq(det(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\nbool orth(L a, L b) { // 垂直判定\\n return eq(dot(a.b - a.a, b.b - b.a), 0.0);\\n}\\n\\nP proj(L l, P p) { // 垂線の足\\n R t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\\n return l.a + (l.b - l.a) * t;\\n}\\n\\n// これいる？\\n// P proj(S s, P p) {\\n// R t = dot(p - s.a, s.b - s.a) / norm(s.b - s.a);\\n// return s.a + (s.b - s.a) * t;\\n// }\\n\\nP refl(L l, P p) { // 線対称の位置にある点\\n return p + (proj(l, p) - p) * 2.0;\\n}\\n\\nbool inter(L l, P p) { // 交点を持つか判定\\n return abs(ccw(l.a, l.b, p)) != 1;\\n}\\n\\nbool inter(S s, P p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\nbool inter(L l, L m) {\\n if (!eq(det(l.b - l.a, m.b - m.a), 0.0))\\n return true;\\n return eq(det(l.b - l.a, m.b - l.a), 0.0);\\n}\\n\\nbool inter(L l, S s) {\\n return sgn(det(l.b - l.a, s.a - l.a) * det(l.b - l.a, s.b - l.a)) <= 0;\\n}\\n\\nbool inter(S s, L l) {\\n return inter(l, s);\\n}\\n\\nbool inter(S s, S t) {\\n if (ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) > 0)\\n return false;\\n return ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\nR dist(P p, P q) {\\n return abs(q - p);\\n}\\n\\nR dist(L l, P p) {\\n return abs(p - P(proj(l, p)));\\n}\\n\\n//R dist(S s, P p) {\\n// P h = proj(s, p);\\n// if (inter(s, h))\\n// return abs(h - p);\\n// return min(abs(s.a - p), abs(s.b - p));\\n//}\\n\\nR dist(S s, P p) {\\n P h = proj(s, p);\\n if(dot(p-s.a,s.b-s.a) <= 0) return abs(s.a-p);\\n if(dot(p-s.b,s.a-s.b) <= 0) return abs(s.b-p);\\n return abs(p - h);\\n}\\n\\nR dist(L l, L m) {\\n return inter(l, m) ? 0.0 : dist(l, m.a);\\n}\\n\\nR dist(S s, S t) {\\n if (inter(s, t))\\n return 0.0;\\n return min({dist(s, t.a), dist(s, t.b), dist(t, s.a), dist(t, s.b)});\\n}\\n\\nR dist(L l, S s) {\\n if (inter(l, s))\\n return 0.0;\\n return min(dist(l, s.a), dist(l, s.b));\\n}\\n\\nR dist(S s, L l) {\\n return dist(l, s);\\n}\\n\\nbool inter(C c, L l) {\\n return sgn(c.r - dist(l, c.p)) >= 0;\\n}\\n\\nbool inter(C c, P p) {\\n return eq(abs(p - c.p), c.r);\\n}\\n\\n// 共通接線の本数\\n// 交点なし:4\\n// 外接:3\\n// 2点で交わる:2\\n// 内接:1\\n// 一方がもう一方を内包:0\\nint inter(C c1, C c2) {\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n R d = abs(c1.p - c2.p);\\n int a = sgn(d - c1.r - c2.r);\\n if (a >= 0)\\n return 3 + a;\\n return 1 + sgn(d - c1.r + c2.r);\\n}\\n\\nVP crosspoint(L l, L m) {\\n VP ret;\\n if (!inter(l, m))\\n return ret;\\n R A = det(l.b - l.a, m.b - m.a);\\n R B = det(l.b - l.a, l.b - m.a);\\n if (eq(A, 0.0) && eq(B, 0.0)) {\\n ret.emplace_back(m.a);\\n } else {\\n ret.emplace_back(m.a + (m.b - m.a) * B / A);\\n }\\n return ret;\\n}\\n\\nVP crosspoint(S s, S t) {\\n return inter(s, t) ? crosspoint(L(s), L(t)) : VP();\\n}\\n\\nVP crosspoint(C c, L l) {//円と直線の交点\\n P h = proj(l, c.p);\\n P e = (l.b - l.a) / abs(l.b - l.a);\\n VP ret;\\n if (!inter(c, l))\\n return ret;\\n if (eq(dist(l, c.p), c.r)) {\\n ret.emplace_back(h);\\n } else {\\n R b = sqrt(c.r * c.r - norm(h - c.p));\\n ret.push_back(h + e * b), ret.push_back(h - e * b);\\n }\\n return ret;\\n}\\n\\nVP crosspoint(C c, S s) {//円と線分の交点\\n P h = proj(s, c.p);\\n P e = (s.b - s.a) / abs(s.b - s.a);\\n VP ret;\\n if (!inter(c, s))\\n return ret;\\n if (eq(dist(s, c.p), c.r)) {\\n ret.emplace_back(h);\\n } else {\\n R b = sqrt(c.r * c.r - norm(h - c.p));\\n if(ccw(s.a,s.b,h - e * b) == 0){//s.aに近い方から線分上なら追加する\\n ret.push_back(h - e * b);\\n }\\n if(ccw(s.a,s.b,h + e * b)==0){\\n ret.push_back(h + e * b);\\n }\\n }\\n return ret;\\n}\\n\\nVP crosspoint(C c1, C c2) {//2つの円の交わる点\\n R d = abs(c1.p - c2.p);\\n R a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n R t = atan2(Y(c2.p) - Y(c1.p), X(c2.p) - X(c1.p));\\n VP ret;\\n if (inter(c1, c2) % 4 == 0) // 交わらないとき\\n return ret;\\n if (eq(a, 0.0)) {\\n ret.emplace_back(P(c1.p + rot(P(c1.r, 0.0), t)));\\n } else {\\n P p1 = c1.p + rot(P(c1.r, 0.0), t + a);\\n P p2 = c1.p + rot(P(c1.r, 0.0), t - a);\\n ret.emplace_back(p1), ret.emplace_back(p2);\\n }\\n return ret;\\n}\\n\\nVP cut(VP p, L l, bool border = true) { // 直線が多角形に切り取られる区間\\n int n = sz(p);\\n p.emplace_back(p[0]), p.emplace_back(p[1]);\\n VP ret;\\n rep(i, n) {\\n if (!eq(dist(l, p[i]), 0) && !eq(dist(l, p[i + 1]), 0)) {\\n S s(p[i], p[i + 1]);\\n if (eq(dist(l, s), 0)) {\\n auto res = crosspoint(l, s);\\n ret.emplace_back(res[0]);\\n }\\n }\\n if (eq(dist(l, p[i + 1]), 0)) {\\n if ((eq(dist(l, p[i]), 0) || eq(dist(l, p[i + 2]), 0)) && !border)\\n continue;\\n S s(p[i], p[i + 2]);\\n if (eq(dist(l, s), 0))\\n ret.emplace_back(p[i + 1]);\\n }\\n }\\n return ret;\\n}\\n\\nVP rectangle(S s, R r) { // sを軸とした幅rの長方形\\n P d = (s.a - s.b) * P(0, 1);\\n d *= r / sqrt(norm(d));\\n return VP{s.a + d, s.a - d, s.b - d, s.b + d};\\n}\\n\\nL vertical_bisector(P p, P q) { // 垂直二等分線\\n L l;\\n l.a = (p + q) * 0.5;\\n l.b = l.a + rot(q - p, pi * 0.5);\\n return l;\\n}\\n\\nL angle_bisector(P a,P b,P c){//角abcの二等分線(角bの２等分線)\\n L l;\\n l.a = b;\\n R ang = atan2(Y(c-b),X(c-b)) - atan2(Y(a-b),X(a-b));//なす角\\n ang/=2.0;\\n l.b = l.a + rot(a-b,ang);\\n return l;\\n}\\n\\nC Apollonius(P p, P q, R a, R b) { // アポロニウスの円\\n P p1 = (p * b + q * a) / (a + b), p2 = (-p * b + q * a) / (a - b);\\n C c;\\n c.p = (p1 + p2) * 0.5;\\n c.r = abs(p1 - p2) * 0.5;\\n return c;\\n}\\n\\nR area(VP p) { // 多角形の面積\\n R ret = 0.0;\\n int n = sz(p);\\n rep(i, n) ret += det(p[i], p[(i + 1) % n]);\\n return abs(ret * 0.5);\\n}\\n\\nint in_polygon(VP p, P q) { // IN:2, ON:1, OUT:0\\n int n = sz(p);\\n int ret = 0;\\n rep(i, n) {\\n P a = p[i] - q, b = p[(i + 1) % n] - q;\\n if (eq(det(a, b), 0.0) && sgn(dot(a, b)) <= 0)\\n return 1;\\n if (Y(a) > Y(b))\\n swap(a, b);\\n if (sgn(Y(a)) <= 0 && sgn(Y(b)) == 1 && sgn(det(a, b)) == 1)\\n ret ^= 2;\\n }\\n return ret;\\n}\\n\\nVP tangent(C c, P p) { // 点 p を通る円 c の接線と c の接点\\n return crosspoint(c, C(p, sqrt(norm(p - c.p) - c.r * c.r)));\\n}\\n\\nvector<L> tangent(C c1, C c2) { // 共通接線\\n vector<L> ret;\\n if (c1.r < c2.r)\\n swap(c1, c2);\\n R r = abs(c2.p - c1.p);\\n if (eq(r, 0.0))\\n return ret;\\n P u = (c2.p - c1.p) / r;\\n P v = rot(u, pi * 0.5);\\n for (R s : {1.0, -1.0}) {\\n R h = (c1.r + c2.r * s) / r;\\n if (eq(abs(h), 1.0)) {\\n ret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n } else if (abs(h) < 1.0) {\\n P uu = u * h, vv = v * sqrt(1.0 - 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\\nVP convex_hull(VP p) { // 凸包\\n sort(all(p), cp_x);\\n p.erase(unique(all(p)), end(p));\\n int n = sz(p), k = 0;\\n if (n == 1)\\n return p;\\n VP ch(2 * n);\\n for (int i = 0; i < n; ch[k++] = p[i++]) {\\n while (k >= 2 && sgn(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) <= 0)\\n k--;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) {\\n while (k >= t && sgn(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) <= 0)\\n k--;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\nR closest_pair(VP p) { // 最近点対の距離\\n if (sz(p) <= 1)\\n return 1e18;\\n sort(all(p), cp_x);\\n VP memo(sz(p));\\n\\n function<R(int, int)> rec = [&](int l, int r) {\\n if (r - l <= 1)\\n return R(1e18);\\n int m = (l + r) >> 1;\\n R x = X(p[m]);\\n R ret = min(rec(l, m), rec(m, r));\\n inplace_merge(p.begin() + l, p.begin() + m, p.begin() + r, cp_y);\\n int cnt = 0;\\n reps(i, l, r) {\\n if (abs(X(p[i]) - x) >= ret)\\n continue;\\n rep(j, cnt) {\\n P d = p[i] - memo[cnt - j - 1];\\n if (Y(d) >= ret)\\n break;\\n chmin(ret, abs(d));\\n }\\n memo[cnt++] = p[i];\\n }\\n return ret;\\n };\\n\\n return rec(0, sz(p));\\n}\\n\\nR farthest_pair(VP p) {//最遠点対の距離\\n VP ps = convex_hull(p);\\n ll n = ps.size();\\n if(n == 2){//凸包が潰れてる\\n return dist(ps[0],ps[1]);\\n }\\n ll i = 0,j = 0;\\n rep(k,n){//x軸方向に最も遠い点対を求める\\n if(cp_x(ps[k],ps[i]))i = k;\\n if(cp_x(ps[j],ps[k]))j = k;\\n }\\n R ret = 0;\\n ll si = i,sj = j;\\n while(i != sj || j != si){//180度反転しきるまで\\n ret = max(ret,dist(ps[i],ps[j]));\\n if(det(ps[(i+1)%n] - ps[i],ps[(j+1)%n]-ps[j]) < 0){\\n i = (i + 1) % n;\\n }else{\\n j = (j + 1) % n;\\n }\\n }\\n return ret;\\n}\\n\\n// 原点, 点 a, 点 b とで囲まれる領域の面積 (三角形 ver と扇型 ver)\\nR calc_element(P a, P b, R cr,bool triangle){\\n if(triangle)return det(a,b)/2;\\n else{\\n P tmp = b * (P(X(a),-Y(a)));\\n R ang = atan2(Y(tmp),X(tmp));\\n return cr * cr * ang/2;\\n }\\n}\\n\\n// 円 C と、三角形 ((0, 0), ia, ib) との共通部分の面積\\nR common_area(C c, P ia,P ib){\\n P a = ia - c.p , b = ib - c.p;\\n if(eq(abs(a-b),0))return 0;\\n bool isin_a = (sgn(c.r - abs(a))>= 0);\\n bool isin_b = (sgn(c.r - abs(b))>= 0);\\n if(isin_a && isin_b)return calc_element(a,b,c.r,true);//aもbも円の中\\n\\n C oc(P(0,0),c.r);\\n S seg(a,b);\\n VP cr = crosspoint(oc,seg);\\n if(cr.empty())return calc_element(a,b,c.r,false);\\n P s = cr[0],t = cr.back();\\n return calc_element(s,t,c.r,true) + calc_element(a,s,c.r,isin_a) + calc_element(t,b,c.r,isin_b);\\n\\n}\\n\\n\\nR common_area(C c, VP vp){// 円cと多角形の共通部分の面積\\n R ret = 0;\\n ll n = vp.size();\\n rep(i,n){\\n ret += common_area(c,vp[i],vp[(i+1)%n]);\\n }\\n return ret;\\n}\\n\\nR common_area(C p, C q) {// 円と円の共通部分の面積\\n R d = abs(p.p - q.p);\\n if (d >= p.r + q.r - EPS) return 0;\\n else if (d <= abs(p.r - q.r) + EPS) return min(p.r, q.r) * min(p.r, q.r) * pi;\\n R pcos = (p.r*p.r + d*d - q.r*q.r) / (p.r*d*2);\\n R pang = acosl(pcos);\\n R parea = p.r*p.r*pang - p.r*p.r*sin(pang*2)/2;\\n R qcos = (q.r*q.r + d*d - p.r*p.r) / (q.r*d*2);\\n R qang = acosl(qcos);\\n R qarea = q.r*q.r*qang - q.r*q.r*sin(qang*2)/2;\\n return parea + qarea;\\n}\\n\\nvector<VP> divisions(vector<L> lf, R lim = 1e9) {\\n vector<L> ls;\\n each(l, lf) {\\n bool ok = true;\\n each(m, ls) {\\n if (para(l, m) & inter(l, m.a)) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok)\\n ls.emplace_back(l);\\n }\\n VP lc{P(-lim, -lim), P(lim, -lim), P(lim, lim), P(-lim, lim)};\\n rep(i, 4) ls.emplace_back(lc[i], lc[(i + 1) % 4]);\\n int m = sz(ls);\\n VP ps;\\n vector<vector<int>> lp(m);\\n rep(i, m) {\\n reps(j, i + 1, m) {\\n each(p, crosspoint(ls[i], ls[j])) {\\n if (max(abs(X(p)), abs(Y(p))) < lim + EPS) {\\n lp[i].emplace_back(sz(ps)), lp[j].emplace_back(sz(ps));\\n ps.emplace_back(p);\\n }\\n }\\n }\\n }\\n int n = sz(ps);\\n vector<int> id(n, -1), to;\\n vector<R> rg;\\n vector<vector<pair<R, int>>> li(n);\\n rep(i, m) {\\n sort(all(lp[i]), [&ps](int a, int b) { return cp_x(ps[a], ps[b]); });\\n vector<int> q;\\n rep(j, sz(lp[i])) {\\n int me = id[lp[i][j]], st = j;\\n auto np = ps[lp[i][j]];\\n while (j + 1 < sz(lp[i])) {\\n if (abs(ps[lp[i][j + 1]] - np) < EPS) {\\n j++;\\n if (id[lp[i][j]] != -1)\\n me = id[lp[i][j]];\\n } else\\n break;\\n }\\n if (me == -1)\\n me = lp[i][st];\\n reps(k, st, j + 1) id[lp[i][k]] = me;\\n q.emplace_back(me);\\n }\\n rep(i, sz(q) - 1) {\\n P d = ps[q[i + 1]] - ps[q[i]];\\n R s = atan2(Y(d), X(d)), t = atan2(-Y(d), -X(d));\\n int x = q[i], y = q[i + 1];\\n li[x].emplace_back(s, sz(to));\\n li[x].emplace_back(s + pi * 2, sz(to));\\n to.emplace_back(y), rg.emplace_back(t);\\n li[y].emplace_back(t, sz(to));\\n li[y].emplace_back(t + pi * 2, sz(to));\\n to.emplace_back(x), rg.emplace_back(s);\\n }\\n }\\n rep(i, n) sort(all(li[i]));\\n vector<bool> u(sz(to), false);\\n vector<VP> ret;\\n rep(i, n) {\\n each(l, li[i]) {\\n int ns = l.second;\\n if (u[ns])\\n continue;\\n VP nv;\\n int no = ns;\\n bool ok = true;\\n while (1) {\\n if (sz(nv) > 1) {\\n P x = nv[sz(nv) - 2], y = nv[sz(nv) - 1], z = ps[to[no]];\\n int c = ccw(x, y, z);\\n if (c == 1)\\n ok = false;\\n if (c != -1)\\n nv.pop_back();\\n }\\n nv.emplace_back(ps[to[no]]);\\n u[no] = true;\\n no = upper_bound(all(li[to[no]]), pair(rg[no] + EPS, -1))->second;\\n if (no == ns)\\n break;\\n }\\n if (ok)\\n ret.emplace_back(nv);\\n }\\n }\\n return ret;\\n}\\n\\n//ref https://github.com/drken1215/algorithm/blob/master/Geometry/arg_sort.cpp\\n//verify https://atcoder.jp/contests/abc139/submissions/me\\n//点列を偏角ソート\\nvoid arg_sort(VP &v){\\n //原点=0,(pi,2pi] = -1 (0pi,pi] = 1\\n auto sign = [&](const P &p){\\n if(sgn(X(p)) == 0 && sgn(Y(p)) == 0){\\n return 0;\\n }else if(sgn(Y(p)) == -1 || (sgn(Y(p)) == 0 && sgn(X(p)) == 1)){\\n return -1;\\n }else{\\n return 1;\\n }\\n };\\n auto cp = [&](const P &p,const P &q){\\n if(sign(p) != sign(q)){\\n return sign(p) < sign(q);\\n }else{//外積>0で判定\\n //同じ向きにあるときは未定義、それぞれ決める\\n return X(p) * Y(q) - Y(p) * X(q) > 0;\\n }\\n };\\n sort(v.begin(),v.end(),cp);\\n}\\n\\n\\nusing tpl4 = tuple<ll,ll,ll,ll>;\\nvoid solve(ll n,ll m,ll l){\\n vector<tpl4> xyar(n);\\n rep(i,n){\\n LL(x,y,a,r);\\n xyar[i] ={x,y,a,r};\\n }\\n vector<vector<P>> nodes(n,vector<P>(5));\\n rep(i,n){\\n auto [x,y,a,r] = xyar[i];\\n ld baserad = (ld)(a+90)/180 * M_PI;\\n ld drad = (ld)72/180 * M_PI;\\n rep(j,5){\\n nodes[i][j] = P(x+ r *cos(baserad + drad * j),y + r * sin(baserad + drad * j));\\n }\\n }\\n vector<vector<S>> segs(n,vector<S>(5));\\n rep(i,n){\\n rep(j,5){\\n ll k = (j+2) % 5;\\n segs[i][j] = S(nodes[i][j],nodes[i][k]);\\n }\\n }\\n \\n \\n ld limit = 100000;\\n vector<vector<ld>> distance(n,vector<ld>(n,limit));\\n\\n rep(i,n){\\n rep(j,i){\\n // 線分と線分の距離だけ見ればいい\\n rep(a,5)rep(b,5){\\n chmin(distance[i][j], dist(segs[j][b],segs[i][a]));\\n }\\n\\n //逆\\n distance[j][i] = distance[i][j];\\n }\\n }\\n\\n\\n //warshal floyd\\n\\n int size = (int)distance.size();\\n rep(k,size){\\n rep(i,size){\\n rep(j,size){\\n if(i == j){\\n chmin(distance[i][j],ld(0));\\n }\\n if(!eq(distance[i][k],limit) && !eq(distance[k][j],limit)){\\n chmin(distance[i][j],distance[i][k] + distance[k][j]);\\n }\\n }\\n }\\n }\\n cout << std::fixed << std::setprecision(10) << distance[m-1][l-1] << endl;\\n\\n\\n\\n}\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true){\\n LL(n,m,l);\\n if(n == 0 && m == 0 && l == 0)break;\\n solve(n,m,l);\\n } \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 4480,\n \"score_of_the_acc\": -0.1635,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2402_10418458\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T>\\nbool chmin(T& a, T b) {\\n return a > b ? a = b, true : false;\\n}\\ntemplate <class T>\\nbool chmax(T& a, T b) {\\n return a < b ? a = b, true : false;\\n}\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\ntemplate <class T = ll>\\nstruct Edge {\\n int to;\\n T weight;\\n bool operator==(Edge e) {\\n return this->to == e.to and this->weight == e.weight;\\n }\\n bool operator<(Edge e) {\\n return this->to == e.to ? this->weight < e.weight : this->to < e.to;\\n }\\n};\\n#ifdef _DEBUG\\n#define SHOW(n) \\\\\\n { \\\\\\n const auto& _ret = n; \\\\\\n cerr << #n << \\\": \\\" << _ret << endl; \\\\\\n }\\n#define MSG(x) cerr << x << endl;\\n#else\\n#define SHOW(n)\\n#define MSG(x)\\n#endif\\n\\n////AtCoder Library\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n////using mint = modint998244353;\\n////using mint = modint1000000007;\\n////using mint1 = dynamic_modint<0>;\\n// using mint = modint;\\n////mint::set_mod();\\n// istream& operator>>(istream& is, mint& x) { ll r; is >> r; x = r; return is;\\n// } ostream& operator<<(ostream& os, mint& x) { os << x.val(); return os; }\\n\\n// boost\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// using namespace boost::multiprecision;\\n// using l3 = int128_t;\\n\\nusing Real = double;\\nusing Point = complex<Real>;\\nusing Polygon = vector<Point>;\\nconst Real EPS = 1e-8, PI = acos(-1);\\nPoint operator*(const Point& p, const Real& d) {\\n return Point(p.real() * d, p.imag() * d);\\n}\\nPoint operator/(const Point& p, const Real& d) {\\n return Point(p.real() / d, p.imag() / d);\\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}\\nint sign(const Real& r) {\\n if (r <= -EPS) return -1;\\n if (r >= +EPS) return +1;\\n return 0;\\n}\\nbool equals(const Real& a, const Real& b) { return sign(a - b) == 0; }\\nnamespace std {\\nbool operator<(const Point& a, const Point& b) {\\n if (equals(a.real(), b.real())) return a.imag() < b.imag();\\n return a.real() < b.real();\\n}\\n} // namespace std\\n// namespace std\\nReal dot(const Point& a, const Point& b) { return (conj(a) * b).real(); }\\nReal cross(const Point& a, const Point& b) { return (conj(a) * b).imag(); }\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n};\\nusing Segment = Line;\\n\\n// 直線 l に対する点 p の射影\\nPoint projection(const Line& l, const Point& p) {\\n return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n}\\n// 直線 l に対する点 p の反射 (l と反対側にある点)\\nPoint reflection(const Line& l, const Point& p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n// 直線 l に対する点 p の射影\\n\\n// 点 a から見た点 b,c の位置関係\\n// +1: b,c が反時計回り\\n// -1: b,c が時計回り\\n// +2: c,a,b がこの順で同一直線上にある\\n// -2: a,b,c がこの順で同一直線上にある\\n// 0: a,c,b がこの順で同一直線上にある\\nint ccw(const Point& a, Point b, Point c) {\\n b -= a, c -= a;\\n if (sign(cross(b, c)) == +1) return +1;\\n if (sign(cross(b, c)) == -1) return -1;\\n if (sign(dot(b, c)) == -1) return +2;\\n if (norm(b) < norm(c)) return -2;\\n return 0;\\n}\\n\\n// 直線 a,b が直交するか判定\\nbool is_orthogonal(const Line& a, const Line& b) {\\n return equals(dot(a.b - a.a, b.b - b.a), 0);\\n}\\n// 直線 a,b が並行か判定\\nbool is_parallel(const Line& a, const Line& b) {\\n return equals(cross(a.b - a.a, b.b - b.a), 0);\\n}\\n// 線分 s,t が交差するか判定\\nbool is_intersect_ss(const Segment& s, const Segment& t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n// 直線 l,m の交点を求める\\nPoint cross_point_ll(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 (equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n// 線分 s と点 p の距離を求める\\nReal distance_sp(const Segment& s, const Point& p) {\\n Point r = projection(s, p);\\n if (ccw(s.a, s.b, r) == 0) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n// 線分 a,b の距離を求める\\nReal distance_ss(const Segment& a, const Segment& b) {\\n if (is_intersect_ss(a, b)) return 0;\\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a),\\n distance_sp(b, a.b)});\\n}\\n\\nvoid solve() {\\n int n, m, l;\\n cin >> n >> m >> l;\\n\\n if (n == 0) {\\n exit(0);\\n }\\n\\n double pi = acos(-1);\\n\\n vector<vector<Segment>> sgs(n);\\n for (int i = 0; i < n; ++i) {\\n int x, y, a, r;\\n cin >> x >> y >> a >> r;\\n vector<Point> pts(5);\\n for (int j = 0; j < 5; ++j) {\\n double X = x + r * sin((2 * pi * j) / 5 - (pi * a) / 180);\\n double Y = y + r * cos((2 * pi * j) / 5 - (pi * a) / 180);\\n pts[j] = Point(X, Y);\\n }\\n\\n for (int j = 0; j < 5; ++j) {\\n sgs[i].emplace_back(pts[j], pts[(j + 2) % 5]);\\n }\\n }\\n\\n auto eval = [&](vector<Segment>& a, vector<Segment>& b) {\\n double res = 1e9;\\n for (int i = 0; i < 5; ++i) {\\n for (int j = 0; j < 5; ++j) {\\n chmin(res, distance_ss(a[i], b[j]));\\n }\\n }\\n return res;\\n };\\n\\n vector<vector<double>> dist(n, vector<double>(n, 1e9));\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < n; ++j) {\\n dist[i][j] = eval(sgs[i], sgs[j]);\\n }\\n }\\n\\n for (int k = 0; k < n; ++k) {\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < n; ++j) {\\n chmin(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n }\\n }\\n\\n cout << fixed << setprecision(12);\\n cout << dist[m - 1][l - 1] << endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n while (true) {\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.149,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2402_10418388\",\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 2 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\n#line 6 \\\"/Users/noya2/Desktop/Noya2_library/template/utils.hpp\\\"\\n\\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 << std::min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::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(std::vector<T> &v){\\n std::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#line 2 \\\"/Users/noya2/Desktop/Noya2_library/geometry/float_geometry.hpp\\\"\\n\\n#include <type_traits>\\n#include <concepts>\\n#include <compare>\\n#line 12 \\\"/Users/noya2/Desktop/Noya2_library/geometry/float_geometry.hpp\\\"\\n#include <ranges>\\n\\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\\n\\n#include<boost/multiprecision/cpp_bin_float.hpp>\\n\\n#endif\\n\\nnamespace float_geometry {\\n\\ntemplate<class T>\\nstruct is_floating_point_number : std::bool_constant<false> {};\\n\\ntemplate<std::floating_point F>\\nstruct is_floating_point_number<F> : std::bool_constant<true> {};\\n\\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\\n\\ntemplate<unsigned D>\\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_bin_float<D>>> : std::bool_constant<true> {};\\n\\ntemplate<unsigned D>\\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<D>>> : std::bool_constant<true> {};\\n\\n#endif\\n\\ntemplate<class F>\\nconcept FloatingPoint = is_floating_point_number<F>::value;\\n\\ntemplate<FloatingPoint Float>\\nconstexpr Float EPS = Float{1e-8};\\n\\ntemplate<FloatingPoint Float>\\nconstexpr int sign(const Float &x, Float eps = EPS<Float>){\\n return (x < -eps ? -1 : x > eps ? 1 : 0);\\n}\\n\\ntemplate<FloatingPoint Float>\\nstruct point {\\n Float x, y;\\n point () {}\\n point (Float _x, Float _y) : x(_x), y(_y) {}\\n point &operator+=(const point &r){\\n x += r.x;\\n y += r.y;\\n return *this;\\n }\\n point &operator-=(const point &r){\\n x -= r.x;\\n y -= r.y;\\n return *this;\\n }\\n point operator+() const {\\n return *this;\\n }\\n point operator-() const {\\n x = -x;\\n y = -y;\\n return *this;\\n }\\n point &operator*=(const Float &a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n\\tpoint &operator/=(const Float &a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n friend point operator+(const point& lhs, const point& rhs){\\n return point(lhs) += rhs;\\n }\\n friend point operator-(const point& lhs, const point& rhs){\\n return point(lhs) -= rhs;\\n }\\n friend point operator*(const point& lhs, const Float& a){\\n return point(lhs) *= a;\\n }\\n friend point operator*(const Float& a, const point& rhs){\\n return point(rhs) *= a;\\n }\\n\\tfriend point operator/(const point& lhs, const Float& a){\\n return point(lhs) /= a;\\n }\\n auto operator<=>(const point&) const = default;\\n // friend bool operator<(const point &lhs, const point &rhs){\\n // if (lhs.x == rhs.x) return lhs.y < rhs.y;\\n // return lhs.x < rhs.x;\\n // }\\n // friend bool operator==(const point &lhs, const point &rhs){\\n // return (lhs.x == rhs.x && lhs.y == rhs.y);\\n // }\\n friend std::ostream &operator<<(std::ostream &os, const point& p){\\n return os << p.x << ' ' << p.y;\\n }\\n friend std::istream &operator>>(std::istream &is, point &a){\\n Float _x, _y; is >> _x >> _y;\\n a = point(_x, _y);\\n return (is);\\n }\\n friend Float norm(const point &a) {\\n return a.x*a.x + a.y*a.y;\\n }\\n friend Float dot(const point &a, const point &b){\\n return a.x*b.x + a.y*b.y;\\n }\\n friend Float cross(const point &a, const point &b){\\n return a.x*b.y - a.y*b.x;\\n }\\n\\tfriend point rot90(const point &a){\\n\\t\\treturn point(-a.y, a.x);\\n\\t}\\n friend point rot(const point &a, const Float rad){\\n using std::cos, std::sin;\\n Float cosrad = cos(rad);\\n Float sinrad = sin(rad);\\n return point(a.x * cosrad - a.y * sinrad, a.x * sinrad + a.y * cosrad);\\n }\\n friend Float abs(const point &a){\\n using std::sqrt;\\n return sqrt(norm(a));\\n }\\n\\n friend int quadrant_atan2(const point &a){\\n // not origin point\\n // ceil ( atan2(y,x) / (pi/2) )\\n\\t\\tint signx = sign(a.x);\\n\\t\\tint signy = sign(a.y);\\n\\t\\tif (signx <= 0 && signy < 0) return -1;\\n\\t\\tif (signx > 0 && signy <= 0) return 0;\\n\\t\\tif (signx >= 0 && signy > 0) return 1;\\n\\t\\tif (signx < 0 && signy >= 0) return 2;\\n // origin point x == 0 && y == 0\\n return 0;\\n }\\n\\n friend int sign_cross(const point &a, const point &b){\\n using std::abs;\\n return sign(cross(a, b), EPS<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(cross(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(b.y)));\\n }\\n\\n friend int sign_dot(const point &a, const point &b){\\n using std::abs;\\n return sign(dot(a, b), EPS<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(dot(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(b.y)));\\n }\\n\\n\\tfriend int ccw(const point &a, point b, point c){\\n\\t\\tb -= a;\\n\\t\\tc -= a;\\n\\t\\tint signcr = sign_cross(b, c);\\n\\t\\tif (signcr > 0){\\n\\t\\t\\t// ccw \\n\\t\\t\\t// c\\n\\t\\t\\t// a --> b \\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\t\\tif (signcr < 0){\\n\\t\\t\\t// cw\\n\\t\\t\\t// a --> b\\n\\t\\t\\t// c\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tif (sign_dot(b, c) < 0){\\n\\t\\t\\t// c a --> b\\n\\t\\t\\treturn 2;\\n\\t\\t}\\n\\t\\tif (norm(b) < norm(c)){\\n\\t\\t\\t// a --> b c\\n\\t\\t\\treturn -2;\\n\\t\\t}\\n\\t\\t// a - c -> b\\n\\t\\treturn 0;\\n\\t}\\n friend bool has_common_point(const point &a, const point &b){\\n return sign(a.x - b.x) == 0 && sign(a.y - b.y) == 0;\\n }\\n\\n ld arg() const {\\n std::complex<ld> a(x, y);\\n return std::arg(a);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nstruct arg_less {\\n constexpr bool operator()(const point<Float> &l, const point<Float> &r){\\n using std::atan2;\\n return atan2(l.y, l.x) < atan2(r.y, r.x);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nvoid arg_sort(std::vector<point<Float>> &a){\\n\\tstd::sort(a.begin(), a.end(), arg_less<Float>{});\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstd::vector<int> upper_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector<int> st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) ptr--;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[i] - a[c], a[c] - a[p]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate<FloatingPoint Float>\\nstd::vector<int> lower_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> ids(a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n\\tstd::sort(ids.begin(), ids.end(), [&](int l, int r){\\n\\t\\treturn a[l] < a[r];\\n\\t});\\n\\tstd::vector<int> st(a.size());\\n\\tint ptr = 0;\\n\\tfor (int i : ids){\\n\\t\\tif (ptr >= 1 && a[st[ptr-1]].x == a[i].x) continue;\\n\\t\\twhile (ptr >= 2){\\n\\t\\t\\tint c = st[ptr-1];\\n\\t\\t\\tint p = st[ptr-2];\\n\\t\\t\\tif (sign_cross(a[c] - a[p], a[i] - a[c]) > 0){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tptr--;\\n\\t\\t}\\n\\t\\tst[ptr++] = i;\\n\\t}\\n\\tst.resize(ptr);\\n\\treturn st;\\n}\\n\\ntemplate<FloatingPoint Float>\\nstd::vector<int> convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tauto upper = upper_convex_hull_index(a);\\n\\tauto lower = lower_convex_hull_index(a);\\n\\tif (upper.size() == 1u){\\n\\t\\t// lower.size() == 1u\\n\\t\\tif (a[upper.front()] == a[lower.front()]){\\n\\t\\t\\treturn {upper.front()};\\n\\t\\t}\\n\\t\\treturn {lower.front(), upper.front()};\\n\\t}\\n\\tif (a[upper.back()] == a[lower.back()]){\\n\\t\\tlower.pop_back();\\n\\t}\\n\\tlower.insert(lower.end(), upper.rbegin(), upper.rend());\\n\\tif (a[upper.front()] == a[lower.front()]) lower.pop_back();\\n\\treturn lower;\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstruct line {\\n\\tpoint<Float> end0, end1;\\n line () {}\\n\\tline (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const line &) const = default;\\n\\tpoint<Float> direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const line &a, const line &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const line &a, const line &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const line &a, const point<Float> &b){\\n\\t\\treturn sign(cross(a.direction(), b - a.end0)) == 0;\\n\\t}\\n\\tfriend bool has_common_point(const line &a, const line &b){\\n\\t\\treturn !is_parallel(a, b) || has_common_point(a, b.end0);\\n\\t}\\n\\tfriend point<Float> common_point(const line &a, const line &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tfriend point<Float> projection(const line &a, const point<Float> &b){\\n\\t\\tauto dir = a.direction();\\n\\t\\treturn a.end0 + dir * (dot(dir, b - a.end0) / norm(dir));\\n\\t}\\n\\tfriend point<Float> reflection(const line &a, const point<Float> &b){\\n\\t\\tauto prj = projection(a, b);\\n\\t\\treturn prj + prj - b;\\n\\t}\\n friend line<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nline<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstruct segment {\\n\\tpoint<Float> end0, end1;\\n segment () {}\\n\\tsegment (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const segment &) const = default;\\n\\tpoint<Float> direction() const {\\n\\t\\treturn end1 - end0;\\n\\t}\\n friend bool is_parallel(const segment &a, const segment &b){\\n return sign_cross(a.direction(), b.direction()) == 0;\\n }\\n friend bool is_orthgonal(const segment &a, const segment &b){\\n return sign_dot(a.direction(), b.direction()) == 0;\\n }\\n\\tfriend bool has_common_point(const segment &a, const segment &b){\\n\\t\\treturn ccw(a.end0, a.end1, b.end0) * ccw(a.end0, a.end1, b.end1) <= 0\\n\\t\\t\\t&& ccw(b.end0, b.end1, a.end0) * ccw(b.end0, b.end1, a.end1) <= 0;\\n\\t}\\n\\tfriend bool has_common_point(const segment &a, const point<Float> &b){\\n\\t\\treturn ccw(a.end0, a.end1, b) == 0;\\n\\t}\\n\\tfriend point<Float> common_point(const segment &a, const segment &b){\\n\\t\\t// assert(has_common_point(a, b));\\n\\t\\tif (is_parallel(a, b)){\\n\\t\\t\\tif (has_common_point(a, b.end0)){\\n\\t\\t\\t\\treturn b.end0;\\n\\t\\t\\t}\\n\\t\\t\\tif (has_common_point(a, b.end1)){\\n\\t\\t\\t\\treturn b.end1;\\n\\t\\t\\t}\\n\\t\\t\\treturn a.end0;\\n\\t\\t}\\n\\t\\treturn a.end0 + a.direction() * cross(b.end0 - a.end0, b.end1 - b.end0) / cross(a.direction(), b.direction());\\n\\t}\\n\\tline<Float> as_line() const {\\n\\t\\treturn line<Float>(end0, end1);\\n\\t}\\n};\\n\\n} // float_geometry\\n#line 4 \\\"c.cpp\\\"\\n\\nusing namespace float_geometry;\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\\\"\\n\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp\\\"\\n\\n#line 7 \\\"/Users/noya2/Desktop/Noya2_library/data_structure/csr.hpp\\\"\\n\\nnamespace noya2::internal {\\n\\ntemplate<class E>\\nstruct csr {\\n csr () {}\\n csr (int _n) : n(_n) {}\\n csr (int _n, int m) : n(_n){\\n start.reserve(m);\\n elist.reserve(m);\\n }\\n // ACL style constructor (do not have to call build)\\n csr (int _n, const std::vector<std::pair<int,E>> &idx_elem) : n(_n), start(_n + 2), elist(idx_elem.size()) {\\n for (auto &[i, e] : idx_elem){\\n start[i + 2]++;\\n }\\n for (int i = 1; i < n; i++){\\n start[i + 2] += start[i + 1];\\n }\\n for (auto &[i, e] : idx_elem){\\n elist[start[i + 1]++] = e;\\n }\\n prepared = true;\\n }\\n int add(int idx, E elem){\\n int eid = start.size();\\n start.emplace_back(idx);\\n elist.emplace_back(elem);\\n return eid;\\n }\\n void build(){\\n if (prepared) return ;\\n int m = start.size();\\n std::vector<E> nelist(m);\\n std::vector<int> nstart(n + 2, 0);\\n for (int i = 0; i < m; i++){\\n nstart[start[i] + 2]++;\\n }\\n for (int i = 1; i < n; i++){\\n nstart[i + 2] += nstart[i + 1];\\n }\\n for (int i = 0; i < m; i++){\\n nelist[nstart[start[i] + 1]++] = elist[i];\\n }\\n swap(elist,nelist);\\n swap(start,nstart);\\n prepared = true;\\n }\\n const auto operator[](int idx) const {\\n return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);\\n }\\n auto operator[](int idx){\\n return std::ranges::subrange(elist.begin()+start[idx],elist.begin()+start[idx+1]);\\n }\\n const auto operator()(int idx, int l, int r) const {\\n return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);\\n }\\n auto operator()(int idx, int l, int r){\\n return std::ranges::subrange(elist.begin()+start[idx]+l,elist.begin()+start[idx]+r);\\n }\\n size_t size() const {\\n return n;\\n }\\n int n;\\n std::vector<int> start;\\n std::vector<E> elist;\\n bool prepared = false;\\n};\\n\\n} // namespace noya2::internal\\n#line 2 \\\"/Users/noya2/Desktop/Noya2_library/graph/unweighted_type.hpp\\\"\\n\\nnamespace noya2 {\\n\\nstruct unweighted {};\\n\\n} // namespace noya2\\n#line 6 \\\"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\\\"\\n\\n#line 12 \\\"/Users/noya2/Desktop/Noya2_library/graph/graph_query.hpp\\\"\\n\\nnamespace noya2 {\\n\\ntemplate<typename Cost>\\nstruct graph {\\n int n;\\n internal::csr<std::pair<int,Cost>> g;\\n Cost dist_inf = std::numeric_limits<Cost>::max() / 3;\\n graph (int _n = 0) : n(_n), g(_n) {}\\n graph (int _n, int _m) : n(_n), g(_n,_m) {}\\n // 有向辺を追加 (無向辺ではないことに注意！)\\n int add_edge(int u, int v, Cost cost = 1){\\n int id = g.add(u, {v,cost});\\n return id;\\n }\\n template<bool directed>\\n static graph input(int _n, int _m, int indexed = 1){\\n if constexpr (directed){\\n graph g(_n, _m*2);\\n for (int i = 0; i < _m; i++){\\n int u, v; std::cin >> u >> v;\\n u -= indexed, v -= indexed;\\n Cost c; std::cin >> c;\\n g.add_edge(u, v, c);\\n g.add_edge(v, u, c);\\n }\\n g.build();\\n return g;\\n }\\n else {\\n graph g(_n, _m);\\n for (int i = 0; i < _m; i++){\\n int u, v; std::cin >> u >> v;\\n u -= indexed, v -= indexed;\\n Cost c; std::cin >> c;\\n g.add_edge(u, v, c);\\n }\\n g.build();\\n return g;\\n }\\n }\\n void build(){\\n g.build();\\n }\\n void set_inf(Cost new_inf){\\n dist_inf = new_inf;\\n }\\n std::vector<Cost> dijkstra(int s){\\n g.build();\\n std::vector<Cost> dist(n,dist_inf);\\n dist[s] = 0;\\n using P = std::pair<Cost,int>;\\n std::priority_queue<P,std::vector<P>,std::greater<P>> pque;\\n pque.push(P(0,s));\\n while (!pque.empty()){\\n auto [d, v] = pque.top(); pque.pop();\\n if (dist[v] < d-ld(1e-8)) continue;\\n for (auto [u, c] : g[v]){\\n if (chmin(dist[u],d+c)){\\n pque.push(P(dist[u],u));\\n }\\n }\\n }\\n return dist;\\n }\\n std::vector<int> reconstruct(int s, int t, const std::vector<Cost> &dist){\\n if (dist[t] == dist_inf) return {};\\n g.build();\\n std::vector<int> from(n,-1);\\n std::queue<int> que;\\n que.push(s);\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (auto [u, c] : g[v]){\\n if (from[u] == -1 && dist[u] == dist[v] + c){\\n from[u] = v;\\n que.push(u);\\n }\\n }\\n }\\n std::vector<int> ans = {t};\\n while (t != s){\\n t = from[t];\\n ans.emplace_back(t);\\n }\\n std::reverse(ans.begin(),ans.end());\\n return ans;\\n }\\n std::vector<Cost> bfs01(int s){\\n g.build();\\n std::vector<Cost> dist(n,dist_inf);\\n dist[s] = 0;\\n std::deque<int> que;\\n que.push_back(s);\\n while (!que.empty()){\\n int v = que.front(); que.pop_front();\\n for (auto [u, c] : g[v]){\\n if (chmin(dist[u],dist[v]+c)){\\n if (c == 0) que.push_front(u);\\n else que.push_back(u);\\n }\\n }\\n }\\n return dist;\\n }\\n std::vector<Cost> bfs1(int s){\\n g.build();\\n std::vector<Cost> dist(n,dist_inf);\\n dist[s] = 0;\\n std::queue<int> que;\\n que.push(s);\\n while (!que.empty()){\\n int v = que.front(); que.pop();\\n for (auto [u, c] : g[v]){\\n if (chmin(dist[u],dist[v]+c)){\\n que.push(u);\\n }\\n }\\n }\\n return dist;\\n }\\n std::vector<Cost> bellman_ford(int s, bool &ng_cycle){\\n g.build();\\n std::vector<Cost> dist(n,dist_inf);\\n std::vector<int> ng;\\n dist[s] = 0;\\n int tm = 0;\\n while (tm < n){\\n bool finish = true;\\n for (int v = 0; v < n; v++){\\n if (dist[v] == dist_inf) continue;\\n for (auto [u, c] : g[v]){\\n if (chmin(dist[u],dist[v]+c)){\\n finish = false;\\n if (tm == n-1) ng.emplace_back(u);\\n }\\n }\\n }\\n if (finish) break;\\n tm++;\\n }\\n ng_cycle = (tm == n);\\n if (ng_cycle){\\n for (auto v : ng) dist[v] = -dist_inf;\\n tm = n;\\n while (tm--){\\n for (int v = 0; v < n; v++){\\n if (dist[v] != -dist_inf) continue;\\n for (auto [u, c] : g[v]){\\n dist[u] = -dist_inf;\\n }\\n }\\n }\\n }\\n return dist;\\n }\\n std::vector<std::vector<Cost>> warshall_floyd(){\\n g.build();\\n std::vector<std::vector<Cost>> dist(n,std::vector<Cost>(n,dist_inf));\\n for (int v = 0; v < n; v++){\\n dist[v][v] = 0;\\n for (auto [u, c] : g[v]){\\n chmin(dist[v][u],c);\\n }\\n }\\n for (int k = 0; k < n; k++){\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n chmin(dist[i][j],dist[i][k]+dist[k][j]);\\n }\\n }\\n }\\n return dist;\\n }\\n const auto operator[](int idx) const { return g[idx]; }\\n auto operator[](int idx) { return g[idx]; }\\n};\\n\\n\\n} // namespace noya2\\n#line 8 \\\"c.cpp\\\"\\n\\npoint<ld> proj(const line<ld> &l, const point<ld> &p) {\\n auto ab = l.end1 - l.end0;\\n return l.end0 + ab * (dot(ab, p - l.end0) / norm(ab));\\n}\\n\\nld calc2(segment<ld> a, point<ld> b){\\n ld len = abs(a.end0 - a.end1);\\n auto p = proj(a.as_line(), b);\\n ld d1 = abs(a.end0 - p);\\n ld d2 = abs(a.end1 - p);\\n if (sign(d1+d2-len) == 0){\\n return abs(b-p);\\n }\\n return min(abs(a.end0-b),abs(a.end1-b));\\n}\\n\\nld calc(segment<ld> a, point<ld> b){\\n ld le = 0, ri = 1;\\n int many = 60;\\n auto val = [&](ld p){\\n return norm(a.end0 * p + a.end1 * (1-p) - b);\\n };\\n while (many--){\\n ld m1 = (le + le + ri) / 3;\\n ld m2 = (le + ri + ri) / 3;\\n if (val(m1) < val(m2)){\\n ri = m2;\\n }\\n else {\\n le = m1;\\n }\\n }\\n return sqrt(val(le));\\n}\\n\\nld dist(segment<ld> a, segment<ld> b){\\n if (has_common_point(a,b)){\\n return 0;\\n }\\n ld ret = 1e18;\\n rep(i,2){\\n rep(j,2){\\n chmin(ret,calc2(b,a.end0));\\n swap(a.end0,a.end1);\\n }\\n swap(a,b);\\n }\\n return ret;\\n}\\n\\n\\nvoid solve1(int n, int m, int l){\\n m--, l--;\\n vector<point<ld>> ctr(n);\\n vector<ld> a(n), r(n);\\n rep(i,n){\\n in(ctr[i]);\\n in(a[i],r[i]);\\n }\\n graph<ld> g(n*6);\\n g.set_inf(1e18);\\n auto idx = [&](int i, int e){\\n return i * 6 + e;\\n };\\n rep(i,n){\\n rep(j,5){\\n g.add_edge(idx(i,j),idx(i,5),0);\\n g.add_edge(idx(i,5),idx(i,j),0);\\n }\\n }\\n vector<vector<point<ld>>> vs(n,vector<point<ld>>(5));\\n rep(i,n) rep(j,5){\\n ld th = pi/2 + a[i]*pi/180 + 4./5*pi * j;\\n vs[i][j] = ctr[i] + rot(point<ld>(r[i],0),th);\\n }\\n vector<vector<segment<ld>>> segs(n,vector<segment<ld>>(5));\\n rep(i,n) rep(j,5){\\n segs[i][j] = segment<ld>(vs[i][j],vs[i][(j+1)%5]);\\n }\\n rep(i,n) rep(j,5) rep(ii,n) rep(jj,5){\\n g.add_edge(idx(i,j),idx(ii,jj),dist(segs[i][j],segs[ii][jj]));\\n }\\n ld ans = g.dijkstra(idx(m,5))[idx(l,5)];\\n out(ans);\\n}\\n\\nvoid solve(){\\n int n, m, l;\\n while (true){\\n in(n,m,l);\\n if (n == 0) return ;\\n solve1(n,m,l);\\n }\\n}\\n\\nint main(){\\n int t = 1; //in(t);\\n while (t--) { solve(); }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 28104,\n \"score_of_the_acc\": -1.3184,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2402_10418386\",\n \"code_snippet\": \"// #pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace atcoder;\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing vecint = std::vector<int>;\\nusing vecll = std::vector<long long>;\\nusing vecstr = std::vector<string>;\\nusing vecbool = std::vector<bool>;\\nusing vecdou = std::vector<double>;\\nusing vecpl = std::vector<pair<ll,ll>>;\\nusing vec2d = std::vector<vecll>;\\nusing vec2di = std::vector<vecint>;\\nusing vec2dd = std::vector<vecdou>;\\nusing vec2db = std::vector<vecbool>;\\nusing pl = pair<long long,long long>;\\nusing mint998 = modint998244353;\\nusing mint107 = modint1000000007;\\nusing mint = modint;\\nusing vecmint = std::vector<mint>;\\nusing vecmint998 = std::vector<mint998>;\\nusing vecmint107 = std::vector<mint107>;\\nusing vec2dmint = std::vector<vecmint>; \\nusing vec2dmint998 = std::vector<vecmint998>;\\nusing vec2dmint107 = std::vector<vecmint107>;\\n#define rep(i,n) for (ll i = 0; i < (ll)(n); i++)\\n#define rep1(i,n) for (ll i = 1; i <= (ll)(n); i++)\\n#define REP(i,l,r) for (ll i = (ll)(l); i < (ll)(r); i++)\\n#define rrep(i,n) for (ll i = (ll)(n)-1; i >= 0; i--)\\n#define rrep1(i,n) for (ll i = (ll)(n); i > 0; i--)\\n#define RREP(i,l,r) for (ll i = (ll)(r)-1; i >= (ll)(l); i--)\\n#define all(a) (a).begin(), (a).end()\\n#define INF ((1LL<<62)-(1LL<<31))\\n#define inr(a,x,b) ((a) <= (x) && (x) < (b))\\ntemplate <typename T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nvoid ynout(bool x,string Tru=\\\"Yes\\\",string Wro=\\\"No\\\"){\\n if(x){\\n cout << Tru << '\\\\n';\\n }else{\\n cout << Wro << '\\\\n';\\n }\\n}\\nll power(ll a,ll b,ll mod=INF){\\n long long x=1,y=a%mod;\\n while(b>0){\\n if(b&1ll){\\n x=(x*y)%mod;\\n }\\n y=(y*y)%mod;\\n b>>=1;\\n }\\n return x%mod;\\n}\\nll Pdist2(pair<ll,ll> a,pair<ll,ll> b){\\n return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);\\n}\\ndouble Pdist(pair<ll,ll> a,pair<ll,ll> b){\\n return sqrt(Pdist2(a,b));\\n}\\nll PdistM(pair<ll,ll> a,pair<ll,ll> b){\\n return abs(a.first-b.first)+abs(a.second-b.second);\\n}\\nll gcd(ll a,ll b){\\n if(b==0){\\n return a;\\n }else{\\n return gcd(b,a%b);\\n }\\n}\\nll lcm(ll a,ll b){\\n return a/gcd(a,b)*b;\\n}\\n\\nnamespace geometry {\\n // Point : 複素数型を位置ベクトルとして扱う\\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\\n using D = double;\\n using Point = std::complex<D>;\\n const D EPS = 1e-7;\\n const D PI = std::acos(D(-1));\\n\\n inline bool equal(const D &a, const D &b) { return std::fabs(a - b) < EPS; }\\n\\n // 単位ベクトル(unit vector)を求める\\n Point unitVector(const Point &a) { return a / std::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(std::cos(theta) * p.real() - std::sin(theta) * p.imag(),\\n std::sin(theta) * p.real() + std::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(std::norm(b) < std::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 a = Point(C / A, 0), b = Point(C / A, 1);\\n } else if(equal(C, 0)) {\\n a = Point(0, C / B), b = Point(1, (C - A) / B);\\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 D get_dist() { return std::abs(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 (std::abs(a - c) + std::abs(c - b) < std::abs(a - b) + EPS);\\n }\\n\\n // 直線lと点pの距離を求める\\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\\n return std::abs(cross(l.b - l.a, p - l.a)) / std::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 std::abs(p - l.a);\\n if(dot(l.a - l.b, p - l.b) < EPS) return std::abs(p - l.b);\\n return std::abs(cross(l.b - l.a, p - l.a)) / std::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(std::abs(d1), 0) && equal(std::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 ans = std::min(ans, distanceBetweenSegmentAndPoint(s, t.b));\\n ans = std::min(ans, distanceBetweenSegmentAndPoint(t, s.a));\\n ans = std::min(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) / std::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) / std::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 = std::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, std::abs(c1.r - c2.r))) return 1;\\n // 内包している場合\\n if(d < std::abs(c1.r - c2.r) - EPS) return 0;\\n return 2;\\n }\\n\\n // 2つの円の交点\\n std::vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\\n std::vector<Point> res;\\n int mode = isIntersect(c1, c2);\\n // 2つの中心の距離\\n D d = std::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 = std::sqrt(c1.r * c1.r - rc1 * rc1);\\n if(c1.r - std::abs(rc1) < EPS) rs1 = 0;\\n Point e12 = (c2.p - c1.p) / std::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 = std::abs(c.p - p);\\n return (equal(d, c.r) || d < c.r - EPS);\\n }\\n\\n // 円cと直線lの交点\\n std::vector<Point> crossPoint(const Circle &c, const Line &l) {\\n std::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 = std::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 std::vector<Point> tangentToCircle(const Point &p, const Circle &c) {\\n return crossPoint(c,\\n Circle(p, std::sqrt(std::norm(c.p - p) - c.r * c.r)));\\n }\\n\\n // 円の共通接線\\n std::vector<Line> tangent(const Circle &a, const Circle &b) {\\n std::vector<Line> ret;\\n // 2円の中心間の距離\\n D g = std::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 * std::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 std::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 std::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 std::vector<Point> ConvexHull(std::vector<Point> p) {\\n int n = (int)p.size(), k = 0;\\n std::sort(p.begin(), p.end(), [](const Point &a, const Point &b) {\\n return (a.real() != b.real() ? a.real() < b.real()\\n : a.imag() < b.imag());\\n });\\n std::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 std::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 // 凸多角形pを直線lで切断し、その左側を返す\\n std::vector<Point> ConvexCut(std::vector<Point> p, Line l) {\\n std::vector<Point> ret;\\n int sz = (int)p.size();\\n for(int i = 0; i < sz; i++) {\\n Point now = p[i];\\n Point nxt = p[i == sz - 1 ? 0 : i + 1];\\n if(ccw(l.a, l.b, now) != -1) ret.emplace_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) {\\n ret.emplace_back(crossPoint(Line(now, nxt), l));\\n }\\n }\\n return ret;\\n }\\n\\n} // namespace geometry\\n\\nvoid solve(ll n,ll m,ll l);\\n\\nint main() {\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n std::cout << std::fixed << std::setprecision(20);\\n while(1){\\n ll t,p,r;\\n cin>>t>>p>>r;\\n if(t==0)return 0;\\n solve(t,p,r);\\n }\\n}\\n\\nvecll dx = {1,0,-1,0};\\nvecll dy = {0,1,0,-1};\\n\\nstruct star{\\n ll x,y,a,r;\\n vector<geometry::Point> p;\\n void f(){\\n p.resize(5);\\n rep(i,5){\\n p[i] = geometry::Point(x-r*sin(geometry::degreeToRadian(a+72*i)),y+r*cos(geometry::degreeToRadian(a+72*i)));\\n }\\n }\\n};\\n\\ndouble ds(star a,star b){\\n double res=INF;\\n rep(i,5)rep(j,5){\\n geometry::Segment l1(a.p[i],a.p[(i+2)%5]);\\n geometry::Segment l2(b.p[j],b.p[(j+2)%5]);\\n chmin(res,geometry::distanceBetweenSegments(l1,l2));\\n }\\n return res;\\n}\\n\\nvoid solve(ll n,ll m,ll l){\\n m--;l--;\\n vector<star> s(n);\\n rep(i,n)cin>>s[i].x>>s[i].y>>s[i].a>>s[i].r;\\n rep(i,n)s[i].f();\\n vector<vecdou> di(n,vecdou(n,INF));\\n rep(i,n)di[i][i]=0;\\n rep(i,n)for(int j=i+1;j<n;j++){\\n di[i][j]=ds(s[i],s[j]);\\n di[j][i]=di[i][j];\\n }\\n vecdou dist(n,INF);\\n dist[m]=0;\\n priority_queue<pair<double, ll>, vector<pair<double, ll>>, greater<pair<double, ll>>> pq;\\n pq.push({0,m});\\n while(!pq.empty()){\\n ll pos = pq.top().second; pq.pop();\\n rep(to,n){\\n if(to==pos)continue;\\n double cost = di[pos][to];\\n if (dist[to] > dist[pos] + cost) {\\n dist[to] = dist[pos] + cost;\\n pq.push(make_pair(dist[to], to));\\n }\\n }\\n }\\n cout<<dist[l]<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.0428,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2402_10417473\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=2100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,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;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n// https://github.com/kth-competitive-programming/kactl/tree/main/content/geometry\\ntemplate<class T> ll sgn(T x) { return (x > 0) - (x < 0); }\\ntemplate<class T> struct Point {\\n using P = Point;\\n T x, y;\\n explicit Point(T x = 0, T y = 0) : x(x), y(y) {}\\n bool operator<(P p) const { return tie(x, y) < tie(p.x, p.y); }\\n bool operator==(P p) const { return tie(x, y) == tie(p.x, p.y); }\\n P operator+(P p) const { return P(x + p.x, y + p.y); }\\n P operator-(P p) const { return P(x - p.x, y - p.y); }\\n P operator*(T d) const { return P(x * d, y * d); }\\n P operator/(T d) const { return P(x / d, y / d); }\\n T dot(P p) const { return x * p.x + y * p.y; }\\n T cross(P p) const { return x * p.y - y * p.x; }\\n T cross(P a, P b) const { return (a - *this).cross(b - *this); }\\n T dist2() const { return x * x + y * y; }\\n long double dist() const { return sqrtl(dist2()); }\\n // angle to x-axis in interval [-pi, pi]\\n double angle() const { return atan2(y, x); }\\n P unit() const { return *this / dist(); } // makes dist()=1\\n P perp() const { return P(-y, x); } // rotates +90 degrees\\n P normal() const { return perp().unit(); }\\n // returns point rotated 'a' radians ccw around the origin\\n P rotate(double a) const {\\n return P(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a));\\n }\\n friend ostream& operator<<(ostream& os, P p) {\\n return os << \\\"(\\\" << p.x << \\\",\\\" << p.y << \\\")\\\";\\n }\\n};\\n\\ntemplate<class P> bool onSegment(P s, P e, P p) {\\n return p.cross(s, e) == 0 && (s - p).dot(e - p) <= 0;\\n}\\n\\ntemplate<class P> vector<P> segInter(P a, P b, P c, P d) {\\n auto oa = c.cross(d, a), ob = c.cross(d, b),\\n oc = a.cross(b, c), od = a.cross(b, d);\\n // Checks if intersection is single non-endpoint point.\\n if(sgn(oa) * sgn(ob) < 0 && sgn(oc) * sgn(od) < 0)\\n return {(a * ob - b * oa) / (ob - oa)};\\n set<P> s;\\n if(onSegment(c, d, a)) s.insert(a);\\n if(onSegment(c, d, b)) s.insert(b);\\n if(onSegment(a, b, c)) s.insert(c);\\n if(onSegment(a, b, d)) s.insert(d);\\n return {all(s)};\\n}\\nusing P = Point<long double>;\\nlong double segDist(P& s, P& e, P& p) {\\n if(s == e) return (p - s).dist();\\n auto d = (e - s).dist2(), t = min(d, max((long double)(0), (p - s).dot(e - s)));\\n return ((p - s) * d - (e - s) * t).dist() / d;\\n}\\n\\n\\nint N, M, L;\\n\\nvoid solve();\\n// CITRUS CURIO CITY / FREDERIC\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (cin >> N >> M >> L, N) solve();\\n}\\n\\nvoid solve(){\\n using ld = long double;\\n using P = Point<ld>;\\n vector<vector<P>> pts(N);\\n const ld pi = acos(-1);\\n ld diff = (pi * 144) / 180;\\n rep(i, 0, N){\\n ld x, y, a, r;\\n cin >> x >> y >> a >> r;\\n a += 90;\\n a /= 180;\\n a *= pi;\\n rep(j, 0, 6){\\n ld X = x + r * cosl(a);\\n ld Y = y + r * sinl(a);\\n pts[i].push_back(Point<ld>{X, Y});\\n a += diff;\\n // cout << X << \\\" \\\" << Y << \\\"\\\\n\\\";\\n }\\n }\\n vector G(N, vector<ld>(N, INF));\\n rep(i, 0, N) rep(j, 0, N){\\n rep(k, 0, 5) rep(l, 0, 5){\\n\\n if (i == j){\\n G[i][j] = 0;\\n continue;\\n }\\n if (segInter(pts[i][k], pts[i][k + 1], pts[j][l], pts[j][l + 1]).empty()){\\n rep(di, 0, 2) rep(dj, 0, 2){\\n chmin(G[i][j], (pts[i][k + di] - pts[j][l + dj]).dist());\\n }\\n }\\n else{\\n G[i][j] = 0;\\n }\\n ld tmp = segDist(pts[i][k], pts[i][k + 1], pts[j][l]);\\n chmin(G[i][j], tmp);\\n chmin(G[j][i], tmp);\\n }\\n }\\n M--, L--;\\n vector<ld> dist(N, INF);\\n dist[M] = 0;\\n vector<int> seen(N, 0);\\n // rep(i, 0, N) vec_out(G[i]);\\n rep(rp, 0, N){\\n int ind = -1;\\n rep(j, 0, N) if (seen[j] == 0){\\n if (ind == -1 || dist[ind] > dist[j]) ind = j;\\n }\\n rep(i, 0, N) chmin(dist[i], dist[ind] + G[ind][i]);\\n seen[ind] = 1;\\n }\\n cout << fixed << setprecision(20) << dist[L] << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 4216,\n \"score_of_the_acc\": -0.1078,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2402_9556605\",\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\\nusing T = double;\\nconst T eps = 1e-12;\\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\\ndouble PI = 3.14159265358979;\\n\\nint main() {\\nwhile(1) {\\n int N, S, G;\\n cin >> N >> S >> G;\\n if (N == 0) return 0;\\n S--, G--;\\n vector<vector<Segment>> Seg(N);\\n rep(i,0,N) {\\n double PX, PY, A, R;\\n cin >> PY >> PX >> A >> R;\\n A = 72 - A;\\n Point p(PX,PY);\\n vector<Point> PS;\\n rep(j,0,5) {\\n double Arg = PI * (j * 144.0 + A) / 180.0;\\n PS.push_back(p + polar(R,Arg));\\n }\\n rep(j,0,5) {\\n Seg[i].push_back(Segment(PS[j],PS[(j+1)%5]));\\n }\\n }\\n vector<vector<double>> D(N, vector<double>(N,inf));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n rep(k,0,5) {\\n rep(l,0,5) {\\n chmin(D[i][j], Dist(Seg[i][k], Seg[j][l]));\\n }\\n }\\n }\\n }\\n vector<double> DP(N,inf);\\n priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>> PQ;\\n DP[S] = 0;\\n PQ.push({0,S});\\n while(!PQ.empty()) {\\n auto [A,B] = PQ.top();\\n PQ.pop();\\n if (DP[B] < A) continue;\\n rep(i,0,N) {\\n if (i == B) continue;\\n double NA = A + D[B][i];\\n if (chmin(DP[i],NA)) {\\n PQ.push({NA,i});\\n }\\n }\\n }\\n printf(\\\"%.12lf\\\\n\\\", DP[G]);\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 4168,\n \"score_of_the_acc\": -0.0936,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2402_9378491\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing ll = long long;\\n#define MOD 1000000007\\n#define Mod 998244353\\nconst int MAX = 1000000005;\\nconst long long INF = 1000000000000000005LL;\\nusing namespace std;\\n//using namespace atcoder;\\n\\n\\nconst double EPS = 1e-8;\\n\\nstruct Point {\\n\\tdouble x, y;\\n};\\nPoint operator+(const Point& a, const Point& b) {\\n return {a.x + b.x, a.y + b.y};\\n}\\nPoint operator-(const Point& a, const Point& b) {\\n return {a.x - b.x, a.y - b.y};\\n}\\nPoint operator*(const Point& p, const double& a) {\\n return {p.x * a, p.y * a};\\n}\\n\\ndouble norm(Point P) {return sqrt(P.x*P.x + P.y*P.y);}\\ndouble arg(Point P) {return atan2(P.y, P.x);}\\n\\ndouble dot(Point P, Point Q) {\\n\\treturn P.x*Q.x + P.y*Q.y;\\n}\\n\\ndouble cross(Point P, Point Q) {\\n\\treturn P.x*Q.y - P.y*Q.x;\\n}\\n\\nint ccw(Point a, Point b, Point c) {\\n\\tif (cross(b - a, c - a) > EPS) return 1;\\n\\tif (cross(b - a, c - a) < -EPS) return -1;\\n\\tif (dot(b - a, c - a) < -EPS) return 2;\\n\\tif (norm(b - a) + EPS < norm(c - a)) return -2;\\n\\treturn 0;\\n}\\n\\nstruct Segment {\\n\\tPoint a, b;\\n};\\n\\nbool intersect(Segment s1, Segment s2) {\\n bool b1 = (ccw(s1.a, s1.b, s2.a)*ccw(s1.a, s1.b, s2.b) <= 0);\\n bool b2 = (ccw(s2.a, s2.b, s1.a)*ccw(s2.a, s2.b, s1.b) <= 0);\\n return b1 && b2;\\n}\\n\\nPoint cross_point(Segment s1, Segment s2) {\\n\\tPoint a = s1.a, b = s1.b, c = s2.a, d = s2.b;\\n\\tPoint p;\\n\\tp.x = a.x + cross(a-c, d-c)/cross(d-c, b-a) * (b-a).x;\\n\\tp.y = a.y + cross(a-c, d-c)/cross(d-c, b-a) * (b-a).y;\\n\\treturn p;\\n}\\n\\nPoint projection(Point p1, Point p2, Point p) {\\n return p1 + (p2 - p1) * (dot(p - p1, p2 - p1)/pow(norm(p2 - p1), 2));\\n}\\n\\nbool on_line(Segment s, Point p) {\\n double norm1 = norm(p - s.a), norm2 = norm(p - s.b), norm3 = norm(s.b - s.a);\\n return (norm1 + EPS < norm3 && norm2 + EPS < norm3);\\n}\\n\\ndouble distance(Segment s, Point p) {\\n Point q = projection(s.a, s.b, p);\\n if (on_line(s, q)) return norm(p - q);\\n else return min(norm(s.a - p), norm(s.b - p));\\n}\\n\\ndouble distance(Segment s1, Segment s2) {\\n if (intersect(s1, s2)) return 0;\\n return min({\\n distance(s1, s2.a), distance(s1, s2.b), distance(s2, s1.a), distance(s2, s1.b)\\n });\\n}\\n\\nusing d_i = pair<double, int>;\\n\\n\\nbool solve() {\\n int N, M, L;\\n cin >> N >> M >> L;\\n if (N == 0 && M == 0 && L == 0) return false;\\n M--; L--;\\n vector<int> X(N), Y(N), A(N), R(N);\\n for (int i = 0; i < N; i++) cin >> X[i] >> Y[i] >> A[i] >> R[i];\\n vector<vector<double>> cost(N, vector<double>(N, 1e+10));\\n for (int i = 0; i < N-1; i++) {\\n for (int j = i+1; j < N; j++) {\\n for (int k = 0; k < 5; k++) {\\n for (int l = 0; l < 5; l++) {\\n vector<Point> P(4);\\n vector<double> angle(4);\\n angle[0] = (double)(A[i] + 72*k)/180*M_PI; angle[1] = (double)(A[i] + 72*(k + 2))/180*M_PI;\\n angle[2] = (double)(A[j] + 72*l)/180*M_PI; angle[3] = (double)(A[j] + 72*(l + 2))/180*M_PI;\\n for (int idx = 0; idx < 2; idx++) P[idx] = {X[i] - R[i]*sin(angle[idx]), Y[i] + R[i]*cos(angle[idx])};\\n for (int idx = 0; idx < 2; idx++) P[idx+2] = {X[j] - R[j]*sin(angle[idx+2]), Y[j] + R[j]*cos(angle[idx+2])};\\n Segment s1 = {P[0], P[1]}, s2 = {P[2], P[3]};\\n cost[i][j] = min(cost[i][j], distance(s1, s2));\\n cost[j][i] = min(cost[j][i], distance(s1, s2));\\n }\\n }\\n }\\n }\\n priority_queue<d_i, vector<d_i>, greater<d_i>> pq;\\n vector<double> dist(N, 1e+10);\\n pq.push({0, M});\\n dist[M] = 0;\\n while (pq.size()) {\\n auto [d, v] = pq.top();\\n pq.pop();\\n if (d > dist[v] + EPS) continue;\\n for (int nv = 0; nv < N; nv++) {\\n if (nv == v) continue;\\n if (d + cost[v][nv] > dist[nv] - EPS) continue;\\n dist[nv] = d + cost[v][nv];\\n pq.push({dist[nv], nv});\\n }\\n }\\n cout << fixed << setprecision(12) << dist[L] << endl;\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0); cin.tie();\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -0.2025,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2402_9333587\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <algorithm>\\n#include <cmath>\\n#include <iterator>\\n#include <utility>\\n#include <vector>\\n\\nusing Real = long double;\\nconstexpr Real EPS = 1e-10;\\nconst Real PI = std::acos(-1);\\n\\nint sign(Real x) {\\n return x < -EPS ? -1 : x > EPS ? 1 : 0;\\n}\\n\\nbool eq(Real lhs, Real rhs) {\\n return sign(rhs - lhs) == 0;\\n}\\n\\nbool lte(Real lhs, Real rhs) {\\n return sign(rhs - lhs) >= 0;\\n}\\n\\nbool lt(Real lhs, Real rhs) {\\n return sign(rhs - lhs) > 0;\\n}\\n\\nbool gte(Real lhs, Real rhs) {\\n return lte(rhs, lhs);\\n}\\n\\nbool gt(Real lhs, Real rhs) {\\n return lt(rhs, lhs);\\n}\\n\\nstruct Point {\\n Real x;\\n Real y;\\n Point(Real x = 0, Real y = 0): x(x), y(y) {}\\n Point& operator+=(Point rhs) {\\n this->x += rhs.x;\\n this->y += rhs.y;\\n return *this;\\n }\\n Point& operator-=(Point rhs) {\\n this->x -= rhs.x;\\n this->y -= rhs.y;\\n return *this;\\n }\\n Point& operator*=(Real k) {\\n this->x *= k;\\n this->y *= k;\\n return *this;\\n }\\n Point& operator/=(Real k) {\\n this->x /= k;\\n this->y /= k;\\n return *this;\\n }\\n friend Point operator+(Point lhs, Point rhs) {\\n return lhs += rhs;\\n }\\n friend Point operator-(Point lhs, Point rhs) {\\n return lhs -= rhs;\\n }\\n friend Point operator*(Point p, Real k) {\\n return p *= k;\\n }\\n friend Point operator/(Point p, Real k) {\\n return p /= k;\\n }\\n friend Point operator*(Real k, Point p) {\\n return p * k;\\n }\\n friend Point operator/(Real k, Point p) {\\n return p / k;\\n }\\n friend bool operator==(Point lhs, Point rhs) {\\n return eq(lhs.x, rhs.x) && eq(lhs.y, rhs.y);\\n }\\n friend bool operator<(Point lhs, Point rhs) {\\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\\n return lt(lhs.x, rhs.x);\\n }\\n friend bool operator>(Point lhs, Point rhs) {\\n return rhs < lhs;\\n }\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = Points;\\nusing Vector = Point;\\n\\nReal norm(Vector p) {\\n return p.x * p.x + p.y * p.y;\\n}\\n\\nReal abs(Vector p) {\\n return std::sqrt(norm(p));\\n}\\n\\nReal dot(Vector lhs, Vector rhs) {\\n return lhs.x * rhs.x + lhs.y * rhs.y;\\n}\\n\\nReal cross(Vector lhs, Vector rhs) {\\n return lhs.x * rhs.y - lhs.y * rhs.x;\\n}\\n\\nint ccw(Point p0, Point p1, Point p2) {\\n Vector a = p1 - p0;\\n Vector b = p2 - p0;\\n\\n if (cross(a, b) > EPS) return 1;\\n\\n if (cross(a, b) < -EPS) return -1;\\n\\n if (dot(a, b) < 0) return 2;\\n\\n if (norm(a) < norm(b)) return -2;\\n\\n return 0;\\n}\\n\\nstruct Circle {\\n Real r;\\n Point c;\\n Circle() {}\\n Circle(Real r, Point c): r(r), c(c) {}\\n};\\n\\nstruct Segment {\\n Segment() {}\\n Segment(Point p0, Point p1): p0(p0), p1(p1) {}\\n Point p0, p1;\\n};\\n\\nstruct Line {\\n Line() {}\\n Line(Point p0, Point p1): p0(p0), p1(p1) {}\\n explicit Line(Segment s): p0(s.p0), p1(s.p1) {}\\n Point p0, p1;\\n};\\n\\nReal distance(Point lhs, Point rhs) {\\n return abs(rhs - lhs);\\n}\\n\\nReal distance(Line l, Point p) {\\n return std::abs(cross(l.p1 - l.p0, p - l.p0)) / abs(l.p1 - l.p0);\\n}\\n\\nReal distance(Segment s, Point p) {\\n if (dot(s.p1 - s.p0, p - s.p0) < 0) {\\n return distance(p, s.p0);\\n }\\n if (dot(s.p0 - s.p1, p - s.p1) < 0) {\\n return distance(p, s.p1);\\n }\\n return distance(Line(s), p);\\n}\\n\\nbool intersect(Segment lhs, Segment rhs) {\\n return ccw(lhs.p0, lhs.p1, rhs.p0) * ccw(lhs.p0, lhs.p1, rhs.p1) <= 0\\n && ccw(rhs.p0, rhs.p1, lhs.p0) * ccw(rhs.p0, rhs.p1, lhs.p1) <= 0;\\n}\\n\\nbool intersect(Segment s, Point p) {\\n return ccw(s.p0, s.p1, p) == 0;\\n}\\n\\nReal distance(Segment lhs, Segment rhs) {\\n if (intersect(lhs, rhs)) {\\n return Real(0);\\n }\\n return std::min({distance(lhs, rhs.p0), distance(lhs, rhs.p1), distance(rhs, lhs.p0), distance(rhs, lhs.p1)});\\n}\\n\\nbool parallel(Vector lhs, Vector rhs) {\\n return eq(cross(lhs, rhs), 0);\\n}\\n\\nbool parallel(Segment lhs, Segment rhs) {\\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\\n}\\n\\nbool parallel(Line lhs, Line rhs) {\\n return parallel(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\\n}\\n\\nPoint crosspoint(Line lhs, Line rhs) {\\n Real a = cross(lhs.p1 - lhs.p0, rhs.p1 - rhs.p0);\\n Real b = cross(lhs.p1 - lhs.p0, lhs.p1 - rhs.p0);\\n return rhs.p0 + (rhs.p1 - rhs.p0) * b / a;\\n}\\n\\nbool intersect(Line l, Segment s) {\\n return ccw(l.p0, l.p1, s.p0) * ccw(l.p0, l.p1, s.p1) <= 0;\\n}\\n\\nbool intersect(Circle c, Line l) {\\n return lte(distance(l, c.c), c.r);\\n}\\n\\nbool intersect(Circle c, Point p) {\\n return eq(distance(c.c, p), c.r);\\n}\\n\\nint intersect(Circle lhs, Circle rhs) {\\n if (gt(lhs.r, rhs.r)) std::swap(lhs, rhs);\\n Real d = distance(lhs.c, rhs.c);\\n if (lt(lhs.r + rhs.r, d)) return 4;\\n if (eq(lhs.r + rhs.r, d)) return 3;\\n if (gt(lhs.r + d, rhs.r)) return 2;\\n if (eq(lhs.r + d, rhs.r)) return 1;\\n return 0;\\n}\\n\\nbool orthogonal(Vector lhs, Vector rhs) {\\n return eq(dot(lhs, rhs), 0);\\n}\\n\\nbool orthogonal(Segment lhs, Segment rhs) {\\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\\n}\\n\\nbool orthogonal(Line lhs, Line rhs) {\\n return orthogonal(lhs.p0 - lhs.p1, rhs.p0 - rhs.p1);\\n}\\n\\nPoint crosspoint(Segment lhs, Segment rhs) {\\n Real d0 = distance(Line(lhs.p0, lhs.p1), rhs.p0);\\n Real d1 = distance(Line(lhs.p0, lhs.p1), rhs.p1);\\n return rhs.p0 + (rhs.p1 - rhs.p0) * (d0 / (d0 + d1));\\n}\\n\\nReal arg(Vector p) {\\n return std::atan2(p.y, p.x);\\n}\\n\\nVector polar(Real a, Real r) {\\n return Point(std::cos(r) * a, std::sin(r) * a);\\n}\\n\\nPoint rotate(Point p, Real t) {\\n Point v = polar(1, t);\\n return Point(p.x * v.x - p.y * v.y, p.x * v.y + p.y * v.x);\\n}\\n\\nReal angle(Point p0, Point p1, Point p2) {\\n Real a = arg(p0 - p1);\\n Real b = arg(p2 - p1);\\n if (gt(a, b)) std::swap(a, b);\\n return std::min(b - a, 2 * PI - (b - a));\\n}\\n\\nPoints crosspoint(Circle lhs, Circle rhs) {\\n Real d = abs(lhs.c - rhs.c);\\n if (eq(d, lhs.r + rhs.r)) return {lhs.c + lhs.r * (rhs.c - lhs.c) / d};\\n Real a = std::acos((lhs.r * lhs.r + d * d - rhs.r * rhs.r) / (2 * lhs.r * d));\\n Real t = arg(rhs.c - lhs.c);\\n return {lhs.c + polar(lhs.r, t + a), lhs.c + polar(lhs.r, t - a)};\\n}\\n\\nPoint projection(Segment s, Point p) {\\n Vector a = p - s.p0;\\n Vector b = s.p1 - s.p0;\\n Real t = dot(a, b) / norm(b);\\n return s.p0 + t * b;\\n}\\n\\nPoint projection(Line l, Point p) {\\n Vector a = p - l.p0;\\n Vector b = l.p1 - l.p0;\\n Real t = dot(a, b) / norm(b);\\n return l.p0 + t * b;\\n}\\n\\nPoint reflection(Segment s, Point p) {\\n return p + (projection(s, p) - p) * Real(2);\\n}\\n\\nPoint reflection(Line l, Point p) {\\n return p + (projection(l, p) - p) * Real(2);\\n}\\n\\nPoints crosspoint(Circle c, Line l) {\\n Vector p = projection(l, c.c);\\n Real t = std::sqrt(c.r * c.r - norm(c.c - p));\\n if (eq(t, 0)) return {p};\\n Vector e = (l.p1 - l.p0) / abs(l.p1 - l.p0);\\n return {p + t * e, p + -t * e};\\n}\\n\\nReal area(Polygon poly) {\\n int n = poly.size();\\n Real result = 0;\\n for (int i = 0; i < n; i++) {\\n result += cross(poly[i], poly[(i + 1) % n]);\\n }\\n return result / 2;\\n}\\n\\nReal perimeter(Polygon poly) {\\n int n = poly.size();\\n Real result = 0;\\n for (int i = 0; i < n; i++) {\\n result += abs(poly[i] - poly[(i + 1) % n]);\\n }\\n return result;\\n}\\n\\nbool convex(Polygon poly) {\\n int n = poly.size();\\n for (int i = 0; i < n; i++) {\\n if (ccw(poly[i], poly[(i + 1) % n], poly[(i + 2) % n]) == -1) return false;\\n }\\n return true;\\n}\\n\\nint contain(Polygon poly, Point p) {\\n int n = poly.size();\\n bool parity = false;\\n for (int i = 0; i < n; i++) {\\n Point a = poly[i] - p;\\n Point b = poly[(i + 1) % n] - p;\\n if (gt(a.y, b.y)) std::swap(a, b);\\n if (lte(a.y, 0) && lt(0, b.y) && lt(cross(a, b), 0)) parity ^= true;\\n if (eq(cross(a, b), 0) && lte(dot(a, b), 0)) return 1;\\n }\\n return (parity ? 2 : 0);\\n}\\n\\nPolygon convex_hull(Points points) {\\n std::sort(points.begin(), points.end(), [](Point lhs, Point rhs) {\\n if (eq(lhs.x, rhs.x)) return lt(lhs.y, rhs.y);\\n return lt(lhs.x, rhs.x);\\n });\\n int n = points.size();\\n Points lower, upper;\\n lower.push_back(points[n - 1]);\\n lower.push_back(points[n - 2]);\\n upper.push_back(points[0]);\\n upper.push_back(points[1]);\\n for (int i = n - 3; i >= 0; i--) {\\n for (int m = lower.size(); m >= 2 && ccw(lower[m - 2], lower[m - 1], points[i]) >= 0; m--) {\\n lower.pop_back();\\n }\\n lower.push_back(points[i]);\\n }\\n for (int i = 2; i < n; i++) {\\n for (int m = upper.size(); m >= 2 && ccw(upper[m - 2], upper[m - 1], points[i]) >= 0; m--) {\\n upper.pop_back();\\n }\\n upper.push_back(points[i]);\\n }\\n std::reverse(lower.begin(), lower.end());\\n std::copy(std::next(upper.rbegin()), std::prev(upper.rend()), std::back_inserter(lower));\\n return lower;\\n}\\n\\nPolygon convex_cut(Polygon poly, Line l) {\\n int n = poly.size();\\n Polygon res;\\n for (int i = 0; i < n; i++) {\\n Point a = poly[i];\\n Point b = poly[(i + 1) % n];\\n if (ccw(l.p0, l.p1, a) != -1) res.push_back(a);\\n if (ccw(l.p0, l.p1, a) * ccw(l.p0, l.p1, b) == -1) {\\n res.push_back(crosspoint(l, Line(a, b)));\\n }\\n }\\n return res;\\n}\\n\\nLine bisector(Point p0, Point p1, Point p2) {\\n return Line(p1, p1 + polar(1, angle(p0, p1, p2) / 2));\\n}\\n\\nCircle incircle(Point p0, Point p1, Point p2) {\\n Point c = crosspoint(bisector(p0, p1, p2), bisector(p1, p2, p0));\\n Real r = std::abs(2 * area({p0, p1, p2}) / perimeter({p0, p1, p2}));\\n return Circle(r, c);\\n}\\n\\nLine perpendicular(Line l, Point p) {\\n Vector v = l.p1 - l.p0;\\n return Line(p, p + Vector(-v.y, v.x));\\n}\\n\\nLine perpendicular_bisector(Segment s) {\\n return perpendicular(Line(s), (s.p0 + s.p1) / 2);\\n}\\n\\nCircle circumscribed_circle(Point p0, Point p1, Point p2) {\\n Point c = crosspoint(perpendicular_bisector(Segment(p0, p1)), perpendicular_bisector(Segment(p0, p2)));\\n return Circle(distance(p0, c), c);\\n}\\n\\nReal area(Circle c) {\\n return c.r * c.r * PI;\\n}\\n\\nPoints tangent(Circle c, Point p) {\\n return crosspoint(c, Circle(std::sqrt(norm(c.c - p) - c.r * c.r), p));\\n}\\n\\nReal calc(std::vector<Segment> lhs, std::vector<Segment> rhs) {\\n Real result = 1e18;\\n for (int i = 0; i < 5; i++) {\\n for (int j = 0; j < 5; j++) {\\n result = std::min(result, distance(lhs[i], rhs[j]));\\n }\\n }\\n return result;\\n}\\n\\nint solve() {\\n int n, s, t;\\n std::cin >> n >> s >> t;\\n s--;\\n t--;\\n if (n == 0) return 1;\\n using Segments = std::vector<Segment>;\\n std::vector<Segments> stars;\\n for (int i = 0; i < n; i++) {\\n Point c;\\n std::cin >> c.x >> c.y;\\n int a, r;\\n std::cin >> a >> r;\\n Polygon poly;\\n Point init(0, r);\\n for (int j = 0; j < 360; j += 72) {\\n Real t = (2 * PI) * (Real((j + a) % 360) / 360);\\n poly.push_back(c + rotate(init, t));\\n }\\n Segments segments;\\n segments.push_back(Segment(poly[0], poly[2]));\\n segments.push_back(Segment(poly[0], poly[3]));\\n segments.push_back(Segment(poly[1], poly[3]));\\n segments.push_back(Segment(poly[1], poly[4]));\\n segments.push_back(Segment(poly[2], poly[4]));\\n stars.push_back(segments);\\n }\\n constexpr Real INF = 1e18;\\n std::vector dist(n, std::vector<Real>(n, INF));\\n for (int i = 0; i < n; i++) dist[i][i] = 0;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n if (i == j) continue;\\n dist[i][j] = calc(stars[i], stars[j]);\\n }\\n }\\n for (int k = 0; k < n; k++) {\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n dist[i][j] = std::min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n }\\n }\\n std::cout << std::fixed << std::setprecision(10);\\n std::cout << dist[s][t] << std::endl;\\n return 0;\\n}\\n\\nint main() {\\n while (!solve())\\n ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 4124,\n \"score_of_the_acc\": -0.149,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2402_9309743\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\n// template<class T>\\n// void chmax(T& p, T q) { if (p < q)p = q; };\\n\\n#include<complex>\\n#define mod 1000000007\\nusing ll = long long;\\nconst int INF = 1000000000;\\nconst ll LINF = 1001002003004005006ll;\\nint dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 };\\n// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\\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\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n }\\n} iosetup;\\n\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v)is >> x;\\n return is;\\n}\\n\\n#line 1 \\\"Geometry/template.cpp\\\"\\n// Real\\nusing Real = double;\\nconst Real EPS = 1e-6;\\nconst Real pi = acosl(-1);\\n\\n// Point\\nusing Point = complex<Real>;\\nistream& operator>>(istream& is, Point& p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\nostream& operator<<(ostream& os, Point& p) {\\n return os << fixed << setprecision(12) << p.real() << ' ' << p.imag();\\n}\\ninline bool eq(Real a, Real b) {\\n return fabs(a - b) < EPS;\\n}\\nPoint operator*(const Point& p, const Real& d) {\\n return Point(real(p) * d, imag(p) * d);\\n}\\n\\n// Line\\nstruct Line {\\n Point p1, p2;\\n Line() = default;\\n Line(Point p1, Point p2) :p1(p1), p2(p2) {}\\n //Ax + By = C\\n Line(Real A, Real B, Real C) {\\n if (eq(A, 0)) p1 = Point(0, C / B), p2 = Point(1, C / B);\\n else if (eq(B, 0))p1 = Point(C / A, 0), p2 = Point(C / A, 1);\\n else p1 = Point(0, C / B), p2 = Point(C / A, 0);\\n }\\n};\\n\\n// Segment\\nstruct Segment :Line {\\n Segment() = default;\\n Segment(Point p1, Point p2) :Line(p1, p2) {}\\n};\\n\\nPoint rotate(Real theta, Point p) {\\n return Point(cos(theta) * real(p) - sin(theta) * imag(p), sin(theta) * real(p) + cos(theta) * imag(p));\\n}\\nReal dot(Point a, Point b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n#line 1 \\\"Geometry/Cross.cpp\\\"\\n// Cross\\nReal cross(Point a, Point b) {\\n return real(a) * imag(b) - imag(a) * real(b);\\n}\\n#line 1 \\\"Geometry/CounterClockWise.cpp\\\"\\n// ccw (counter clockwise) (Requires: cross, dot)\\n//https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/all/CGL_1_C\\nint ccw(Point a, Point b, Point c) {\\n b -= a; c -= a;\\n if (cross(b, c) > EPS) return 1;//COUNTER CLOCKWISE\\n else if (cross(b, c) < -EPS) return -1;//CLOCKWISE\\n else if (dot(b, c) < 0) return 2;//c--a--b ONLINE BACK\\n else if (norm(b) < norm(c)) return -2;//a--b--c ONLINE FRONT\\n else return 0;//a--c--b ON SEGMENT\\n}\\n\\nPoint projection(Segment l, Point p) {\\n Real k = dot(l.p1 - l.p2, p - l.p1) / norm(l.p1 - l.p2);\\n return l.p1 + (l.p1 - l.p2) * k;\\n}\\n\\nbool intersect(Line l, Point p) {\\n return abs(ccw(l.p1, l.p2, p)) != 1;\\n}\\nbool intersect(Segment s, Point p) {\\n return ccw(s.p1, s.p2, p) == 0;\\n}\\nbool intersect(Segment s, Segment t) {\\n return ccw(s.p1, s.p2, t.p1) * ccw(s.p1, s.p2, t.p2) <= 0 && ccw(t.p1, t.p2, s.p1) * ccw(t.p1, t.p2, s.p2) <= 0;\\n}\\nReal dis(Segment s, Point p) {\\n Point r = projection(s, p);\\n if (intersect(s, r)) return abs(r - p);\\n return min(abs(s.p1 - p), abs(s.p2 - p));\\n}\\nReal dis(Segment a, Segment b) {\\n if (intersect(a, b)) return 0;\\n return min({ dis(a,b.p1),dis(a,b.p2),dis(b,a.p1),dis(b,a.p2) });\\n}\\n\\nll N,M,L;\\nvoid solve(ll N,ll M,ll L) {\\n vector<Point> P(5*N);\\n rep(i,N){\\n double x,y,a,r;\\n cin>>x>>y>>a>>r;\\n rep(j,5)P[i*5+j]={x,y};\\n Point Q={r,0};\\n Q=rotate(a/180.0*pi+pi/2.0,Q);\\n rep(j,5){\\n P[i*5+j]+=Q;\\n Q=rotate(pi/5.0*2.0,Q);\\n }\\n }\\n vector<Segment> S(5*N);\\n rep(i,N){\\n rep(j,5){\\n S[i*5+j]=Segment(P[i*5+j],P[i*5+(j+2)%5]);\\n }\\n }\\n priority_queue<pair<double,ll>,vector<pair<double,ll>>,greater<pair<double,ll>>> Q;\\n vector<double> D(5*N,1e18);\\n rep(j,5){\\n Q.push({0,M*5-5+j});\\n D[M*5-5+j]=0.0;\\n }\\n vector<bool> seen(5*N,0);\\n while(!Q.empty()){\\n double d=Q.top().first;\\n ll n=Q.top().second;\\n Q.pop();\\n if(seen[n])continue;\\n seen[n]=1;\\n rep(i,5*N){\\n double nd=d+dis(S[i],S[n]);\\n if(D[i]>nd+EPS){\\n D[i]=nd;\\n Q.push({D[i],i});\\n }\\n }\\n }\\n double an=1e18;\\n rep(j,5)chmin(an,D[L*5-5+j]);\\n cout<<fixed<<setprecision(15)<<an<<endl;\\n\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n \\n while (cin >> N>>M>>L) {\\n if (N == 0)return 0;\\n solve(N,M,L);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.3226,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2402_9156234\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = acos(-1.0);\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\nusing P = complex<ld>;\\nusing L = pair<P, P>;\\nconst ld eps = 1e-9;\\nld dot(P a, P b){return (conj(a) * b).real();}\\nld cross(P a, P b){return (conj(a) * b).imag();}\\n\\nP proj(P a, L b){ //bに対するaの射影\\n P p1 = b.second - b.first, p2 = a - b.first;\\n return (dot(p1, p2) / (abs(p1) * abs(p1))) * p1 + b.first;\\n}\\nP refl(P a, L b){return a + P{2, 0} * (proj(a, b) - a);} //bに対するaの反射\\n\\nint ccw(P a, P b, P c) { // 点の進行方向\\n b -= a; 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) < -eps) return +2; // c--a--b on line\\n if (abs(b) < abs(c)) return -2; // a--b--c on line or a==b\\n return 0; // a--c--b on line or a==c or b==c\\n}\\n\\n// 直線と点\\nbool isecLP(P a1, P a2, P b) {\\n return abs(ccw(a1, a2, b)) != 1; // return EQ(cross(a2-a1, b-a1), 0); と等価\\n}\\n\\n// 直線と直線\\nbool isecLL(P a1, P a2, P b1, P b2) {\\n return !isecLP(a2-a1, b2-b1, 0) || isecLP(a1, b1, b2);\\n}\\n\\n// 直線と線分\\nbool isecLS(P a1, P a2, P b1, P b2) {\\n return cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < eps;\\n}\\n\\n// 線分と線分\\nbool isecSS(P a1, P a2, P b1, P b2) {\\n return ccw(a1, a2, b1)*ccw(a1, a2, b2) <= 0 &&\\n ccw(b1, b2, a1)*ccw(b1, b2, a2) <= 0;\\n}\\n\\n// 線分と点\\nbool isecSP(P a1, P a2, P b) {\\n return !ccw(a1, a2, b);\\n}\\n\\nld distLP(P a1, P a2, P p) {\\n return abs(proj(p, {a1, a2}) - p);\\n}\\n\\nld distLL(P a1, P a2, P b1, P b2) {\\n return isecLL(a1, a2, b1, b2) ? 0 : distLP(a1, a2, b1);\\n}\\n\\nld distLS(P a1, P a2, P b1, P b2) {\\n return isecLS(a1, a2, b1, b2) ? 0 : min(distLP(a1, a2, b1), distLP(a1, a2, b2));\\n}\\n\\nld distSP(P a1, P a2, P p) {\\n P r = proj(p, {a1, a2});\\n if (isecSP(a1, a2, r)) return abs(r-p);\\n return min(abs(a1-p), abs(a2-p));\\n}\\n\\nld distSS(P a1, P a2, P b1, P b2) {\\n if (isecSS(a1, a2, b1, b2)) return 0;\\n return min(min(distSP(a1, a2, b1), distSP(a1, a2, b2)),\\n min(distSP(b1, b2, a1), distSP(b1, b2, a2)));\\n}\\n\\ntuple<vld, vi> dijkstra(int s, int N, vv<pair<int, ld>> &g){\\n using P = pair<ld, int>;\\n vld dist(N, INF);\\n vi bef(N);\\n priority_queue<P, vc<P>, greater<P>> q;\\n dist[s] = 0;\\n q.push({0, s});\\n while (!q.empty()){\\n auto [c, now] = q.top();q.pop();\\n if (dist[now] < c) continue;\\n for (auto&& [nxt, nc]: g[now]) if (dist[nxt] > c + nc){\\n dist[nxt] = c + nc;\\n bef[nxt] = now;\\n q.push({dist[nxt], nxt}); \\n }\\n }\\n return {dist, bef};\\n}\\n\\n\\nld solve(int N, int s, int t){\\n vc<tuple<P, ld, ld>> point;\\n rep(i, N){\\n ld x, y, a, r; cin >> x >> y >> a >> r;\\n point.push_back({{x, y}, a, r});\\n }\\n vv<pair<int, ld>> g(N);\\n vv<P> ele;\\n for (auto [o, a, r] : point){\\n ele.push_back({});\\n rep(i, 5){\\n ele.back().push_back(o + P{r, 0} * P{cos((90 + a + 144 * i) * pi / (ld)180), sin((90 + a + 144 * i) * pi / (ld)180)});\\n }\\n }\\n rep(j, N) rep(i, j){\\n ld mini = inf;\\n rep(a, 5) rep(b, 5){\\n mini = min(mini, abs(ele[i][a] - ele[j][b]));\\n mini = min(mini, distSP(ele[i][a], ele[i][(a + 1) % 5], ele[j][b]));\\n mini = min(mini, distSP(ele[j][b], ele[j][(b + 1) % 5], ele[i][a]));\\n if (isecSS(ele[i][a], ele[i][(a + 1) % 5], ele[j][b], ele[j][(b + 1) % 5])) mini = 0;\\n }\\n g[i].push_back({j, mini});\\n g[j].push_back({i, mini});\\n }\\n auto [dist, bef] = dijkstra(s, N, g);\\n return dist[t];\\n}\\n\\nint main(){\\n vc<ld> ans;\\n while (true){\\n int N, s, t; cin >> N >> s >> t; s--; t--;\\n if (N == 0) break;\\n ans.push_back(solve(N, s, t));\\n }\\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.2998,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2402_8496300\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n\\n\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nusing Real = long double;\\nconstexpr Real EPS{1e-12};\\n\\nnamespace internal {\\n\\nconstexpr i32 negative{-1};\\nconstexpr i32 zero{};\\nconstexpr i32 positive{1};\\n\\n} // namespace internal\\n\\nconstexpr i32 Sign(Real value) {\\n if (value < -EPS) return internal::negative;\\n if (value > EPS) return internal::positive;\\n return internal::zero;\\n}\\n\\nconstexpr bool Zero(Real value) {\\n return Sign(value) == internal::zero;\\n}\\n\\nconstexpr bool Positive(Real value) {\\n return Sign(value) == internal::positive;\\n}\\n\\nconstexpr bool Negative(Real value) {\\n return Sign(value) == internal::negative;\\n}\\n\\nconstexpr bool Equal(Real a, Real b) {\\n return Zero(a - b);\\n}\\n\\nconstexpr bool Smaller(Real a, Real b) {\\n return Negative(a - b);\\n}\\n\\nconstexpr bool Bigger(Real a, Real b) {\\n return Positive(a - b);\\n}\\n\\nconstexpr Real Square(Real value) {\\n return (Zero(value) ? value : value * value);\\n}\\n\\nconstexpr Real Sqrt(Real value) {\\n assert(!Negative(value));\\n return (Zero(value) ? value : sqrtl(value));\\n}\\n\\nconstexpr Real Abs(Real value) {\\n return (Negative(value) ? -value : value);\\n}\\n\\n} // namespace geometryR2\\n \\n} // namespace zawa\\n\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nconstexpr Real PI{acosl(-1)};\\nconstexpr Real TAU{static_cast<Real>(2) * PI};\\n\\nconstexpr Real ArcToRadian(Real arc) {\\n return (arc * PI) / static_cast<Real>(180);\\n}\\n\\nconstexpr Real RadianToArc(Real radian) {\\n return (radian * static_cast<Real>(180)) / PI;\\n}\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nclass Point {\\nprivate:\\n Real x_{}, y_{};\\npublic:\\n /* constructor */\\n Point() = default;\\n Point(Real x, Real y) : x_{x}, y_{y} {}\\n\\n /* getter, setter */\\n Real x() const {\\n return x_;\\n }\\n Real& x() {\\n return x_;\\n }\\n Real y() const {\\n return y_;\\n }\\n Real& y() {\\n return y_;\\n }\\n\\n /* operator */\\n Point& operator+=(const Point& rhs) {\\n x_ += rhs.x();\\n y_ += rhs.y();\\n return *this;\\n }\\n friend Point operator+(const Point& lhs, const Point& rhs) {\\n return Point{lhs} += rhs;\\n }\\n Point operator+() const {\\n return *this;\\n }\\n Point& operator-=(const Point& rhs) {\\n x_ -= rhs.x();\\n y_ -= rhs.y();\\n return *this;\\n }\\n friend Point operator-(const Point& lhs, const Point& rhs) {\\n return Point{lhs} -= rhs;\\n }\\n Point operator-() const {\\n return Point{} - *this;\\n }\\n Point& operator*=(Real k) {\\n x_ *= k;\\n y_ *= k;\\n return *this;\\n }\\n friend Point operator*(Real k, const Point& p) {\\n return Point{p} *= k;\\n }\\n friend Point operator*(const Point& p, Real k) {\\n return Point{p} *= k;\\n }\\n Point& operator/=(Real k) {\\n assert(!Zero(k));\\n x_ /= k;\\n y_ /= k;\\n return *this;\\n }\\n friend Point operator/(Real k, const Point& p) {\\n return Point{p} /= k;\\n }\\n friend Point operator/(const Point& p, Real k) {\\n return Point{p} /= k;\\n }\\n friend bool operator==(const Point& lhs, const Point& rhs) {\\n return Equal(lhs.x(), rhs.x()) and Equal(lhs.y(), rhs.y());\\n }\\n friend bool operator!=(const Point& lhs, const Point& rhs) {\\n return !Equal(lhs.x(), rhs.x()) or !Equal(lhs.y(), rhs.y());\\n }\\n friend bool operator<(const Point& lhs, const Point& rhs) {\\n return Smaller(lhs.x(), rhs.x()) or \\n (Equal(lhs.x(), rhs.x()) and Smaller(lhs.y(), rhs.y()));\\n }\\n friend bool operator<=(const Point& lhs, const Point& rhs) {\\n return Smaller(lhs.x(), rhs.x()) or \\n (Equal(lhs.x(), rhs.x()) and (Smaller(lhs.y(), rhs.y()) or Equal(lhs.y(), rhs.y())));\\n }\\n friend bool operator>(const Point& lhs, const Point& rhs) {\\n return Bigger(lhs.x(), rhs.x()) or\\n (Equal(lhs.x(), rhs.x()) and Bigger(lhs.y(), rhs.y()));\\n }\\n friend bool operator>=(const Point& lhs, const Point& rhs) {\\n return Bigger(lhs.x(), rhs.x()) or\\n (Equal(lhs.x(), rhs.x()) and (Bigger(lhs.y(), rhs.y()) or Equal(lhs.y(), rhs.y())));\\n }\\n friend std::istream& operator>>(std::istream& is, Point& p) {\\n is >> p.x_ >> p.y_;\\n return is;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const Point& p) {\\n os << '(' << p.x_ << ',' << p.y_ << ')';\\n return os;\\n }\\n \\n /* member function */\\n Real normSquare() const {\\n return Square(x_) + Square(y_);\\n }\\n Real norm() const {\\n return Sqrt(normSquare());\\n }\\n void normalize() {\\n assert((*this) != Point{});\\n (*this) /= norm(); \\n }\\n Point normalized() const {\\n Point res{*this};\\n res.normalize();\\n return res;\\n }\\n Point rotated(Real radian) const {\\n return Point{\\n x_ * cosl(radian) - y_ * sinl(radian),\\n x_ * sinl(radian) + y_ * cosl(radian)\\n };\\n }\\n void rotate(Real radian) {\\n *this = rotated(radian); \\n }\\n Point rotatedByArc(Real arc) const {\\n return rotated(ArcToRadian(arc));\\n }\\n void rotateByArc(Real arc) {\\n *this = rotatedByArc(arc);\\n }\\n Real argument() const {\\n return (Negative(y_) ? TAU : static_cast<Real>(0)) + atan2l(y_, x_);\\n }\\n Real argumentByArc() const {\\n return RadianToArc(argument());\\n }\\n\\n /* friend function */\\n friend Real Dot(const Point& lhs, const Point& rhs) {\\n return lhs.x() * rhs.x() + lhs.y() * rhs.y();\\n }\\n friend Real Cross(const Point& lhs, const Point& rhs) {\\n return lhs.x() * rhs.y() - lhs.y() * rhs.x();\\n }\\n friend Real Argument(const Point& lhs, const Point& rhs) {\\n return rhs.argument() - lhs.argument();\\n }\\n friend bool ArgComp(const Point& lhs, const Point& rhs) {\\n return Smaller(lhs.argument(), rhs.argument());\\n }\\n};\\n\\nusing Vector = Point;\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nenum RELATION {\\n // p0 -> p1 -> p2の順で直線上に並んでいる\\n ONLINE_FRONT = -2,\\n // (p1 - p0) -> (p2 - p0)が時計回りになっている\\n CLOCKWISE,\\n // p0 -> p2 -> p1の順で直線上に並んでいる\\n ON_SEGMENT,\\n // (p1 - p0) -> (p2 - p0)が反時計回りになっている\\n COUNTER_CLOCKWISE,\\n // p2 -> p0 -> p1、またはp1 -> p0 -> p2の順で直線上に並んでいる\\n ONLINE_BACK\\n};\\n\\nRELATION Relation(const Point& p0, const Point& p1, const Point& p2) {\\n Point a{p1 - p0}, b{p2 - p0};\\n if (Positive(Cross(a, b))) return COUNTER_CLOCKWISE;\\n if (Negative(Cross(a, b))) return CLOCKWISE;\\n if (Negative(Dot(a, b))) return ONLINE_BACK;\\n if (Smaller(a.normSquare(), b.normSquare())) return ONLINE_FRONT;\\n return ON_SEGMENT;\\n};\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nReal Distance(const Point& p0, const Point& p1) {\\n return Point{p1 - p0}.norm();\\n}\\n\\nReal DistanceSquare(const Point& p0, const Point& p1) {\\n return Point{p1 - p0}.normSquare();\\n}\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nclass Segment {\\nprivate:\\n Point p0_{}, p1_{};\\npublic:\\n /* constructor */\\n Segment() = default;\\n Segment(const Point& p0, const Point& p1) : p0_{p0}, p1_{p1} {}\\n Segment(Real x0, Real y0, Real x1, Real y1) : p0_{x0, y0}, p1_{x1, y1} {}\\n\\n /* getter setter */\\n const Point& p0() const {\\n return p0_;\\n }\\n Point& p0() {\\n return p0_;\\n }\\n const Point& p1() const {\\n return p1_;\\n }\\n Point& p1() {\\n return p1_;\\n }\\n\\n /* member function */\\n bool valid() const {\\n return p0_ != p1_;\\n }\\n bool straddle(const Segment& s) const {\\n return Relation(p0_, p1_, s.p0()) * Relation(p0_, p1_, s.p1()) <= 0;\\n }\\n Real length() const {\\n assert(valid());\\n return Distance(p0_, p1_);\\n }\\n};\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nbool Intersect(const Segment& s0, const Segment& s1) {\\n assert(s0.valid());\\n assert(s1.valid());\\n return s0.straddle(s1) and s1.straddle(s0);\\n}\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nReal Distance(const Point& p, const Segment& s) {\\n assert(s.valid());\\n if (Negative(Dot(s.p1() - s.p0(), p - s.p0()))) {\\n return Distance(p, s.p0());\\n }\\n if (Negative(Dot(s.p0() - s.p1(), p - s.p1()))) {\\n return Distance(p, s.p1());\\n }\\n return Abs(Cross(s.p1() - s.p0(), p - s.p0())) / s.length();\\n}\\n\\nbool PointOnSegment(const Point& p, const Segment& s) {\\n assert(s.valid());\\n return Zero(Distance(p, s));\\n}\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nnamespace geometryR2 {\\n\\nReal Distance(const Segment& s0, const Segment& s1) {\\n assert(s0.valid());\\n assert(s1.valid());\\n if (Intersect(s0, s1)) {\\n return static_cast<Real>(0);\\n }\\n else {\\n return std::min({ \\n Distance(s1.p0(), s0), \\n Distance(s1.p1(), s0),\\n Distance(s0.p0(), s1),\\n Distance(s0.p1(), s1) });\\n }\\n}\\n\\n} // namespace geometryR2\\n\\n} // namespace zawa\\n\\nusing namespace zawa::geometryR2;\\n\\nstruct Star {\\n Point vs[5];\\n Star() = default;\\n Star(const Point& center, Real arg, Real r) {\\n Point tmp[5];\\n Point dir{0, r};\\n for (int i{} ; i < 5 ; i++) {\\n tmp[i] = dir;\\n dir.rotateByArc(-(360 / 5));\\n }\\n for (auto& t : tmp) t.rotateByArc(arg);\\n for (auto& t : tmp) t += center;\\n vs[0] = tmp[0];\\n vs[1] = tmp[2];\\n vs[2] = tmp[4];\\n vs[3] = tmp[1];\\n vs[4] = tmp[3];\\n }\\n\\n Segment operator[](int i) const {\\n return Segment{vs[i], vs[i==4?0:i+1]};\\n }\\n};\\n\\nReal distance(const Star& s0, const Star& s1) {\\n Real res{1e18};\\n for (int i{} ; i < 5 ; i++) {\\n for (int j{} ; j < 5 ; j++) {\\n res = std::min(res, Distance(s0[i], s1[j]));\\n }\\n }\\n return res;\\n}\\n\\nbool solve() {\\n int n, m, l; std::cin >> n >> m >> l;\\n if (n == 0) return false;\\n m--; l--;\\n std::vector<Star> stars(n);\\n Star(Point{0, 0}, 0, 1);\\n for (int i{} ; i < n ; i++) {\\n Point p; std::cin >> p;\\n Real a, r; std::cin >> a >> r;\\n stars[i] = Star{p, a, r};\\n }\\n std::vector g(n, std::vector<Real>(n, 1e18));\\n for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) {\\n if (i == j) g[i][j] = 0;\\n else g[i][j] = distance(stars[i], stars[j]);\\n }\\n // for (int i{} ; i < n ; i++) {\\n // for (int j{} ; j < n ; j++) {\\n // std::cerr << g[i][j] << (j + 1 == n ? '\\\\n' : ' ');\\n // }\\n // }\\n for (int k{} ; k < n ; k++) for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) {\\n g[i][j] = std::min(g[i][j], g[i][k] + g[k][j]);\\n }\\n Real ans{g[m][l]};\\n std::cout << ans << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n std::cout << std::fixed << std::setprecision(10);\\n\\n for (int i{} ; solve() ; i++) {\\n // std::cerr << \\\"case \\\" << i + 1 << \\\" end-----------\\\\n\\\"; \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 4172,\n \"score_of_the_acc\": -0.1795,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2402_8451728\",\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\\nusing Real = double;\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-8, PI = acos(-1.0);\\n\\nPoint operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\nPoint operator/(const Point &p, const Real &d) { return Point(real(p) / d, imag(p) / d); }\\nint sign(const Real &r) {\\n if (r <= -EPS) return -1;\\n if (r >= EPS) return 1;\\n return 0;\\n}\\nbool equals(const Real &a, const Real &b) { return sign(a - b) == 0; }\\nbool operator<(const Point &a, const Point &b) { return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b); }\\nReal dot(const Point &a, const Point &b) { return real(conj(a) * b); }\\nReal cross(const Point &a, const Point &b) { return imag(conj(a) * b); }\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n};\\nPoint projection(const Line &l, const Point &p) { return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b); }\\nPoint reflection(const Line &l, const Point &p) { return p * (projection(l, p) - p) * 2.0; }\\nint ccw(const Point &a, Point b, Point c) {\\n b -= a, c -= a;\\n if (sign(cross(b, c)) == 1) return 1;\\n if (sign(cross(b, c)) == -1) return -1;\\n if (sign(dot(b, c)) == -1) return 2;\\n if (norm(b) < norm(c)) return -2;\\n return 0;\\n}\\nbool is_intersect_ss(const Line &s, const Line &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\nReal distance_sp(const Line &s, const Point &p) {\\n Point r = projection(s, p);\\n if (ccw(s.a, s.b, r) == 0) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\nReal distance_ss(const Line &a, const Line &b) {\\n if (is_intersect_ss(a, b)) return 0;\\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\\n}\\n\\ntemplate <class T>\\nstruct edge {\\n int from, to;\\n T cost;\\n edge(int to, T cost = {}) : from(-1), to(to), cost(cost) {}\\n};\\n\\nvoid solve(int N, int M, int L) {\\n M--, L--;\\n vector<vector<Line>> lines(N);\\n rep(i, N) {\\n int X, Y, A, R;\\n cin >> X >> Y >> A >> R;\\n\\n vector<Point> ps(5);\\n rep(j, 5) {\\n Real rad = ((A + 72 * j + 90) % 360) * PI / 180;\\n ps[j] = Point(X + R * cos(rad), Y + R * sin(rad));\\n }\\n rep(j, 5) lines[i].emplace_back(ps[j], ps[(j + 2) % 5]);\\n }\\n\\n vector<vector<edge<Real>>> G(N);\\n rep(i, N) rep(j, i) {\\n Real d = 1e18;\\n rep(k, 5) rep(l, 5) d = min(d, distance_ss(lines[i][k], lines[j][l]));\\n G[i].emplace_back(j, d);\\n G[j].emplace_back(i, d);\\n }\\n\\n using T = Real;\\n auto dijkstra = [](auto &G, int s, T mx) {\\n using P = pair<T, int>;\\n\\n int N = G.size();\\n vector<T> d(N, mx);\\n d[s] = 0;\\n\\n priority_queue<P, vector<P>, greater<P>> pq;\\n pq.push({0, s});\\n while (!pq.empty()) {\\n auto [dist, u] = pq.top();\\n pq.pop();\\n\\n if (d[u] < dist) continue;\\n for (auto &e : G[u]) {\\n int v = e.to;\\n T cost = e.cost;\\n if (d[v] > d[u] + cost) {\\n d[v] = d[u] + cost;\\n pq.push({d[v], v});\\n }\\n }\\n }\\n return d;\\n };\\n auto dist = dijkstra(G, M, 1e18);\\n printf(\\\"%.10f\\\\n\\\", dist[L]);\\n}\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n\\n int N, M, L;\\n while (cin >> N >> M >> L) {\\n if (N == 0 && M == 0 && L == 0) continue;\\n solve(N, M, L);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.1635,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2402_8391638\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 1e-10;\\ndouble dist(double x, double y){\\n return sqrt(x*x+y*y);\\n}\\ndouble d(double lx, double ly, double rx, double ry, double x, double y){\\n if(lx==rx){\\n swap(lx, ly);\\n swap(rx, ry);\\n swap(x, y);\\n }\\n lx -= EPS;\\n rx += EPS;\\n double a = (ly-ry)/(lx-rx);\\n double b = ly-a*lx;\\n if(lx > rx) swap(lx, rx);\\n while(fabs(lx-rx)>EPS){\\n double d1 = dist(lx-x, a*lx+b-y);\\n double d2 = dist(rx-x, a*rx+b-y);\\n if(d1 > d2) lx = (lx+rx)*0.5;\\n else rx = (lx+rx)*0.5;\\n }\\n return dist(lx-x, a*lx+b-y);\\n}\\nbool crs(double x0, double y0, double x1, double y1, double x2, double y2, double x3, double y3){\\n double c0 = (x2-x3)*(y0-y2)+(x2-x0)*(y2-y3);\\n double c1 = (x2-x3)*(y1-y2)+(x2-x1)*(y2-y3);\\n double c2 = (x0-x1)*(y2-y0)+(x0-x2)*(y0-y1);\\n double c3 = (x0-x1)*(y3-y0)+(x0-x3)*(y0-y1);\\n return c0*c1<0 && c2*c3<0;\\n}\\nint main(){\\n int n, s, t;\\n double x[102], y[102], a[102], r[102];\\n double edge[102][102];\\n while(cin >> n >> s >> t, n){\\n for(int i=1;i<=n;i++){\\n cin >> x[i] >> y[i] >> a[i] >> r[i];\\n edge[i][i] = 0;\\n }\\n for(int i=1;i<=n-1;i++){\\n for(int j=i+1;j<=n;j++){\\n edge[i][j] = 1000000;\\n for(int k=0;k<5;k++){\\n for(int l=0;l<5;l++){\\n double p1 = a[i]*M_PI/180 + M_PI*0.5 + M_PI*k*0.4;\\n double p2 = a[i]*M_PI/180 + M_PI*0.5 + M_PI*((k+2)%5)*0.4;\\n double q1 = a[j]*M_PI/180 + M_PI*0.5 + M_PI*l*0.4;\\n double q2 = a[j]*M_PI/180 + M_PI*0.5 + M_PI*((l+2)%5)*0.4;\\n double px1 = x[i] + r[i]*cos(p1);\\n double py1 = y[i] + r[i]*sin(p1);\\n double px2 = x[i] + r[i]*cos(p2);\\n double py2 = y[i] + r[i]*sin(p2);\\n double qx1 = x[j] + r[j]*cos(q1);\\n double qy1 = y[j] + r[j]*sin(q1);\\n double qx2 = x[j] + r[j]*cos(q2);\\n double qy2 = y[j] + r[j]*sin(q2);\\n if(crs(px1, py1, px2, py2, qx1, qy1, qx2, qy2)) edge[i][j] = 0;\\n else{\\n edge[i][j] = min(edge[i][j], d(px1, py1, px2, py2, qx1, qy1));\\n edge[i][j] = min(edge[i][j], d(px1, py1, px2, py2, qx2, qy2));\\n edge[i][j] = min(edge[i][j], d(qx1, qy1, qx2, qy2, px1, py1));\\n edge[i][j] = min(edge[i][j], d(qx1, qy1, qx2, qy2, px2, py2));\\n }\\n edge[j][i] = edge[i][j];\\n }\\n }\\n }\\n }\\n for(int i=1;i<=n;i++){\\n for(int j=1;j<=n;j++){\\n for(int k=1;k<=n;k++){\\n edge[j][k] = min(edge[j][k], edge[j][i]+edge[i][k]);\\n }\\n }\\n }\\n printf(\\\"%.10lf\\\\n\\\", edge[s][t]);\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2480,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2402_8293821\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nclass point2d {\\npublic:\\n\\tdouble x, y;\\n\\tpoint2d() : x(0.0), y(0.0) {}\\n\\tpoint2d(double x_, double y_) : x(x_), y(y_) {}\\n\\tpoint2d& operator+=(const point2d& p) { x += p.x; y += p.y; return *this; }\\n\\tpoint2d& operator-=(const point2d& p) { x -= p.x; y -= p.y; return *this; }\\n\\tpoint2d& operator*=(double v) { x *= v; y *= v; return *this; }\\n\\tpoint2d& operator/=(double v) { x /= v; y /= v; return *this; }\\n\\tpoint2d operator+(const point2d& p) const { return point2d(*this) += p; }\\n\\tpoint2d operator-(const point2d& p) const { return point2d(*this) -= p; }\\n\\tpoint2d operator*(double v) { return point2d(*this) *= v; }\\n\\tpoint2d operator/(double v) { return point2d(*this) /= v; }\\n\\tdouble abs() const {\\n\\t\\treturn sqrt(x * x + y * y);\\n\\t}\\n\\tdouble dot(const point2d& p) const {\\n\\t\\treturn x * p.x + y * p.y;\\n\\t}\\n\\tdouble cross(const point2d& p) const {\\n\\t\\treturn x * p.y - y * p.x;\\n\\t}\\n};\\n\\nconst double pi = acos(-1.0);\\n\\ndouble segment_point(const point2d& p1, const point2d& p2, const point2d& p3) {\\n\\tif ((p2 - p1).dot(p3 - p1) < 0.0) {\\n\\t\\treturn (p3 - p1).abs();\\n\\t}\\n\\tif ((p1 - p2).dot(p3 - p2) < 0.0) {\\n\\t\\treturn (p3 - p2).abs();\\n\\t}\\n\\treturn abs((p2 - p1).cross(p3 - p1)) / (p2 - p1).abs();\\n}\\n\\nbool check_cross(const point2d& p1, const point2d& p2, const point2d& p3, const point2d& p4) {\\n\\tauto ccw = [](const point2d& v1, const point2d& v2) -> int {\\n\\t\\tdouble cross = v1.cross(v2);\\n\\t\\tif (cross < 0.0) return +1;\\n\\t\\tif (cross > 0.0) return -1;\\n\\t\\tif (v1.dot(v2) < 0.0) return +2;\\n\\t\\tif (v1.abs() < v2.abs()) return -2;\\n\\t\\treturn 0;\\n\\t};\\n\\treturn ccw(p2 - p1, p3 - p1) * ccw(p2 - p1, p4 - p1) <= 0 && ccw(p4 - p3, p1 - p3) * ccw(p4 - p3, p2 - p3) <= 0;\\n}\\n\\ndouble segment_segment(const point2d& p1, const point2d& p2, const point2d& p3, const point2d& p4) {\\n\\tif (check_cross(p1, p2, p3, p4)) {\\n\\t\\treturn 0.0;\\n\\t}\\n\\tdouble d1 = segment_point(p1, p2, p3);\\n\\tdouble d2 = segment_point(p1, p2, p4);\\n\\tdouble d3 = segment_point(p3, p4, p1);\\n\\tdouble d4 = segment_point(p3, p4, p2);\\n\\treturn min({ d1, d2, d3, d4 });\\n}\\n\\nint main() {\\n\\tcout.precision(15);\\n\\tint N, S, T;\\n\\twhile (true) {\\n\\t\\tcin >> N >> S >> T;\\n\\t\\tif (N == 0 && S == 0 && T == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tS -= 1;\\n\\t\\tT -= 1;\\n\\t\\tvector<int> X(N), Y(N), A(N), R(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tcin >> X[i] >> Y[i] >> A[i] >> R[i];\\n\\t\\t}\\n\\t\\tvector<point2d> P(5 * N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < 5; j++) {\\n\\t\\t\\t\\tdouble arg = (A[i] + 144 * j + 90) * (pi / 180.0);\\n\\t\\t\\t\\tP[5 * i + j] = point2d(X[i], Y[i]) + point2d(cos(arg), sin(arg)) * R[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tauto next = [&](int id) {\\n\\t\\t\\treturn (id % 5 != 4 ? id + 1 : id - 4);\\n\\t\\t};\\n\\t\\tvector<vector<double> > d(N, vector<double>(N));\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (i == j) {\\n\\t\\t\\t\\t\\td[i][j] = 0.0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (i > j) {\\n\\t\\t\\t\\t\\td[i][j] = d[j][i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (i < j) {\\n\\t\\t\\t\\t\\td[i][j] = 1.0e+99;\\n\\t\\t\\t\\t\\tfor (int k = 0; k < 5; k++) {\\n\\t\\t\\t\\t\\t\\tfor (int l = 0; l < 5; l++) {\\n\\t\\t\\t\\t\\t\\t\\td[i][j] = min(d[i][j], segment_segment(P[5 * i + k], P[next(5 * i + k)], P[5 * j + l], P[next(5 * j + l)]));\\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\\tvector<double> dist(N, 1.0e+99);\\n\\t\\tdist[S] = 0.0;\\n\\t\\tvector<bool> vis(N, false);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tint id = -1;\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tif (!vis[j] && (id == -1 || dist[id] > dist[j])) {\\n\\t\\t\\t\\t\\tid = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvis[id] = true;\\n\\t\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\t\\tdist[j] = min(dist[j], dist[id] + d[id][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << fixed << dist[T] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3732,\n \"score_of_the_acc\": -0.0105,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2402_6760607\",\n \"code_snippet\": \"/*\\n\\nThanks for ei1333\\n\\n*/\\n\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <deque>\\n#include <queue>\\n#include <string>\\n#include <iomanip>\\n#include <set>\\n#include <unordered_set>\\n#include <map>\\n#include <unordered_map>\\n#include <utility>\\n#include <stack>\\n#include <random>\\n#include <complex>\\n#include <functional>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <time.h>\\n#include <math.h>\\n#include <assert.h>\\n// #if __has_include(<atcoder/all>)\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n// #endif\\nusing namespace std;\\nusing ll=long long;\\n#define read(x) cin>>(x);\\n#define readll(x) ll (x);cin>>(x);\\n#define readS(x) string (x);cin>>(x);\\n#define readvll(x,N) vector<ll> (x)((N));for(int i=0;i<(N);i++){cin>>(x)[i];}\\n#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)\\n#define rep2d(i,j,H,W) for(ll (i)=0;(i)<(H);(i)++)for(ll (j)=0;(j)<(W);j++)\\n#define is_in(x,y) (0<=(x) && (x)<H && 0<=(y) && (y)<W)\\n#define yn {cout<<\\\"Yes\\\"<<endl;}else{cout<<\\\"No\\\"<<endl;}\\n#define double_out(x) fixed << setprecision(x)\\ninline ll powll(ll x,ll n){ll r=1;while(n>0){if(n&1){r*=x;};x*=x;n>>=1;};return r;}\\n\\nusing Real = double;\\nusing Point = complex< Real >;\\nconst Real EPS = 1e-8, PI = acos(-1);\\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\\nistream &operator>>(istream &is, Point &p) {\\n Real a, b;\\n is >> a >> b;\\n p = Point(a, b);\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, Point &p) {\\n return os << fixed << setprecision(10) << p.real() << \\\" \\\" << p.imag();\\n}\\n\\n// 点 p を反時計回りに theta 回転\\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\\nReal radian_to_degree(Real r) {\\n return (r * 180.0 / PI);\\n}\\n\\nReal degree_to_radian(Real d) {\\n return (d * PI / 180.0);\\n}\\n\\n// a-b-c の角度のうち小さい方を返す\\nReal get_angle(const Point &a, const Point &b, const Point &c) {\\n const Point v(b - a), w(c - b);\\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\\nnamespace std {\\n bool operator<(const Point &a, const Point &b) {\\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\n\\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// 線分\\nstruct Segment : Line {\\n Segment() = default;\\n\\n Segment(Point a, Point b) : Line(a, b) {}\\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 friend ostream &operator<<(ostream &os,Circle &a){\\n return os << \\\"( \\\" << a.p.real() << \\\" , \\\" << a.p.imag() << \\\" ) r: \\\"<< a.r ;\\n }\\n\\n friend istream &operator>>(istream &is,Circle &a){\\n return is >> a.p >> a.r;\\n }\\n};\\n\\nusing Points = vector< Point >;\\nusing Polygon = vector< Point >;\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\n// 点の回転方向\\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\\\" // p0,p1,p2が反時計回りになる場合\\n if(cross(b, c) < -EPS) return -1; // \\\"CLOCKWISE\\\" // p0,p1,p2が時計回りになる場合\\n if(dot(b, c) < 0) return +2; // \\\"ONLINE_BACK\\\" // p2,p0,p1がこの順で同一直線上にある場合\\n if(norm(b) < norm(c)) return -2; // \\\"ONLINE_FRONT\\\" // p0,p1,p2がこの順で同一直線上にある場合\\n return 0; // \\\"ON_SEGMENT\\\" // p2が線分p0,p1上にある場合\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 平行判定\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\n// 垂直判定\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\n// 射影\\n// 直線 l に p から垂線を引いた交点を求める\\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\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\n// 反射\\n// 直線 l を対称軸として点 p と線対称にある点を求める\\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\\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\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\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\\nReal distance(const Line &l, const Point &p);\\n\\nbool intersect(const Circle &c, const Line &l) {\\n return distance(l, c.p) <= c.r + EPS;\\n}\\n\\nbool intersect(const Circle &c, const Point &p) {\\n return abs(abs(p - c.p) - c.r) < EPS;\\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\\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// 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;// 離れている (共通接線 4)\\n if(eq(c1.r + c2.r, d)) return 3;// 外接する (共通接線 3)\\n if(c1.r - c2.r < d) return 2;// 交わる (共通接線 2)\\n if(eq(c1.r - c2.r, d)) return 1;// 内接する (共通接線 1)\\n return 0;// 内包する (共通接線 0)\\n}\\n\\nReal distance(const Point &a, const Point &b) {\\n return abs(a - b);\\n}\\n\\nReal distance(const Line &l, const Point &p) {\\n return abs(p - projection(l, p));\\n}\\n\\nReal distance(const Line &l, const Line &m) {\\n return intersect(l, m) ? 0 : distance(l, m.a);\\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// 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\\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// 交点\\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// 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// 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\\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// 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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// 点 p を通る円 c の接線\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_G\\n// 円 c1, c2 の共通接線\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\\n// 凸性判定\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\\n// 凸包\\n// 頂点が全て整数のときはEPS=0にしないとバグる\\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]) < EPS) --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]) < EPS) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\\n// 多角形と点の包含判定\\nenum {\\n OUT, ON, IN\\n};\\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\\nint contains(const Circle &Q, const Point &p){\\n Real left=(p.real()-Q.p.real())*(p.real()-Q.p.real())+(p.imag()-Q.p.imag())*(p.imag()-Q.p.imag());\\n Real right=Q.r*Q.r;\\n if(fabs(left-right)<EPS){\\n return ON;\\n }else if(left<right){\\n return IN;\\n }else{\\n return OUT;\\n }\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分の重複除去\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1033\\n// 線分アレンジメント\\n// 任意の2線分の交点を頂点としたグラフを構築する\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_C\\n// 凸多角形の切断\\n// 直線 l.a-l.b で切断しその左側にできる凸多角形を返す\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\\n// 多角形の面積\\nReal area(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 * 0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_H\\n// 円と多角形の共通部分の面積\\nReal area(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*0.5;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_B\\n// 凸多角形の直径(最遠頂点対間距離)\\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// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_5_A\\n// 最近点対\\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\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\nconst vector<pair<ll,ll>> star_lines={{0,2},{0,3},{1,3},{1,4},{2,4}};\\n\\n#include <vector>\\n#include <utility>\\n#include <queue>\\n#include <algorithm>\\nstruct Dijkstra{\\n private:\\n double INF=10000000000000LL;\\n std::vector<std::vector<std::pair<long long,double>>> G;\\n int V;\\n inline void _add(long long s,long long t,double c){\\n G[s].emplace_back(std::make_pair(t,c));\\n }\\n public:\\n Dijkstra(int N):V(N) {\\n G.resize(V);\\n }\\n void add1(long long s,long long t,double c){\\n _add(s,t,c);\\n }\\n void add2(long long s,long long t,double c){\\n _add(s,t,c);\\n _add(t,s,c);\\n }\\n std::vector<double> run(long long s){\\n std::vector<double> res(V,INF);\\n std::priority_queue<std::pair<double,long long>,std::vector<std::pair<double,long long>>,std::greater<std::pair<double,long long>>> que;\\n res[s]=0;\\n que.push(std::make_pair(0,s));\\n while(!que.empty()){\\n std::pair<double,long long> p=que.top();\\n que.pop();\\n long long v=p.second;\\n if(res[v]<p.first){\\n continue;\\n }\\n for(const std::pair<long long,double>& e:G[v]){\\n if(res[e.first]>res[v]+e.second){\\n res[e.first]=res[v]+e.second;\\n que.push(std::make_pair(res[e.first],e.first));\\n }\\n }\\n }\\n return res;\\n }\\n};\\n\\nstruct Star{\\n Polygon pol;\\n ll cx,cy;\\n Segments segm;\\n Star(){\\n pol.resize(5);\\n segm.resize(5);\\n }\\n Star(ll x,ll y,ll a,ll r){\\n pol.resize(5);\\n cx=x;\\n cy=y;\\n vector<Point> tmp(5);\\n tmp[0]=Point(0,r);\\n tmp[0]=rotate(degree_to_radian(a),tmp[0]);\\n for(int i=0;i<4;i++){\\n tmp[i+1]=rotate(degree_to_radian(72),tmp[i]);\\n }\\n for(int i=0;i<5;i++){\\n pol[i]=Point(tmp[i].real()+cx,tmp[i].imag()+cy);\\n }\\n segm.resize(5);\\n for(ll i=0;i<5;i++){\\n segm[i]=Segment(pol[star_lines[i].first],pol[star_lines[i].second]);\\n }\\n }\\n};\\n\\nstruct Union{\\n vector<Point> ps;\\n Segments segms;\\n};\\n\\nvoid solve(ll N,ll M,ll L){\\n vector<Star> S(N);\\n for(ll i=0;i<N;i++){\\n ll x,y,a,r;\\n cin>>x>>y>>a>>r;\\n S[i]=Star(x,y,a,r);\\n }\\n atcoder::dsu uf(N);\\n for(ll i=0;i<N;i++){\\n for(ll j=i+1;j<N;j++){\\n ll f=0;\\n for(ll x=0;x<5;x++){\\n for(ll y=0;y<5;y++){\\n if(intersect(S[i].segm[x],S[j].segm[y])){\\n f=1;\\n break;\\n }\\n }\\n if(f){\\n break;\\n }\\n }\\n if(f){\\n uf.merge(i,j);\\n }\\n }\\n }\\n vector<vector<int>> grps=uf.groups();\\n vector<Union> uni(grps.size());\\n ll start,end;\\n for(unsigned i=0;i<grps.size();i++){\\n for(int j:grps[i]){\\n if(j==M-1){\\n start=i;\\n }\\n if(j==L-1){\\n end=i;\\n }\\n for(ll k=0;k<5;k++){\\n uni[i].ps.push_back(S[j].pol[k]);\\n uni[i].segms.push_back(S[j].segm[k]);\\n }\\n }\\n }\\n ll B=uni.size();\\n //cerr<<\\\"uni_size: \\\"<<B<<endl;\\n //cerr<<start<<\\\" \\\"<<end<<endl;\\n Dijkstra ijk(B);\\n for(ll i=0;i<B;i++){\\n for(ll j=0;j<B;j++){\\n if(i==j){\\n continue;\\n }\\n for(Point x:uni[i].ps){\\n for(Segment y:uni[j].segms){\\n ijk.add2(i,j,distance(y,x));\\n //cerr<<i<<\\\" \\\"<<j<<\\\" \\\"<<double_out(10)<<distance(y,x)<<endl;\\n }\\n }\\n }\\n }\\n cout<<double_out(10)<<ijk.run(start)[end]<<endl;\\n}\\n\\n\\nint main(){\\n ll N,M,L;\\n while(1){\\n cin>>N>>M>>L;\\n if(N==0){\\n break;\\n }\\n solve(N,M,L);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 14400,\n \"score_of_the_acc\": -0.5043,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2402_6243498\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// はじめに\\nusing Double = double;\\nconst Double EPS = 1e-8;\\nconst Double PI = acos(-1);\\ninline int sign(const Double &x) { return x <= -EPS ? -1 : (x >= EPS ? 1 : 0); }\\ninline bool equals(const Double &a, const Double &b) { return sign(a - b) == 0; }\\nDouble radian_to_degree(Double r) { return r * 180.0 / PI; }\\nDouble degree_to_radian(Double d) { return d * PI / 180.0; }\\n\\n// 点\\nusing Point = complex<Double>;\\n// Point operator*(const Point &p, const Double &d) { return Point(p.real() * d, p.imag() * d); } // 定数を掛ける\\n// Point operator/(const Point &p, const Double &d) { return Point(p.real() / d, p.imag() / d); } // 定数で割る\\nistream &operator>>(istream &is, Point &p) {\\n Double x, y;\\n is >> x >> y;\\n p = Point(x, y);\\n return is;\\n}\\nDouble dot(const Point &a, const Point &b) { return a.real() * b.real() + a.imag() * b.imag(); } // 内積\\nDouble cross(const Point &a, const Point &b) { return a.real() * b.imag() - a.imag() * b.real(); } // 外積\\n// thetaだけ反時計回りに回転させる(thetaは弧度法なので、例えば90度回転させたいときにはtheta=PI/2とする)\\nPoint rotate(const Point &p, const Double &theta) { return p * Point(cos(theta), sin(theta)); }\\n\\n// 直線\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n friend ostream &operator<<(ostream &os, const Line &p) { return os << p.a << \\\"->\\\" << p.b; }\\n friend istream &operator>>(istream &is, Line &p) { return is >> p.a >> p.b; }\\n};\\n\\n// 線分\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\n\\n// 円\\nstruct Circle {\\n Point o;\\n Double r;\\n Circle() = default;\\n Circle(Point o, Double r) : o(o), r(r) {}\\n friend ostream &operator<<(ostream &os, const Circle &c) { return os << c.o << \\\" \\\" << c.r; }\\n friend istream &operator>>(istream &is, Circle &c) { return is >> c.o >> c.r; } // (x,y),rの順\\n};\\n\\n// 射影(projection):CGL_1_A\\n// 直線lに点pから引いた垂線の足を求める\\nPoint projection(const Line &l, const Point &p) {\\n Double t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\\n return l.a + t * (l.b - l.a);\\n}\\n\\n// 反射(reflection):CGL_1_B\\n// 直線lについて点pと線対称の点を求める\\nPoint reflection(const Line &l, const Point &p) { return p + (projection(l, p) - p) * (Double)2.0; }\\n\\n// 反時計回り(ccw):CGL_1_C\\n// 点a,b,cの位置関係を調べる(aを基準とする)\\nconstexpr int COUNTER_CLOCKWISE = 1; // a-b-cが反時計回り\\nconstexpr int CLOCKWISE = -1; // a-b-cが時計回り\\nconstexpr int ONLINE_BACK = 2; // c-a-b(一直線上)\\nconstexpr int ONLINE_FRONT = -2; // a-b-c(一直線上)\\nconstexpr int ON_SEGMENT = 0; // a-c-b(一直線上)\\nint ccw(const Point &a, Point b, Point c) {\\n b = b - a, c = c - a;\\n if (sign(cross(b, c)) == 1) return COUNTER_CLOCKWISE;\\n if (sign(cross(b, c)) == -1) return CLOCKWISE;\\n if (sign(dot(b, c)) == -1) return ONLINE_BACK;\\n if (norm(b) < norm(c)) return ONLINE_FRONT;\\n return ON_SEGMENT;\\n}\\n\\n// 平行・垂直(parallel/orthogonal):CGL_2_A\\n// 2直線l1,l2が平行・垂直か判定する(それぞれ外積・内積が0)\\nbool is_parallel(const Line &l1, const Line &l2) { return sign(cross(l1.b - l1.a, l2.b - l2.a)) == 0; }\\nbool is_orthogonal(const Line &l1, const Line &l2) { return sign(dot(l1.b - l1.a, l2.b - l2.a)) == 0; }\\n\\n// 交差判定(intersection):CGL_2_B\\n// 2線分s1,s2が交差するか判定する\\nbool intersection_ss(const Segment &s1, const Segment &s2) { return (ccw(s1.a, s1.b, s2.a) * ccw(s1.a, s1.b, s2.b) <= 0 && ccw(s2.a, s2.b, s1.a) * ccw(s2.a, s2.b, s1.b) <= 0); }\\n// 線分sと点pの場合(一応distance_spの実装でverify)\\nbool intersection_sp(const Segment &s, const Point &p) { return ccw(s.a, s.b, p) == ON_SEGMENT; }\\n// 直線lと点pの場合(absが1でない<=>ccwがONLINE_BACKかONLINE_FRONTかON_SEGMENT)(未verify)\\nbool intersection_lp(const Line &l, const Point &p) {\\n int res = ccw(l.a, l.b, p);\\n return (res == ONLINE_BACK || res == ONLINE_FRONT || res == ON_SEGMENT);\\n}\\n// 直線l1,l2の場合(未verify)\\nbool intersection_ll(const Line &l1, const Line &l2) {\\n // cross_point_llの説明を参考に\\n Point base = l1.b - l1.a;\\n Double d12 = cross(base, l2.b - l2.a);\\n Double d1 = cross(base, l1.b - l2.a);\\n if (sign(d12) == 0 && sign(d1) == 0) return true; // 一致\\n // 平行か1点で交わるか\\n return !is_parallel(l1, l2);\\n}\\n\\n// 線分の交点(cross point):CGL_2_C\\n// 2直線l1,l2の交点を求める(未verify)\\nPoint cross_point_ll(const Line &l1, const Line &l2) {\\n // 2直線の関係:1点で交わるor平行or一致\\n Point base = l1.b - l1.a;\\n Double d12 = cross(base, l2.b - l2.a);\\n Double d1 = cross(base, l1.b - l2.a);\\n // 一致(sign(d12) == 0 は is_parallelと本質的に同じ, sign(d1) == 0は重なっているか)\\n if (sign(d12) == 0 && sign(d1) == 0) return l2.a; // 2直線が一致するので適当に点を返す\\n assert(is_parallel(l1, l2) == false); // assert(sign(d12) != 0);と同じ\\n return l2.a + (l2.b - l2.a) * (d1 / d12);\\n}\\n// 2線分s1,s2の交点を求める\\nPoint cross_point_ss(const Segment &s1, const Segment &s2) {\\n assert(intersection_ss(s1, s2)); // 交点を持つかまず判定する\\n // 1点で交わるor無数の点で交わる\\n Point base = s1.b - s1.a;\\n Double d12 = cross(base, s2.b - s2.a);\\n Double d1 = cross(base, s1.b - s2.a);\\n if (sign(d12) == 0 && sign(d1) == 0) {\\n // 無数の点で交わる(未verify)\\n if (intersection_sp(s1, s2.a)) return s2.a;\\n if (intersection_sp(s1, s2.b)) return s2.b;\\n if (intersection_sp(s2, s1.a)) return s1.a;\\n assert(intersection_sp(s2, s1.b));\\n return s1.b;\\n }\\n return s2.a + (s2.b - s2.a) * (d1 / d12);\\n}\\n\\n// 距離(distance):CGL_2_D\\n// 2点a,bの距離を求める(未verify)\\nDouble distance_pp(const Point &a, const Point &b) { return abs(a - b); }\\n// 直線lと点pの距離を求める(未verify)\\nDouble distance_lp(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n// 線分sと点pの距離を求める\\nDouble distance_sp(const Segment &s, const Point &p) {\\n Point r = projection(s, p);\\n if (intersection_sp(s, r)) return abs(r - p);\\n return min(abs(s.a - p), abs(s.b - p));\\n}\\n// 線分s1,s2の距離を求める\\nDouble distance_ss(const Segment &s1, const Segment &s2) {\\n if (intersection_ss(s1, s2)) return 0.0;\\n return min({distance_sp(s1, s2.a), distance_sp(s1, s2.b), distance_sp(s2, s1.a), distance_sp(s2, s1.b)});\\n}\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(x) x.begin(), x.end()\\n\\nstruct star5 {\\n vector<Segment> Segs;\\n Double x, y, deg, r;\\n star5() {}\\n star5(Double x, Double y, Double deg, Double r) : x(x), y(y), deg(deg), r(r) {\\n Point a1 = polar(r, PI / 2 + degree_to_radian(deg));\\n Point p = Point(x, y);\\n for (int i = 0; i < 5; i++) {\\n Point a2 = rotate(a1, degree_to_radian(144));\\n Segs.push_back(Segment(a1 + p, a2 + p));\\n a1 = a2;\\n }\\n }\\n};\\n\\nDouble distance_star5(const star5 &s1, const star5 &s2) {\\n Double ret = numeric_limits<Double>::infinity();\\n for (int i = 0; i < 5; i++) {\\n for (int j = 0; j < 5; j++) {\\n ret = min(ret, distance_ss(s1.Segs[i], s2.Segs[j]));\\n }\\n }\\n return ret;\\n}\\n\\nconst Double INF = numeric_limits<Double>::infinity();\\n\\nvoid solve(int N, int M, int L) {\\n M--, L--;\\n vector<star5> S(N);\\n rep(i, N) {\\n Double x, y, a, r;\\n cin >> x >> y >> a >> r;\\n S[i] = star5(x, y, a, r);\\n }\\n vector<vector<Double>> dist(N, vector<Double>(N, INF));\\n rep(i, N) rep(j, N) dist[i][j] = distance_star5(S[i], S[j]);\\n rep(k, N) rep(i, N) rep(j, N) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n cout << fixed << setprecision(15) << dist[M][L] << '\\\\n';\\n return;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N, M, L;\\n while (cin >> N >> M >> L, N) solve(N, M, L);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 4060,\n \"score_of_the_acc\": -0.3014,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2402_6192052\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nstruct Point{\\n double x;\\n double y;\\n \\n void rot(double theta){\\n theta = theta / 180 * M_PI;\\n double nx = x * cos(theta) - y * sin(theta);\\n double ny = y * cos(theta) + x * sin(theta);\\n x = nx;\\n y = ny;\\n }\\n};\\n\\nint n, m, l;\\n\\ndouble cross3(Point &p, Point &a, Point &b){\\n return (a.x - p.x) * (b.y - p.y) - (a.y - p.y) * (b.x - p.x);\\n}\\n\\nbool iscross(Point &a1, Point &a2, Point &b1, Point &b2){\\n bool flg1 = cross3(a1, a2, b1) * cross3(a1, a2, b2) < 0;\\n bool flg2 = cross3(b1, b2, a1) * cross3(b1, b2, a2) < 0;\\n return flg1 & flg2;\\n}\\n\\ndouble dot_dist(Point &a, Point &b){\\n double dx = b.x - a.x;\\n double dy = b.y - a.y;\\n return sqrt(dx * dx + dy * dy);\\n}\\n\\ndouble dot_line_dist(Point &p, Point &a, Point &b){\\n Point d0 = {b.x - a.x, b.y - a.y};\\n Point d1 = {p.x - a.x, p.y - a.y};\\n double dot = d0.x * d1.x + d0.y * d1.y;\\n double dd = d0.x * d0.x + d0.y * d0.y;\\n if(0 <= dot && dot <= dd){\\n double cross = d0.x * d1.y - d0.y * d1.x;\\n return abs(cross) / sqrt(dd);\\n }\\n else return min(dot_dist(p, a), dot_dist(p, b));\\n}\\n\\ndouble line_dist(Point &a1, Point &a2, Point &b1, Point &b2){\\n if(iscross(a1, a2, b1, b2)) return 0;\\n double ret = dot_line_dist(a1, b1, b2);\\n ret = min(ret, dot_line_dist(a2, b1, b2));\\n ret = min(ret, dot_line_dist(b1, a1, a2));\\n ret = min(ret, dot_line_dist(b2, a1, a2));\\n return ret;\\n}\\n\\nvoid solve(){\\n vector<vector<Point>> star(n, vector<Point>(5));\\n double x, y, a, r;\\n for(int i = 0; i < n; i++){\\n cin >> x >> y >> a >> r;\\n Point v = {0, r};\\n v.rot(a);\\n for(int j = 0; j < 5; j++){\\n star[i][j] = {v.x + x, v.y + y};\\n v.rot(144);\\n }\\n }\\n vector<vector<double>> dist(n, vector<double>(n, 0));\\n for(int i = 0; i < n; i++) for(int j = 0; j < n; j++){\\n if(i == j) continue;\\n double min_ = 1 << 30;\\n for(int k = 0; k < 5; k++) for(int o = 0; o < 5; o++){\\n double tmp = line_dist(star[i][k], star[i][(k + 1) % 5], star[j][o], star[j][(o + 1) % 5]);\\n min_ = min(min_, tmp);\\n }\\n dist[i][j] = min_;\\n dist[j][i] = min_;\\n }\\n for(int k = 0; k < n; k++) for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n cout << dist[m][l] << \\\"\\\\n\\\";\\n}\\n\\nint main(void){\\n cout << fixed << setprecision(20);\\n while(1){\\n cin >> n >> m >> l;\\n if(n == 0) break;\\n m--; l--;\\n solve();\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.0333,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2402_6029780\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include <algorithm>\\n#include <cassert>\\n#include <cfloat>\\n#include <cmath>\\n#include <cstdint>\\n#include <cstdio>\\n#include <deque>\\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 = int64_t;\\nusing uint = uint32_t;\\nusing ulint = uint64_t;\\n\\ntemplate <class T>\\nusing vector2d = vector<vector<T>>;\\n\\ntemplate <class T>\\nbool UpdateMax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool UpdateMin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nvoid OutVec(const vector<T> &vec) {\\n for (int i = 0; i < vec.size() - 1; ++i) {\\n cout << vec[i] << \\\" \\\";\\n }\\n cout << vec.back() << endl;\\n}\\n\\ntemplate <class T>\\nvoid OutVec2d(const vector2d<T> &vec) {\\n for (auto v : vec) {\\n OutVec(v);\\n }\\n}\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\\\"\\n\\n#line 4 \\\"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\\\"\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/circle.cpp\\\"\\n\\n#include <stdexcept>\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/base.cpp\\\"\\n\\nnamespace geometry {\\n\\nconst double EPS = 1e-8;\\n/**\\n * @brief double比較用関数\\n *\\n * @param a\\n * @param b\\n * @return int a>bなら1, a<bなら-1, a=bなら0\\n */\\nint doubleComp(double a, double b) {\\n if (a > b + EPS)\\n return 1;\\n else if (b > a + EPS) {\\n return -1;\\n }\\n return 0;\\n}\\n\\nbool equals(double a, double b) {\\n return doubleComp(a, b)==0;\\n}\\n} // namespace geometry\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/distance.cpp\\\"\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/line.cpp\\\"\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/vector.cpp\\\"\\n\\n#include <complex>\\n#include <limits>\\n\\n#line 7 \\\"/home/arc/project/comppro/cplib/geometry/vector.cpp\\\"\\n\\nnamespace geometry {\\nusing Vector2 = std::complex<double>;\\n\\n/**\\n * @brief aとbの内積 |a||b|cosΘ を求める \\n *\\n * @param a\\n * @param b\\n * @return double\\n */\\ndouble dot(const Vector2 &a, const Vector2 &b) {\\n return a.real() * b.real() + a.imag() * b.imag();\\n}\\n\\n/**\\n * @brief aとbの外積 |a||b|sinΘ を求める\\n *\\n * @param a\\n * @param b\\n * @return double\\n */\\ndouble cross(const Vector2 &a, const Vector2 &b) {\\n return a.real() * b.imag() - a.imag() * b.real();\\n}\\n\\n/**\\n * @brief pを反時計回りにrad回転したベクトルを求める\\n *\\n * @param p 元のベクトル\\n * @param rad 回転角(単位ラジアン)\\n * @return Vector2 回転後のベクトル\\n */\\nVector2 rotate(const Vector2 &p, const double rad) {\\n double c = cos(rad), s = sin(rad);\\n return Vector2(c * p.real() - s * p.imag(), s * p.real() + c * p.imag());\\n}\\n\\n/**\\n * @brief aを基準点としたb, cの位置関係を調べる\\n *\\n * @param a\\n * @param b\\n * @param c\\n * @return int\\n * cがbの反時計回りの位置: 1\\n * 時計回りの位置: -1\\n * c,a,bがこの順番で同一直線上: 2\\n * a,b,cがこの順番で同一直線上: -2\\n * cが線分ab上: 0\\n */\\nint ccw(const Vector2 &a, Vector2 b, Vector2 c) {\\n b -= a;\\n c -= a;\\n if (doubleComp(cross(b, c), 0) == 1) {\\n return 1;\\n }\\n if (doubleComp(cross(b, c), 0) == -1) {\\n return -1;\\n }\\n if (doubleComp(dot(b, c), 0) == -1) {\\n return 2;\\n }\\n if (norm(b) < norm(c)) {\\n return -2;\\n }\\n return 0;\\n}\\n\\nbool isNaN(const Vector2 &a) {\\n return std::isnan(a.imag()) || std::isnan(a.real());\\n}\\n\\nVector2 unitVector(const Vector2 &a) {\\n return a / std::abs(a);\\n}\\n\\nVector2 normalVector(const Vector2 &a) {\\n return a * Vector2(0, 1);\\n}\\n\\nstatic double nan = std::numeric_limits<double>::quiet_NaN();\\nconst Vector2 NaN = Vector2(nan, nan);\\n} // namespace geometry\\n#line 5 \\\"/home/arc/project/comppro/cplib/geometry/line.cpp\\\"\\n\\nnamespace geometry {\\nstruct Line {\\n Vector2 a, b;\\n Line() = default;\\n Line(Vector2 _a, Vector2 _b) : a(_a), b(_b) {\\n }\\n\\n /**\\n * @brief ax+by=cの直線を作成\\n *\\n * @param a\\n * @param b\\n * @param c\\n */\\n Line(double _a, double _b, double _c) {\\n if (equals(_a, 0)) {\\n a = Vector2(0, _c / _b);\\n b = Vector2(1, _c / _b);\\n } else if (equals(_b, 0)) {\\n a = Vector2(_c / _a, 0);\\n b = Vector2(_c / _a, 1);\\n } else {\\n a = Vector2(0, _c / _b);\\n b = Vector2(_c / _a, 0);\\n }\\n }\\n\\n Vector2 vector() const {\\n return b - a;\\n }\\n};\\n\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Vector2 a, Vector2 b) : Line(a, b) {\\n }\\n};\\n\\n/**\\n * @brief 2直線が平行であるかを返します\\n *\\n * @param s\\n * @param t\\n * @return true\\n * @return false\\n */\\nbool isParallel(const Line &s, const Line &t) {\\n return equals(0, cross(s.vector(), t.vector()));\\n}\\n\\n/**\\n * @brief 2直線が垂直であるかを返します\\n *\\n * @param s\\n * @param t\\n * @return true\\n * @return false\\n */\\nbool isOrthogonal(const Line &s, const Line &t) {\\n return equals(0, dot(s.vector(), t.vector()));\\n}\\n\\n/**\\n * @brief 2線分が交差しているかを返します\\n *\\n * @param s\\n * @param t\\n * @return true\\n * @return false\\n */\\nbool hasIntersect(const Segment &s, const Segment &t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n} // namespace geometry\\n#line 6 \\\"/home/arc/project/comppro/cplib/geometry/distance.cpp\\\"\\n\\nnamespace geometry {\\ndouble distance(const Vector2 &a, const Vector2 &b) {\\n double x = a.real() - b.real();\\n double y = a.imag() - b.imag();\\n return sqrt(x * x + y * y);\\n}\\n\\n/**\\n * @brief 点と直線の距離を求めます\\n *\\n * @param p 点\\n * @param l 直線\\n * @return double 点と直線の距離\\n */\\ndouble distance(const Vector2 &p, const Line &l) {\\n return std::abs(cross(l.vector(), p - l.a) / abs(l.vector()));\\n}\\n\\n/**\\n * @brief 点と線分の距離を求めます\\n * \\n * @param p 点\\n * @param l 線分\\n * @return double 点と線分の距離 \\n */\\ndouble distance(const Vector2 &p, const Segment &l) {\\n if (dot(l.b - l.a, p - l.a) < EPS) {\\n return abs(p-l.a);\\n }\\n if (dot(l.a - l.b, p - l.b) < EPS) {\\n return abs(p-l.b);\\n }\\n return std::abs(cross(l.vector(), p - l.a) / abs(l.vector()));\\n}\\n\\n/**\\n * @brief 線分間の最短距離を求めます\\n * \\n * @param s \\n * @param t \\n * @return double \\n */\\ndouble distance(const Segment &s, const Segment &t) {\\n if (hasIntersect(s, t)) {\\n return (double)0;\\n }\\n double ans = distance(t.a, s);\\n ans = std::min(ans, distance(t.b, s));\\n ans = std::min(ans, distance(s.a, t));\\n ans = std::min(ans, distance(s.b, t));\\n return ans;\\n}\\n\\n} // namespace geometry\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/polygon.cpp\\\"\\n\\n#line 5 \\\"/home/arc/project/comppro/cplib/geometry/polygon.cpp\\\"\\n\\n#line 7 \\\"/home/arc/project/comppro/cplib/geometry/polygon.cpp\\\"\\nnamespace geometry {\\n\\nusing Polygon = std::vector<Vector2>;\\n\\n/**\\n * @brief 多角形の面積を求めます\\n *\\n * @param p 多角形の頂点を反時計回りに並べたもの\\n * @return double\\n */\\ndouble area(const Polygon &p) {\\n double res = 0;\\n int n = p.size();\\n for (int i = 0; i < n - 1; i++) {\\n res += cross(p[i], p[i + 1]);\\n }\\n res += cross(p[n - 1], p[0]);\\n return res * 0.5;\\n}\\n\\n/**\\n * @brief 多角形が凸かどうか判定します\\n *\\n * @param p 多角形の頂点を反時計回りに並べたもの\\n * @return true 凸である場合\\n * @return false 凸でない場合\\n */\\nbool isConvex(const Polygon &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) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\n/**\\n * @brief 多角形に点が含まれているか判定します\\n *\\n * @param g 多角形の頂点を反時計回りに並べたもの\\n * @param p 対象の点\\n * @return int 含まれるなら2, 辺上にあるなら1, それ以外なら0\\n */\\nint isContained(const Polygon &g, const Vector2 &p) {\\n bool in = false;\\n int n = (int)g.size();\\n for (int i = 0; i < n; i++) {\\n Vector2 a = g[i] - p, b = g[(i + 1) % n] - p;\\n if (imag(a) > imag(b)) {\\n swap(a, b);\\n }\\n if (imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) {\\n in = !in;\\n }\\n if (equals(cross(a, b), 0) && doubleComp(dot(a, b), 0) <= 0) {\\n return 1;\\n }\\n }\\n return (in ? 2 : 0);\\n}\\n\\n/**\\n * @brief 凸包を求めます (O(N log N))\\n *\\n * @param p 多角形の頂点を反時計回りに並べたもの\\n * @return Polygon pの凸包\\n */\\nPolygon convexHull(Polygon &p) {\\n int n = (int)p.size(), k = 0;\\n std::sort(p.begin(), p.end(), [](const Vector2 &a, const Vector2 &b) {\\n return (!equals(a.real(), b.real()) ? a.real() < b.real()\\n : a.imag() < b.imag());\\n });\\n Polygon ch(2 * n);\\n // 一直線上の3点を含める -> (< -EPS)\\n // 含めない -> (< EPS)\\n for (int i = 0; i < n; ch[k++] = p[i++]) { // lower\\n while (k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\\n while (k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS) --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n}\\n\\n} // namespace geometry\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\\\"\\n\\n#line 4 \\\"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\\\"\\n\\n#line 7 \\\"/home/arc/project/comppro/cplib/geometry/proj_ref.cpp\\\"\\n\\nnamespace geometry {\\n/**\\n * @brief pからlに降ろした垂線の足を求める\\n *\\n * @param l\\n * @param p\\n * @return Vector2\\n */\\nVector2 projection(const Line &l, const Vector2 &p) {\\n double t = dot(p - l.a, l.a - l.b) / std::norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\n/**\\n * @brief lを対称軸としてpと線対称の位置にある点を求める\\n *\\n * @param l\\n * @param p\\n * @return Vector2\\n */\\nVector2 reflection(const Line &l, const Vector2 &p) {\\n return p + (projection(l, p) - p) * 2.0;\\n}\\n} // namespace geometry\\n#line 10 \\\"/home/arc/project/comppro/cplib/geometry/circle.cpp\\\"\\n\\nnamespace geometry {\\nstruct Circle {\\n Vector2 c;\\n double r;\\n Circle() = default;\\n Circle(Vector2 _c, double _r) : c(_c), r(_r) {\\n }\\n};\\n\\n/**\\n * @brief 円の交差判定を行います\\n *\\n * @param c1\\n * @param c2\\n * @return int 2つの円が離れている: 4, 外接: 3, 2点交差: 2, 内接: 1, 内包: 0\\n */\\nint checkIntersect(const Circle &c1, const Circle &c2) {\\n double d = abs(c1.c - c2.c);\\n if (d > c1.r + c2.r + EPS) {\\n return 4;\\n }\\n // 外接している場合\\n if (equals(d, c1.r + c2.r)) {\\n return 3;\\n }\\n // 内接している場合\\n if (equals(d, std::abs(c1.r - c2.r))) {\\n return 1;\\n }\\n // 内包している場合\\n if (d < std::abs(c1.r - c2.r) - EPS) {\\n return 0;\\n }\\n return 2;\\n}\\n\\nCircle incircle(const Vector2 &a, const Vector2 &b, const Vector2 &c) {\\n double A = std::abs(b - c), B = std::abs(a - c), C = std::abs(a - b);\\n Vector2 p(A * real(a) + B * real(b) + C * real(c),\\n A * imag(a) + B * imag(b) + C * imag(c));\\n p /= (A + B + C);\\n double r = distance(p, Line(a, b));\\n return Circle(p, r);\\n}\\n\\nCircle incircle(const Polygon &p) {\\n if (p.size() != 3) {\\n throw std::invalid_argument(\\\"The size of p must be 3\\\");\\n }\\n return incircle(p[0], p[1], p[2]);\\n}\\n\\n} // namespace geometry\\n#line 7 \\\"/home/arc/project/comppro/cplib/geometry/crosspoint.cpp\\\"\\n\\nnamespace geometry {\\n/**\\n * @brief 円と直線の交点を求める\\n *\\n * @param c\\n * @param l\\n * @return std::vector<Vector2>\\n */\\nstd::vector<Vector2> crossPoint(const Circle &c, const Line &l) {\\n std::vector<Vector2> res;\\n double d = distance(c.c, l);\\n // 交点を持たない\\n if (d > c.r + EPS) {\\n return res;\\n }\\n // 接する\\n Vector2 h = projection(l, c.c);\\n if (equals(d, c.r)) {\\n res.emplace_back(h);\\n return res;\\n }\\n Vector2 e = unitVector(l.b - l.a);\\n double 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 * @brief 2直線の交点を求める\\n *\\n * @param s\\n * @param t\\n * @return Vector2 2直線が平行であればNaN, そうでなければ交点\\n */\\nVector2 crossPoint(const Line &s, const Line &t) {\\n if (isParallel(s, t)) {\\n return NaN;\\n }\\n double d1 = cross(s.b - s.a, t.b - t.a);\\n double d2 = cross(s.b - s.a, s.b - t.a);\\n if (equals(std::abs(d1), 0) && equals(std::abs(d2), 0)) {\\n return t.a;\\n }\\n return t.a + (t.b - t.a) * (d2 / d1);\\n}\\n\\n/**\\n * @brief 2線分の交点を求める\\n *\\n * @param s\\n * @param t\\n * @return Vector2 2線分が交点を持たなければNaN, そうでなければ交点\\n */\\nVector2 crossPoint(const Segment &s, const Segment &t) {\\n if (!hasIntersect(s, t)) {\\n return NaN;\\n }\\n return crossPoint(Line(s), Line(t));\\n}\\n\\n/**\\n * @brief 2つの円の交点を求める\\n *\\n * @param c1\\n * @param c2\\n * @return vector<Point>\\n */\\nstd::vector<Vector2> crossPoint(const Circle &c1, const Circle &c2) {\\n std::vector<Vector2> res;\\n int mode = checkIntersect(c1, c2);\\n // 2つの中心の距離\\n double d = abs(c1.c - c2.c);\\n // 2円が離れている場合\\n if (mode == 4) {\\n return res;\\n }\\n // 1つの円がもう1つの円に内包されている場合\\n if (mode == 0) {\\n return res;\\n }\\n // 2円が外接する場合\\n if (mode == 3) {\\n double t = c1.r / (c1.r + c2.r);\\n res.emplace_back(c1.c + (c2.c - c1.c) * t);\\n return res;\\n }\\n // 内接している場合\\n if (mode == 1) {\\n if (c2.r < c1.r - EPS) {\\n res.emplace_back(c1.c + (c2.c - c1.c) * (c1.r / d));\\n } else {\\n res.emplace_back(c2.c + (c1.c - c2.c) * (c2.r / d));\\n }\\n return res;\\n }\\n // 2円が重なる場合\\n double rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\\n double rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\\n if (c1.r - abs(rc1) < EPS) {\\n rs1 = 0;\\n }\\n Vector2 e12 = (c2.c - c1.c) / abs(c2.c - c1.c);\\n res.emplace_back(c1.c + rc1 * e12 + rs1 * e12 * Vector2(0, 1));\\n res.emplace_back(c1.c + rc1 * e12 + rs1 * e12 * Vector2(0, -1));\\n return res;\\n}\\n\\n} // namespace geometry\\n#line 2 \\\"/home/arc/project/comppro/cplib/geometry/util.cpp\\\"\\n\\n#line 4 \\\"/home/arc/project/comppro/cplib/geometry/util.cpp\\\"\\nnamespace geometry {\\n/**\\n * @brief ラジアンから度に変換\\n * \\n * @param rad ラジアン\\n * @return double 度\\n */\\ndouble radToDeg(const double rad) { return rad * 180.0 / M_PI; }\\n\\n/**\\n * @brief 度からラジアンに変換\\n * \\n * @param deg 度\\n * @return double ラジアン\\n */\\ndouble degToRad(const double deg) { return deg * M_PI / 180; }\\n\\n\\n\\n} // namespace geometry\\n#line 2 \\\"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\\\"\\n\\n#line 4 \\\"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\\\"\\n\\n#line 2 \\\"/home/arc/project/comppro/cplib/graph/graph.cpp\\\"\\n\\n#line 6 \\\"/home/arc/project/comppro/cplib/graph/graph.cpp\\\"\\n\\ntemplate<typename CostType>\\n/// \\\\brief 辺の情報\\nstruct Edge{\\n int to;\\n CostType cost;\\n\\n Edge(int t, CostType c): to(t), cost(c){\\n }\\n};\\n\\ntemplate<typename CostType>\\nclass Graph{\\n\\nprivate:\\n\\n /// \\\\brief adjacent_list_[n]=ノードnの隣接リストを表すvector<Edge>\\n std::vector<std::vector<Edge<CostType>>> adjacent_list_;\\n\\npublic:\\n\\n /// \\\\brief 頂点数\\n const int NODE_SIZE_;\\n\\n /// \\\\brief コンストラクタ\\n /// \\\\param node_size 頂点数\\n explicit Graph(const int node_size): NODE_SIZE_(node_size),\\n adjacent_list_(node_size){\\n }\\n\\n /// \\\\brief 有向グラフの辺を生やす\\n /// \\\\param from 辺の根本の頂点の番号\\n /// \\\\param to 辺の先の頂点の番号\\n /// \\\\param cost 辺のコスト\\n void SetDirectedEdge(const int from, const int to, const CostType cost){\\n adjacent_list_[from].push_back(Edge<CostType>(to, cost));\\n }\\n\\n /// \\\\brief 無向グラフの辺を生やす\\n /// \\\\param node_a 一方の頂点の番号\\n /// \\\\param node_b もう一方の頂点の番号\\n /// \\\\param cost 辺のコスト\\n void\\n SetUndirectedEdge(const int node_a, const int node_b, const CostType cost){\\n SetDirectedEdge(node_a, node_b, cost);\\n SetDirectedEdge(node_b, node_a, cost);\\n }\\n\\n /// \\\\brief ある頂点の隣接リストを取得\\n /// \\\\param node_num 頂点の番号\\n /// \\\\return 隣接リスト\\n std::vector<Edge<CostType>> GetAdjacentList(int node_num) const{\\n return adjacent_list_[node_num];\\n }\\n};\\n\\n\\n\\n\\n\\n#line 6 \\\"/home/arc/project/comppro/cplib/graph/dijkstra.cpp\\\"\\n\\n/// \\\\brief ダイクストラ法により，ある頂点からの最短経路を求める\\n/// \\\\tparam CostType 辺のコストの型\\n/// \\\\param graph グラフ\\n/// \\\\param start_node どの頂点から最短経路を求めるか\\n/// \\\\param INF CostType型で十分大きい値\\n/// \\\\param Identity 単位元(0など)\\n/// \\\\return\\n/// 1要素目:\\n/// グラフの各頂点への最短経路を示す配列(到達不可能なときはINF)，負の辺が入っていた場合はsize0の配列\\n/// 2要素目: 各頂点の前の頂点を示す配列(開始点は-1)\\n/// 負の辺が入っていた場合はsize0の配列\\ntemplate <typename CostType>\\nstd::pair<std::vector<CostType>, std::vector<int>> Dijkstra(\\n const Graph<CostType> &graph, const int start_node,\\n CostType Identity, CostType INF) {\\n struct Info {\\n int node;\\n CostType cost;\\n\\n Info(int n, CostType c) : node(n), cost(c){};\\n\\n bool operator>(const Info &another) const {\\n return cost > another.cost;\\n }\\n };\\n\\n std::vector<CostType> min_cost(graph.NODE_SIZE_);\\n std::vector<int> prev(graph.NODE_SIZE_, -1);\\n std::priority_queue<Info, std::vector<Info>, std::greater<Info>> pq;\\n for (int i = 0; i < min_cost.size(); i++) {\\n min_cost[i] = (i == start_node) ? Identity : INF;\\n }\\n pq.push(Info(start_node, Identity));\\n\\n while (!pq.empty()) {\\n Info current_info = pq.top();\\n pq.pop();\\n if (min_cost[current_info.node] < current_info.cost) {\\n continue;\\n }\\n const std::vector<Edge<CostType>> &adjacency_list =\\n graph.GetAdjacentList(current_info.node);\\n for (auto e : adjacency_list) {\\n if (min_cost[e.to] > min_cost[current_info.node] + e.cost) {\\n min_cost[e.to] = min_cost[current_info.node] + e.cost;\\n prev[e.to] = current_info.node;\\n pq.push(Info(e.to, min_cost[e.to]));\\n }\\n }\\n }\\n\\n return {min_cost, prev};\\n}\\n\\n/**\\n * @brief 経路復元を行う\\n *\\n * @param prev ダイクストラで得た戻り値のprev\\n * @param g 最終ノード\\n * @return std::vector<int> 開始点からgまでの最短パス\\n */\\nstd::vector<int> getPath(const std::vector<int> &prev, int g) {\\n std::vector<int> res;\\n int curr = g;\\n while (prev[curr] != -1) {\\n res.push_back(curr);\\n curr = prev[curr];\\n }\\n res.push_back(curr);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n#line 69 \\\"main.cpp\\\"\\n\\n// 各線分ペアに対して: 交点を持っていればコスト0, そうでなければ4つの距離のmin で両端を結ぶ\\n\\nusing namespace geometry;\\nstruct Star {\\n vector<Vector2> points;\\n Star(double x, double y, double a, double r) {\\n points = vector<Vector2>(5);\\n // 原点中心で☆を書く\\n points[0] = rotate(Vector2(0, r), degToRad(a));\\n for (int i = 1; i <= 4; i++) {\\n points[i] = rotate(points[i-1], degToRad(144));\\n }\\n\\n // 平行移動\\n Vector2 move(x, y);\\n for (auto &p : points) {\\n p += move;\\n }\\n }\\n Star() = default;\\n};\\n\\nint getNode(int starId, int posId) {\\n return starId * 5 + posId;\\n}\\n\\ndouble solve(int n, int m, int L) {\\n vector<Star> stars(n);\\n for (int i = 0; i < n; i++) {\\n int x, y, a, r;\\n cin >> x >> y >> a >> r;\\n stars[i] = Star(x, y, a, r);\\n }\\n\\n Graph<double> graph(n * 5);\\n for (int i = 0; i < stars.size(); i++) {\\n for (int j = 0; j < 5; j++) {\\n for (int k = j + 1; k < 5; k++) {\\n graph.SetUndirectedEdge(getNode(i, j), getNode(i, k), 0);\\n }\\n }\\n }\\n\\n for (int i = 0; i < stars.size(); i++) {\\n for (int j = i + 1; j < stars.size(); j++) {\\n for (int k = 0; k < 5; k++) {\\n int siai = k;\\n int sibi = (k + 1) % 5;\\n Vector2 sia = stars[i].points[siai];\\n Vector2 sib = stars[i].points[sibi];\\n Segment segI(sia, sib);\\n for (int l = 0; l < 5; l++) {\\n int sjai = l;\\n int sjbi = (l + 1) % 5;\\n Vector2 sja = stars[j].points[sjai];\\n Vector2 sjb = stars[j].points[sjbi];\\n Segment segJ(sja, sjb);\\n\\n double cost;\\n\\n if (!hasIntersect(segI, segJ)) {\\n // 4点距離\\n cost = min({abs(sia - sja), abs(sia - sjb), abs(sib - sja),\\n abs(sib - sjb),\\n distance(sia, segJ),\\n distance(sib, segJ),\\n distance(sja, segI),\\n distance(sjb, segI)});\\n\\n } else {\\n cost = 0;\\n }\\n\\n graph.SetUndirectedEdge(getNode(i, siai), getNode(j, sjai), cost);\\n graph.SetUndirectedEdge(getNode(i, sibi), getNode(j, sjai), cost);\\n graph.SetUndirectedEdge(getNode(i, siai), getNode(j, sjbi), cost);\\n graph.SetUndirectedEdge(getNode(i, sibi), getNode(j, sjbi), cost);\\n }\\n }\\n }\\n }\\n\\n auto [res, _] = Dijkstra(graph, getNode(m - 1, 0), 0.0,\\n numeric_limits<double>::infinity());\\n\\n return res[getNode(L - 1, 0)];\\n}\\n\\nint main() {\\n cout << std::fixed << std::setprecision(16);\\n cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n\\n // Segment seg(Vector2(0,0), Vector2(3,0)), seg2(Vector2(1,0), Vector2(2,0));\\n // Vector2 cp = crossPoint(seg, seg2);\\n // bool hasint = hasIntersect(seg, seg2);\\n // cout<<cp.real()<<cp.imag()<<endl;\\n // cout<<hasint<<endl;\\n\\n while (true) {\\n int n, m, l;\\n cin >> n >> m >> l;\\n if (n == 0) {\\n break;\\n }\\n cout << solve(n, m, l) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 20368,\n \"score_of_the_acc\": -0.8017,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1370,"cells":{"group_id":{"kind":"string","value":"aoj_2395_cpp"},"problem_description":{"kind":"string","value":"PLAY in BASIC\nOne sunny day, Dick T. Mustang found an ancient personal computer in the closet.\nHe brought it back to his room and turned it on with a sense of nostalgia, seeing a message coming on the screen:\nREADY?\nYes. BASIC.\nBASIC is a programming language designed for beginners, and was widely used from 1980's to 1990's.\nThere have been quite a few BASIC dialects.\nSome of them provide the PLAY statement, which plays music when called with a string of a musical score written in Music Macro Language (MML).\nDick found this statement is available on his computer and accepts the following commands in MML:\nNotes: Cn, C+n, C-n, Dn, D+n, D-n, En,...,... (n = 1,2,4,8,16,32,64,128 + dots)\nEach note command consists of a musical note followed by a duration specifier.\nEach musical note is one of the seven basic notes: 'C', 'D', 'E', 'F', 'G', 'A', and 'B'. It can be followed by either '+' (indicating a sharp) or '-' (a flat). The notes 'C' through 'B' form an octave as depicted in the figure below. The octave for each command is determined by the current octave, which is set by the octave commands as described later. It is not possible to play the note 'C-' of the lowest octave (1) nor the note 'B+' of the highest octave (8).\nEach duration specifier is basically one of the following numbers: '1', '2', '4', '8', '16', '32', '64', and '128', where '1' denotes a whole note, '2' a half note, '4' a quarter note, '8' an eighth note, and so on. This specifier is\noptional\n; when omitted, the duration will be the default one set by the L command (which is described below). In addition, duration specifiers can contain\ndots\nnext to the numbers. A dot adds the half duration of the basic note. For example, '4.' denotes the duration of '4' (a quarter) plus '8' (an eighth, i.e. half of a quarter), or as 1.5 times long as '4'. It is possible that a single note has more than one dot, where each extra dot extends the duration by half of the previous one. For example, '4..' denotes the duration of '4' plus '8' plus '16', '4...' denotes the duration of '4' plus '8' plus '16' plus '32', and so on. The duration extended by dots cannot be shorter than that of '128' due to limitation of Dick's computer; therefore neither '128.' nor '32...' will be accepted. The dots specified without the numbers extend the default duration. For example, 'C.' is equivalent to 'C4.' when the default duration is '4'. Note that 'C4C8' and 'C4.' are\nunequivalent\n; the former contains two distinct notes, while the latter just one note.\nRest: Rn (n = 1,2,4,8,16,32,64,128 + dots)\nThe R command rests for the specified duration. The duration should be specified in the same way as the note commands, and it can be omitted, too. Note that 'R4R8' and 'R4.' are\nequivalent\n, unlike 'C4C8' and 'C4.', since the both rest for the same duration of '4' plus '8'.\nOctave: On (n = 1-8), <, >\nThe O command sets the current octave to the specified number. '>' raises one octave up, and '<' drops one d\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2395_10851243","code_snippet":"//by yjz\n#include<bits/stdc++.h>\nusing namespace std;\n#define FF first\n#define SS second\n#define PB push_back\n#define MP make_pair\n#define bged(v) (v).begin(),(v).end()\n#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)\ntypedef long long ll;\nconst int Imx=2147483647;\nconst ll Lbig=2e18;\nconst int mod=1e9+7;\nconst int STRLEN=100111;\nconst int LENCNT=8;\nconst int NOTEN=12;\nint Slen;\nchar S[STRLEN];\nstruct note\n{\n\tint id;//-1 for Rest id=(oct-1)*12+note_id\n\tint len;\n\tint vol;\n\tnote(int Id=0,int Len=0,int Vol=0){id=Id;len=Len;vol=Vol;}\n}a[STRLEN];\nint n;\n\nstring nt_tab[NOTEN+2]={\"B+\",\"C\",\"C+\",\"D\",\"D+\",\"E\",\"F\",\"F+\",\"G\",\"G+\",\"A\",\"A+\",\"B\",\"C-\"};\nstring Sinf=\"******************************************************************************************\";\nint get_note_cost(int oct_diff,int note_id)//oct_diff=cur_oct-note_oct\n{\n\tif(note_id==-1)return 0;\n\tif(oct_diff==0)return nt_tab[note_id+1].size();\n\tif(oct_diff==-1&¬e_id==0)return nt_tab[0].size();\n\tif(oct_diff==1&¬e_id==NOTEN-1)return nt_tab[NOTEN+1].size();\n\treturn 2333;\n}\nstring get_note_str(int oct_diff,int note_id)\n{\n\tif(note_id==-1)return \"\";\n\tif(oct_diff==0)return nt_tab[note_id+1];\n\tif(oct_diff==-1&¬e_id==0)return nt_tab[0];\n\tif(oct_diff==1&¬e_id==NOTEN-1)return nt_tab[NOTEN+1];\n\tassert(false);\n}\nstring dg_tab[1000];\nstring len_tab[8][256];\nconst int T2MX=512;\nconst int T2MXL=512;\nstring rest_tab[8][8][T2MX];\npair<string,string> rest_tab2[8][8][T2MX+T2MX];\nstring get_tab(int i,int j,int k)\n{\n\tstring s=\"\";\n\tif(a[i].id==-1)\n\t{\n\t\tint len=a[i].len;\n\t\tstring curs=\"\";\n\t\twhile(len>=T2MXL+T2MXL-1)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs.PB('R');\n//\t\t\tif(j!=LENCNT-1&&k!=LENCNT-1)s2.PB('1');\n\t\t}\n\t\ts=rest_tab2[j][k][len].FF+curs+rest_tab2[j][k][len].SS;\n\t\twhile(len>128)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs.PB('R');\n\t\t\tif(rest_tab2[j][k][len].FF.size()+curs.size()+rest_tab2[j][k][len].SS.size()<s.size())\n\t\t\t{\n\t\t\t\ts=rest_tab2[j][k][len].FF+curs+rest_tab2[j][k][len].SS;\n\t\t\t}\n\t\t}\n\t\t\n\t\tlen=a[i].len;\n\t\tcurs=\"\";\n\t\twhile(len>=T2MXL)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs.PB('R');\n\t\t\tcurs.PB('1');\n\t\t}\n\t\tcurs+=rest_tab[j][k][len];\n\t\tif(curs.size()<s.size())s=curs;\n\t}\n\telse\n\t{\n\t\ts=len_tab[j][a[i].len]+(j==k?\"\":\"L\"+dg_tab[1<<(7-k)]);\n\t}\n\treturn s;\n}\nint get_tab_cost(int i,int j,int k)\n{\n\tint ret=0;\n\tif(a[i].id==-1)\n\t{\n\t\tint len=a[i].len;\n\t\tint curs=0;\n\t\twhile(len>=T2MXL+T2MXL-1)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs++;\n\t\t}\n\t\tret=rest_tab2[j][k][len].FF.size()+curs+rest_tab2[j][k][len].SS.size();\n\t\twhile(len>128)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs++;\n\t\t\tret=min(ret,int(rest_tab2[j][k][len].FF.size()+curs+rest_tab2[j][k][len].SS.size()));\n\t\t}\n\t\tlen=a[i].len;\n\t\tcurs=0;\n\t\twhile(len>=T2MXL)\n\t\t{\n\t\t\tlen-=128;\n\t\t\tcurs+=2;\n\t\t}\n\t\tcurs+=rest_tab[j][k][len].size();\n\t\tret=min(ret,curs);\n\t}\n\telse\n\t{\n\t\tret=len_tab[j][a[i].len].size()+(j==k?0:1+dg_tab[1<<(7-k)].size());\n\t}\n\treturn ret;\n}\nvoid initialize_cost()\n{\n\tfor(int i=1;i<1000;i++)\n\t{\n\t\tint x=i;\n\t\tdg_tab[i]=\"\";\n\t\twhile(x)\n\t\t{\n\t\t\tdg_tab[i].PB('0'+x%10);\n\t\t\tx/=10;\n\t\t}\n\t\treverse(dg_tab[i].begin(),dg_tab[i].end());\n\t}\n\tfor(int t=0;t<8;t++)for(int i=1;i<=255;i++)len_tab[t][i]=Sinf;\n\tfor(int t=0;t<8;t++)\n\t{\n\t\tfor(int i=1;i<=128;i<<=1)\n\t\t{\n\t\t\tstring cur=(i==(1<<t))?\"\":dg_tab[128/i];\n\t\t\tint len=i,bs=i;\n\t\t\twhile(bs>0)\n\t\t\t{\n\t\t\t\tlen_tab[t][len]=cur;\n\t\t\t\tcur.PB('.');\n\t\t\t\tbs>>=1;\n\t\t\t\tlen+=bs;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<T2MX;i++)\n\t{\n\t\tfor(int s=0;s<8;s++)\n\t\t{\n\t\t\tfor(int t=0;t<8;t++)\n\t\t\t{\n\t\t\t\tstring &S=rest_tab[s][t][i];\n\t\t\t\tS=Sinf;\n\t\t\t\tfor(int j=1;j<=i&&j<256;j++)\n\t\t\t\t{\n\t\t\t\t\tif(rest_tab[s][t][i-j].size()+1+len_tab[t][j].size()<S.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tS=rest_tab[s][t][i-j]+\"R\"+len_tab[t][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(i==0&&s==t)S=\"\";\n\t\t\t}\n\t\t\tfor(int t=0;t<8;t++)\n\t\t\t{\n\t\t\t\tstring &S=rest_tab[s][t][i];\n\t\t\t\tstring tmp=\"L\"+dg_tab[1<<(7-t)];\n\t\t\t\tfor(int pt=0;pt<8;pt++)\n\t\t\t\t{\n\t\t\t\t\tif(rest_tab[s][pt][i].size()+tmp.size()<S.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tS=rest_tab[s][pt][i]+tmp;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<T2MXL+T2MXL-1;i++)\n\t{\n\t\tfor(int s=0;s<8;s++)\n\t\t{ \n\t\t\tfor(int t=0;t<8;t++)\n\t\t\t{\n\t\t\t\tpair<string,string> &S=rest_tab2[s][t][i];\n\t\t\t\tS=MP(Sinf,Sinf);\n\t\t\t\tfor(int j=0;j<=i&&j<T2MX;j++)\n\t\t\t\t{\n\t\t\t\t\tif(i-j<T2MX)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(rest_tab[s][7][j].size()+rest_tab[7][t][i-j].size()<S.FF.size()+S.SS.size())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tS=MP(rest_tab[s][7][j],rest_tab[7][t][i-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\t}\n\t/*\n\tfor(int i=1;i<T2MX;i++)\n\t{\t\n\t\tfor(int j=0;j<=i;j++)\n\t\t{\n\t\t\tfor(int v=0;v<8;v++)\n\t\t\t{\t\n\t\t\t\tfor(int s=0;s<8;s++)\n\t\t\t\t{\n\t\t\t\t\tfor(int t=0;t<8;t++)\n\t\t\t\t\t{\n\t\t\t\t\t\tassert(rest_tab[s][v][j].size()+rest_tab[v][t][i-j].size()>=rest_tab[s][t][i].size());\n\t\t\t\t\t\tif(rest_tab[s][v][j].size()+rest_tab[v][t][i-j].size()<rest_tab[s][t][i].size())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trest_tab[s][t][i]=rest_tab[s][v][j]+rest_tab[v][t][i-j];\n//\t\t\t\t\t\t\tcerr<<s<<\" \"<<t<<\" \"<<i<<\":\"<<rest_tab2[s][t][i]<<endl;\n//\t\t\t\t\t\t\tcerr<<v<<\" \"<<j<<\":\"<<rest_tab2[s][v][j]<<\" + \"<<rest_tab2[v][t][i-j]<<endl;\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\nint note_chtoid[7]={9,11,0,2,4,5,7};\nnote make_note(int oct,char note_ch,int dlt,int len,int vol)\n{\n\treturn note((oct-1)*NOTEN+note_chtoid[note_ch-'A']+dlt,len,vol);\n}\nint get_num(char s[],int &it)\n{\n\tint ret=0;\n\twhile(s[it]>='0'&&s[it]<='9')ret=ret*10+s[it]-'0',it++;\n\treturn ret;\n}\nint get_len(char s[],int &it,int Gdl=0)\n{\n\tint bs=get_num(s,it);\n\tif(bs==0&&Gdl==0)return 0;\n\tif(bs==0)bs=Gdl;else bs=128/bs;\n\tint ret=bs;\n\twhile(s[it]=='.')bs/=2,ret+=bs,it++;\n\treturn ret;\n}\nvoid initialize()\n{\n\tint oc=0;\n\tn=0;\n\tfor(int i=0;i<STRLEN;i++)a[i]=note(0,0,0);\n\tSlen=strlen(S+1);\n\tS[Slen+1]='\\n';\n\tint Goct=4,Gvol=100,Gdl=32;\n\tfor(int i=1;i<=Slen;i++)\n\t{\n//\t\tcerr<<\"i=\"<<i<<\" Goct=\"<<Goct<<\" Gvol=\"<<Gvol<<\" \"<<S[i]<<endl;\n\t\tif(S[i]>='A'&&S[i]<='G')\n\t\t{\n\t\t\tchar note_ch=S[i];\n\t\t\tint dlt=0;\n\t\t\ti++;oc++;\n\t\t\tif(S[i]=='+')dlt=1,i++,oc++;\n\t\t\tif(S[i]=='-')dlt=-1,i++,oc++;\n\t\t\tint len=get_len(S,i,Gdl);\n\t\t\ta[++n]=make_note(Goct,note_ch,dlt,len,Gvol);\n\t\t\ti--;\n\t\t}\n\t\tif(S[i]=='R')\n\t\t{\n\t\t\ti++;\n\t\t\tint len=get_len(S,i,Gdl);\n\t\t\tif(n>0&&a[n].id==-1)a[n].len+=len;\n\t\t\telse a[++n]=note(-1,len,-1);\n\t\t\ti--;\n\t\t}\n\t\tif(S[i]=='L')\n\t\t{\n\t\t\ti++;\n\t\t\tint len=get_len(S,i);\n\t\t\tassert((len&(-len))==len);\n\t\t\tGdl=len;\n\t\t\ti--;\n\t\t}\n\t\tif(S[i]=='V')\n\t\t{\n\t\t\ti++;\n\t\t\tint len=get_num(S,i);\n\t\t\tGvol=len;\n\t\t\ti--;\n\t\t}\n\t\tif(S[i]=='>')Goct++,oc++;\n\t\tif(S[i]=='<')Goct--,oc++;\n\t\tif(S[i]=='O')\n\t\t{\n\t\t\ti++;oc+=2;\n\t\t\tGoct=S[i]-'0';\n\t\t}\n\t}\n//\tcerr<<\"oc=\"<<oc<<endl;\n}\nint w[STRLEN][LENCNT][LENCNT];\nint dp[STRLEN][LENCNT];\nint pre[STRLEN][LENCNT];\nvoid solve_lencost()\n{\n\tmemset(w,0,sizeof(w));\n//\tcerr<<\"solve_lencost:\"<<endl;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=0;j<LENCNT;j++)for(int k=0;k<LENCNT;k++)w[i][j][k]=get_tab_cost(i,j,k);\n\t}\n\tmemset(dp,31,sizeof(dp));\n\tmemset(pre,0,sizeof(pre));\n\tfor(int i=0;i<LENCNT;i++)dp[0][i]=1+dg_tab[(1<<(7-i))].size();\n\tdp[0][5]=0;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tfor(int j=0;j<LENCNT;j++)\n\t\t{\n\t\t\tfor(int t=0;t<LENCNT;t++)\n\t\t\t{\n\t\t\t\tif(dp[i][j]+w[i+1][j][t]<dp[i+1][t])\n\t\t\t\t{\n\t\t\t\t\tdp[i+1][t]=dp[i][j]+w[i+1][j][t];\n\t\t\t\t\tpre[i+1][t]=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint oct_dp[STRLEN][8];\nint oct_pre[STRLEN][8];\nvoid solve_octcost()\n{\n//\tcerr<<\"solve_octcost:\"<<endl;\n\tmemset(oct_dp,31,sizeof(oct_dp));\n\tmemset(oct_pre,0,sizeof(oct_pre));\n\toct_dp[0][3]=0;oct_pre[0][3]=-1;\n\tfor(int i=0;i<=n;i++)\n\t{\n\t\tfor(int j=0;j<8;j++)\n\t\t{\n\t\t\tfor(int k=0;k<8;k++)\n\t\t\t{\n\t\t\t\tint cost=2-(abs(j-k)==1);\n\t\t\t\tif(oct_dp[i][j]>oct_dp[i][k]+cost)\n\t\t\t\t{\n\t\t\t\t\toct_dp[i][j]=oct_dp[i][k]+cost;\n\t\t\t\t\toct_pre[i][j]=k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(i<n)\n\t\t{\n\t\t\tfor(int j=0;j<8;j++)\n\t\t\t{\n\t\t\t\toct_dp[i+1][j]=oct_dp[i][j]+get_note_cost(j-a[i+1].id/12,a[i+1].id%12);\n\t\t\t\toct_pre[i+1][j]=-1;\n\t\t\t}\n\t\t}\n\t}\n}\nvoid print_ans()\n{\n/*\tcerr<<\"print_ans:\"<<endl;\n\tfor(int i=0;i<=n;i++){for(int j=0;j<8;j++)cerr<<dp[i][j]<<\",\"<<pre[i][j]<<\" \";cerr<<endl;}cerr<<endl;\n\tfor(int i=0;i<=n;i++){for(int j=0;j<8;j++)cerr<<oct_dp[i][j]<<\",\"<<oct_pre[i][j]<<\" \";cerr<<endl;}cerr<<endl;\n*/\t\n\tstatic string ANS[STRLEN];\n\tfor(int i=0;i<=n;i++)ANS[i].clear();\n\tint COST=0;\n\t//OctCost\n\tint x=n,y=0;\n\tfor(int i=0;i<8;i++)if(oct_dp[x][i]<oct_dp[x][y])y=i;\n//\tcerr<<\"OctCost=\"<<oct_dp[x][y]<<endl;\n\tCOST+=oct_dp[x][y];\n\twhile(x>0||oct_pre[x][y]!=-1)\n\t{\n\t\tif(oct_pre[x][y]==-1)\n\t\t{\n\t\t\tANS[x]+=get_note_str(y-a[x].id/12,a[x].id%12);\n\t\t\tx--;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ty=oct_pre[x][y];\n\t\t}\n\t}\n\t//LenCost\n\tx=n,y=0;\n\tfor(int i=0;i<8;i++)if(dp[x][i]<dp[x][y])y=i;\n\tCOST+=dp[x][y];\n\twhile(x>0)\n\t{\n\t\tANS[x]+=get_tab(x,pre[x][y],y);\n\t\ty=pre[x][y];\n\t\tx--;\n\t}\n\tif(y!=5)ANS[0]+=\"L\"+dg_tab[1<<(7-y)];\n\t//OctCost2\n\tx=n,y=0;\n\tfor(int i=0;i<8;i++)if(oct_dp[x][i]<oct_dp[x][y])y=i;\n\twhile(x>0||oct_pre[x][y]!=-1)\n\t{\n\t\tif(oct_pre[x][y]==-1)\n\t\t{\n\t\t\tx--;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(oct_pre[x][y]==y-1)ANS[x]+=\">\";\n\t\t\telse if(oct_pre[x][y]==y+1)ANS[x]+=\"<\";\n\t\t\telse ANS[x]+=\"O\"+dg_tab[y+1];\n\t\t\ty=oct_pre[x][y];\n\t\t}\n\t}\n\n\t//VolCost\n\tint Gvol=100;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tif(a[i].id!=-1&&a[i].vol!=Gvol)\n\t\t{\n\t\t\tANS[i-1].PB('V');\n\t\t\tANS[i-1]+=dg_tab[a[i].vol];\n\t\t\tGvol=a[i].vol;\n\t\t\tCOST+=1+dg_tab[a[i].vol].size();\n\t\t}\n\t}\n\tfor(int i=0;i<=n;i++)\n\t{\n\t\tfor(int j=0;j<ANS[i].size();j++)putchar(ANS[i][j]);\n\t}\n\tputs(\"\");\n//\tcerr<<\"COST=\"<<COST<<endl;\n}\nvoid debug()\n{\n\tcerr<<\"n=\"<<n<<endl;\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tcerr<<a[i].id<<\" \"<<a[i].len<<\" \"<<a[i].vol<<endl;\n\t}\n}\nvoid solve()\n{\n\tsolve_lencost();\n\tsolve_octcost();\n\tprint_ans();\n}\nvoid test_cost()\n{\n\tfor(int i=0;i<T2MX;i++)\n\t{\n\t\ta[1]=note(-1,i,-1);\n\t\tfor(int s=0;s<8;s++)\n\t\t{\n\t\t\tfor(int t=0;t<8;t++)\n\t\t\t{\n\t\t\t\tint gt=get_tab_cost(1,s,t);\n\t\t\t\tint tb=rest_tab[s][t][i].size();\n\t\t\t\tif(gt!=tb)\n\t\t\t\t{\n\t\t\t\t\tcerr<<i<<\" \"<<s<<\" \"<<t<<endl;\n\t\t\t\t\tcerr<<\"gt=\"<<gt<<\" tb=\"<<tb<<endl;\n\t\t\t\t\tcerr<<get_tab(1,s,t)<<endl;\n\t\t\t\t\tcerr<<rest_tab[s][t][i]<<endl;\n\t\t\t\t\texit(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nint main()\n{\n\tinitialize_cost();\n\ttest_cost();\n//\tcerr<<rest_tab[5][7][48]<<\" \"<<rest_tab[7][1][3]<<endl;\n\tint tn=0;\n\twhile(true)\n\t{\n\t\tscanf(\"%s\",S+1);\n\t\tif(S[1]=='*')break;\n\t\tprintf(\"Case %d: \",++tn);\n\t\tinitialize();\n///\t\tcerr<<get_tab(1,5,1)<<endl;\n//\t\tdebug();\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":68288,"score_of_the_acc":-1.0352,"final_rank":4},{"submission_id":"aoj_2395_8794884","code_snippet":"#include <bits/stdc++.h>\n#define pb push_back\n#define sz(a) ((int)a.size())\n#define re return\n#define all(a) a.begin(),a.end()\n#define rept(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,a) rept(i,0,a)\n#define vi vector<int>\n#define pii pair<int,int>\n#define F first\n#define S second\n#define debug(x) cout<<#x<<\"=\"<<x<<\"\\n\";\n#define int long long\nusing namespace std;\nconst int MOD=998244353,INF=1000000000000000000;\ntemplate<typename T>inline void Mx(T &a,T b){a=max(a,b);}\ntemplate<typename T>inline void Mi(T &a,T b){a=min(a,b);}\n\nstruct OP{\n\tint t,x,y,z;\n\tOP(int _t,int _x,int _y=0,int _z=0){\n\t\tt=_t,x=_x,y=_y,z=_z;\n\t}\n};\n\nint Case;\nvector<OP>S;\nint cur_oct,cur_vol,cur_def;\nint getint(string);\nint get_dot_number(string);\nstring to_str(int);\nvoid ReadStr(string);\n\nstring STR;\nvoid pre();\nstring get_R(int,int,int);\nvoid run1();\nvoid run2();\nvoid run3();\nvoid run4();\nvoid run5();\n\nvoid run(){\n\trun1();\n\trun2();\n\trun3();\n\trun4();\n\trun5();\n}\nsigned main()\n{\n//\tios::sync_with_stdio(0);\n//\tcin.tie(0);cout.tie(0);\n\tpre();\n\twhile(cin>>STR)run();\n\tre 0;\n}\n\n/////////////////////////////////////////\n\nint getint(string s){\n\tint x=0;\n\trep(i,sz(s))if(isdigit(s[i]))x=x*10+s[i]-'0';\n\tre x;\n}\nint get_dot_number(string s){\n\tint x=0;\n\trep(i,sz(s))if(s[i]=='.')x++;\n\tre x;\n}\nstring to_str(int x){\n\tstring s=\"\";\n\twhile(x){\n\t\ts+='0'+x%10;\n\t\tx/=10;\n\t}\n\treverse(all(s));\n\tre s;\n}\nvoid ReadStr(string s){\n\tif(s==\"\")re;\n\t//octave\n\tif(s==\"<\"){\n\t\tcur_oct--;\n\t\tre;\n\t}\n\tif(s==\">\"){\n\t\tcur_oct++;\n\t\tre;\n\t}\n\tif(s[0]=='O'){\n\t\tcur_oct=s[1]-'0'-1;\n\t\tre;\n\t}\n\t//volume\n\tif(s[0]=='V'){\n\t\tint x=getint(s);\n\t\tif(x!=cur_vol){\n\t\t\tcur_vol=x;\n\t\t\tS.pb(OP(2,x));\n\t\t}\n\t\tre;\n\t}\n\t//default\n\tif(s[0]=='L'){\n\t\tcur_def=getint(s);\n\t\tre;\n\t}\n\t//rest\n\tif(s[0]=='R'){\n\t\tint xx=getint(s);\n\t\tif(!xx)xx=cur_def;\n\t\tint x=128/xx,y=x,z=get_dot_number(s);\n\t\trep(i,z)y/=2,x+=y;\n\t\tS.pb(OP(1,x));\n\t\tre;\n\t}\n\t//note\n\tint l=0;\n\twhile(l<sz(s)&&!isdigit(s[l]))l++;\n\tint h=cur_oct*12;\n\tif(s[0]=='D')h+=2;\n\tif(s[0]=='E')h+=4;\n\tif(s[0]=='F')h+=5;\n\tif(s[0]=='G')h+=7;\n\tif(s[0]=='A')h+=9;\n\tif(s[0]=='B')h+=11;\n\tif(l>1&&s[1]=='-')h--;\n\tif(l>1&&s[1]=='+')h++;\n\tint x=getint(s),y=get_dot_number(s);\n\tif(x==0)x=cur_def;\n\tS.pb(OP(0,h,x,y));\n}\n\n//////////////////////////////////////////////////\n\nconst int BL=4096;\nstring dp_R[8][8][BL];\n\nvoid Mi_str(string &ss,string tt){\n\tif(ss==\"~\")ss=tt;\n\tif(sz(ss)>sz(tt))ss=tt;\n}\nvoid pre(){\n\trep(i,8)rep(j,8)rep(k,BL)dp_R[i][j][k]=\"~\";\n\trep(i,8)dp_R[i][i][0]=\"\";\n\trep(i,8){\n\t\trep(j,BL){\n\t\t\trep(k,8){\n\t\t\t\tif(dp_R[i][k][j]==\"~\")continue;\n\t\t\t\t//add L*\n\t\t\t\trep(l,8){\n\t\t\t\t\tMi_str(dp_R[i][l][j],dp_R[i][k][j]+\"L\"+to_str(1<<(l^7)));\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(k,8){\n\t\t\t\t//add R*\n\t\t\t\trep(l,8){\n\t\t\t\t\tstring cur=\"R\";\n\t\t\t\t\tif(l!=k)cur+=to_str(1<<(l^7));\n\t\t\t\t\tint len=0;\n\t\t\t\t\tfor(int m=l;m>=0;m--){\n\t\t\t\t\t\tlen+=1<<m;\n\t\t\t\t\t\tif(j+len>=BL)break;\n\t\t\t\t\t\tMi_str(dp_R[i][k][j+len],dp_R[i][k][j]+cur);\n\t\t\t\t\t\tcur+=\".\";\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n//\trep(i,BL)rep(x,8)rep(y,8)cout<<x<<\" \"<<i<<\" \"<<y<<\" \"<<dp_R[x][y][i]<<\"\\n\";\n}\nstring get_R(int x,int y,int len){\n\tif(len<=BL)re dp_R[x][y][len];\n\tint mid=(len-BL+127)/128;\n\tpii mi={INF,-1};\n\trept(i,BL/2,BL/2+128)Mi(mi,{sz(dp_R[x][7][len-mid*128-i])+sz(dp_R[7][y][i]),i});\n\tre dp_R[x][7][len-mid*128-mi.S]+string(mid,'R')+dp_R[7][y][mi.S];\n}\n\n//////////////////////////////////\n\n//init\nvoid run1(){\n\tif(STR==\"*\")exit(0);\n\tcur_oct=3;\n\tcur_vol=100;\n\tcur_def=4;\n}\n//cut&decode\nvoid run2(){\n\tS.clear();\n\tstring t=\"\";\n\trep(i,sz(STR)){\n\t\tif(isupper(STR[i])||STR[i]=='<'||STR[i]=='>'){\n\t\t\tReadStr(t);\n\t\t\tt=\"\";\n\t\t}\n\t\tt+=STR[i];\n\t}\n\tReadStr(t);\n}\n//swap&merge\nvoid run3(){\n\tvector<OP>S2;\n\tfor(int l=0,r;l<sz(S);l=r){\n\t\tr=l;\n\t\tif(S[l].t==1){\n\t\t\tint sum=0;\n\t\t\twhile(r<sz(S)&&S[r].t==1)sum+=S[r++].x;\n\t\t\tS2.pb(OP(1,sum));\n\t\t}\n\t\telse if(S[l].t==0){\n\t\t\tr=l+1;\n\t\t\tS2.pb(S[l]);\n\t\t}\n\t\telse{\n\t\t\tr=l+1;\n\t\t\tbool ok=0;\n\t\t\twhile(r<sz(S)){\n\t\t\t\tif(S[r].t==0){\n\t\t\t\t\tok=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(S[r].t==2)break;\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tr=l+1;\n\t\t\tif(ok)S2.pb(S[l]); \n\t\t}\n\t}\n\tS=S2;\n\trep(i,sz(S)-1){\n\t\tif(S[i].t==2&&S[i+1].t==1)swap(S[i],S[i+1]);\n\t}\n\tS2.clear();\n\tfor(int l=0,r;l<sz(S);l=r){\n\t\tr=l;\n\t\tif(S[l].t==1){\n\t\t\tint sum=0;\n\t\t\twhile(r<sz(S)&&S[r].t==1)sum+=S[r++].x;\n\t\t\tS2.pb(OP(1,sum));\n\t\t}\n\t\telse if(S[l].t==0){\n\t\t\tr=l+1;\n\t\t\tS2.pb(S[l]);\n\t\t}\n\t\telse{\n\t\t\tr=l+1;\n\t\t\tbool ok=0;\n\t\t\twhile(r<sz(S)){\n\t\t\t\tif(S[r].t==0){\n\t\t\t\t\tok=1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(S[r].t==2)break;\n\t\t\t\tr++;\n\t\t\t}\n\t\t\tr=l+1;\n\t\t\tif(ok)S2.pb(S[l]); \n\t\t}\n\t}\n\tS=S2;\n//\trep(i,sz(S)){\n//\t\tif(S[i].t==0){\n//\t\t\tcout<<\"Note \"<<S[i].x<<\" \"<<S[i].y<<\" \"<<S[i].z<<'\\n';\n//\t\t}\n//\t\telse if(S[i].t==1){\n//\t\t\tcout<<\"Rest \"<<S[i].x<<'\\n';\n//\t\t}\n//\t\telse{\n//\t\t\tcout<<\"Volume \"<<S[i].x<<\"\\n\";\n//\t\t}\n//\t}\n}\n\n//dp\npair<int,pii>DP[100005][8][8];//(pos,def,oct)->(len,trans,from)\nvector<string>vecS;\nint n;\nvoid run4(){\n\tn=sz(S);\n\trep(i,n+1)rep(j,8)rep(k,8)DP[i][j][k]={INF,{-1,-1}};\n\tvecS.clear();\n\tDP[0][5][3]={0,{0,0}};\n\tint lstV=100;\n\trep(i,n){\n\t\tif(S[i].t==2){\n\t\t\tstring cs=\"\";\n\t\t\tif(lstV!=S[i].x)cs=\"V\"+to_str(lstV=S[i].x);\n\t\t\trep(j,8)rep(k,8)if(DP[i][j][k].F<INF)Mi(DP[i+1][j][k],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\n\t\t\tvecS.pb(cs);\n\t\t}\n\t\tif(S[i].t==1){\n\t\t\trep(j,8)rep(l,8){\n\t\t\t\tstring cs=get_R(j,l,S[i].x);\n\t\t\t\tbool use=0;\n\t\t\t\trep(k,8){\n\t\t\t\t\tif(DP[i][j][k].F<INF){\n\t\t\t\t\t\tuse=1;\n\t\t\t\t\t\tMi(DP[i+1][l][k],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(use)vecS.pb(cs);\n\t\t\t}\n\t\t}\n\t\tif(S[i].t==0){\n\t\t\tstring GO[14]={\"C-\",\"C\",\"C+\",\"D\",\"D+\",\"E\",\"F\",\"F+\",\"G\",\"G+\",\"A\",\"A+\",\"B\",\"B+\"};\n\t\t\tvector<pii>ch_O;\n\t\t\tint h=S[i].x;\n\t\t\tch_O.pb({h/12,h%12+1});\n\t\t\tif(h%12==0&&h!=0)ch_O.pb({h/12-1,13});\n\t\t\tif(h%12==11&&h!=95)ch_O.pb({h/12+1,0});\n\t\t\trep(j,8)rep(k,8){\n\t\t\t\tif(DP[i][j][k].F>=INF)continue;\n\t\t\t\tfor(pii l:ch_O){\n\t\t\t\t\tstring pf=\"\";\n\t\t\t\t\tif(k==l.F+1)pf=\"<\";\n\t\t\t\t\telse if(k==l.F-1)pf=\">\";\n\t\t\t\t\telse if(k!=l.F)pf=\"O\"+string(1,'0'+l.F+1);\n\t\t\t\t\tif((1<<(j^7))==S[i].y){\n\t\t\t\t\t\tstring cs=pf+GO[l.S]+string(S[i].z,'.');\n\t\t\t\t\t\tMi(DP[i+1][j][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\n\t\t\t\t\t\tvecS.pb(cs);\n\t\t\t\t\t}\n\t\t\t\t\tif((1<<(j^7))!=S[i].y){\n\t\t\t\t\t\t//use\n\t\t\t\t\t\tstring cs=pf+\"L\"+to_str(S[i].y)+GO[l.S]+string(S[i].z,'.');\n\t\t\t\t\t\tMi(DP[i+1][__lg(S[i].y)^7][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\n\t\t\t\t\t\tvecS.pb(cs);\n\t\t\t\t\t\tcs=pf+GO[l.S]+to_str(S[i].y)+string(S[i].z,'.');\n\t\t\t\t\t\tMi(DP[i+1][j][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\n\t\t\t\t\t\tvecS.pb(cs);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n//\trep(i,n+1)rep(j,8)rep(k,8)if(DP[i][j][k].F<INF){\n//\t\tcout<<DP[i][j][k].F<<\" \"<<vecS[DP[i][j][k].S.F]<<\" \"<<(DP[i][j][k].S.S>>3)<<\" \"<<(DP[i][j][k].S.S&7)<<\"\\n\";\n//\t}\n}\n//restore answer&output\nvoid run5(){\n\tpair<int,pii>p={INF,{-1,-1}};\n\trep(i,8)rep(j,8)Mi(p,{DP[n][i][j].F,{i,j}});\n\tint x=p.S.F,y=p.S.S;\n\tvi v;\n\tfor(int i=n;i;i--){\n\t\tv.pb(DP[i][x][y].S.F);\n\t\tint t=DP[i][x][y].S.S;\n\t\tx=t>>3;\n\t\ty=t&7;\n\t}\n\treverse(all(v));\n\tassert(sz(v)==n);\n\tcout<<\"Case \"<<++Case<<\": \";\n\tfor(int i:v)cout<<vecS[i];\n\tcout<<\"\\n\";\n}","accuracy":1,"time_ms":1030,"memory_kb":69460,"score_of_the_acc":-1.3309,"final_rank":6},{"submission_id":"aoj_2395_7215642","code_snippet":"#include <bits/stdc++.h>\n#define INF 1000000000\n#define LINF 1000000000000000000\n#define MOD 1000000007\n#define mod 998244353\n#define F first\n#define S second\n#define ll int\n#define N 100010\nusing namespace std;\nll num_len(ll x)\n{\n\tif(x==0)\n\t{\n\t\treturn 1;\n\t}\n\tll ret=0;\n\twhile(x)\n\t{\n\t\tret++;\n\t\tx/=10;\n\t}\n\treturn ret;\n}\nstruct Note{\n\tll num,cr,vl,len;\n};\nmap<string,ll> ntid;\nstring ntnm[]={\"C\",\"C+\",\"D\",\"D+\",\"E\",\"F\",\"F+\",\"G\",\"G+\",\"A\",\"A+\",\"B\"};\nstring s;\nvector<Note> nts;\nll dp[N][9][8],rstval[8][10010][8];\npair<ll,ll> trsrst[8][10010][8];\npair<ll,pair<ll,ll> > trs[N][9][8];\nll calclen(string t,ll curlen)\n{\n\tll num=0,ret=0,i;\n\twhile((!t.empty())&&isdigit(t[0]))\n\t{\n\t\tnum=num*10+t[0]-'0';\n\t\tt.erase(t.begin());\n\t}\n\tif(num==0)\n\t{\n\t\tnum=curlen;\n\t}\n\telse\n\t{\n\t\tnum=128/num;\n\t}\n\tfor(i=0;i<=t.size();i++)\n\t{\n\t\tret+=num;\n\t\tnum/=2;\n\t}\n\treturn ret;\n}\nvoid printrst(ll l0,ll x,ll l1)\n{\n\tif(x==-1)\n\t{\n\t\treturn;\n\t}\n\tll lstx=trsrst[l0][x][l1].F,lstl=trsrst[l0][x][l1].S,j,k;\n\tprintrst(l0,lstx,lstl);\n\tif(lstx==x)\n\t{\n\t\tprintf(\"L%d\",128/(1<<l1));\n\t\treturn;\n\t}\n\tif(lstx==-1)\n\t{\n\t\treturn;\n\t}\n\tbool ok=false;\n\tfor(j=0;j<8;j++)\n\t{\n\t\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\n\t\tfor(k=0;curval;k++,curval>>=1)\n\t\t{\n\t\t\tsum+=curval;\n\t\t\tif(sum==x-lstx)\n\t\t\t{\n\t\t\t\tll nv=cur*(j!=l1)+k+1;\n\t\t\t\tif(rstval[l0][x][l1]==rstval[l0][lstx][lstl]+nv)\n\t\t\t\t{\n\t\t\t\t\tputchar('R');\n\t\t\t\t\tif(j!=l1)\n\t\t\t\t\t{\n\t\t\t\t\t\tprintf(\"%d\",128/(1<<j));\n\t\t\t\t\t}\n\t\t\t\t\twhile(k--)\n\t\t\t\t\t{\n\t\t\t\t\t\tputchar('.');\n\t\t\t\t\t}\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}\n\t\tif(ok)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn;\n}\nvoid print(ll x,ll cr,ll len)\n{\n\tif(x==-1)\n\t{\n\t\treturn;\n\t}\n\tll lstx=trs[x][cr][len].F,lstcr=trs[x][cr][len].S.F,lstlen=trs[x][cr][len].S.S;\n\tbool pvol=false;\n\tif(lstx>=INF)\n\t{\n\t\tlstx-=INF,lstcr-=INF,lstlen-=INF;\n\t\tpvol=true;\n\t}\n\tprint(lstx,lstcr,lstlen);\n\tif(lstx==-1)\n\t{\n\t\treturn;\n\t}\n\tif(x==lstx)\n\t{\n\t\tif(cr==lstcr)\n\t\t{\n\t\t\tprintf(\"L%d\",128/(1<<len));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(cr==lstcr+1)\n\t\t\t{\n\t\t\t\tputchar('>');\n\t\t\t}\n\t\t\telse if(cr==lstcr-1)\n\t\t\t{\n\t\t\t\tputchar('<');\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf(\"O%d\",cr);\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\tif(nts[x-1].num==INF)\n\t{\n\t\tll cur=nts[x-1].len,req;\n\t\tif(!pvol)\n\t\t{\n\t\t\treq=(cur<10000)?0:(cur-10000+(1<<lstlen)+50)/(1<<lstlen);\n\t\t\tcur-=req*(1<<lstlen);\n\t\t\twhile(req--)\n\t\t\t{\n\t\t\t\tputchar('R');\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treq=(cur<10000)?0:(cur-10000+(1<<len)+50)/(1<<len);\n\t\t\tcur-=req*(1<<len);\n\t\t}\n\t\tprintrst(lstlen,cur,len);\n\t\tif(pvol)\n\t\t{\n\t\t\twhile(req--)\n\t\t\t{\n\t\t\t\tputchar('R');\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\tll adsz=0,j,k,curval;\n\tif(pvol)\n\t{\n\t\tadsz+=num_len(nts[x-1].vl)+1;\n\t\tprintf(\"V%d\",nts[x-1].vl);\n\t}\n\tif(cr==nts[x-1].cr)\n\t{\n\t\tadsz+=ntnm[nts[x-1].num].size();\n\t\tprintf(\"%s\",ntnm[nts[x-1].num].c_str());\n\t}\n\telse if(cr==nts[x-1].cr-1)\n\t{\n\t\tadsz+=2;\n\t\tprintf(\"B+\");\n\t}\n\telse\n\t{\n\t\tadsz+=2;\n\t\tprintf(\"C-\");\n\t}\n\tbool ok=false;\n\tfor(j=0;j<8;j++)\n\t{\n\t\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\n\t\tfor(k=0;curval;k++,curval>>=1)\n\t\t{\n\t\t\tsum+=curval;\n\t\t\tif(sum==nts[x-1].len)\n\t\t\t{\n\t\t\t\tll nv=cur*(j!=len)+k+adsz;\n\t\t\t\tif(dp[x][cr][len]==dp[lstx][lstcr][len]+nv)\n\t\t\t\t{\n\t\t\t\t\tif(j!=len)\n\t\t\t\t\t{\n\t\t\t\t\t\tprintf(\"%d\",128/(1<<j));\n\t\t\t\t\t}\n\t\t\t\t\twhile(k--)\n\t\t\t\t\t{\n\t\t\t\t\t\tputchar('.');\n\t\t\t\t\t}\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}\n\t\tif(ok)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn;\n}\nint main(){\n\tll i,j,k,l,p,TC=1;\n\tntid[\"C-\"]=-1;\n\tntid[\"C\"]=0;\n\tntid[\"C+\"]=ntid[\"D-\"]=1;\n\tntid[\"D\"]=2;\n\tntid[\"D+\"]=ntid[\"E-\"]=3;\n\tntid[\"E\"]=ntid[\"F-\"]=4;\n\tntid[\"E+\"]=ntid[\"F\"]=5;\n\tntid[\"F+\"]=ntid[\"G-\"]=6;\n\tntid[\"G\"]=7;\n\tntid[\"G+\"]=ntid[\"A-\"]=8;\n\tntid[\"A\"]=9;\n\tntid[\"A+\"]=ntid[\"B-\"]=10;\n\tntid[\"B\"]=11;\n\tntid[\"B+\"]=12;\n\tfor(l=0;l<8;l++)\n\t{\n\t\tmemset(rstval[l],63,sizeof(rstval[l]));\n\t\trstval[l][0][l]=0;\n\t\ttrsrst[l][0][l]=make_pair(-1,-1);\n\t\tfor(i=0;i<=10000;i++)\n\t\t{\n\t\t\tll mnv=0;\n\t\t\tfor(j=0;j<8;j++)\n\t\t\t{\n\t\t\t\tif(rstval[l][i][j]<rstval[l][i][mnv])\n\t\t\t\t{\n\t\t\t\t\tmnv=j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(j=0;j<8;j++)\n\t\t\t{\n\t\t\t\tll nv=num_len(128/(1<<j))+1+rstval[l][i][mnv];\n\t\t\t\tif(rstval[l][i][j]>nv)\n\t\t\t\t{\n\t\t\t\t\trstval[l][i][j]=nv;\n\t\t\t\t\ttrsrst[l][i][j]=make_pair(i,mnv);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(j=0;j<8;j++)\n\t\t\t{\n\t\t\t\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\n\t\t\t\tfor(k=0;curval;k++,curval>>=1)\n\t\t\t\t{\n\t\t\t\t\tsum+=curval;\n\t\t\t\t\tif(i+sum<=10000)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor(p=0;p<8;p++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tll nv=rstval[l][i][p]+cur*(j!=p)+k+1;\n\t\t\t\t\t\t\tif(rstval[l][i+sum][p]>nv)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\trstval[l][i+sum][p]=nv;\n\t\t\t\t\t\t\t\ttrsrst[l][i+sum][p]=make_pair(i,p);\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\t\t\t}\n\t\t}\n\t}\n\twhile(true)\n\t{\n\t\tcin>>s;\n\t\tif(s==\"*\")\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tnts.clear();\n\t\tll curvl=100,curcr=4,curlen=32;\n\t\tfor(i=0;i<s.size();)\n\t\t{\n\t\t\tif(s[i]=='>')\n\t\t\t{\n\t\t\t\tcurcr++;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\telse if(s[i]=='<')\n\t\t\t{\n\t\t\t\tcurcr--;\n\t\t\t\ti++;\n\t\t\t}\n\t\t\telse if(s[i]=='O')\n\t\t\t{\n\t\t\t\tcurcr=s[i+1]-'0';\n\t\t\t\ti+=2;\n\t\t\t}\n\t\t\telse if(s[i]=='V')\n\t\t\t{\n\t\t\t\tll cnum=0;\n\t\t\t\tfor(j=i+1;isdigit(s[j]);j++)\n\t\t\t\t{\n\t\t\t\t\tcnum=cnum*10+s[j]-'0';\n\t\t\t\t}\n\t\t\t\tcurvl=cnum;\n\t\t\t\ti=j;\n\t\t\t}\n\t\t\telse if(s[i]=='L')\n\t\t\t{\n\t\t\t\tll cnum=0;\n\t\t\t\tfor(j=i+1;isdigit(s[j]);j++)\n\t\t\t\t{\n\t\t\t\t\tcnum=cnum*10+s[j]-'0';\n\t\t\t\t}\n\t\t\t\tcurlen=128/cnum;\n\t\t\t\ti=j;\n\t\t\t}\n\t\t\telse if(s[i]=='R')\n\t\t\t{\n\t\t\t\tstring ts=\"\";\n\t\t\t\tfor(j=i+1;j<s.size()&&(isdigit(s[j])||s[j]=='.');j++)\n\t\t\t\t{\n\t\t\t\t\tts+=s[j];\n\t\t\t\t}\n\t\t\t\tNote nw;\n\t\t\t\tnw.num=INF,nw.cr=nw.vl=-1,nw.len=calclen(ts,curlen);\n\t\t\t\tif((!nts.empty())&&nts[nts.size()-1].num==INF)\n\t\t\t\t{\n\t\t\t\t\tnts[nts.size()-1].len+=nw.len;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnts.push_back(nw);\n\t\t\t\t}\n\t\t\t\ti=j;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tll ntnum,ntcr=curcr;\n\t\t\t\tif(i+1<s.size()&&(s[i+1]=='+'||s[i+1]=='-'))\n\t\t\t\t{\n\t\t\t\t\tntnum=ntid[s.substr(i,2)];\n\t\t\t\t\ti+=2;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tntnum=ntid[s.substr(i,1)];\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\tif(ntnum==-1)\n\t\t\t\t{\n\t\t\t\t\tntnum+=12;\n\t\t\t\t\tntcr--;\n\t\t\t\t}\n\t\t\t\tif(ntnum==12)\n\t\t\t\t{\n\t\t\t\t\tntnum-=12;\n\t\t\t\t\tntcr++;\n\t\t\t\t}\n\t\t\t\tstring ts=\"\";\n\t\t\t\tfor(j=i;j<s.size()&&(isdigit(s[j])||s[j]=='.');j++)\n\t\t\t\t{\n\t\t\t\t\tts+=s[j];\n\t\t\t\t}\n\t\t\t\tNote nw;\n\t\t\t\tnw.num=ntnum,nw.cr=ntcr,nw.vl=curvl,nw.len=calclen(ts,curlen);\n\t\t\t\tnts.push_back(nw);\n\t\t\t\ti=j;\n\t\t\t}\n\t\t}\n\t\tfor(i=0;i<=nts.size();i++)\n\t\t{\n\t\t\tmemset(dp[i],63,sizeof(dp[i]));\n\t\t}\n\t\tdp[0][4][5]=0;\n\t\ttrs[0][4][5]=make_pair(-1,make_pair(-1,-1));\n\t\tcurvl=100;\n\t\tfor(i=0;i<nts.size();i++)\n\t\t{\n\t\t\tfor(j=1;j<=8;j++)\n\t\t\t{\n\t\t\t\tll mnv=0;\n\t\t\t\tfor(k=0;k<8;k++)\n\t\t\t\t{\n\t\t\t\t\tif(dp[i][j][k]<dp[i][j][mnv])\n\t\t\t\t\t{\n\t\t\t\t\t\tmnv=k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(k=0;k<8;k++)\n\t\t\t\t{\n\t\t\t\t\tll nv=dp[i][j][mnv]+1+num_len(128/(1<<k));\n\t\t\t\t\tif(dp[i][j][k]>nv)\n\t\t\t\t\t{\n\t\t\t\t\t\tdp[i][j][k]=nv;\n\t\t\t\t\t\ttrs[i][j][k]=make_pair(i,make_pair(j,mnv));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(j=0;j<8;j++)\n\t\t\t{\n\t\t\t\tfor(k=1;k<=8;k++)\n\t\t\t\t{\n\t\t\t\t\tfor(l=1;l<=8;l++)\n\t\t\t\t\t{\n\t\t\t\t\t\tll nv=dp[i][k][j]+2-(abs(k-l)<=1);\n\t\t\t\t\t\tif(dp[i][l][j]>nv)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdp[i][l][j]=nv;\n\t\t\t\t\t\t\ttrs[i][l][j]=make_pair(i,make_pair(k,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\tif(nts[i].num!=INF)\n\t\t\t{\n\t\t\t\tll ad=0;\n\t\t\t\tif(curvl!=nts[i].vl)\n\t\t\t\t{\n\t\t\t\t\tad+=num_len(nts[i].vl)+1;\n\t\t\t\t}\n\t\t\t\tfor(j=0;j<8;j++)\n\t\t\t\t{\n\t\t\t\t\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\n\t\t\t\t\tfor(k=0;curval;k++,curval>>=1)\n\t\t\t\t\t{\n\t\t\t\t\t\tsum+=curval;\n\t\t\t\t\t\tif(sum==nts[i].len)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor(p=0;p<8;p++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tll nv=dp[i][nts[i].cr][p]+cur*(j!=p)+k+ad+ntnm[nts[i].num].size();\n\t\t\t\t\t\t\t\tif(dp[i+1][nts[i].cr][p]>nv)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tdp[i+1][nts[i].cr][p]=nv;\n\t\t\t\t\t\t\t\t\tif(curvl!=nts[i].vl)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr][p]=make_pair(i+INF,make_pair(nts[i].cr+INF,p+INF));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr][p]=make_pair(i,make_pair(nts[i].cr,p));\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(nts[i].num==0)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tnv=dp[i][nts[i].cr-1][p]+cur*(j!=p)+k+ad+2;\n\t\t\t\t\t\t\t\t\tif(dp[i+1][nts[i].cr-1][p]>nv)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tdp[i+1][nts[i].cr-1][p]=nv;\n\t\t\t\t\t\t\t\t\t\tif(curvl!=nts[i].vl)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr-1][p]=make_pair(i+INF,make_pair(nts[i].cr-1+INF,p+INF));\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr-1][p]=make_pair(i,make_pair(nts[i].cr-1,p));\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(nts[i].num==11)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tnv=dp[i][nts[i].cr+1][p]+cur*(j!=p)+k+ad+2;\n\t\t\t\t\t\t\t\t\tif(dp[i+1][nts[i].cr+1][p]>nv)\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tdp[i+1][nts[i].cr+1][p]=nv;\n\t\t\t\t\t\t\t\t\t\tif(curvl!=nts[i].vl)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr+1][p]=make_pair(i+INF,make_pair(nts[i].cr+1+INF,p+INF));\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\ttrs[i+1][nts[i].cr+1][p]=make_pair(i,make_pair(nts[i].cr+1,p));\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\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\t\t\t\tcurvl=nts[i].vl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor(j=0;j<8;j++)\n\t\t\t\t{\n\t\t\t\t\tll cur=nts[i].len,tot=(cur<10000)?0:(cur-10000+(1<<j)+50)/(1<<j);\n\t\t\t\t\tcur-=tot*(1<<j);\n\t\t\t\t\tfor(l=0;l<8;l++)\n\t\t\t\t\t{\n\t\t\t\t\t\tll nv=tot+rstval[j][cur][l];\n\t\t\t\t\t\tfor(k=1;k<=8;k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(dp[i+1][k][l]>dp[i][k][j]+nv)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdp[i+1][k][l]=dp[i][k][j]+nv;\n\t\t\t\t\t\t\t\ttrs[i+1][k][l]=make_pair(i,make_pair(k,j));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tnv=tot+rstval[l][cur][j];\n\t\t\t\t\t\tfor(k=1;k<=8;k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(dp[i+1][k][j]>dp[i][k][l]+nv)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdp[i+1][k][j]=dp[i][k][l]+nv;\n\t\t\t\t\t\t\t\ttrs[i+1][k][j]=make_pair(i+INF,make_pair(k+INF,l+INF));\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\t\t\t}\n\t\t}\n\t\tll ans=INF,lstx,lsty;\n\t\tfor(i=1;i<=8;i++)\n\t\t{\n\t\t\tfor(j=0;j<8;j++)\n\t\t\t{\n\t\t\t\tif(ans>dp[nts.size()][i][j])\n\t\t\t\t{\n\t\t\t\t\tans=dp[nts.size()][i][j];\n\t\t\t\t\tlstx=i,lsty=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"Case %d: \",TC++);\n\t\tprint(nts.size(),lstx,lsty);\n\t\tputs(\"\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":310,"memory_kb":33528,"score_of_the_acc":-0.4968,"final_rank":3},{"submission_id":"aoj_2395_6548318","code_snippet":"/**\n * author: gary\n * created: 28.04.2022 09:54:53\n**/\n#include<bits/stdc++.h>\n#define rb(a,b,c) for(int a=b;a<=c;++a)\n#define rl(a,b,c) for(int a=b;a>=c;--a)\n#define rep(a,b) for(int a=0;a<b;++a)\n#define LL long long\n#define PB push_back\n#define POB pop_back\n#define II(a,b) make_pair(a,b)\n#define FIR first\n#define SEC second\n#define SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())\n#define random(a) rng()%a\n#define ALL(a) a.begin(),a.end()\n#define check_min(a,b) a=min(a,b)\n#define check_max(a,b) a=max(a,b)\nusing namespace std;\nconst int INF=0x3f3f3f3f;\ntypedef pair<int,int> mp;\nstruct Node{\n int note,x,v,o,d;\n Node(){}\n Node(int _,int __,int ___,int ____,int _____){note=_,x=__,v=___,o=____,d=_____;}\n void Debug(){\n cout<<\"{\\n\";\n cout<<\"Note=\"<<note<<endl;\n cout<<\"x=\"<<x<<endl;\n cout<<\"v=\"<<v<<endl;\n cout<<\"o=\"<<o<<endl;\n cout<<\"d=\"<<d<<endl;\n cout<<\"}\\n\";\n }\n};\nmap<string,int> NOTE={\n{\"C\",1},\n{\"C+\",2},\n{\"D-\",2},\n{\"D\",3},\n{\"D+\",4},\n{\"E-\",4},\n{\"F-\",5},\n{\"E\",5},\n{\"E+\",6},\n{\"F\",6},\n{\"F+\",7},\n{\"G-\",7},\n{\"G\",8},\n{\"G+\",9},\n{\"A-\",9},\n{\"A\",10},\n{\"A+\",11},\n{\"B-\",11},\n{\"B\",12}\n};\nint NOTE_LEN[13],X_LEN[8]={1,1,1,1,2,2,2,3};\nstring NOTE2[13];\nint getnote(string s){\n return NOTE[s];\n}\nint getx(int x){\n return floor(log2(x)+0.4);\n}\nconst int MAXN=1e5+10;\nint n;\nNode dat[MAXN];\nint getnum(string &s,int &i){\n int x=0;\n while (i<s.length()&&isdigit(s[i])){\n x*=10;\n x+=s[i]-'0';\n i++;\n }\n return x;\n}\nvoid Get(string Note,int x,int V,int O,int d){\n // cout<<Note<<\" \"<<x<<\" \"<<V<<\" \"<<O<<' '<<d<<endl;\n if(Note==\"C-\") Note=\"B\",O--;\n if(Note==\"B+\") Note=\"C\",O++;\n if(Note==\"R\"){\n x=128/x;\n int s=x;\n while (d){\n d--;\n x>>=1;\n s+=x;\n }\n if(n&&dat[n].note==0) dat[n].x+=s;\n else dat[++n]=Node(0,s,0,0,0);\n }\n else{\n dat[++n]=Node(getnote(Note),getx(x),V,O-1,d);\n }\n}\nvoid process(string &s){\n int i=0;\n int V=100,O=4,L=4;\n while (i<s.length()){\n if(s[i]=='C'||s[i]=='D'||s[i]=='E'||s[i]=='F'||s[i]=='G'||s[i]=='A'||s[i]=='B'||s[i]=='R'){\n string Note;Note.PB(s[i]);\n if(i+1<s.length()&&(s[i+1]=='+'||s[i+1]=='-')) Note.PB(s[i+1]),i++;\n int x=L;\n i++;\n if(i<s.length()&&isdigit(s[i])) x=getnum(s,i);\n else x=L;\n int d=0;\n while (i<s.length()&&s[i]=='.'){\n i++;\n d++;\n }\n Get(Note,x,V,O,d);\n }\n else if(s[i]=='O'||s[i]=='<'||s[i]=='>'){\n if(s[i]=='O'){\n i++;\n int x=getnum(s,i);\n O=x;\n }\n else if(s[i]=='>'){\n O++;\n i++;\n }\n else O--,i++;\n }\n else if(s[i]=='L'){\n i++;\n int x=getnum(s,i);\n L=x;\n }\n else{\n assert(s[i]=='V');\n i++;\n int x=getnum(s,i);\n V=x;\n }\n }\n}\nconst int B=1024;\nint dp[MAXN][8][8];\nmp from[MAXN][8][8];// L O\nstring f[B+1][8][8];\nbool upd(string& A,string B){\n if(B.length()<A.length()||A==\"EMPTY\") {A=B;return 1;}\n return 0;\n}\nstring Num(int x){\n string rest=\"\";\n while (x)\n {\n rest.PB('0'+x%10);\n x/=10;\n }\n reverse(ALL(rest));\n return rest;\n}\nstring Lx(int fx,int tx){\n if(fx==tx) return \"\";\n return \"L\"+Num(1<<tx);\n}\nstring Vx(int tx){\n string ans=\"V\";\n ans+=Num(tx);\n return ans;\n}\nstring Ox(int fx,int tx){\n if(fx==tx) return \"\";\n if(fx==tx-1) return \">\";\n else if(fx==tx+1) return \"<\";\n else{\n string ans=\"O\";\n ans.PB(char('1'+tx));\n return ans;\n }\n}\nstring Query(int i,int j,int k){\n if(i<=B) return f[i][j][k];\n int Cnt=0;\n while (i>B)\n {\n i-=128;\n Cnt++;\n }\n string rest=Query(i,j,k);\n string Ans;\n if(j==0){\n rb(i,1,Cnt) Ans+=\"R\";\n return Ans+rest;\n }\n rep(i,rest.length()){\n if(i>=2&&rest[i-2]=='L'&&rest[i-1]=='1'&&rest[i]!='2'&&rest[i]!='6'){\n rb(i,1,Cnt) Ans+=\"R\";\n Cnt=0;\n }\n Ans.PB(rest[i]);\n }\n // if(Cnt){\n // cerr<<i<<\" \"<<rest<<\" \"<<rest.length()<<j<<\" \"<<k<<\" \"<<endl;\n // }\n // assert(!Cnt);\n return Ans;\n}\nint Querylen(int i,int j,int k){\n if(i<=B) return f[i][j][k].length();\n int Cnt=(i-B)/128;\n i-=Cnt*128;\n while (i>B)\n {\n i-=128;\n Cnt++;\n }\n return Cnt+Querylen(i,j,k);\n}\nint Work(int o,int k,Node x){\n if(o==x.o){\n return NOTE_LEN[x.note]+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\n }\n if(o==x.o-1&&x.note==1){\n return 2+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\n }\n if(o==x.o+1&&x.note==12){\n return 2+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\n }\n return INF;\n}\nstring Works(int o,int k,Node x){\n if(o==x.o){\n string tmp= NOTE2[x.note]+(k==x.x? \"\":Num((1<<x.x)));\n rb(i,1,x.d) tmp.PB('.');\n return tmp;\n }\n if(o==x.o-1&&x.note==1){\n string tmp= \"B+\"+(k==x.x? \"\":Num((1<<x.x)));\n rb(i,1,x.d) tmp.PB('.');\n return tmp;\n }\n if(o==x.o+1&&x.note==12){\n string tmp= \"C-\"+(k==x.x? \"\":Num((1<<x.x)));\n rb(i,1,x.d) tmp.PB('.');\n return tmp;\n }\n return \"FUCK\";\n}\nint Recover(int i,int j,int k){\n int fj,fk;\n if(i==0) return 100;\n tie(fj,fk)=from[i][j][k];\n if(dat[i].note==0){\n int tmp=Recover(i-1,fj,fk);\n cout<<Query(dat[i].x,fj,j);\n return tmp;\n }\n int tmp=Recover(i-1,fj,fk);\n if(tmp!=dat[i].v){\n cout<<Vx(dat[i].v);\n tmp=dat[i].v;\n }\n cout<<Lx(fj,j)<<Ox(fk,k)<<Works(k,j,dat[i]);\n return tmp;\n}\nint main(){\n // freopen(\"in.txt\",\"r\",stdin);\n // freopen(\"my.txt\",\"w\",stdout);\n ios::sync_with_stdio(false);\n cin.tie(0);\n for(auto it:NOTE) NOTE_LEN[it.second]=it.first.length(),NOTE2[it.second]=it.first;\n for(auto it:NOTE) NOTE_LEN[it.second]=it.first.length(),upd(NOTE2[it.second],it.first);\n rep(i,B+1) rep(j,8) rep(k,8) f[i][j][k]=\"EMPTY\";\n rep(j,8) rep(k,8) f[0][j][k]=Lx(j,k);\n rb(i,1,B) {\n while (true){\n bool ok=0; \n rep(j,8) rep(k,8){\n rep(l,8) if(f[i][l][k]!=\"EMPTY\") ok|=upd(f[i][j][k],Lx(j,l)+f[i][l][k]);\n rep(g,8){\n int t=128/((1<<g));\n int s=0;\n string Rest=\"R\";\n if(g!=j) Rest+=Num(1<<g);\n while (t>=1){\n if(s!=0) Rest.PB('.');\n s+=t;\n t>>=1;\n if(s<=i&&f[i-s][j][k]!=\"EMPTY\") ok|=upd(f[i][j][k],Rest+f[i-s][j][k]);\n }\n }\n }\n if(!ok) break;\n }\n }\n // cout<<Query(310,2,0)<<endl;\n // return 0;\n int T=0;\n while (true){\n string s;\n cin>>s;\n if(s==\"*\") break;\n n=0;\n process(s);\n rb(i,0,n) rep(j,8) rep(k,8) dp[i][j][k]=INF;\n dp[0][2][3]=0;\n rb(i,1,n){\n if(dat[i].note==0){\n rep(j,8){\n rep(newj,8){\n int Klen=Querylen(dat[i].x,j,newj);\n rep(k,8) if(dp[i-1][j][k]+Klen<dp[i][newj][k]){\n dp[i][newj][k]=dp[i-1][j][k]+Klen;\n from[i][newj][k]=II(j,k);\n }\n }\n }\n }\n else{\n rep(j,8) rep(k,8) if(dp[i-1][j][k]!=INF) \n rep(nj,8) rep(nk,8){\n int Klen=Lx(j,nj).length()+Ox(k,nk).length()+Work(nk,nj,dat[i]);\n if(Klen+dp[i-1][j][k]<dp[i][nj][nk]){\n dp[i][nj][nk]=dp[i-1][j][k]+Klen;\n from[i][nj][nk]=II(j,k);\n }\n }\n }\n }\n // rb(i,1,n){\n // dat[i].Debug();\n // }\n cout<<\"Case \"<<++T<<\": \";\n int ans=INF,j=0,k=0;\n rep(x,8) rep(y,8) if(dp[n][x][y]<ans) ans=dp[n][x][y],j=x,k=y;\n Recover(n,j,k);\n cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":2890,"memory_kb":25476,"score_of_the_acc":-1.296,"final_rank":5},{"submission_id":"aoj_2395_6546082","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,n) for (int i=(a);i<=(n);i++)\n#define per(i,a,n) for (int i=(n);i>=(a);i--)\n#define inf 0x3f3f3f3f\n#define pb push_back\n#define all(x) x.begin(),x.end()\n#define SZ(x) ((int)x.size())\nusing namespace std;\nstring Ns[] = {\"1\", \"2\", \"4\", \"8\", \"16\", \"32\", \"64\", \"128\"};\nint DNs[] = {128, 64, 32, 16, 8, 4, 2, 1};\nstring RS[] = {\"C\", \"D\", \"E\", \"F\", \"G\", \"A\", \"B\"};\nchar RC[] = {'C', 'D', 'E', 'F', 'G', 'A', 'B'};\nint RK[] = {0, 2, 4, 5, 7, 9, 11};\nint LD[] = {2, 2, 2, 2, 3, 3, 3, 4};\nconst string I = \"hyh\";\nconst int N = 100015, M = 1280;\n\ntemplate<class A, class B>\nbool upd(A &x, A y, B &xx, B yy) {\n\tif (x > y) {\n\t\tx = y;\n\t\txx = yy;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n\nint NTD(string s) {\n\n\trep(i, 0, 7) if (Ns[i] == s) return DNs[i];\n\n\treturn 0;\n}\n\nint CTRK(char ch) {\n\n\trep(i, 0, 6) if (RC[i] == ch) return RK[i];\n\n\treturn 0;\n}\n\nint STD(string S, int DD) {\n\n\tint Num = -1, Dot = count(all(S), '.'), D = 0;\n\n\trep(i, 0, 7) if (DNs[i] == DD) Num = i;\n\n\trep(i, 0, 7) if (S.substr(0, SZ(Ns[i])) == Ns[i]) Num = i;\n\n\trep(i, 0, Dot) D += DNs[Num + i];\n\n\treturn D;\n\n}\n\nstring KTS(int AK, int OT) {\n\tstring _C, n_C;\n\tauto Do = [&]() {if (SZ(n_C) < SZ(_C) || _C.empty()) _C = n_C;};\n\n\trep(i, 0, 6) {\n\t\tif (OT * 12 + RK[i] == AK)\n\t\t\tn_C = RS[i], Do();\n\n\t\tif (OT * 12 + RK[i] + 1 == AK)\n\t\t\tn_C = RS[i] + \"+\", Do();\n\n\t\tif (OT * 12 + RK[i] - 1 == AK)\n\t\t\tn_C = RS[i] + \"-\", Do();\n\t}\n\n\tif (_C.empty()) {return I;}\n\n\treturn _C;\n}\n\nstring DTS(int D, int DD) {\n\tvector<int> ms;\n\n\trep(i, 0, 7) if (D & DNs[i]) ms.pb(i);\n\n\tif (SZ(ms) != ms.back() - ms[0] + 1) return I;\n\n\tstring Num, Dot;\n\tNum = DNs[ms[0]] == DD ? \"\" : Ns[ms[0]];\n\n\trep(_, 2, SZ(ms)) Dot += \".\";\n\n\treturn Num + Dot;\n};\n\nstring kts[111][8], dts[256][256];\n\nvoid Calc(string dp[M + 15][8], int s) {\n\tstatic int L[M + 15][8];\n\tmemset(L, 0x3f, sizeof L);\n\tL[0][s] = 0;\n\n\trep(i, 0, M) {\n\n\t\trep(j, 0, 7) rep(k, 0, 7) if (j != k) {\n\t\t\tupd(L[i][k], L[i][j] + LD[j], dp[i][k], dp[i][j] + \"L\" + Ns[k]);\n\t\t}\n\n\t\trep(j, 0, 7) rep(k, 0, 255) {\n\t\t\tif (i + k > M) break;\n\n\t\t\tstring &s = dts[k][DNs[j]];\n\n\t\t\tif (s == I) continue;\n\n\t\t\tupd(L[i + k][j], L[i][j] + 1 + SZ(s), dp[i + k][j], dp[i][j] + \"R\" + s);\n\t\t}\n\t}\n}\n\nstring dp[8][M + 15][8];\n\nvoid Prework() {\n\trep(i, 0, 7) rep(j, 0, 11) rep(k, 0, 7) kts[i * 12 + j][k] = KTS(i * 12 + j, k);\n\n\trep(i, 1, 255) rep(j, 0, 7) dts[i][DNs[j]] = DTS(i, DNs[j]);\n\n\trep(s, 0, 7) Calc(dp[s], s);\n}\n\nint Tr[8][8];\n\nvoid GTr(int D) {\n\tint O = D, cnt = 0;\n\n\twhile (O > M) O -= 128, cnt++;\n\n\trep(p, 0, 7) rep(q, 0, 7) Tr[p][q] = SZ(dp[p][O][q]) + cnt;\n}\n\nstring GS(int D, int p, int q) {\n\tint O = D, cnt = 0;\n\n\twhile (O > M) O -= 128, cnt++;\n\n\tstring res = dp[p][O][q];\n\n\tif (cnt) res.insert(p == 0 ? 0 : (res.find(\"L1\") + 2), cnt, 'R');\n\n\treturn res;\n}\n\nstruct Note {\n\tint AK, Vl, D;\n\tbool IR;\n\tstring ktos(int OT) {return kts[AK][OT];}\n\tstring dtos(int DD) {return dts[D][DD];}\n} A[N];\n\nNote Read(string O, int &OT, int &DD, int &Vl) {\n\tNote res = (Note) {0, 0, 0, 0};\n\n\tif (O[0] == '<') OT--;\n\telse if (O[0] == '>') OT++;\n\telse if (O[0] == 'O') OT = O[1] - '1';\n\telse if (O[0] == 'L') DD = NTD(O.substr(1));\n\telse if (O[0] == 'V') Vl = stoi(O.substr(1));\n\telse if (O[0] == 'R') {\n\t\tres.IR = 1;\n\t\tres.D = STD(O.substr(1), DD);\n\n\t} else {\n\t\tres.Vl = Vl;\n\t\tres.AK = OT * 12 + CTRK(O[0]);\n\t\tO.erase(O.begin());\n\n\t\tif (SZ(O) > 0) {\n\t\t\tif (O[0] == '+') {\n\t\t\t\tO.erase(O.begin());\n\t\t\t\tres.AK++;\n\n\t\t\t} else if (O[0] == '-') {\n\t\t\t\tO.erase(O.begin());\n\t\t\t\tres.AK--;\n\t\t\t}\n\t\t}\n\n\t\tres.D = STD(O, DD);\n\t}\n\n\treturn res;\n}\n\nint n, f[N][8], fr[N][8];\nstring se, DA[N], OTA[N], Ex[N];\n\nvoid SD() {\n\trep(i, 0, n) memset(f[i], 0x3f, sizeof f[i]);\n\n\tint Vl = 100;\n\tf[0][2] = 0;\n\n\trep(i, 1, n) {\n\t\tif (A[i].IR) {\n\t\t\tGTr(A[i].D);\n\n\t\t\trep(p, 0, 7) rep(q, 0, 7) upd(f[i][p], f[i - 1][q] + Tr[q][p], fr[i][p], q);\n\n\t\t} else {\n\t\t\trep(p, 0, 7) rep(q, 0, 7) upd(f[i][p], f[i - 1][q] + (p != q) * LD[p] + SZ(A[i].dtos(DNs[p])), fr[i][p], q);\n\n\t\t\tif (Vl != A[i].Vl) {\n\t\t\t\tVl = A[i].Vl;\n\t\t\t\tEx[i] += \"V\" + to_string(Vl);\n\t\t\t}\n\t\t}\n\t}\n\n\tint Min = inf, p = 0, np = 0;\n\n\trep(i, 0, 7) upd(Min, f[n][i], p, i);\n\n\tper(i, 1, n) {\n\t\tnp = fr[i][p];\n\n\t\tif (A[i].IR) {\n\t\t\tDA[i] = GS(A[i].D, np, p);\n\n\t\t} else {\n\t\t\tif (p != np) Ex[i] += \"L\" + Ns[p];\n\n\t\t\tDA[i] = A[i].dtos(DNs[p]);\n\t\t}\n\n\t\tp = np;\n\t}\n}\n\nvoid SOT() {\n\trep(i, 0, n) memset(f[i], 0x3f, sizeof f[i]);\n\n\tf[0][3] = 0;\n\n\trep(i, 1, n) {\n\t\tif (A[i].IR) {\n\t\t\trep(p, 0, 7) upd(f[i][p], f[i - 1][p], fr[i][p], p);\n\n\t\t} else {\n\t\t\trep(p, 0, 7) rep(q, 0, 7) {\n\t\t\t\tstring oo = A[i].ktos(p);\n\n\t\t\t\tif (oo == I) continue;\n\n\t\t\t\tint o = (p == q ? 0 : abs(p - q) == 1 ? 1 : 2);\n\n\t\t\t\tupd(f[i][p], f[i - 1][q] + o + SZ(oo), fr[i][p], q);\n\t\t\t}\n\t\t}\n\t}\n\n\tint Min = inf, p = 0, np = 0;\n\n\trep(i, 0, 7) upd(Min, f[n][i], p, i);\n\n\tper(i, 1, n) {\n\t\tnp = fr[i][p];\n\n\t\tif (!A[i].IR) {\n\t\t\tif (p != np) {\n\t\t\t\tif (np + 1 == p) Ex[i] += \">\";\n\t\t\t\telse if (np - 1 == p) Ex[i] += \"<\";\n\t\t\t\telse Ex[i] += \"O\" + to_string(p + 1);\n\t\t\t}\n\n\t\t\tOTA[i] = A[i].ktos(p);\n\t\t}\n\n\t\tp = np;\n\t}\n\n}\n\nvoid solve() {\n\tint OT = 3, DD = NTD(\"4\"), Vl = 100;\n\tn = 0;\n\n\tfor (int l = 0, r; r = l, l < SZ(se); l = r + 1) {\n\t\twhile (r + 1 < SZ(se) && !('A' <= se[r + 1] && se[r + 1] <= 'Z') && se[r + 1] != '<' && se[r + 1] != '>') r++;\n\n\t\tNote Cur = Read(se.substr(l, r - l + 1), OT, DD, Vl);\n\n\t\tif (!Cur.D) continue;\n\n\t\tif (A[n].IR && Cur.IR) A[n].D += Cur.D;\n\t\telse A[++n] = Cur;\n\t}\n\n\trep(i, 1, n) Ex[i] = OTA[i] = DA[i] = \"\";\n\n\tSD();\n\tSOT();\n\n\trep(i, 1, n) cout << Ex[i] << OTA[i] << DA[i];\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr); cout.tie(nullptr);\n\tPrework();\n\tint test = 0;\n\n\twhile (cin >> se) {\n\t\tif (se == \"*\") break;\n\n\t\tcout << \"Case \" << ++test << \": \";\n\t\tsolve();\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":390,"memory_kb":26452,"score_of_the_acc":-0.4123,"final_rank":2},{"submission_id":"aoj_2395_3669739","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int N = 100005;\nconst int INF = 0x3f3f3f3f;\ninline int get_note(int O, char ch, int f) {\n\tif (ch == 'C') return (O - 1) * 12 + 1 + f;\n\telse if (ch == 'D') return (O - 1) * 12 + 3 + f;\n\telse if (ch == 'E') return (O - 1) * 12 + 5 + f;\n\telse if (ch == 'F') return (O - 1) * 12 + 6 + f;\n\telse if (ch == 'G') return (O - 1) * 12 + 8 + f;\n\telse if (ch == 'A') return (O - 1) * 12 + 10 + f;\n\telse return (O - 1) * 12 + 12 + f;\n}\ninline int get_num(char *str, int len, int &i) {\n\tint x = 0;\n\twhile (i < len && isdigit(str[i + 1])) x = x * 10 + str[++i] - '0';\n\treturn x;\n}\ninline int get_dot(char *str, int len, int &i) {\n\tint c = 0;\n\twhile (i < len && str[i + 1] == '.') c++, i++;\n\treturn c;\n}\ninline int get_len(int x, int L) {\n\tif (!x) return L;\n\telse if (x == 1) return 1;\n\telse if (x == 2) return 2;\n\telse if (x == 4) return 3;\n\telse if (x == 8) return 4;\n\telse if (x == 16) return 5;\n\telse if (x == 32) return 6;\n\telse if (x == 64) return 7;\n\telse return 8;\n}\nstruct Node {\n\tint nt, x, c, vol;\n};\nint n;\nNode dat[N];\ninline void init_all(char *str) {\n\tint len = strlen(str + 1);\n\tint O = 4;\n\tint L = 3;\n\tint V = 100;\n\tn = 0;\n\tfor (int i = 1; i <= len; i++) {\n\t\tchar ch = str[i];\n\t\tif (ch >= 'A' && ch <= 'G') {\n\t\t\tint f = 0;\n\t\t\tif (i < len && str[i + 1] == '+') f = 1, i++;\n\t\t\telse if (i < len && str[i + 1] == '-') f = -1, i++;\n\t\t\tint nt = get_note(O, ch, f);\n\t\t\tint x = get_len(get_num(str, len, i), L);\n\t\t\tint c = get_dot(str, len, i);\n\t\t\tdat[++n] = (Node){nt, x, c, V};\n\t\t} else if (ch == 'R') {\n\t\t\tint x = get_len(get_num(str, len, i), L);\n\t\t\tint c = get_dot(str, len, i);\n\t\t\tx = (1 << (8 - x));\n\t\t\tint t = x;\n\t\t\twhile (c--) {t >>= 1; x += t;}\n\t\t\tif (n && !dat[n].nt) dat[n].x += x;\n\t\t\telse dat[++n] = (Node){0, x, 0, 0};\n\t\t} else if (ch == 'O') {\n\t\t\tO = str[++i] - '0';\n\t\t} else if (ch == '<') {\n\t\t\tO--;\n\t\t} else if (ch == '>') {\n\t\t\tO++;\n\t\t} else if (ch == 'L') {\n\t\t\tL = get_len(get_num(str, len, i), L);\n\t\t} else if (ch == 'V') {\n\t\t\tV = get_num(str, len, i);\n\t\t} else assert(false);\n\t}\n}\nchar str[N];\nint dp_oct[N][9], dp_L[N][9];\nint fr_oct[N][9], fr_L[N][9];\nconst int Len_note[12] = {1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1};\nconst int Len_dura[9] = {0, 1, 1, 1, 1, 2, 2, 2, 3};\nint dp_r[512][9][9], dp_r2[1024][9][9], fr_r2[1024][9][9];\npair<int, int> fr_r[512][9][9];\npair<int, int> rests[40];\nvoid init_r() {\n\tint crests = 0;\n\tfor (int i = 1; i <= 8; i++)\n\t\tfor (int j = i; j <= 8; j++)\n\t\t\trests[++crests] = {i, j};\n\tmemset(dp_r, 0x3f, sizeof(dp_r));\n\tfor (int j0 = 1; j0 <= 8; j0++) for (int j1 = 1; j1 <= 8; j1++) dp_r[0][j0][j1] = (j0 != j1 ? 1 + Len_dura[j1] : 0);\n\tfor (int i = 1; i < 512; i++) {\n\t\tfor (int j0 = 1; j0 <= 8; j0++) {\n\t\t\tfor (int j1 = 1; j1 <= 8; j1++) {\n\t\t\t\tfor (int k = 1; k <= 36; k++) {\n\t\t\t\t\tint l = rests[k].first, r = rests[k].second, len = (1 << (9 - l)) - (1 << (8 - r));\n\t\t\t\t\tif (i - len >= 0) {\n\t\t\t\t\t\tfor (int j2 = 1; j2 <= 8; j2++) {\n\t\t\t\t\t\t\tint cur = dp_r[i - len][j0][j2] + (j1 != j2 ? 1 + Len_dura[j1] : 0) + (l != j1 ? Len_dura[l] : 0) + 1 + r - l;\n\t\t\t\t\t\t\tif (dp_r[i][j0][j1] > cur) {\n\t\t\t\t\t\t\t\tdp_r[i][j0][j1] = cur;\n\t\t\t\t\t\t\t\tfr_r[i][j0][j1] = {k, j2};\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\t\t\t}\n\t\t}\n\t}\n\tmemset(dp_r2, 0x3f, sizeof(dp_r2));\n\tfor (int i = 0; i < 1024; i++) {\n\t\tfor (int j0 = 1; j0 <= 8; j0++) {\n\t\t\tfor (int j1 = 1; j1 <= 8; j1++) {\n\t\t\t\tfor (int k = max(0, i - 511); k <= i && k < 512; k++) {\n\t\t\t\t\tint cur = dp_r[k][j0][1] + dp_r[i - k][1][j1];\n\t\t\t\t\tif (dp_r2[i][j0][j1] > cur) {\n\t\t\t\t\t\tdp_r2[i][j0][j1] = cur;\n\t\t\t\t\t\tfr_r2[i][j0][j1] = k;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\nvoid print_dp_r(int i, int j0, int j1) {\n\tif (!i) {\n\t\tif (j0 != j1) printf(\"L%d\", 1 << (j1 - 1));\n\t\treturn;\n\t}\n\tint k = fr_r[i][j0][j1].first;\n\tint j2 = fr_r[i][j0][j1].second;\n\tint l = rests[k].first, r = rests[k].second, len = (1 << (9 - l)) - (1 << (8 - r));\n\tprint_dp_r(i - len, j0, j2);\n\tif (j1 != j2) printf(\"L%d\", 1 << (j1 - 1));\n\tprintf(\"R\");\n\tif (l != j1) printf(\"%d\", 1 << (l - 1));\n\tint cnt = r - l;\n\twhile (cnt--)\n\t\tprintf(\".\");\n}\nint calc_r(int l, int j0, int j1) {\n\tint c1 = 0, tl = l;\n\twhile (l >= 1024) {\n\t\tc1++;\n\t\tl -= 128;\n\t}\n\tint res = INF;\n\tres = min(res, dp_r2[l][j0][j1] + c1);\n\twhile (l >= 128) {\n\t\tc1++;\n\t\tl -= 128;\n\t\tres = min(res, dp_r2[l][j0][j1] + c1);\n\t}\n\tc1 = 0;\n\tl = tl;\n\twhile (l >= 512) {\n\t\tc1 += 2;\n\t\tl -= 128;\n\t}\n\tres = min(res, dp_r[l][j0][j1] + c1);\n\twhile (l >= 128) {\n\t\tc1 += 2;\n\t\tl -= 128;\n\t\tres = min(res, dp_r[l][j0][j1] + c1);\n\t}\n\treturn res;\n}\nvoid print_r(int l, int j0, int j1) {\n\tint c1 = 0, tl = l, a1 = 0, al = 0;\n\twhile (l >= 1024) {\n\t\tc1++;\n\t\tl -= 128;\n\t}\n\tint res = INF;\n\tif (res > dp_r2[l][j0][j1] + c1) {\n\t\tres = dp_r2[l][j0][j1] + c1;\n\t\ta1 = 1;\n\t\tal = l;\n\t}\n\twhile (l >= 128) {\n\t\tc1++;\n\t\tl -= 128;\n\t\tif (res > dp_r2[l][j0][j1] + c1) {\n\t\t\tres = dp_r2[l][j0][j1] + c1;\n\t\t\ta1 = 1;\n\t\t\tal = l;\n\t\t}\n\t}\n\tc1 = 0;\n\tl = tl;\n\twhile (l >= 512) {\n\t\tc1 += 2;\n\t\tl -= 128;\n\t}\n\tif (res > dp_r[l][j0][j1] + c1) {\n\t\tres = dp_r[l][j0][j1] + c1;\n\t\ta1 = 0;\n\t\tal = l;\n\t}\n\twhile (l >= 128) {\n\t\tc1 += 2;\n\t\tl -= 128;\n\t\tif (res > dp_r[l][j0][j1] + c1) {\n\t\t\tres = dp_r[l][j0][j1] + c1;\n\t\t\ta1 = 0;\n\t\t\tal = l;\n\t\t}\n\t}\n\tif (a1) {\n\t\tc1 = (tl - al) / 128;\n\t\tint k = fr_r2[al][j0][j1];\n\t\tprint_dp_r(k, j0, 1);\n\t\twhile (c1--) printf(\"R\");\n\t\tprint_dp_r(al - k, 1, j1);\n\t} else {\n\t\tc1 = (tl - al) / 128;\n\t\twhile (c1--) printf(\"R1\");\n\t\tprint_dp_r(al, j0, j1);\n\t}\n}\nint ans_oct[N], ans_L[N];\nconst char van[14][5] = {\"C-\", \"C\", \"C+\", \"D\", \"D+\", \"E\", \"F\", \"F+\", \"G\", \"G+\", \"A\", \"A+\", \"B\", \"B+\"};\nint main() {\n\tint Case = 0;\n\tinit_r();\n\twhile (scanf(\" %s\", str + 1) == 1 && str[1] != '*') {\n\t\tCase++;\n\t\tinit_all(str);\n\t\tfor (int i = 0; i <= n; i++)\n\t\t\tfor (int j = 1; j <= 8; j++)\n\t\t\t\tdp_oct[i][j] = dp_L[i][j] = INF;\n\t\tdp_oct[0][4] = dp_L[0][3] = 0;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tif (dat[i].nt) {\n\t\t\t\tvector<pair<int, int> > vec;\n\t\t\t\tvec.push_back({(dat[i].nt - 1) / 12 + 1, Len_note[(dat[i].nt - 1) % 12]});\n\t\t\t\tif (dat[i].nt % 12 == 1 && dat[i].nt != 1) {\n\t\t\t\t\tvec.push_back({(dat[i].nt - 1) / 12, 2});\n\t\t\t\t} else if (dat[i].nt % 12 == 0 && dat[i].nt != 96) {\n\t\t\t\t\tvec.push_back({dat[i].nt / 12 + 1, 2});\n\t\t\t\t}\n\t\t\t\tfor (pair<int, int> P : vec) {\n\t\t\t\t\tint j = P.first, cst = P.second;\n\t\t\t\t\tfor (int k = 1; k <= 8; k++) if (dp_oct[i - 1][k] < INF) {\n\t\t\t\t\t\tint cur = dp_oct[i - 1][k] + min(2, abs(j - k)) + cst;\n\t\t\t\t\t\tif (dp_oct[i][j] > cur) {\n\t\t\t\t\t\t\tdp_oct[i][j] = cur;\n\t\t\t\t\t\t\tfr_oct[i][j] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int j = 1; j <= 8; j++) {\n\t\t\t\t\tfor (int k = 1; k <= 8; k++) if (dp_L[i - 1][k] < INF) {\n\t\t\t\t\t\tint cur = dp_L[i - 1][k] + (j != k ? Len_dura[j] + 1 : 0) + (dat[i].x != j ? Len_dura[dat[i].x] : 0) + dat[i].c;\n\t\t\t\t\t\tif (dp_L[i][j] > cur) {\n\t\t\t\t\t\t\tdp_L[i][j] = cur;\n\t\t\t\t\t\t\tfr_L[i][j] = k;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int j = 1; j <= 8; j++)\n\t\t\t\t\tdp_oct[i][j] = dp_oct[i - 1][j], fr_oct[i][j] = j;\n\t\t\t\tfor (int k = 1; k <= 8; k++) if (dp_L[i - 1][k] < INF) {\n\t\t\t\t\tfor (int j = 1; j <= 8; j++) {\n\t\t\t\t\t\tint cur = dp_L[i - 1][k] + calc_r(dat[i].x, k, j);\n\t\t\t\t\t\tif (dp_L[i][j] > cur) {\n\t\t\t\t\t\t\tdp_L[i][j] = cur;\n\t\t\t\t\t\t\tfr_L[i][j] = k;\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\tint x1 = 1, x2 = 1;\n\t\tfor (int i = 2; i <= 8; i++) {\n\t\t\tif (dp_oct[n][i] < dp_oct[n][x1])\n\t\t\t\tx1 = i;\n\t\t\tif (dp_L[n][i] < dp_L[n][x2])\n\t\t\t\tx2 = i;\n\t\t}\n\t\tprintf(\"Case %d: \", Case);\n\t\tfor (int i = n; i >= 1; i--) {\n\t\t\tans_oct[i] = x1;\n\t\t\tans_L[i] = x2;\n\t\t\tx1 = fr_oct[i][x1];\n\t\t\tx2 = fr_L[i][x2];\n\t\t}\n\t\tint V = 100, O = 4, L = 3;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tif (dat[i].nt) {\n\t\t\t\tif (dat[i].vol != V) {\n\t\t\t\t\tV = dat[i].vol;\n\t\t\t\t\tprintf(\"V%d\", V);\n\t\t\t\t}\n\t\t\t\tif (ans_L[i] != L) {\n\t\t\t\t\tL = ans_L[i];\n\t\t\t\t\tprintf(\"L%d\", 1 << (L - 1));\n\t\t\t\t}\n\t\t\t\tif (ans_oct[i] != O) {\n\t\t\t\t\tif (abs(ans_oct[i] - O) > 1)\n\t\t\t\t\t\tprintf(\"O%d\", ans_oct[i]);\n\t\t\t\t\telse if (ans_oct[i] < O)\n\t\t\t\t\t\tprintf(\"<\");\n\t\t\t\t\telse\n\t\t\t\t\t\tprintf(\">\");\n\t\t\t\t\tO = ans_oct[i];\n\t\t\t\t}\n\t\t\t\tprintf(\"%s\", van[dat[i].nt - (O - 1) * 12]);\n\t\t\t\tif (dat[i].x != L)\n\t\t\t\t\tprintf(\"%d\", 1 << (dat[i].x - 1));\n\t\t\t\twhile (dat[i].c--)\n\t\t\t\t\tprintf(\".\");\n\t\t\t} else {\n\t\t\t\tprint_r(dat[i].x, ans_L[i - 1], ans_L[i]);\n\t\t\t\tL = ans_L[i];\n\t\t\t}\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":6984,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2395_10851243\",\n \"code_snippet\": \"//by yjz\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#define FF first\\n#define SS second\\n#define PB push_back\\n#define MP make_pair\\n#define bged(v) (v).begin(),(v).end()\\n#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)\\ntypedef long long ll;\\nconst int Imx=2147483647;\\nconst ll Lbig=2e18;\\nconst int mod=1e9+7;\\nconst int STRLEN=100111;\\nconst int LENCNT=8;\\nconst int NOTEN=12;\\nint Slen;\\nchar S[STRLEN];\\nstruct note\\n{\\n\\tint id;//-1 for Rest id=(oct-1)*12+note_id\\n\\tint len;\\n\\tint vol;\\n\\tnote(int Id=0,int Len=0,int Vol=0){id=Id;len=Len;vol=Vol;}\\n}a[STRLEN];\\nint n;\\n\\nstring nt_tab[NOTEN+2]={\\\"B+\\\",\\\"C\\\",\\\"C+\\\",\\\"D\\\",\\\"D+\\\",\\\"E\\\",\\\"F\\\",\\\"F+\\\",\\\"G\\\",\\\"G+\\\",\\\"A\\\",\\\"A+\\\",\\\"B\\\",\\\"C-\\\"};\\nstring Sinf=\\\"******************************************************************************************\\\";\\nint get_note_cost(int oct_diff,int note_id)//oct_diff=cur_oct-note_oct\\n{\\n\\tif(note_id==-1)return 0;\\n\\tif(oct_diff==0)return nt_tab[note_id+1].size();\\n\\tif(oct_diff==-1&¬e_id==0)return nt_tab[0].size();\\n\\tif(oct_diff==1&¬e_id==NOTEN-1)return nt_tab[NOTEN+1].size();\\n\\treturn 2333;\\n}\\nstring get_note_str(int oct_diff,int note_id)\\n{\\n\\tif(note_id==-1)return \\\"\\\";\\n\\tif(oct_diff==0)return nt_tab[note_id+1];\\n\\tif(oct_diff==-1&¬e_id==0)return nt_tab[0];\\n\\tif(oct_diff==1&¬e_id==NOTEN-1)return nt_tab[NOTEN+1];\\n\\tassert(false);\\n}\\nstring dg_tab[1000];\\nstring len_tab[8][256];\\nconst int T2MX=512;\\nconst int T2MXL=512;\\nstring rest_tab[8][8][T2MX];\\npair<string,string> rest_tab2[8][8][T2MX+T2MX];\\nstring get_tab(int i,int j,int k)\\n{\\n\\tstring s=\\\"\\\";\\n\\tif(a[i].id==-1)\\n\\t{\\n\\t\\tint len=a[i].len;\\n\\t\\tstring curs=\\\"\\\";\\n\\t\\twhile(len>=T2MXL+T2MXL-1)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs.PB('R');\\n//\\t\\t\\tif(j!=LENCNT-1&&k!=LENCNT-1)s2.PB('1');\\n\\t\\t}\\n\\t\\ts=rest_tab2[j][k][len].FF+curs+rest_tab2[j][k][len].SS;\\n\\t\\twhile(len>128)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs.PB('R');\\n\\t\\t\\tif(rest_tab2[j][k][len].FF.size()+curs.size()+rest_tab2[j][k][len].SS.size()<s.size())\\n\\t\\t\\t{\\n\\t\\t\\t\\ts=rest_tab2[j][k][len].FF+curs+rest_tab2[j][k][len].SS;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tlen=a[i].len;\\n\\t\\tcurs=\\\"\\\";\\n\\t\\twhile(len>=T2MXL)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs.PB('R');\\n\\t\\t\\tcurs.PB('1');\\n\\t\\t}\\n\\t\\tcurs+=rest_tab[j][k][len];\\n\\t\\tif(curs.size()<s.size())s=curs;\\n\\t}\\n\\telse\\n\\t{\\n\\t\\ts=len_tab[j][a[i].len]+(j==k?\\\"\\\":\\\"L\\\"+dg_tab[1<<(7-k)]);\\n\\t}\\n\\treturn s;\\n}\\nint get_tab_cost(int i,int j,int k)\\n{\\n\\tint ret=0;\\n\\tif(a[i].id==-1)\\n\\t{\\n\\t\\tint len=a[i].len;\\n\\t\\tint curs=0;\\n\\t\\twhile(len>=T2MXL+T2MXL-1)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs++;\\n\\t\\t}\\n\\t\\tret=rest_tab2[j][k][len].FF.size()+curs+rest_tab2[j][k][len].SS.size();\\n\\t\\twhile(len>128)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs++;\\n\\t\\t\\tret=min(ret,int(rest_tab2[j][k][len].FF.size()+curs+rest_tab2[j][k][len].SS.size()));\\n\\t\\t}\\n\\t\\tlen=a[i].len;\\n\\t\\tcurs=0;\\n\\t\\twhile(len>=T2MXL)\\n\\t\\t{\\n\\t\\t\\tlen-=128;\\n\\t\\t\\tcurs+=2;\\n\\t\\t}\\n\\t\\tcurs+=rest_tab[j][k][len].size();\\n\\t\\tret=min(ret,curs);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tret=len_tab[j][a[i].len].size()+(j==k?0:1+dg_tab[1<<(7-k)].size());\\n\\t}\\n\\treturn ret;\\n}\\nvoid initialize_cost()\\n{\\n\\tfor(int i=1;i<1000;i++)\\n\\t{\\n\\t\\tint x=i;\\n\\t\\tdg_tab[i]=\\\"\\\";\\n\\t\\twhile(x)\\n\\t\\t{\\n\\t\\t\\tdg_tab[i].PB('0'+x%10);\\n\\t\\t\\tx/=10;\\n\\t\\t}\\n\\t\\treverse(dg_tab[i].begin(),dg_tab[i].end());\\n\\t}\\n\\tfor(int t=0;t<8;t++)for(int i=1;i<=255;i++)len_tab[t][i]=Sinf;\\n\\tfor(int t=0;t<8;t++)\\n\\t{\\n\\t\\tfor(int i=1;i<=128;i<<=1)\\n\\t\\t{\\n\\t\\t\\tstring cur=(i==(1<<t))?\\\"\\\":dg_tab[128/i];\\n\\t\\t\\tint len=i,bs=i;\\n\\t\\t\\twhile(bs>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlen_tab[t][len]=cur;\\n\\t\\t\\t\\tcur.PB('.');\\n\\t\\t\\t\\tbs>>=1;\\n\\t\\t\\t\\tlen+=bs;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<T2MX;i++)\\n\\t{\\n\\t\\tfor(int s=0;s<8;s++)\\n\\t\\t{\\n\\t\\t\\tfor(int t=0;t<8;t++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstring &S=rest_tab[s][t][i];\\n\\t\\t\\t\\tS=Sinf;\\n\\t\\t\\t\\tfor(int j=1;j<=i&&j<256;j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(rest_tab[s][t][i-j].size()+1+len_tab[t][j].size()<S.size())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tS=rest_tab[s][t][i-j]+\\\"R\\\"+len_tab[t][j];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(i==0&&s==t)S=\\\"\\\";\\n\\t\\t\\t}\\n\\t\\t\\tfor(int t=0;t<8;t++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstring &S=rest_tab[s][t][i];\\n\\t\\t\\t\\tstring tmp=\\\"L\\\"+dg_tab[1<<(7-t)];\\n\\t\\t\\t\\tfor(int pt=0;pt<8;pt++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(rest_tab[s][pt][i].size()+tmp.size()<S.size())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tS=rest_tab[s][pt][i]+tmp;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<T2MXL+T2MXL-1;i++)\\n\\t{\\n\\t\\tfor(int s=0;s<8;s++)\\n\\t\\t{ \\n\\t\\t\\tfor(int t=0;t<8;t++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tpair<string,string> &S=rest_tab2[s][t][i];\\n\\t\\t\\t\\tS=MP(Sinf,Sinf);\\n\\t\\t\\t\\tfor(int j=0;j<=i&&j<T2MX;j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(i-j<T2MX)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(rest_tab[s][7][j].size()+rest_tab[7][t][i-j].size()<S.FF.size()+S.SS.size())\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tS=MP(rest_tab[s][7][j],rest_tab[7][t][i-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\\t}\\n\\t/*\\n\\tfor(int i=1;i<T2MX;i++)\\n\\t{\\t\\n\\t\\tfor(int j=0;j<=i;j++)\\n\\t\\t{\\n\\t\\t\\tfor(int v=0;v<8;v++)\\n\\t\\t\\t{\\t\\n\\t\\t\\t\\tfor(int s=0;s<8;s++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int t=0;t<8;t++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tassert(rest_tab[s][v][j].size()+rest_tab[v][t][i-j].size()>=rest_tab[s][t][i].size());\\n\\t\\t\\t\\t\\t\\tif(rest_tab[s][v][j].size()+rest_tab[v][t][i-j].size()<rest_tab[s][t][i].size())\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\trest_tab[s][t][i]=rest_tab[s][v][j]+rest_tab[v][t][i-j];\\n//\\t\\t\\t\\t\\t\\t\\tcerr<<s<<\\\" \\\"<<t<<\\\" \\\"<<i<<\\\":\\\"<<rest_tab2[s][t][i]<<endl;\\n//\\t\\t\\t\\t\\t\\t\\tcerr<<v<<\\\" \\\"<<j<<\\\":\\\"<<rest_tab2[s][v][j]<<\\\" + \\\"<<rest_tab2[v][t][i-j]<<endl;\\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\\nint note_chtoid[7]={9,11,0,2,4,5,7};\\nnote make_note(int oct,char note_ch,int dlt,int len,int vol)\\n{\\n\\treturn note((oct-1)*NOTEN+note_chtoid[note_ch-'A']+dlt,len,vol);\\n}\\nint get_num(char s[],int &it)\\n{\\n\\tint ret=0;\\n\\twhile(s[it]>='0'&&s[it]<='9')ret=ret*10+s[it]-'0',it++;\\n\\treturn ret;\\n}\\nint get_len(char s[],int &it,int Gdl=0)\\n{\\n\\tint bs=get_num(s,it);\\n\\tif(bs==0&&Gdl==0)return 0;\\n\\tif(bs==0)bs=Gdl;else bs=128/bs;\\n\\tint ret=bs;\\n\\twhile(s[it]=='.')bs/=2,ret+=bs,it++;\\n\\treturn ret;\\n}\\nvoid initialize()\\n{\\n\\tint oc=0;\\n\\tn=0;\\n\\tfor(int i=0;i<STRLEN;i++)a[i]=note(0,0,0);\\n\\tSlen=strlen(S+1);\\n\\tS[Slen+1]='\\\\n';\\n\\tint Goct=4,Gvol=100,Gdl=32;\\n\\tfor(int i=1;i<=Slen;i++)\\n\\t{\\n//\\t\\tcerr<<\\\"i=\\\"<<i<<\\\" Goct=\\\"<<Goct<<\\\" Gvol=\\\"<<Gvol<<\\\" \\\"<<S[i]<<endl;\\n\\t\\tif(S[i]>='A'&&S[i]<='G')\\n\\t\\t{\\n\\t\\t\\tchar note_ch=S[i];\\n\\t\\t\\tint dlt=0;\\n\\t\\t\\ti++;oc++;\\n\\t\\t\\tif(S[i]=='+')dlt=1,i++,oc++;\\n\\t\\t\\tif(S[i]=='-')dlt=-1,i++,oc++;\\n\\t\\t\\tint len=get_len(S,i,Gdl);\\n\\t\\t\\ta[++n]=make_note(Goct,note_ch,dlt,len,Gvol);\\n\\t\\t\\ti--;\\n\\t\\t}\\n\\t\\tif(S[i]=='R')\\n\\t\\t{\\n\\t\\t\\ti++;\\n\\t\\t\\tint len=get_len(S,i,Gdl);\\n\\t\\t\\tif(n>0&&a[n].id==-1)a[n].len+=len;\\n\\t\\t\\telse a[++n]=note(-1,len,-1);\\n\\t\\t\\ti--;\\n\\t\\t}\\n\\t\\tif(S[i]=='L')\\n\\t\\t{\\n\\t\\t\\ti++;\\n\\t\\t\\tint len=get_len(S,i);\\n\\t\\t\\tassert((len&(-len))==len);\\n\\t\\t\\tGdl=len;\\n\\t\\t\\ti--;\\n\\t\\t}\\n\\t\\tif(S[i]=='V')\\n\\t\\t{\\n\\t\\t\\ti++;\\n\\t\\t\\tint len=get_num(S,i);\\n\\t\\t\\tGvol=len;\\n\\t\\t\\ti--;\\n\\t\\t}\\n\\t\\tif(S[i]=='>')Goct++,oc++;\\n\\t\\tif(S[i]=='<')Goct--,oc++;\\n\\t\\tif(S[i]=='O')\\n\\t\\t{\\n\\t\\t\\ti++;oc+=2;\\n\\t\\t\\tGoct=S[i]-'0';\\n\\t\\t}\\n\\t}\\n//\\tcerr<<\\\"oc=\\\"<<oc<<endl;\\n}\\nint w[STRLEN][LENCNT][LENCNT];\\nint dp[STRLEN][LENCNT];\\nint pre[STRLEN][LENCNT];\\nvoid solve_lencost()\\n{\\n\\tmemset(w,0,sizeof(w));\\n//\\tcerr<<\\\"solve_lencost:\\\"<<endl;\\n\\tfor(int i=1;i<=n;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<LENCNT;j++)for(int k=0;k<LENCNT;k++)w[i][j][k]=get_tab_cost(i,j,k);\\n\\t}\\n\\tmemset(dp,31,sizeof(dp));\\n\\tmemset(pre,0,sizeof(pre));\\n\\tfor(int i=0;i<LENCNT;i++)dp[0][i]=1+dg_tab[(1<<(7-i))].size();\\n\\tdp[0][5]=0;\\n\\tfor(int i=0;i<n;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<LENCNT;j++)\\n\\t\\t{\\n\\t\\t\\tfor(int t=0;t<LENCNT;t++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(dp[i][j]+w[i+1][j][t]<dp[i+1][t])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdp[i+1][t]=dp[i][j]+w[i+1][j][t];\\n\\t\\t\\t\\t\\tpre[i+1][t]=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint oct_dp[STRLEN][8];\\nint oct_pre[STRLEN][8];\\nvoid solve_octcost()\\n{\\n//\\tcerr<<\\\"solve_octcost:\\\"<<endl;\\n\\tmemset(oct_dp,31,sizeof(oct_dp));\\n\\tmemset(oct_pre,0,sizeof(oct_pre));\\n\\toct_dp[0][3]=0;oct_pre[0][3]=-1;\\n\\tfor(int i=0;i<=n;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<8;j++)\\n\\t\\t{\\n\\t\\t\\tfor(int k=0;k<8;k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cost=2-(abs(j-k)==1);\\n\\t\\t\\t\\tif(oct_dp[i][j]>oct_dp[i][k]+cost)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\toct_dp[i][j]=oct_dp[i][k]+cost;\\n\\t\\t\\t\\t\\toct_pre[i][j]=k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(i<n)\\n\\t\\t{\\n\\t\\t\\tfor(int j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\toct_dp[i+1][j]=oct_dp[i][j]+get_note_cost(j-a[i+1].id/12,a[i+1].id%12);\\n\\t\\t\\t\\toct_pre[i+1][j]=-1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid print_ans()\\n{\\n/*\\tcerr<<\\\"print_ans:\\\"<<endl;\\n\\tfor(int i=0;i<=n;i++){for(int j=0;j<8;j++)cerr<<dp[i][j]<<\\\",\\\"<<pre[i][j]<<\\\" \\\";cerr<<endl;}cerr<<endl;\\n\\tfor(int i=0;i<=n;i++){for(int j=0;j<8;j++)cerr<<oct_dp[i][j]<<\\\",\\\"<<oct_pre[i][j]<<\\\" \\\";cerr<<endl;}cerr<<endl;\\n*/\\t\\n\\tstatic string ANS[STRLEN];\\n\\tfor(int i=0;i<=n;i++)ANS[i].clear();\\n\\tint COST=0;\\n\\t//OctCost\\n\\tint x=n,y=0;\\n\\tfor(int i=0;i<8;i++)if(oct_dp[x][i]<oct_dp[x][y])y=i;\\n//\\tcerr<<\\\"OctCost=\\\"<<oct_dp[x][y]<<endl;\\n\\tCOST+=oct_dp[x][y];\\n\\twhile(x>0||oct_pre[x][y]!=-1)\\n\\t{\\n\\t\\tif(oct_pre[x][y]==-1)\\n\\t\\t{\\n\\t\\t\\tANS[x]+=get_note_str(y-a[x].id/12,a[x].id%12);\\n\\t\\t\\tx--;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\ty=oct_pre[x][y];\\n\\t\\t}\\n\\t}\\n\\t//LenCost\\n\\tx=n,y=0;\\n\\tfor(int i=0;i<8;i++)if(dp[x][i]<dp[x][y])y=i;\\n\\tCOST+=dp[x][y];\\n\\twhile(x>0)\\n\\t{\\n\\t\\tANS[x]+=get_tab(x,pre[x][y],y);\\n\\t\\ty=pre[x][y];\\n\\t\\tx--;\\n\\t}\\n\\tif(y!=5)ANS[0]+=\\\"L\\\"+dg_tab[1<<(7-y)];\\n\\t//OctCost2\\n\\tx=n,y=0;\\n\\tfor(int i=0;i<8;i++)if(oct_dp[x][i]<oct_dp[x][y])y=i;\\n\\twhile(x>0||oct_pre[x][y]!=-1)\\n\\t{\\n\\t\\tif(oct_pre[x][y]==-1)\\n\\t\\t{\\n\\t\\t\\tx--;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif(oct_pre[x][y]==y-1)ANS[x]+=\\\">\\\";\\n\\t\\t\\telse if(oct_pre[x][y]==y+1)ANS[x]+=\\\"<\\\";\\n\\t\\t\\telse ANS[x]+=\\\"O\\\"+dg_tab[y+1];\\n\\t\\t\\ty=oct_pre[x][y];\\n\\t\\t}\\n\\t}\\n\\n\\t//VolCost\\n\\tint Gvol=100;\\n\\tfor(int i=1;i<=n;i++)\\n\\t{\\n\\t\\tif(a[i].id!=-1&&a[i].vol!=Gvol)\\n\\t\\t{\\n\\t\\t\\tANS[i-1].PB('V');\\n\\t\\t\\tANS[i-1]+=dg_tab[a[i].vol];\\n\\t\\t\\tGvol=a[i].vol;\\n\\t\\t\\tCOST+=1+dg_tab[a[i].vol].size();\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<=n;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<ANS[i].size();j++)putchar(ANS[i][j]);\\n\\t}\\n\\tputs(\\\"\\\");\\n//\\tcerr<<\\\"COST=\\\"<<COST<<endl;\\n}\\nvoid debug()\\n{\\n\\tcerr<<\\\"n=\\\"<<n<<endl;\\n\\tfor(int i=1;i<=n;i++)\\n\\t{\\n\\t\\tcerr<<a[i].id<<\\\" \\\"<<a[i].len<<\\\" \\\"<<a[i].vol<<endl;\\n\\t}\\n}\\nvoid solve()\\n{\\n\\tsolve_lencost();\\n\\tsolve_octcost();\\n\\tprint_ans();\\n}\\nvoid test_cost()\\n{\\n\\tfor(int i=0;i<T2MX;i++)\\n\\t{\\n\\t\\ta[1]=note(-1,i,-1);\\n\\t\\tfor(int s=0;s<8;s++)\\n\\t\\t{\\n\\t\\t\\tfor(int t=0;t<8;t++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint gt=get_tab_cost(1,s,t);\\n\\t\\t\\t\\tint tb=rest_tab[s][t][i].size();\\n\\t\\t\\t\\tif(gt!=tb)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcerr<<i<<\\\" \\\"<<s<<\\\" \\\"<<t<<endl;\\n\\t\\t\\t\\t\\tcerr<<\\\"gt=\\\"<<gt<<\\\" tb=\\\"<<tb<<endl;\\n\\t\\t\\t\\t\\tcerr<<get_tab(1,s,t)<<endl;\\n\\t\\t\\t\\t\\tcerr<<rest_tab[s][t][i]<<endl;\\n\\t\\t\\t\\t\\texit(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint main()\\n{\\n\\tinitialize_cost();\\n\\ttest_cost();\\n//\\tcerr<<rest_tab[5][7][48]<<\\\" \\\"<<rest_tab[7][1][3]<<endl;\\n\\tint tn=0;\\n\\twhile(true)\\n\\t{\\n\\t\\tscanf(\\\"%s\\\",S+1);\\n\\t\\tif(S[1]=='*')break;\\n\\t\\tprintf(\\\"Case %d: \\\",++tn);\\n\\t\\tinitialize();\\n///\\t\\tcerr<<get_tab(1,5,1)<<endl;\\n//\\t\\tdebug();\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 68288,\n \"score_of_the_acc\": -1.0352,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2395_8794884\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define pb push_back\\n#define sz(a) ((int)a.size())\\n#define re return\\n#define all(a) a.begin(),a.end()\\n#define rept(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,a) rept(i,0,a)\\n#define vi vector<int>\\n#define pii pair<int,int>\\n#define F first\\n#define S second\\n#define debug(x) cout<<#x<<\\\"=\\\"<<x<<\\\"\\\\n\\\";\\n#define int long long\\nusing namespace std;\\nconst int MOD=998244353,INF=1000000000000000000;\\ntemplate<typename T>inline void Mx(T &a,T b){a=max(a,b);}\\ntemplate<typename T>inline void Mi(T &a,T b){a=min(a,b);}\\n\\nstruct OP{\\n\\tint t,x,y,z;\\n\\tOP(int _t,int _x,int _y=0,int _z=0){\\n\\t\\tt=_t,x=_x,y=_y,z=_z;\\n\\t}\\n};\\n\\nint Case;\\nvector<OP>S;\\nint cur_oct,cur_vol,cur_def;\\nint getint(string);\\nint get_dot_number(string);\\nstring to_str(int);\\nvoid ReadStr(string);\\n\\nstring STR;\\nvoid pre();\\nstring get_R(int,int,int);\\nvoid run1();\\nvoid run2();\\nvoid run3();\\nvoid run4();\\nvoid run5();\\n\\nvoid run(){\\n\\trun1();\\n\\trun2();\\n\\trun3();\\n\\trun4();\\n\\trun5();\\n}\\nsigned main()\\n{\\n//\\tios::sync_with_stdio(0);\\n//\\tcin.tie(0);cout.tie(0);\\n\\tpre();\\n\\twhile(cin>>STR)run();\\n\\tre 0;\\n}\\n\\n/////////////////////////////////////////\\n\\nint getint(string s){\\n\\tint x=0;\\n\\trep(i,sz(s))if(isdigit(s[i]))x=x*10+s[i]-'0';\\n\\tre x;\\n}\\nint get_dot_number(string s){\\n\\tint x=0;\\n\\trep(i,sz(s))if(s[i]=='.')x++;\\n\\tre x;\\n}\\nstring to_str(int x){\\n\\tstring s=\\\"\\\";\\n\\twhile(x){\\n\\t\\ts+='0'+x%10;\\n\\t\\tx/=10;\\n\\t}\\n\\treverse(all(s));\\n\\tre s;\\n}\\nvoid ReadStr(string s){\\n\\tif(s==\\\"\\\")re;\\n\\t//octave\\n\\tif(s==\\\"<\\\"){\\n\\t\\tcur_oct--;\\n\\t\\tre;\\n\\t}\\n\\tif(s==\\\">\\\"){\\n\\t\\tcur_oct++;\\n\\t\\tre;\\n\\t}\\n\\tif(s[0]=='O'){\\n\\t\\tcur_oct=s[1]-'0'-1;\\n\\t\\tre;\\n\\t}\\n\\t//volume\\n\\tif(s[0]=='V'){\\n\\t\\tint x=getint(s);\\n\\t\\tif(x!=cur_vol){\\n\\t\\t\\tcur_vol=x;\\n\\t\\t\\tS.pb(OP(2,x));\\n\\t\\t}\\n\\t\\tre;\\n\\t}\\n\\t//default\\n\\tif(s[0]=='L'){\\n\\t\\tcur_def=getint(s);\\n\\t\\tre;\\n\\t}\\n\\t//rest\\n\\tif(s[0]=='R'){\\n\\t\\tint xx=getint(s);\\n\\t\\tif(!xx)xx=cur_def;\\n\\t\\tint x=128/xx,y=x,z=get_dot_number(s);\\n\\t\\trep(i,z)y/=2,x+=y;\\n\\t\\tS.pb(OP(1,x));\\n\\t\\tre;\\n\\t}\\n\\t//note\\n\\tint l=0;\\n\\twhile(l<sz(s)&&!isdigit(s[l]))l++;\\n\\tint h=cur_oct*12;\\n\\tif(s[0]=='D')h+=2;\\n\\tif(s[0]=='E')h+=4;\\n\\tif(s[0]=='F')h+=5;\\n\\tif(s[0]=='G')h+=7;\\n\\tif(s[0]=='A')h+=9;\\n\\tif(s[0]=='B')h+=11;\\n\\tif(l>1&&s[1]=='-')h--;\\n\\tif(l>1&&s[1]=='+')h++;\\n\\tint x=getint(s),y=get_dot_number(s);\\n\\tif(x==0)x=cur_def;\\n\\tS.pb(OP(0,h,x,y));\\n}\\n\\n//////////////////////////////////////////////////\\n\\nconst int BL=4096;\\nstring dp_R[8][8][BL];\\n\\nvoid Mi_str(string &ss,string tt){\\n\\tif(ss==\\\"~\\\")ss=tt;\\n\\tif(sz(ss)>sz(tt))ss=tt;\\n}\\nvoid pre(){\\n\\trep(i,8)rep(j,8)rep(k,BL)dp_R[i][j][k]=\\\"~\\\";\\n\\trep(i,8)dp_R[i][i][0]=\\\"\\\";\\n\\trep(i,8){\\n\\t\\trep(j,BL){\\n\\t\\t\\trep(k,8){\\n\\t\\t\\t\\tif(dp_R[i][k][j]==\\\"~\\\")continue;\\n\\t\\t\\t\\t//add L*\\n\\t\\t\\t\\trep(l,8){\\n\\t\\t\\t\\t\\tMi_str(dp_R[i][l][j],dp_R[i][k][j]+\\\"L\\\"+to_str(1<<(l^7)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trep(k,8){\\n\\t\\t\\t\\t//add R*\\n\\t\\t\\t\\trep(l,8){\\n\\t\\t\\t\\t\\tstring cur=\\\"R\\\";\\n\\t\\t\\t\\t\\tif(l!=k)cur+=to_str(1<<(l^7));\\n\\t\\t\\t\\t\\tint len=0;\\n\\t\\t\\t\\t\\tfor(int m=l;m>=0;m--){\\n\\t\\t\\t\\t\\t\\tlen+=1<<m;\\n\\t\\t\\t\\t\\t\\tif(j+len>=BL)break;\\n\\t\\t\\t\\t\\t\\tMi_str(dp_R[i][k][j+len],dp_R[i][k][j]+cur);\\n\\t\\t\\t\\t\\t\\tcur+=\\\".\\\";\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n//\\trep(i,BL)rep(x,8)rep(y,8)cout<<x<<\\\" \\\"<<i<<\\\" \\\"<<y<<\\\" \\\"<<dp_R[x][y][i]<<\\\"\\\\n\\\";\\n}\\nstring get_R(int x,int y,int len){\\n\\tif(len<=BL)re dp_R[x][y][len];\\n\\tint mid=(len-BL+127)/128;\\n\\tpii mi={INF,-1};\\n\\trept(i,BL/2,BL/2+128)Mi(mi,{sz(dp_R[x][7][len-mid*128-i])+sz(dp_R[7][y][i]),i});\\n\\tre dp_R[x][7][len-mid*128-mi.S]+string(mid,'R')+dp_R[7][y][mi.S];\\n}\\n\\n//////////////////////////////////\\n\\n//init\\nvoid run1(){\\n\\tif(STR==\\\"*\\\")exit(0);\\n\\tcur_oct=3;\\n\\tcur_vol=100;\\n\\tcur_def=4;\\n}\\n//cut&decode\\nvoid run2(){\\n\\tS.clear();\\n\\tstring t=\\\"\\\";\\n\\trep(i,sz(STR)){\\n\\t\\tif(isupper(STR[i])||STR[i]=='<'||STR[i]=='>'){\\n\\t\\t\\tReadStr(t);\\n\\t\\t\\tt=\\\"\\\";\\n\\t\\t}\\n\\t\\tt+=STR[i];\\n\\t}\\n\\tReadStr(t);\\n}\\n//swap&merge\\nvoid run3(){\\n\\tvector<OP>S2;\\n\\tfor(int l=0,r;l<sz(S);l=r){\\n\\t\\tr=l;\\n\\t\\tif(S[l].t==1){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\twhile(r<sz(S)&&S[r].t==1)sum+=S[r++].x;\\n\\t\\t\\tS2.pb(OP(1,sum));\\n\\t\\t}\\n\\t\\telse if(S[l].t==0){\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tS2.pb(S[l]);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tbool ok=0;\\n\\t\\t\\twhile(r<sz(S)){\\n\\t\\t\\t\\tif(S[r].t==0){\\n\\t\\t\\t\\t\\tok=1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(S[r].t==2)break;\\n\\t\\t\\t\\tr++;\\n\\t\\t\\t}\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tif(ok)S2.pb(S[l]); \\n\\t\\t}\\n\\t}\\n\\tS=S2;\\n\\trep(i,sz(S)-1){\\n\\t\\tif(S[i].t==2&&S[i+1].t==1)swap(S[i],S[i+1]);\\n\\t}\\n\\tS2.clear();\\n\\tfor(int l=0,r;l<sz(S);l=r){\\n\\t\\tr=l;\\n\\t\\tif(S[l].t==1){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\twhile(r<sz(S)&&S[r].t==1)sum+=S[r++].x;\\n\\t\\t\\tS2.pb(OP(1,sum));\\n\\t\\t}\\n\\t\\telse if(S[l].t==0){\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tS2.pb(S[l]);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tbool ok=0;\\n\\t\\t\\twhile(r<sz(S)){\\n\\t\\t\\t\\tif(S[r].t==0){\\n\\t\\t\\t\\t\\tok=1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(S[r].t==2)break;\\n\\t\\t\\t\\tr++;\\n\\t\\t\\t}\\n\\t\\t\\tr=l+1;\\n\\t\\t\\tif(ok)S2.pb(S[l]); \\n\\t\\t}\\n\\t}\\n\\tS=S2;\\n//\\trep(i,sz(S)){\\n//\\t\\tif(S[i].t==0){\\n//\\t\\t\\tcout<<\\\"Note \\\"<<S[i].x<<\\\" \\\"<<S[i].y<<\\\" \\\"<<S[i].z<<'\\\\n';\\n//\\t\\t}\\n//\\t\\telse if(S[i].t==1){\\n//\\t\\t\\tcout<<\\\"Rest \\\"<<S[i].x<<'\\\\n';\\n//\\t\\t}\\n//\\t\\telse{\\n//\\t\\t\\tcout<<\\\"Volume \\\"<<S[i].x<<\\\"\\\\n\\\";\\n//\\t\\t}\\n//\\t}\\n}\\n\\n//dp\\npair<int,pii>DP[100005][8][8];//(pos,def,oct)->(len,trans,from)\\nvector<string>vecS;\\nint n;\\nvoid run4(){\\n\\tn=sz(S);\\n\\trep(i,n+1)rep(j,8)rep(k,8)DP[i][j][k]={INF,{-1,-1}};\\n\\tvecS.clear();\\n\\tDP[0][5][3]={0,{0,0}};\\n\\tint lstV=100;\\n\\trep(i,n){\\n\\t\\tif(S[i].t==2){\\n\\t\\t\\tstring cs=\\\"\\\";\\n\\t\\t\\tif(lstV!=S[i].x)cs=\\\"V\\\"+to_str(lstV=S[i].x);\\n\\t\\t\\trep(j,8)rep(k,8)if(DP[i][j][k].F<INF)Mi(DP[i+1][j][k],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\\n\\t\\t\\tvecS.pb(cs);\\n\\t\\t}\\n\\t\\tif(S[i].t==1){\\n\\t\\t\\trep(j,8)rep(l,8){\\n\\t\\t\\t\\tstring cs=get_R(j,l,S[i].x);\\n\\t\\t\\t\\tbool use=0;\\n\\t\\t\\t\\trep(k,8){\\n\\t\\t\\t\\t\\tif(DP[i][j][k].F<INF){\\n\\t\\t\\t\\t\\t\\tuse=1;\\n\\t\\t\\t\\t\\t\\tMi(DP[i+1][l][k],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(use)vecS.pb(cs);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(S[i].t==0){\\n\\t\\t\\tstring GO[14]={\\\"C-\\\",\\\"C\\\",\\\"C+\\\",\\\"D\\\",\\\"D+\\\",\\\"E\\\",\\\"F\\\",\\\"F+\\\",\\\"G\\\",\\\"G+\\\",\\\"A\\\",\\\"A+\\\",\\\"B\\\",\\\"B+\\\"};\\n\\t\\t\\tvector<pii>ch_O;\\n\\t\\t\\tint h=S[i].x;\\n\\t\\t\\tch_O.pb({h/12,h%12+1});\\n\\t\\t\\tif(h%12==0&&h!=0)ch_O.pb({h/12-1,13});\\n\\t\\t\\tif(h%12==11&&h!=95)ch_O.pb({h/12+1,0});\\n\\t\\t\\trep(j,8)rep(k,8){\\n\\t\\t\\t\\tif(DP[i][j][k].F>=INF)continue;\\n\\t\\t\\t\\tfor(pii l:ch_O){\\n\\t\\t\\t\\t\\tstring pf=\\\"\\\";\\n\\t\\t\\t\\t\\tif(k==l.F+1)pf=\\\"<\\\";\\n\\t\\t\\t\\t\\telse if(k==l.F-1)pf=\\\">\\\";\\n\\t\\t\\t\\t\\telse if(k!=l.F)pf=\\\"O\\\"+string(1,'0'+l.F+1);\\n\\t\\t\\t\\t\\tif((1<<(j^7))==S[i].y){\\n\\t\\t\\t\\t\\t\\tstring cs=pf+GO[l.S]+string(S[i].z,'.');\\n\\t\\t\\t\\t\\t\\tMi(DP[i+1][j][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\\n\\t\\t\\t\\t\\t\\tvecS.pb(cs);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif((1<<(j^7))!=S[i].y){\\n\\t\\t\\t\\t\\t\\t//use\\n\\t\\t\\t\\t\\t\\tstring cs=pf+\\\"L\\\"+to_str(S[i].y)+GO[l.S]+string(S[i].z,'.');\\n\\t\\t\\t\\t\\t\\tMi(DP[i+1][__lg(S[i].y)^7][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\\n\\t\\t\\t\\t\\t\\tvecS.pb(cs);\\n\\t\\t\\t\\t\\t\\tcs=pf+GO[l.S]+to_str(S[i].y)+string(S[i].z,'.');\\n\\t\\t\\t\\t\\t\\tMi(DP[i+1][j][l.F],{DP[i][j][k].F+sz(cs),{sz(vecS),j<<3|k}});\\n\\t\\t\\t\\t\\t\\tvecS.pb(cs);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n//\\trep(i,n+1)rep(j,8)rep(k,8)if(DP[i][j][k].F<INF){\\n//\\t\\tcout<<DP[i][j][k].F<<\\\" \\\"<<vecS[DP[i][j][k].S.F]<<\\\" \\\"<<(DP[i][j][k].S.S>>3)<<\\\" \\\"<<(DP[i][j][k].S.S&7)<<\\\"\\\\n\\\";\\n//\\t}\\n}\\n//restore answer&output\\nvoid run5(){\\n\\tpair<int,pii>p={INF,{-1,-1}};\\n\\trep(i,8)rep(j,8)Mi(p,{DP[n][i][j].F,{i,j}});\\n\\tint x=p.S.F,y=p.S.S;\\n\\tvi v;\\n\\tfor(int i=n;i;i--){\\n\\t\\tv.pb(DP[i][x][y].S.F);\\n\\t\\tint t=DP[i][x][y].S.S;\\n\\t\\tx=t>>3;\\n\\t\\ty=t&7;\\n\\t}\\n\\treverse(all(v));\\n\\tassert(sz(v)==n);\\n\\tcout<<\\\"Case \\\"<<++Case<<\\\": \\\";\\n\\tfor(int i:v)cout<<vecS[i];\\n\\tcout<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1030,\n \"memory_kb\": 69460,\n \"score_of_the_acc\": -1.3309,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2395_7215642\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define INF 1000000000\\n#define LINF 1000000000000000000\\n#define MOD 1000000007\\n#define mod 998244353\\n#define F first\\n#define S second\\n#define ll int\\n#define N 100010\\nusing namespace std;\\nll num_len(ll x)\\n{\\n\\tif(x==0)\\n\\t{\\n\\t\\treturn 1;\\n\\t}\\n\\tll ret=0;\\n\\twhile(x)\\n\\t{\\n\\t\\tret++;\\n\\t\\tx/=10;\\n\\t}\\n\\treturn ret;\\n}\\nstruct Note{\\n\\tll num,cr,vl,len;\\n};\\nmap<string,ll> ntid;\\nstring ntnm[]={\\\"C\\\",\\\"C+\\\",\\\"D\\\",\\\"D+\\\",\\\"E\\\",\\\"F\\\",\\\"F+\\\",\\\"G\\\",\\\"G+\\\",\\\"A\\\",\\\"A+\\\",\\\"B\\\"};\\nstring s;\\nvector<Note> nts;\\nll dp[N][9][8],rstval[8][10010][8];\\npair<ll,ll> trsrst[8][10010][8];\\npair<ll,pair<ll,ll> > trs[N][9][8];\\nll calclen(string t,ll curlen)\\n{\\n\\tll num=0,ret=0,i;\\n\\twhile((!t.empty())&&isdigit(t[0]))\\n\\t{\\n\\t\\tnum=num*10+t[0]-'0';\\n\\t\\tt.erase(t.begin());\\n\\t}\\n\\tif(num==0)\\n\\t{\\n\\t\\tnum=curlen;\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tnum=128/num;\\n\\t}\\n\\tfor(i=0;i<=t.size();i++)\\n\\t{\\n\\t\\tret+=num;\\n\\t\\tnum/=2;\\n\\t}\\n\\treturn ret;\\n}\\nvoid printrst(ll l0,ll x,ll l1)\\n{\\n\\tif(x==-1)\\n\\t{\\n\\t\\treturn;\\n\\t}\\n\\tll lstx=trsrst[l0][x][l1].F,lstl=trsrst[l0][x][l1].S,j,k;\\n\\tprintrst(l0,lstx,lstl);\\n\\tif(lstx==x)\\n\\t{\\n\\t\\tprintf(\\\"L%d\\\",128/(1<<l1));\\n\\t\\treturn;\\n\\t}\\n\\tif(lstx==-1)\\n\\t{\\n\\t\\treturn;\\n\\t}\\n\\tbool ok=false;\\n\\tfor(j=0;j<8;j++)\\n\\t{\\n\\t\\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\\n\\t\\tfor(k=0;curval;k++,curval>>=1)\\n\\t\\t{\\n\\t\\t\\tsum+=curval;\\n\\t\\t\\tif(sum==x-lstx)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll nv=cur*(j!=l1)+k+1;\\n\\t\\t\\t\\tif(rstval[l0][x][l1]==rstval[l0][lstx][lstl]+nv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tputchar('R');\\n\\t\\t\\t\\t\\tif(j!=l1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%d\\\",128/(1<<j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\twhile(k--)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tputchar('.');\\n\\t\\t\\t\\t\\t}\\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}\\n\\t\\tif(ok)\\n\\t\\t{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\nvoid print(ll x,ll cr,ll len)\\n{\\n\\tif(x==-1)\\n\\t{\\n\\t\\treturn;\\n\\t}\\n\\tll lstx=trs[x][cr][len].F,lstcr=trs[x][cr][len].S.F,lstlen=trs[x][cr][len].S.S;\\n\\tbool pvol=false;\\n\\tif(lstx>=INF)\\n\\t{\\n\\t\\tlstx-=INF,lstcr-=INF,lstlen-=INF;\\n\\t\\tpvol=true;\\n\\t}\\n\\tprint(lstx,lstcr,lstlen);\\n\\tif(lstx==-1)\\n\\t{\\n\\t\\treturn;\\n\\t}\\n\\tif(x==lstx)\\n\\t{\\n\\t\\tif(cr==lstcr)\\n\\t\\t{\\n\\t\\t\\tprintf(\\\"L%d\\\",128/(1<<len));\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif(cr==lstcr+1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tputchar('>');\\n\\t\\t\\t}\\n\\t\\t\\telse if(cr==lstcr-1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tputchar('<');\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tprintf(\\\"O%d\\\",cr);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tif(nts[x-1].num==INF)\\n\\t{\\n\\t\\tll cur=nts[x-1].len,req;\\n\\t\\tif(!pvol)\\n\\t\\t{\\n\\t\\t\\treq=(cur<10000)?0:(cur-10000+(1<<lstlen)+50)/(1<<lstlen);\\n\\t\\t\\tcur-=req*(1<<lstlen);\\n\\t\\t\\twhile(req--)\\n\\t\\t\\t{\\n\\t\\t\\t\\tputchar('R');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\treq=(cur<10000)?0:(cur-10000+(1<<len)+50)/(1<<len);\\n\\t\\t\\tcur-=req*(1<<len);\\n\\t\\t}\\n\\t\\tprintrst(lstlen,cur,len);\\n\\t\\tif(pvol)\\n\\t\\t{\\n\\t\\t\\twhile(req--)\\n\\t\\t\\t{\\n\\t\\t\\t\\tputchar('R');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tll adsz=0,j,k,curval;\\n\\tif(pvol)\\n\\t{\\n\\t\\tadsz+=num_len(nts[x-1].vl)+1;\\n\\t\\tprintf(\\\"V%d\\\",nts[x-1].vl);\\n\\t}\\n\\tif(cr==nts[x-1].cr)\\n\\t{\\n\\t\\tadsz+=ntnm[nts[x-1].num].size();\\n\\t\\tprintf(\\\"%s\\\",ntnm[nts[x-1].num].c_str());\\n\\t}\\n\\telse if(cr==nts[x-1].cr-1)\\n\\t{\\n\\t\\tadsz+=2;\\n\\t\\tprintf(\\\"B+\\\");\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tadsz+=2;\\n\\t\\tprintf(\\\"C-\\\");\\n\\t}\\n\\tbool ok=false;\\n\\tfor(j=0;j<8;j++)\\n\\t{\\n\\t\\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\\n\\t\\tfor(k=0;curval;k++,curval>>=1)\\n\\t\\t{\\n\\t\\t\\tsum+=curval;\\n\\t\\t\\tif(sum==nts[x-1].len)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll nv=cur*(j!=len)+k+adsz;\\n\\t\\t\\t\\tif(dp[x][cr][len]==dp[lstx][lstcr][len]+nv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(j!=len)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tprintf(\\\"%d\\\",128/(1<<j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\twhile(k--)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tputchar('.');\\n\\t\\t\\t\\t\\t}\\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}\\n\\t\\tif(ok)\\n\\t\\t{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\nint main(){\\n\\tll i,j,k,l,p,TC=1;\\n\\tntid[\\\"C-\\\"]=-1;\\n\\tntid[\\\"C\\\"]=0;\\n\\tntid[\\\"C+\\\"]=ntid[\\\"D-\\\"]=1;\\n\\tntid[\\\"D\\\"]=2;\\n\\tntid[\\\"D+\\\"]=ntid[\\\"E-\\\"]=3;\\n\\tntid[\\\"E\\\"]=ntid[\\\"F-\\\"]=4;\\n\\tntid[\\\"E+\\\"]=ntid[\\\"F\\\"]=5;\\n\\tntid[\\\"F+\\\"]=ntid[\\\"G-\\\"]=6;\\n\\tntid[\\\"G\\\"]=7;\\n\\tntid[\\\"G+\\\"]=ntid[\\\"A-\\\"]=8;\\n\\tntid[\\\"A\\\"]=9;\\n\\tntid[\\\"A+\\\"]=ntid[\\\"B-\\\"]=10;\\n\\tntid[\\\"B\\\"]=11;\\n\\tntid[\\\"B+\\\"]=12;\\n\\tfor(l=0;l<8;l++)\\n\\t{\\n\\t\\tmemset(rstval[l],63,sizeof(rstval[l]));\\n\\t\\trstval[l][0][l]=0;\\n\\t\\ttrsrst[l][0][l]=make_pair(-1,-1);\\n\\t\\tfor(i=0;i<=10000;i++)\\n\\t\\t{\\n\\t\\t\\tll mnv=0;\\n\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(rstval[l][i][j]<rstval[l][i][mnv])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tmnv=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll nv=num_len(128/(1<<j))+1+rstval[l][i][mnv];\\n\\t\\t\\t\\tif(rstval[l][i][j]>nv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\trstval[l][i][j]=nv;\\n\\t\\t\\t\\t\\ttrsrst[l][i][j]=make_pair(i,mnv);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\\n\\t\\t\\t\\tfor(k=0;curval;k++,curval>>=1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tsum+=curval;\\n\\t\\t\\t\\t\\tif(i+sum<=10000)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor(p=0;p<8;p++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tll nv=rstval[l][i][p]+cur*(j!=p)+k+1;\\n\\t\\t\\t\\t\\t\\t\\tif(rstval[l][i+sum][p]>nv)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\trstval[l][i+sum][p]=nv;\\n\\t\\t\\t\\t\\t\\t\\t\\ttrsrst[l][i+sum][p]=make_pair(i,p);\\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\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile(true)\\n\\t{\\n\\t\\tcin>>s;\\n\\t\\tif(s==\\\"*\\\")\\n\\t\\t{\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tnts.clear();\\n\\t\\tll curvl=100,curcr=4,curlen=32;\\n\\t\\tfor(i=0;i<s.size();)\\n\\t\\t{\\n\\t\\t\\tif(s[i]=='>')\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurcr++;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\telse if(s[i]=='<')\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurcr--;\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\telse if(s[i]=='O')\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurcr=s[i+1]-'0';\\n\\t\\t\\t\\ti+=2;\\n\\t\\t\\t}\\n\\t\\t\\telse if(s[i]=='V')\\n\\t\\t\\t{\\n\\t\\t\\t\\tll cnum=0;\\n\\t\\t\\t\\tfor(j=i+1;isdigit(s[j]);j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcnum=cnum*10+s[j]-'0';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcurvl=cnum;\\n\\t\\t\\t\\ti=j;\\n\\t\\t\\t}\\n\\t\\t\\telse if(s[i]=='L')\\n\\t\\t\\t{\\n\\t\\t\\t\\tll cnum=0;\\n\\t\\t\\t\\tfor(j=i+1;isdigit(s[j]);j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcnum=cnum*10+s[j]-'0';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcurlen=128/cnum;\\n\\t\\t\\t\\ti=j;\\n\\t\\t\\t}\\n\\t\\t\\telse if(s[i]=='R')\\n\\t\\t\\t{\\n\\t\\t\\t\\tstring ts=\\\"\\\";\\n\\t\\t\\t\\tfor(j=i+1;j<s.size()&&(isdigit(s[j])||s[j]=='.');j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tts+=s[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tNote nw;\\n\\t\\t\\t\\tnw.num=INF,nw.cr=nw.vl=-1,nw.len=calclen(ts,curlen);\\n\\t\\t\\t\\tif((!nts.empty())&&nts[nts.size()-1].num==INF)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tnts[nts.size()-1].len+=nw.len;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tnts.push_back(nw);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ti=j;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tll ntnum,ntcr=curcr;\\n\\t\\t\\t\\tif(i+1<s.size()&&(s[i+1]=='+'||s[i+1]=='-'))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tntnum=ntid[s.substr(i,2)];\\n\\t\\t\\t\\t\\ti+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tntnum=ntid[s.substr(i,1)];\\n\\t\\t\\t\\t\\ti++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ntnum==-1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tntnum+=12;\\n\\t\\t\\t\\t\\tntcr--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(ntnum==12)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tntnum-=12;\\n\\t\\t\\t\\t\\tntcr++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstring ts=\\\"\\\";\\n\\t\\t\\t\\tfor(j=i;j<s.size()&&(isdigit(s[j])||s[j]=='.');j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tts+=s[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tNote nw;\\n\\t\\t\\t\\tnw.num=ntnum,nw.cr=ntcr,nw.vl=curvl,nw.len=calclen(ts,curlen);\\n\\t\\t\\t\\tnts.push_back(nw);\\n\\t\\t\\t\\ti=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(i=0;i<=nts.size();i++)\\n\\t\\t{\\n\\t\\t\\tmemset(dp[i],63,sizeof(dp[i]));\\n\\t\\t}\\n\\t\\tdp[0][4][5]=0;\\n\\t\\ttrs[0][4][5]=make_pair(-1,make_pair(-1,-1));\\n\\t\\tcurvl=100;\\n\\t\\tfor(i=0;i<nts.size();i++)\\n\\t\\t{\\n\\t\\t\\tfor(j=1;j<=8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll mnv=0;\\n\\t\\t\\t\\tfor(k=0;k<8;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(dp[i][j][k]<dp[i][j][mnv])\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tmnv=k;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(k=0;k<8;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tll nv=dp[i][j][mnv]+1+num_len(128/(1<<k));\\n\\t\\t\\t\\t\\tif(dp[i][j][k]>nv)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tdp[i][j][k]=nv;\\n\\t\\t\\t\\t\\t\\ttrs[i][j][k]=make_pair(i,make_pair(j,mnv));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(k=1;k<=8;k++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(l=1;l<=8;l++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tll nv=dp[i][k][j]+2-(abs(k-l)<=1);\\n\\t\\t\\t\\t\\t\\tif(dp[i][l][j]>nv)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tdp[i][l][j]=nv;\\n\\t\\t\\t\\t\\t\\t\\ttrs[i][l][j]=make_pair(i,make_pair(k,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\\tif(nts[i].num!=INF)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll ad=0;\\n\\t\\t\\t\\tif(curvl!=nts[i].vl)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tad+=num_len(nts[i].vl)+1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tll cur=num_len(128/(1<<j)),sum=0,curval=1<<j;\\n\\t\\t\\t\\t\\tfor(k=0;curval;k++,curval>>=1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tsum+=curval;\\n\\t\\t\\t\\t\\t\\tif(sum==nts[i].len)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tfor(p=0;p<8;p++)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tll nv=dp[i][nts[i].cr][p]+cur*(j!=p)+k+ad+ntnm[nts[i].num].size();\\n\\t\\t\\t\\t\\t\\t\\t\\tif(dp[i+1][nts[i].cr][p]>nv)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[i+1][nts[i].cr][p]=nv;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(curvl!=nts[i].vl)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr][p]=make_pair(i+INF,make_pair(nts[i].cr+INF,p+INF));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr][p]=make_pair(i,make_pair(nts[i].cr,p));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tif(nts[i].num==0)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnv=dp[i][nts[i].cr-1][p]+cur*(j!=p)+k+ad+2;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(dp[i+1][nts[i].cr-1][p]>nv)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[i+1][nts[i].cr-1][p]=nv;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(curvl!=nts[i].vl)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr-1][p]=make_pair(i+INF,make_pair(nts[i].cr-1+INF,p+INF));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr-1][p]=make_pair(i,make_pair(nts[i].cr-1,p));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tif(nts[i].num==11)\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnv=dp[i][nts[i].cr+1][p]+cur*(j!=p)+k+ad+2;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(dp[i+1][nts[i].cr+1][p]>nv)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdp[i+1][nts[i].cr+1][p]=nv;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(curvl!=nts[i].vl)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr+1][p]=make_pair(i+INF,make_pair(nts[i].cr+1+INF,p+INF));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][nts[i].cr+1][p]=make_pair(i,make_pair(nts[i].cr+1,p));\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\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\\t\\t\\t\\tcurvl=nts[i].vl;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tll cur=nts[i].len,tot=(cur<10000)?0:(cur-10000+(1<<j)+50)/(1<<j);\\n\\t\\t\\t\\t\\tcur-=tot*(1<<j);\\n\\t\\t\\t\\t\\tfor(l=0;l<8;l++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tll nv=tot+rstval[j][cur][l];\\n\\t\\t\\t\\t\\t\\tfor(k=1;k<=8;k++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(dp[i+1][k][l]>dp[i][k][j]+nv)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[i+1][k][l]=dp[i][k][j]+nv;\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][k][l]=make_pair(i,make_pair(k,j));\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tnv=tot+rstval[l][cur][j];\\n\\t\\t\\t\\t\\t\\tfor(k=1;k<=8;k++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(dp[i+1][k][j]>dp[i][k][l]+nv)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tdp[i+1][k][j]=dp[i][k][l]+nv;\\n\\t\\t\\t\\t\\t\\t\\t\\ttrs[i+1][k][j]=make_pair(i+INF,make_pair(k+INF,l+INF));\\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\\t\\t\\t}\\n\\t\\t}\\n\\t\\tll ans=INF,lstx,lsty;\\n\\t\\tfor(i=1;i<=8;i++)\\n\\t\\t{\\n\\t\\t\\tfor(j=0;j<8;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(ans>dp[nts.size()][i][j])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tans=dp[nts.size()][i][j];\\n\\t\\t\\t\\t\\tlstx=i,lsty=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d: \\\",TC++);\\n\\t\\tprint(nts.size(),lstx,lsty);\\n\\t\\tputs(\\\"\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 33528,\n \"score_of_the_acc\": -0.4968,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2395_6548318\",\n \"code_snippet\": \"/**\\n * author: gary\\n * created: 28.04.2022 09:54:53\\n**/\\n#include<bits/stdc++.h>\\n#define rb(a,b,c) for(int a=b;a<=c;++a)\\n#define rl(a,b,c) for(int a=b;a>=c;--a)\\n#define rep(a,b) for(int a=0;a<b;++a)\\n#define LL long long\\n#define PB push_back\\n#define POB pop_back\\n#define II(a,b) make_pair(a,b)\\n#define FIR first\\n#define SEC second\\n#define SRAND mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())\\n#define random(a) rng()%a\\n#define ALL(a) a.begin(),a.end()\\n#define check_min(a,b) a=min(a,b)\\n#define check_max(a,b) a=max(a,b)\\nusing namespace std;\\nconst int INF=0x3f3f3f3f;\\ntypedef pair<int,int> mp;\\nstruct Node{\\n int note,x,v,o,d;\\n Node(){}\\n Node(int _,int __,int ___,int ____,int _____){note=_,x=__,v=___,o=____,d=_____;}\\n void Debug(){\\n cout<<\\\"{\\\\n\\\";\\n cout<<\\\"Note=\\\"<<note<<endl;\\n cout<<\\\"x=\\\"<<x<<endl;\\n cout<<\\\"v=\\\"<<v<<endl;\\n cout<<\\\"o=\\\"<<o<<endl;\\n cout<<\\\"d=\\\"<<d<<endl;\\n cout<<\\\"}\\\\n\\\";\\n }\\n};\\nmap<string,int> NOTE={\\n{\\\"C\\\",1},\\n{\\\"C+\\\",2},\\n{\\\"D-\\\",2},\\n{\\\"D\\\",3},\\n{\\\"D+\\\",4},\\n{\\\"E-\\\",4},\\n{\\\"F-\\\",5},\\n{\\\"E\\\",5},\\n{\\\"E+\\\",6},\\n{\\\"F\\\",6},\\n{\\\"F+\\\",7},\\n{\\\"G-\\\",7},\\n{\\\"G\\\",8},\\n{\\\"G+\\\",9},\\n{\\\"A-\\\",9},\\n{\\\"A\\\",10},\\n{\\\"A+\\\",11},\\n{\\\"B-\\\",11},\\n{\\\"B\\\",12}\\n};\\nint NOTE_LEN[13],X_LEN[8]={1,1,1,1,2,2,2,3};\\nstring NOTE2[13];\\nint getnote(string s){\\n return NOTE[s];\\n}\\nint getx(int x){\\n return floor(log2(x)+0.4);\\n}\\nconst int MAXN=1e5+10;\\nint n;\\nNode dat[MAXN];\\nint getnum(string &s,int &i){\\n int x=0;\\n while (i<s.length()&&isdigit(s[i])){\\n x*=10;\\n x+=s[i]-'0';\\n i++;\\n }\\n return x;\\n}\\nvoid Get(string Note,int x,int V,int O,int d){\\n // cout<<Note<<\\\" \\\"<<x<<\\\" \\\"<<V<<\\\" \\\"<<O<<' '<<d<<endl;\\n if(Note==\\\"C-\\\") Note=\\\"B\\\",O--;\\n if(Note==\\\"B+\\\") Note=\\\"C\\\",O++;\\n if(Note==\\\"R\\\"){\\n x=128/x;\\n int s=x;\\n while (d){\\n d--;\\n x>>=1;\\n s+=x;\\n }\\n if(n&&dat[n].note==0) dat[n].x+=s;\\n else dat[++n]=Node(0,s,0,0,0);\\n }\\n else{\\n dat[++n]=Node(getnote(Note),getx(x),V,O-1,d);\\n }\\n}\\nvoid process(string &s){\\n int i=0;\\n int V=100,O=4,L=4;\\n while (i<s.length()){\\n if(s[i]=='C'||s[i]=='D'||s[i]=='E'||s[i]=='F'||s[i]=='G'||s[i]=='A'||s[i]=='B'||s[i]=='R'){\\n string Note;Note.PB(s[i]);\\n if(i+1<s.length()&&(s[i+1]=='+'||s[i+1]=='-')) Note.PB(s[i+1]),i++;\\n int x=L;\\n i++;\\n if(i<s.length()&&isdigit(s[i])) x=getnum(s,i);\\n else x=L;\\n int d=0;\\n while (i<s.length()&&s[i]=='.'){\\n i++;\\n d++;\\n }\\n Get(Note,x,V,O,d);\\n }\\n else if(s[i]=='O'||s[i]=='<'||s[i]=='>'){\\n if(s[i]=='O'){\\n i++;\\n int x=getnum(s,i);\\n O=x;\\n }\\n else if(s[i]=='>'){\\n O++;\\n i++;\\n }\\n else O--,i++;\\n }\\n else if(s[i]=='L'){\\n i++;\\n int x=getnum(s,i);\\n L=x;\\n }\\n else{\\n assert(s[i]=='V');\\n i++;\\n int x=getnum(s,i);\\n V=x;\\n }\\n }\\n}\\nconst int B=1024;\\nint dp[MAXN][8][8];\\nmp from[MAXN][8][8];// L O\\nstring f[B+1][8][8];\\nbool upd(string& A,string B){\\n if(B.length()<A.length()||A==\\\"EMPTY\\\") {A=B;return 1;}\\n return 0;\\n}\\nstring Num(int x){\\n string rest=\\\"\\\";\\n while (x)\\n {\\n rest.PB('0'+x%10);\\n x/=10;\\n }\\n reverse(ALL(rest));\\n return rest;\\n}\\nstring Lx(int fx,int tx){\\n if(fx==tx) return \\\"\\\";\\n return \\\"L\\\"+Num(1<<tx);\\n}\\nstring Vx(int tx){\\n string ans=\\\"V\\\";\\n ans+=Num(tx);\\n return ans;\\n}\\nstring Ox(int fx,int tx){\\n if(fx==tx) return \\\"\\\";\\n if(fx==tx-1) return \\\">\\\";\\n else if(fx==tx+1) return \\\"<\\\";\\n else{\\n string ans=\\\"O\\\";\\n ans.PB(char('1'+tx));\\n return ans;\\n }\\n}\\nstring Query(int i,int j,int k){\\n if(i<=B) return f[i][j][k];\\n int Cnt=0;\\n while (i>B)\\n {\\n i-=128;\\n Cnt++;\\n }\\n string rest=Query(i,j,k);\\n string Ans;\\n if(j==0){\\n rb(i,1,Cnt) Ans+=\\\"R\\\";\\n return Ans+rest;\\n }\\n rep(i,rest.length()){\\n if(i>=2&&rest[i-2]=='L'&&rest[i-1]=='1'&&rest[i]!='2'&&rest[i]!='6'){\\n rb(i,1,Cnt) Ans+=\\\"R\\\";\\n Cnt=0;\\n }\\n Ans.PB(rest[i]);\\n }\\n // if(Cnt){\\n // cerr<<i<<\\\" \\\"<<rest<<\\\" \\\"<<rest.length()<<j<<\\\" \\\"<<k<<\\\" \\\"<<endl;\\n // }\\n // assert(!Cnt);\\n return Ans;\\n}\\nint Querylen(int i,int j,int k){\\n if(i<=B) return f[i][j][k].length();\\n int Cnt=(i-B)/128;\\n i-=Cnt*128;\\n while (i>B)\\n {\\n i-=128;\\n Cnt++;\\n }\\n return Cnt+Querylen(i,j,k);\\n}\\nint Work(int o,int k,Node x){\\n if(o==x.o){\\n return NOTE_LEN[x.note]+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\\n }\\n if(o==x.o-1&&x.note==1){\\n return 2+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\\n }\\n if(o==x.o+1&&x.note==12){\\n return 2+(k==x.x? 0:Num((1<<x.x)).length())+x.d;\\n }\\n return INF;\\n}\\nstring Works(int o,int k,Node x){\\n if(o==x.o){\\n string tmp= NOTE2[x.note]+(k==x.x? \\\"\\\":Num((1<<x.x)));\\n rb(i,1,x.d) tmp.PB('.');\\n return tmp;\\n }\\n if(o==x.o-1&&x.note==1){\\n string tmp= \\\"B+\\\"+(k==x.x? \\\"\\\":Num((1<<x.x)));\\n rb(i,1,x.d) tmp.PB('.');\\n return tmp;\\n }\\n if(o==x.o+1&&x.note==12){\\n string tmp= \\\"C-\\\"+(k==x.x? \\\"\\\":Num((1<<x.x)));\\n rb(i,1,x.d) tmp.PB('.');\\n return tmp;\\n }\\n return \\\"FUCK\\\";\\n}\\nint Recover(int i,int j,int k){\\n int fj,fk;\\n if(i==0) return 100;\\n tie(fj,fk)=from[i][j][k];\\n if(dat[i].note==0){\\n int tmp=Recover(i-1,fj,fk);\\n cout<<Query(dat[i].x,fj,j);\\n return tmp;\\n }\\n int tmp=Recover(i-1,fj,fk);\\n if(tmp!=dat[i].v){\\n cout<<Vx(dat[i].v);\\n tmp=dat[i].v;\\n }\\n cout<<Lx(fj,j)<<Ox(fk,k)<<Works(k,j,dat[i]);\\n return tmp;\\n}\\nint main(){\\n // freopen(\\\"in.txt\\\",\\\"r\\\",stdin);\\n // freopen(\\\"my.txt\\\",\\\"w\\\",stdout);\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n for(auto it:NOTE) NOTE_LEN[it.second]=it.first.length(),NOTE2[it.second]=it.first;\\n for(auto it:NOTE) NOTE_LEN[it.second]=it.first.length(),upd(NOTE2[it.second],it.first);\\n rep(i,B+1) rep(j,8) rep(k,8) f[i][j][k]=\\\"EMPTY\\\";\\n rep(j,8) rep(k,8) f[0][j][k]=Lx(j,k);\\n rb(i,1,B) {\\n while (true){\\n bool ok=0; \\n rep(j,8) rep(k,8){\\n rep(l,8) if(f[i][l][k]!=\\\"EMPTY\\\") ok|=upd(f[i][j][k],Lx(j,l)+f[i][l][k]);\\n rep(g,8){\\n int t=128/((1<<g));\\n int s=0;\\n string Rest=\\\"R\\\";\\n if(g!=j) Rest+=Num(1<<g);\\n while (t>=1){\\n if(s!=0) Rest.PB('.');\\n s+=t;\\n t>>=1;\\n if(s<=i&&f[i-s][j][k]!=\\\"EMPTY\\\") ok|=upd(f[i][j][k],Rest+f[i-s][j][k]);\\n }\\n }\\n }\\n if(!ok) break;\\n }\\n }\\n // cout<<Query(310,2,0)<<endl;\\n // return 0;\\n int T=0;\\n while (true){\\n string s;\\n cin>>s;\\n if(s==\\\"*\\\") break;\\n n=0;\\n process(s);\\n rb(i,0,n) rep(j,8) rep(k,8) dp[i][j][k]=INF;\\n dp[0][2][3]=0;\\n rb(i,1,n){\\n if(dat[i].note==0){\\n rep(j,8){\\n rep(newj,8){\\n int Klen=Querylen(dat[i].x,j,newj);\\n rep(k,8) if(dp[i-1][j][k]+Klen<dp[i][newj][k]){\\n dp[i][newj][k]=dp[i-1][j][k]+Klen;\\n from[i][newj][k]=II(j,k);\\n }\\n }\\n }\\n }\\n else{\\n rep(j,8) rep(k,8) if(dp[i-1][j][k]!=INF) \\n rep(nj,8) rep(nk,8){\\n int Klen=Lx(j,nj).length()+Ox(k,nk).length()+Work(nk,nj,dat[i]);\\n if(Klen+dp[i-1][j][k]<dp[i][nj][nk]){\\n dp[i][nj][nk]=dp[i-1][j][k]+Klen;\\n from[i][nj][nk]=II(j,k);\\n }\\n }\\n }\\n }\\n // rb(i,1,n){\\n // dat[i].Debug();\\n // }\\n cout<<\\\"Case \\\"<<++T<<\\\": \\\";\\n int ans=INF,j=0,k=0;\\n rep(x,8) rep(y,8) if(dp[n][x][y]<ans) ans=dp[n][x][y],j=x,k=y;\\n Recover(n,j,k);\\n cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2890,\n \"memory_kb\": 25476,\n \"score_of_the_acc\": -1.296,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2395_6546082\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,n) for (int i=(a);i<=(n);i++)\\n#define per(i,a,n) for (int i=(n);i>=(a);i--)\\n#define inf 0x3f3f3f3f\\n#define pb push_back\\n#define all(x) x.begin(),x.end()\\n#define SZ(x) ((int)x.size())\\nusing namespace std;\\nstring Ns[] = {\\\"1\\\", \\\"2\\\", \\\"4\\\", \\\"8\\\", \\\"16\\\", \\\"32\\\", \\\"64\\\", \\\"128\\\"};\\nint DNs[] = {128, 64, 32, 16, 8, 4, 2, 1};\\nstring RS[] = {\\\"C\\\", \\\"D\\\", \\\"E\\\", \\\"F\\\", \\\"G\\\", \\\"A\\\", \\\"B\\\"};\\nchar RC[] = {'C', 'D', 'E', 'F', 'G', 'A', 'B'};\\nint RK[] = {0, 2, 4, 5, 7, 9, 11};\\nint LD[] = {2, 2, 2, 2, 3, 3, 3, 4};\\nconst string I = \\\"hyh\\\";\\nconst int N = 100015, M = 1280;\\n\\ntemplate<class A, class B>\\nbool upd(A &x, A y, B &xx, B yy) {\\n\\tif (x > y) {\\n\\t\\tx = y;\\n\\t\\txx = yy;\\n\\t\\treturn true;\\n\\t}\\n\\n\\treturn false;\\n}\\n\\nint NTD(string s) {\\n\\n\\trep(i, 0, 7) if (Ns[i] == s) return DNs[i];\\n\\n\\treturn 0;\\n}\\n\\nint CTRK(char ch) {\\n\\n\\trep(i, 0, 6) if (RC[i] == ch) return RK[i];\\n\\n\\treturn 0;\\n}\\n\\nint STD(string S, int DD) {\\n\\n\\tint Num = -1, Dot = count(all(S), '.'), D = 0;\\n\\n\\trep(i, 0, 7) if (DNs[i] == DD) Num = i;\\n\\n\\trep(i, 0, 7) if (S.substr(0, SZ(Ns[i])) == Ns[i]) Num = i;\\n\\n\\trep(i, 0, Dot) D += DNs[Num + i];\\n\\n\\treturn D;\\n\\n}\\n\\nstring KTS(int AK, int OT) {\\n\\tstring _C, n_C;\\n\\tauto Do = [&]() {if (SZ(n_C) < SZ(_C) || _C.empty()) _C = n_C;};\\n\\n\\trep(i, 0, 6) {\\n\\t\\tif (OT * 12 + RK[i] == AK)\\n\\t\\t\\tn_C = RS[i], Do();\\n\\n\\t\\tif (OT * 12 + RK[i] + 1 == AK)\\n\\t\\t\\tn_C = RS[i] + \\\"+\\\", Do();\\n\\n\\t\\tif (OT * 12 + RK[i] - 1 == AK)\\n\\t\\t\\tn_C = RS[i] + \\\"-\\\", Do();\\n\\t}\\n\\n\\tif (_C.empty()) {return I;}\\n\\n\\treturn _C;\\n}\\n\\nstring DTS(int D, int DD) {\\n\\tvector<int> ms;\\n\\n\\trep(i, 0, 7) if (D & DNs[i]) ms.pb(i);\\n\\n\\tif (SZ(ms) != ms.back() - ms[0] + 1) return I;\\n\\n\\tstring Num, Dot;\\n\\tNum = DNs[ms[0]] == DD ? \\\"\\\" : Ns[ms[0]];\\n\\n\\trep(_, 2, SZ(ms)) Dot += \\\".\\\";\\n\\n\\treturn Num + Dot;\\n};\\n\\nstring kts[111][8], dts[256][256];\\n\\nvoid Calc(string dp[M + 15][8], int s) {\\n\\tstatic int L[M + 15][8];\\n\\tmemset(L, 0x3f, sizeof L);\\n\\tL[0][s] = 0;\\n\\n\\trep(i, 0, M) {\\n\\n\\t\\trep(j, 0, 7) rep(k, 0, 7) if (j != k) {\\n\\t\\t\\tupd(L[i][k], L[i][j] + LD[j], dp[i][k], dp[i][j] + \\\"L\\\" + Ns[k]);\\n\\t\\t}\\n\\n\\t\\trep(j, 0, 7) rep(k, 0, 255) {\\n\\t\\t\\tif (i + k > M) break;\\n\\n\\t\\t\\tstring &s = dts[k][DNs[j]];\\n\\n\\t\\t\\tif (s == I) continue;\\n\\n\\t\\t\\tupd(L[i + k][j], L[i][j] + 1 + SZ(s), dp[i + k][j], dp[i][j] + \\\"R\\\" + s);\\n\\t\\t}\\n\\t}\\n}\\n\\nstring dp[8][M + 15][8];\\n\\nvoid Prework() {\\n\\trep(i, 0, 7) rep(j, 0, 11) rep(k, 0, 7) kts[i * 12 + j][k] = KTS(i * 12 + j, k);\\n\\n\\trep(i, 1, 255) rep(j, 0, 7) dts[i][DNs[j]] = DTS(i, DNs[j]);\\n\\n\\trep(s, 0, 7) Calc(dp[s], s);\\n}\\n\\nint Tr[8][8];\\n\\nvoid GTr(int D) {\\n\\tint O = D, cnt = 0;\\n\\n\\twhile (O > M) O -= 128, cnt++;\\n\\n\\trep(p, 0, 7) rep(q, 0, 7) Tr[p][q] = SZ(dp[p][O][q]) + cnt;\\n}\\n\\nstring GS(int D, int p, int q) {\\n\\tint O = D, cnt = 0;\\n\\n\\twhile (O > M) O -= 128, cnt++;\\n\\n\\tstring res = dp[p][O][q];\\n\\n\\tif (cnt) res.insert(p == 0 ? 0 : (res.find(\\\"L1\\\") + 2), cnt, 'R');\\n\\n\\treturn res;\\n}\\n\\nstruct Note {\\n\\tint AK, Vl, D;\\n\\tbool IR;\\n\\tstring ktos(int OT) {return kts[AK][OT];}\\n\\tstring dtos(int DD) {return dts[D][DD];}\\n} A[N];\\n\\nNote Read(string O, int &OT, int &DD, int &Vl) {\\n\\tNote res = (Note) {0, 0, 0, 0};\\n\\n\\tif (O[0] == '<') OT--;\\n\\telse if (O[0] == '>') OT++;\\n\\telse if (O[0] == 'O') OT = O[1] - '1';\\n\\telse if (O[0] == 'L') DD = NTD(O.substr(1));\\n\\telse if (O[0] == 'V') Vl = stoi(O.substr(1));\\n\\telse if (O[0] == 'R') {\\n\\t\\tres.IR = 1;\\n\\t\\tres.D = STD(O.substr(1), DD);\\n\\n\\t} else {\\n\\t\\tres.Vl = Vl;\\n\\t\\tres.AK = OT * 12 + CTRK(O[0]);\\n\\t\\tO.erase(O.begin());\\n\\n\\t\\tif (SZ(O) > 0) {\\n\\t\\t\\tif (O[0] == '+') {\\n\\t\\t\\t\\tO.erase(O.begin());\\n\\t\\t\\t\\tres.AK++;\\n\\n\\t\\t\\t} else if (O[0] == '-') {\\n\\t\\t\\t\\tO.erase(O.begin());\\n\\t\\t\\t\\tres.AK--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tres.D = STD(O, DD);\\n\\t}\\n\\n\\treturn res;\\n}\\n\\nint n, f[N][8], fr[N][8];\\nstring se, DA[N], OTA[N], Ex[N];\\n\\nvoid SD() {\\n\\trep(i, 0, n) memset(f[i], 0x3f, sizeof f[i]);\\n\\n\\tint Vl = 100;\\n\\tf[0][2] = 0;\\n\\n\\trep(i, 1, n) {\\n\\t\\tif (A[i].IR) {\\n\\t\\t\\tGTr(A[i].D);\\n\\n\\t\\t\\trep(p, 0, 7) rep(q, 0, 7) upd(f[i][p], f[i - 1][q] + Tr[q][p], fr[i][p], q);\\n\\n\\t\\t} else {\\n\\t\\t\\trep(p, 0, 7) rep(q, 0, 7) upd(f[i][p], f[i - 1][q] + (p != q) * LD[p] + SZ(A[i].dtos(DNs[p])), fr[i][p], q);\\n\\n\\t\\t\\tif (Vl != A[i].Vl) {\\n\\t\\t\\t\\tVl = A[i].Vl;\\n\\t\\t\\t\\tEx[i] += \\\"V\\\" + to_string(Vl);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint Min = inf, p = 0, np = 0;\\n\\n\\trep(i, 0, 7) upd(Min, f[n][i], p, i);\\n\\n\\tper(i, 1, n) {\\n\\t\\tnp = fr[i][p];\\n\\n\\t\\tif (A[i].IR) {\\n\\t\\t\\tDA[i] = GS(A[i].D, np, p);\\n\\n\\t\\t} else {\\n\\t\\t\\tif (p != np) Ex[i] += \\\"L\\\" + Ns[p];\\n\\n\\t\\t\\tDA[i] = A[i].dtos(DNs[p]);\\n\\t\\t}\\n\\n\\t\\tp = np;\\n\\t}\\n}\\n\\nvoid SOT() {\\n\\trep(i, 0, n) memset(f[i], 0x3f, sizeof f[i]);\\n\\n\\tf[0][3] = 0;\\n\\n\\trep(i, 1, n) {\\n\\t\\tif (A[i].IR) {\\n\\t\\t\\trep(p, 0, 7) upd(f[i][p], f[i - 1][p], fr[i][p], p);\\n\\n\\t\\t} else {\\n\\t\\t\\trep(p, 0, 7) rep(q, 0, 7) {\\n\\t\\t\\t\\tstring oo = A[i].ktos(p);\\n\\n\\t\\t\\t\\tif (oo == I) continue;\\n\\n\\t\\t\\t\\tint o = (p == q ? 0 : abs(p - q) == 1 ? 1 : 2);\\n\\n\\t\\t\\t\\tupd(f[i][p], f[i - 1][q] + o + SZ(oo), fr[i][p], q);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint Min = inf, p = 0, np = 0;\\n\\n\\trep(i, 0, 7) upd(Min, f[n][i], p, i);\\n\\n\\tper(i, 1, n) {\\n\\t\\tnp = fr[i][p];\\n\\n\\t\\tif (!A[i].IR) {\\n\\t\\t\\tif (p != np) {\\n\\t\\t\\t\\tif (np + 1 == p) Ex[i] += \\\">\\\";\\n\\t\\t\\t\\telse if (np - 1 == p) Ex[i] += \\\"<\\\";\\n\\t\\t\\t\\telse Ex[i] += \\\"O\\\" + to_string(p + 1);\\n\\t\\t\\t}\\n\\n\\t\\t\\tOTA[i] = A[i].ktos(p);\\n\\t\\t}\\n\\n\\t\\tp = np;\\n\\t}\\n\\n}\\n\\nvoid solve() {\\n\\tint OT = 3, DD = NTD(\\\"4\\\"), Vl = 100;\\n\\tn = 0;\\n\\n\\tfor (int l = 0, r; r = l, l < SZ(se); l = r + 1) {\\n\\t\\twhile (r + 1 < SZ(se) && !('A' <= se[r + 1] && se[r + 1] <= 'Z') && se[r + 1] != '<' && se[r + 1] != '>') r++;\\n\\n\\t\\tNote Cur = Read(se.substr(l, r - l + 1), OT, DD, Vl);\\n\\n\\t\\tif (!Cur.D) continue;\\n\\n\\t\\tif (A[n].IR && Cur.IR) A[n].D += Cur.D;\\n\\t\\telse A[++n] = Cur;\\n\\t}\\n\\n\\trep(i, 1, n) Ex[i] = OTA[i] = DA[i] = \\\"\\\";\\n\\n\\tSD();\\n\\tSOT();\\n\\n\\trep(i, 1, n) cout << Ex[i] << OTA[i] << DA[i];\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr); cout.tie(nullptr);\\n\\tPrework();\\n\\tint test = 0;\\n\\n\\twhile (cin >> se) {\\n\\t\\tif (se == \\\"*\\\") break;\\n\\n\\t\\tcout << \\\"Case \\\" << ++test << \\\": \\\";\\n\\t\\tsolve();\\n\\t\\tcout << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 26452,\n \"score_of_the_acc\": -0.4123,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2395_3669739\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int N = 100005;\\nconst int INF = 0x3f3f3f3f;\\ninline int get_note(int O, char ch, int f) {\\n\\tif (ch == 'C') return (O - 1) * 12 + 1 + f;\\n\\telse if (ch == 'D') return (O - 1) * 12 + 3 + f;\\n\\telse if (ch == 'E') return (O - 1) * 12 + 5 + f;\\n\\telse if (ch == 'F') return (O - 1) * 12 + 6 + f;\\n\\telse if (ch == 'G') return (O - 1) * 12 + 8 + f;\\n\\telse if (ch == 'A') return (O - 1) * 12 + 10 + f;\\n\\telse return (O - 1) * 12 + 12 + f;\\n}\\ninline int get_num(char *str, int len, int &i) {\\n\\tint x = 0;\\n\\twhile (i < len && isdigit(str[i + 1])) x = x * 10 + str[++i] - '0';\\n\\treturn x;\\n}\\ninline int get_dot(char *str, int len, int &i) {\\n\\tint c = 0;\\n\\twhile (i < len && str[i + 1] == '.') c++, i++;\\n\\treturn c;\\n}\\ninline int get_len(int x, int L) {\\n\\tif (!x) return L;\\n\\telse if (x == 1) return 1;\\n\\telse if (x == 2) return 2;\\n\\telse if (x == 4) return 3;\\n\\telse if (x == 8) return 4;\\n\\telse if (x == 16) return 5;\\n\\telse if (x == 32) return 6;\\n\\telse if (x == 64) return 7;\\n\\telse return 8;\\n}\\nstruct Node {\\n\\tint nt, x, c, vol;\\n};\\nint n;\\nNode dat[N];\\ninline void init_all(char *str) {\\n\\tint len = strlen(str + 1);\\n\\tint O = 4;\\n\\tint L = 3;\\n\\tint V = 100;\\n\\tn = 0;\\n\\tfor (int i = 1; i <= len; i++) {\\n\\t\\tchar ch = str[i];\\n\\t\\tif (ch >= 'A' && ch <= 'G') {\\n\\t\\t\\tint f = 0;\\n\\t\\t\\tif (i < len && str[i + 1] == '+') f = 1, i++;\\n\\t\\t\\telse if (i < len && str[i + 1] == '-') f = -1, i++;\\n\\t\\t\\tint nt = get_note(O, ch, f);\\n\\t\\t\\tint x = get_len(get_num(str, len, i), L);\\n\\t\\t\\tint c = get_dot(str, len, i);\\n\\t\\t\\tdat[++n] = (Node){nt, x, c, V};\\n\\t\\t} else if (ch == 'R') {\\n\\t\\t\\tint x = get_len(get_num(str, len, i), L);\\n\\t\\t\\tint c = get_dot(str, len, i);\\n\\t\\t\\tx = (1 << (8 - x));\\n\\t\\t\\tint t = x;\\n\\t\\t\\twhile (c--) {t >>= 1; x += t;}\\n\\t\\t\\tif (n && !dat[n].nt) dat[n].x += x;\\n\\t\\t\\telse dat[++n] = (Node){0, x, 0, 0};\\n\\t\\t} else if (ch == 'O') {\\n\\t\\t\\tO = str[++i] - '0';\\n\\t\\t} else if (ch == '<') {\\n\\t\\t\\tO--;\\n\\t\\t} else if (ch == '>') {\\n\\t\\t\\tO++;\\n\\t\\t} else if (ch == 'L') {\\n\\t\\t\\tL = get_len(get_num(str, len, i), L);\\n\\t\\t} else if (ch == 'V') {\\n\\t\\t\\tV = get_num(str, len, i);\\n\\t\\t} else assert(false);\\n\\t}\\n}\\nchar str[N];\\nint dp_oct[N][9], dp_L[N][9];\\nint fr_oct[N][9], fr_L[N][9];\\nconst int Len_note[12] = {1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1};\\nconst int Len_dura[9] = {0, 1, 1, 1, 1, 2, 2, 2, 3};\\nint dp_r[512][9][9], dp_r2[1024][9][9], fr_r2[1024][9][9];\\npair<int, int> fr_r[512][9][9];\\npair<int, int> rests[40];\\nvoid init_r() {\\n\\tint crests = 0;\\n\\tfor (int i = 1; i <= 8; i++)\\n\\t\\tfor (int j = i; j <= 8; j++)\\n\\t\\t\\trests[++crests] = {i, j};\\n\\tmemset(dp_r, 0x3f, sizeof(dp_r));\\n\\tfor (int j0 = 1; j0 <= 8; j0++) for (int j1 = 1; j1 <= 8; j1++) dp_r[0][j0][j1] = (j0 != j1 ? 1 + Len_dura[j1] : 0);\\n\\tfor (int i = 1; i < 512; i++) {\\n\\t\\tfor (int j0 = 1; j0 <= 8; j0++) {\\n\\t\\t\\tfor (int j1 = 1; j1 <= 8; j1++) {\\n\\t\\t\\t\\tfor (int k = 1; k <= 36; k++) {\\n\\t\\t\\t\\t\\tint l = rests[k].first, r = rests[k].second, len = (1 << (9 - l)) - (1 << (8 - r));\\n\\t\\t\\t\\t\\tif (i - len >= 0) {\\n\\t\\t\\t\\t\\t\\tfor (int j2 = 1; j2 <= 8; j2++) {\\n\\t\\t\\t\\t\\t\\t\\tint cur = dp_r[i - len][j0][j2] + (j1 != j2 ? 1 + Len_dura[j1] : 0) + (l != j1 ? Len_dura[l] : 0) + 1 + r - l;\\n\\t\\t\\t\\t\\t\\t\\tif (dp_r[i][j0][j1] > cur) {\\n\\t\\t\\t\\t\\t\\t\\t\\tdp_r[i][j0][j1] = cur;\\n\\t\\t\\t\\t\\t\\t\\t\\tfr_r[i][j0][j1] = {k, j2};\\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\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tmemset(dp_r2, 0x3f, sizeof(dp_r2));\\n\\tfor (int i = 0; i < 1024; i++) {\\n\\t\\tfor (int j0 = 1; j0 <= 8; j0++) {\\n\\t\\t\\tfor (int j1 = 1; j1 <= 8; j1++) {\\n\\t\\t\\t\\tfor (int k = max(0, i - 511); k <= i && k < 512; k++) {\\n\\t\\t\\t\\t\\tint cur = dp_r[k][j0][1] + dp_r[i - k][1][j1];\\n\\t\\t\\t\\t\\tif (dp_r2[i][j0][j1] > cur) {\\n\\t\\t\\t\\t\\t\\tdp_r2[i][j0][j1] = cur;\\n\\t\\t\\t\\t\\t\\tfr_r2[i][j0][j1] = k;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nvoid print_dp_r(int i, int j0, int j1) {\\n\\tif (!i) {\\n\\t\\tif (j0 != j1) printf(\\\"L%d\\\", 1 << (j1 - 1));\\n\\t\\treturn;\\n\\t}\\n\\tint k = fr_r[i][j0][j1].first;\\n\\tint j2 = fr_r[i][j0][j1].second;\\n\\tint l = rests[k].first, r = rests[k].second, len = (1 << (9 - l)) - (1 << (8 - r));\\n\\tprint_dp_r(i - len, j0, j2);\\n\\tif (j1 != j2) printf(\\\"L%d\\\", 1 << (j1 - 1));\\n\\tprintf(\\\"R\\\");\\n\\tif (l != j1) printf(\\\"%d\\\", 1 << (l - 1));\\n\\tint cnt = r - l;\\n\\twhile (cnt--)\\n\\t\\tprintf(\\\".\\\");\\n}\\nint calc_r(int l, int j0, int j1) {\\n\\tint c1 = 0, tl = l;\\n\\twhile (l >= 1024) {\\n\\t\\tc1++;\\n\\t\\tl -= 128;\\n\\t}\\n\\tint res = INF;\\n\\tres = min(res, dp_r2[l][j0][j1] + c1);\\n\\twhile (l >= 128) {\\n\\t\\tc1++;\\n\\t\\tl -= 128;\\n\\t\\tres = min(res, dp_r2[l][j0][j1] + c1);\\n\\t}\\n\\tc1 = 0;\\n\\tl = tl;\\n\\twhile (l >= 512) {\\n\\t\\tc1 += 2;\\n\\t\\tl -= 128;\\n\\t}\\n\\tres = min(res, dp_r[l][j0][j1] + c1);\\n\\twhile (l >= 128) {\\n\\t\\tc1 += 2;\\n\\t\\tl -= 128;\\n\\t\\tres = min(res, dp_r[l][j0][j1] + c1);\\n\\t}\\n\\treturn res;\\n}\\nvoid print_r(int l, int j0, int j1) {\\n\\tint c1 = 0, tl = l, a1 = 0, al = 0;\\n\\twhile (l >= 1024) {\\n\\t\\tc1++;\\n\\t\\tl -= 128;\\n\\t}\\n\\tint res = INF;\\n\\tif (res > dp_r2[l][j0][j1] + c1) {\\n\\t\\tres = dp_r2[l][j0][j1] + c1;\\n\\t\\ta1 = 1;\\n\\t\\tal = l;\\n\\t}\\n\\twhile (l >= 128) {\\n\\t\\tc1++;\\n\\t\\tl -= 128;\\n\\t\\tif (res > dp_r2[l][j0][j1] + c1) {\\n\\t\\t\\tres = dp_r2[l][j0][j1] + c1;\\n\\t\\t\\ta1 = 1;\\n\\t\\t\\tal = l;\\n\\t\\t}\\n\\t}\\n\\tc1 = 0;\\n\\tl = tl;\\n\\twhile (l >= 512) {\\n\\t\\tc1 += 2;\\n\\t\\tl -= 128;\\n\\t}\\n\\tif (res > dp_r[l][j0][j1] + c1) {\\n\\t\\tres = dp_r[l][j0][j1] + c1;\\n\\t\\ta1 = 0;\\n\\t\\tal = l;\\n\\t}\\n\\twhile (l >= 128) {\\n\\t\\tc1 += 2;\\n\\t\\tl -= 128;\\n\\t\\tif (res > dp_r[l][j0][j1] + c1) {\\n\\t\\t\\tres = dp_r[l][j0][j1] + c1;\\n\\t\\t\\ta1 = 0;\\n\\t\\t\\tal = l;\\n\\t\\t}\\n\\t}\\n\\tif (a1) {\\n\\t\\tc1 = (tl - al) / 128;\\n\\t\\tint k = fr_r2[al][j0][j1];\\n\\t\\tprint_dp_r(k, j0, 1);\\n\\t\\twhile (c1--) printf(\\\"R\\\");\\n\\t\\tprint_dp_r(al - k, 1, j1);\\n\\t} else {\\n\\t\\tc1 = (tl - al) / 128;\\n\\t\\twhile (c1--) printf(\\\"R1\\\");\\n\\t\\tprint_dp_r(al, j0, j1);\\n\\t}\\n}\\nint ans_oct[N], ans_L[N];\\nconst char van[14][5] = {\\\"C-\\\", \\\"C\\\", \\\"C+\\\", \\\"D\\\", \\\"D+\\\", \\\"E\\\", \\\"F\\\", \\\"F+\\\", \\\"G\\\", \\\"G+\\\", \\\"A\\\", \\\"A+\\\", \\\"B\\\", \\\"B+\\\"};\\nint main() {\\n\\tint Case = 0;\\n\\tinit_r();\\n\\twhile (scanf(\\\" %s\\\", str + 1) == 1 && str[1] != '*') {\\n\\t\\tCase++;\\n\\t\\tinit_all(str);\\n\\t\\tfor (int i = 0; i <= n; i++)\\n\\t\\t\\tfor (int j = 1; j <= 8; j++)\\n\\t\\t\\t\\tdp_oct[i][j] = dp_L[i][j] = INF;\\n\\t\\tdp_oct[0][4] = dp_L[0][3] = 0;\\n\\t\\tfor (int i = 1; i <= n; i++) {\\n\\t\\t\\tif (dat[i].nt) {\\n\\t\\t\\t\\tvector<pair<int, int> > vec;\\n\\t\\t\\t\\tvec.push_back({(dat[i].nt - 1) / 12 + 1, Len_note[(dat[i].nt - 1) % 12]});\\n\\t\\t\\t\\tif (dat[i].nt % 12 == 1 && dat[i].nt != 1) {\\n\\t\\t\\t\\t\\tvec.push_back({(dat[i].nt - 1) / 12, 2});\\n\\t\\t\\t\\t} else if (dat[i].nt % 12 == 0 && dat[i].nt != 96) {\\n\\t\\t\\t\\t\\tvec.push_back({dat[i].nt / 12 + 1, 2});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (pair<int, int> P : vec) {\\n\\t\\t\\t\\t\\tint j = P.first, cst = P.second;\\n\\t\\t\\t\\t\\tfor (int k = 1; k <= 8; k++) if (dp_oct[i - 1][k] < INF) {\\n\\t\\t\\t\\t\\t\\tint cur = dp_oct[i - 1][k] + min(2, abs(j - k)) + cst;\\n\\t\\t\\t\\t\\t\\tif (dp_oct[i][j] > cur) {\\n\\t\\t\\t\\t\\t\\t\\tdp_oct[i][j] = cur;\\n\\t\\t\\t\\t\\t\\t\\tfr_oct[i][j] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int j = 1; j <= 8; j++) {\\n\\t\\t\\t\\t\\tfor (int k = 1; k <= 8; k++) if (dp_L[i - 1][k] < INF) {\\n\\t\\t\\t\\t\\t\\tint cur = dp_L[i - 1][k] + (j != k ? Len_dura[j] + 1 : 0) + (dat[i].x != j ? Len_dura[dat[i].x] : 0) + dat[i].c;\\n\\t\\t\\t\\t\\t\\tif (dp_L[i][j] > cur) {\\n\\t\\t\\t\\t\\t\\t\\tdp_L[i][j] = cur;\\n\\t\\t\\t\\t\\t\\t\\tfr_L[i][j] = k;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tfor (int j = 1; j <= 8; j++)\\n\\t\\t\\t\\t\\tdp_oct[i][j] = dp_oct[i - 1][j], fr_oct[i][j] = j;\\n\\t\\t\\t\\tfor (int k = 1; k <= 8; k++) if (dp_L[i - 1][k] < INF) {\\n\\t\\t\\t\\t\\tfor (int j = 1; j <= 8; j++) {\\n\\t\\t\\t\\t\\t\\tint cur = dp_L[i - 1][k] + calc_r(dat[i].x, k, j);\\n\\t\\t\\t\\t\\t\\tif (dp_L[i][j] > cur) {\\n\\t\\t\\t\\t\\t\\t\\tdp_L[i][j] = cur;\\n\\t\\t\\t\\t\\t\\t\\tfr_L[i][j] = k;\\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\\tint x1 = 1, x2 = 1;\\n\\t\\tfor (int i = 2; i <= 8; i++) {\\n\\t\\t\\tif (dp_oct[n][i] < dp_oct[n][x1])\\n\\t\\t\\t\\tx1 = i;\\n\\t\\t\\tif (dp_L[n][i] < dp_L[n][x2])\\n\\t\\t\\t\\tx2 = i;\\n\\t\\t}\\n\\t\\tprintf(\\\"Case %d: \\\", Case);\\n\\t\\tfor (int i = n; i >= 1; i--) {\\n\\t\\t\\tans_oct[i] = x1;\\n\\t\\t\\tans_L[i] = x2;\\n\\t\\t\\tx1 = fr_oct[i][x1];\\n\\t\\t\\tx2 = fr_L[i][x2];\\n\\t\\t}\\n\\t\\tint V = 100, O = 4, L = 3;\\n\\t\\tfor (int i = 1; i <= n; i++) {\\n\\t\\t\\tif (dat[i].nt) {\\n\\t\\t\\t\\tif (dat[i].vol != V) {\\n\\t\\t\\t\\t\\tV = dat[i].vol;\\n\\t\\t\\t\\t\\tprintf(\\\"V%d\\\", V);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ans_L[i] != L) {\\n\\t\\t\\t\\t\\tL = ans_L[i];\\n\\t\\t\\t\\t\\tprintf(\\\"L%d\\\", 1 << (L - 1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ans_oct[i] != O) {\\n\\t\\t\\t\\t\\tif (abs(ans_oct[i] - O) > 1)\\n\\t\\t\\t\\t\\t\\tprintf(\\\"O%d\\\", ans_oct[i]);\\n\\t\\t\\t\\t\\telse if (ans_oct[i] < O)\\n\\t\\t\\t\\t\\t\\tprintf(\\\"<\\\");\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tprintf(\\\">\\\");\\n\\t\\t\\t\\t\\tO = ans_oct[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprintf(\\\"%s\\\", van[dat[i].nt - (O - 1) * 12]);\\n\\t\\t\\t\\tif (dat[i].x != L)\\n\\t\\t\\t\\t\\tprintf(\\\"%d\\\", 1 << (dat[i].x - 1));\\n\\t\\t\\t\\twhile (dat[i].c--)\\n\\t\\t\\t\\t\\tprintf(\\\".\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tprint_r(dat[i].x, ans_L[i - 1], ans_L[i]);\\n\\t\\t\\t\\tL = ans_L[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 6984,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1371,"cells":{"group_id":{"kind":"string","value":"aoj_2403_cpp"},"problem_description":{"kind":"string","value":"The Enemy of My Enemy is My Friend\n敵の敵は味方\nEnglish text is not available in this practice contest.\n時は XXXX 年。戦乱の世である。\n土地や資源を巡って、隣り合った国同士の衝突がそこかしこで起こり、世の中の先行きは非常に不透明であった。そんな中とある国が、様々な国と軍事同盟を結んでこの乱世を生き延びようと考えた。軍事同盟は次の条件をみたすように行うことが出来る。\n自国の隣国とは同盟を結ぶことは出来ない。\n同盟をした国の隣国とは同盟を結ぶことは出来ない。\nただし、国ごとにその軍事的な強さは異なっている。軍事的に強くない複数の国と同盟を結ぶより、軍事的に非常に強い一国と同盟を結んだほうが有利であることも有り得る。ここでは、同盟に含まれる国の軍事的強さの和が最大になるような軍事同盟の結び方を考えたい。\nInput\n入力は複数のデータセットからなる．各データセットの形式は次の通りである。\nN\nA\n1\nB\n1\nC\n1\nD\n1,1\n...\nD\n1,C\n1\nA\n2\nB\n2\nC\n2\nD\n2,1\n...\nD\n2,C\n2\n...\nA\nN\nB\nN\nC\nN\nD\nN,1\n...\nD\nN,C\nN\n各データセットでは、1行目は国の数 N (1 ≤ N ≤ 40)が与えられ、2〜N+1行目には国の詳細が与えられる。国の詳細では、国名 A\ni\n、軍事的強さ B\ni\n、隣接している国の数 C\ni\n、隣接している国のリスト D\ni,1\n... D\ni,C\ni\nが与えられる。自国は1つ目の国 A\n1\nである。\n国名 A\ni\nは全て異なり、それぞれ1文字以上16文字以下の大文字あるいは小文字アルファベットからなる。軍事的強さ B\ni\nは0以上1000以下の整数で与えられる。隣接している国のリストにある国名 D\ni,j\nは A\n1\nから A\nN\nのうちいずれかと一致する。また、ある国の隣接国リストにその国自身が含まれることはなく、同じ国名が2回以上重複して含まれることもない。さらに、隣接関係が対称でない場合は入力に存在しない。\n入力の終了は0のみからなる行で表される。\nOutput\n各テストケースについて、自国を含めた軍事的強さの和が最大になるような同盟を考えたとき、その強さを求め、1行で出力せよ。\nSample Input\n7\nINTERCAL 10 3 Chef Piet COW\nChef 7 3 INTERCAL Piet COW\nPiet 6 2 INTERCAL Chef\nCOW 7 2 INTERCAL Chef\nJ 6 1 A\nA 12 1 J\nGrass 0 0\n7\nQin 105 4 Zhao Wei Han Chu\nZhao 81 4 Qin Wei Qi Yan\nWei 70 5 Qin Zhao Han Qi Chu\nHan 45 3 Qin Wei Chu\nQi 79 4 Zhao Wei Chu Yan\nChu 102 4 Qin Wei Han Qi\nYan 53 2 Zhao Qi\n14\nMagadha 98 8 Macedonia Kalinga Surashtra Ashmaka Kantala Andhra Gangaridai Kamapura\nMacedonia 79 2 Magadha Surashtra\nKalinga 51 2 Magadha Andhra\nSurashtra 13 3 Magadha Macedonia Ashmaka\nAshmaka 11 3 Magadha Surashtra Kantala\nKantala 12 3 Magadha Ashmaka Andhra\nAndhra 14 3 Magadha Kantala Kalinga\nCholas 15 3 Cheras Pandyas Anuradhapuras\nCheras 8 2 Cholas Pandyas\nPandyas 10 3 Cholas Cheras Anuradhapuras\nAnuradhapuras 7 2 Cholas Pandyas\nGangaridai 20 3 Magadha Kamapura Arakan\nKamapura 18 2 Magadha Gangaridai\nArakan 7 1 Gangaridai\n0\nOutput for Sample Input\n22\n184\n120"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2403_10848106","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\nmap<string, int>mp;\nint num = 0;\n\nint getnum(string st) {\n\tif (mp.find(st) == mp.end()) {\n\t\tmp[st] = num++;\n\t}\n\treturn mp[st];\n}\n\n\n\nstruct country {\n\tint num;\n\tint power;\n\tvector<int>connects;\n};\nint N;\nvector<int>rests;\nvoid getans(int now, const vector<country>&cs,vector<int>&oks,int n_power ,int&ans) {\n\tif (now == N-1) {\n\t\tans = max(ans, n_power);\n\t\treturn;\n\t}\n\telse if (rests[now] + n_power < ans) {\n\t\treturn;\n\t}\n\tif (oks[cs[now].num]) {\n\t\tvector<int>nextoks(oks);\n\t\tfor (auto con : cs[now].connects) {\n\t\t\tnextoks[con] = false;\n\t\t}\n\t\tgetans(now + 1, cs, nextoks, n_power + cs[now].power, ans);\n\t}\n\tgetans(now + 1, cs, oks, n_power, ans);\n}\n\nint main() {\n\twhile (1) {cin >> N;\n\tif (!N)break;\n\tmp.clear();\n\tnum = 0;\n\trests.clear();\n\t\tvector<vector<int>>connects(N);\n\t\tvector<int>powers(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring name;\n\t\t\tint B, C; cin >> name>> B >> C;\n\t\t\tint from = getnum(name);\n\t\t\tpowers[from] = B;\n\t\t\tfor (int j = 0; j < C; ++j) {\n\t\t\t\tstring d; cin >> d;\n\t\t\t\tint to = getnum(d);\n\t\t\t\tconnects[from].push_back(to);\n\t\t\t}\n\t\t}\n\t\tvector<country>cs;\n\t\tfor (int i = 1; i < N; ++i) {\n\t\t\tcs.push_back(country{ i,powers[i],connects[i] });\n\t\t}\n\t\tsort(cs.begin(), cs.end(), [](const country&l, const country&r) {\n\t\t\treturn l.power > r.power;\n\t\t});\n\n\t\tvector<int>oks(N,1);\n\t\tfor (auto con : connects[0]) {\n\t\t\toks[con] = false;\n\t\t}\n\t\trests=vector<int>(N);\n\n\t\tfor (int i = N -2; i >= 0; --i) {\n\t\t\trests[i] = rests[i + 1] + cs[i].power;\n\t\t}\n\t\tint ans = 0;\n\t\t\n\t\tgetans(0, cs, oks, 0, ans);\n\t\tcout <<powers[0]+ ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3408,"score_of_the_acc":-0.005,"final_rank":1},{"submission_id":"aoj_2403_10829998","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 REVERSE(x) reverse( (x).begin(),(x).end() )\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\n#define PW(x) (1LL<<(x))\n#define SZ(x) ((ll)(x).size())\n#define SHOW(x) cout << #x << \" = \" << x << endl\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \" \"; } cout << endl\n\n#define pb emplace_back\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long double ld;\ntypedef long long int ll;\ntypedef pair<int,int> pi;\ntypedef pair<ll,ll> pl;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<bool> vb;\ntypedef vector<ld> vd;\ntypedef vector<pi> vpi;\ntypedef vector<pl> vpl;\ntypedef vector<vpl> gr;\ntypedef vector<vl> ml;\ntypedef vector<vd> md;\ntypedef vector<vi> mi;\n \nconst ll INF = (ll)1e9 + 10;\nconst ll INFLL = (ll)1e18 + 10;\nconst ld EPS = 1e-12;\nconst ll MOD = 1e9+7;\n \ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\ntemplate<class T> inline T sq( T a ){ return a * a; }\n\nll in(){ long long int x; scanf( \"%lld\" , &x ); return x; }\nchar yuyushiki[1000010]; string stin(){ scanf( \"%s\" , yuyushiki ); return yuyushiki; }\n\n// head\n\nint n;\n\nint a[64];\n\nmap<string,int> ma;\n\nvector<string> sG[64];\nvector<int> G[64];\n\nll ms[64];\n\nint ans;\n\nvi v;\n\nint hstar( int p , ll mask ){\n int res = 0;\n FOR( i , p , n ){\n if( !( mask & PW(v[i]) ) ){\n res += a[v[i]];\n }\n }\n return res;\n}\n\nvoid dfs( int p , int cur, ll mask ){\n // cout << cur << \" \" << mask << endl;\n chmax( ans , cur );\n if( cur + hstar( p , mask ) <= ans ){\n return;\n }\n FOR( i , p , n ){\n if( !( mask & PW(v[i]) ) ){\n dfs( i+1 , cur + a[v[i]], mask | ms[v[i]] );\n }\n }\n}\n\nint cmp( int i , int j ){\n return a[i] > a[j];\n}\n\nint main(){\n\n while( 1 ){\n n = in();\n if( n == 0 ){\n break;\n }\n ma.clear();\n ans = 0;\n v.clear();\n REP( i , n ){\n sG[i].clear();\n G[i].clear();\n ms[i] = 0;\n }\n REP( i , n ){\n string s = stin();\n ma[s] = i;\n a[i] = in();\n int m = in();\n REP( j , m ){\n string t = stin();\n sG[i].pb( t );\n }\n }\n REP( i , n ){\n YYS( w , sG[i] ){\n G[i].pb( ma[w] );\n ms[i] = ms[i] | PW( ma[w] );\n }\n ms[i] = ms[i] | PW(i);\n }\n REP( i , n ){\n v.pb( i );\n }\n sort( ALL(v), cmp );\n dfs( 0 , a[0] , ms[0] );\n printf( \"%d\\n\" , ans );\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3692,"score_of_the_acc":-0.0087,"final_rank":2},{"submission_id":"aoj_2403_10650421","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// 型関連\nusing ll = long long;\nusing lint = long long;\nusing pll = pair<ll, ll>;\nusing plll = tuple<ll, ll, ll>;\nusing pii = pair<int, int>;\nusing piii = tuple<ll, ll, ll>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vvvvi = vector<vector<vector<vector<int>>>>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\n\ntemplate <class T> using prique = priority_queue<T>;\n\n// 型定数\nconstexpr ll mod = 998244353;\nconstexpr ll MOD = 1000000007;\nint INF32 = 2e9;\nll INF64 = 9e18;\n#define endl '\\n';\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n/////////////////////////// print関連\ntemplate <typename T> void print(vector<T> A);\nvoid print();\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\nvoid print(string S);\ntemplate <typename T> void print(vector<vector<T>> &F);\n\ninline void Yes(bool f);\n\n///////////////////ここから//////////////////////\nbool solve() {\n int N;\n cin >> N;\n if (N == 0) {\n return false;\n }\n int n = 0;\n map<string, int> name2n;\n vvi E(N, vi(N));\n vvi G(N);\n\n vi Power(N);\n for (int i = 0; i < N; i++) {\n string S;\n cin >> S;\n if (name2n.count(S) == 0) {\n name2n[S] = n;\n n++;\n }\n int u = name2n[S];\n int B, C;\n cin >> B >> C;\n Power[u] = B;\n for (int j = 0; j < C; j++) {\n string T;\n cin >> T;\n if (name2n.count(T) == 0) {\n name2n[T] = n;\n n++;\n }\n int v = name2n[T];\n E[u][v] = 1;\n G[u].emplace_back(v);\n }\n }\n // print(E);\n\n int N1 = N / 2;\n int N2 = N - N1;\n vl dp(1 << N2,-INF32);\n vi lis;\n\n for (int S1 = 0; S1 < (1 << N1); S1++) {\n if ((S1 & 1) == 0) {\n continue;\n }\n lis.clear();\n\n ll W = 0;\n bool ok = true;\n for (int i = 0; i < N1; i++) {\n if (S1 & (1 << i)) {\n for (auto v : lis) {\n if (E[i][v]) {\n ok = false;\n goto go1;\n }\n }\n lis.emplace_back(i);\n W += Power[i];\n }\n }\n\n if (ok == false) {\n go1:;\n continue;\n }\n\n int S2 = 0;\n for (int v : lis) {\n for (int i = 0; i < N2; i++) {\n if (E[v][i + N1]) {\n S2 |= (1 << i);\n }\n }\n }\n S2 ^= ((1 << N2) - 1);\n dp[S2] = max(dp[S2], W);\n }\n for (int S2 = (1 << N2) - 1; S2 >= 0; S2--) {\n for (int i = 0; i < N2; i++) {\n if (S2 & (1 << i)) {\n dp[S2 - (1 << i)] = max(dp[S2 - (1 << i)], dp[S2]);\n }\n }\n }\n\n ll ans = 0;\n\n for (int S2 = 0; S2 < (1 << N2); S2++) {\n\n lis.clear();\n ll W = 0;\n bool ok = true;\n for (int i = 0; i < N2; i++) {\n if (S2 & (1 << i)) {\n for (auto v : lis) {\n if (E[v + N1][i + N1]) {\n ok = false;\n goto go2;\n }\n }\n lis.emplace_back(i);\n W += Power[i + N1];\n }\n }\n\n if (ok == false) {\n go2:;\n continue;\n }\n ans = max(ans, W + dp[S2]);\n // print(11,W);\n }\n print(ans);\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n while (solve())\n ;\n}\n\n////////////////////print/////////////////////////\n// 1次元ベクトルを出力する\ntemplate <typename T> void print(vector<T> A) {\n if (A.size() == 0) {\n return;\n }\n for (size_t i = 0; i < A.size() - 1; i++) {\n cout << A[i] << ' ';\n }\n cout << A[A.size() - 1] << endl;\n return;\n}\n\n// 2次元ベクトルを出力する\ntemplate <typename T> void print(vector<vector<T>> &F) {\n for (size_t i = 0; i < F.size(); i++) {\n for (size_t j = 0; j < F[i].size(); j++) {\n cout << F[i][j];\n if (j < F[i].size() - 1) {\n cout << ' ';\n }\n }\n cout << endl;\n }\n}\n\n// 空白行を出力するprint\nvoid print() { cout << endl; }\n\n// 数値・文字列を空白区切りで出力する. print(a,b)など\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid print(string S) { cout << S << endl; }\n\n//////////////出力関連\n\ninline void Yes(bool f) {\n if (f) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":5460,"memory_kb":19916,"score_of_the_acc":-1.1866,"final_rank":18},{"submission_id":"aoj_2403_10615786","code_snippet":"// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do { cout << #var << \" :\\n\"; view(var); } while(0)\ntemplate<typename T>void view(const T& e) {cout << e;}\ntemplate<typename T1, typename T2>void view(const pair<T1, T2>& p) {cout << \"{\" << p.first << \", \" << p.second << \"}\";}\ntemplate<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cout << \" \";} cout << endl;}\n\nint N;\n\nvoid solve(){\n vc<string> A(N);\n vi B(N);\n vv<string> D(N);\n rep(i, N){\n cin >> A[i] >> B[i];\n int c; cin >> c;\n D[i].resize(c);\n rep(j, c) cin >> D[i][j];\n }\n if (N == 1){\n cout << B[0] << endl;\n return;\n }\n unordered_map<string, int> toid;\n rep(i, N) toid[A[i]] = i;\n vl no(N, 0);\n rep(i, N){\n for (auto d : D[i]) no[i] += (1ll << toid[d]);\n }\n int P = N / 2, Q = N - P;\n vi maxi(1 << Q, -inf);\n rep(cmb, 1 << P) if (cmb & 1){\n ll ng = 0;\n int sm = 0;\n rep(i, P) if (cmb >> i & 1){\n ng |= no[i];\n sm += B[i];\n }\n if ((ng & cmb) != 0) continue;\n ng >>= P;\n ll ok = ((1 << Q) - 1) ^ ng;\n maxi[ok] = max(maxi[ok], sm);\n }\n\n // for (ll cmb = (1 << Q) - 1; cmb >= 0; cmb--){\n // rep(i, Q) if (cmb >> i & 1) maxi[cmb ^ (1 << i)] = max(maxi[cmb], maxi[cmb ^ (1 << i)]);\n // }\n for (int i = 0; i < Q; i++){\n for (int S = 0; S < 1 << Q; S++){\n if (~S & (1 << i)){\n maxi[S] = max(maxi[S], maxi[S ^ (1 << i)]);\n }\n }\n }\n\n int ans = 0;\n rep(cmb, 1 << Q){\n ll ncmb = cmb << P;\n ll ng = 0;\n int sm = 0;\n srep(i, P, N) if (ncmb >> i & 1){\n ng |= no[i];\n sm += B[i];\n }\n if ((ng & ncmb) != 0) continue;\n\n ans = max(ans, sm + maxi[cmb]);\n }\n cout << ans << endl;\n}\n\nint main(){\n while (true){\n cin >> N;\n if (N == 0) break;\n solve();\n }\n}","accuracy":1,"time_ms":4860,"memory_kb":7852,"score_of_the_acc":-0.7423,"final_rank":6},{"submission_id":"aoj_2403_10615782","code_snippet":"// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do { cout << #var << \" :\\n\"; view(var); } while(0)\ntemplate<typename T>void view(const T& e) {cout << e;}\ntemplate<typename T1, typename T2>void view(const pair<T1, T2>& p) {cout << \"{\" << p.first << \", \" << p.second << \"}\";}\ntemplate<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cout << \" \";} cout << endl;}\ntemplate<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cout << \" \";} cout << endl;}\n\nint N;\n\nvoid solve(){\n vc<string> A(N);\n vi B(N);\n vv<string> D(N);\n rep(i, N){\n cin >> A[i] >> B[i];\n int c; cin >> c;\n D[i].resize(c);\n rep(j, c) cin >> D[i][j];\n }\n if (N == 1){\n cout << B[0] << endl;\n return;\n }\n unordered_map<string, int> toid;\n rep(i, N) toid[A[i]] = i;\n vl no(N, 0);\n rep(i, N){\n for (auto d : D[i]) no[i] += (1ll << toid[d]);\n }\n int P = N / 2, Q = N - P;\n vi maxi(1 << Q, -inf);\n rep(cmb, 1 << P) if (cmb & 1){\n ll ng = 0;\n int sm = 0;\n rep(i, P) if (cmb >> i & 1){\n ng |= no[i];\n sm += B[i];\n }\n if ((ng & cmb) != 0) continue;\n ng >>= P;\n ll ok = ((1 << Q) - 1) ^ ng;\n maxi[ok] = max(maxi[ok], sm);\n }\n\n for (ll cmb = (1 << Q) - 1; cmb >= 0; cmb--){\n rep(i, Q) if (cmb >> i & 1) maxi[cmb ^ (1 << i)] = max(maxi[cmb], maxi[cmb ^ (1 << i)]);\n }\n\n\n int ans = 0;\n rep(cmb, 1 << Q){\n ll ncmb = cmb << P;\n ll ng = 0;\n int sm = 0;\n srep(i, P, N) if (ncmb >> i & 1){\n ng |= no[i];\n sm += B[i];\n }\n if ((ng & ncmb) != 0) continue;\n\n ans = max(ans, sm + maxi[cmb]);\n }\n cout << ans << endl;\n}\n\nint main(){\n while (true){\n cin >> N;\n if (N == 0) break;\n solve();\n }\n}","accuracy":1,"time_ms":7010,"memory_kb":7928,"score_of_the_acc":-1.0158,"final_rank":13},{"submission_id":"aoj_2403_10599092","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\n#define OVERLOAD_REP(_1, _2, _3, _4, 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, n) for (ll i=a;i<(n);i++)\n#define REP4(i, a, b, n) for(ll i=a;i<(n);i+=b)\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\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, n) for(ll i=(n)-1;i>=(a);i--)\n#define RREP4(i, a, b, n) for(ll i=(n)-1;i>=(a);i-=(b))\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define len(n) (long long)(n).size()\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vvvs = vector<vvs>;\nusing vld = vector<ld>;\nusing vvld = vector<vld>;\nusing vvvld = vector<vvld>;\nusing vc = vector<char>;\nusing vvc = vector<vc>;\nusing vvvc = vector<vvc>;\nusing pll = pair<ll,ll>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vpll>;\n\nll intpow(ll a,ll b){\n ll ans = 1;\n while (b){\n if (b & 1){\n ans *= a;\n }\n a *= a;\n b /= 2;\n }\n return ans;\n}\nll modpow(ll a,ll b,ll c){\n ll ans = 1;\n while (b){\n if (b & 1){\n ans *= a;\n ans %= c;\n }\n a *= a;\n a %= c;\n b /= 2;\n }\n return ans;\n}\n\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\n\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define PLL(name) pll name;cin>>name.first>>name.second;\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\n\nvoid print(){cout << \"\\n\";}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {\n os << \"(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {\n os << \"[\";\n for (size_t i = 0; i < vec.size(); ++i) {\n os << vec[i];\n if (i + 1 < vec.size()) os << \", \";\n }\n os << \"]\";\n return os;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::pair<T1, T2>>& a) {\n os << \"[\";\n for (size_t j = 0; j < a.size(); ++j) {\n os << \"(\" << a[j].first << \", \" << a[j].second << \")\";\n\t\tif (j + 1 < a.size()) os << \", \";\n }\n\tos << \"]\";\n return os;\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::vector<std::pair<T1, T2>>>& mat) {\n\tos << \"[\";\n for (size_t i = 0; i < mat.size(); ++i) {\n\t\tos << \"[\";\n for (size_t j = 0; j < mat[i].size(); ++j) {\n os << \"(\" << mat[i][j].first << \", \" << mat[i][j].second << \")\";\n\t\t\tif (j + 1 < mat[i].size()) os << \", \";\n }\n\t\tos << \"]\";\n\t\tif (i + 1 < mat.size()) os << \", \";\n }\n\tos << \"]\";\n return os;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, const std::set<T>& s) {\n os << \"{\";\n bool first = true;\n for (const auto& x : s) {\n if (!first) os << \", \";\n os << x;\n first = false;\n }\n os << \"}\";\n return os;\n}\n\ntemplate <typename K, typename V>\nstd::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {\n os << \"{\";\n bool first = true;\n for (const auto& [key, val] : m) {\n if (!first) os << \", \";\n os << key << \": \" << val;\n first = false;\n }\n os << \"}\";\n return os;\n}\n\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\n\nvoid write(){cout << \"\\n\";}\ntemplate<class T, class... Ts>\nvoid write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\nvoid write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\nvoid write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \" \";}else if(j!=len(x[i])-1){cout << \" | \";}else{cout << '\\n';}}}\nvoid write(pll x){cout << x.first << ' ' << x.second << '\\n';}\nvoid write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\\n';}}\nvoid write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\n\ntemplate <typename T>\nT sum(const std::vector<T>& v) {\n return std::accumulate(v.begin(), v.end(), T(0));\n}\n\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; }\n\n\n\n\nint main(){\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n while(1){\n LL(n);\n if(n == 0){break;}\n vs name(n);\n vll x(n);\n vvs neighbor(n);\n map<string,int> mp;\n rep(i,n){\n STR(s);\n mp[s] = i;\n LL(z);\n name[i] = s;\n x[i] = z;\n LL(cnt);\n rep(j,cnt){\n STR(t);\n neighbor[i].push_back(t);\n }\n }\n vvll edge(n);\n rep(i,n){\n for(string t:neighbor[i]){\n edge[i].push_back(mp[t]);\n }\n }\n ll m = n / 2;\n vll dp(1<<m,-1LL<<60);\n rep(i,(1<<m)){\n if(((i >> 0) & 1) == 0){continue;}\n ll temp = 0;\n ll c = 0;\n rep(j,m){\n if(((i >> j) & 1) == 1){\n temp += x[j];\n for(ll to:edge[j]){\n if(0 <= to && to < m && ((i >> to) & 1) == 1){\n c = 1;\n break;\n }\n }\n }\n }\n if(c){continue;}\n dp[i] = temp;\n }\n\n rep(i,m){\n rep(j,(1<<m)){\n if(((j >> i) & 1) == 0){\n chmax(dp[j | (1 << i)],dp[j]);\n }\n }\n }\n\n ll ans = 0;\n ll r = n - m;\n rep(i,(1<<r)){\n ll temp = 0;\n ll c = 0;\n rep(j,r){\n if(((i >> j) & 1) == 1){\n temp += x[j+m];\n for(ll to:edge[j+m]){\n if(m <= to && ((i >> (to - m)) & 1) == 1){\n c = 1;\n break;\n }\n }\n }\n }\n if(c){continue;}\n ll v = (1 << m) - 1;\n rep(j,r){\n if(((i >> j) & 1) == 1){\n for(ll to:edge[j+m]){\n if(to < m && ((v >> to) & 1) == 1){\n v ^= (1 << to);\n }\n }\n }\n }\n chmax(ans,temp + dp[v]);\n }\n write(ans);\n }\n}","accuracy":1,"time_ms":7330,"memory_kb":11836,"score_of_the_acc":-1.1755,"final_rank":17},{"submission_id":"aoj_2403_10418251","code_snippet":"/**\n\tauthor: shobonvip\n\tcreated: 2025.04.24 18:44:48\n**/\n\n#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#define all(v) v.begin(), v.end()\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\nvoid solve(int n) {\n\tvector<string>name(n);\n\tvector lst(n,vector<string>(0));\n\tvector<int> b(n);\n\n\trep(i,0,n){\n\t\tcin>>name[i];\n\t\tcin>>b[i];\n\t\tint c;cin>>c;\n\t\trep(j,0,c){\n\t\t\tstring t;cin>>t;\n\t\t\tlst[i].push_back(t);\n\t\t}\n\t}\n\n\tmap<string,int> mp;\n\trep(i,0,n){\n\t\tmp[name[i]]=i;\n\t}\n\n\tvector<ll> edge(n);\n\trep(i,0,n){\n\t\tfor(string &j:lst[i]){\n\t\t\tedge[i]|=1LL<<mp[j];\n\t\t}\n\t}\n\n\tif(n<=0){\n\t\tint ans=0;\n\t\trep(i,0,1<<n){\n\t\t\tif(!(i&1))continue;\n\t\t\tbool mode=1;\n\t\t\tint tmp=0;\n\t\t\trep(j,0,n){\n\t\t\t\tif(i>>j&1){\n\t\t\t\t\ttmp+=b[j];\n\t\t\t\t\tif((edge[j]&i)>0){\n\t\t\t\t\t\tmode=0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(mode){\n\t\t\t\tchmax(ans,tmp);\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<'\\n';\n\t}\n\n\tint m=(n+1)/2;\n\tvector<int> d(1<<m,(int)-1e9);\n\trep(i,0,1<<m){\n\t\tif(!(i&1))continue;\n\t\tbool mode=1;\n\t\tint tmp=0;\n\t\trep(j,0,m){\n\t\t\tif(i>>j&1){\n\t\t\t\ttmp+=b[j];\n\t\t\t\tif((edge[j]&i)>0){\n\t\t\t\t\tmode=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(mode){\n\t\t\tchmax(d[i],tmp);\n\t\t}\n\t}\n\n\trep(i,0,m){\n\t\tint mask=1<<i;\n\t\trep(j,0,1<<m){\n\t\t\tif(mask&j)continue;\n\t\t\tchmax(d[mask|j],d[j]);\n\t\t}\n\t}\n\n\tint ans=0;\n\trep(i,0,1<<(n-m)){\n\t\tbool mode=1;\n\t\tint tmp=0;\n\t\tll sihai=0;\n\t\trep(j,0,n-m){\n\t\t\tif(i>>j&1){\n\t\t\t\ttmp+=b[j+m];\n\t\t\t\tif(((edge[j+m]>>m)&i)>0){\n\t\t\t\t\tmode=0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tsihai|=edge[j+m];\n\t\t\t}\n\t\t}\n\t\tif(!mode)continue;\n\t\tsihai&=(1LL<<m)-1;\n\t\tsihai^=(1LL<<m)-1;\n\t\tchmax(ans,tmp+d[sihai]);\n\t}\n\tcout<<ans<<'\\n';\n\t\n}\n\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\t\n\twhile(true){\n\t\tint n; cin >> n;\n\t\tif(n==0)break;\n\t\tsolve(n);\n\t}\n}","accuracy":1,"time_ms":2130,"memory_kb":7624,"score_of_the_acc":-0.3911,"final_rank":3},{"submission_id":"aoj_2403_10418204","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll ILL=2167167167167167167;\nconst int INF=100000000;\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,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;});}\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\"YES\\n\":\"Yes\\n\");}else{cout<<(upp?\"NO\\n\":\"No\\n\");}return a;}\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\",\";}cout<<'\"'<<p[i]<<'\"';}cout<<\"}\\n\";}\n else{if(ty==1){cout<<p.size()<<\"\\n\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}}\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\ntemplate<class T> T square(T a){return a * a;}\n\nint N;\n\nvoid solve();\n// CITRUS CURIO CITY / FREDERIC\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (cin >> N, N) solve();\n}\n\nvoid solve(){\n vector<string> A(N);\n vector<int> B(N);\n vector<vector<string>> D(N);\n rep(i, 0, N){\n cin >> A[i] >> B[i];\n int c;\n cin >> c;\n D[i].resize(c);\n for (auto &a : D[i]) cin >> a;\n }\n map<string, int> m;\n rep(i, 0, N) m[A[i]] = i;\n vector G(N, vector<int>(N));\n rep(i, 0, N) for (auto x : D[i]) G[i][m[x]] = 1;\n auto f = [&](int l, int r) -> vector<int> {\n vector<int> ban(1 << (r - l));\n rep(i, l, r) rep(j, l, r) if (G[i][j]){\n ban[(1 << (i - l)) + (1 << (j - l))] = 1;\n }\n rep(i, 0, r - l) rep(j, 0, 1 << (r - l)) if (j & (1 << i)){\n if (ban[j - (1 << i)]) ban[j] = 1;\n }\n // vec_out(ban);\n rep(i, 0, 1 << (r - l)){\n if (ban[i] == 1) ban[i] = -INF;\n else{\n rep(k, 0, r - l) if (i & (1 << k)) ban[i] += B[l + k];\n }\n }\n if (l == 0) return ban;\n rep(i, 0, r - l) rep(j, 0, 1 << (r - l)) if (j & (1 << i)){\n chmax(ban[j], ban[j - (1 << i)]);\n }\n // vec_out(ban);\n return ban;\n };\n int mid = N / 2;\n auto X = f(0, mid);\n auto Y = f(mid, N);\n int ans = 0;\n vector<int> cov(1 << mid);\n rep(i, 0, mid) rep(j, mid, N) if (G[i][j]) cov[1 << i] += (1 << (j - mid));\n rep(i, 0, mid) rep(j, 0, 1 << mid) if (j & (1 << i)) cov[j] = (cov[j] | cov[j - (1 << i)]);\n rep(i, 0, 1 << mid) if (i & 1) {\n if (chmax(ans, X[i] + Y[(1 << (N - mid)) - 1 - cov[i]])){\n // cout << i << \" \" << cov << endl;\n }\n }\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":4520,"memory_kb":15748,"score_of_the_acc":-0.9407,"final_rank":11},{"submission_id":"aoj_2403_9460895","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() {\nwhile(1) {\n int N;\n cin >> N;\n if (N == 0) return 0;\n vector<string> A(N);\n vector<ll> B(N);\n vector<vector<string>> C(N);\n map<string,int> mp;\n rep(i,0,N) {\n cin >> A[i] >> B[i];\n mp[A[i]] = i;\n int c;\n cin >> c;\n rep(j,0,c) {\n string s;\n cin >> s;\n C[i].push_back(s);\n }\n }\n vector<ll> G(N,0);\n rep(i,0,N) {\n for (string s : C[i]) {\n G[i] |= (1LL << mp[s]);\n }\n }\n int M = (N + 1) / 2, K = N - M;\n vector<ll> LC(1<<M,0), RC(1<<K,0), L(1<<M,-INF), R(1<<K,-INF);\n rep(i,0,1<<M) {\n ll X = 0, COUNT = 0;\n rep(j,0,M) {\n if ((i>>j)&1) {\n X |= G[j];\n COUNT += B[j];\n }\n }\n if ((X & i) == 0) {\n LC[i] = X;\n L[i] = COUNT;\n }\n }\n rep(i,0,1<<K) {\n ll X = 0, COUNT = 0;\n rep(j,0,K) {\n if ((i>>j)&1) {\n X |= G[j+M];\n COUNT += B[j+M];\n }\n }\n if ((X & ((ll)i<<M)) == 0) {\n RC[i] = X;\n R[i] = COUNT;\n }\n }\n rep(i,0,K) {\n rep(j,0,1<<K) {\n chmax(R[j|(1<<i)],R[j]);\n }\n }\n ll ANS = -INF;\n rep(i,0,1<<M) {\n if ((i&1)==0) continue;\n if (L[i] == -INF) continue;\n ll Comp = (1LL<<N) - 1 - LC[i];\n Comp >>= M;\n chmax(ANS,L[i]+R[Comp]);\n }\n cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":6060,"memory_kb":36140,"score_of_the_acc":-1.7579,"final_rank":20},{"submission_id":"aoj_2403_8946365","code_snippet":"#include <bits/stdc++.h>\n\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\nusing namespace zawa;\n\nvoid input(int n, std::vector<std::vector<bool>>& g, std::vector<int>& b) {\n std::vector<std::string> a(n);\n std::vector adj(n, std::vector<std::string>{});\n for (int i{} ; i < n ; i++) {\n std::cin >> a[i] >> b[i];\n int deg; std::cin >> deg;\n adj[i].resize(deg);\n for (auto& s : adj[i]) std::cin >> s;\n }\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < (int)adj[i].size() ; j++) {\n for (int k{} ; k < n ; k++) {\n if (a[k] == adj[i][j]) {\n g[i][k] = true;\n break;\n }\n }\n }\n }\n}\n\nbool solve() {\n int n; std::cin >> n;\n if (n == 0) return false;\n std::vector g(n, std::vector<bool>(n));\n std::vector<int> b(n);\n input(n, g, b);\n int p{n / 2}, q{n - p};\n std::vector<int> sL(1 << p);\n std::vector<bool> canL(1 << p);\n {\n std::vector<int> ng(p);\n for (int i{} ; i < p ; i++) {\n for (int j{i + 1} ; j < p ; j++) {\n if (g[i][j]) ng[i] |= (1 << j);\n }\n }\n for (int bit{} ; bit < (1 << p) ; bit++) {\n bool ok{true};\n for (int i{} ; i < p ; i++) {\n if (bit & (1 << i)) {\n ok &= (bit & ng[i]) == 0;\n sL[bit] += b[i];\n }\n }\n if (ok) canL[bit] = true;\n }\n }\n std::vector<int> sR(1 << q);\n std::vector<bool> canR(1 << q);\n {\n std::vector<int> ng(q);\n for (int i{} ; i < q ; i++) {\n for (int j{i + 1} ; j < q ; j++) {\n if (g[p + i][p + j]) ng[i] |= (1 << j);\n }\n }\n for (int bit{} ; bit < (1 << q) ; bit++) {\n bool ok{true};\n for (int i{} ; i < q ; i++) {\n if (bit & (1 << i)) {\n ok &= (bit & ng[i]) == 0;\n sR[bit] += b[p + i];\n }\n }\n if (ok) canR[bit] = true;\n }\n }\n std::vector<int> R(1 << q);\n for (int bit{} ; bit < (1 << q) ; bit++) {\n if (canR[bit]) R[bit] = sR[bit];\n }\n for (int i{} ; i < q ; i++) {\n for (int bit{} ; bit < (1 << q) ; bit++) {\n if (!(bit & (1 << i))) {\n int tar{bit | (1 << i)};\n R[tar] = std::max(R[tar], R[bit]);\n }\n }\n } \n std::vector<int> ngLR(p);\n for (int i{} ; i < p ; i++) {\n for (int j{} ; j < q ; j++) {\n if (g[i][p + j]) {\n ngLR[i] |= (1 << j);\n }\n }\n }\n int ans{};\n for (int bit{} ; bit < (1 << p) ; bit++) {\n // 未来の自分へ、このコードを使う時はこの行を消すこと\n if (!(bit & (1 << 0))) continue;\n if (!canL[bit]) continue;\n int ok{};\n for (int i{} ; i < p ; i++) if (bit & (1 << i)) {\n ok |= ngLR[i];\n }\n ok = ((1 << q) - 1) ^ ok;\n int L{sL[bit]};\n int val{L + R[ok]};\n ans = std::max(ans, val);\n }\n std::cout << ans <<'\\n';\n return true;\n}\n\nint main() {\n SetFastIO();\n\n for (int i{} ; solve() ; i++) {\n }\n}","accuracy":1,"time_ms":6270,"memory_kb":15796,"score_of_the_acc":-1.1628,"final_rank":15},{"submission_id":"aoj_2403_8946362","code_snippet":"#include <bits/stdc++.h>\n\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\nusing namespace zawa;\n\nvoid input(int n, std::vector<std::vector<bool>>& g, std::vector<int>& b) {\n std::vector<std::string> a(n);\n std::vector adj(n, std::vector<std::string>{});\n for (int i{} ; i < n ; i++) {\n std::cin >> a[i] >> b[i];\n int deg; std::cin >> deg;\n adj[i].resize(deg);\n for (auto& s : adj[i]) std::cin >> s;\n }\n for (int i{} ; i < n ; i++) {\n for (int j{} ; j < (int)adj[i].size() ; j++) {\n for (int k{} ; k < n ; k++) {\n if (a[k] == adj[i][j]) {\n g[i][k] = true;\n break;\n }\n }\n }\n }\n}\n\nbool solve() {\n int n; std::cin >> n;\n if (n == 0) return false;\n std::vector g(n, std::vector<bool>(n));\n std::vector<int> b(n);\n input(n, g, b);\n int p{n / 2}, q{n - p};\n std::vector<int> sL(1 << p);\n std::vector<bool> canL(1 << p);\n {\n std::vector<int> ng(p);\n for (int i{} ; i < p ; i++) {\n for (int j{i + 1} ; j < p ; j++) {\n if (g[i][j]) ng[i] |= (1 << j);\n }\n }\n for (int bit{} ; bit < (1 << p) ; bit++) {\n bool ok{true};\n for (int i{} ; i < p ; i++) {\n if (bit & (1 << i)) {\n ok &= (bit & ng[i]) == 0;\n sL[bit] += b[i];\n }\n }\n if (ok) canL[bit] = true;\n }\n }\n std::vector<int> sR(1 << q);\n std::vector<bool> canR(1 << q);\n {\n std::vector<int> ng(q);\n for (int i{} ; i < q ; i++) {\n for (int j{i + 1} ; j < q ; j++) {\n if (g[p + i][p + j]) ng[i] |= (1 << j);\n }\n }\n for (int bit{} ; bit < (1 << q) ; bit++) {\n bool ok{true};\n for (int i{} ; i < q ; i++) {\n if (bit & (1 << i)) {\n ok &= (bit & ng[i]) == 0;\n sR[bit] += b[p + i];\n }\n }\n if (ok) canR[bit] = true;\n }\n }\n std::vector<int> R(1 << q);\n for (int bit{} ; bit < (1 << q) ; bit++) {\n if (canR[bit]) R[bit] = sR[bit];\n }\n for (int i{} ; i < q ; i++) {\n for (int bit{} ; bit < (1 << q) ; bit++) {\n if (!(bit & (1 << i))) {\n int tar{bit | (1 << i)};\n R[tar] = std::max(R[tar], R[bit]);\n }\n }\n } \n std::vector<int> ngLR(p);\n for (int i{} ; i < p ; i++) {\n for (int j{} ; j < q ; j++) {\n if (g[i][p + j]) {\n ngLR[i] |= (1 << j);\n }\n }\n }\n int ans{};\n for (int bit{} ; bit < (1 << p) ; bit++) {\n if (!(bit & (1 << 0))) continue;\n if (!canL[bit]) continue;\n int ok{};\n for (int i{} ; i < p ; i++) if (bit & (1 << i)) {\n ok |= ngLR[i];\n }\n ok = ((1 << q) - 1) ^ ok;\n int L{sL[bit]};\n int val{L + R[ok]};\n ans = std::max(ans, val);\n }\n std::cout << ans <<'\\n';\n return true;\n}\n\nint main() {\n SetFastIO();\n\n for (int i{} ; solve() ; i++) {\n }\n}","accuracy":1,"time_ms":6270,"memory_kb":15808,"score_of_the_acc":-1.1632,"final_rank":16},{"submission_id":"aoj_2403_8321543","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\twhile (true) {\n\t\tint N;\n\t\tcin >> N;\n\t\tif (N == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<int> W(N);\n\t\tvector<string> S(N);\n\t\tvector<vector<string> > T(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tint c;\n\t\t\tcin >> S[i] >> W[i] >> c;\n\t\t\tT[i].resize(c);\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tcin >> T[i][j];\n\t\t\t}\n\t\t}\n\t\tvector<uint64_t> G(N);\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tfor (int j = 0; j < T[i].size(); j++) {\n\t\t\t\tint pos = find(S.begin(), S.end(), T[i][j]) - S.begin();\n\t\t\t\tG[i] |= uint64_t(1) << pos;\n\t\t\t}\n\t\t}\n\t\tint m = N / 2;\n\t\tvector<int> dp(1 << (N - m));\n\t\tfor (int i = 0; i < (1 << (N - m)); i++) {\n\t\t\tbool valid = true;\n\t\t\tint weight = 0;\n\t\t\tfor (int j = 0; j < N - m; j++) {\n\t\t\t\tif ((i >> j) & 1) {\n\t\t\t\t\tif (((G[j + m] >> m) & i) != 0) {\n\t\t\t\t\t\tvalid = false;\n\t\t\t\t\t}\n\t\t\t\t\tweight += W[j + m];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (valid) {\n\t\t\t\tdp[i] = weight;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N - m; i++) {\n\t\t\tfor (int j = 0; j < (1 << (N - m)); j++) {\n\t\t\t\tif ((j >> i) & 1) {\n\t\t\t\t\tdp[j] = max(dp[j], dp[j ^ (1 << i)]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 1; i < (1 << m); i += 2) {\n\t\t\tbool valid = true;\n\t\t\tint adj = 0;\n\t\t\tint weight = 0;\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif ((i >> j) & 1) {\n\t\t\t\t\tif ((G[j] & i) != 0) {\n\t\t\t\t\t\tvalid = false;\n\t\t\t\t\t}\n\t\t\t\t\tadj |= (G[j] >> m);\n\t\t\t\t\tweight += W[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (valid) {\n\t\t\t\tans = max(ans, weight + dp[((1 << (N - m)) - 1) - adj]);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":4630,"memory_kb":7664,"score_of_the_acc":-0.7076,"final_rank":5},{"submission_id":"aoj_2403_8219578","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\n\nmt19937 engine(42);\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nbool is_end = false;\n\nll calc_cc(vector<ll> &connected, vector<ll> &weight, vector<vector<ll>> &graph, bool has_root = false)\n{\n ll N = weight.size();\n ll ret = 0;\n \n for (int loop = 0; loop < 100000; ++loop)\n {\n shuffle(connected.begin(), connected.end(), engine);\n \n vector<bool> skip(N, false);\n ll tmp = 0;\n \n if (has_root)\n {\n tmp += weight[0];\n skip[0] = true;\n for (int j = 0; j < N; ++j)\n {\n if (graph[0][j]) {skip[j] = true;}\n }\n }\n \n for (auto v : connected)\n {\n if (skip[v]) {continue;}\n \n tmp += weight[v];\n for (int j = 0; j < N; ++j)\n {\n if (graph[v][j]) {skip[j] = true;}\n }\n }\n \n chmax(ret, tmp);\n }\n \n return ret;\n}\n\nvoid calc()\n{\n ll N; cin >> N;\n if (N == 0)\n {\n is_end = true;\n return;\n }\n \n vector<vector<string>> adj(N);\n map<string, ll> idx;\n vector<ll> weight(N);\n ll num = 0;\n for (int i = 0; i < N; ++i)\n {\n string S; cin >> S;\n idx[S] = num;\n num++;\n ll W, C; cin >> W >> C;\n weight[i] = W;\n for (int j = 0; j < C; ++j)\n {\n string T; cin >> T;\n adj[i].emplace_back(T);\n }\n }\n \n vector<vector<ll>> G(N, vector<ll>(N, 0));\n for (int i = 0; i < N; ++i)\n {\n for (auto s : adj[i])\n {\n ll j = idx[s];\n G[i][j] = G[j][i] = 1;\n }\n }\n \n vector<bool> used(N, false);\n ll res = 0;\n \n for (int i = 0; i < N; ++i)\n {\n if (used[i]) {continue;}\n \n vector<ll> connected;\n \n queue<ll> que;\n que.push(i);\n used[i] = true;\n \n while (!que.empty())\n {\n ll v = que.front();\n que.pop();\n connected.emplace_back(v);\n \n for (int j = 0; j < N; ++j)\n {\n if (G[v][j] && !used[j])\n {\n que.push(j);\n used[j] = true;\n }\n }\n }\n \n res += calc_cc(connected, weight, G, i == 0);\n }\n \n cout << res << endl;\n \n return;\n}\n\nint main() {\n \n while (!is_end)\n {\n calc();\n }\n \n return 0;\n}","accuracy":1,"time_ms":6430,"memory_kb":3616,"score_of_the_acc":-0.8109,"final_rank":8},{"submission_id":"aoj_2403_7961030","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\nusing vd =vector<double>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\n\nll MW(vvll &G,vll& W){\n ll N=G.size();\n ll N1=N/2;\n ll N2=N-N1;\n vll V11(N1),V12(N1),V22(N2);\n rep(i,N){\n for(auto j:G[i]){\n if(i<N1&&j<N1)V11[i]|=(1<<j);\n if(i<N1&&j>=N1)V12[i]|=(1<<(j-N1));\n if(i>=N1&&j>=N1)V22[i-N1]|=(1<<(j-N1));\n }\n }\n vll DP(1<<N2);\n //N2側内で求める\n rep(bit,(1<<N2)){\n ll res=0;\n ll n=0;\n rep(i,N2){\n if(bit&(1<<i)){\n res+=W[N1+i];\n n|=V22[i];\n }\n }\n if(!(n&bit)){\n chmax(DP[bit],res);\n }\n rep(i,N2){\n if(bit&(1<<i)){\n\n }\n else{\n chmax(DP[bit|(1<<i)],DP[bit]);\n }\n }\n }\n ll an=0;\n //N1内で求めて, 結合\n rep(bit,(1<<N1)){\n //if(!(bit&1))continue;\n ll res=0;\n ll n1=0,n2=0;\n rep(i,N1){\n if(bit&(1<<i)){\n res+=W[i];\n n1|=V11[i];\n n2|=V12[i];\n }\n }\n if(!(n1&bit)){\n chmax(an,res+DP[n2^((1<<N2)-1)]);\n }\n }\n return an;\n}\n\nint main() {\n while(1){\n ll N;\n cin>>N;\n \n if(N==0)return 0;\n vector<string> A(N);\n vll B(N);\n vector<vector<ll>> C(N);\n vector<vector<string>> D(N);\n map<string,ll> M; \n rep(i,N){\n cin>>A[i]>>B[i];\n ll c;\n cin>>c;\n rep(j,c){\n string S;\n cin>>S;\n D[i].push_back(S);\n }\n M[A[i]]=i;\n }\n \n rep(i,N){\n ll c=D[i].size();\n rep(j,c){\n C[i].push_back(M[D[i][j]]);\n }\n }\n ll b=B[0];\n B[0]=1e10;\n //cout<<1<<endl;\n ll an=MW(C,B);\n cout<<an-B[0]+b<<endl;\n \n }\n \n}","accuracy":1,"time_ms":7980,"memory_kb":11804,"score_of_the_acc":-1.2565,"final_rank":19},{"submission_id":"aoj_2403_7867446","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n) {\n string as[40];\n int bs[40], cs[40];\n // vector< string > as(n);\n // vector< int > bs(n);\n // vector< int > cs(n);\n vector< vector< string > > dss(n);\n\n map< string, int > to_node;\n for (int i = 0; i < n; i++) {\n cin >> as[i];\n to_node[as[i]] = i;\n\n cin >> bs[i] >> cs[i];\n dss[i].resize(cs[i]);\n for (auto &d: dss[i]) {\n cin >> d;\n }\n }\n\n int g[40][40] = {};\n // auto g = vector(n, vector(n, 0));\n for (int v = 0; v < n; v++) {\n for (const auto &d: dss[v]) {\n int u = to_node[d];\n g[v][u] = 1;\n }\n }\n\n pair pre(0, n / 2), post(n / 2, n); // [first, second)\n\n bitset< (1 << 20) > pre_err;\n // int pre_err[1 << 20] = {};\n for (int u = pre.first; u < pre.second; u++) {\n for (int v = u + 1; v < pre.second; v++) {\n if (g[u][v] == 0) continue;\n pre_err[(1 << u) | (1 << v)] = 1;\n }\n }\n for (int bit = 0; bit < 1 << (pre.second - pre.first); bit++) {\n if (not pre_err[bit]) continue;\n for (int i = 0; i < (pre.second - pre.first); i++) {\n pre_err[bit | (1 << i)] = 1;\n }\n }\n\n bitset< (1 << 20) > post_err;\n // int post_err[1 << 20] = {};\n for (int u = post.first; u < post.second; u++) {\n for (int v = u + 1; v < post.second; v++) {\n if (g[u][v] == 0) continue;\n post_err[(1 << (u - post.first)) | (1 << (v - post.first))] = 1;\n }\n }\n for (int bit = 0; bit < 1 << (post.second - post.first); bit++) {\n if (not post_err[bit]) continue;\n for (int i = 0; i < (post.second - post.first); i++) {\n post_err[bit | (1 << i)] = 1;\n }\n }\n\n int dp[1 << 20] = {};\n // vector< int > dp(1 << (post.second - post.first), 0);\n { // precalc\n int size = post.second - post.first;\n for (int bit = 0; bit < (1 << size); bit++) {\n\n // check edge is not exist\n // bool edge_exist = false;\n // for (int u = 0; u < size; u++) {\n // if ((bit & (1 << u)) == 0) continue;\n // for (int v = u + 1; v < size; v++) {\n // if ((bit & (1 << v)) == 0) continue;\n // if (g[u + post.first][v + post.first] == 0) continue;\n // edge_exist = true;\n // break;\n // }\n // }\n // if (edge_exist) continue;\n if (post_err[bit]) continue;\n\n for (int v = 0; v < size; v++) {\n if ((bit & (1 << v)) == 0) continue;\n dp[bit] += bs[v + post.first];\n }\n }\n \n for (int bit = 0; bit < (1 << size); bit++) {\n for (int i = 0; i < size; i++) {\n dp[bit | (1 << i)] = max(dp[bit], dp[bit | (1 << i)]);\n }\n }\n\n } // precalc end\n\n int ans = 0;\n int size = pre.second - pre.first;\n for (int bit = 0; bit < (1 << size); bit++) {\n if ((bit & 1) == 0) continue; // my country\n\n // bool edge_exist = false;\n // for (int u = 0; u < size; u++) {\n // if ((bit & (1 << u)) == 0) continue;\n // for (int v = u + 1; v < size; v++) {\n // if ((bit & (1 << v)) == 0) continue;\n // if (g[u][v] == 0) continue;\n // edge_exist = true;\n // break;\n // }\n // }\n // if (edge_exist) continue;\n if (pre_err[bit]) continue;\n\n int subset = 0;\n for (int v = post.first; v < post.second; v++) {\n bool contain_subset = true;\n for (int u = pre.first; u < pre.second; u++) {\n if ((bit & (1 << u)) == 0) continue;\n if (g[u][v] == 0) continue;\n contain_subset = false;\n break;\n }\n if (contain_subset) subset |= (1 << (v - post.first));\n }\n\n int sum = 0;\n for (int v = pre.first; v < pre.second; v++) {\n if ((bit & (1 << v)) == 0) continue;\n sum += bs[v];\n }\n\n sum += dp[subset];\n ans = max(ans, sum);\n }\n\n cout << ans << endl;\n}\n\nint main() {\n int n;\n while (cin >> n, n) {\n solve(n);\n }\n}","accuracy":1,"time_ms":7240,"memory_kb":8028,"score_of_the_acc":-1.0478,"final_rank":14},{"submission_id":"aoj_2403_6705094","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#include <random>\n#include <complex>\n#include <bitset>\n#include <iomanip>\n#include <memory>\n#include <functional>\n\n#define rep(i, n, s) for (int i = (s); i < int(n); i++)\n#define per(i, n, s) for (int i = (n) - 1; i >= int(s); i--)\n#define MM << \" \" <<\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n\ntemplate <class T>\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <class T>\nusing MaxHeap = std::priority_queue<T>;\n\nusing ll = long long;\nusing Pii = std::pair<int, int>;\nusing Pll = std::pair<ll, ll>;\nusing Pdd = std::pair<double, double>;\n\ntemplate <class T>\nbool chmin(T &a, const T b) {\n if (b < a) {\n a = b;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nbool chmax(T &a, const T b) {\n if (a < b) {\n a = b;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T>\nvoid vdeb(const std::vector<T> &da) {\n auto n = da.size();\n for (size_t i = 0; i < n; i++) {\n if (i == n - 1)\n std::cout << da[i];\n else\n std::cout << da[i] << \" \";\n }\n std::cout << std::endl;\n}\ntemplate<class T>\nvoid vdeb(const std::vector<std::vector<T>> &da) {\n auto n = da.size();\n for (size_t i = 0; i < n; i++) {\n // std::cout << i << \" : \";\n vdeb(da[i]);\n }\n std::cout << std::endl;\n}\n\nusing namespace std;\n\nint n;\n\nint solve() {\n map<string, int> mp;\n vector<int> b(n);\n vector<vector<string>> d(n, vector<string>(0));\n rep(i,n,0) {\n string a; cin >> a;\n mp[a] = i;\n cin >> b[i];\n int c; cin >> c;\n rep(j,c,0) {\n string s; cin >> s;\n d[i].emplace_back(move(s));\n }\n }\n vector<vector<int>> da(n, vector<int>(0));\n rep(i,n,0) {\n for(auto &j : d[i]) {\n da[i].emplace_back(mp[j]);\n }\n }\n int m1 = n/2;\n vector<int> dp1(1<<m1,-1);\n dp1[0] = 0;\n rep(i,1<<m1,1) {\n int k = 0;\n while(((i>>k)&1) == 0) {\n ++k;\n }\n bool flg = false;\n for(auto &j : da[k]) {\n if(j < m1 && (i>>j)&1) flg = true;\n }\n if(!flg) dp1[i] = dp1[i^(1<<k)] + b[k];\n }\n rep(i,1<<m1,0) if(i%2 == 0) dp1[i] = -1;\n rep(i,1<<m1,0) {\n rep(j,m1,0) {\n if((i>>j)&1) chmax(dp1[i], dp1[i^(1<<j)]);\n }\n }\n int m2 = n - m1;\n vector<int> dp2(1<<m2,-1);\n vector<int> mask(1<<m2, 0);\n dp2[0] = 0;\n rep(i,1<<m2,1) {\n int k = 0;\n while(((i>>k)&1) == 0) {\n ++k;\n }\n mask[i] = mask[i^(1<<k)];\n bool flg = false;\n for(auto &j : da[k+m1]) {\n if(m1 <= j && (i>>(j-m1))&1) flg = true;\n if(m1 > j) mask[i] |= 1<<j;\n }\n if(!flg) dp2[i] = dp2[i^(1<<k)] + b[k+m1];\n }\n int ans = 0;\n // vdeb(dp1);\n // vdeb(dp2);\n // vdeb(mask);\n const int kk = (1<<m1)-1;\n rep(i,1<<m2,0) {\n int j = mask[i]^kk;\n if(dp2[i] != -1 && dp1[j] != -1) {\n chmax(ans, dp2[i] + dp1[j]);\n }\n }\n return ans;\n}\n\nint main() {\n vector<int> ans;\n while(1) {\n cin >> n;\n if(n == 0) break;\n ans.emplace_back(solve());\n }\n for(auto &i : ans) cout << i << endl;\n}","accuracy":1,"time_ms":3870,"memory_kb":15700,"score_of_the_acc":-0.8572,"final_rank":10},{"submission_id":"aoj_2403_6583001","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>\nT weighted_maximum_independent_set(const std::vector<std::vector<int>>& G, const std::vector<T>& w) {\n const int n = G.size();\n const int n1 = n / 2;\n const int n2 = n - n1;\n std::vector<T> neighbors11(n1), neighbors12(n1), neighbors22(n2);\n for (int i = 0; i < n; ++i) {\n for (int j : G[i]) {\n if (i < n1 && j < n1) neighbors11[i] |= 1 << j;\n if (i < n1 && j >= n1) neighbors12[i] |= 1 << (j - n1);\n if (i >= n1 && j >= n1) neighbors22[i - n1] |= 1 << (j - n1);\n }\n }\n std::vector<int> dp(1 << n2);\n for (int S = 0; S < 1 << n2; ++S) {\n T s = 0;\n int neighbor = 0;\n for (int i = 0; i < n2; ++i) {\n if (S >> i & 1) {\n s += w[n1 + i];\n neighbor |= neighbors22[i];\n }\n }\n if (!(neighbor & S)) {\n dp[S] = std::max(dp[S], s);\n }\n for (int i = 0; i < n2; ++i) {\n if (!(S >> i & 1)) {\n dp[S | (1 << i)] = std::max(dp[S | (1 << i)], dp[S]);\n }\n }\n }\n T ans = std::numeric_limits<T>::min();\n for (int S = 0; S < 1 << n1; ++S) {\n if (!(S & 1)) continue;\n int s = 0;\n int neighbor1 = 0;\n int neighbor2 = 0;\n for (int i = 0; i < n1; ++i) {\n if (S >> i & 1) {\n s += w[i];\n neighbor1 |= neighbors11[i];\n neighbor2 |= neighbors12[i];\n }\n }\n if (!(neighbor1 & S)) {\n ans = std::max(ans, s + dp[neighbor2 ^ ((1 << n2) - 1)]);\n }\n }\n return ans;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int N;\n cin >> N;\n if (N == 0) break;\n vector<string> A(N);\n vector<int> B(N);\n vector<vector<string>> D(N);\n rep(i, 0, N) {\n int C;\n cin >> A[i] >> B[i] >> C;\n rep(_, 0, C) {\n string s;\n cin >> s;\n D[i].push_back(s);\n }\n }\n if (N == 1) {\n cout << B[0] << endl;\n continue;\n }\n map<string, int> idx;\n rep(i, 0, N) idx[A[i]] = i;\n vector<vector<int>> G(N);\n rep(i,0,N) {\n for (auto& s : D[i]) {\n G[i].push_back(idx[s]);\n }\n }\n cout << weighted_maximum_independent_set(G, B) << \"\\n\";\n }\n}","accuracy":1,"time_ms":5760,"memory_kb":7720,"score_of_the_acc":-0.8518,"final_rank":9},{"submission_id":"aoj_2403_6582959","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\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (true) {\n int N;\n cin >> N;\n if (N == 0) break;\n vector<string> A(N);\n vector<int> B(N);\n vector<vector<string>> D(N);\n rep(i,0,N) {\n int C;\n cin >> A[i] >> B[i] >> C;\n rep(_,0,C) {\n string s;\n cin >> s;\n D[i].push_back(s);\n }\n }\n if (N == 1) {\n cout << B[0] << endl;\n continue;\n }\n map<string, int> idx;\n rep(i,0,N) idx[A[i]] = i;\n const int N1 = N/2;\n const int N2 = N-N1;\n vector<ll> neighbors11(N1), neighbors12(N1), neighbors22(N2);\n rep(i,0,N) {\n for (auto& s : D[i]) {\n int j = idx[s];\n if (i < N1 && j < N1) neighbors11[i] |= 1<<j;\n if (i < N1 && j >= N1) neighbors12[i] |= 1<<(j-N1);\n if (i >= N1 && j >= N1) neighbors22[i-N1] |= 1<<(j-N1);\n }\n }\n vector<int> dp(1<<N2);\n rep(S,0,1<<N2) {\n int s = 0;\n int neighbor = 0;\n rep(i,0,N2) {\n if (S>>i&1) {\n s += B[N1+i];\n neighbor |= neighbors22[i];\n }\n }\n if (!(neighbor & S)) {\n chmax(dp[S], s);\n }\n rep(i,0,N2) {\n if (!(S>>i&1)) {\n chmax(dp[S|(1<<i)], dp[S]);\n }\n }\n }\n int ans = 0;\n rep(S,0,1<<N1) {\n if (!(S & 1)) continue;\n int s = 0;\n int neighbor1 = 0;\n int neighbor2 = 0;\n rep(i,0,N1) {\n if (S>>i&1) {\n s += B[i];\n neighbor1 |= neighbors11[i];\n neighbor2 |= neighbors12[i];\n }\n }\n if (!(neighbor1 & S)) {\n chmax(ans, s + dp[neighbor2 ^ ((1<<N2)-1)]);\n }\n }\n cout << ans << \"\\n\";\n }\n}","accuracy":1,"time_ms":7000,"memory_kb":7608,"score_of_the_acc":-1.0047,"final_rank":12},{"submission_id":"aoj_2403_6446006","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <cstdint>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\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, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.x >> pa.y;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const 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 T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing size_t = std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T>\nvoid fill(std::vector<T> &v) {\n for (T &e : v) std::cin >> e;\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT gcd(T a, T b) {\n if (b == 0)\n return a;\n else\n return gcd(b, a % b);\n}\n\ntemplate <class T>\nT lcm(T a, T b) {\n a /= gcd(a, b);\n return a * b;\n}\n\ntemplate <class T>\nT Pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\nnamespace ebi {\n\nvoid main_() {\n int n;\n while (std::cin >> n, n != 0) {\n std::map<std::string, int> map;\n std::vector<int> powers(n);\n std::vector table(n, std::vector<std::string>());\n rep(i, 0, n) {\n std::string s;\n std::cin >> s >> powers[i];\n map[s] = i;\n int c;\n std::cin >> c;\n while (c--) {\n std::string t;\n std::cin >> t;\n table[i].emplace_back(t);\n }\n }\n if (n == 1) {\n std::cout << powers.back() << '\\n';\n continue;\n }\n const int sz = n / 2;\n graph front(n), back(n);\n rep(i, 0, n) {\n for (auto s : table[i]) {\n assert(map.find(s) != map.end());\n int idx = map[s];\n if (idx < sz) {\n front[i].emplace_back(idx);\n } else {\n back[i].emplace_back(idx);\n }\n }\n }\n std::vector<int> dp(1 << sz, -INF);\n {\n std::vector<int> a(sz, 0);\n rep(i, 0, sz) {\n for (auto v : front[i]) {\n a[i] |= 1 << v;\n }\n }\n rep(bit, 0, 1 << sz) {\n int sum = 0;\n int ret = 0;\n rep(i, 0, sz) {\n if (bit & (1 << i)) {\n sum += powers[i];\n ret |= a[i];\n chmax(dp[bit], dp[bit ^ (1 << i)]);\n }\n }\n if ((bit & ret) == 0 && (bit & 1)) chmax(dp[bit], sum);\n }\n }\n int ans = 0;\n {\n const int m = n - sz;\n const int mask = (1 << sz) - 1;\n std::vector<int> a(m, 0);\n std::vector<int> b(m, 0);\n rep(i, sz, n) {\n for (auto v : back[i]) {\n a[i - sz] |= 1 << (v - sz);\n }\n for (auto v : front[i]) {\n b[i - sz] |= 1 << v;\n }\n }\n rep(bit, 0, 1 << m) {\n int sum = 0;\n int ret = 0;\n int cobit = 0;\n rep(i, 0, m) {\n if (bit & (1 << i)) {\n sum += powers[i + sz];\n ret |= a[i];\n cobit |= b[i];\n }\n }\n if ((bit & ret) == 0) {\n cobit = mask ^ cobit;\n chmax(ans, dp[cobit] + sum);\n }\n }\n }\n std::cout << ans << '\\n';\n }\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":5130,"memory_kb":7708,"score_of_the_acc":-0.772,"final_rank":7},{"submission_id":"aoj_2403_6394617","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <map>\nusing namespace std;\n\nstruct Solver{\n const int n;\n vector<vector<int>> G;\n vector<int> b;\n vector<int> useable;\n vector<int> lim;\n int tot = 0;\n int ans = 0;\n Solver(int n): n(n), G(vector<vector<int>>(n)), b(vector<int>(n)),\n useable(vector<int>(n, 0)), lim(vector<int>(n+1, 0)){\n using tup = tuple<string, int, int, vector<string>>;\n vector<tup> lines;\n tup l0;\n for(int i = 0; i < n; i++){\n string a1;\n int b1, c1;\n cin >> a1 >> b1 >> c1;\n vector<string> d1(c1);\n for(auto &it: d1) cin >> it;\n if(i > 0) lines.emplace_back(a1, b1, c1, d1);\n else l0 = {a1, b1, c1, d1};\n }\n sort(lines.begin(), lines.end(), [](const auto &l, const auto &r){\n return get<2>(l) < get<2>(r);\n });\n lines.emplace_back(l0);\n reverse(lines.begin(), lines.end());\n map<string, int> order;\n for(int i = 0; i < n; i++) order[get<0>(lines[i])] = i;\n for(int i = 0; i < n; i++){\n // cout << get<2>(lines[i]) << \" \";\n b[i] = get<1>(lines[i]);\n for(auto &it: get<3>(lines[i])){\n G[i].emplace_back(order[it]);\n }\n }\n for(int i = n-1; i >= 0; i--) lim[i] = lim[i+1]+b[i];\n //cout << endl;\n }\n\n void f(int phase){\n ans = max(ans, tot);\n if(phase == n){\n return;\n }\n if(useable[phase] > 0){\n f(phase+1);\n return;\n }\n if(tot+lim[phase] > ans && G[phase].size() > 0 && phase > 0){\n f(phase+1);\n }\n // if(tot+lim[phase] < ans) return;\n int mx = 0;\n for(auto &it: G[phase]){\n // if(it < phase) continue;\n useable[it]++;\n mx = max(mx, b[it]);\n }\n tot += b[phase];\n f(phase+1);\n tot -= b[phase];\n for(auto &it: G[phase]){\n // if(it < phase) continue;\n useable[it]--;\n }\n return;\n }\n\n void solve(){\n f(0);\n cout << ans << '\\n';\n }\n};\n\nint main(){\n while(true){\n int n; cin >> n;\n if(n == 0) break;\n Solver sol(n);\n sol.solve();\n }\n return 0;\n}","accuracy":1,"time_ms":3190,"memory_kb":3692,"score_of_the_acc":-0.4046,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2403_10848106\",\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\\nmap<string, int>mp;\\nint num = 0;\\n\\nint getnum(string st) {\\n\\tif (mp.find(st) == mp.end()) {\\n\\t\\tmp[st] = num++;\\n\\t}\\n\\treturn mp[st];\\n}\\n\\n\\n\\nstruct country {\\n\\tint num;\\n\\tint power;\\n\\tvector<int>connects;\\n};\\nint N;\\nvector<int>rests;\\nvoid getans(int now, const vector<country>&cs,vector<int>&oks,int n_power ,int&ans) {\\n\\tif (now == N-1) {\\n\\t\\tans = max(ans, n_power);\\n\\t\\treturn;\\n\\t}\\n\\telse if (rests[now] + n_power < ans) {\\n\\t\\treturn;\\n\\t}\\n\\tif (oks[cs[now].num]) {\\n\\t\\tvector<int>nextoks(oks);\\n\\t\\tfor (auto con : cs[now].connects) {\\n\\t\\t\\tnextoks[con] = false;\\n\\t\\t}\\n\\t\\tgetans(now + 1, cs, nextoks, n_power + cs[now].power, ans);\\n\\t}\\n\\tgetans(now + 1, cs, oks, n_power, ans);\\n}\\n\\nint main() {\\n\\twhile (1) {cin >> N;\\n\\tif (!N)break;\\n\\tmp.clear();\\n\\tnum = 0;\\n\\trests.clear();\\n\\t\\tvector<vector<int>>connects(N);\\n\\t\\tvector<int>powers(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring name;\\n\\t\\t\\tint B, C; cin >> name>> B >> C;\\n\\t\\t\\tint from = getnum(name);\\n\\t\\t\\tpowers[from] = B;\\n\\t\\t\\tfor (int j = 0; j < C; ++j) {\\n\\t\\t\\t\\tstring d; cin >> d;\\n\\t\\t\\t\\tint to = getnum(d);\\n\\t\\t\\t\\tconnects[from].push_back(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<country>cs;\\n\\t\\tfor (int i = 1; i < N; ++i) {\\n\\t\\t\\tcs.push_back(country{ i,powers[i],connects[i] });\\n\\t\\t}\\n\\t\\tsort(cs.begin(), cs.end(), [](const country&l, const country&r) {\\n\\t\\t\\treturn l.power > r.power;\\n\\t\\t});\\n\\n\\t\\tvector<int>oks(N,1);\\n\\t\\tfor (auto con : connects[0]) {\\n\\t\\t\\toks[con] = false;\\n\\t\\t}\\n\\t\\trests=vector<int>(N);\\n\\n\\t\\tfor (int i = N -2; i >= 0; --i) {\\n\\t\\t\\trests[i] = rests[i + 1] + cs[i].power;\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\t\\n\\t\\tgetans(0, cs, oks, 0, ans);\\n\\t\\tcout <<powers[0]+ ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.005,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2403_10829998\",\n \"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 REVERSE(x) reverse( (x).begin(),(x).end() )\\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\\n#define PW(x) (1LL<<(x))\\n#define SZ(x) ((ll)(x).size())\\n#define SHOW(x) cout << #x << \\\" = \\\" << x << endl\\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \\\" \\\"; } cout << endl\\n\\n#define pb emplace_back\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\n\\ntypedef long double ld;\\ntypedef long long int ll;\\ntypedef pair<int,int> pi;\\ntypedef pair<ll,ll> pl;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<bool> vb;\\ntypedef vector<ld> vd;\\ntypedef vector<pi> vpi;\\ntypedef vector<pl> vpl;\\ntypedef vector<vpl> gr;\\ntypedef vector<vl> ml;\\ntypedef vector<vd> md;\\ntypedef vector<vi> mi;\\n \\nconst ll INF = (ll)1e9 + 10;\\nconst ll INFLL = (ll)1e18 + 10;\\nconst ld EPS = 1e-12;\\nconst ll MOD = 1e9+7;\\n \\ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\\ntemplate<class T> inline T sq( T a ){ return a * a; }\\n\\nll in(){ long long int x; scanf( \\\"%lld\\\" , &x ); return x; }\\nchar yuyushiki[1000010]; string stin(){ scanf( \\\"%s\\\" , yuyushiki ); return yuyushiki; }\\n\\n// head\\n\\nint n;\\n\\nint a[64];\\n\\nmap<string,int> ma;\\n\\nvector<string> sG[64];\\nvector<int> G[64];\\n\\nll ms[64];\\n\\nint ans;\\n\\nvi v;\\n\\nint hstar( int p , ll mask ){\\n int res = 0;\\n FOR( i , p , n ){\\n if( !( mask & PW(v[i]) ) ){\\n res += a[v[i]];\\n }\\n }\\n return res;\\n}\\n\\nvoid dfs( int p , int cur, ll mask ){\\n // cout << cur << \\\" \\\" << mask << endl;\\n chmax( ans , cur );\\n if( cur + hstar( p , mask ) <= ans ){\\n return;\\n }\\n FOR( i , p , n ){\\n if( !( mask & PW(v[i]) ) ){\\n dfs( i+1 , cur + a[v[i]], mask | ms[v[i]] );\\n }\\n }\\n}\\n\\nint cmp( int i , int j ){\\n return a[i] > a[j];\\n}\\n\\nint main(){\\n\\n while( 1 ){\\n n = in();\\n if( n == 0 ){\\n break;\\n }\\n ma.clear();\\n ans = 0;\\n v.clear();\\n REP( i , n ){\\n sG[i].clear();\\n G[i].clear();\\n ms[i] = 0;\\n }\\n REP( i , n ){\\n string s = stin();\\n ma[s] = i;\\n a[i] = in();\\n int m = in();\\n REP( j , m ){\\n string t = stin();\\n sG[i].pb( t );\\n }\\n }\\n REP( i , n ){\\n YYS( w , sG[i] ){\\n G[i].pb( ma[w] );\\n ms[i] = ms[i] | PW( ma[w] );\\n }\\n ms[i] = ms[i] | PW(i);\\n }\\n REP( i , n ){\\n v.pb( i );\\n }\\n sort( ALL(v), cmp );\\n dfs( 0 , a[0] , ms[0] );\\n printf( \\\"%d\\\\n\\\" , ans );\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.0087,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2403_10650421\",\n \"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// 型関連\\nusing ll = long long;\\nusing lint = long long;\\nusing pll = pair<ll, ll>;\\nusing plll = tuple<ll, ll, ll>;\\nusing pii = pair<int, int>;\\nusing piii = tuple<ll, ll, ll>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vvvvi = vector<vector<vector<vector<int>>>>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\\n\\ntemplate <class T> using prique = priority_queue<T>;\\n\\n// 型定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll MOD = 1000000007;\\nint INF32 = 2e9;\\nll INF64 = 9e18;\\n#define endl '\\\\n';\\n\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\n\\n/////////////////////////// print関連\\ntemplate <typename T> void print(vector<T> A);\\nvoid print();\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\\nvoid print(string S);\\ntemplate <typename T> void print(vector<vector<T>> &F);\\n\\ninline void Yes(bool f);\\n\\n///////////////////ここから//////////////////////\\nbool solve() {\\n int N;\\n cin >> N;\\n if (N == 0) {\\n return false;\\n }\\n int n = 0;\\n map<string, int> name2n;\\n vvi E(N, vi(N));\\n vvi G(N);\\n\\n vi Power(N);\\n for (int i = 0; i < N; i++) {\\n string S;\\n cin >> S;\\n if (name2n.count(S) == 0) {\\n name2n[S] = n;\\n n++;\\n }\\n int u = name2n[S];\\n int B, C;\\n cin >> B >> C;\\n Power[u] = B;\\n for (int j = 0; j < C; j++) {\\n string T;\\n cin >> T;\\n if (name2n.count(T) == 0) {\\n name2n[T] = n;\\n n++;\\n }\\n int v = name2n[T];\\n E[u][v] = 1;\\n G[u].emplace_back(v);\\n }\\n }\\n // print(E);\\n\\n int N1 = N / 2;\\n int N2 = N - N1;\\n vl dp(1 << N2,-INF32);\\n vi lis;\\n\\n for (int S1 = 0; S1 < (1 << N1); S1++) {\\n if ((S1 & 1) == 0) {\\n continue;\\n }\\n lis.clear();\\n\\n ll W = 0;\\n bool ok = true;\\n for (int i = 0; i < N1; i++) {\\n if (S1 & (1 << i)) {\\n for (auto v : lis) {\\n if (E[i][v]) {\\n ok = false;\\n goto go1;\\n }\\n }\\n lis.emplace_back(i);\\n W += Power[i];\\n }\\n }\\n\\n if (ok == false) {\\n go1:;\\n continue;\\n }\\n\\n int S2 = 0;\\n for (int v : lis) {\\n for (int i = 0; i < N2; i++) {\\n if (E[v][i + N1]) {\\n S2 |= (1 << i);\\n }\\n }\\n }\\n S2 ^= ((1 << N2) - 1);\\n dp[S2] = max(dp[S2], W);\\n }\\n for (int S2 = (1 << N2) - 1; S2 >= 0; S2--) {\\n for (int i = 0; i < N2; i++) {\\n if (S2 & (1 << i)) {\\n dp[S2 - (1 << i)] = max(dp[S2 - (1 << i)], dp[S2]);\\n }\\n }\\n }\\n\\n ll ans = 0;\\n\\n for (int S2 = 0; S2 < (1 << N2); S2++) {\\n\\n lis.clear();\\n ll W = 0;\\n bool ok = true;\\n for (int i = 0; i < N2; i++) {\\n if (S2 & (1 << i)) {\\n for (auto v : lis) {\\n if (E[v + N1][i + N1]) {\\n ok = false;\\n goto go2;\\n }\\n }\\n lis.emplace_back(i);\\n W += Power[i + N1];\\n }\\n }\\n\\n if (ok == false) {\\n go2:;\\n continue;\\n }\\n ans = max(ans, W + dp[S2]);\\n // print(11,W);\\n }\\n print(ans);\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n while (solve())\\n ;\\n}\\n\\n////////////////////print/////////////////////////\\n// 1次元ベクトルを出力する\\ntemplate <typename T> void print(vector<T> A) {\\n if (A.size() == 0) {\\n return;\\n }\\n for (size_t i = 0; i < A.size() - 1; i++) {\\n cout << A[i] << ' ';\\n }\\n cout << A[A.size() - 1] << endl;\\n return;\\n}\\n\\n// 2次元ベクトルを出力する\\ntemplate <typename T> void print(vector<vector<T>> &F) {\\n for (size_t i = 0; i < F.size(); i++) {\\n for (size_t j = 0; j < F[i].size(); j++) {\\n cout << F[i][j];\\n if (j < F[i].size() - 1) {\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\\n\\n// 空白行を出力するprint\\nvoid print() { cout << endl; }\\n\\n// 数値・文字列を空白区切りで出力する. print(a,b)など\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n cout << head;\\n if (sizeof...(tail) != 0)\\n cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid print(string S) { cout << S << endl; }\\n\\n//////////////出力関連\\n\\ninline void Yes(bool f) {\\n if (f) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5460,\n \"memory_kb\": 19916,\n \"score_of_the_acc\": -1.1866,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2403_10615786\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = acos(-1.0);\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do { cout << #var << \\\" :\\\\n\\\"; view(var); } while(0)\\ntemplate<typename T>void view(const T& e) {cout << e;}\\ntemplate<typename T1, typename T2>void view(const pair<T1, T2>& p) {cout << \\\"{\\\" << p.first << \\\", \\\" << p.second << \\\"}\\\";}\\ntemplate<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cout << \\\" \\\";} cout << endl;}\\n\\nint N;\\n\\nvoid solve(){\\n vc<string> A(N);\\n vi B(N);\\n vv<string> D(N);\\n rep(i, N){\\n cin >> A[i] >> B[i];\\n int c; cin >> c;\\n D[i].resize(c);\\n rep(j, c) cin >> D[i][j];\\n }\\n if (N == 1){\\n cout << B[0] << endl;\\n return;\\n }\\n unordered_map<string, int> toid;\\n rep(i, N) toid[A[i]] = i;\\n vl no(N, 0);\\n rep(i, N){\\n for (auto d : D[i]) no[i] += (1ll << toid[d]);\\n }\\n int P = N / 2, Q = N - P;\\n vi maxi(1 << Q, -inf);\\n rep(cmb, 1 << P) if (cmb & 1){\\n ll ng = 0;\\n int sm = 0;\\n rep(i, P) if (cmb >> i & 1){\\n ng |= no[i];\\n sm += B[i];\\n }\\n if ((ng & cmb) != 0) continue;\\n ng >>= P;\\n ll ok = ((1 << Q) - 1) ^ ng;\\n maxi[ok] = max(maxi[ok], sm);\\n }\\n\\n // for (ll cmb = (1 << Q) - 1; cmb >= 0; cmb--){\\n // rep(i, Q) if (cmb >> i & 1) maxi[cmb ^ (1 << i)] = max(maxi[cmb], maxi[cmb ^ (1 << i)]);\\n // }\\n for (int i = 0; i < Q; i++){\\n for (int S = 0; S < 1 << Q; S++){\\n if (~S & (1 << i)){\\n maxi[S] = max(maxi[S], maxi[S ^ (1 << i)]);\\n }\\n }\\n }\\n\\n int ans = 0;\\n rep(cmb, 1 << Q){\\n ll ncmb = cmb << P;\\n ll ng = 0;\\n int sm = 0;\\n srep(i, P, N) if (ncmb >> i & 1){\\n ng |= no[i];\\n sm += B[i];\\n }\\n if ((ng & ncmb) != 0) continue;\\n\\n ans = max(ans, sm + maxi[cmb]);\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while (true){\\n cin >> N;\\n if (N == 0) break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4860,\n \"memory_kb\": 7852,\n \"score_of_the_acc\": -0.7423,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2403_10615782\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = acos(-1.0);\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do { cout << #var << \\\" :\\\\n\\\"; view(var); } while(0)\\ntemplate<typename T>void view(const T& e) {cout << e;}\\ntemplate<typename T1, typename T2>void view(const pair<T1, T2>& p) {cout << \\\"{\\\" << p.first << \\\", \\\" << p.second << \\\"}\\\";}\\ntemplate<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cout << \\\" \\\";} cout << endl;}\\ntemplate<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cout << \\\" \\\";} cout << endl;}\\n\\nint N;\\n\\nvoid solve(){\\n vc<string> A(N);\\n vi B(N);\\n vv<string> D(N);\\n rep(i, N){\\n cin >> A[i] >> B[i];\\n int c; cin >> c;\\n D[i].resize(c);\\n rep(j, c) cin >> D[i][j];\\n }\\n if (N == 1){\\n cout << B[0] << endl;\\n return;\\n }\\n unordered_map<string, int> toid;\\n rep(i, N) toid[A[i]] = i;\\n vl no(N, 0);\\n rep(i, N){\\n for (auto d : D[i]) no[i] += (1ll << toid[d]);\\n }\\n int P = N / 2, Q = N - P;\\n vi maxi(1 << Q, -inf);\\n rep(cmb, 1 << P) if (cmb & 1){\\n ll ng = 0;\\n int sm = 0;\\n rep(i, P) if (cmb >> i & 1){\\n ng |= no[i];\\n sm += B[i];\\n }\\n if ((ng & cmb) != 0) continue;\\n ng >>= P;\\n ll ok = ((1 << Q) - 1) ^ ng;\\n maxi[ok] = max(maxi[ok], sm);\\n }\\n\\n for (ll cmb = (1 << Q) - 1; cmb >= 0; cmb--){\\n rep(i, Q) if (cmb >> i & 1) maxi[cmb ^ (1 << i)] = max(maxi[cmb], maxi[cmb ^ (1 << i)]);\\n }\\n\\n\\n int ans = 0;\\n rep(cmb, 1 << Q){\\n ll ncmb = cmb << P;\\n ll ng = 0;\\n int sm = 0;\\n srep(i, P, N) if (ncmb >> i & 1){\\n ng |= no[i];\\n sm += B[i];\\n }\\n if ((ng & ncmb) != 0) continue;\\n\\n ans = max(ans, sm + maxi[cmb]);\\n }\\n cout << ans << endl;\\n}\\n\\nint main(){\\n while (true){\\n cin >> N;\\n if (N == 0) break;\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7010,\n \"memory_kb\": 7928,\n \"score_of_the_acc\": -1.0158,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2403_10599092\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\\n#define OVERLOAD_REP(_1, _2, _3, _4, 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, n) for (ll i=a;i<(n);i++)\\n#define REP4(i, a, b, n) for(ll i=a;i<(n);i+=b)\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\\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, n) for(ll i=(n)-1;i>=(a);i--)\\n#define RREP4(i, a, b, n) for(ll i=(n)-1;i>=(a);i-=(b))\\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define len(n) (long long)(n).size()\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vs = vector<string>;\\nusing vvs = vector<vs>;\\nusing vvvs = vector<vvs>;\\nusing vld = vector<ld>;\\nusing vvld = vector<vld>;\\nusing vvvld = vector<vvld>;\\nusing vc = vector<char>;\\nusing vvc = vector<vc>;\\nusing vvvc = vector<vvc>;\\nusing pll = pair<ll,ll>;\\nusing vpll = vector<pll>;\\nusing vvpll = vector<vpll>;\\n\\nll intpow(ll a,ll b){\\n ll ans = 1;\\n while (b){\\n if (b & 1){\\n ans *= a;\\n }\\n a *= a;\\n b /= 2;\\n }\\n return ans;\\n}\\nll modpow(ll a,ll b,ll c){\\n ll ans = 1;\\n while (b){\\n if (b & 1){\\n ans *= a;\\n ans %= c;\\n }\\n a *= a;\\n a %= c;\\n b /= 2;\\n }\\n return ans;\\n}\\n\\ntemplate<class... T>\\nvoid input(T&... a){\\n (cin >> ... >> a);\\n}\\n\\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define PLL(name) pll name;cin>>name.first>>name.second;\\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\\n\\nvoid print(){cout << \\\"\\\\n\\\";}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {\\n os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<T>& vec) {\\n os << \\\"[\\\";\\n for (size_t i = 0; i < vec.size(); ++i) {\\n os << vec[i];\\n if (i + 1 < vec.size()) os << \\\", \\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::pair<T1, T2>>& a) {\\n os << \\\"[\\\";\\n for (size_t j = 0; j < a.size(); ++j) {\\n os << \\\"(\\\" << a[j].first << \\\", \\\" << a[j].second << \\\")\\\";\\n\\t\\tif (j + 1 < a.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, const std::vector<std::vector<std::pair<T1, T2>>>& mat) {\\n\\tos << \\\"[\\\";\\n for (size_t i = 0; i < mat.size(); ++i) {\\n\\t\\tos << \\\"[\\\";\\n for (size_t j = 0; j < mat[i].size(); ++j) {\\n os << \\\"(\\\" << mat[i][j].first << \\\", \\\" << mat[i][j].second << \\\")\\\";\\n\\t\\t\\tif (j + 1 < mat[i].size()) os << \\\", \\\";\\n }\\n\\t\\tos << \\\"]\\\";\\n\\t\\tif (i + 1 < mat.size()) os << \\\", \\\";\\n }\\n\\tos << \\\"]\\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, const std::set<T>& s) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& x : s) {\\n if (!first) os << \\\", \\\";\\n os << x;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate <typename K, typename V>\\nstd::ostream& operator<<(std::ostream& os, const std::map<K, V>& m) {\\n os << \\\"{\\\";\\n bool first = true;\\n for (const auto& [key, val] : m) {\\n if (!first) os << \\\", \\\";\\n os << key << \\\": \\\" << val;\\n first = false;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\n\\nvoid write(){cout << \\\"\\\\n\\\";}\\ntemplate<class T, class... Ts>\\nvoid write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\nvoid write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << \\\" \\\";}else if(j!=len(x[i])-1){cout << \\\" | \\\";}else{cout << '\\\\n';}}}\\nvoid write(pll x){cout << x.first << ' ' << x.second << '\\\\n';}\\nvoid write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\\\\n';}}\\nvoid write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\n\\ntemplate <typename T>\\nT sum(const std::vector<T>& v) {\\n return std::accumulate(v.begin(), v.end(), T(0));\\n}\\n\\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; }\\n\\n\\n\\n\\nint main(){\\n\\tios::sync_with_stdio(false);\\n\\tstd::cin.tie(nullptr);\\n while(1){\\n LL(n);\\n if(n == 0){break;}\\n vs name(n);\\n vll x(n);\\n vvs neighbor(n);\\n map<string,int> mp;\\n rep(i,n){\\n STR(s);\\n mp[s] = i;\\n LL(z);\\n name[i] = s;\\n x[i] = z;\\n LL(cnt);\\n rep(j,cnt){\\n STR(t);\\n neighbor[i].push_back(t);\\n }\\n }\\n vvll edge(n);\\n rep(i,n){\\n for(string t:neighbor[i]){\\n edge[i].push_back(mp[t]);\\n }\\n }\\n ll m = n / 2;\\n vll dp(1<<m,-1LL<<60);\\n rep(i,(1<<m)){\\n if(((i >> 0) & 1) == 0){continue;}\\n ll temp = 0;\\n ll c = 0;\\n rep(j,m){\\n if(((i >> j) & 1) == 1){\\n temp += x[j];\\n for(ll to:edge[j]){\\n if(0 <= to && to < m && ((i >> to) & 1) == 1){\\n c = 1;\\n break;\\n }\\n }\\n }\\n }\\n if(c){continue;}\\n dp[i] = temp;\\n }\\n\\n rep(i,m){\\n rep(j,(1<<m)){\\n if(((j >> i) & 1) == 0){\\n chmax(dp[j | (1 << i)],dp[j]);\\n }\\n }\\n }\\n\\n ll ans = 0;\\n ll r = n - m;\\n rep(i,(1<<r)){\\n ll temp = 0;\\n ll c = 0;\\n rep(j,r){\\n if(((i >> j) & 1) == 1){\\n temp += x[j+m];\\n for(ll to:edge[j+m]){\\n if(m <= to && ((i >> (to - m)) & 1) == 1){\\n c = 1;\\n break;\\n }\\n }\\n }\\n }\\n if(c){continue;}\\n ll v = (1 << m) - 1;\\n rep(j,r){\\n if(((i >> j) & 1) == 1){\\n for(ll to:edge[j+m]){\\n if(to < m && ((v >> to) & 1) == 1){\\n v ^= (1 << to);\\n }\\n }\\n }\\n }\\n chmax(ans,temp + dp[v]);\\n }\\n write(ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7330,\n \"memory_kb\": 11836,\n \"score_of_the_acc\": -1.1755,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2403_10418251\",\n \"code_snippet\": \"/**\\n\\tauthor: shobonvip\\n\\tcreated: 2025.04.24 18:44:48\\n**/\\n\\n#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#define all(v) v.begin(), v.end()\\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\\nvoid solve(int n) {\\n\\tvector<string>name(n);\\n\\tvector lst(n,vector<string>(0));\\n\\tvector<int> b(n);\\n\\n\\trep(i,0,n){\\n\\t\\tcin>>name[i];\\n\\t\\tcin>>b[i];\\n\\t\\tint c;cin>>c;\\n\\t\\trep(j,0,c){\\n\\t\\t\\tstring t;cin>>t;\\n\\t\\t\\tlst[i].push_back(t);\\n\\t\\t}\\n\\t}\\n\\n\\tmap<string,int> mp;\\n\\trep(i,0,n){\\n\\t\\tmp[name[i]]=i;\\n\\t}\\n\\n\\tvector<ll> edge(n);\\n\\trep(i,0,n){\\n\\t\\tfor(string &j:lst[i]){\\n\\t\\t\\tedge[i]|=1LL<<mp[j];\\n\\t\\t}\\n\\t}\\n\\n\\tif(n<=0){\\n\\t\\tint ans=0;\\n\\t\\trep(i,0,1<<n){\\n\\t\\t\\tif(!(i&1))continue;\\n\\t\\t\\tbool mode=1;\\n\\t\\t\\tint tmp=0;\\n\\t\\t\\trep(j,0,n){\\n\\t\\t\\t\\tif(i>>j&1){\\n\\t\\t\\t\\t\\ttmp+=b[j];\\n\\t\\t\\t\\t\\tif((edge[j]&i)>0){\\n\\t\\t\\t\\t\\t\\tmode=0;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(mode){\\n\\t\\t\\t\\tchmax(ans,tmp);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<ans<<'\\\\n';\\n\\t}\\n\\n\\tint m=(n+1)/2;\\n\\tvector<int> d(1<<m,(int)-1e9);\\n\\trep(i,0,1<<m){\\n\\t\\tif(!(i&1))continue;\\n\\t\\tbool mode=1;\\n\\t\\tint tmp=0;\\n\\t\\trep(j,0,m){\\n\\t\\t\\tif(i>>j&1){\\n\\t\\t\\t\\ttmp+=b[j];\\n\\t\\t\\t\\tif((edge[j]&i)>0){\\n\\t\\t\\t\\t\\tmode=0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(mode){\\n\\t\\t\\tchmax(d[i],tmp);\\n\\t\\t}\\n\\t}\\n\\n\\trep(i,0,m){\\n\\t\\tint mask=1<<i;\\n\\t\\trep(j,0,1<<m){\\n\\t\\t\\tif(mask&j)continue;\\n\\t\\t\\tchmax(d[mask|j],d[j]);\\n\\t\\t}\\n\\t}\\n\\n\\tint ans=0;\\n\\trep(i,0,1<<(n-m)){\\n\\t\\tbool mode=1;\\n\\t\\tint tmp=0;\\n\\t\\tll sihai=0;\\n\\t\\trep(j,0,n-m){\\n\\t\\t\\tif(i>>j&1){\\n\\t\\t\\t\\ttmp+=b[j+m];\\n\\t\\t\\t\\tif(((edge[j+m]>>m)&i)>0){\\n\\t\\t\\t\\t\\tmode=0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tsihai|=edge[j+m];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!mode)continue;\\n\\t\\tsihai&=(1LL<<m)-1;\\n\\t\\tsihai^=(1LL<<m)-1;\\n\\t\\tchmax(ans,tmp+d[sihai]);\\n\\t}\\n\\tcout<<ans<<'\\\\n';\\n\\t\\n}\\n\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\t\\n\\twhile(true){\\n\\t\\tint n; cin >> n;\\n\\t\\tif(n==0)break;\\n\\t\\tsolve(n);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2130,\n \"memory_kb\": 7624,\n \"score_of_the_acc\": -0.3911,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2403_10418204\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nconst ll ILL=2167167167167167167;\\nconst int INF=100000000;\\n#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,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;});}\\nbool yneos(bool a,bool upp=false){if(a){cout<<(upp?\\\"YES\\\\n\\\":\\\"Yes\\\\n\\\");}else{cout<<(upp?\\\"NO\\\\n\\\":\\\"No\\\\n\\\");}return a;}\\ntemplate<class T> void vec_out(vector<T> &p,int ty=0){\\n if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<\\\",\\\";}cout<<'\\\"'<<p[i]<<'\\\"';}cout<<\\\"}\\\\n\\\";}\\n else{if(ty==1){cout<<p.size()<<\\\"\\\\n\\\";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}}\\ntemplate<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}\\ntemplate<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}\\ntemplate<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}\\nint pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}\\ntemplate<class T> T square(T a){return a * a;}\\n\\nint N;\\n\\nvoid solve();\\n// CITRUS CURIO CITY / FREDERIC\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (cin >> N, N) solve();\\n}\\n\\nvoid solve(){\\n vector<string> A(N);\\n vector<int> B(N);\\n vector<vector<string>> D(N);\\n rep(i, 0, N){\\n cin >> A[i] >> B[i];\\n int c;\\n cin >> c;\\n D[i].resize(c);\\n for (auto &a : D[i]) cin >> a;\\n }\\n map<string, int> m;\\n rep(i, 0, N) m[A[i]] = i;\\n vector G(N, vector<int>(N));\\n rep(i, 0, N) for (auto x : D[i]) G[i][m[x]] = 1;\\n auto f = [&](int l, int r) -> vector<int> {\\n vector<int> ban(1 << (r - l));\\n rep(i, l, r) rep(j, l, r) if (G[i][j]){\\n ban[(1 << (i - l)) + (1 << (j - l))] = 1;\\n }\\n rep(i, 0, r - l) rep(j, 0, 1 << (r - l)) if (j & (1 << i)){\\n if (ban[j - (1 << i)]) ban[j] = 1;\\n }\\n // vec_out(ban);\\n rep(i, 0, 1 << (r - l)){\\n if (ban[i] == 1) ban[i] = -INF;\\n else{\\n rep(k, 0, r - l) if (i & (1 << k)) ban[i] += B[l + k];\\n }\\n }\\n if (l == 0) return ban;\\n rep(i, 0, r - l) rep(j, 0, 1 << (r - l)) if (j & (1 << i)){\\n chmax(ban[j], ban[j - (1 << i)]);\\n }\\n // vec_out(ban);\\n return ban;\\n };\\n int mid = N / 2;\\n auto X = f(0, mid);\\n auto Y = f(mid, N);\\n int ans = 0;\\n vector<int> cov(1 << mid);\\n rep(i, 0, mid) rep(j, mid, N) if (G[i][j]) cov[1 << i] += (1 << (j - mid));\\n rep(i, 0, mid) rep(j, 0, 1 << mid) if (j & (1 << i)) cov[j] = (cov[j] | cov[j - (1 << i)]);\\n rep(i, 0, 1 << mid) if (i & 1) {\\n if (chmax(ans, X[i] + Y[(1 << (N - mid)) - 1 - cov[i]])){\\n // cout << i << \\\" \\\" << cov << endl;\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4520,\n \"memory_kb\": 15748,\n \"score_of_the_acc\": -0.9407,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2403_9460895\",\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() {\\nwhile(1) {\\n int N;\\n cin >> N;\\n if (N == 0) return 0;\\n vector<string> A(N);\\n vector<ll> B(N);\\n vector<vector<string>> C(N);\\n map<string,int> mp;\\n rep(i,0,N) {\\n cin >> A[i] >> B[i];\\n mp[A[i]] = i;\\n int c;\\n cin >> c;\\n rep(j,0,c) {\\n string s;\\n cin >> s;\\n C[i].push_back(s);\\n }\\n }\\n vector<ll> G(N,0);\\n rep(i,0,N) {\\n for (string s : C[i]) {\\n G[i] |= (1LL << mp[s]);\\n }\\n }\\n int M = (N + 1) / 2, K = N - M;\\n vector<ll> LC(1<<M,0), RC(1<<K,0), L(1<<M,-INF), R(1<<K,-INF);\\n rep(i,0,1<<M) {\\n ll X = 0, COUNT = 0;\\n rep(j,0,M) {\\n if ((i>>j)&1) {\\n X |= G[j];\\n COUNT += B[j];\\n }\\n }\\n if ((X & i) == 0) {\\n LC[i] = X;\\n L[i] = COUNT;\\n }\\n }\\n rep(i,0,1<<K) {\\n ll X = 0, COUNT = 0;\\n rep(j,0,K) {\\n if ((i>>j)&1) {\\n X |= G[j+M];\\n COUNT += B[j+M];\\n }\\n }\\n if ((X & ((ll)i<<M)) == 0) {\\n RC[i] = X;\\n R[i] = COUNT;\\n }\\n }\\n rep(i,0,K) {\\n rep(j,0,1<<K) {\\n chmax(R[j|(1<<i)],R[j]);\\n }\\n }\\n ll ANS = -INF;\\n rep(i,0,1<<M) {\\n if ((i&1)==0) continue;\\n if (L[i] == -INF) continue;\\n ll Comp = (1LL<<N) - 1 - LC[i];\\n Comp >>= M;\\n chmax(ANS,L[i]+R[Comp]);\\n }\\n cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6060,\n \"memory_kb\": 36140,\n \"score_of_the_acc\": -1.7579,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2403_8946365\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\nusing namespace zawa;\\n\\nvoid input(int n, std::vector<std::vector<bool>>& g, std::vector<int>& b) {\\n std::vector<std::string> a(n);\\n std::vector adj(n, std::vector<std::string>{});\\n for (int i{} ; i < n ; i++) {\\n std::cin >> a[i] >> b[i];\\n int deg; std::cin >> deg;\\n adj[i].resize(deg);\\n for (auto& s : adj[i]) std::cin >> s;\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < (int)adj[i].size() ; j++) {\\n for (int k{} ; k < n ; k++) {\\n if (a[k] == adj[i][j]) {\\n g[i][k] = true;\\n break;\\n }\\n }\\n }\\n }\\n}\\n\\nbool solve() {\\n int n; std::cin >> n;\\n if (n == 0) return false;\\n std::vector g(n, std::vector<bool>(n));\\n std::vector<int> b(n);\\n input(n, g, b);\\n int p{n / 2}, q{n - p};\\n std::vector<int> sL(1 << p);\\n std::vector<bool> canL(1 << p);\\n {\\n std::vector<int> ng(p);\\n for (int i{} ; i < p ; i++) {\\n for (int j{i + 1} ; j < p ; j++) {\\n if (g[i][j]) ng[i] |= (1 << j);\\n }\\n }\\n for (int bit{} ; bit < (1 << p) ; bit++) {\\n bool ok{true};\\n for (int i{} ; i < p ; i++) {\\n if (bit & (1 << i)) {\\n ok &= (bit & ng[i]) == 0;\\n sL[bit] += b[i];\\n }\\n }\\n if (ok) canL[bit] = true;\\n }\\n }\\n std::vector<int> sR(1 << q);\\n std::vector<bool> canR(1 << q);\\n {\\n std::vector<int> ng(q);\\n for (int i{} ; i < q ; i++) {\\n for (int j{i + 1} ; j < q ; j++) {\\n if (g[p + i][p + j]) ng[i] |= (1 << j);\\n }\\n }\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n bool ok{true};\\n for (int i{} ; i < q ; i++) {\\n if (bit & (1 << i)) {\\n ok &= (bit & ng[i]) == 0;\\n sR[bit] += b[p + i];\\n }\\n }\\n if (ok) canR[bit] = true;\\n }\\n }\\n std::vector<int> R(1 << q);\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n if (canR[bit]) R[bit] = sR[bit];\\n }\\n for (int i{} ; i < q ; i++) {\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n if (!(bit & (1 << i))) {\\n int tar{bit | (1 << i)};\\n R[tar] = std::max(R[tar], R[bit]);\\n }\\n }\\n } \\n std::vector<int> ngLR(p);\\n for (int i{} ; i < p ; i++) {\\n for (int j{} ; j < q ; j++) {\\n if (g[i][p + j]) {\\n ngLR[i] |= (1 << j);\\n }\\n }\\n }\\n int ans{};\\n for (int bit{} ; bit < (1 << p) ; bit++) {\\n // 未来の自分へ、このコードを使う時はこの行を消すこと\\n if (!(bit & (1 << 0))) continue;\\n if (!canL[bit]) continue;\\n int ok{};\\n for (int i{} ; i < p ; i++) if (bit & (1 << i)) {\\n ok |= ngLR[i];\\n }\\n ok = ((1 << q) - 1) ^ ok;\\n int L{sL[bit]};\\n int val{L + R[ok]};\\n ans = std::max(ans, val);\\n }\\n std::cout << ans <<'\\\\n';\\n return true;\\n}\\n\\nint main() {\\n SetFastIO();\\n\\n for (int i{} ; solve() ; i++) {\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6270,\n \"memory_kb\": 15796,\n \"score_of_the_acc\": -1.1628,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2403_8946362\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\n\\n\\nnamespace zawa {\\n\\nusing i16 = std::int16_t;\\nusing i32 = std::int32_t;\\nusing i64 = std::int64_t;\\nusing i128 = __int128_t;\\n\\nusing u8 = std::uint8_t;\\nusing u16 = std::uint16_t;\\nusing u32 = std::uint32_t;\\nusing u64 = std::uint64_t;\\n\\nusing usize = std::size_t;\\n\\n} // namespace zawa\\n\\n\\nnamespace zawa {\\n\\nvoid SetFastIO() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n}\\n\\nvoid SetPrecision(u32 dig) {\\n std::cout << std::fixed << std::setprecision(dig);\\n}\\n\\n} // namespace zawa\\nusing namespace zawa;\\n\\nvoid input(int n, std::vector<std::vector<bool>>& g, std::vector<int>& b) {\\n std::vector<std::string> a(n);\\n std::vector adj(n, std::vector<std::string>{});\\n for (int i{} ; i < n ; i++) {\\n std::cin >> a[i] >> b[i];\\n int deg; std::cin >> deg;\\n adj[i].resize(deg);\\n for (auto& s : adj[i]) std::cin >> s;\\n }\\n for (int i{} ; i < n ; i++) {\\n for (int j{} ; j < (int)adj[i].size() ; j++) {\\n for (int k{} ; k < n ; k++) {\\n if (a[k] == adj[i][j]) {\\n g[i][k] = true;\\n break;\\n }\\n }\\n }\\n }\\n}\\n\\nbool solve() {\\n int n; std::cin >> n;\\n if (n == 0) return false;\\n std::vector g(n, std::vector<bool>(n));\\n std::vector<int> b(n);\\n input(n, g, b);\\n int p{n / 2}, q{n - p};\\n std::vector<int> sL(1 << p);\\n std::vector<bool> canL(1 << p);\\n {\\n std::vector<int> ng(p);\\n for (int i{} ; i < p ; i++) {\\n for (int j{i + 1} ; j < p ; j++) {\\n if (g[i][j]) ng[i] |= (1 << j);\\n }\\n }\\n for (int bit{} ; bit < (1 << p) ; bit++) {\\n bool ok{true};\\n for (int i{} ; i < p ; i++) {\\n if (bit & (1 << i)) {\\n ok &= (bit & ng[i]) == 0;\\n sL[bit] += b[i];\\n }\\n }\\n if (ok) canL[bit] = true;\\n }\\n }\\n std::vector<int> sR(1 << q);\\n std::vector<bool> canR(1 << q);\\n {\\n std::vector<int> ng(q);\\n for (int i{} ; i < q ; i++) {\\n for (int j{i + 1} ; j < q ; j++) {\\n if (g[p + i][p + j]) ng[i] |= (1 << j);\\n }\\n }\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n bool ok{true};\\n for (int i{} ; i < q ; i++) {\\n if (bit & (1 << i)) {\\n ok &= (bit & ng[i]) == 0;\\n sR[bit] += b[p + i];\\n }\\n }\\n if (ok) canR[bit] = true;\\n }\\n }\\n std::vector<int> R(1 << q);\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n if (canR[bit]) R[bit] = sR[bit];\\n }\\n for (int i{} ; i < q ; i++) {\\n for (int bit{} ; bit < (1 << q) ; bit++) {\\n if (!(bit & (1 << i))) {\\n int tar{bit | (1 << i)};\\n R[tar] = std::max(R[tar], R[bit]);\\n }\\n }\\n } \\n std::vector<int> ngLR(p);\\n for (int i{} ; i < p ; i++) {\\n for (int j{} ; j < q ; j++) {\\n if (g[i][p + j]) {\\n ngLR[i] |= (1 << j);\\n }\\n }\\n }\\n int ans{};\\n for (int bit{} ; bit < (1 << p) ; bit++) {\\n if (!(bit & (1 << 0))) continue;\\n if (!canL[bit]) continue;\\n int ok{};\\n for (int i{} ; i < p ; i++) if (bit & (1 << i)) {\\n ok |= ngLR[i];\\n }\\n ok = ((1 << q) - 1) ^ ok;\\n int L{sL[bit]};\\n int val{L + R[ok]};\\n ans = std::max(ans, val);\\n }\\n std::cout << ans <<'\\\\n';\\n return true;\\n}\\n\\nint main() {\\n SetFastIO();\\n\\n for (int i{} ; solve() ; i++) {\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6270,\n \"memory_kb\": 15808,\n \"score_of_the_acc\": -1.1632,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2403_8321543\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N;\\n\\t\\tcin >> N;\\n\\t\\tif (N == 0) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tvector<int> W(N);\\n\\t\\tvector<string> S(N);\\n\\t\\tvector<vector<string> > T(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tint c;\\n\\t\\t\\tcin >> S[i] >> W[i] >> c;\\n\\t\\t\\tT[i].resize(c);\\n\\t\\t\\tfor (int j = 0; j < c; j++) {\\n\\t\\t\\t\\tcin >> T[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<uint64_t> G(N);\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tfor (int j = 0; j < T[i].size(); j++) {\\n\\t\\t\\t\\tint pos = find(S.begin(), S.end(), T[i][j]) - S.begin();\\n\\t\\t\\t\\tG[i] |= uint64_t(1) << pos;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint m = N / 2;\\n\\t\\tvector<int> dp(1 << (N - m));\\n\\t\\tfor (int i = 0; i < (1 << (N - m)); i++) {\\n\\t\\t\\tbool valid = true;\\n\\t\\t\\tint weight = 0;\\n\\t\\t\\tfor (int j = 0; j < N - m; j++) {\\n\\t\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\t\\tif (((G[j + m] >> m) & i) != 0) {\\n\\t\\t\\t\\t\\t\\tvalid = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tweight += W[j + m];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (valid) {\\n\\t\\t\\t\\tdp[i] = weight;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N - m; i++) {\\n\\t\\t\\tfor (int j = 0; j < (1 << (N - m)); j++) {\\n\\t\\t\\t\\tif ((j >> i) & 1) {\\n\\t\\t\\t\\t\\tdp[j] = max(dp[j], dp[j ^ (1 << i)]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 1; i < (1 << m); i += 2) {\\n\\t\\t\\tbool valid = true;\\n\\t\\t\\tint adj = 0;\\n\\t\\t\\tint weight = 0;\\n\\t\\t\\tfor (int j = 0; j < m; j++) {\\n\\t\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\t\\tif ((G[j] & i) != 0) {\\n\\t\\t\\t\\t\\t\\tvalid = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tadj |= (G[j] >> m);\\n\\t\\t\\t\\t\\tweight += W[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (valid) {\\n\\t\\t\\t\\tans = max(ans, weight + dp[((1 << (N - m)) - 1) - adj]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4630,\n \"memory_kb\": 7664,\n \"score_of_the_acc\": -0.7076,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2403_8219578\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\n\\nmt19937 engine(42);\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nbool is_end = false;\\n\\nll calc_cc(vector<ll> &connected, vector<ll> &weight, vector<vector<ll>> &graph, bool has_root = false)\\n{\\n ll N = weight.size();\\n ll ret = 0;\\n \\n for (int loop = 0; loop < 100000; ++loop)\\n {\\n shuffle(connected.begin(), connected.end(), engine);\\n \\n vector<bool> skip(N, false);\\n ll tmp = 0;\\n \\n if (has_root)\\n {\\n tmp += weight[0];\\n skip[0] = true;\\n for (int j = 0; j < N; ++j)\\n {\\n if (graph[0][j]) {skip[j] = true;}\\n }\\n }\\n \\n for (auto v : connected)\\n {\\n if (skip[v]) {continue;}\\n \\n tmp += weight[v];\\n for (int j = 0; j < N; ++j)\\n {\\n if (graph[v][j]) {skip[j] = true;}\\n }\\n }\\n \\n chmax(ret, tmp);\\n }\\n \\n return ret;\\n}\\n\\nvoid calc()\\n{\\n ll N; cin >> N;\\n if (N == 0)\\n {\\n is_end = true;\\n return;\\n }\\n \\n vector<vector<string>> adj(N);\\n map<string, ll> idx;\\n vector<ll> weight(N);\\n ll num = 0;\\n for (int i = 0; i < N; ++i)\\n {\\n string S; cin >> S;\\n idx[S] = num;\\n num++;\\n ll W, C; cin >> W >> C;\\n weight[i] = W;\\n for (int j = 0; j < C; ++j)\\n {\\n string T; cin >> T;\\n adj[i].emplace_back(T);\\n }\\n }\\n \\n vector<vector<ll>> G(N, vector<ll>(N, 0));\\n for (int i = 0; i < N; ++i)\\n {\\n for (auto s : adj[i])\\n {\\n ll j = idx[s];\\n G[i][j] = G[j][i] = 1;\\n }\\n }\\n \\n vector<bool> used(N, false);\\n ll res = 0;\\n \\n for (int i = 0; i < N; ++i)\\n {\\n if (used[i]) {continue;}\\n \\n vector<ll> connected;\\n \\n queue<ll> que;\\n que.push(i);\\n used[i] = true;\\n \\n while (!que.empty())\\n {\\n ll v = que.front();\\n que.pop();\\n connected.emplace_back(v);\\n \\n for (int j = 0; j < N; ++j)\\n {\\n if (G[v][j] && !used[j])\\n {\\n que.push(j);\\n used[j] = true;\\n }\\n }\\n }\\n \\n res += calc_cc(connected, weight, G, i == 0);\\n }\\n \\n cout << res << endl;\\n \\n return;\\n}\\n\\nint main() {\\n \\n while (!is_end)\\n {\\n calc();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6430,\n \"memory_kb\": 3616,\n \"score_of_the_acc\": -0.8109,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2403_7961030\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll=vector<ll>;\\nusing vvll=vector<vll>;\\nusing vd =vector<double>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\n\\nll MW(vvll &G,vll& W){\\n ll N=G.size();\\n ll N1=N/2;\\n ll N2=N-N1;\\n vll V11(N1),V12(N1),V22(N2);\\n rep(i,N){\\n for(auto j:G[i]){\\n if(i<N1&&j<N1)V11[i]|=(1<<j);\\n if(i<N1&&j>=N1)V12[i]|=(1<<(j-N1));\\n if(i>=N1&&j>=N1)V22[i-N1]|=(1<<(j-N1));\\n }\\n }\\n vll DP(1<<N2);\\n //N2側内で求める\\n rep(bit,(1<<N2)){\\n ll res=0;\\n ll n=0;\\n rep(i,N2){\\n if(bit&(1<<i)){\\n res+=W[N1+i];\\n n|=V22[i];\\n }\\n }\\n if(!(n&bit)){\\n chmax(DP[bit],res);\\n }\\n rep(i,N2){\\n if(bit&(1<<i)){\\n\\n }\\n else{\\n chmax(DP[bit|(1<<i)],DP[bit]);\\n }\\n }\\n }\\n ll an=0;\\n //N1内で求めて, 結合\\n rep(bit,(1<<N1)){\\n //if(!(bit&1))continue;\\n ll res=0;\\n ll n1=0,n2=0;\\n rep(i,N1){\\n if(bit&(1<<i)){\\n res+=W[i];\\n n1|=V11[i];\\n n2|=V12[i];\\n }\\n }\\n if(!(n1&bit)){\\n chmax(an,res+DP[n2^((1<<N2)-1)]);\\n }\\n }\\n return an;\\n}\\n\\nint main() {\\n while(1){\\n ll N;\\n cin>>N;\\n \\n if(N==0)return 0;\\n vector<string> A(N);\\n vll B(N);\\n vector<vector<ll>> C(N);\\n vector<vector<string>> D(N);\\n map<string,ll> M; \\n rep(i,N){\\n cin>>A[i]>>B[i];\\n ll c;\\n cin>>c;\\n rep(j,c){\\n string S;\\n cin>>S;\\n D[i].push_back(S);\\n }\\n M[A[i]]=i;\\n }\\n \\n rep(i,N){\\n ll c=D[i].size();\\n rep(j,c){\\n C[i].push_back(M[D[i][j]]);\\n }\\n }\\n ll b=B[0];\\n B[0]=1e10;\\n //cout<<1<<endl;\\n ll an=MW(C,B);\\n cout<<an-B[0]+b<<endl;\\n \\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7980,\n \"memory_kb\": 11804,\n \"score_of_the_acc\": -1.2565,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2403_7867446\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int n) {\\n string as[40];\\n int bs[40], cs[40];\\n // vector< string > as(n);\\n // vector< int > bs(n);\\n // vector< int > cs(n);\\n vector< vector< string > > dss(n);\\n\\n map< string, int > to_node;\\n for (int i = 0; i < n; i++) {\\n cin >> as[i];\\n to_node[as[i]] = i;\\n\\n cin >> bs[i] >> cs[i];\\n dss[i].resize(cs[i]);\\n for (auto &d: dss[i]) {\\n cin >> d;\\n }\\n }\\n\\n int g[40][40] = {};\\n // auto g = vector(n, vector(n, 0));\\n for (int v = 0; v < n; v++) {\\n for (const auto &d: dss[v]) {\\n int u = to_node[d];\\n g[v][u] = 1;\\n }\\n }\\n\\n pair pre(0, n / 2), post(n / 2, n); // [first, second)\\n\\n bitset< (1 << 20) > pre_err;\\n // int pre_err[1 << 20] = {};\\n for (int u = pre.first; u < pre.second; u++) {\\n for (int v = u + 1; v < pre.second; v++) {\\n if (g[u][v] == 0) continue;\\n pre_err[(1 << u) | (1 << v)] = 1;\\n }\\n }\\n for (int bit = 0; bit < 1 << (pre.second - pre.first); bit++) {\\n if (not pre_err[bit]) continue;\\n for (int i = 0; i < (pre.second - pre.first); i++) {\\n pre_err[bit | (1 << i)] = 1;\\n }\\n }\\n\\n bitset< (1 << 20) > post_err;\\n // int post_err[1 << 20] = {};\\n for (int u = post.first; u < post.second; u++) {\\n for (int v = u + 1; v < post.second; v++) {\\n if (g[u][v] == 0) continue;\\n post_err[(1 << (u - post.first)) | (1 << (v - post.first))] = 1;\\n }\\n }\\n for (int bit = 0; bit < 1 << (post.second - post.first); bit++) {\\n if (not post_err[bit]) continue;\\n for (int i = 0; i < (post.second - post.first); i++) {\\n post_err[bit | (1 << i)] = 1;\\n }\\n }\\n\\n int dp[1 << 20] = {};\\n // vector< int > dp(1 << (post.second - post.first), 0);\\n { // precalc\\n int size = post.second - post.first;\\n for (int bit = 0; bit < (1 << size); bit++) {\\n\\n // check edge is not exist\\n // bool edge_exist = false;\\n // for (int u = 0; u < size; u++) {\\n // if ((bit & (1 << u)) == 0) continue;\\n // for (int v = u + 1; v < size; v++) {\\n // if ((bit & (1 << v)) == 0) continue;\\n // if (g[u + post.first][v + post.first] == 0) continue;\\n // edge_exist = true;\\n // break;\\n // }\\n // }\\n // if (edge_exist) continue;\\n if (post_err[bit]) continue;\\n\\n for (int v = 0; v < size; v++) {\\n if ((bit & (1 << v)) == 0) continue;\\n dp[bit] += bs[v + post.first];\\n }\\n }\\n \\n for (int bit = 0; bit < (1 << size); bit++) {\\n for (int i = 0; i < size; i++) {\\n dp[bit | (1 << i)] = max(dp[bit], dp[bit | (1 << i)]);\\n }\\n }\\n\\n } // precalc end\\n\\n int ans = 0;\\n int size = pre.second - pre.first;\\n for (int bit = 0; bit < (1 << size); bit++) {\\n if ((bit & 1) == 0) continue; // my country\\n\\n // bool edge_exist = false;\\n // for (int u = 0; u < size; u++) {\\n // if ((bit & (1 << u)) == 0) continue;\\n // for (int v = u + 1; v < size; v++) {\\n // if ((bit & (1 << v)) == 0) continue;\\n // if (g[u][v] == 0) continue;\\n // edge_exist = true;\\n // break;\\n // }\\n // }\\n // if (edge_exist) continue;\\n if (pre_err[bit]) continue;\\n\\n int subset = 0;\\n for (int v = post.first; v < post.second; v++) {\\n bool contain_subset = true;\\n for (int u = pre.first; u < pre.second; u++) {\\n if ((bit & (1 << u)) == 0) continue;\\n if (g[u][v] == 0) continue;\\n contain_subset = false;\\n break;\\n }\\n if (contain_subset) subset |= (1 << (v - post.first));\\n }\\n\\n int sum = 0;\\n for (int v = pre.first; v < pre.second; v++) {\\n if ((bit & (1 << v)) == 0) continue;\\n sum += bs[v];\\n }\\n\\n sum += dp[subset];\\n ans = max(ans, sum);\\n }\\n\\n cout << ans << endl;\\n}\\n\\nint main() {\\n int n;\\n while (cin >> n, n) {\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7240,\n \"memory_kb\": 8028,\n \"score_of_the_acc\": -1.0478,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2403_6705094\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <climits>\\n#include <cmath>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n#include <random>\\n#include <complex>\\n#include <bitset>\\n#include <iomanip>\\n#include <memory>\\n#include <functional>\\n\\n#define rep(i, n, s) for (int i = (s); i < int(n); i++)\\n#define per(i, n, s) for (int i = (n) - 1; i >= int(s); i--)\\n#define MM << \\\" \\\" <<\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n\\ntemplate <class T>\\nusing MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <class T>\\nusing MaxHeap = std::priority_queue<T>;\\n\\nusing ll = long long;\\nusing Pii = std::pair<int, int>;\\nusing Pll = std::pair<ll, ll>;\\nusing Pdd = std::pair<double, double>;\\n\\ntemplate <class T>\\nbool chmin(T &a, const T b) {\\n if (b < a) {\\n a = b;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\ntemplate <class T>\\nvoid vdeb(const std::vector<T> &da) {\\n auto n = da.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i == n - 1)\\n std::cout << da[i];\\n else\\n std::cout << da[i] << \\\" \\\";\\n }\\n std::cout << std::endl;\\n}\\ntemplate<class T>\\nvoid vdeb(const std::vector<std::vector<T>> &da) {\\n auto n = da.size();\\n for (size_t i = 0; i < n; i++) {\\n // std::cout << i << \\\" : \\\";\\n vdeb(da[i]);\\n }\\n std::cout << std::endl;\\n}\\n\\nusing namespace std;\\n\\nint n;\\n\\nint solve() {\\n map<string, int> mp;\\n vector<int> b(n);\\n vector<vector<string>> d(n, vector<string>(0));\\n rep(i,n,0) {\\n string a; cin >> a;\\n mp[a] = i;\\n cin >> b[i];\\n int c; cin >> c;\\n rep(j,c,0) {\\n string s; cin >> s;\\n d[i].emplace_back(move(s));\\n }\\n }\\n vector<vector<int>> da(n, vector<int>(0));\\n rep(i,n,0) {\\n for(auto &j : d[i]) {\\n da[i].emplace_back(mp[j]);\\n }\\n }\\n int m1 = n/2;\\n vector<int> dp1(1<<m1,-1);\\n dp1[0] = 0;\\n rep(i,1<<m1,1) {\\n int k = 0;\\n while(((i>>k)&1) == 0) {\\n ++k;\\n }\\n bool flg = false;\\n for(auto &j : da[k]) {\\n if(j < m1 && (i>>j)&1) flg = true;\\n }\\n if(!flg) dp1[i] = dp1[i^(1<<k)] + b[k];\\n }\\n rep(i,1<<m1,0) if(i%2 == 0) dp1[i] = -1;\\n rep(i,1<<m1,0) {\\n rep(j,m1,0) {\\n if((i>>j)&1) chmax(dp1[i], dp1[i^(1<<j)]);\\n }\\n }\\n int m2 = n - m1;\\n vector<int> dp2(1<<m2,-1);\\n vector<int> mask(1<<m2, 0);\\n dp2[0] = 0;\\n rep(i,1<<m2,1) {\\n int k = 0;\\n while(((i>>k)&1) == 0) {\\n ++k;\\n }\\n mask[i] = mask[i^(1<<k)];\\n bool flg = false;\\n for(auto &j : da[k+m1]) {\\n if(m1 <= j && (i>>(j-m1))&1) flg = true;\\n if(m1 > j) mask[i] |= 1<<j;\\n }\\n if(!flg) dp2[i] = dp2[i^(1<<k)] + b[k+m1];\\n }\\n int ans = 0;\\n // vdeb(dp1);\\n // vdeb(dp2);\\n // vdeb(mask);\\n const int kk = (1<<m1)-1;\\n rep(i,1<<m2,0) {\\n int j = mask[i]^kk;\\n if(dp2[i] != -1 && dp1[j] != -1) {\\n chmax(ans, dp2[i] + dp1[j]);\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n vector<int> ans;\\n while(1) {\\n cin >> n;\\n if(n == 0) break;\\n ans.emplace_back(solve());\\n }\\n for(auto &i : ans) cout << i << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3870,\n \"memory_kb\": 15700,\n \"score_of_the_acc\": -0.8572,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2403_6583001\",\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>\\nT weighted_maximum_independent_set(const std::vector<std::vector<int>>& G, const std::vector<T>& w) {\\n const int n = G.size();\\n const int n1 = n / 2;\\n const int n2 = n - n1;\\n std::vector<T> neighbors11(n1), neighbors12(n1), neighbors22(n2);\\n for (int i = 0; i < n; ++i) {\\n for (int j : G[i]) {\\n if (i < n1 && j < n1) neighbors11[i] |= 1 << j;\\n if (i < n1 && j >= n1) neighbors12[i] |= 1 << (j - n1);\\n if (i >= n1 && j >= n1) neighbors22[i - n1] |= 1 << (j - n1);\\n }\\n }\\n std::vector<int> dp(1 << n2);\\n for (int S = 0; S < 1 << n2; ++S) {\\n T s = 0;\\n int neighbor = 0;\\n for (int i = 0; i < n2; ++i) {\\n if (S >> i & 1) {\\n s += w[n1 + i];\\n neighbor |= neighbors22[i];\\n }\\n }\\n if (!(neighbor & S)) {\\n dp[S] = std::max(dp[S], s);\\n }\\n for (int i = 0; i < n2; ++i) {\\n if (!(S >> i & 1)) {\\n dp[S | (1 << i)] = std::max(dp[S | (1 << i)], dp[S]);\\n }\\n }\\n }\\n T ans = std::numeric_limits<T>::min();\\n for (int S = 0; S < 1 << n1; ++S) {\\n if (!(S & 1)) continue;\\n int s = 0;\\n int neighbor1 = 0;\\n int neighbor2 = 0;\\n for (int i = 0; i < n1; ++i) {\\n if (S >> i & 1) {\\n s += w[i];\\n neighbor1 |= neighbors11[i];\\n neighbor2 |= neighbors12[i];\\n }\\n }\\n if (!(neighbor1 & S)) {\\n ans = std::max(ans, s + dp[neighbor2 ^ ((1 << n2) - 1)]);\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int N;\\n cin >> N;\\n if (N == 0) break;\\n vector<string> A(N);\\n vector<int> B(N);\\n vector<vector<string>> D(N);\\n rep(i, 0, N) {\\n int C;\\n cin >> A[i] >> B[i] >> C;\\n rep(_, 0, C) {\\n string s;\\n cin >> s;\\n D[i].push_back(s);\\n }\\n }\\n if (N == 1) {\\n cout << B[0] << endl;\\n continue;\\n }\\n map<string, int> idx;\\n rep(i, 0, N) idx[A[i]] = i;\\n vector<vector<int>> G(N);\\n rep(i,0,N) {\\n for (auto& s : D[i]) {\\n G[i].push_back(idx[s]);\\n }\\n }\\n cout << weighted_maximum_independent_set(G, B) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5760,\n \"memory_kb\": 7720,\n \"score_of_the_acc\": -0.8518,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2403_6582959\",\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\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (true) {\\n int N;\\n cin >> N;\\n if (N == 0) break;\\n vector<string> A(N);\\n vector<int> B(N);\\n vector<vector<string>> D(N);\\n rep(i,0,N) {\\n int C;\\n cin >> A[i] >> B[i] >> C;\\n rep(_,0,C) {\\n string s;\\n cin >> s;\\n D[i].push_back(s);\\n }\\n }\\n if (N == 1) {\\n cout << B[0] << endl;\\n continue;\\n }\\n map<string, int> idx;\\n rep(i,0,N) idx[A[i]] = i;\\n const int N1 = N/2;\\n const int N2 = N-N1;\\n vector<ll> neighbors11(N1), neighbors12(N1), neighbors22(N2);\\n rep(i,0,N) {\\n for (auto& s : D[i]) {\\n int j = idx[s];\\n if (i < N1 && j < N1) neighbors11[i] |= 1<<j;\\n if (i < N1 && j >= N1) neighbors12[i] |= 1<<(j-N1);\\n if (i >= N1 && j >= N1) neighbors22[i-N1] |= 1<<(j-N1);\\n }\\n }\\n vector<int> dp(1<<N2);\\n rep(S,0,1<<N2) {\\n int s = 0;\\n int neighbor = 0;\\n rep(i,0,N2) {\\n if (S>>i&1) {\\n s += B[N1+i];\\n neighbor |= neighbors22[i];\\n }\\n }\\n if (!(neighbor & S)) {\\n chmax(dp[S], s);\\n }\\n rep(i,0,N2) {\\n if (!(S>>i&1)) {\\n chmax(dp[S|(1<<i)], dp[S]);\\n }\\n }\\n }\\n int ans = 0;\\n rep(S,0,1<<N1) {\\n if (!(S & 1)) continue;\\n int s = 0;\\n int neighbor1 = 0;\\n int neighbor2 = 0;\\n rep(i,0,N1) {\\n if (S>>i&1) {\\n s += B[i];\\n neighbor1 |= neighbors11[i];\\n neighbor2 |= neighbors12[i];\\n }\\n }\\n if (!(neighbor1 & S)) {\\n chmax(ans, s + dp[neighbor2 ^ ((1<<N2)-1)]);\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7000,\n \"memory_kb\": 7608,\n \"score_of_the_acc\": -1.0047,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2403_6446006\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\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, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.x >> pa.y;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const 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 T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing size_t = std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T>\\nvoid fill(std::vector<T> &v) {\\n for (T &e : v) std::cin >> e;\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT gcd(T a, T b) {\\n if (b == 0)\\n return a;\\n else\\n return gcd(b, a % b);\\n}\\n\\ntemplate <class T>\\nT lcm(T a, T b) {\\n a /= gcd(a, b);\\n return a * b;\\n}\\n\\ntemplate <class T>\\nT Pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n int n;\\n while (std::cin >> n, n != 0) {\\n std::map<std::string, int> map;\\n std::vector<int> powers(n);\\n std::vector table(n, std::vector<std::string>());\\n rep(i, 0, n) {\\n std::string s;\\n std::cin >> s >> powers[i];\\n map[s] = i;\\n int c;\\n std::cin >> c;\\n while (c--) {\\n std::string t;\\n std::cin >> t;\\n table[i].emplace_back(t);\\n }\\n }\\n if (n == 1) {\\n std::cout << powers.back() << '\\\\n';\\n continue;\\n }\\n const int sz = n / 2;\\n graph front(n), back(n);\\n rep(i, 0, n) {\\n for (auto s : table[i]) {\\n assert(map.find(s) != map.end());\\n int idx = map[s];\\n if (idx < sz) {\\n front[i].emplace_back(idx);\\n } else {\\n back[i].emplace_back(idx);\\n }\\n }\\n }\\n std::vector<int> dp(1 << sz, -INF);\\n {\\n std::vector<int> a(sz, 0);\\n rep(i, 0, sz) {\\n for (auto v : front[i]) {\\n a[i] |= 1 << v;\\n }\\n }\\n rep(bit, 0, 1 << sz) {\\n int sum = 0;\\n int ret = 0;\\n rep(i, 0, sz) {\\n if (bit & (1 << i)) {\\n sum += powers[i];\\n ret |= a[i];\\n chmax(dp[bit], dp[bit ^ (1 << i)]);\\n }\\n }\\n if ((bit & ret) == 0 && (bit & 1)) chmax(dp[bit], sum);\\n }\\n }\\n int ans = 0;\\n {\\n const int m = n - sz;\\n const int mask = (1 << sz) - 1;\\n std::vector<int> a(m, 0);\\n std::vector<int> b(m, 0);\\n rep(i, sz, n) {\\n for (auto v : back[i]) {\\n a[i - sz] |= 1 << (v - sz);\\n }\\n for (auto v : front[i]) {\\n b[i - sz] |= 1 << v;\\n }\\n }\\n rep(bit, 0, 1 << m) {\\n int sum = 0;\\n int ret = 0;\\n int cobit = 0;\\n rep(i, 0, m) {\\n if (bit & (1 << i)) {\\n sum += powers[i + sz];\\n ret |= a[i];\\n cobit |= b[i];\\n }\\n }\\n if ((bit & ret) == 0) {\\n cobit = mask ^ cobit;\\n chmax(ans, dp[cobit] + sum);\\n }\\n }\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5130,\n \"memory_kb\": 7708,\n \"score_of_the_acc\": -0.772,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2403_6394617\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\n#include <map>\\nusing namespace std;\\n\\nstruct Solver{\\n const int n;\\n vector<vector<int>> G;\\n vector<int> b;\\n vector<int> useable;\\n vector<int> lim;\\n int tot = 0;\\n int ans = 0;\\n Solver(int n): n(n), G(vector<vector<int>>(n)), b(vector<int>(n)),\\n useable(vector<int>(n, 0)), lim(vector<int>(n+1, 0)){\\n using tup = tuple<string, int, int, vector<string>>;\\n vector<tup> lines;\\n tup l0;\\n for(int i = 0; i < n; i++){\\n string a1;\\n int b1, c1;\\n cin >> a1 >> b1 >> c1;\\n vector<string> d1(c1);\\n for(auto &it: d1) cin >> it;\\n if(i > 0) lines.emplace_back(a1, b1, c1, d1);\\n else l0 = {a1, b1, c1, d1};\\n }\\n sort(lines.begin(), lines.end(), [](const auto &l, const auto &r){\\n return get<2>(l) < get<2>(r);\\n });\\n lines.emplace_back(l0);\\n reverse(lines.begin(), lines.end());\\n map<string, int> order;\\n for(int i = 0; i < n; i++) order[get<0>(lines[i])] = i;\\n for(int i = 0; i < n; i++){\\n // cout << get<2>(lines[i]) << \\\" \\\";\\n b[i] = get<1>(lines[i]);\\n for(auto &it: get<3>(lines[i])){\\n G[i].emplace_back(order[it]);\\n }\\n }\\n for(int i = n-1; i >= 0; i--) lim[i] = lim[i+1]+b[i];\\n //cout << endl;\\n }\\n\\n void f(int phase){\\n ans = max(ans, tot);\\n if(phase == n){\\n return;\\n }\\n if(useable[phase] > 0){\\n f(phase+1);\\n return;\\n }\\n if(tot+lim[phase] > ans && G[phase].size() > 0 && phase > 0){\\n f(phase+1);\\n }\\n // if(tot+lim[phase] < ans) return;\\n int mx = 0;\\n for(auto &it: G[phase]){\\n // if(it < phase) continue;\\n useable[it]++;\\n mx = max(mx, b[it]);\\n }\\n tot += b[phase];\\n f(phase+1);\\n tot -= b[phase];\\n for(auto &it: G[phase]){\\n // if(it < phase) continue;\\n useable[it]--;\\n }\\n return;\\n }\\n\\n void solve(){\\n f(0);\\n cout << ans << '\\\\n';\\n }\\n};\\n\\nint main(){\\n while(true){\\n int n; cin >> n;\\n if(n == 0) break;\\n Solver sol(n);\\n sol.solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3190,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.4046,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1372,"cells":{"group_id":{"kind":"string","value":"aoj_2404_cpp"},"problem_description":{"kind":"string","value":"Dog Food\nドッグフード\nEnglish text is not available in this practice contest.\nあなたは, 賢い犬を選ぶコンテストの主催者である．\n種目の1つに，以下のようなものがある．\nこの種目は，平面的な広場の上で行われる．\n広場には杭がいくつか立っており，そのうちの1つと，犬はロープで結ばれている．杭やロープの太さは無視できるものとする．ロープが結ばれている杭の座標を(0，0)，犬の位置を(Dx，Dy)とする．\nまた，ロープが結ばれている杭以外の杭の本数をｎ本とし，それらの座標を(x\n1\n，y\n1\n)... (x\nn\n，y\nn\n)とする．\n初期状態で，ロープはピンと張られた状態である．すなわち，ロープの長さはちょうど(Dx，Dy)と(0，0)の距離に等しく，その2つの端は原点の杭と犬にそれぞれ結び付けられている．\n(Fx，Fy)には，ドッグフードがおかれており，この地点がゴールである．この条件下で，短い走行距離でゴールに辿りつけた犬ほど賢いと考えられる．\n場合によっては，図F-1のように，直接ゴールに向かうと，別の杭にロープが引っかかり，ロープの長さが足りなくなって，ゴールにたどりつけないため，杭を迂回する必要があることに注意せよ．\nこの例は，サンプルの1番目の入力を表している．\n図 F-1: 杭を迂回する必要がある例\n優秀なプログラマーでもあるあなたは，犬がゴールにたどり着けるかどうか，またたどり着けるとしたら最短距離はどうなるのかを，あらかじめ計算しておくことにした．\nInput\n入力は1つ以上のデータセットからなる．1つのデータセットは次の形式をしている．データセット中の値は，全て整数である．\nn\nDx\nDy\nFx\nFx\nx\n1\ny\n1\n...\nx\nn\ny\nn\nn はロープが繋がっていない杭の本数を表す．\nDx, Dy は，犬の初期位置の座標を表す．\nFx, Fy は，ゴールの位置を表す．\nx\ni\n, y\ni\nは，ロープが繋がっていない杭の座標を表す．\nデータセットについて，つぎの制約が成立している．\n1 ≤ n ≤ 8\n-100 ≤ Dx, Dy, Fx, Fy, x\ni\n, y\ni\n≤ 100\n線分(0,0), (Dx,Dy)上に杭は存在しない.\n(0,0), (Dx, Dy), (Fx, Fy), (x\n1\n, y\n1\n), (x\n2\n, y\n2\n)... (x\nn\n, y\nn\n) はすべて異なる座標である.\nまた，以下のことを仮定してよい.\n(Dx,Dy) が原点方向に対して, ε(|ε| < 0.00001)だけ変化したとき, 結果が 0.0005 より大きく変化することはない．\n入力の終わりは，0を1つだけ含む行で表される．\nOutput\n各データセットについて，ゴールにたどり着ける場合は最短距離を，たどり着けない場合は-1を 1 行に出力せよ．\n出力には, 0.001を超える誤差があってはならない.\nSample Input\n1\n-4 -8\n3 -8\n0 -6\n1\n0 6\n4 0\n1 4\n1\n4 0\n0 6\n1 4\n4\n95 0\n0 90\n55 64\n33 31\n5 4\n15 43\n8\n100 100\n99 -100\n60 50\n6 5\n12 10\n24 20\n30 0\n70 0\n-30 -10\n-90 -30\n0\n図F-2, F-3, F-4 は，それぞれサンプルの2番目から4番目の配置を示している．\n図 F-2: 2番目のサンプル\n図 F-3: 3番目のサンプル\n図 F-4: 4番目のサンプル\nOutput for Sample Input\n8.0776872\n7.2360679\n-1\n140.2870005\n273.9090890"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2404_2818209","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;\n\nconst double EPS = 1e-10;\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<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\nbool intersectSP(const L& s, const P &p){\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\n}\n\nint in_poly(const P &p, const VP &poly){\n int n = poly.size();\n int ret = -1;\n for(int i=0; i<n; i++){\n P a = poly[i]-p;\n P b = poly[(i+1)%n]-p;\n if(a.Y > b.Y) swap(a,b);\n if(intersectSP(L(a,b), P(0,0))) return 0;\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\n }\n return ret;\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\nvector<bool> used(10, false);\ndouble limit;\ndouble solve(P pos, P goal, P pivot, double len, VP &pin){\n\tif(len + abs(pos-pivot) > limit +EPS) return INF;\n\tif(pos == goal) return 0;\n\t\n\tint n = pin.size()-2;\n\tdouble dist = INF;\n\tfor(int i=0; i<n+2; i++){\n\t\tif(used[i]) continue;\n\t\tused[i] = true;\n\t\t\n\t\tP newpivot = pivot;\n\t\tdouble newlen = len;\n\t\t\n\t\tVP tri{pos, pin[i], pivot};\n\t\tif(ccw(tri[0], tri[1], tri[2]) == -1) swap(tri[1], tri[2]);\n\t\tVP plist{pivot, pin[i]};\n\t\tfor(int j=0; j<n+1; j++){\n\t\t\tif(in_poly(pin[j], tri) == 1){\n\t\t\t\tplist.push_back(pin[j]);\n\t\t\t}\n\t\t}\n\t\tsort(plist.begin(), plist.end());\n\t\tplist.erase(unique(plist.begin(), plist.end()), plist.end());\n\t\t\n\t\tif((int)plist.size() >= 3){\n\t\t\tVP cvx = convex(plist);\n\t\t\tfor(int j=0; j<(int)cvx.size(); j++){\n\t\t\t\tif(cvx[j] == pivot){\n\t\t\t\t\tcvx.insert(cvx.end(), cvx.begin(), cvx.begin()+j);\n\t\t\t\t\tcvx.erase(cvx.begin(), cvx.begin()+j);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cvx[1] == pin[i]) reverse(cvx.begin()+1, cvx.end());\n\t\t\tfor(int j=0; j<(int)cvx.size()-2; j++){\n\t\t\t\tnewlen += abs(cvx[j+1] -cvx[j]);\n\t\t\t}\n\t\t\tnewpivot = *(cvx.end() -2);\n\t\t}\n\t\t\n\t\tP online(INF, INF);\n\t\tfor(int j=0; j<=n; j++){\n\t\t\tif(intersectSP(L(newpivot, pin[i]), pin[j]) && pin[j]!=newpivot && i!=j){\n\t\t\t\tif(abs(pin[i] -online) > abs(pin[i] -pin[j])){\n\t\t\t\t\tonline = pin[j];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(online!=P(INF, INF)){\n\t\t\tnewlen += abs(newpivot -online);\n\t\t\tnewpivot = online;\n\t\t}\n\t\tdist = min(dist, solve(pin[i], goal, newpivot, newlen, pin) +abs(pos-pin[i]));\n\t\t\n\t\tused[i] = false;\n\t}\n\treturn dist;\n}\n\nint main(){\n\tcout << fixed;\n\tcout << setprecision(10);\n\t\n\twhile(1){\n\t\tint n;\n\t\tcin >> n;\n\t\tif(n==0) break;\n\t\t\n\t\tdouble x,y;\n\t\tP s,g;\n\t\tcin >> x >> y; s = P(x, y);\n\t\tcin >> x >> y; g = P(x, y);\n\t\t\n\t\tVP pin(n+2); //0:スタート, 1~n:杭, n+1:ゴール\n\t\tpin[0] = P(0, 0);\n\t\tfor(int i=1; i<=n; i++){\n\t\t\tcin >> x >> y;\n\t\t\tpin[i] = P(x, y);\n\t\t}\n\t\tpin[n+1] = g;\n\t\tlimit = abs(s);\n\t\t\n\t\tif(abs(g) > abs(s) +EPS){\n\t\t\tcout << -1 << endl;\n\t\t}else{\n\t\t\tdouble ans = solve(s, g, pin[0], 0, pin);\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n return 0;\n}","accuracy":1,"time_ms":3740,"memory_kb":3336,"score_of_the_acc":-0.8145,"final_rank":10},{"submission_id":"aoj_2404_2113926","code_snippet":"#include<bits/stdc++.h>\n#define inf 1<<29\n#define linf 1e16\n#define eps (1e-8)\n#define mod 1000000007\n#define pi acos(-1)\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 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 equals(a,b) (fabs((a)-(b))<eps)\nusing namespace std;\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 vector<int> vi;\ntypedef vector<pii> vpi;\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\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{ return (x!=p.x ? x<p.x : y<p.y);}\n bool operator==(Point p)const{ 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\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\nint contains(Polygon g,Point p){\n int n=g.size();\n bool x=false;\n for(int i=0;i<n;i++){\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\n if(a.y>b.y)swap(a,b);\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\n }\n if(x)return 2;\n return 0;\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 getCircumference(Polygon p){\n int n=p.size();\n double res=0;\n FOR(i,0,n)res+=abs(p[i]-p[(i+1)%n]);\n return res;\n}\n\nint n;\nPoint s,t;\nvector<Point> vp;\nbool used[10]={};\n\nbool check(Point p,Point o,Point d,double dis){\n Polygon tr,cp;\n tr.pb(o);\n tr.pb(p);\n tr.pb(d);\n cp.pb(d);\n cp.pb(o);\n FOR(i,0,n){\n if(p==vp[i])continue;\n if(d==vp[i])continue;\n if(contains(tr,vp[i]))cp.pb(vp[i]);\n }\n cp = convex_hull(cp);\n if(getCircumference(cp)+dis-abs(d-o)-abs(s)<-eps)return true;\n return false;\n}\n\npair<Point,double> getm(Point p,Point o,Point d){\n Polygon tr,cp;\n tr.pb(o);\n tr.pb(p);\n tr.pb(d);\n cp.pb(d);\n cp.pb(o);\n FOR(i,0,n){\n if(p==vp[i])continue;\n if(d==vp[i])continue;\n if(contains(tr,vp[i]))cp.pb(vp[i]);\n }\n cp = convex_hull(cp);\n Point res;\n FOR(i,0,cp.size())\n if(cp[i]==d && cp[(i+1)%cp.size()]==o)\n res = cp[(i-1+cp.size())%cp.size()];\n reverse(all(cp));\n FOR(i,0,cp.size())\n if(cp[i]==d && cp[(i+1)%cp.size()]==o)\n res = cp[(i-1+cp.size())%cp.size()];\n return mp(res,getCircumference(cp)-abs(d-o)-abs(res-d));\n}\n\ndouble rec(Point p,Point o,double dis,double sum){\n double res = inf;\n if(check(p,o,t,dis))return sum+abs(p-t);\n FOR(i,0,n){\n if(used[i])continue;\n used[i]=true;\n if(check(p,o,vp[i],dis)){\n pair<Point,double> no = getm(p,o,vp[i]);\n res=min(res,rec(vp[i],no.f,no.s+dis,sum+abs(vp[i]-p)));\n }\n used[i]=false;\n }\n return res;\n}\n\ndouble solve(){\n if(abs(s)<abs(t))return -1;\n double res=abs(s)+abs(t);\n res = min(res,rec(s,Point(0,0),0,0));\n return res;\n}\n\nint main()\n{\n while(cin>>n && n){\n cin>>s.x>>s.y>>t.x>>t.y;\n vp.clear();\n FOR(i,0,n){\n int x,y;\n cin>>x>>y;\n vp.pb(Point(x,y));\n }\n pd(solve());\n }\n return 0;\n}","accuracy":1,"time_ms":820,"memory_kb":3208,"score_of_the_acc":-0.3477,"final_rank":8},{"submission_id":"aoj_2404_1184844","code_snippet":"#include<cstdio>\n#include<complex>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\ntypedef double Real;\n\ntypedef complex<Real> Point;\ntypedef complex<Real> Vector;\ntypedef pair<Point,Point> Segment;\ntypedef vector<Point> Polygon;\ntypedef pair<Point,Point> Line;\n\nconst Real eps=1e-9;\nconst Real PI=acos(-1.0);\n\ntemplate<class T> bool eq(T a,T b){\n\treturn abs(a-b)<eps;\n}\ntemplate<class T> int sgn(T a){\n\tif(eq(a,0.0)) return 0;\n\tif(a>0) return 1;\n\treturn -1;\n}\n\nReal arg(Vector a){\n\treturn atan2(a.imag(),a.real());\n}\n\nReal doP(Vector a,Vector b){\n\treturn (conj(a)*b).real();\n}\n\nReal crP(Vector a,Vector b){\n\treturn (conj(a)*b).imag();\n}\n\nPoint iLL(Line l1,Line l2){\n\tPoint a=l1.first,b=l1.second;\n\tPoint c=l2.first,d=l2.second;\n\tReal num=crP(c-a,d-a);\n\tReal den=crP(b-a,d-c);\n\treturn a+(b-a)*num/den;\n}\n\nPoint start,goal;\nPoint pts[10];\nint N;\n\nstruct State{\n\tPoint center;\n\tReal radius;\n\tPoint start,goal;\n\tState(){}\n\tbool isValid(){\n\t\tif(sgn(abs(goal-center)-radius)>0) return false;\n\t\treturn true;\n\t}\n\tState getNext(){\n\t\tif(sgn(crP(goal-start,-start))==0){\n\t\t\tState res(*this);\n\t\t\tres.start=goal;\n\t\t\treturn res;\n\t\t}\n\t\tReal curAng=-1;\n\t\tReal curDis=-1;\n\t\tPoint nxtCenter=center;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tPoint p=pts[i];\n\t\t\tint s1=sgn(crP(goal-start,p-start));\n\t\t\tint s2=sgn(crP(center-goal,p-goal));\n\t\t\tint s3=sgn(crP(start-center,p-center));\n\t\t\tif(s1*s3==0) continue;\n\t\t\tif(s2==0) s2=s1;\n\t\t\tif(s1!=s2||s1!=s3) continue;\n\t\t\tReal num=arg((p-center)/(start-center));\n\t\t\tReal den=arg((goal-center)/(start-center));\n\t\t\tReal ang=num/den;\n\t\t\tReal dis=abs(p-center);\n\t\t\tif(eq(curAng,-1.0)||sgn(curAng-ang)>0||(sgn(curAng-ang)==0&&sgn(curDis-dis)<0)){\n\t\t\t\tnxtCenter=p;\n\t\t\t\tcurAng=ang;\n\t\t\t\tcurDis=dis;\n\t\t\t}\n\t\t}\n\t\tif(eq(nxtCenter,center)){\n\t\t\tState res(*this);\n\t\t\tres.start=goal;\n\t\t\treturn res;\n\t\t}\n\t\tPoint nxtStart=iLL(Line(center,nxtCenter),Line(start,goal));\n\t\tState res;\n\t\tres.start=nxtStart;\n\t\tres.goal=goal;\n\t\tres.radius=radius-abs(nxtCenter-center);\n\t\tres.center=nxtCenter;\n\t\treturn res;\n\t}\n};\n\nPoint readP(){\n\tint x,y;\n\tscanf(\"%d%d\",&x,&y);\n\treturn Point(x,y);\n}\n\nvoid input(){\n\tscanf(\"%d\",&N);\n\tif(N==0) exit(0);\n\tstart=readP();\n\tgoal=readP();\n\tfor(int i=0;i<N;i++) pts[i]=readP();\n\tpts[N]=start;\n\tpts[N+1]=goal;\n}\n\nvector<vector<int> > ord;\n\nvector<int> vec;\nbool used[8];\nvoid dfs(){\n\tvec.push_back(N+1);\n\tord.push_back(vec);\n\tvec.pop_back();\n\tfor(int i=0;i<N;i++){\n\t\tif(used[i]) continue;\n\t\tvec.push_back(i);\n\t\tused[i]=true;\n\t\tdfs();\n\t\tused[i]=false;\n\t\tvec.pop_back();\n\t}\n}\n\nint main(){\n\twhile(true){\n\t\tinput();\n\t\tvec.clear();\n\t\tvec.push_back(N);\n\t\tord.clear();\n\t\tfor(int i=0;i<N;i++) used[i]=false;\n\t\tdfs();\n\t\tReal ans=-1;\n\t\tfor(int i=0;i<ord.size();i++){\n\t\t\tvector<int> ord=::ord[i];\n\t\t\tReal dis=0;\n\t\t\tState state;\n\t\t\tstate.start=pts[ord[0]];\n\t\t\tstate.radius=abs(start);\n\t\t\tstate.center=Point(0,0);\n\t\t\tbool suc=true;\n\t\t\tfor(int j=1;j<ord.size();j++){\n\t\t\t\tstate.goal=pts[ord[j]];\n\t\t\t\tdis+=abs(pts[ord[j]]-pts[ord[j-1]]);\n\t\t\t\twhile(true){\n\t\t\t\t\tif(state.isValid()==false){\n\t\t\t\t\t\tsuc=false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tstate=state.getNext();\n\t\t\t\t\tif(eq(state.start,state.goal)) break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(suc){\n\t\t\t\tif(eq(ans,-1.0)||sgn(ans-dis)>0){\n\t\t\t\t\tans=dis;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(ans<0){\n\t\t\tprintf(\"-1\\n\");\n\t\t}else{\n\t\t\tprintf(\"%f\\n\",ans);\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2330,"memory_kb":11512,"score_of_the_acc":-1.3598,"final_rank":12},{"submission_id":"aoj_2404_1117365","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\n#include <complex>\n#include <cmath>\n#define EPS 1.0e-10\n#define INF 1.0e5\n#define PI 3.1415926535897932384 \n\n// テ・ツョツ淌ヲツ閉ーテ」ツ?ョテァツャツヲテ・ツ渉キテゥツ鳴「テヲツ閉ー\ninline int signum(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n//XYテ・ツコツァテヲツィツ?\n#define X real()\n#define Y imag()\n// テァツつケ\ntypedef complex<double> P;\n \n\n// テァツキツ堙・ツ按?」ツδサテ・ツ債甘ァツ崢エテァツキツ堙」ツδサテァツ崢エテァツキツ?\nstruct L { P pos, dir; L(P p=P(), P d=P()):pos(p),dir(d){}};\n\n// テ・ツ、ツ堙ィツァツ津・ツスツ「\ntypedef vector<P> G;\n \n// テ・ツ??\nstruct C { P p; double r; };\n\n// std::norm テ」ツ?ッabs(p)*abs(p)テ」ツ?ェテ」ツ?ョテ」ツ?ァテゥツ??」ツ??\ninline double norm(P p){\n\treturn p.X*p.X+p.Y*p.Y;\n}\n\n// テ、ツコツ古」ツ?、テ」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォテ」ツ?ョテ・ツ??ァツゥツ催」ツつ津ィツィツ暗ァツョツ療」ツ?凖」ツつ?\ninline double inp(const P& a, const P& b) {\n\treturn (conj(a)*b).real();\n}\n \n// テ、ツコツ古」ツ?、テ」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォテ」ツ?ョテ・ツ、ツ姪ァツゥツ催」ツつ津ィツィツ暗ァツョツ療」ツ?凖」ツつ?\ninline double outp(const P& a, const P& b) {\n\treturn (conj(a)*b).imag();\n}\n\ninline int ccw(const P& p, const P& r, const P& s) {\n P a(r-p), b(s-p);\n int sgn = signum(outp(a, b));\n if (sgn != 0)\n return sgn;\n if (a.real()*b.real() < -EPS || a.imag()*b.imag() < -EPS)\n return -1;\n if (norm(a) < norm(b) - EPS)\n return 1;\n return 0;\n}\n\nbool sp_intersects(const L& s, const P& p) {\n return ( abs(s.pos - p) + abs(s.pos + s.dir - p) - abs(s.dir) < EPS );\n}\nbool insideP(G& g, const P& p) {\n\tif(ccw(g[0], g[1], g[2]) != 1) swap(g[1], g[2]);\n\tif(norm(g[0]-p) < EPS || norm(g[1]-p) < EPS || norm(g[2]-p) < EPS) return false;\n double sum = 0.0;\n int n = g.size();\n if(n && g[0] == p) return false;\n for(int i = 0; i < n; i++) {\n int j = (i+1)%n;\n if (sp_intersects(L(g[i], g[j]-g[i]), p))\n return true;\n sum += arg((g[j]-p)/(g[i]-p));\n }\n return (abs(sum) > 1);\n}\n\nbool xy_less(const P& a, const P& b) {\n if (abs(a.imag()-b.imag()) < EPS) return (a.real() < b.real());\n return (a.imag() < b.imag());\n}\ntemplate<class IN>\nvoid walk_rightside(IN begin, IN end, vector<P>& v) {\n IN cur = begin;\n v.push_back(*cur++);\n vector<P>::size_type s = v.size();\n v.push_back(*cur++);\n while(cur != end) {\n if (v.size() == s || ccw(v[v.size()-2], v.back(), *cur) > EPS)\n v.push_back(*cur++);\n else\n v.pop_back();\n }\n v.pop_back();\n}\n//テ・ツ?クテ・ツ個?」ツつ津ヲツアツづ」ツつ?」ツつ?\nvector<P> convex_hull(vector<P> v) {\n if (v.size() <= 1)\n return v; // EXCEPTIONAL\n sort(v.begin(), v.end(), xy_less);\n vector<P> cv;\n walk_rightside(v.begin(), v.end(), cv);\n walk_rightside(v.rbegin(), v.rend(), cv);\n return cv;\n}\n\nint n;\nP S, T;\n\ndouble dfs(P S1, P S2, vector<P> p, double l){\n//\tcout << \"(\" << S1 << \", \" << S2 << \", \" << l << \") start\" << endl;\n\tG g, g2;\n\tg.push_back(S1);\n\tg.push_back(S2);\n\tg.push_back(T);\n\tg2.push_back(S1);\n\tg2.push_back(T);\n\tREP(i, p.size()) if(insideP(g, p[i])) g2.push_back(p[i]);\n\tg2 = convex_hull(g2);\n\tdouble sum = 0;\n\tif(g2.size() == 2 && abs(T-S1) < l+EPS){\n//\t\tcout << \"3(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << abs(S2-T) << endl << endl;\n\t\treturn abs(S2-T);\n\t}\n\tREP(i, g2.size()) sum += abs(g2[i]-g2[(i+1)%g2.size()]);\n\tif(sum - abs(T-S1) < l+EPS){\n//\t\tcout << \"2(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << abs(S2-T) << endl << endl;\n\t\treturn abs(S2-T);\n\t}\n\tdouble res = INF;\n\tREP(i, p.size()){\n\t\tif(norm(p[i]-S2) < EPS || !insideP(g, p[i])) continue;\n//\t\tcout << \"!\" << p[i] << endl;\n\t\tG g, g2;\n\t\tg.push_back(S1);\n\t\tg.push_back(S2);\n\t\tg.push_back(p[i]);\n\t\tg2.push_back(S1);\n\t\tg2.push_back(p[i]);\n\t\tREP(j, p.size()) if(i!=j && insideP(g, p[j])) g2.push_back(p[j]);\n\t\tg2 = convex_hull(g2);\n//\t\tcout << g2 << endl;\n\t\tdouble sum = 0;\n\t\tif(g2.size() == 2 && abs(p[i]-S1) < l+EPS) chmin(res, abs(S2-p[i]) + dfs(S1, p[i], p, l));\n\t\tREP(j, g2.size()) sum += abs(g2[j]-g2[(j+1)%g2.size()]);\n\t\t\n\t\tif(sum - abs(p[i]-S1) < l+EPS){\n\t\t\tP prev;\n\t\t\tREP(j, g2.size()) if(abs(g2[j]-p[i])<EPS) prev = g2[(j+g2.size()-1)%g2.size()];\n//\t\t\tcout << g2 << endl;\n//\t\t\tcout << \"prev is \" << prev << endl;\n//\t\t\tcout << \"dfs\" << prev << \",\" << p[i] << endl;\n\t\t\tchmin(res, abs(S2-p[i]) + dfs(prev, p[i], p, l-(sum - abs(p[i]-S1) - abs(p[i]-prev))));\n\t\t}\n\t}\n//\tcout << \"1(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << res << endl << endl;\n\treturn res;\n}\n\nmain(){\n\twhile(cin >> n, n){\n\t\tvector<P> p;\n\t\tcin >> S.X >> S.Y >> T.X >> T.Y;\n\t\tREP(i, n){\n\t\t\tdouble x, y;\n\t\t\tcin >> x >> y;\n\t\t\tp.push_back(P(x, y));\n\t\t}\n\t\tif(ccw(P(0, 0), S, T) == -1){\n\t\t\tREP(i, n) p[i].Y = -p[i].Y;\n\t\t\tS.Y = -S.Y;\n\t\t\tT.Y = -T.Y;\n\t\t}\n\t\tdouble ret = dfs(P(0, 0), S, p, abs(S));\n\t\tif(ret > 90000) puts(\"-1\");\n\t\telse printf(\"%.9f\\n\", ret);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1376,"score_of_the_acc":-0.0516,"final_rank":5},{"submission_id":"aoj_2404_1015887","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\ntypedef complex<double> P;\ntypedef vector<P> L;\nP input() {\n double x, y;\n cin >> x >> y;\n return P(x, y);\n}\nconst double EPS = 1e-8;\nint sign(double x) {\n if(x > EPS) return 1;\n if(x < -EPS) return -1;\n return 0;\n}\ndouble dot(P a, P b) {\n return real(conj(a) * b);\n}\ndouble cross(P a, P b) {\n return imag(conj(a) * b);\n}\nP vec(L l) {\n return l[1] - l[0];\n}\nbool iLS(L l, L s) {\n return sign(cross(vec(l), s[0] - l[0]) * cross(vec(l), s[1] - l[0])) <= 0;\n}\n\nvector<P> pLL(L l, L m) {\n double A = cross(vec(l), vec(m));\n double B = cross(vec(l), l[1] - m[0]);\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]};\n if(sign(A) == 0) return {};\n return {m[0] + vec(m) * B / A};\n}\nconst double INF = 1e10;\nnamespace std{\n bool operator < (const P& a, const P& b) {\n if(a.real() != b.real()) return a.real() < b.real();\n else return a.imag() < b.imag();\n }\n};\n\nint cnt;\nmap< tuple<P, P, double>, double> memo;\ndouble calc(P dog, P fix, double length, P G, const vector<P>& rod, set<P> used=set<P>()) {\n auto t = make_tuple(dog, fix, length);\n if(sign(abs(dog - G)) == 0) return 0;\n if(sign(length - abs(fix - G)) < 0) return INF;\n if(memo.count(t)) return memo[t];\n\n //cout << dog << \" \" << fix << endl;\n\n vector<P> search = rod;\n search.push_back(G);\n double res = INF;\n for(P to : search) if(abs(dog - to) > EPS) {\n L path = {dog, to};\n vector<pair<P, P>> cand;\n for(int i = 0; i < rod.size(); i++) {\n if(sign(abs(rod[i] - dog)) == 0) continue;\n L line = {fix, rod[i]};\n if(iLS(line, path)) {\n vector<P> cpv = pLL(line, path);\n if(cpv.size() > 1) continue; // is it right??\n P cp = cpv[0];\n if(dot(rod[i] - fix, cp - fix) < 0) continue;\n if(sign(abs(rod[i] - fix) - abs(cp - fix)) >= 0) continue;\n cand.push_back(make_pair(cp, rod[i]));\n }\n }\n\n if(cand.empty()){\n if(!used.count(to)) {\n set<P> used2 = used;\n used2.insert(to);\n res = min(res, abs(to - dog) + calc(to, fix, length, G, rod, used2));\n }\n continue;\n }\n\n sort(cand.begin(), cand.end(),\n [&](pair<P, P> c1, pair<P, P> c2) {\n P p1, r1, p2, r2;\n tie(p1, r1) = c1;\n tie(p2, r2) = c2;\n int sp = sign( abs(dog - p1) - abs(dog - p2) );\n int sr = sign( abs(fix - r1) - abs(fix - r2) );\n return sp < 0 || (sp == 0 && sr > 0);\n });\n\n P ndog, nfix;\n tie(ndog, nfix) = cand[0];\n double nlength = length - abs(nfix - fix);\n //cout << \"p1: \" << dog << \" \" << fix << \" \" << length << \"->\" << \n // ndog << \" \" << nfix << \" \" << nlength << endl;\n res = min(res, abs(dog - ndog) + calc(ndog, nfix, nlength, G, rod, used));\n //cout << \"p2: \" << dog << \" \" << fix << \" \" << length << \"->\" << \n // nfix << \" \" << fix << \" \" << length << endl;\n if(!used.count(nfix)){\n set<P> used2 = used;\n used2.insert(nfix);\n res = min(res, abs(dog - nfix) + calc(nfix, fix, length, G, rod, used2));\n }\n }\n return memo[t] = res;\n}\nint main() {\n int n;\n while(cin >> n && n > 0) {\n P dog = input();\n P goal = input();\n P fix = {0, 0};\n vector<P> rod(n);\n REP(i, n) rod[i] = input();\n memo.clear();\n double ans = calc(dog, fix, abs(dog - fix),goal, rod);\n if(ans >= INF) {\n cout << -1 << endl;\n } else {\n printf(\"%.7f\\n\", ans);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1368,"score_of_the_acc":-0.0509,"final_rank":4},{"submission_id":"aoj_2404_1014926","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <iostream>\n#include <deque>\n#include <complex>\n#include <string>\n#include <iomanip>\n#include <sstream>\n#include <bitset>\n#include <valarray>\n#include <iterator>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned int uint;\ntypedef unsigned char uchar;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\n#define ALL(container) container.begin(), container.end()\n#define RALL(container) container.rbegin(), container.rend()\n#define SZ(container) ((int)container.size())\n#define mp(a,b) make_pair(a, b)\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\nos<<\"[\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"]\"; return os;\n}\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\nos<<\"{\"; FOR(it,t) {if(it!=t.begin()) os<<\",\"; os<<*it;} os<<\"}\"; return os;\n}\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\"(\"<<t.first<<\",\"<<t.second<<\")\";}\n\n#include <complex>\n#include <cmath>\n#define EPS 1.0e-10\n#define INF 1.0e5\n#define PI 3.1415926535897932384 \n\n// 実数の符号関数\ninline int signum(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\n//XY座標\n#define X real()\n#define Y imag()\n// 点\ntypedef complex<double> P;\n \n\n// 線分・半直線・直線\nstruct L { P pos, dir; L(P p=P(), P d=P()):pos(p),dir(d){}};\n\n// 多角形\ntypedef vector<P> G;\n \n// 円\nstruct C { P p; double r; };\n\n// std::norm はabs(p)*abs(p)なので遅い\ninline double norm(P p){\n\treturn p.X*p.X+p.Y*p.Y;\n}\n\n// 二つのベクトルの内積を計算する\ninline double inp(const P& a, const P& b) {\n\treturn (conj(a)*b).real();\n}\n \n// 二つのベクトルの外積を計算する\ninline double outp(const P& a, const P& b) {\n\treturn (conj(a)*b).imag();\n}\n\ninline int ccw(const P& p, const P& r, const P& s) {\n P a(r-p), b(s-p);\n int sgn = signum(outp(a, b));\n if (sgn != 0)\n return sgn;\n if (a.real()*b.real() < -EPS || a.imag()*b.imag() < -EPS)\n return -1;\n if (norm(a) < norm(b) - EPS)\n return 1;\n return 0;\n}\n\nbool sp_intersects(const L& s, const P& p) {\n return ( abs(s.pos - p) + abs(s.pos + s.dir - p) - abs(s.dir) < EPS );\n}\nbool insideP(G& g, const P& p) {\n\tif(ccw(g[0], g[1], g[2]) != 1) swap(g[1], g[2]);\n\tif(norm(g[0]-p) < EPS || norm(g[1]-p) < EPS || norm(g[2]-p) < EPS) return false;\n double sum = 0.0;\n int n = g.size();\n if(n && g[0] == p) return false;\n for(int i = 0; i < n; i++) {\n int j = (i+1)%n;\n if (sp_intersects(L(g[i], g[j]-g[i]), p))\n return true;\n sum += arg((g[j]-p)/(g[i]-p));\n }\n return (abs(sum) > 1);\n}\n\nbool xy_less(const P& a, const P& b) {\n if (abs(a.imag()-b.imag()) < EPS) return (a.real() < b.real());\n return (a.imag() < b.imag());\n}\ntemplate<class IN>\nvoid walk_rightside(IN begin, IN end, vector<P>& v) {\n IN cur = begin;\n v.push_back(*cur++);\n vector<P>::size_type s = v.size();\n v.push_back(*cur++);\n while(cur != end) {\n if (v.size() == s || ccw(v[v.size()-2], v.back(), *cur) > EPS)\n v.push_back(*cur++);\n else\n v.pop_back();\n }\n v.pop_back();\n}\n//凸包を求める\nvector<P> convex_hull(vector<P> v) {\n if (v.size() <= 1)\n return v; // EXCEPTIONAL\n sort(v.begin(), v.end(), xy_less);\n vector<P> cv;\n walk_rightside(v.begin(), v.end(), cv);\n walk_rightside(v.rbegin(), v.rend(), cv);\n return cv;\n}\n\nint n;\nP S, T;\n\ndouble dfs(P S1, P S2, vector<P> p, double l){\n//\tcout << \"(\" << S1 << \", \" << S2 << \", \" << l << \") start\" << endl;\n\tG g, g2;\n\tg.push_back(S1);\n\tg.push_back(S2);\n\tg.push_back(T);\n\tg2.push_back(S1);\n\tg2.push_back(T);\n\tREP(i, p.size()) if(insideP(g, p[i])) g2.push_back(p[i]);\n\tg2 = convex_hull(g2);\n\tdouble sum = 0;\n\tif(g2.size() == 2 && abs(T-S1) < l+EPS){\n//\t\tcout << \"3(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << abs(S2-T) << endl << endl;\n\t\treturn abs(S2-T);\n\t}\n\tREP(i, g2.size()) sum += abs(g2[i]-g2[(i+1)%g2.size()]);\n\tif(sum - abs(T-S1) < l+EPS){\n//\t\tcout << \"2(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << abs(S2-T) << endl << endl;\n\t\treturn abs(S2-T);\n\t}\n\tdouble res = INF;\n\tREP(i, p.size()){\n\t\tif(norm(p[i]-S2) < EPS || !insideP(g, p[i])) continue;\n//\t\tcout << \"!\" << p[i] << endl;\n\t\tG g, g2;\n\t\tg.push_back(S1);\n\t\tg.push_back(S2);\n\t\tg.push_back(p[i]);\n\t\tg2.push_back(S1);\n\t\tg2.push_back(p[i]);\n\t\tREP(j, p.size()) if(i!=j && insideP(g, p[j])) g2.push_back(p[j]);\n\t\tg2 = convex_hull(g2);\n//\t\tcout << g2 << endl;\n\t\tdouble sum = 0;\n\t\tif(g2.size() == 2 && abs(p[i]-S1) < l+EPS) chmin(res, abs(S2-p[i]) + dfs(S1, p[i], p, l));\n\t\tREP(j, g2.size()) sum += abs(g2[j]-g2[(j+1)%g2.size()]);\n\t\t\n\t\tif(sum - abs(p[i]-S1) < l+EPS){\n\t\t\tP prev;\n\t\t\tREP(j, g2.size()) if(abs(g2[j]-p[i])<EPS) prev = g2[(j+g2.size()-1)%g2.size()];\n//\t\t\tcout << g2 << endl;\n//\t\t\tcout << \"prev is \" << prev << endl;\n//\t\t\tcout << \"dfs\" << prev << \",\" << p[i] << endl;\n\t\t\tchmin(res, abs(S2-p[i]) + dfs(prev, p[i], p, l-(sum - abs(p[i]-S1) - abs(p[i]-prev))));\n\t\t}\n\t}\n//\tcout << \"1(\" << S1 << \", \" << S2 << \", \" << l << \") = \" << res << endl << endl;\n\treturn res;\n}\n\nmain(){\n\twhile(cin >> n, n){\n\t\tvector<P> p;\n\t\tcin >> S.X >> S.Y >> T.X >> T.Y;\n\t\tREP(i, n){\n\t\t\tdouble x, y;\n\t\t\tcin >> x >> y;\n\t\t\tp.push_back(P(x, y));\n\t\t}\n\t\tif(ccw(P(0, 0), S, T) == -1){\n\t\t\tREP(i, n) p[i].Y = -p[i].Y;\n\t\t\tS.Y = -S.Y;\n\t\t\tT.Y = -T.Y;\n\t\t}\n\t\tdouble ret = dfs(P(0, 0), S, p, abs(S));\n\t\tif(ret > 90000) puts(\"-1\");\n\t\telse printf(\"%.9f\\n\", ret);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1376,"score_of_the_acc":-0.0516,"final_rank":5},{"submission_id":"aoj_2404_584569","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#include <cmath>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef const P &rP;\n\n#define EPS 1e-7\n\ndouble ans;\nvector<P> pnts;\n\ndouble dot(rP va, rP vb){\n\treturn real(va) * real(vb) + imag(va) * imag(vb);\n}\n\ndouble cross(rP a, rP b){\n\treturn real(a) * imag(b) - imag(a) * real(b);\n}\n\ndouble distance_ls_p(rP a, rP b, rP c){\n\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\n\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\n\treturn abs(cross(b - a, c - a)) / abs(b - a);\n}\n\nbool contains(const vector<P> &plg, rP pt){\n\tint cnt = 0;\n\tdouble y = imag(pt);\n\n\tfor(int i = 0; i < plg.size(); ++i){\n\t\tint j = (i + 1 == plg.size() ? 0: i + 1);\n\n\t\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble dyi = imag(plg[i]) - y;\n\t\tdouble dyj = y - imag(plg[j]);\n\t\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\n\n\t\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t}\n\n\treturn (cnt % 2 != 0);\n}\n\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\n\tP da12 = pa2 - pa1;\n\tP db21 = pb1 - pb2;\n\tP dab1 = pb1 - pa1;\n\tdouble D = cross(da12, db21);\n\tdouble t = cross(dab1, db21) / D;\n\treturn pa1 + t * da12;\n}\n\n\nvoid dfs(int now, rP prev, int S, double len, double sum){\n\tif(now == 1){\n\t\tans = min(ans, sum);\n\t\treturn;\n\t}\n\n\tvector<P> tri(3);\n\n\tfor(int i = 1; i < pnts.size(); ++i){\n\t\tif(S >> i & 1){ continue; }\n\t\tif(abs(cross(pnts[now], pnts[i])) < EPS){\n\t\t\tcontinue;\n\t\t}\n\n\t\tint T = S | 1 << i;\n\t\tdouble nl = len;\n\t\tP base = prev;\n\t\tP pos = pnts[now];\n\n\t\twhile(1){\n\t\t\tint idx = -1;\n\t\t\tdouble minarg = 9.9;\n\t\t\tdouble maxnorm = -1.0;\n\n\t\t\ttri[0] = base;\n\t\t\ttri[1] = pos;\n\t\t\ttri[2] = pnts[i];\n\t\t\tfor(int j = 2; j < pnts.size(); ++j){\n\t\t\t\tif(!contains(tri, pnts[j])){\n\t\t\t\t\tbool cntn = false;\n\t\t\t\t\tfor(int k = 0; k < 3; ++k){\n\t\t\t\t\t\tif(norm(pnts[j] - tri[k]) < EPS){\n\t\t\t\t\t\t\tcntn = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(cntn){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tdouble d1 = abs(pnts[j] - base), d2 = abs(pnts[j] - pnts[i]);\n\t\t\t\t\tdouble d3 = abs(pnts[i] - base);\n\t\t\t\t\tif(abs(d1 + d2 - d3) > EPS){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\n\t\t\t\tdouble nm = norm(pnts[j] - base);\n\t\t\t\tif(a + EPS < minarg){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t\telse if(abs(a - minarg) < EPS && maxnorm < nm){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(idx == -1) break;\n\n\t\t\tpos = intersect(pos, pnts[i], base, pnts[idx]);\n\t\t\tnl -= abs(pnts[idx] - base);\n\t\t\tbase = pnts[idx];\n\t\t\tT |= 1 << idx;\n\t\t}\n\n\t\tif(nl > abs(pnts[1] - base) - EPS){\n\t\t\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\n\t\t}\n\t}\n}\n\n\nint main(){\n\tint n, x, y;\n\twhile(scanf(\"%d\", &n), n){\n\t\tpnts.resize(n + 2);\n\t\tfor(int i = 0; i < n + 2; ++i){\n\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\tpnts[i] = P(x, y);\n\t\t}\n\n\t\tif(norm(pnts[0]) < norm(pnts[1])){\n\t\t\tputs(\"-1\");\n\t\t}\n\t\telse{\n\t\t\tans = abs(pnts[0]) + abs(pnts[1]);\n\t\t\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\n\t\t\tprintf(\"%f\\n\", ans);\n\t\t}\n\t}\n}","accuracy":1,"time_ms":410,"memory_kb":1172,"score_of_the_acc":-0.0933,"final_rank":7},{"submission_id":"aoj_2404_584550","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#include <cmath>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef const P &rP;\n\n#define EPS 1e-7\n\ndouble ans;\nvector<P> pnts;\n\ndouble dot(rP va, rP vb){\n\treturn real(va) * real(vb) + imag(va) * imag(vb);\n}\n\ndouble cross(rP a, rP b){\n\treturn real(a) * imag(b) - imag(a) * real(b);\n}\n\ndouble distance_ls_p(rP a, rP b, rP c){\n\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\n\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\n\treturn abs(cross(b - a, c - a)) / abs(b - a);\n}\n\nbool contains(const vector<P> &plg, rP pt){\n\tint cnt = 0;\n\tdouble y = imag(pt);\n\n\tfor(int i = 0; i < plg.size(); ++i){\n\t\tint j = (i + 1 == plg.size() ? 0: i + 1);\n\n\t\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\n\t\t\treturn false;\n\t\t}\n\n\t\tdouble dyi = imag(plg[i]) - y;\n\t\tdouble dyj = y - imag(plg[j]);\n\t\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\n\n\t\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t}\n\n\treturn (cnt % 2 != 0);\n}\n\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\n\tP da12 = pa2 - pa1;\n\tP db21 = pb1 - pb2;\n\tP dab1 = pb1 - pa1;\n\tdouble D = cross(da12, db21);\n\tdouble t = cross(dab1, db21) / D;\n\treturn pa1 + t * da12;\n}\n\n\nvoid dfs(int now, rP prev, int S, double len, double sum){\n\tif(now == 1){\n\t\tans = min(ans, sum);\n\t\treturn;\n\t}\n\n\tvector<P> tri(3);\n\n\tfor(int i = 1; i < pnts.size(); ++i){\n\t\tif(S >> i & 1){ continue; }\n\t\tif(abs(cross(pnts[now], pnts[i])) < EPS){\n\t\t\tcontinue;\n\t\t}\n\n\t\tint T = S | 1 << i;\n\t\tdouble nl = len;\n\t\tP base = prev;\n\t\tP pos = pnts[now];\n\n\t\twhile(1){\n\t\t\tint idx = -1;\n\t\t\tdouble minarg = 9.9;\n\t\t\tdouble maxnorm = -1.0;\n\n\t\t\ttri[0] = base;\n\t\t\ttri[1] = pos;\n\t\t\ttri[2] = pnts[i];\n\t\t\tfor(int j = 2; j < pnts.size(); ++j){\n\t\t\t\tif(!contains(tri, pnts[j])){\n\t\t\t\t\tbool cntn = false;\n\t\t\t\t\tfor(int k = 0; k < 3; ++k){\n\t\t\t\t\t\tif(norm(pnts[j] - tri[k]) < EPS){\n\t\t\t\t\t\t\tcntn = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(cntn){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tdouble d1 = abs(pnts[j] - base), d2 = abs(pnts[j] - pnts[i]);\n\t\t\t\t\tdouble d3 = abs(pnts[i] - base);\n\t\t\t\t\tif(abs(d1 + d2 - d3) > EPS){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\n\t\t\t\tdouble nm = norm(pnts[j] - base);\n\t\t\t\tif(a + EPS < minarg){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t\telse if(abs(a - minarg) < EPS && maxnorm < nm){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(idx == -1) break;\n\n\t\t\tpos = intersect(pos, pnts[i], base, pnts[idx]);\n\t\t\tnl -= abs(pnts[idx] - base);\n\t\t\tbase = pnts[idx];\n\t\t\tT |= idx;\n\t\t}\n\n\t\tif(nl > abs(pnts[1] - base) - EPS){\n\t\t\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\n\t\t}\n\t}\n}\n\n\nint main(){\n\tint n, x, y;\n\twhile(scanf(\"%d\", &n), n){\n\t\tpnts.resize(n + 2);\n\t\tfor(int i = 0; i < n + 2; ++i){\n\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\tpnts[i] = P(x, y);\n\t\t}\n\n\t\tif(norm(pnts[0]) < norm(pnts[1])){\n\t\t\tputs(\"-1\");\n\t\t}\n\t\telse{\n\t\t\tans = abs(pnts[0]) + abs(pnts[1]);\n\t\t\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\n\t\t\tprintf(\"%f\\n\", ans);\n\t\t}\n\t}\n}","accuracy":0.25,"time_ms":410,"memory_kb":1172,"score_of_the_acc":-0.0933,"final_rank":14},{"submission_id":"aoj_2404_584543","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#include <cmath>\nusing namespace std;\n\ntypedef complex<double> P;\ntypedef const P &rP;\n\n#define EPS 1e-7\n\ndouble ans;\nvector<P> pnts;\n\ndouble dot(rP va, rP vb){\n\treturn real(va) * real(vb) + imag(va) * imag(vb);\n}\n\ndouble cross(rP a, rP b){\n\treturn real(a) * imag(b) - imag(a) * real(b);\n}\n\ndouble distance_ls_p(rP a, rP b, rP c){\n\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\n\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\n\treturn abs(cross(b - a, c - a)) / abs(b - a);\n}\n\nbool contains_tri(const vector<P> &plg, rP pt){\n\tint cnt = 0;\n\tdouble y = imag(pt);\n\n\tfor(int i = 0; i < 3; ++i){\n\t\tint j = (i == 2 ? 0: i + 1);\n\n\t\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\n\t\t\treturn (i == 2);\n\t\t}\n\n\t\tdouble dyi = imag(plg[i]) - y;\n\t\tdouble dyj = y - imag(plg[j]);\n\t\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\n\n\t\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\n\t\t\tif( tx < real(pt) ) ++cnt;\n\t\t}\n\t}\n\n\treturn (cnt % 2 != 0);\n}\n\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\n\tP da12 = pa2 - pa1;\n\tP db21 = pb1 - pb2;\n\tP dab1 = pb1 - pa1;\n\tdouble D = cross(da12, db21);\n\tdouble t = cross(dab1, db21) / D;\n\treturn pa1 + t * da12;\n}\n\n\nvoid dfs(int now, rP prev, int S, double len, double sum){\n\tif(now == 1){\n\t\tans = min(ans, sum);\n\t\treturn;\n\t}\n\n\tvector<P> tri(3);\n\n\tfor(int i = 1; i < pnts.size(); ++i){\n\t\tif(S >> i & 1){ continue; }\n\t\tif(abs(cross(pnts[now], pnts[i])) < EPS){\n\t\t\tcontinue;\n\t\t}\n\n\t\tint T = S | 1 << i;\n\t\tdouble nl = len;\n\t\tP base = prev;\n\t\tP pos = pnts[now];\n\n\t\twhile(1){\n\t\t\tint idx = -1;\n\t\t\tdouble minarg = 9.9;\n\t\t\tdouble maxnorm = -1.0;\n\n\t\t\ttri[0] = base;\n\t\t\ttri[1] = pos;\n\t\t\ttri[2] = pnts[i];\n\t\t\tfor(int j = 2; j < pnts.size(); ++j){\n\t\t\t\tif(!contains_tri(tri, pnts[j])){ continue; }\n\t\t\t\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\n\t\t\t\tdouble nm = norm(pnts[j] - base);\n\t\t\t\tif(a + EPS < minarg){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t\telse if(abs(a - minarg) < EPS && maxnorm < nm){\n\t\t\t\t\tminarg = a;\n\t\t\t\t\tmaxnorm = nm;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(idx == -1) break;\n\n\t\t\tpos = intersect(pos, pnts[i], base, pnts[idx]);\n\t\t\tnl -= abs(pnts[idx] - base);\n\t\t\tbase = pnts[idx];\n\t\t\tT |= idx;\n\t\t}\n\n\t\tif(nl > abs(pnts[1] - base) - EPS){\n\t\t\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\n\t\t}\n\t}\n}\n\n\nint main(){\n\tint n, x, y;\n\twhile(scanf(\"%d\", &n), n){\n\t\tpnts.resize(n + 2);\n\t\tfor(int i = 0; i < n + 2; ++i){\n\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\tpnts[i] = P(x, y);\n\t\t}\n\n\t\tif(norm(pnts[0]) < norm(pnts[1])){\n\t\t\tputs(\"-1\");\n\t\t}\n\t\telse{\n\t\t\tans = abs(pnts[0]) + abs(pnts[1]);\n\t\t\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\n\t\t\tprintf(\"%f\\n\", ans);\n\t\t}\n\t}\n}","accuracy":0.25,"time_ms":220,"memory_kb":1172,"score_of_the_acc":-0.0637,"final_rank":13},{"submission_id":"aoj_2404_564437","code_snippet":"#include<stdio.h>\n#include<math.h>\n#include<vector>\n#include<string.h>\n\nint n;\nint xs[10],ys[10];\nint fx,fy;\ndouble ans,maxLen;\n\nstd::vector<int> getInDeltaPoints(int bx,int by,int dx,int dy,int nx,int ny){\n\tstd::vector<int> re;\n\tint vxs[3],vys[3],dxs[3],dys[3];\n\tvxs[0]=dx-bx;\n\tvys[0]=dy-by;\n\tvxs[1]=nx-dx;\n\tvys[1]=ny-dy;\n\tvxs[2]=bx-nx;\n\tvys[2]=by-ny;\n\t\n\tfor(int i=0;i<=n;i++){\n\t\tint p=0,m=0,zero=0;\n\t\tdxs[0]=xs[i]-bx;\n\t\tdys[0]=ys[i]-by;\n\t\tdxs[1]=xs[i]-dx;\n\t\tdys[1]=ys[i]-dy;\n\t\tdxs[2]=xs[i]-nx;\n\t\tdys[2]=ys[i]-ny;\n\t\tfor(int j=0;j<3;j++){\n\t\t\tif(dxs[j]==0&&dys[j]==0)continue;\n\t\t\tint g=vxs[j]*dys[j]-dxs[j]*vys[j];\n\t\t\tif(g==0){\n\t\t\t\tzero++;\n\t\t\t}else if(g<0){\n\t\t\t\tm++;\n\t\t\t}else{\n\t\t\t\tp++;\n\t\t\t}\n\t\t}\n\t\tif(p==3||m==3)re.push_back(i);\n\t\tif(zero==1&&(p==2||m==2))re.push_back(i);\n\t}\n\treturn re;\n}\n\nvoid saiki(int bx,int by,int dx,int dy,int spents[10],double RopeLen,double moveLen);\n\nvoid saiki2(int bx,int by,int dx,int dy,int gx,int gy,std::vector<int>& perm,int spents[10],double RopeLen,double moveLen){\n\tif(RopeLen>maxLen)return;\n\tif(ans!=-1&&ans<moveLen)return ;\n\tif(getInDeltaPoints(bx,by,dx,dy,gx,gy).empty()==true){\n\t\tdouble lastAdd=sqrt((bx-gx)*(bx-gx)+(by-gy)*(by-gy));\n\t\tif(RopeLen+lastAdd>maxLen)return;\n\t\tmoveLen+=sqrt((dx-gx)*(dx-gx)+(dy-gy)*(dy-gy));\n\t\tif(gx==fx&&gy==fy){\n\t\t\tif(ans==-1||ans>moveLen)ans=moveLen;\n\t\t}else{\n\t\t\tsaiki(bx,by,gx,gy,spents,RopeLen,moveLen);\n\t\t}\n\t\treturn ;\n\t}\n\tfor(unsigned int i=0;i<perm.size();i++){\n\t\tint no=perm[i];\n\t\tif(spents[no]==0&&getInDeltaPoints(bx,by,dx,dy,xs[no],ys[no]).empty()==true){\n\t\t\tspents[no]=1;\n\t\t\tdouble t=sqrt((bx-xs[no])*(bx-xs[no])+(by-ys[no])*(by-ys[no]));\n\t\t\tsaiki2(xs[no],ys[no],dx,dy,gx,gy,perm,spents,RopeLen+t,moveLen);\n\t\t\tspents[no]=0;\n\t\t}\n\t}\n}\n\nvoid saiki(int bx,int by,int dx,int dy,int spents[10],double RopeLen,double moveLen){\n\tstd::vector<int> perm=getInDeltaPoints(bx,by,dx,dy,fx,fy);\n\tsaiki2(bx,by,dx,dy,fx,fy,perm,spents,RopeLen,moveLen);\n\tfor(int i=0;i<=n;i++){\n\t\tif(spents[i]==0){\n\t\t\tspents[i]=1;\n\t\t\tperm=getInDeltaPoints(bx,by,dx,dy,xs[i],ys[i]);\n\t\t\tsaiki2(bx,by,dx,dy,xs[i],ys[i],perm,spents,RopeLen,moveLen);\n\t\t\tspents[i]=0;\n\t\t}\n\t}\n}\n\nvoid calc(){\n\tint dx,dy;\n\tscanf(\"%d %d %d %d\",&dx,&dy,&fx,&fy);\n\tfor(int i=0;i<n;i++)scanf(\"%d %d\",&xs[i],&ys[i]);\n\txs[n]=0;\n\tys[n]=0;\n\tint spents[10]={0};\n\tans=-1;\n\tmaxLen=sqrt(dx*dx+dy*dy);\n\tsaiki(0,0,dx,dy,spents,0,0);\n\tif(ans==-1){\n\t\tprintf(\"-1\\n\");\n\t}else{\n\t\tprintf(\"%.7lf\\n\",ans);\n\t}\n}\n\nint main(){\n\twhile(1){\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0)break;\n\t\tcalc();\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":1096,"score_of_the_acc":-0.0317,"final_rank":3},{"submission_id":"aoj_2404_443508","code_snippet":"#include <iostream>\n#include <cmath>\n#include <vector>\n#include <complex>\n#include <cassert>\n#include <algorithm>\nusing namespace std;\n\ntypedef complex<double> point;\n\nstruct line : public vector<point> {\n\tline(const point& a, const point& b) { push_back(a); push_back(b); }\n};\n\nconst double pi = M_PI;\nconst double inf = 1e10;\nconst double eps = 1e-10;\npoint unit (const point& v) { return v/abs(v); }\npoint ortho(const point& v) { return v*point(0,1); }\npoint vec (const line& l) { return l[1]-l[0]; }\nbool equal(const double a, const double b) { return abs(a-b)<eps; }\nbool equal(const point& a, const point& b) { return abs(a-b)<eps; }\ndouble dot (const point& a, const point& b) { return (a*conj(b)).real(); }\ndouble cross(const point& a, const point& b) { return (conj(a)*b).imag(); }\n\nint ccw(const point& a, const point& b, const point& c) {\n\tpoint u=b-a, v=c-a;\n\tif(cross(u,v) > 0 ) return +1; // ccw\n\tif(cross(u,v) < 0 ) return -1; // cw\n\tif( dot(u,v) < 0 ) return +2; // cab\n\tif(abs(u) < abs(v)) return -2; // abc\n\treturn 0; // acb\n}\n\nint ccw(const line& s, const point& p) {\n\treturn ccw(s[0], s[1], p);\n}\n\npoint crosspoint(const line& l, const line& m) {\n\tdouble A = cross(vec(l), vec(m));\n\tdouble B = cross(vec(l), l[1]-m[0]);\n\tif(abs(A)<eps) {\t\t\t// parallel\n\t\tassert(abs(B)<eps);\n\t\treturn m[1];\t\t\t// sameline\n\t}\n\treturn m[0] + B/A*vec(m);\n}\n\nbool contain(const point& a, const point& b, const point& c, const point& p) {\n\treturn (ccw(a,b,p)!=-1 && ccw(b,c,p)!=-1 && ccw(c,a,p)!=-1)\n\t || (ccw(a,b,p)!=+1 && ccw(b,c,p)!=+1 && ccw(c,a,p)!=+1);\n}\n\nint N;\npoint pile[8],dog,food;\n\npair<double,point> check(point base, point curr, point dest, double rest) {\n\t//cout << base << curr << dest << rest << endl;\n\tint mi=-1;\n\tdouble md=0,ma=inf;\n\tfor(int i=0; i<N; i++) {\n\t\tif(equal(pile[i],base)) continue;\n\t\tif(equal(pile[i],curr)) continue;\n\t\tif(equal(pile[i],dest)) continue;\n\t\tif(equal(base,curr)) continue;\n\t\tif(equal(curr,dest)) continue;\n\t\tif(equal(dest,base)) continue;\n\t\tif(!contain(base,curr,dest,pile[i])) continue;\n\t\tdouble d = abs(pile[i]-base);\n\t\tdouble a = abs(arg(curr-base)-arg(pile[i]-base));\n\t\tif(equal(a,ma)) {\n\t\t\tif(md<d) { mi=i; md=d; ma=a; }\n\t\t}\n\t\telse if(a<ma) {\n\t\t\tmi=i; md=d; ma=a;\n\t\t}\n\t}\n\n\tif(mi<0) return make_pair(rest,base);\n\n\tline l(base, pile[mi]);\n\tline m(curr, dest);\n\tcurr = crosspoint(l,m);\n\treturn check(pile[mi], curr, dest, rest-abs(pile[mi]-base));;\n}\n\ndouble solve(int use, point base, point curr, double rest, double dist) {\n\tpair<double,point> ret = check(base,curr,food,rest);\n\tif(ret.first >= abs(ret.second-food)) return dist + abs(food-curr);\n\tdouble ans=inf;\n\tfor(int i=0; i<N; i++) {\n\t\tif(use&(1<<i)) continue;\n\t\tret = check(base,curr,pile[i],rest);\n\t\tif(ret.first < 0) continue;\n\t\tans=min(ans,solve(use|(1<<i), ret.second, pile[i], ret.first, dist+abs(pile[i]-curr)));\n\t}\n\treturn ans;\n}\n\nint main()\n{\n\twhile(cin>>N, N)\n\t{\n\t\tcin >> dog.real() >> dog.imag();\n\t\tcin >> food.real() >> food.imag();\n\t\tfor(int i=0; i<N; i++) {\n\t\t\tcin >> pile[i].real() >> pile[i].imag();\n\t\t}\n\t\tcout.setf(ios::fixed); cout.precision(10);\n\t\tdouble ans = solve(0, 0, dog, abs(dog), 0);\n\t\tif(ans==inf) cout << \"-1\" << endl;\n\t\telse cout << ans << endl;\n\t}\t\t\n}","accuracy":1,"time_ms":3670,"memory_kb":1028,"score_of_the_acc":-0.5876,"final_rank":9},{"submission_id":"aoj_2404_434257","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\ntypedef complex<double> P;\nnamespace std {\n bool operator < (const P& a, const P& b) {\n // if (abs(a-b)<EPS) return 0;\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n }\n}\ndouble cross(const P& a, const P& b) {\n return imag(conj(a)*b);\n}\ndouble dot(const P& a, const P& b) {\n return real(conj(a)*b);\n}\nstruct L : public vector<P> {\n L(const P &a, const P &b) {\n push_back(a); push_back(b);\n }\n L() {}\n};\nint ccw(P a, P b, P c) {\n b -= a; c -= a;\n if (cross(b, c) > 0) return +1; // counter clockwise\n if (cross(b, c) < 0) return -1; // clockwise\n if (dot(b, c) < 0) return +2; // c--a--b on line\n if (norm(b) < norm(c)) return -2; // a--b--c on line\n return 0;\n}\ntypedef vector<P> G;\n#define curr(P, i) P[i]\n#define next(P, i) P[(i+1)%P.size()]\n// 点-凸多角形包含関係\nbool convex_contain(const G &g, const P &p) { // 半時計回りを仮定\n REP(i,g.size())\n if (ccw(g[i], next(g, i), p) == -1) return 0;\n return 1;\n}\n// 角度関連\ndouble angle(const P &a, const P &b) { // ベクトルａからみたベクトルｂの角度の計算[0,2pi]\n double ret = arg(b)-arg(a);\n return (ret>=0) ? ret : ret + 2*PI;\n}\ndouble angle2(const P &a, const P &b) { // ベクトルaとベクトルbの間の角度\n return min(angle(a,b), angle(b,a));\n}\nP rotate(P p, double ang) {\n return p * P(cos(ang), sin(ang));\n}\n\n\nP p[10];\nP dog;\nint n;\n\ntypedef pair<double,double> pdd;\n// centerに繋がれているとき、dからp[nxt]まで行くために巻きつく紐と総移動距離\npdd func(int ¢er, const P &d, int nxt) {\n //cout << \"func(\" << p[center] << \", \" << d << \", \" << p[nxt] << \")\" << endl;\n L l(d, p[nxt]);\n int cw = ccw(p[center], d, p[nxt]);\n if (abs(cw) != 1) { // ikeru\n return pdd(0, abs(p[nxt]-d));\n }\n G g(3);\n g[0] = p[center];\n g[1] = d;\n g[2] = p[nxt];\n if (cw == -1) swap(g[1],g[2]);\n double minang = INF;\n int id = -1;\n REP(i,n+1) {\n if (convex_contain(g, p[i])) {\n if (i == nxt || i == center || abs(p[i]-d) < EPS) continue;\n double ang = angle2(d-p[center], p[i]-p[center]);\n if (minang > ang){\n minang = ang;\n id = i;\n }\n }\n }\n if (id == -1) {\n // ikeru\n return pdd(0, abs(p[nxt]-d));\n }\n pdd res = pdd(abs(p[id]-p[center]), 0);\n center = id;\n pdd ret = func(center, d, nxt);\n return pdd(res.first + ret.first, res.second + ret.second);\n}\n\ndouble ans;\n\ndouble simulate(vector<int> v) {\n double sum = 0;\n int center = n;\n P now = dog;\n double res = 0;\n v.push_back(9);\n REP(i,v.size()) {\n pdd ret = func(center, now, v[i]);\n sum += ret.first;\n res += ret.second;\n // cout << sum << \" \" << res << endl;\n now = p[v[i]];\n if (sum+abs(p[center]-p[9]) > abs(dog) + EPS) return INF;\n if (res > ans) return INF;\n }\n sum += abs(p[center] - now);\n // FOR(it, v) cout << *it << \" \";cout << endl;\n // cout << sum << \", \" << res << endl;\n if (sum > abs(dog)+EPS) return INF;\n // if (res < 220) {\n // FOR(it, v) cout << *it << \" \"; cout << endl;\n // cout << p[center] << \" \" << now << endl;\n // cout << sum << \" \" << res << endl;\n // }\n else return res;\n}\n\nvector<int> v;\nvoid solve(int S) {\n ans = min(ans, simulate(v));\n if (S==(1<<n)-1) return;\n REP(i,n) {\n if (!(S>>i&1)) {\n v.push_back(i);\n solve(S|1<<i);\n v.pop_back();\n }\n }\n}\n\nint main() {\n while(cin>>n,n) {\n cin >> dog.real() >> dog.imag();\n cin >> p[9].real() >> p[9].imag();\n REP(i,n) cin >> p[i].real() >> p[i].imag();\n p[n] = P(0,0);\n // vector<int> v(2);v[0]=0;v[1]=5;\n // simulate(v);return 0;\n ans = simulate(vector<int>(1,n));\n solve(0);\n if (ans >= INF-EPS) {\n cout << -1 << endl;\n } else {\n printf(\"%.10f\\n\", ans);\n }\n }\n}","accuracy":1,"time_ms":6440,"memory_kb":1032,"score_of_the_acc":-1.0195,"final_rank":11},{"submission_id":"aoj_2404_433066","code_snippet":"#include<cmath>\n#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double EPS=1e-7;\nconst double INF=1e77;\nconst double PI=acos(-1);\n\ntemplate<class T>\nstruct point{\n\tT x,y;\n\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; }\n\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; }\n\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\n\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\n};\n\ntemplate<class T>\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\n\nbool operator==(const point<double> &a,const point<double> &b){\n\treturn abs(a.x-b.x)<EPS && abs(a.y-b.y)<EPS;\n}\nbool operator!=(const point<double> &a,const point<double> &b){\n\treturn abs(a.x-b.x)>EPS || abs(a.y-b.y)>EPS;\n}\n\ntemplate<class T>\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\n\ntemplate<class T>\ndouble arg(const point<T> &a){\n\tdouble t=atan2(a.y,a.x);\n\treturn t<0?t+2*PI:t;\n}\n\ntemplate<class T>\nstruct line{\n\tpoint<T> a,b;\n\toperator line<double>()const{ return (line<double>){a,b}; }\n};\n\nenum {CCW=1,CW=-1,ON=0};\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\n\tdouble rdir=cross(b-a,c-a);\n\tif(rdir> EPS) return CCW;\n\tif(rdir<-EPS) return CW;\n\treturn ON;\n}\n\ntemplate<class T>\ndouble dist(const point<T> &a,const point<T> &b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\n}\n\ntemplate<class T>\nbool cover(const point<T> &a,const point<T> &b,const point<T> &c,const point<T> &p){\n\tint d1=ccw(p,a,b);\n\tint d2=ccw(p,b,c);\n\tint d3=ccw(p,c,a);\n\treturn !(d1==CCW && d2== CW || d1==CCW && d3== CW || d2==CCW && d3== CW\n\t\t || d1== CW && d2==CCW || d1== CW && d3==CCW || d2== CW && d3==CCW);\n}\n\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\n\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\n\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\n\tif(abs(a1)<EPS) return L1.a;\n\treturn L2.a+a2/a1*(L2.b-L2.a);\n}\n\nint n;\npoint<double> p[9]; // ツ杭, ツつスツつセツつオ p[n] ツづ債ゴツーツδ?\n\nbool vis[9];\ndouble dfs(point<double> D,point<double> O,double r){ // ツ個「ツづ個暗環置, ツ嘉アツ転ツ陳?心, ツ紐ツづ個陳キツつウ\n\tif(D==p[n]) return 0;\n\n\tif(r+EPS<dist(O,p[n])) return INF;\n\n\tdouble res=INF;\n\trep(i,n+1) if(!vis[i]) {\n\t\t// D ツつゥツづァ P ツづ可古シツつゥツづ?づ?づ慊づ?つキツつョツ進ツづ?\n\t\tpoint<double> P=p[i];\n\t\tdouble t0=arg(D-O);\n\n\t\tint j0=-1; // ツづ債つカツづ淞づ可づ板づつつゥツづゥツ杭ツづーツ個ゥツづつつッツづゥ\n\t\trep(j,n) if(p[j]!=O && p[j]!=P && p[j]!=D) {\n\t\t\tif(cover(O,D,P,p[j])){ // ツ三ツ角ツ形 ODP ツづ個陳?づ可杭 j ツつェツつ?づゥツづ?つォ\n\t\t\t\tif(j0==-1) j0=j;\n\t\t\t\telse{\n\t\t\t\t\tdouble t1=arg(p[j0]-O)-t0; t1=min(abs(t1),abs(2*PI-t1));\n\t\t\t\t\tdouble t2=arg(p[j ]-O)-t0; t2=min(abs(t2),abs(2*PI-t2));\n\t\t\t\t\tif(t2+EPS<t1 || abs(t1-t2)<EPS && dist(p[j0],O)<dist(p[j],O)){\n\t\t\t\t\t\tj0=j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(j0==-1){ // ツづ?づ個杭ツづ可づ?づ板づつつゥツづァツづ按つ「\n\t\t\tdouble d=dist(O,P);\n\t\t\tif(d<r+EPS){\n\t\t\t\tvis[i]=true;\n\t\t\t\tres=min(res,dist(D,P)+dfs(P,O,r));\n\t\t\t\tvis[i]=false;\n\t\t\t}\n\t\t}\n\t\telse{ // ツ杭 j0 ツづ可づ板づつつゥツづゥ\n\t\t\tpoint<double> Q=get_intersect((line<double>){D,P},(line<double>){O,p[j0]});\n\t\t\tdouble d=dist(O,Q);\n\t\t\tif(d<r+EPS){\n\t\t\t\tres=min(res,dist(D,Q)+dfs(Q,p[j0],r-dist(O,p[j0])));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn res;\n}\n\nint main(){\n\tfor(;scanf(\"%d\",&n),n;){\n\t\tpoint<double> D; // dog\n\t\tscanf(\"%lf%lf%lf%lf\",&D.x,&D.y,&p[n].x,&p[n].y);\n\t\trep(i,n) scanf(\"%lf%lf\",&p[i].x,&p[i].y);\n\n\t\tpoint<double> O={0,0};\n\t\tdouble ans=dfs(D,O,dist(D,O));\n\t\tprintf(\"%.9f\\n\",ans<INF/2?ans:-1);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":824,"score_of_the_acc":-0.0171,"final_rank":2},{"submission_id":"aoj_2404_433065","code_snippet":"#include<cmath>\n#include<cstdio>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst double EPS=1e-7;\nconst double INF=1e77;\nconst double PI=acos(-1);\n\ntemplate<class T>\nstruct point{\n\tT x,y;\n\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; }\n\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; }\n\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\n\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\n};\n\ntemplate<class T>\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\n\nbool operator==(const point<double> &a,const point<double> &b){\n\treturn abs(a.x-b.x)<EPS && abs(a.y-b.y)<EPS;\n}\nbool operator!=(const point<double> &a,const point<double> &b){\n\treturn abs(a.x-b.x)>EPS || abs(a.y-b.y)>EPS;\n}\n\ntemplate<class T>\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\n\ntemplate<class T>\ndouble arg(const point<T> &a){\n\tdouble t=atan2(a.y,a.x);\n\treturn t<0?t+2*PI:t;\n}\n\ntemplate<class T>\nstruct line{\n\tpoint<T> a,b;\n\toperator line<double>()const{ return (line<double>){a,b}; }\n};\n\nenum {CCW=1,CW=-1,ON=0};\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\n\tdouble rdir=cross(b-a,c-a);\n\tif(rdir> EPS) return CCW;\n\tif(rdir<-EPS) return CW;\n\treturn ON;\n}\n\ntemplate<class T>\ndouble dist(const point<T> &a,const point<T> &b){\n\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\n}\n\ntemplate<class T>\nbool cover(const point<T> &a,const point<T> &b,const point<T> &c,const point<T> &p){\n\tint d1=ccw(p,a,b);\n\tint d2=ccw(p,b,c);\n\tint d3=ccw(p,c,a);\n\treturn !(d1==CCW && d2== CW || d1==CCW && d3== CW || d2==CCW && d3== CW\n\t\t || d1== CW && d2==CCW || d1== CW && d3==CCW || d2== CW && d3==CCW);\n}\n\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\n\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\n\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\n\tif(abs(a1)<EPS) return L1.a;\n\treturn L2.a+a2/a1*(L2.b-L2.a);\n}\n\nint n;\npoint<double> p[9]; // ツ杭, ツつスツつセツつオ p[n] ツづ債ゴツーツδ?\n\nbool vis[9];\ndouble dfs(point<double> D,point<double> O,double r){ // ツ個「ツづ個暗環置, ツ嘉アツ転ツ陳?心, ツ紐ツづ個陳キツつウ\n\tif(D==p[n]) return 0;\n\n\tif(r+EPS<dist(O,p[n])) return INF;\n// printf(\"D = (%.2f, %.2f)\\n\",D.x,D.y);\n// printf(\"O = (%.2f, %.2f)\\n\",O.x,O.y);\n// printf(\"r = %.2f\\n\",r);\n\tdouble res=INF;\n\trep(i,n+1) if(!vis[i]) {\n\t\t// D ツつゥツづァ P ツづ可古シツつゥツづ?づ?づ慊づ?つキツつョツ進ツづ?\n\t\tpoint<double> P=p[i];\n\t\tdouble t0=arg(D-O);\n\n\t\tif(ccw(O,D,P)!=ON){ // O, D, P ツつェツ暗ェツ陳シツ静シツ湘」ツづ可づ按つ「ツづ?つォ\n\t\t\tint j0=-1; // ツづ債つカツづ淞づ可づ板づつつゥツづゥツ杭ツづーツ個ゥツづつつッツづゥ\n\t\t\trep(j,n) if(p[j]!=O && p[j]!=P && p[j]!=D) {\n\t\t\t\tif(cover(O,D,P,p[j])){ // ツ三ツ角ツ形 ODP ツづ個陳?づ可杭 j ツつェツつ?づゥツづ?つォ\n\t\t\t\t\tif(j0==-1) j0=j;\n\t\t\t\t\telse{\n\t\t\t\t\t\tdouble t1=arg(p[j0]-O)-t0; t1=min(abs(t1),abs(2*PI-t1));\n\t\t\t\t\t\tdouble t2=arg(p[j ]-O)-t0; t2=min(abs(t2),abs(2*PI-t2));\n\t\t\t\t\t\tif(t2+EPS<t1 || abs(t1-t2)<EPS && dist(p[j0],O)<dist(p[j],O)){\n\t\t\t\t\t\t\tj0=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\tif(j0==-1){ // ツづ?づ個杭ツづ可づ?づ板づつつゥツづァツづ按つ「\n\t\t\t\tdouble d=dist(O,P);\n\t\t\t\tif(d<r+EPS){\n\t\t\t\t\tvis[i]=true;\n\t\t\t\t\tres=min(res,dist(D,P)+dfs(P,O,r));\n\t\t\t\t\tvis[i]=false;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{ // ツ杭 j0 ツづ可づ板づつつゥツづゥ\n\t\t\t\tpoint<double> Q=get_intersect((line<double>){D,P},(line<double>){O,p[j0]});\n\t\t\t\tdouble d=dist(O,Q);\n\t\t\t\tif(d<r+EPS){\n\t\t\t\t\tres=min(res,dist(D,Q)+dfs(Q,p[j0],r-dist(O,p[j0])));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse{ // O, D, P ツつェツ暗ェツ陳シツ静シツ湘」ツづ可つ?づゥツづ?つォ\n\t\t}\n\t}\n\n\treturn res;\n}\n\nint main(){\n\tfor(;scanf(\"%d\",&n),n;){\n\t\tpoint<double> D; // dog\n\t\tscanf(\"%lf%lf%lf%lf\",&D.x,&D.y,&p[n].x,&p[n].y);\n\t\trep(i,n) scanf(\"%lf%lf\",&p[i].x,&p[i].y);\n\n\t\tpoint<double> O={0,0};\n\t\tdouble ans=dfs(D,O,dist(D,O));\n\t\tprintf(\"%.9f\\n\",ans<INF/2?ans:-1);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":824,"score_of_the_acc":-0.0062,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2404_2818209\",\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;\\n\\nconst double EPS = 1e-10;\\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<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\\nbool intersectSP(const L& s, const P &p){\\n return abs(cross(s[0]-p, s[1]-p))<EPS && dot(s[0]-p, s[1]-p)<EPS;\\n}\\n\\nint in_poly(const P &p, const VP &poly){\\n int n = poly.size();\\n int ret = -1;\\n for(int i=0; i<n; i++){\\n P a = poly[i]-p;\\n P b = poly[(i+1)%n]-p;\\n if(a.Y > b.Y) swap(a,b);\\n if(intersectSP(L(a,b), P(0,0))) return 0;\\n if(a.Y<=0 && b.Y>0 && cross(a,b)<0) ret = -ret;\\n }\\n return ret;\\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\\nvector<bool> used(10, false);\\ndouble limit;\\ndouble solve(P pos, P goal, P pivot, double len, VP &pin){\\n\\tif(len + abs(pos-pivot) > limit +EPS) return INF;\\n\\tif(pos == goal) return 0;\\n\\t\\n\\tint n = pin.size()-2;\\n\\tdouble dist = INF;\\n\\tfor(int i=0; i<n+2; i++){\\n\\t\\tif(used[i]) continue;\\n\\t\\tused[i] = true;\\n\\t\\t\\n\\t\\tP newpivot = pivot;\\n\\t\\tdouble newlen = len;\\n\\t\\t\\n\\t\\tVP tri{pos, pin[i], pivot};\\n\\t\\tif(ccw(tri[0], tri[1], tri[2]) == -1) swap(tri[1], tri[2]);\\n\\t\\tVP plist{pivot, pin[i]};\\n\\t\\tfor(int j=0; j<n+1; j++){\\n\\t\\t\\tif(in_poly(pin[j], tri) == 1){\\n\\t\\t\\t\\tplist.push_back(pin[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(plist.begin(), plist.end());\\n\\t\\tplist.erase(unique(plist.begin(), plist.end()), plist.end());\\n\\t\\t\\n\\t\\tif((int)plist.size() >= 3){\\n\\t\\t\\tVP cvx = convex(plist);\\n\\t\\t\\tfor(int j=0; j<(int)cvx.size(); j++){\\n\\t\\t\\t\\tif(cvx[j] == pivot){\\n\\t\\t\\t\\t\\tcvx.insert(cvx.end(), cvx.begin(), cvx.begin()+j);\\n\\t\\t\\t\\t\\tcvx.erase(cvx.begin(), cvx.begin()+j);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(cvx[1] == pin[i]) reverse(cvx.begin()+1, cvx.end());\\n\\t\\t\\tfor(int j=0; j<(int)cvx.size()-2; j++){\\n\\t\\t\\t\\tnewlen += abs(cvx[j+1] -cvx[j]);\\n\\t\\t\\t}\\n\\t\\t\\tnewpivot = *(cvx.end() -2);\\n\\t\\t}\\n\\t\\t\\n\\t\\tP online(INF, INF);\\n\\t\\tfor(int j=0; j<=n; j++){\\n\\t\\t\\tif(intersectSP(L(newpivot, pin[i]), pin[j]) && pin[j]!=newpivot && i!=j){\\n\\t\\t\\t\\tif(abs(pin[i] -online) > abs(pin[i] -pin[j])){\\n\\t\\t\\t\\t\\tonline = pin[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(online!=P(INF, INF)){\\n\\t\\t\\tnewlen += abs(newpivot -online);\\n\\t\\t\\tnewpivot = online;\\n\\t\\t}\\n\\t\\tdist = min(dist, solve(pin[i], goal, newpivot, newlen, pin) +abs(pos-pin[i]));\\n\\t\\t\\n\\t\\tused[i] = false;\\n\\t}\\n\\treturn dist;\\n}\\n\\nint main(){\\n\\tcout << fixed;\\n\\tcout << setprecision(10);\\n\\t\\n\\twhile(1){\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\tif(n==0) break;\\n\\t\\t\\n\\t\\tdouble x,y;\\n\\t\\tP s,g;\\n\\t\\tcin >> x >> y; s = P(x, y);\\n\\t\\tcin >> x >> y; g = P(x, y);\\n\\t\\t\\n\\t\\tVP pin(n+2); //0:スタート, 1~n:杭, n+1:ゴール\\n\\t\\tpin[0] = P(0, 0);\\n\\t\\tfor(int i=1; i<=n; i++){\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tpin[i] = P(x, y);\\n\\t\\t}\\n\\t\\tpin[n+1] = g;\\n\\t\\tlimit = abs(s);\\n\\t\\t\\n\\t\\tif(abs(g) > abs(s) +EPS){\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t}else{\\n\\t\\t\\tdouble ans = solve(s, g, pin[0], 0, pin);\\n\\t\\t\\tcout << ans << endl;\\n\\t\\t}\\n\\t}\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3740,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.8145,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2404_2113926\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define inf 1<<29\\n#define linf 1e16\\n#define eps (1e-8)\\n#define mod 1000000007\\n#define pi acos(-1)\\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 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 equals(a,b) (fabs((a)-(b))<eps)\\nusing namespace std;\\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 vector<int> vi;\\ntypedef vector<pii> vpi;\\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\\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{ return (x!=p.x ? x<p.x : y<p.y);}\\n bool operator==(Point p)const{ 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\\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\\nint contains(Polygon g,Point p){\\n int n=g.size();\\n bool x=false;\\n for(int i=0;i<n;i++){\\n Vector a=g[i]-p,b=g[(i+1)%n]-p;\\n if(abs(cross(a,b))<eps && dot(a,b)<eps)return 1;\\n if(a.y>b.y)swap(a,b);\\n if(a.y<eps && eps<b.y && cross(a,b)>eps)x=!x;\\n }\\n if(x)return 2;\\n return 0;\\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 getCircumference(Polygon p){\\n int n=p.size();\\n double res=0;\\n FOR(i,0,n)res+=abs(p[i]-p[(i+1)%n]);\\n return res;\\n}\\n\\nint n;\\nPoint s,t;\\nvector<Point> vp;\\nbool used[10]={};\\n\\nbool check(Point p,Point o,Point d,double dis){\\n Polygon tr,cp;\\n tr.pb(o);\\n tr.pb(p);\\n tr.pb(d);\\n cp.pb(d);\\n cp.pb(o);\\n FOR(i,0,n){\\n if(p==vp[i])continue;\\n if(d==vp[i])continue;\\n if(contains(tr,vp[i]))cp.pb(vp[i]);\\n }\\n cp = convex_hull(cp);\\n if(getCircumference(cp)+dis-abs(d-o)-abs(s)<-eps)return true;\\n return false;\\n}\\n\\npair<Point,double> getm(Point p,Point o,Point d){\\n Polygon tr,cp;\\n tr.pb(o);\\n tr.pb(p);\\n tr.pb(d);\\n cp.pb(d);\\n cp.pb(o);\\n FOR(i,0,n){\\n if(p==vp[i])continue;\\n if(d==vp[i])continue;\\n if(contains(tr,vp[i]))cp.pb(vp[i]);\\n }\\n cp = convex_hull(cp);\\n Point res;\\n FOR(i,0,cp.size())\\n if(cp[i]==d && cp[(i+1)%cp.size()]==o)\\n res = cp[(i-1+cp.size())%cp.size()];\\n reverse(all(cp));\\n FOR(i,0,cp.size())\\n if(cp[i]==d && cp[(i+1)%cp.size()]==o)\\n res = cp[(i-1+cp.size())%cp.size()];\\n return mp(res,getCircumference(cp)-abs(d-o)-abs(res-d));\\n}\\n\\ndouble rec(Point p,Point o,double dis,double sum){\\n double res = inf;\\n if(check(p,o,t,dis))return sum+abs(p-t);\\n FOR(i,0,n){\\n if(used[i])continue;\\n used[i]=true;\\n if(check(p,o,vp[i],dis)){\\n pair<Point,double> no = getm(p,o,vp[i]);\\n res=min(res,rec(vp[i],no.f,no.s+dis,sum+abs(vp[i]-p)));\\n }\\n used[i]=false;\\n }\\n return res;\\n}\\n\\ndouble solve(){\\n if(abs(s)<abs(t))return -1;\\n double res=abs(s)+abs(t);\\n res = min(res,rec(s,Point(0,0),0,0));\\n return res;\\n}\\n\\nint main()\\n{\\n while(cin>>n && n){\\n cin>>s.x>>s.y>>t.x>>t.y;\\n vp.clear();\\n FOR(i,0,n){\\n int x,y;\\n cin>>x>>y;\\n vp.pb(Point(x,y));\\n }\\n pd(solve());\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 820,\n \"memory_kb\": 3208,\n \"score_of_the_acc\": -0.3477,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2404_1184844\",\n \"code_snippet\": \"#include<cstdio>\\n#include<complex>\\n#include<cmath>\\n#include<vector>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\ntypedef double Real;\\n\\ntypedef complex<Real> Point;\\ntypedef complex<Real> Vector;\\ntypedef pair<Point,Point> Segment;\\ntypedef vector<Point> Polygon;\\ntypedef pair<Point,Point> Line;\\n\\nconst Real eps=1e-9;\\nconst Real PI=acos(-1.0);\\n\\ntemplate<class T> bool eq(T a,T b){\\n\\treturn abs(a-b)<eps;\\n}\\ntemplate<class T> int sgn(T a){\\n\\tif(eq(a,0.0)) return 0;\\n\\tif(a>0) return 1;\\n\\treturn -1;\\n}\\n\\nReal arg(Vector a){\\n\\treturn atan2(a.imag(),a.real());\\n}\\n\\nReal doP(Vector a,Vector b){\\n\\treturn (conj(a)*b).real();\\n}\\n\\nReal crP(Vector a,Vector b){\\n\\treturn (conj(a)*b).imag();\\n}\\n\\nPoint iLL(Line l1,Line l2){\\n\\tPoint a=l1.first,b=l1.second;\\n\\tPoint c=l2.first,d=l2.second;\\n\\tReal num=crP(c-a,d-a);\\n\\tReal den=crP(b-a,d-c);\\n\\treturn a+(b-a)*num/den;\\n}\\n\\nPoint start,goal;\\nPoint pts[10];\\nint N;\\n\\nstruct State{\\n\\tPoint center;\\n\\tReal radius;\\n\\tPoint start,goal;\\n\\tState(){}\\n\\tbool isValid(){\\n\\t\\tif(sgn(abs(goal-center)-radius)>0) return false;\\n\\t\\treturn true;\\n\\t}\\n\\tState getNext(){\\n\\t\\tif(sgn(crP(goal-start,-start))==0){\\n\\t\\t\\tState res(*this);\\n\\t\\t\\tres.start=goal;\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\t\\tReal curAng=-1;\\n\\t\\tReal curDis=-1;\\n\\t\\tPoint nxtCenter=center;\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tPoint p=pts[i];\\n\\t\\t\\tint s1=sgn(crP(goal-start,p-start));\\n\\t\\t\\tint s2=sgn(crP(center-goal,p-goal));\\n\\t\\t\\tint s3=sgn(crP(start-center,p-center));\\n\\t\\t\\tif(s1*s3==0) continue;\\n\\t\\t\\tif(s2==0) s2=s1;\\n\\t\\t\\tif(s1!=s2||s1!=s3) continue;\\n\\t\\t\\tReal num=arg((p-center)/(start-center));\\n\\t\\t\\tReal den=arg((goal-center)/(start-center));\\n\\t\\t\\tReal ang=num/den;\\n\\t\\t\\tReal dis=abs(p-center);\\n\\t\\t\\tif(eq(curAng,-1.0)||sgn(curAng-ang)>0||(sgn(curAng-ang)==0&&sgn(curDis-dis)<0)){\\n\\t\\t\\t\\tnxtCenter=p;\\n\\t\\t\\t\\tcurAng=ang;\\n\\t\\t\\t\\tcurDis=dis;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(eq(nxtCenter,center)){\\n\\t\\t\\tState res(*this);\\n\\t\\t\\tres.start=goal;\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\t\\tPoint nxtStart=iLL(Line(center,nxtCenter),Line(start,goal));\\n\\t\\tState res;\\n\\t\\tres.start=nxtStart;\\n\\t\\tres.goal=goal;\\n\\t\\tres.radius=radius-abs(nxtCenter-center);\\n\\t\\tres.center=nxtCenter;\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nPoint readP(){\\n\\tint x,y;\\n\\tscanf(\\\"%d%d\\\",&x,&y);\\n\\treturn Point(x,y);\\n}\\n\\nvoid input(){\\n\\tscanf(\\\"%d\\\",&N);\\n\\tif(N==0) exit(0);\\n\\tstart=readP();\\n\\tgoal=readP();\\n\\tfor(int i=0;i<N;i++) pts[i]=readP();\\n\\tpts[N]=start;\\n\\tpts[N+1]=goal;\\n}\\n\\nvector<vector<int> > ord;\\n\\nvector<int> vec;\\nbool used[8];\\nvoid dfs(){\\n\\tvec.push_back(N+1);\\n\\tord.push_back(vec);\\n\\tvec.pop_back();\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tif(used[i]) continue;\\n\\t\\tvec.push_back(i);\\n\\t\\tused[i]=true;\\n\\t\\tdfs();\\n\\t\\tused[i]=false;\\n\\t\\tvec.pop_back();\\n\\t}\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tinput();\\n\\t\\tvec.clear();\\n\\t\\tvec.push_back(N);\\n\\t\\tord.clear();\\n\\t\\tfor(int i=0;i<N;i++) used[i]=false;\\n\\t\\tdfs();\\n\\t\\tReal ans=-1;\\n\\t\\tfor(int i=0;i<ord.size();i++){\\n\\t\\t\\tvector<int> ord=::ord[i];\\n\\t\\t\\tReal dis=0;\\n\\t\\t\\tState state;\\n\\t\\t\\tstate.start=pts[ord[0]];\\n\\t\\t\\tstate.radius=abs(start);\\n\\t\\t\\tstate.center=Point(0,0);\\n\\t\\t\\tbool suc=true;\\n\\t\\t\\tfor(int j=1;j<ord.size();j++){\\n\\t\\t\\t\\tstate.goal=pts[ord[j]];\\n\\t\\t\\t\\tdis+=abs(pts[ord[j]]-pts[ord[j-1]]);\\n\\t\\t\\t\\twhile(true){\\n\\t\\t\\t\\t\\tif(state.isValid()==false){\\n\\t\\t\\t\\t\\t\\tsuc=false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tstate=state.getNext();\\n\\t\\t\\t\\t\\tif(eq(state.start,state.goal)) break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(suc){\\n\\t\\t\\t\\tif(eq(ans,-1.0)||sgn(ans-dis)>0){\\n\\t\\t\\t\\t\\tans=dis;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ans<0){\\n\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"%f\\\\n\\\",ans);\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2330,\n \"memory_kb\": 11512,\n \"score_of_the_acc\": -1.3598,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2404_1117365\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\n#include <complex>\\n#include <cmath>\\n#define EPS 1.0e-10\\n#define INF 1.0e5\\n#define PI 3.1415926535897932384 \\n\\n// テ・ツョツ淌ヲツ閉ーテ」ツ?ョテァツャツヲテ・ツ渉キテゥツ鳴「テヲツ閉ー\\ninline int signum(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n//XYテ・ツコツァテヲツィツ?\\n#define X real()\\n#define Y imag()\\n// テァツつケ\\ntypedef complex<double> P;\\n \\n\\n// テァツキツ堙・ツ按?」ツδサテ・ツ債甘ァツ崢エテァツキツ堙」ツδサテァツ崢エテァツキツ?\\nstruct L { P pos, dir; L(P p=P(), P d=P()):pos(p),dir(d){}};\\n\\n// テ・ツ、ツ堙ィツァツ津・ツスツ「\\ntypedef vector<P> G;\\n \\n// テ・ツ??\\nstruct C { P p; double r; };\\n\\n// std::norm テ」ツ?ッabs(p)*abs(p)テ」ツ?ェテ」ツ?ョテ」ツ?ァテゥツ??」ツ??\\ninline double norm(P p){\\n\\treturn p.X*p.X+p.Y*p.Y;\\n}\\n\\n// テ、ツコツ古」ツ?、テ」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォテ」ツ?ョテ・ツ??ァツゥツ催」ツつ津ィツィツ暗ァツョツ療」ツ?凖」ツつ?\\ninline double inp(const P& a, const P& b) {\\n\\treturn (conj(a)*b).real();\\n}\\n \\n// テ、ツコツ古」ツ?、テ」ツ?ョテ」ツδ凖」ツつッテ」ツδ暗」ツδォテ」ツ?ョテ・ツ、ツ姪ァツゥツ催」ツつ津ィツィツ暗ァツョツ療」ツ?凖」ツつ?\\ninline double outp(const P& a, const P& b) {\\n\\treturn (conj(a)*b).imag();\\n}\\n\\ninline int ccw(const P& p, const P& r, const P& s) {\\n P a(r-p), b(s-p);\\n int sgn = signum(outp(a, b));\\n if (sgn != 0)\\n return sgn;\\n if (a.real()*b.real() < -EPS || a.imag()*b.imag() < -EPS)\\n return -1;\\n if (norm(a) < norm(b) - EPS)\\n return 1;\\n return 0;\\n}\\n\\nbool sp_intersects(const L& s, const P& p) {\\n return ( abs(s.pos - p) + abs(s.pos + s.dir - p) - abs(s.dir) < EPS );\\n}\\nbool insideP(G& g, const P& p) {\\n\\tif(ccw(g[0], g[1], g[2]) != 1) swap(g[1], g[2]);\\n\\tif(norm(g[0]-p) < EPS || norm(g[1]-p) < EPS || norm(g[2]-p) < EPS) return false;\\n double sum = 0.0;\\n int n = g.size();\\n if(n && g[0] == p) return false;\\n for(int i = 0; i < n; i++) {\\n int j = (i+1)%n;\\n if (sp_intersects(L(g[i], g[j]-g[i]), p))\\n return true;\\n sum += arg((g[j]-p)/(g[i]-p));\\n }\\n return (abs(sum) > 1);\\n}\\n\\nbool xy_less(const P& a, const P& b) {\\n if (abs(a.imag()-b.imag()) < EPS) return (a.real() < b.real());\\n return (a.imag() < b.imag());\\n}\\ntemplate<class IN>\\nvoid walk_rightside(IN begin, IN end, vector<P>& v) {\\n IN cur = begin;\\n v.push_back(*cur++);\\n vector<P>::size_type s = v.size();\\n v.push_back(*cur++);\\n while(cur != end) {\\n if (v.size() == s || ccw(v[v.size()-2], v.back(), *cur) > EPS)\\n v.push_back(*cur++);\\n else\\n v.pop_back();\\n }\\n v.pop_back();\\n}\\n//テ・ツ?クテ・ツ個?」ツつ津ヲツアツづ」ツつ?」ツつ?\\nvector<P> convex_hull(vector<P> v) {\\n if (v.size() <= 1)\\n return v; // EXCEPTIONAL\\n sort(v.begin(), v.end(), xy_less);\\n vector<P> cv;\\n walk_rightside(v.begin(), v.end(), cv);\\n walk_rightside(v.rbegin(), v.rend(), cv);\\n return cv;\\n}\\n\\nint n;\\nP S, T;\\n\\ndouble dfs(P S1, P S2, vector<P> p, double l){\\n//\\tcout << \\\"(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") start\\\" << endl;\\n\\tG g, g2;\\n\\tg.push_back(S1);\\n\\tg.push_back(S2);\\n\\tg.push_back(T);\\n\\tg2.push_back(S1);\\n\\tg2.push_back(T);\\n\\tREP(i, p.size()) if(insideP(g, p[i])) g2.push_back(p[i]);\\n\\tg2 = convex_hull(g2);\\n\\tdouble sum = 0;\\n\\tif(g2.size() == 2 && abs(T-S1) < l+EPS){\\n//\\t\\tcout << \\\"3(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << abs(S2-T) << endl << endl;\\n\\t\\treturn abs(S2-T);\\n\\t}\\n\\tREP(i, g2.size()) sum += abs(g2[i]-g2[(i+1)%g2.size()]);\\n\\tif(sum - abs(T-S1) < l+EPS){\\n//\\t\\tcout << \\\"2(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << abs(S2-T) << endl << endl;\\n\\t\\treturn abs(S2-T);\\n\\t}\\n\\tdouble res = INF;\\n\\tREP(i, p.size()){\\n\\t\\tif(norm(p[i]-S2) < EPS || !insideP(g, p[i])) continue;\\n//\\t\\tcout << \\\"!\\\" << p[i] << endl;\\n\\t\\tG g, g2;\\n\\t\\tg.push_back(S1);\\n\\t\\tg.push_back(S2);\\n\\t\\tg.push_back(p[i]);\\n\\t\\tg2.push_back(S1);\\n\\t\\tg2.push_back(p[i]);\\n\\t\\tREP(j, p.size()) if(i!=j && insideP(g, p[j])) g2.push_back(p[j]);\\n\\t\\tg2 = convex_hull(g2);\\n//\\t\\tcout << g2 << endl;\\n\\t\\tdouble sum = 0;\\n\\t\\tif(g2.size() == 2 && abs(p[i]-S1) < l+EPS) chmin(res, abs(S2-p[i]) + dfs(S1, p[i], p, l));\\n\\t\\tREP(j, g2.size()) sum += abs(g2[j]-g2[(j+1)%g2.size()]);\\n\\t\\t\\n\\t\\tif(sum - abs(p[i]-S1) < l+EPS){\\n\\t\\t\\tP prev;\\n\\t\\t\\tREP(j, g2.size()) if(abs(g2[j]-p[i])<EPS) prev = g2[(j+g2.size()-1)%g2.size()];\\n//\\t\\t\\tcout << g2 << endl;\\n//\\t\\t\\tcout << \\\"prev is \\\" << prev << endl;\\n//\\t\\t\\tcout << \\\"dfs\\\" << prev << \\\",\\\" << p[i] << endl;\\n\\t\\t\\tchmin(res, abs(S2-p[i]) + dfs(prev, p[i], p, l-(sum - abs(p[i]-S1) - abs(p[i]-prev))));\\n\\t\\t}\\n\\t}\\n//\\tcout << \\\"1(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << res << endl << endl;\\n\\treturn res;\\n}\\n\\nmain(){\\n\\twhile(cin >> n, n){\\n\\t\\tvector<P> p;\\n\\t\\tcin >> S.X >> S.Y >> T.X >> T.Y;\\n\\t\\tREP(i, n){\\n\\t\\t\\tdouble x, y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tp.push_back(P(x, y));\\n\\t\\t}\\n\\t\\tif(ccw(P(0, 0), S, T) == -1){\\n\\t\\t\\tREP(i, n) p[i].Y = -p[i].Y;\\n\\t\\t\\tS.Y = -S.Y;\\n\\t\\t\\tT.Y = -T.Y;\\n\\t\\t}\\n\\t\\tdouble ret = dfs(P(0, 0), S, p, abs(S));\\n\\t\\tif(ret > 90000) puts(\\\"-1\\\");\\n\\t\\telse printf(\\\"%.9f\\\\n\\\", ret);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1376,\n \"score_of_the_acc\": -0.0516,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2404_1015887\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\\ntypedef complex<double> P;\\ntypedef vector<P> L;\\nP input() {\\n double x, y;\\n cin >> x >> y;\\n return P(x, y);\\n}\\nconst double EPS = 1e-8;\\nint sign(double x) {\\n if(x > EPS) return 1;\\n if(x < -EPS) return -1;\\n return 0;\\n}\\ndouble dot(P a, P b) {\\n return real(conj(a) * b);\\n}\\ndouble cross(P a, P b) {\\n return imag(conj(a) * b);\\n}\\nP vec(L l) {\\n return l[1] - l[0];\\n}\\nbool iLS(L l, L s) {\\n return sign(cross(vec(l), s[0] - l[0]) * cross(vec(l), s[1] - l[0])) <= 0;\\n}\\n\\nvector<P> pLL(L l, L m) {\\n double A = cross(vec(l), vec(m));\\n double B = cross(vec(l), l[1] - m[0]);\\n if(sign(A) == 0 && sign(B) == 0) return {l[0], l[1], m[0], m[1]};\\n if(sign(A) == 0) return {};\\n return {m[0] + vec(m) * B / A};\\n}\\nconst double INF = 1e10;\\nnamespace std{\\n bool operator < (const P& a, const P& b) {\\n if(a.real() != b.real()) return a.real() < b.real();\\n else return a.imag() < b.imag();\\n }\\n};\\n\\nint cnt;\\nmap< tuple<P, P, double>, double> memo;\\ndouble calc(P dog, P fix, double length, P G, const vector<P>& rod, set<P> used=set<P>()) {\\n auto t = make_tuple(dog, fix, length);\\n if(sign(abs(dog - G)) == 0) return 0;\\n if(sign(length - abs(fix - G)) < 0) return INF;\\n if(memo.count(t)) return memo[t];\\n\\n //cout << dog << \\\" \\\" << fix << endl;\\n\\n vector<P> search = rod;\\n search.push_back(G);\\n double res = INF;\\n for(P to : search) if(abs(dog - to) > EPS) {\\n L path = {dog, to};\\n vector<pair<P, P>> cand;\\n for(int i = 0; i < rod.size(); i++) {\\n if(sign(abs(rod[i] - dog)) == 0) continue;\\n L line = {fix, rod[i]};\\n if(iLS(line, path)) {\\n vector<P> cpv = pLL(line, path);\\n if(cpv.size() > 1) continue; // is it right??\\n P cp = cpv[0];\\n if(dot(rod[i] - fix, cp - fix) < 0) continue;\\n if(sign(abs(rod[i] - fix) - abs(cp - fix)) >= 0) continue;\\n cand.push_back(make_pair(cp, rod[i]));\\n }\\n }\\n\\n if(cand.empty()){\\n if(!used.count(to)) {\\n set<P> used2 = used;\\n used2.insert(to);\\n res = min(res, abs(to - dog) + calc(to, fix, length, G, rod, used2));\\n }\\n continue;\\n }\\n\\n sort(cand.begin(), cand.end(),\\n [&](pair<P, P> c1, pair<P, P> c2) {\\n P p1, r1, p2, r2;\\n tie(p1, r1) = c1;\\n tie(p2, r2) = c2;\\n int sp = sign( abs(dog - p1) - abs(dog - p2) );\\n int sr = sign( abs(fix - r1) - abs(fix - r2) );\\n return sp < 0 || (sp == 0 && sr > 0);\\n });\\n\\n P ndog, nfix;\\n tie(ndog, nfix) = cand[0];\\n double nlength = length - abs(nfix - fix);\\n //cout << \\\"p1: \\\" << dog << \\\" \\\" << fix << \\\" \\\" << length << \\\"->\\\" << \\n // ndog << \\\" \\\" << nfix << \\\" \\\" << nlength << endl;\\n res = min(res, abs(dog - ndog) + calc(ndog, nfix, nlength, G, rod, used));\\n //cout << \\\"p2: \\\" << dog << \\\" \\\" << fix << \\\" \\\" << length << \\\"->\\\" << \\n // nfix << \\\" \\\" << fix << \\\" \\\" << length << endl;\\n if(!used.count(nfix)){\\n set<P> used2 = used;\\n used2.insert(nfix);\\n res = min(res, abs(dog - nfix) + calc(nfix, fix, length, G, rod, used2));\\n }\\n }\\n return memo[t] = res;\\n}\\nint main() {\\n int n;\\n while(cin >> n && n > 0) {\\n P dog = input();\\n P goal = input();\\n P fix = {0, 0};\\n vector<P> rod(n);\\n REP(i, n) rod[i] = input();\\n memo.clear();\\n double ans = calc(dog, fix, abs(dog - fix),goal, rod);\\n if(ans >= INF) {\\n cout << -1 << endl;\\n } else {\\n printf(\\\"%.7f\\\\n\\\", ans);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1368,\n \"score_of_the_acc\": -0.0509,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2404_1014926\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <cstring>\\n#include <cstdlib>\\n#include <climits>\\n#include <ctime>\\n#include <queue>\\n#include <stack>\\n#include <algorithm>\\n#include <list>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <iostream>\\n#include <deque>\\n#include <complex>\\n#include <string>\\n#include <iomanip>\\n#include <sstream>\\n#include <bitset>\\n#include <valarray>\\n#include <iterator>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned int uint;\\ntypedef unsigned char uchar;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define REP(i,x) for(int i=0;i<(int)(x);i++)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)\\n#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)\\n#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)\\n#define ALL(container) container.begin(), container.end()\\n#define RALL(container) container.rbegin(), container.rend()\\n#define SZ(container) ((int)container.size())\\n#define mp(a,b) make_pair(a, b)\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n\\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }\\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }\\ntemplate<class T> ostream& operator<<(ostream &os, const vector<T> &t) {\\nos<<\\\"[\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"]\\\"; return os;\\n}\\ntemplate<class T> ostream& operator<<(ostream &os, const set<T> &t) {\\nos<<\\\"{\\\"; FOR(it,t) {if(it!=t.begin()) os<<\\\",\\\"; os<<*it;} os<<\\\"}\\\"; return os;\\n}\\ntemplate<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<\\\"(\\\"<<t.first<<\\\",\\\"<<t.second<<\\\")\\\";}\\n\\n#include <complex>\\n#include <cmath>\\n#define EPS 1.0e-10\\n#define INF 1.0e5\\n#define PI 3.1415926535897932384 \\n\\n// 実数の符号関数\\ninline int signum(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }\\n//XY座標\\n#define X real()\\n#define Y imag()\\n// 点\\ntypedef complex<double> P;\\n \\n\\n// 線分・半直線・直線\\nstruct L { P pos, dir; L(P p=P(), P d=P()):pos(p),dir(d){}};\\n\\n// 多角形\\ntypedef vector<P> G;\\n \\n// 円\\nstruct C { P p; double r; };\\n\\n// std::norm はabs(p)*abs(p)なので遅い\\ninline double norm(P p){\\n\\treturn p.X*p.X+p.Y*p.Y;\\n}\\n\\n// 二つのベクトルの内積を計算する\\ninline double inp(const P& a, const P& b) {\\n\\treturn (conj(a)*b).real();\\n}\\n \\n// 二つのベクトルの外積を計算する\\ninline double outp(const P& a, const P& b) {\\n\\treturn (conj(a)*b).imag();\\n}\\n\\ninline int ccw(const P& p, const P& r, const P& s) {\\n P a(r-p), b(s-p);\\n int sgn = signum(outp(a, b));\\n if (sgn != 0)\\n return sgn;\\n if (a.real()*b.real() < -EPS || a.imag()*b.imag() < -EPS)\\n return -1;\\n if (norm(a) < norm(b) - EPS)\\n return 1;\\n return 0;\\n}\\n\\nbool sp_intersects(const L& s, const P& p) {\\n return ( abs(s.pos - p) + abs(s.pos + s.dir - p) - abs(s.dir) < EPS );\\n}\\nbool insideP(G& g, const P& p) {\\n\\tif(ccw(g[0], g[1], g[2]) != 1) swap(g[1], g[2]);\\n\\tif(norm(g[0]-p) < EPS || norm(g[1]-p) < EPS || norm(g[2]-p) < EPS) return false;\\n double sum = 0.0;\\n int n = g.size();\\n if(n && g[0] == p) return false;\\n for(int i = 0; i < n; i++) {\\n int j = (i+1)%n;\\n if (sp_intersects(L(g[i], g[j]-g[i]), p))\\n return true;\\n sum += arg((g[j]-p)/(g[i]-p));\\n }\\n return (abs(sum) > 1);\\n}\\n\\nbool xy_less(const P& a, const P& b) {\\n if (abs(a.imag()-b.imag()) < EPS) return (a.real() < b.real());\\n return (a.imag() < b.imag());\\n}\\ntemplate<class IN>\\nvoid walk_rightside(IN begin, IN end, vector<P>& v) {\\n IN cur = begin;\\n v.push_back(*cur++);\\n vector<P>::size_type s = v.size();\\n v.push_back(*cur++);\\n while(cur != end) {\\n if (v.size() == s || ccw(v[v.size()-2], v.back(), *cur) > EPS)\\n v.push_back(*cur++);\\n else\\n v.pop_back();\\n }\\n v.pop_back();\\n}\\n//凸包を求める\\nvector<P> convex_hull(vector<P> v) {\\n if (v.size() <= 1)\\n return v; // EXCEPTIONAL\\n sort(v.begin(), v.end(), xy_less);\\n vector<P> cv;\\n walk_rightside(v.begin(), v.end(), cv);\\n walk_rightside(v.rbegin(), v.rend(), cv);\\n return cv;\\n}\\n\\nint n;\\nP S, T;\\n\\ndouble dfs(P S1, P S2, vector<P> p, double l){\\n//\\tcout << \\\"(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") start\\\" << endl;\\n\\tG g, g2;\\n\\tg.push_back(S1);\\n\\tg.push_back(S2);\\n\\tg.push_back(T);\\n\\tg2.push_back(S1);\\n\\tg2.push_back(T);\\n\\tREP(i, p.size()) if(insideP(g, p[i])) g2.push_back(p[i]);\\n\\tg2 = convex_hull(g2);\\n\\tdouble sum = 0;\\n\\tif(g2.size() == 2 && abs(T-S1) < l+EPS){\\n//\\t\\tcout << \\\"3(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << abs(S2-T) << endl << endl;\\n\\t\\treturn abs(S2-T);\\n\\t}\\n\\tREP(i, g2.size()) sum += abs(g2[i]-g2[(i+1)%g2.size()]);\\n\\tif(sum - abs(T-S1) < l+EPS){\\n//\\t\\tcout << \\\"2(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << abs(S2-T) << endl << endl;\\n\\t\\treturn abs(S2-T);\\n\\t}\\n\\tdouble res = INF;\\n\\tREP(i, p.size()){\\n\\t\\tif(norm(p[i]-S2) < EPS || !insideP(g, p[i])) continue;\\n//\\t\\tcout << \\\"!\\\" << p[i] << endl;\\n\\t\\tG g, g2;\\n\\t\\tg.push_back(S1);\\n\\t\\tg.push_back(S2);\\n\\t\\tg.push_back(p[i]);\\n\\t\\tg2.push_back(S1);\\n\\t\\tg2.push_back(p[i]);\\n\\t\\tREP(j, p.size()) if(i!=j && insideP(g, p[j])) g2.push_back(p[j]);\\n\\t\\tg2 = convex_hull(g2);\\n//\\t\\tcout << g2 << endl;\\n\\t\\tdouble sum = 0;\\n\\t\\tif(g2.size() == 2 && abs(p[i]-S1) < l+EPS) chmin(res, abs(S2-p[i]) + dfs(S1, p[i], p, l));\\n\\t\\tREP(j, g2.size()) sum += abs(g2[j]-g2[(j+1)%g2.size()]);\\n\\t\\t\\n\\t\\tif(sum - abs(p[i]-S1) < l+EPS){\\n\\t\\t\\tP prev;\\n\\t\\t\\tREP(j, g2.size()) if(abs(g2[j]-p[i])<EPS) prev = g2[(j+g2.size()-1)%g2.size()];\\n//\\t\\t\\tcout << g2 << endl;\\n//\\t\\t\\tcout << \\\"prev is \\\" << prev << endl;\\n//\\t\\t\\tcout << \\\"dfs\\\" << prev << \\\",\\\" << p[i] << endl;\\n\\t\\t\\tchmin(res, abs(S2-p[i]) + dfs(prev, p[i], p, l-(sum - abs(p[i]-S1) - abs(p[i]-prev))));\\n\\t\\t}\\n\\t}\\n//\\tcout << \\\"1(\\\" << S1 << \\\", \\\" << S2 << \\\", \\\" << l << \\\") = \\\" << res << endl << endl;\\n\\treturn res;\\n}\\n\\nmain(){\\n\\twhile(cin >> n, n){\\n\\t\\tvector<P> p;\\n\\t\\tcin >> S.X >> S.Y >> T.X >> T.Y;\\n\\t\\tREP(i, n){\\n\\t\\t\\tdouble x, y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tp.push_back(P(x, y));\\n\\t\\t}\\n\\t\\tif(ccw(P(0, 0), S, T) == -1){\\n\\t\\t\\tREP(i, n) p[i].Y = -p[i].Y;\\n\\t\\t\\tS.Y = -S.Y;\\n\\t\\t\\tT.Y = -T.Y;\\n\\t\\t}\\n\\t\\tdouble ret = dfs(P(0, 0), S, p, abs(S));\\n\\t\\tif(ret > 90000) puts(\\\"-1\\\");\\n\\t\\telse printf(\\\"%.9f\\\\n\\\", ret);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1376,\n \"score_of_the_acc\": -0.0516,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2404_584569\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#include <cmath>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\ntypedef const P &rP;\\n\\n#define EPS 1e-7\\n\\ndouble ans;\\nvector<P> pnts;\\n\\ndouble dot(rP va, rP vb){\\n\\treturn real(va) * real(vb) + imag(va) * imag(vb);\\n}\\n\\ndouble cross(rP a, rP b){\\n\\treturn real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\ndouble distance_ls_p(rP a, rP b, rP c){\\n\\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\\n\\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\\n\\treturn abs(cross(b - a, c - a)) / abs(b - a);\\n}\\n\\nbool contains(const vector<P> &plg, rP pt){\\n\\tint cnt = 0;\\n\\tdouble y = imag(pt);\\n\\n\\tfor(int i = 0; i < plg.size(); ++i){\\n\\t\\tint j = (i + 1 == plg.size() ? 0: i + 1);\\n\\n\\t\\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tdouble dyi = imag(plg[i]) - y;\\n\\t\\tdouble dyj = y - imag(plg[j]);\\n\\t\\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\\n\\n\\t\\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t\\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t}\\n\\n\\treturn (cnt % 2 != 0);\\n}\\n\\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\\n\\tP da12 = pa2 - pa1;\\n\\tP db21 = pb1 - pb2;\\n\\tP dab1 = pb1 - pa1;\\n\\tdouble D = cross(da12, db21);\\n\\tdouble t = cross(dab1, db21) / D;\\n\\treturn pa1 + t * da12;\\n}\\n\\n\\nvoid dfs(int now, rP prev, int S, double len, double sum){\\n\\tif(now == 1){\\n\\t\\tans = min(ans, sum);\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<P> tri(3);\\n\\n\\tfor(int i = 1; i < pnts.size(); ++i){\\n\\t\\tif(S >> i & 1){ continue; }\\n\\t\\tif(abs(cross(pnts[now], pnts[i])) < EPS){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tint T = S | 1 << i;\\n\\t\\tdouble nl = len;\\n\\t\\tP base = prev;\\n\\t\\tP pos = pnts[now];\\n\\n\\t\\twhile(1){\\n\\t\\t\\tint idx = -1;\\n\\t\\t\\tdouble minarg = 9.9;\\n\\t\\t\\tdouble maxnorm = -1.0;\\n\\n\\t\\t\\ttri[0] = base;\\n\\t\\t\\ttri[1] = pos;\\n\\t\\t\\ttri[2] = pnts[i];\\n\\t\\t\\tfor(int j = 2; j < pnts.size(); ++j){\\n\\t\\t\\t\\tif(!contains(tri, pnts[j])){\\n\\t\\t\\t\\t\\tbool cntn = false;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 3; ++k){\\n\\t\\t\\t\\t\\t\\tif(norm(pnts[j] - tri[k]) < EPS){\\n\\t\\t\\t\\t\\t\\t\\tcntn = true;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(cntn){\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tdouble d1 = abs(pnts[j] - base), d2 = abs(pnts[j] - pnts[i]);\\n\\t\\t\\t\\t\\tdouble d3 = abs(pnts[i] - base);\\n\\t\\t\\t\\t\\tif(abs(d1 + d2 - d3) > EPS){\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\\n\\t\\t\\t\\tdouble nm = norm(pnts[j] - base);\\n\\t\\t\\t\\tif(a + EPS < minarg){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(abs(a - minarg) < EPS && maxnorm < nm){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(idx == -1) break;\\n\\n\\t\\t\\tpos = intersect(pos, pnts[i], base, pnts[idx]);\\n\\t\\t\\tnl -= abs(pnts[idx] - base);\\n\\t\\t\\tbase = pnts[idx];\\n\\t\\t\\tT |= 1 << idx;\\n\\t\\t}\\n\\n\\t\\tif(nl > abs(pnts[1] - base) - EPS){\\n\\t\\t\\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tint n, x, y;\\n\\twhile(scanf(\\\"%d\\\", &n), n){\\n\\t\\tpnts.resize(n + 2);\\n\\t\\tfor(int i = 0; i < n + 2; ++i){\\n\\t\\t\\tscanf(\\\"%d%d\\\", &x, &y);\\n\\t\\t\\tpnts[i] = P(x, y);\\n\\t\\t}\\n\\n\\t\\tif(norm(pnts[0]) < norm(pnts[1])){\\n\\t\\t\\tputs(\\\"-1\\\");\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tans = abs(pnts[0]) + abs(pnts[1]);\\n\\t\\t\\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\\n\\t\\t\\tprintf(\\\"%f\\\\n\\\", ans);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 1172,\n \"score_of_the_acc\": -0.0933,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2404_584550\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#include <cmath>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\ntypedef const P &rP;\\n\\n#define EPS 1e-7\\n\\ndouble ans;\\nvector<P> pnts;\\n\\ndouble dot(rP va, rP vb){\\n\\treturn real(va) * real(vb) + imag(va) * imag(vb);\\n}\\n\\ndouble cross(rP a, rP b){\\n\\treturn real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\ndouble distance_ls_p(rP a, rP b, rP c){\\n\\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\\n\\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\\n\\treturn abs(cross(b - a, c - a)) / abs(b - a);\\n}\\n\\nbool contains(const vector<P> &plg, rP pt){\\n\\tint cnt = 0;\\n\\tdouble y = imag(pt);\\n\\n\\tfor(int i = 0; i < plg.size(); ++i){\\n\\t\\tint j = (i + 1 == plg.size() ? 0: i + 1);\\n\\n\\t\\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t\\tdouble dyi = imag(plg[i]) - y;\\n\\t\\tdouble dyj = y - imag(plg[j]);\\n\\t\\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\\n\\n\\t\\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t\\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t}\\n\\n\\treturn (cnt % 2 != 0);\\n}\\n\\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\\n\\tP da12 = pa2 - pa1;\\n\\tP db21 = pb1 - pb2;\\n\\tP dab1 = pb1 - pa1;\\n\\tdouble D = cross(da12, db21);\\n\\tdouble t = cross(dab1, db21) / D;\\n\\treturn pa1 + t * da12;\\n}\\n\\n\\nvoid dfs(int now, rP prev, int S, double len, double sum){\\n\\tif(now == 1){\\n\\t\\tans = min(ans, sum);\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<P> tri(3);\\n\\n\\tfor(int i = 1; i < pnts.size(); ++i){\\n\\t\\tif(S >> i & 1){ continue; }\\n\\t\\tif(abs(cross(pnts[now], pnts[i])) < EPS){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tint T = S | 1 << i;\\n\\t\\tdouble nl = len;\\n\\t\\tP base = prev;\\n\\t\\tP pos = pnts[now];\\n\\n\\t\\twhile(1){\\n\\t\\t\\tint idx = -1;\\n\\t\\t\\tdouble minarg = 9.9;\\n\\t\\t\\tdouble maxnorm = -1.0;\\n\\n\\t\\t\\ttri[0] = base;\\n\\t\\t\\ttri[1] = pos;\\n\\t\\t\\ttri[2] = pnts[i];\\n\\t\\t\\tfor(int j = 2; j < pnts.size(); ++j){\\n\\t\\t\\t\\tif(!contains(tri, pnts[j])){\\n\\t\\t\\t\\t\\tbool cntn = false;\\n\\t\\t\\t\\t\\tfor(int k = 0; k < 3; ++k){\\n\\t\\t\\t\\t\\t\\tif(norm(pnts[j] - tri[k]) < EPS){\\n\\t\\t\\t\\t\\t\\t\\tcntn = true;\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(cntn){\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tdouble d1 = abs(pnts[j] - base), d2 = abs(pnts[j] - pnts[i]);\\n\\t\\t\\t\\t\\tdouble d3 = abs(pnts[i] - base);\\n\\t\\t\\t\\t\\tif(abs(d1 + d2 - d3) > EPS){\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\\n\\t\\t\\t\\tdouble nm = norm(pnts[j] - base);\\n\\t\\t\\t\\tif(a + EPS < minarg){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(abs(a - minarg) < EPS && maxnorm < nm){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(idx == -1) break;\\n\\n\\t\\t\\tpos = intersect(pos, pnts[i], base, pnts[idx]);\\n\\t\\t\\tnl -= abs(pnts[idx] - base);\\n\\t\\t\\tbase = pnts[idx];\\n\\t\\t\\tT |= idx;\\n\\t\\t}\\n\\n\\t\\tif(nl > abs(pnts[1] - base) - EPS){\\n\\t\\t\\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tint n, x, y;\\n\\twhile(scanf(\\\"%d\\\", &n), n){\\n\\t\\tpnts.resize(n + 2);\\n\\t\\tfor(int i = 0; i < n + 2; ++i){\\n\\t\\t\\tscanf(\\\"%d%d\\\", &x, &y);\\n\\t\\t\\tpnts[i] = P(x, y);\\n\\t\\t}\\n\\n\\t\\tif(norm(pnts[0]) < norm(pnts[1])){\\n\\t\\t\\tputs(\\\"-1\\\");\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tans = abs(pnts[0]) + abs(pnts[1]);\\n\\t\\t\\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\\n\\t\\t\\tprintf(\\\"%f\\\\n\\\", ans);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 410,\n \"memory_kb\": 1172,\n \"score_of_the_acc\": -0.0933,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2404_584543\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#include <cmath>\\nusing namespace std;\\n\\ntypedef complex<double> P;\\ntypedef const P &rP;\\n\\n#define EPS 1e-7\\n\\ndouble ans;\\nvector<P> pnts;\\n\\ndouble dot(rP va, rP vb){\\n\\treturn real(va) * real(vb) + imag(va) * imag(vb);\\n}\\n\\ndouble cross(rP a, rP b){\\n\\treturn real(a) * imag(b) - imag(a) * real(b);\\n}\\n\\ndouble distance_ls_p(rP a, rP b, rP c){\\n\\tif( dot(b - a, c - a) <= 0.0 ) return abs(c - a);\\n\\tif( dot(a - b, c - b) <= 0.0 ) return abs(c - b);\\n\\treturn abs(cross(b - a, c - a)) / abs(b - a);\\n}\\n\\nbool contains_tri(const vector<P> &plg, rP pt){\\n\\tint cnt = 0;\\n\\tdouble y = imag(pt);\\n\\n\\tfor(int i = 0; i < 3; ++i){\\n\\t\\tint j = (i == 2 ? 0: i + 1);\\n\\n\\t\\tif( distance_ls_p(plg[i], plg[j], pt) < EPS ){\\n\\t\\t\\treturn (i == 2);\\n\\t\\t}\\n\\n\\t\\tdouble dyi = imag(plg[i]) - y;\\n\\t\\tdouble dyj = y - imag(plg[j]);\\n\\t\\tdouble tx = (dyi * real(plg[j]) + dyj * real(plg[i])) / (dyi + dyj);\\n\\n\\t\\tif(imag(plg[i]) >= y && imag(plg[j]) < y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t\\telse if(imag(plg[i]) < y && imag(plg[j]) >= y){\\n\\t\\t\\tif( tx < real(pt) ) ++cnt;\\n\\t\\t}\\n\\t}\\n\\n\\treturn (cnt % 2 != 0);\\n}\\n\\nP intersect(rP pa1, rP pa2, rP pb1, rP pb2){\\n\\tP da12 = pa2 - pa1;\\n\\tP db21 = pb1 - pb2;\\n\\tP dab1 = pb1 - pa1;\\n\\tdouble D = cross(da12, db21);\\n\\tdouble t = cross(dab1, db21) / D;\\n\\treturn pa1 + t * da12;\\n}\\n\\n\\nvoid dfs(int now, rP prev, int S, double len, double sum){\\n\\tif(now == 1){\\n\\t\\tans = min(ans, sum);\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<P> tri(3);\\n\\n\\tfor(int i = 1; i < pnts.size(); ++i){\\n\\t\\tif(S >> i & 1){ continue; }\\n\\t\\tif(abs(cross(pnts[now], pnts[i])) < EPS){\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tint T = S | 1 << i;\\n\\t\\tdouble nl = len;\\n\\t\\tP base = prev;\\n\\t\\tP pos = pnts[now];\\n\\n\\t\\twhile(1){\\n\\t\\t\\tint idx = -1;\\n\\t\\t\\tdouble minarg = 9.9;\\n\\t\\t\\tdouble maxnorm = -1.0;\\n\\n\\t\\t\\ttri[0] = base;\\n\\t\\t\\ttri[1] = pos;\\n\\t\\t\\ttri[2] = pnts[i];\\n\\t\\t\\tfor(int j = 2; j < pnts.size(); ++j){\\n\\t\\t\\t\\tif(!contains_tri(tri, pnts[j])){ continue; }\\n\\t\\t\\t\\tdouble a = abs(arg((pnts[j] - base) / (pos - base)));\\n\\t\\t\\t\\tdouble nm = norm(pnts[j] - base);\\n\\t\\t\\t\\tif(a + EPS < minarg){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(abs(a - minarg) < EPS && maxnorm < nm){\\n\\t\\t\\t\\t\\tminarg = a;\\n\\t\\t\\t\\t\\tmaxnorm = nm;\\n\\t\\t\\t\\t\\tidx = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(idx == -1) break;\\n\\n\\t\\t\\tpos = intersect(pos, pnts[i], base, pnts[idx]);\\n\\t\\t\\tnl -= abs(pnts[idx] - base);\\n\\t\\t\\tbase = pnts[idx];\\n\\t\\t\\tT |= idx;\\n\\t\\t}\\n\\n\\t\\tif(nl > abs(pnts[1] - base) - EPS){\\n\\t\\t\\tdfs(i, base, T, nl, sum + abs(pnts[now] - pnts[i]));\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tint n, x, y;\\n\\twhile(scanf(\\\"%d\\\", &n), n){\\n\\t\\tpnts.resize(n + 2);\\n\\t\\tfor(int i = 0; i < n + 2; ++i){\\n\\t\\t\\tscanf(\\\"%d%d\\\", &x, &y);\\n\\t\\t\\tpnts[i] = P(x, y);\\n\\t\\t}\\n\\n\\t\\tif(norm(pnts[0]) < norm(pnts[1])){\\n\\t\\t\\tputs(\\\"-1\\\");\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tans = abs(pnts[0]) + abs(pnts[1]);\\n\\t\\t\\tdfs(0, P(), 1, abs(pnts[0]), 0.0);\\n\\t\\t\\tprintf(\\\"%f\\\\n\\\", ans);\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 220,\n \"memory_kb\": 1172,\n \"score_of_the_acc\": -0.0637,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2404_564437\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<math.h>\\n#include<vector>\\n#include<string.h>\\n\\nint n;\\nint xs[10],ys[10];\\nint fx,fy;\\ndouble ans,maxLen;\\n\\nstd::vector<int> getInDeltaPoints(int bx,int by,int dx,int dy,int nx,int ny){\\n\\tstd::vector<int> re;\\n\\tint vxs[3],vys[3],dxs[3],dys[3];\\n\\tvxs[0]=dx-bx;\\n\\tvys[0]=dy-by;\\n\\tvxs[1]=nx-dx;\\n\\tvys[1]=ny-dy;\\n\\tvxs[2]=bx-nx;\\n\\tvys[2]=by-ny;\\n\\t\\n\\tfor(int i=0;i<=n;i++){\\n\\t\\tint p=0,m=0,zero=0;\\n\\t\\tdxs[0]=xs[i]-bx;\\n\\t\\tdys[0]=ys[i]-by;\\n\\t\\tdxs[1]=xs[i]-dx;\\n\\t\\tdys[1]=ys[i]-dy;\\n\\t\\tdxs[2]=xs[i]-nx;\\n\\t\\tdys[2]=ys[i]-ny;\\n\\t\\tfor(int j=0;j<3;j++){\\n\\t\\t\\tif(dxs[j]==0&&dys[j]==0)continue;\\n\\t\\t\\tint g=vxs[j]*dys[j]-dxs[j]*vys[j];\\n\\t\\t\\tif(g==0){\\n\\t\\t\\t\\tzero++;\\n\\t\\t\\t}else if(g<0){\\n\\t\\t\\t\\tm++;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tp++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(p==3||m==3)re.push_back(i);\\n\\t\\tif(zero==1&&(p==2||m==2))re.push_back(i);\\n\\t}\\n\\treturn re;\\n}\\n\\nvoid saiki(int bx,int by,int dx,int dy,int spents[10],double RopeLen,double moveLen);\\n\\nvoid saiki2(int bx,int by,int dx,int dy,int gx,int gy,std::vector<int>& perm,int spents[10],double RopeLen,double moveLen){\\n\\tif(RopeLen>maxLen)return;\\n\\tif(ans!=-1&&ans<moveLen)return ;\\n\\tif(getInDeltaPoints(bx,by,dx,dy,gx,gy).empty()==true){\\n\\t\\tdouble lastAdd=sqrt((bx-gx)*(bx-gx)+(by-gy)*(by-gy));\\n\\t\\tif(RopeLen+lastAdd>maxLen)return;\\n\\t\\tmoveLen+=sqrt((dx-gx)*(dx-gx)+(dy-gy)*(dy-gy));\\n\\t\\tif(gx==fx&&gy==fy){\\n\\t\\t\\tif(ans==-1||ans>moveLen)ans=moveLen;\\n\\t\\t}else{\\n\\t\\t\\tsaiki(bx,by,gx,gy,spents,RopeLen,moveLen);\\n\\t\\t}\\n\\t\\treturn ;\\n\\t}\\n\\tfor(unsigned int i=0;i<perm.size();i++){\\n\\t\\tint no=perm[i];\\n\\t\\tif(spents[no]==0&&getInDeltaPoints(bx,by,dx,dy,xs[no],ys[no]).empty()==true){\\n\\t\\t\\tspents[no]=1;\\n\\t\\t\\tdouble t=sqrt((bx-xs[no])*(bx-xs[no])+(by-ys[no])*(by-ys[no]));\\n\\t\\t\\tsaiki2(xs[no],ys[no],dx,dy,gx,gy,perm,spents,RopeLen+t,moveLen);\\n\\t\\t\\tspents[no]=0;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid saiki(int bx,int by,int dx,int dy,int spents[10],double RopeLen,double moveLen){\\n\\tstd::vector<int> perm=getInDeltaPoints(bx,by,dx,dy,fx,fy);\\n\\tsaiki2(bx,by,dx,dy,fx,fy,perm,spents,RopeLen,moveLen);\\n\\tfor(int i=0;i<=n;i++){\\n\\t\\tif(spents[i]==0){\\n\\t\\t\\tspents[i]=1;\\n\\t\\t\\tperm=getInDeltaPoints(bx,by,dx,dy,xs[i],ys[i]);\\n\\t\\t\\tsaiki2(bx,by,dx,dy,xs[i],ys[i],perm,spents,RopeLen,moveLen);\\n\\t\\t\\tspents[i]=0;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc(){\\n\\tint dx,dy;\\n\\tscanf(\\\"%d %d %d %d\\\",&dx,&dy,&fx,&fy);\\n\\tfor(int i=0;i<n;i++)scanf(\\\"%d %d\\\",&xs[i],&ys[i]);\\n\\txs[n]=0;\\n\\tys[n]=0;\\n\\tint spents[10]={0};\\n\\tans=-1;\\n\\tmaxLen=sqrt(dx*dx+dy*dy);\\n\\tsaiki(0,0,dx,dy,spents,0,0);\\n\\tif(ans==-1){\\n\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t}else{\\n\\t\\tprintf(\\\"%.7lf\\\\n\\\",ans);\\n\\t}\\n}\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tscanf(\\\"%d\\\",&n);\\n\\t\\tif(n==0)break;\\n\\t\\tcalc();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1096,\n \"score_of_the_acc\": -0.0317,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2404_443508\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <cassert>\\n#include <algorithm>\\nusing namespace std;\\n\\ntypedef complex<double> point;\\n\\nstruct line : public vector<point> {\\n\\tline(const point& a, const point& b) { push_back(a); push_back(b); }\\n};\\n\\nconst double pi = M_PI;\\nconst double inf = 1e10;\\nconst double eps = 1e-10;\\npoint unit (const point& v) { return v/abs(v); }\\npoint ortho(const point& v) { return v*point(0,1); }\\npoint vec (const line& l) { return l[1]-l[0]; }\\nbool equal(const double a, const double b) { return abs(a-b)<eps; }\\nbool equal(const point& a, const point& b) { return abs(a-b)<eps; }\\ndouble dot (const point& a, const point& b) { return (a*conj(b)).real(); }\\ndouble cross(const point& a, const point& b) { return (conj(a)*b).imag(); }\\n\\nint ccw(const point& a, const point& b, const point& c) {\\n\\tpoint u=b-a, v=c-a;\\n\\tif(cross(u,v) > 0 ) return +1; // ccw\\n\\tif(cross(u,v) < 0 ) return -1; // cw\\n\\tif( dot(u,v) < 0 ) return +2; // cab\\n\\tif(abs(u) < abs(v)) return -2; // abc\\n\\treturn 0; // acb\\n}\\n\\nint ccw(const line& s, const point& p) {\\n\\treturn ccw(s[0], s[1], p);\\n}\\n\\npoint crosspoint(const line& l, const line& m) {\\n\\tdouble A = cross(vec(l), vec(m));\\n\\tdouble B = cross(vec(l), l[1]-m[0]);\\n\\tif(abs(A)<eps) {\\t\\t\\t// parallel\\n\\t\\tassert(abs(B)<eps);\\n\\t\\treturn m[1];\\t\\t\\t// sameline\\n\\t}\\n\\treturn m[0] + B/A*vec(m);\\n}\\n\\nbool contain(const point& a, const point& b, const point& c, const point& p) {\\n\\treturn (ccw(a,b,p)!=-1 && ccw(b,c,p)!=-1 && ccw(c,a,p)!=-1)\\n\\t || (ccw(a,b,p)!=+1 && ccw(b,c,p)!=+1 && ccw(c,a,p)!=+1);\\n}\\n\\nint N;\\npoint pile[8],dog,food;\\n\\npair<double,point> check(point base, point curr, point dest, double rest) {\\n\\t//cout << base << curr << dest << rest << endl;\\n\\tint mi=-1;\\n\\tdouble md=0,ma=inf;\\n\\tfor(int i=0; i<N; i++) {\\n\\t\\tif(equal(pile[i],base)) continue;\\n\\t\\tif(equal(pile[i],curr)) continue;\\n\\t\\tif(equal(pile[i],dest)) continue;\\n\\t\\tif(equal(base,curr)) continue;\\n\\t\\tif(equal(curr,dest)) continue;\\n\\t\\tif(equal(dest,base)) continue;\\n\\t\\tif(!contain(base,curr,dest,pile[i])) continue;\\n\\t\\tdouble d = abs(pile[i]-base);\\n\\t\\tdouble a = abs(arg(curr-base)-arg(pile[i]-base));\\n\\t\\tif(equal(a,ma)) {\\n\\t\\t\\tif(md<d) { mi=i; md=d; ma=a; }\\n\\t\\t}\\n\\t\\telse if(a<ma) {\\n\\t\\t\\tmi=i; md=d; ma=a;\\n\\t\\t}\\n\\t}\\n\\n\\tif(mi<0) return make_pair(rest,base);\\n\\n\\tline l(base, pile[mi]);\\n\\tline m(curr, dest);\\n\\tcurr = crosspoint(l,m);\\n\\treturn check(pile[mi], curr, dest, rest-abs(pile[mi]-base));;\\n}\\n\\ndouble solve(int use, point base, point curr, double rest, double dist) {\\n\\tpair<double,point> ret = check(base,curr,food,rest);\\n\\tif(ret.first >= abs(ret.second-food)) return dist + abs(food-curr);\\n\\tdouble ans=inf;\\n\\tfor(int i=0; i<N; i++) {\\n\\t\\tif(use&(1<<i)) continue;\\n\\t\\tret = check(base,curr,pile[i],rest);\\n\\t\\tif(ret.first < 0) continue;\\n\\t\\tans=min(ans,solve(use|(1<<i), ret.second, pile[i], ret.first, dist+abs(pile[i]-curr)));\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main()\\n{\\n\\twhile(cin>>N, N)\\n\\t{\\n\\t\\tcin >> dog.real() >> dog.imag();\\n\\t\\tcin >> food.real() >> food.imag();\\n\\t\\tfor(int i=0; i<N; i++) {\\n\\t\\t\\tcin >> pile[i].real() >> pile[i].imag();\\n\\t\\t}\\n\\t\\tcout.setf(ios::fixed); cout.precision(10);\\n\\t\\tdouble ans = solve(0, 0, dog, abs(dog), 0);\\n\\t\\tif(ans==inf) cout << \\\"-1\\\" << endl;\\n\\t\\telse cout << ans << endl;\\n\\t}\\t\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3670,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.5876,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2404_434257\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <cstdio>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <valarray>\\n#include <bitset>\\n#include <stack>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int INF = 1<<29;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8;\\n\\ntypedef complex<double> P;\\nnamespace std {\\n bool operator < (const P& a, const P& b) {\\n // if (abs(a-b)<EPS) return 0;\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n }\\n}\\ndouble cross(const P& a, const P& b) {\\n return imag(conj(a)*b);\\n}\\ndouble dot(const P& a, const P& b) {\\n return real(conj(a)*b);\\n}\\nstruct L : public vector<P> {\\n L(const P &a, const P &b) {\\n push_back(a); push_back(b);\\n }\\n L() {}\\n};\\nint ccw(P a, P b, P c) {\\n b -= a; c -= a;\\n if (cross(b, c) > 0) return +1; // counter clockwise\\n if (cross(b, c) < 0) return -1; // clockwise\\n if (dot(b, c) < 0) return +2; // c--a--b on line\\n if (norm(b) < norm(c)) return -2; // a--b--c on line\\n return 0;\\n}\\ntypedef vector<P> G;\\n#define curr(P, i) P[i]\\n#define next(P, i) P[(i+1)%P.size()]\\n// 点-凸多角形包含関係\\nbool convex_contain(const G &g, const P &p) { // 半時計回りを仮定\\n REP(i,g.size())\\n if (ccw(g[i], next(g, i), p) == -1) return 0;\\n return 1;\\n}\\n// 角度関連\\ndouble angle(const P &a, const P &b) { // ベクトルａからみたベクトルｂの角度の計算[0,2pi]\\n double ret = arg(b)-arg(a);\\n return (ret>=0) ? ret : ret + 2*PI;\\n}\\ndouble angle2(const P &a, const P &b) { // ベクトルaとベクトルbの間の角度\\n return min(angle(a,b), angle(b,a));\\n}\\nP rotate(P p, double ang) {\\n return p * P(cos(ang), sin(ang));\\n}\\n\\n\\nP p[10];\\nP dog;\\nint n;\\n\\ntypedef pair<double,double> pdd;\\n// centerに繋がれているとき、dからp[nxt]まで行くために巻きつく紐と総移動距離\\npdd func(int ¢er, const P &d, int nxt) {\\n //cout << \\\"func(\\\" << p[center] << \\\", \\\" << d << \\\", \\\" << p[nxt] << \\\")\\\" << endl;\\n L l(d, p[nxt]);\\n int cw = ccw(p[center], d, p[nxt]);\\n if (abs(cw) != 1) { // ikeru\\n return pdd(0, abs(p[nxt]-d));\\n }\\n G g(3);\\n g[0] = p[center];\\n g[1] = d;\\n g[2] = p[nxt];\\n if (cw == -1) swap(g[1],g[2]);\\n double minang = INF;\\n int id = -1;\\n REP(i,n+1) {\\n if (convex_contain(g, p[i])) {\\n if (i == nxt || i == center || abs(p[i]-d) < EPS) continue;\\n double ang = angle2(d-p[center], p[i]-p[center]);\\n if (minang > ang){\\n minang = ang;\\n id = i;\\n }\\n }\\n }\\n if (id == -1) {\\n // ikeru\\n return pdd(0, abs(p[nxt]-d));\\n }\\n pdd res = pdd(abs(p[id]-p[center]), 0);\\n center = id;\\n pdd ret = func(center, d, nxt);\\n return pdd(res.first + ret.first, res.second + ret.second);\\n}\\n\\ndouble ans;\\n\\ndouble simulate(vector<int> v) {\\n double sum = 0;\\n int center = n;\\n P now = dog;\\n double res = 0;\\n v.push_back(9);\\n REP(i,v.size()) {\\n pdd ret = func(center, now, v[i]);\\n sum += ret.first;\\n res += ret.second;\\n // cout << sum << \\\" \\\" << res << endl;\\n now = p[v[i]];\\n if (sum+abs(p[center]-p[9]) > abs(dog) + EPS) return INF;\\n if (res > ans) return INF;\\n }\\n sum += abs(p[center] - now);\\n // FOR(it, v) cout << *it << \\\" \\\";cout << endl;\\n // cout << sum << \\\", \\\" << res << endl;\\n if (sum > abs(dog)+EPS) return INF;\\n // if (res < 220) {\\n // FOR(it, v) cout << *it << \\\" \\\"; cout << endl;\\n // cout << p[center] << \\\" \\\" << now << endl;\\n // cout << sum << \\\" \\\" << res << endl;\\n // }\\n else return res;\\n}\\n\\nvector<int> v;\\nvoid solve(int S) {\\n ans = min(ans, simulate(v));\\n if (S==(1<<n)-1) return;\\n REP(i,n) {\\n if (!(S>>i&1)) {\\n v.push_back(i);\\n solve(S|1<<i);\\n v.pop_back();\\n }\\n }\\n}\\n\\nint main() {\\n while(cin>>n,n) {\\n cin >> dog.real() >> dog.imag();\\n cin >> p[9].real() >> p[9].imag();\\n REP(i,n) cin >> p[i].real() >> p[i].imag();\\n p[n] = P(0,0);\\n // vector<int> v(2);v[0]=0;v[1]=5;\\n // simulate(v);return 0;\\n ans = simulate(vector<int>(1,n));\\n solve(0);\\n if (ans >= INF-EPS) {\\n cout << -1 << endl;\\n } else {\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6440,\n \"memory_kb\": 1032,\n \"score_of_the_acc\": -1.0195,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2404_433066\",\n \"code_snippet\": \"#include<cmath>\\n#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double EPS=1e-7;\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\ntemplate<class T>\\nstruct point{\\n\\tT x,y;\\n\\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; }\\n\\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; }\\n\\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\\n\\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\\n};\\n\\ntemplate<class T>\\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\\n\\nbool operator==(const point<double> &a,const point<double> &b){\\n\\treturn abs(a.x-b.x)<EPS && abs(a.y-b.y)<EPS;\\n}\\nbool operator!=(const point<double> &a,const point<double> &b){\\n\\treturn abs(a.x-b.x)>EPS || abs(a.y-b.y)>EPS;\\n}\\n\\ntemplate<class T>\\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\\n\\ntemplate<class T>\\ndouble arg(const point<T> &a){\\n\\tdouble t=atan2(a.y,a.x);\\n\\treturn t<0?t+2*PI:t;\\n}\\n\\ntemplate<class T>\\nstruct line{\\n\\tpoint<T> a,b;\\n\\toperator line<double>()const{ return (line<double>){a,b}; }\\n};\\n\\nenum {CCW=1,CW=-1,ON=0};\\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\\n\\tdouble rdir=cross(b-a,c-a);\\n\\tif(rdir> EPS) return CCW;\\n\\tif(rdir<-EPS) return CW;\\n\\treturn ON;\\n}\\n\\ntemplate<class T>\\ndouble dist(const point<T> &a,const point<T> &b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\\n}\\n\\ntemplate<class T>\\nbool cover(const point<T> &a,const point<T> &b,const point<T> &c,const point<T> &p){\\n\\tint d1=ccw(p,a,b);\\n\\tint d2=ccw(p,b,c);\\n\\tint d3=ccw(p,c,a);\\n\\treturn !(d1==CCW && d2== CW || d1==CCW && d3== CW || d2==CCW && d3== CW\\n\\t\\t || d1== CW && d2==CCW || d1== CW && d3==CCW || d2== CW && d3==CCW);\\n}\\n\\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\\n\\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\\n\\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\\n\\tif(abs(a1)<EPS) return L1.a;\\n\\treturn L2.a+a2/a1*(L2.b-L2.a);\\n}\\n\\nint n;\\npoint<double> p[9]; // ツ杭, ツつスツつセツつオ p[n] ツづ債ゴツーツδ?\\n\\nbool vis[9];\\ndouble dfs(point<double> D,point<double> O,double r){ // ツ個「ツづ個暗環置, ツ嘉アツ転ツ陳?心, ツ紐ツづ個陳キツつウ\\n\\tif(D==p[n]) return 0;\\n\\n\\tif(r+EPS<dist(O,p[n])) return INF;\\n\\n\\tdouble res=INF;\\n\\trep(i,n+1) if(!vis[i]) {\\n\\t\\t// D ツつゥツづァ P ツづ可古シツつゥツづ?づ?づ慊づ?つキツつョツ進ツづ?\\n\\t\\tpoint<double> P=p[i];\\n\\t\\tdouble t0=arg(D-O);\\n\\n\\t\\tint j0=-1; // ツづ債つカツづ淞づ可づ板づつつゥツづゥツ杭ツづーツ個ゥツづつつッツづゥ\\n\\t\\trep(j,n) if(p[j]!=O && p[j]!=P && p[j]!=D) {\\n\\t\\t\\tif(cover(O,D,P,p[j])){ // ツ三ツ角ツ形 ODP ツづ個陳?づ可杭 j ツつェツつ?づゥツづ?つォ\\n\\t\\t\\t\\tif(j0==-1) j0=j;\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tdouble t1=arg(p[j0]-O)-t0; t1=min(abs(t1),abs(2*PI-t1));\\n\\t\\t\\t\\t\\tdouble t2=arg(p[j ]-O)-t0; t2=min(abs(t2),abs(2*PI-t2));\\n\\t\\t\\t\\t\\tif(t2+EPS<t1 || abs(t1-t2)<EPS && dist(p[j0],O)<dist(p[j],O)){\\n\\t\\t\\t\\t\\t\\tj0=j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(j0==-1){ // ツづ?づ個杭ツづ可づ?づ板づつつゥツづァツづ按つ「\\n\\t\\t\\tdouble d=dist(O,P);\\n\\t\\t\\tif(d<r+EPS){\\n\\t\\t\\t\\tvis[i]=true;\\n\\t\\t\\t\\tres=min(res,dist(D,P)+dfs(P,O,r));\\n\\t\\t\\t\\tvis[i]=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse{ // ツ杭 j0 ツづ可づ板づつつゥツづゥ\\n\\t\\t\\tpoint<double> Q=get_intersect((line<double>){D,P},(line<double>){O,p[j0]});\\n\\t\\t\\tdouble d=dist(O,Q);\\n\\t\\t\\tif(d<r+EPS){\\n\\t\\t\\t\\tres=min(res,dist(D,Q)+dfs(Q,p[j0],r-dist(O,p[j0])));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tfor(;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tpoint<double> D; // dog\\n\\t\\tscanf(\\\"%lf%lf%lf%lf\\\",&D.x,&D.y,&p[n].x,&p[n].y);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&p[i].x,&p[i].y);\\n\\n\\t\\tpoint<double> O={0,0};\\n\\t\\tdouble ans=dfs(D,O,dist(D,O));\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",ans<INF/2?ans:-1);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 824,\n \"score_of_the_acc\": -0.0171,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2404_433065\",\n \"code_snippet\": \"#include<cmath>\\n#include<cstdio>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst double EPS=1e-7;\\nconst double INF=1e77;\\nconst double PI=acos(-1);\\n\\ntemplate<class T>\\nstruct point{\\n\\tT x,y;\\n\\tpoint &operator+=(const point &a){ x+=a.x; y+=a.y; }\\n\\tpoint &operator-=(const point &a){ x-=a.x; y-=a.y; }\\n\\tpoint operator+(const point &a)const{ return (point){x+a.x,y+a.y}; }\\n\\tpoint operator-(const point &a)const{ return (point){x-a.x,y-a.y}; }\\n};\\n\\ntemplate<class T>\\npoint<T> operator*(T c,const point<T> &a){ return (point<T>){c*a.x,c*a.y}; }\\n\\nbool operator==(const point<double> &a,const point<double> &b){\\n\\treturn abs(a.x-b.x)<EPS && abs(a.y-b.y)<EPS;\\n}\\nbool operator!=(const point<double> &a,const point<double> &b){\\n\\treturn abs(a.x-b.x)>EPS || abs(a.y-b.y)>EPS;\\n}\\n\\ntemplate<class T>\\nT cross(const point<T> &a,const point<T> &b){ return a.x*b.y-a.y*b.x; }\\n\\ntemplate<class T>\\ndouble arg(const point<T> &a){\\n\\tdouble t=atan2(a.y,a.x);\\n\\treturn t<0?t+2*PI:t;\\n}\\n\\ntemplate<class T>\\nstruct line{\\n\\tpoint<T> a,b;\\n\\toperator line<double>()const{ return (line<double>){a,b}; }\\n};\\n\\nenum {CCW=1,CW=-1,ON=0};\\nint ccw(const point<double> &a,const point<double> &b,const point<double> &c){\\n\\tdouble rdir=cross(b-a,c-a);\\n\\tif(rdir> EPS) return CCW;\\n\\tif(rdir<-EPS) return CW;\\n\\treturn ON;\\n}\\n\\ntemplate<class T>\\ndouble dist(const point<T> &a,const point<T> &b){\\n\\treturn sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));\\n}\\n\\ntemplate<class T>\\nbool cover(const point<T> &a,const point<T> &b,const point<T> &c,const point<T> &p){\\n\\tint d1=ccw(p,a,b);\\n\\tint d2=ccw(p,b,c);\\n\\tint d3=ccw(p,c,a);\\n\\treturn !(d1==CCW && d2== CW || d1==CCW && d3== CW || d2==CCW && d3== CW\\n\\t\\t || d1== CW && d2==CCW || d1== CW && d3==CCW || d2== CW && d3==CCW);\\n}\\n\\npoint<double> get_intersect(const line<double> &L1,const line<double> &L2){\\n\\tdouble a1=cross(L1.b-L1.a,L2.b-L2.a);\\n\\tdouble a2=cross(L1.b-L1.a,L1.b-L2.a);\\n\\tif(abs(a1)<EPS) return L1.a;\\n\\treturn L2.a+a2/a1*(L2.b-L2.a);\\n}\\n\\nint n;\\npoint<double> p[9]; // ツ杭, ツつスツつセツつオ p[n] ツづ債ゴツーツδ?\\n\\nbool vis[9];\\ndouble dfs(point<double> D,point<double> O,double r){ // ツ個「ツづ個暗環置, ツ嘉アツ転ツ陳?心, ツ紐ツづ個陳キツつウ\\n\\tif(D==p[n]) return 0;\\n\\n\\tif(r+EPS<dist(O,p[n])) return INF;\\n// printf(\\\"D = (%.2f, %.2f)\\\\n\\\",D.x,D.y);\\n// printf(\\\"O = (%.2f, %.2f)\\\\n\\\",O.x,O.y);\\n// printf(\\\"r = %.2f\\\\n\\\",r);\\n\\tdouble res=INF;\\n\\trep(i,n+1) if(!vis[i]) {\\n\\t\\t// D ツつゥツづァ P ツづ可古シツつゥツづ?づ?づ慊づ?つキツつョツ進ツづ?\\n\\t\\tpoint<double> P=p[i];\\n\\t\\tdouble t0=arg(D-O);\\n\\n\\t\\tif(ccw(O,D,P)!=ON){ // O, D, P ツつェツ暗ェツ陳シツ静シツ湘」ツづ可づ按つ「ツづ?つォ\\n\\t\\t\\tint j0=-1; // ツづ債つカツづ淞づ可づ板づつつゥツづゥツ杭ツづーツ個ゥツづつつッツづゥ\\n\\t\\t\\trep(j,n) if(p[j]!=O && p[j]!=P && p[j]!=D) {\\n\\t\\t\\t\\tif(cover(O,D,P,p[j])){ // ツ三ツ角ツ形 ODP ツづ個陳?づ可杭 j ツつェツつ?づゥツづ?つォ\\n\\t\\t\\t\\t\\tif(j0==-1) j0=j;\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tdouble t1=arg(p[j0]-O)-t0; t1=min(abs(t1),abs(2*PI-t1));\\n\\t\\t\\t\\t\\t\\tdouble t2=arg(p[j ]-O)-t0; t2=min(abs(t2),abs(2*PI-t2));\\n\\t\\t\\t\\t\\t\\tif(t2+EPS<t1 || abs(t1-t2)<EPS && dist(p[j0],O)<dist(p[j],O)){\\n\\t\\t\\t\\t\\t\\t\\tj0=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\\tif(j0==-1){ // ツづ?づ個杭ツづ可づ?づ板づつつゥツづァツづ按つ「\\n\\t\\t\\t\\tdouble d=dist(O,P);\\n\\t\\t\\t\\tif(d<r+EPS){\\n\\t\\t\\t\\t\\tvis[i]=true;\\n\\t\\t\\t\\t\\tres=min(res,dist(D,P)+dfs(P,O,r));\\n\\t\\t\\t\\t\\tvis[i]=false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse{ // ツ杭 j0 ツづ可づ板づつつゥツづゥ\\n\\t\\t\\t\\tpoint<double> Q=get_intersect((line<double>){D,P},(line<double>){O,p[j0]});\\n\\t\\t\\t\\tdouble d=dist(O,Q);\\n\\t\\t\\t\\tif(d<r+EPS){\\n\\t\\t\\t\\t\\tres=min(res,dist(D,Q)+dfs(Q,p[j0],r-dist(O,p[j0])));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse{ // O, D, P ツつェツ暗ェツ陳シツ静シツ湘」ツづ可つ?づゥツづ?つォ\\n\\t\\t}\\n\\t}\\n\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tfor(;scanf(\\\"%d\\\",&n),n;){\\n\\t\\tpoint<double> D; // dog\\n\\t\\tscanf(\\\"%lf%lf%lf%lf\\\",&D.x,&D.y,&p[n].x,&p[n].y);\\n\\t\\trep(i,n) scanf(\\\"%lf%lf\\\",&p[i].x,&p[i].y);\\n\\n\\t\\tpoint<double> O={0,0};\\n\\t\\tdouble ans=dfs(D,O,dist(D,O));\\n\\t\\tprintf(\\\"%.9f\\\\n\\\",ans<INF/2?ans:-1);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 824,\n \"score_of_the_acc\": -0.0062,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1373,"cells":{"group_id":{"kind":"string","value":"aoj_2405_cpp"},"problem_description":{"kind":"string","value":"Sister Ports\n姉妹港\nEnglish text is not available in this practice contest.\nACM 国は正 n 角形の島国である．\nn 個の角に港があり，ある角の港から時計回りに 1 から n までの番号が順番に付いている．\n港は点とみなす．\nACM 国には，二種類の道路がある．\n隣り合う港を繋ぐ道路\n全ての隣接する港は道路で接続されている．すなわち，番号の差が 1 である港同士および港 1 と港 n の間に道路がある．この種類の道路は n 本ある．\n島の内部を通る道路\n一部の隣接しない港の間も，道路で接続されている．この種類の道路は m 本あり，道路 i は港 a\ni\nと港 b\ni\nを接続する．\n道路は線分とみなす．ACM 国では，任意の 2 つの道路は端点以外で共有点を持たない．\n図 G-1: 港と道路の例\nACM 国は，港に事故が起きた時などに備えるため，全ての港について姉妹港を決め，いつでも互いを補助できるよう準備させることにした．\n全ての港について姉妹港は 1 つで，港 a が港 b の姉妹港であるとき，港 b も港 a の姉妹港である．\nすなわち，n 個の港から，港が重複しない n/2 個のペアを作る．\nこのとき，ACM 国は，姉妹港の間には必ず道がなければならないとすることにした．\nACM 国に住む優秀なプログラマーであるあなたの仕事は，\n全港に対する姉妹港の選び方の総数を計算するプログラムを作成することである．\n図 G-2: 姉妹港の選び方の例（姉妹港同士の間の道路を赤色太線で表示している）\nInput\n入力は1つ以上のデータセットからなる．1つのデータセットは次の形式をしている．\nn\nm\na\n1\nb\n1\n...\na\nm\nb\nm\n先頭行は 2 つの正の整数 n, m からなり，\nそれぞれ ACM 国の港の数および種類 2 の道路の数を表す．\n続く m 行の i 行目は 2 個の整数 a\ni\n, b\ni\nからなり，\n道路 i が港 a\ni\n, b\ni\nを結ぶことを表す．\n任意の 2 つの道路は端点以外で共有点を持たない．また，これらの数は以下の範囲の値をとる．\n3 ≤ n ≤ 50,000\n0 ≤ m ≤ 50,000\n1 ≤ a\ni\n, b\ni\n≤ n\n入力の終わりはふたつのゼロを含む行で表される．\nOutput\n各データセットについて，\n姉妹港の選び方の総数を 1000003 で割った余りを出力せよ．\n適切な姉妹港の選び方が存在しない場合は 0 を出力せよ．\nSample Input\n6 1\n1 4\n8 3\n1 6\n1 5\n2 5\n12 3\n3 10\n4 9\n6 9\n3 0\n0 0\nOutput for Sample Input\n3\n5\n7\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2405_10826161","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}\ntemplate<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}\ntemplate<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}\ntemplate<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}\ntemplate<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}\ntemplate<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}\ntemplate<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}\ntemplate<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}\ntemplate<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)\n#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define reps(i,l,r) rep2(i,l,r)\n#define all(x) x.begin(),x.end()\n#define pcnt(x) __builtin_popcountll(x)\n#define fin(x) return cout<<(x)<<'\\n',static_cast<void>(0)\n#define yn(x) cout<<((x)?\"Yes\\n\":\"No\\n\")\n#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())\ntemplate<typename T>\ninline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}\nll myceil(ll a,ll b){return (a+b-1)/b;}\ntemplate<typename T,size_t n,size_t id=0>\nauto vec(const int (&d)[n],const T &init=T()){\n if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));\n else return init;\n}\n#ifdef LOCAL\n#include<debug.h>\n#define SWITCH(a,b) (a)\n#else\n#define debug(...) static_cast<void>(0)\n#define debugg(...) static_cast<void>(0)\n#define SWITCH(a,b) (b)\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\n#endif\nstruct Timer{\n clock_t start;\n Timer(){\n start=clock();\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout<<fixed<<setprecision(16);\n }\n inline double now(){return (double)(clock()-start)/1000;}\n #ifdef LOCAL\n ~Timer(){\n cerr<<\"time:\";\n cerr<<now();\n cerr<<\"ms\\n\";\n }\n #endif\n}timer;\nvoid SOLVE();\nint main(){\n int testcase=1;\n //cin>>testcase;\n for(int i=0;i<testcase;i++){\n SOLVE();\n }\n}\n#include<type_traits>\nnamespace Random{\n std::mt19937_64 mt(std::random_device{}());\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T> get(){return mt();}\n template<typename T>inline std::enable_if_t<std::is_floating_point_v<T>,T> get(){return T(mt())/T(-1ull);}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T n){return mt()%n;}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T l,T r){return l+mt()%(r-l);}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,std::pair<T,T>>distinct(T n){\n T l=mt()%n,r=mt()%(n-1);\n if(l==r)r++;\n if(l>r)std::swap(l,r);\n return std::make_pair(l,r);\n }\n}\n#include<concepts>\ntemplate<typename T>\nconstexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>msb(T n){return n==0?-1:31-__builtin_clz(n);}\ntemplate<typename T>\nconstexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>msb(T n){return n==0?-1:63-__builtin_clzll(n);}\n\ntemplate<typename T>\nconstexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>lsb(T n){return n==0?-1:__builtin_ctz(n);}\ntemplate<typename T>\nconstexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>lsb(T n){return n==0?-1:__builtin_ctzll(n);}\n\ntemplate<typename T>\nconstexpr std::enable_if_t<std::is_integral_v<T>,T>floor_pow2(T n){return n==0?0:T(1)<<msb(n);}\n\ntemplate<typename T>\nconstexpr std::enable_if_t<std::is_integral_v<T>,T>ceil_pow2(T n){return n<=1?1:T(1)<<(msb(n-1)+1);}\n\ntemplate<std::integral T>\nconstexpr T safe_div(T a,T b){return a/b-(a%b&&(a^b)<0);}\ntemplate<std::integral T>\nconstexpr T safe_ceil(T a,T b){return a/b+(a%b&&(a^b)>0);}\n#include<initializer_list>\nbool isprime(unsigned long long n)noexcept{\n using u64=unsigned long long;\n if(n<=1)return false;\n if(n%2==0)return n==2;\n u64 d=n-1;\n int s=0;\n while(!(d&1))d>>=1,s++;\n int q=63;\n while(!(d>>q))q--;\n u64 r=n;\n for(int i=0;i<5;i++)r*=2-r*n;\n auto redc=[&r,&n](__uint128_t x)->u64 {\n x=(x+__uint128_t(u64(x)*-r)*n)>>64;\n return x>=n?x-n:x;\n };\n __uint128_t r2=-__uint128_t(n)%n;\n u64 one=redc(r2);\n for(u64 base:{2,325,9375,28178,450775,9780504,1795265022}){\n if(base%n==0)continue;\n u64 a=base=redc((base%n)*r2);\n for(int i=q-1;i>=0;i--){\n a=redc(__uint128_t(a)*a);\n if(d>>i&1)a=redc(__uint128_t(a)*base);\n }\n if(a==one)continue;\n for(int i=1;a!=n-one;i++){\n if(i>=s)return false;\n a=redc(__uint128_t(a)*a);\n }\n }\n return true;\n}\nnamespace Random{\ntemplate<typename T>\ninline std::enable_if_t<std::is_integral_v<T>,T>prime(T l,T r){\n T res=0;\n while(!isprime(res))res=range(l,r);\n return res;\n}\n}\nstruct BarrettReduction{\nprivate:\n using i64=long long;\n using u64=unsigned long long;\n using u32=unsigned int;\n using u128=__uint128_t;\n u32 m;\n u64 im;\npublic:\n BarrettReduction():m(0),im(0){}\n BarrettReduction(u32 n):m(n),im(u64(-1)/n+1){}\n inline i64 quo(u64 x)const{\n if(m==1)return x;\n u64 y=u64((u128(x)*im)>>64);\n u32 r=x-y*m;\n return m<=r?y-1:y;\n }\n inline u32 rem(u64 x)const{\n if(m==1)return 0;\n u64 y=u64((u128(x)*im)>>64);\n u32 r=x-y*m;\n return m<=r?r+m:r;\n }\n inline std::pair<u64,u32>quo_rem(u64 x)const{\n if(m==0)return std::make_pair(x,0);\n u64 y=u64((u128(x)*im)>>64);\n u32 r=x-y*m;\n return m<=r?std::make_pair(y-1,r+m):std::make_pair(y,r);\n }\n inline u32 pow(u32 a,u64 p)const{\n u32 res=m!=1;\n while(p){\n if(p&1)res=rem(u64(res)*a);\n a=rem(u64(a)*a);\n p>>=1;\n }\n return res;\n }\n};\ntemplate<typename Key,typename Val>\nstruct HashMap{\n static_assert(std::is_integral_v<Key>);\nprivate:\n const int p;\n const Val def;\n std::vector<Key>key;\n std::vector<Val>value;\n BarrettReduction brp,brp1;\n static constexpr Key none=std::numeric_limits<std::make_signed_t<Key>>::max();\npublic:\n struct Iterator{\n using k_itr=typename std::vector<Key>::const_iterator;\n using v_itr=typename std::vector<Val>::iterator;\n k_itr kp;\n v_itr vp;\n k_itr kp2;\n Iterator operator++(){\n ++kp,++vp;\n step();\n return *this;\n }\n inline void step(){\n while(kp!=kp2&&(*kp)==none)++kp,++vp;\n }\n std::pair<const Key&,Val&> operator*(){\n return {*kp,*vp};\n }\n bool operator!=(Iterator rhs){return kp!=rhs.kp;}\n };\n HashMap(){}\n HashMap(int n,Val def_=Val()):def(def_),p(Random::prime(n*4/3,n*4/3+1000)){\n key.resize(p,none);\n value.resize(p,def);\n brp=BarrettReduction(p);\n brp1=BarrettReduction(p-1);\n }\n Val get(const Key&k)const{\n int now=brp.rem(k);\n int of=brp1.rem(k)+1;\n while(key[now]!=none&&key[now]!=k){\n now+=of;\n if(now>=p)now-=p;\n }\n return key[now]==none?def:value[now];\n }\n Val& set(const Key&k){\n int now=brp.rem(k);\n int of=brp1.rem(k)+1;\n while(key[now]!=none&&key[now]!=k){\n now+=of;\n if(now>=p)now-=p;\n }\n key[now]=k;\n return value[now];\n }\n Val &operator[](const Key&k){return set(k);}\n const Val& exist_get(const Key&k)const{\n int now=brp.rem(k);\n int of=brp1.rem(k)+1;\n while(key[now]!=k){\n now+=of;\n if(now>=p)now-=p;\n }\n return value[now];\n }\n Iterator begin(){\n Iterator res;\n res.kp=key.begin();\n res.vp=value.begin();\n res.kp2=key.end();\n res.step();\n return res;\n }\n Iterator end(){\n Iterator res;\n res.kp=res.kp2=key.end();\n res.vp=value.end();\n return res;\n }\n};\ntemplate<typename T=int>\nstruct Edge{\n int from,to;\n T weight;\n int index;\n Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}\n Edge():from(-1),to(-1),weight(),index(-1){}\n friend std::ostream &operator<<(std::ostream &os,const Edge&e){\n os<<'[';\n os<<\"from:\"<<e.from;\n os<<\"to:\"<<e.to;\n os<<\"weight:\"<<e.weight;\n os<<\"index:\"<<e.index;\n os<<']';\n return os;\n }\n};\ntemplate<typename T=int>\nstruct Graph{\nprivate:\n int n;\n std::vector<Edge<T>>edge;\n std::vector<Edge<T>>g;\n std::vector<int>ptr;\n bool directed;\n struct graph_range{\n using iterator=typename std::vector<Edge<T>>::iterator;\n iterator l,r;\n iterator begin()const{return l;}\n iterator end()const{return r;}\n int size()const{return r-l;}\n Edge<T> &operator[](int i)const{return l[i];}\n };\n struct const_graph_range{\n using iterator=typename std::vector<Edge<T>>::const_iterator;\n iterator l,r;\n iterator begin()const{return l;}\n iterator end()const{return r;}\n int size()const{return r-l;}\n const Edge<T> &operator[](int i)const{return l[i];}\n };\npublic:\n Graph(int n_,bool dir_):n(n_),directed(dir_){}\n Graph():n(0){}\n Graph(int n_,bool dir_,const std::vector<Edge<T>>&e):n(n_),directed(dir_),edge(e){build();}\n template<bool weighted=false,bool index=1>\n void read(int m){\n edge.reserve(m);\n for(int i=0;i<m;i++){\n int u,v;\n std::cin>>u>>v;\n T w;\n if constexpr(index)u--,v--;\n if constexpr(weighted)std::cin>>w;\n else w=1;\n edge.emplace_back(u,v,w,i);\n }\n build();\n }\n void add_edge(int u,int v){\n int id=edge.size();\n edge.emplace_back(u,v,1,id);\n }\n void add_edge(int u,int v,T w){\n int id=edge.size();\n edge.emplace_back(u,v,w,id);\n }\n void add_edge(int u,int v,T w,int index){\n edge.emplace_back(u,v,w,index);\n }\n void build(){\n std::vector<int>cnt(n+1,0);\n for(const Edge<T>&e:edge){\n cnt[e.from+1]++;\n if(!directed)cnt[e.to+1]++;\n }\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\n ptr=cnt;\n g.resize(cnt[n]);\n for(const Edge<T>&e:edge){\n g[cnt[e.from]++]=e;\n if(!directed)g[cnt[e.to]++]=Edge<T>(e.to,e.from,e.weight,e.index);\n }\n }\n void reverse(){\n if(directed){\n for(Edge<T>&e:edge)std::swap(e.from,e.to);\n build();\n }\n }\n inline void to_directed(){\n directed=true;\n build();\n }\n inline void to_undirected(){\n directed=false;\n build();\n }\n void reserve(int m){edge.reserve(m);}\n graph_range operator[](int i){return graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const_graph_range operator[](int i)const{return const_graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const Edge<T>& get_edge(int i)const{return edge[i];}\n std::vector<Edge<T>>get_edges()const{return edge;}\n inline bool is_directed()const{return directed;}\n inline int size()const{return n;}\n inline int edge_size()const{return edge.size();}\n typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}\n typename std::vector<Edge<T>>::iterator end(){return edge.end();}\n typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}\n typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}\n};\ntemplate<typename T>\nstd::pair<std::vector<std::pair<int,int>>,std::vector<std::array<int,3>>>nice_tree_decomposition(const Graph<T>&g){\n assert(!g.is_directed());\n std::vector<std::unordered_set<int>>adj(g.size());\n for(const Edge<T>&e:g){\n adj[e.from].insert(e.to);\n adj[e.to].insert(e.from);\n }\n std::vector<int>deg(g.size());\n std::queue<int>que;\n for(int i=0;i<g.size();i++)if((deg[i]=adj[i].size())<=2)que.push(i);\n std::vector<int>idx(g.size(),-1);\n std::vector<std::pair<int,int>>child(1);\n std::vector<std::array<int,3>>vs(1);\n auto make_nice=[&](int&ch,const std::array<int,3>&par)->void {\n std::array<int,3>ar;\n int pos1=0,pos2=0;\n while(pos1<3&&vs[ch][pos1]!=-1)pos1++;\n while(pos2<3&&par[pos2]!=-1)pos2++;\n for(int i=0;pos1>1;){\n bool found=false;\n for(;i<pos1;i++){\n if(std::find(par.begin(),par.begin()+pos2,vs[ch][i])==par.begin()+pos2){\n child.emplace_back(ch,-1);\n assert(ch!=child.size()-1);\n std::array<int,3>&fix=vs.emplace_back(vs[ch]);\n for(int j=i;j+1<3;j++)fix[j]=fix[j+1];\n fix[2]=-1;\n ch=child.size()-1;\n found=true;\n pos1--;\n break;\n }\n }\n if(!found)break;\n }\n for(int i=0;i<pos2;i++){\n if(std::find(vs[ch].begin(),vs[ch].begin()+pos1,par[i])==vs[ch].begin()+pos1){\n child.emplace_back(ch,-1);\n std::array<int,3>&fix=vs.emplace_back(vs[ch]);\n fix[pos1++]=par[i];\n ch=child.size()-1;\n }\n }\n };\n auto merge=[&](int lc,int rc,const std::array<int,3>&par)->int {\n make_nice(lc,par);\n make_nice(rc,par);\n child.emplace_back(lc,rc);\n vs.emplace_back(par);\n return child.size()-1;\n };\n while(!que.empty()){\n int x=que.front();que.pop();\n if(idx[x]!=-1)continue;\n std::array<int,3>v;\n v[0]=x;\n v[1]=v[2]=-1;\n for(int y:adj[x]){\n if(idx[y]==-1){\n if(v[1]==-1)v[1]=y;\n else v[2]=y;\n }\n }\n std::pair<int,int>c=std::make_pair(-1,-1);\n for(int y:adj[x])if(idx[y]>=0){\n if(c.first==-1)c.first=idx[y];\n else if(c.second==-1)c.second=idx[y];\n else{\n c.first=merge(c.first,c.second,v);\n c.second=idx[y];\n }\n idx[y]=-2;\n }\n deg[x]=0;\n if(c.first==-1){\n idx[x]=child.size();\n child.emplace_back(c);\n vs.emplace_back(std::move(v));\n int u=idx[x];\n if(vs[u][2]!=-1){\n child[u].first=child.size();\n child.emplace_back(-1,-1);\n vs.emplace_back(vs[u])[2]=-1;\n u=child.size()-1;\n }\n if(vs[u][1]!=-1){\n child[u].first=child.size();\n child.emplace_back(-1,-1);\n vs.emplace_back(vs[u])[1]=-1;\n u=child.size()-1;\n }\n }\n else if(c.second==-1){\n make_nice(c.first,v);\n idx[x]=c.first;\n }\n else{\n idx[x]=merge(c.first,c.second,v);\n }\n if(v[1]!=-1){\n if(v[2]!=-1){\n if(adj[v[1]].contains(v[2])){\n for(int i=1;i<=2;i++){\n if(--deg[v[i]]<=2&&idx[v[i]]==-1)que.push(v[i]);\n }\n }\n else{\n adj[v[1]].insert(v[2]);\n adj[v[2]].insert(v[1]);\n }\n }\n else if(--deg[v[1]]<=2&&idx[v[1]]==-1)que.push(v[1]);\n }\n }\n if(std::any_of(deg.begin(),deg.end(),[](int x){return x!=0;}))return {{},{}};\n child[0]=std::move(child.back()),child.pop_back();\n vs[0]=std::move(vs.back()),vs.pop_back();\n que.push(0);\n while(!que.empty()){\n int x=que.front();que.pop();\n if(child[x].second!=-1){\n vs[child[x].first]=vs[child[x].second]=vs[x];\n que.push(child[x].first);\n que.push(child[x].second);\n }\n else if(child[x].first!=-1){\n std::array<int,3>nxt=vs[x];\n std::array<int,3>&nc=vs[child[x].first];\n if(std::count(vs[x].begin(),vs[x].end(),-1)<std::count(nc.begin(),nc.end(),-1)){\n for(int i=0;i<3;i++){\n if(nxt[i]!=-1&&std::find(nc.begin(),nc.end(),nxt[i])==nc.end()){\n nxt[i]=-1;\n }\n }\n }\n else{\n for(int i=0;i<3;i++){\n if(nc[i]!=-1&&std::find(vs[x].begin(),vs[x].end(),nc[i])==vs[x].end()){\n nxt[std::find(nxt.begin(),nxt.end(),-1)-nxt.begin()]=nc[i];\n }\n }\n }\n nc=std::move(nxt);\n que.push(child[x].first);\n }\n }\n return std::make_pair(std::move(child),std::move(vs));\n}\n#include<optional>\nconstexpr int carmichael_constexpr(int n){\n if(n==998244353)return 998244352;\n if(n==1000000007)return 1000000006;\n if(n<=1)return n;\n int res=1;\n int t=0;\n while(n%2==0){\n n/=2;\n t++;\n }\n if(t==2)res=2;\n else if(t>=3)res=1<<(t-2);\n for(int i=3;i*i<=n;i++)if(n%i==0){\n int c=0;\n while(n%i==0){\n n/=i;\n c++;\n }\n int prod=i-1;\n for(int j=0;j<c-1;j++)prod*=i;\n res=std::lcm(res,prod);\n }\n if(n!=1)res=std::lcm(res,n-1);\n return res;\n}\ntemplate<int m>\nstruct mod_int{\nprivate:\n static constexpr unsigned int umod=static_cast<unsigned int>(m);\n static constexpr unsigned int car=carmichael_constexpr(m);\n using uint=unsigned int;\n using mint=mod_int;\n uint v;\n static_assert(m<uint(1)<<31);\n mint sqrt_impl()const{\n if(this->val()<=1)return *this;\n if constexpr(m%8==1){\n mint b=2;\n while(b.pow((m-1)/2).val()==1)b++;\n int m2=m-1,e=0;\n while(m2%2==0)m2>>=1,e++;\n mint x=this->pow((m2-1)/2);\n mint y=(*this)*x*x;\n x*=*this;\n mint z=b.pow(m2);\n while(y.val()!=1){\n int j=0;\n mint t=y;\n while(t.val()!=1)t*=t,j++;\n z=z.pow(1<<(e-j-1));\n x*=z;\n z*=z;\n y*=z;e=j;\n }\n return x;\n }\n else if constexpr(m%8==5){\n mint ret=this->pow((m+3)/8);\n if((ret*ret).val()==this->val())return ret;\n else return ret*mint::raw(2).pow((m-1)/4);\n }\n else{\n return this->pow((m+1)/4);\n }\n }\npublic:\n using value_type=uint;\n mod_int():v(0){}\n template<typename T,std::enable_if_t<std::is_signed_v<T>,std::nullptr_t> =nullptr>\n mod_int(T a){\n a%=m;\n if(a<0)v=a+umod;\n else v=a;\n }\n template<typename T,std::enable_if_t<std::is_unsigned_v<T>,std::nullptr_t> =nullptr>\n mod_int(T a):v(a%umod){}\n static constexpr mint raw(int a){\n mint ret;\n ret.v=a;\n return ret;\n }\n inline uint val()const{return this->v;}\n static constexpr int mod(){return m;}\n inline mint &operator+=(const mint &b){\n this->v+=b.v;\n if(this->v>=umod)this->v-=umod;\n return *this;\n }\n inline mint &operator-=(const mint &b){\n this->v-=b.v;\n if(this->v>=umod)this->v+=umod;\n return *this;\n }\n inline mint &operator*=(const mint &b){\n this->v=((unsigned long long)this->v*b.v)%umod;\n return *this;\n }\n inline mint &operator/=(const mint &b){\n *this*=b.inv();\n return *this;\n }\n inline mint operator+()const{return *this;}\n inline mint operator-()const{return mint()-*this;}\n friend inline mint operator+(const mint &a,const mint &b){return mint(a)+=b;}\n friend inline mint operator-(const mint &a,const mint &b){return mint(a)-=b;}\n friend inline mint operator*(const mint &a,const mint &b){return mint(a)*=b;}\n friend inline mint operator/(const mint &a,const mint &b){return mint(a)/=b;}\n friend inline bool operator==(const mint &a,const mint &b){return a.val()==b.val();}\n friend inline bool operator!=(const mint &a,const mint &b){return !(a==b);}\n inline mint operator++(int){\n mint ret=*this;\n *this+=mint::raw(1);\n return ret;\n }\n inline mint operator--(int){\n mint ret=*this;\n *this-=mint::raw(1);\n return ret;\n }\n mint pow(long long n)const{\n mint ret=mint::raw(1),a(*this);\n while(n){\n if(n&1)ret*=a;\n a*=a;\n n>>=1;\n }\n return ret;\n }\n inline mint inv()const{\n assert(this->v!=0);\n return pow(car-1);\n }\n std::optional<mint>sqrt()const{\n if(this->val()<=1||this->pow((m-1)/2)==1)return std::make_optional(this->sqrt_impl());\n else return std::nullopt;\n }\n static constexpr unsigned int order(){return car;}\n friend std::istream &operator>>(std::istream &is,mint &b){\n long long a;\n is>>a;\n b=mint(a);\n return is;\n }\n friend std::ostream &operator<<(std::ostream &os,const mint &b){\n os<<b.val();\n return os;\n }\n};\ntemplate<int m>\nstruct std::hash<mod_int<m>>{\n std::size_t operator()(mod_int<m>x)const{\n return std::hash<unsigned int>()(x.val());\n }\n};\nusing mint998=mod_int<998244353>;\nusing mint107=mod_int<1000000007>;\nusing mint=mod_int<1000003>;\nvoid SOLVE(){\n while(true){\n int n,m;\n cin>>n>>m;\n if(n==0)break;\n if(n&1){\n cout<<\"0\\n\";\n continue;\n }\n Graph g(n,false);\n g.reserve(n+m);\n HashMap<ll,char>mp(n+m);\n auto add_edge=[&](int u,int v)->void {\n if(u>v)swap(u,v);\n mp[ll(u)*n+v]=true;\n g.add_edge(u,v);\n };\n auto find_edge=[&](int u,int v)->bool {\n if(u>v)swap(u,v);\n if(u==-1)return false;\n return mp.get(ll(u)*n+v);\n };\n rep(i,n)add_edge(i,(i+1)%n);\n rep(i,m){\n int u,v;\n cin>>u>>v;\n u--,v--;\n add_edge(u,v);\n }\n g.build();\n auto result=nice_tree_decomposition(g);\n auto child=result.first;\n auto vs=result.second;\n using Data=array<mint,8>;\n auto dfs=[&](auto self,int x)->Data {\n if(child[x].first==-1){\n Data res;\n res.fill(0);\n res[0]=1;\n return res;\n }\n else if(child[x].second==-1){\n int c=child[x].first;\n int pos=0;\n while(vs[x][pos]==vs[c][pos])pos++;\n Data cdp=self(self,c);\n Data res;\n res.fill(0);\n if(vs[x][pos]==-1){//forget\n rep(i,8){\n if(i>>pos&1)res[i^(1<<pos)]+=cdp[i];\n else{\n rep(j,3)if(pos!=j&&!(i>>j&1)&&find_edge(vs[c][pos],vs[c][j])){\n res[i|(1<<j)]+=cdp[i];\n }\n }\n }\n }\n else{\n res=cdp;\n }\n return res;\n }\n else{\n auto ldp=self(self,child[x].first);\n auto rdp=self(self,child[x].second);\n Data res;\n res.fill(0);\n rep(i,8)rep(j,8){\n if(i&j)continue;\n res[i|j]+=ldp[i]*rdp[j];\n }\n return res;\n }\n };\n auto dp=dfs(dfs,0);\n int mask=0;\n rep(i,3)if(vs[0][i]!=-1)mask|=1<<i;\n cout<<dp[mask]<<'\\n';\n }\n}","accuracy":1,"time_ms":210,"memory_kb":56404,"score_of_the_acc":-0.5398,"final_rank":10},{"submission_id":"aoj_2405_9403442","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 all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nmap<pair<pair<ll,ll>,ll>,ll> DP;\nvector<set<ll>> G;\nvector<ll> Rightest;\nconst ll mod=1000003;\n\nvoid dfs(ll L,ll R){\n if(L>=R)return;\n if(L+1==R){\n DP[{{L,R},0}]=1;\n DP[{{L,R},3}]=1;\n return;\n }\n ll mid=R-1;\n if(Rightest[R]>L){\n mid=*(G[R].upper_bound(L));\n }\n if((mid-L)!=1){\n dfs(L,mid);\n }\n else{\n DP[{{L,mid},0}]=1;\n DP[{{L,mid},3}]=1;\n }\n if((R-mid)!=1){\n dfs(mid,R);\n }\n else{\n DP[{{mid,R},0}]=1;\n DP[{{mid,R},3}]=1;\n }\n \n\n rep(lbit,4)rep(rbit,4){\n ll d=(lbit%2)+(rbit/2);\n if(d!=1)continue;\n ll nl=lbit/2;\n ll nr=rbit%2;\n DP[{{L,R},nl*2+nr}]+=DP[{{L,mid},lbit}]*DP[{{mid,R},rbit}]%mod;\n if(nl*2+nr==0&&G[L].count(R)){\n DP[{{L,R},3}]+=DP[{{L,mid},lbit}]*DP[{{mid,R},rbit}]%mod;\n }\n }\n rep(i,4){\n DP[{{L,R},i}]%=mod;\n }\n return;\n\n \n}\n\n\nvoid solve(ll N,ll M) {\n DP.clear();\n G.resize(N);\n rep(i,N)G[i].clear();\n Rightest.assign(N,-1e18);\n Rightest[N-1]=0;\n rep(i,M){\n ll A,B;\n cin>>A>>B;\n A--,B--;\n if(A>B)swap(A,B);\n if((B-A)%2==1){\n G[A].insert(B);\n G[B].insert(A);\n Rightest[B]=max(Rightest[B],A);\n }\n }\n G[0].insert(N-1);\n if(N%2==1){\n cout<<0<<endl;\n return;\n }\n\n dfs(0,N-1);\n cout<<DP[{{0,N-1},3}]<<endl;\n \n}\n\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,K;\n while (cin >> N>>K, N != 0)solve(N,K);\n\n}","accuracy":1,"time_ms":1120,"memory_kb":49480,"score_of_the_acc":-0.5994,"final_rank":13},{"submission_id":"aoj_2405_9267166","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nbool is_end = false;\nconst ll MOD = 1000003;\n\nll calc_dp(int left, int right, map<array<int, 2>, int> &mp, const vector<vector<ll>> &edge, const vector<int> &next_v)\n{\n // cout << left << \" \" << right << endl;\n assert(left % 2 == right % 2);\n \n if (left >= right)\n {\n return 1;\n }\n if (mp.find({left, right}) != mp.end())\n {\n return mp[{left, right}];\n }\n \n ll ret = 0;\n for (auto mid : edge[left])\n {\n ret += calc_dp(left + 1, mid - 1, mp, edge, next_v) * calc_dp(next_v[mid], right, mp, edge, next_v);\n }\n return mp[{left, right}] = ret % MOD;\n}\n\n\nvoid solve()\n{\n ll N, M; cin >> N >> M;\n if (N == 0 && M == 0)\n {\n is_end = true;\n return;\n }\n \n if (N % 2 == 1)\n {\n cout << 0 << endl;\n return;\n }\n \n vector<vector<ll>> edge(N);\n for (int i = 0; i < M; ++i)\n {\n ll a, b; cin >> a >> b;\n a--, b--;\n ll c = min(a, b), d = max(a, b) + 1;\n if (c % 2 == d % 2) edge[c].emplace_back(d);\n }\n vector<int> next_v(N+1, 0);\n {\n ll nxt = N;\n for (int i = N; i >= 0; i -= 2)\n {\n if (edge[i].size()) nxt = i;\n next_v[i] = nxt;\n }\n nxt = N - 1;\n for (int i = N - 1; i >= 0; i -= 2)\n {\n if (edge[i].size()) nxt = i;\n next_v[i] = nxt;\n }\n \n // for (int i = 0; i < N; ++i)\n // {\n // cout << i << \" \" << next_v[i] << endl;\n // }\n }\n \n for (int i = 0; i < N - 1; ++i)\n {\n edge[i].emplace_back(i+2);\n }\n edge[0].emplace_back(N);\n for (int i = 0; i < N; ++i)\n {\n sort(edge[i].begin(), edge[i].end());\n }\n \n map<array<int, 2>, int> mp;\n ll res = calc_dp(0, N, mp, edge, next_v);\n cout << res << endl;\n \n return;\n}\n\n\nint main()\n{\n while (!is_end)\n {\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":14124,"score_of_the_acc":-0.0925,"final_rank":7},{"submission_id":"aoj_2405_9099293","code_snippet":"// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n// #include<sys/time.h>\n// #include<atcoder/fenwicktree>\n\nusing namespace std;\n\n// using mint = atcoder::modint1000000007;\n\nusing P = pair<int, int>;\n\nconst int mod = 1000003;\nvector<vector<int>> edge;\n\narray<long long, 4> dfs(int l, int r) {\n if (l == r - 1) {\n return { 1, 0, 0, 1 };\n }\n bool lr = false;\n if (edge[l].back() == r) {\n lr = true;\n edge[l].pop_back();\n }\n int m = edge[l].back();\n auto vl = dfs(l, m);\n auto vr = dfs(m, r);\n array<long long, 4> res{};\n res[0] = (vl[0] * vr[2] + vl[1] * vr[0]) % mod;\n res[1] = (vl[0] * vr[3] + vl[1] * vr[1]) % mod;\n res[2] = (vl[2] * vr[2] + vl[3] * vr[0]) % mod;\n res[3] = (vl[2] * vr[3] + vl[3] * vr[1]) % mod;\n if (lr) {\n res[3] = (res[3] + vl[0] * vr[2] + vl[1] * vr[0]) % mod;\n }\n return res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0) break;\n\n edge = vector<vector<int>>(n);\n for (int i = 0; i + 1 < n; ++i) {\n edge[i].push_back(i + 1);\n }\n edge[0].push_back(n - 1);\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >> u >> v;\n --u;\n --v;\n if (u > v) {\n swap(u, v);\n }\n edge[u].push_back(v);\n }\n for (int i = 0; i < n; ++i) {\n sort(edge[i].begin(), edge[i].end());\n }\n auto res = dfs(0, n - 1);\n cout << res[3] << '\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":15316,"score_of_the_acc":-0.0918,"final_rank":6},{"submission_id":"aoj_2405_9096892","code_snippet":"// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n// #include<sys/time.h>\n// #include<atcoder/fenwicktree>\n\nusing namespace std;\n\n// using mint = atcoder::modint1000000007;\n\nusing P = pair<int, int>;\n\nconst int mod = 1000003;\nvector<vector<int>> edge;\nunordered_map<long long, array<long long, 4>> memo;\n\narray<long long, 4> dfs(int l, int r) {\n if (l == r - 1) {\n return { 1, 0, 0, 1 };\n }\n long long h = l * (long long)mod + r;\n if (memo.count(h)) {\n return memo[h];\n }\n bool lr = false;\n if (edge[l].back() == r) {\n lr = true;\n edge[l].pop_back();\n }\n int m = edge[l].back();\n auto vl = dfs(l, m);\n auto vr = dfs(m, r);\n array<long long, 4> res{};\n res[0] = (vl[0] * vr[2] + vl[1] * vr[0]) % mod;\n res[1] = (vl[0] * vr[3] + vl[1] * vr[1]) % mod;\n res[2] = (vl[2] * vr[2] + vl[3] * vr[0]) % mod;\n res[3] = (vl[2] * vr[3] + vl[3] * vr[1]) % mod;\n if (lr) {\n res[3] = (res[3] + vl[0] * vr[2] + vl[1] * vr[0]) % mod;\n }\n return memo[h] = res;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0) break;\n\n edge = vector<vector<int>>(n);\n memo = unordered_map<long long, array<long long, 4>>();\n for (int i = 0; i + 1 < n; ++i) {\n edge[i].push_back(i + 1);\n }\n edge[0].push_back(n - 1);\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >> u >> v;\n --u;\n --v;\n if (u > v) {\n swap(u, v);\n }\n edge[u].push_back(v);\n }\n for (int i = 0; i < n; ++i) {\n sort(edge[i].begin(), edge[i].end());\n }\n auto res = dfs(0, n - 1);\n cout << res[3] << '\\n';\n }\n\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":19480,"score_of_the_acc":-0.1391,"final_rank":8},{"submission_id":"aoj_2405_8492342","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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 rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)), end(v));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst int inf = (1 << 30) - 1;\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <int mod>\nstruct modint {\n int x;\n\n modint() : x(0) {}\n\n modint(ll y) {\n x = y % mod;\n if (x < 0) x += mod;\n }\n\n static int get_mod() { return mod; }\n\n modint &operator+=(modint p) {\n x += p.x;\n if (x >= mod) x -= mod;\n return *this;\n }\n\n modint &operator-=(modint p) {\n x -= p.x;\n if (x < 0) x += mod;\n return *this;\n }\n\n modint &operator*=(modint p) {\n x = (1LL * x * p.x) % mod;\n return *this;\n }\n\n modint &operator/=(modint p) {\n *this *= p.inverse();\n return *this;\n }\n\n modint operator-() { return modint(-x); }\n modint operator+(modint p) { return modint(*this) += p; }\n modint operator-(modint p) { return modint(*this) -= p; }\n modint operator*(modint p) { return modint(*this) *= p; }\n modint operator/(modint p) { return modint(*this) /= p; }\n bool operator==(modint p) { return x == p.x; }\n bool operator!=(modint p) { return x != p.x; }\n\n modint pow(ll k) {\n modint ret = 1, now = *this;\n while (k > 0) {\n if (k & 1) ret *= now;\n now *= now;\n k >>= 1;\n }\n return ret;\n }\n\n modint inverse() { return pow(mod - 2); }\n\n friend istream &operator>>(istream &is, modint &p) {\n ll y;\n is >> y;\n p = modint(y);\n return is;\n }\n\n friend ostream &operator<<(ostream &os, modint p) { return os << p.x; }\n};\n\nusing mint = modint<1000003>;\n\nvoid solve() {\n int N, M;\n cin >> N >> M;\n\n if (N == 0 && M == 0) exit(0);\n\n vector<int> IN(N, 0), OUT(N, 0);\n\n rep(i, M) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n if (u > v) swap(u, v);\n if (u % 2 == v % 2) continue;\n IN[u]++, OUT[v]++;\n }\n\n IN[0]++, OUT[N - 1]++;\n\n if (N & 1) {\n cout << 0 << '\\n';\n return;\n }\n\n vector<int> l, r;\n vector<vector<int>> es;\n\n stack<int> st;\n\n rep(i, N) {\n rep(j, OUT[i]) {\n assert(!empty(st));\n int v = st.top();\n st.pop();\n r[v] = i;\n if (!empty(st)) {\n int p = st.top();\n es[p].eb(v);\n }\n }\n rep(j, IN[i]) {\n int v = sz(l);\n l.eb(i), r.eb(-1);\n es.eb();\n st.emplace(v);\n }\n }\n\n auto rec = [&](auto &&rec, int now) -> pair<mint, mint> {\n int L = sz(es[now]);\n vector<pair<mint, mint>> ps(L);\n rep(i, L) {\n int e = es[now][i];\n ps[i] = rec(rec, e);\n }\n\n auto count = [&](int s) {\n mint ret = 1;\n rep(i, L) {\n int e = es[now][i];\n if (l[e] < s || l[e] % 2 != s % 2) {\n ret *= ps[i].second;\n } else {\n ret *= ps[i].first;\n }\n }\n return ret;\n };\n\n mint x = count(l[now]), y = count(l[now] + 1);\n\n return make_pair(x + y, y);\n };\n\n auto [x, y] = rec(rec, 0);\n cout << x << '\\n';\n}\n\nint main() {\n while (true) solve(); //\n}","accuracy":1,"time_ms":20,"memory_kb":7848,"score_of_the_acc":-0.012,"final_rank":3},{"submission_id":"aoj_2405_8305291","code_snippet":"#include <iostream>\n#include <set>\n#include <vector>\nusing namespace std;\n\nconst long long mod = 1000003;\nlong long N;\nlong long M, A[200009], B[200009];\nlong long DP[200009][3];\nlong long NumArea = 1;\nset<pair<int, int>> Set;\nvector<pair<int, int>> G[200009];\n\nvoid Initialize() {\n\tNumArea = 1;\n\tSet.clear();\n\tfor (int i = 0; i < 200000; i++) {\n\t\tA[i] = 0; B[i] = 0; G[i].clear();\n\t\tfor (int j = 0; j < 3; j++) DP[i][j] = 0;\n\t}\n}\n\nvoid dfs(int pos, int cl, int cr) {\n\tvector<pair<int, int>> Edges;\n\tint cur = cl; if (cl == -1) cur = 0;\n\tint target = cr; if (cr == -1) target = 100000000;\n\n\t// Get Childs\n\twhile (true) {\n\t\tauto itr = Set.lower_bound(make_pair(cur, -target));\n\t\tif (Edges.size() == 0 || (cl == -1 && Edges.size() == 1)) itr = Set.lower_bound(make_pair(cur, -target + 1));\n\n\t\t// Add Edges\n\t\tint pl = (*itr).first;\n\t\tint pr = -(*itr).second;\n\t\tif (cr != -1 && pl >= cr) break;\n\t\tif (cr == -1 && Edges.size() >= 1 && pl >= Edges[0].first + N) break;\n\t\tEdges.push_back(make_pair(pl, pr));\n\t\tcur = pr;\n\t\tif (cr == -1 && Edges.size() == 1) target = pl + N;\n\t}\n\n\t// DFS\n\tint BASE = NumArea; NumArea += Edges.size();\n\tfor (int i = 0; i < Edges.size(); i++) {\n\t\tint col = Edges[i].first % 2;\n\t\tif (Edges[i].first % 2 == Edges[i].second % 2) col = -1;\n\t\tG[pos].push_back(make_pair(BASE + i, col));\n\t}\n\tfor (int i = 0; i < Edges.size(); i++) dfs(BASE + i, Edges[i].first, Edges[i].second);\n}\n\nvoid dfs2(int pos) {\n\t// Recursion\n\tfor (pair<int, int> i : G[pos]) dfs2(i.first);\n\tlong long Way0 = 1;\n\tlong long Way1 = 1;\n\tlong long WayN = 1;\n\n\t// Multiplication\n\tfor (int i = 0; i < G[pos].size(); i++) {\n\t\tint to = G[pos][i].first;\n\t\tint col = G[pos][i].second;\n\t\tif (col == 0) Way0 *= (DP[to][0] + DP[to][1] + DP[to][2] + DP[to][2]);\n\t\tif (col != 0) Way0 *= (DP[to][0] + DP[to][2]);\n\t\tif (col == 1) Way1 *= (DP[to][0] + DP[to][1] + DP[to][2] + DP[to][2]);\n\t\tif (col != 1) Way1 *= (DP[to][1] + DP[to][2]);\n\t\tWayN *= DP[to][2];\n\t\tWay0 %= mod; Way1 %= mod; WayN %= mod;\n\t}\n\tDP[pos][0] += (Way0 - WayN + mod) % mod;\n\tDP[pos][1] += (Way1 - WayN + mod) % mod;\n\tDP[pos][2] += WayN;\n}\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tInitialize();\n\t\tcin >> N >> M; if (N + M == 0) break;\n\t\tfor (int i = 0; i < M; i++) cin >> A[i] >> B[i];\n\t\tfor (int i = 0; i < M; i++) A[i] -= 1;\n\t\tfor (int i = 0; i < M; i++) B[i] -= 1;\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tif (A[i] > B[i]) swap(A[i], B[i]);\n\t\t}\n\t\tif (N % 2 == 1) {\n\t\t\tcout << \"0\" << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tif (M == 0) {\n\t\t\tcout << \"2\" << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\t// Step 2. Make Tree\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 0, -(B[i] + N * 0)));\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 0, -(A[i] + N * 1)));\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 1, -(B[i] + N * 1)));\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 1, -(A[i] + N * 2)));\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 2, -(B[i] + N * 2)));\n\t\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 2, -(A[i] + N * 3)));\n\t\tdfs(0, -1, -1);\n\n\t\t// Step 3. Get Answer\n\t\tdfs2(0);\n\t\tcout << (DP[0][0] + DP[0][1] + 2LL) % mod << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":360,"memory_kb":37540,"score_of_the_acc":-0.367,"final_rank":9},{"submission_id":"aoj_2405_7069478","code_snippet":"#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2405&lang=jp\"\n\n#include <iostream>\n#include <map>\n#include <set>\n\nconstexpr int mod = 1000003;\n\n#include <functional>\n\n#include <algorithm>\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\n#include <deque>\n#include <optional>\n#include <utility>\n\nnamespace suisen {\n struct DecompNode {\n std::vector<int> bag;\n std::vector<int> adj;\n };\n struct DecompNodeRooted {\n std::vector<int> bag;\n int par;\n std::vector<int> ch;\n };\n\n struct TreeDecompositionTW2 {\n TreeDecompositionTW2(const int n = 0, const std::vector<std::pair<int, int>>& edges = {}) : _n(n), _edges(edges) {}\n TreeDecompositionTW2(const std::vector<std::vector<int>>& g) : TreeDecompositionTW2(g.size()) {\n for (int i = 0; i < _n; ++i) for (int j : g[i]) if (i < j) add_edge(i, j);\n }\n\n void add_edge(int u, int v) {\n _edges.emplace_back(u, v);\n }\n\n std::optional<std::vector<DecompNode>> decomp() const {\n std::vector<std::vector<std::pair<int, int>>> g(_n);\n for (auto [u, v] : _edges) if (u != v) {\n if (u > v) std::swap(u, v);\n const int du = g[u].size(), dv = g[v].size();\n g[u].emplace_back(v, dv);\n g[v].emplace_back(u, du);\n }\n\n std::vector<int8_t> seen(_n, false);\n std::deque<int> dq;\n auto push_if_removable = [&](int i) {\n if (g[i].size() > 2 or std::exchange(seen[i], true)) return;\n if (g[i].size() == 2) dq.push_back(i);\n else dq.push_front(i);\n };\n for (int i = 0; i < _n; ++i) push_if_removable(i);\n\n std::vector<int> roots;\n std::vector<std::pair<int, int>> edges;\n edges.reserve(_n - 1);\n std::vector<std::vector<int>> bag(_n);\n std::vector<std::vector<int>> link(_n);\n\n atcoder::dsu uf(_n);\n for (int id = 0; id < _n; ++id) {\n if (dq.empty()) return std::nullopt;\n int u = dq.front();\n dq.pop_front();\n if (g[u].size() == 0) {\n bag[id] = { u };\n roots.push_back(id);\n } else if (g[u].size() == 1) {\n int v = remove_edge(g, u, 0);\n push_if_removable(v);\n bag[id] = { u, v };\n link[v].push_back(id);\n } else {\n int v = remove_edge(g, u, 0);\n int w = remove_edge(g, u, 0);\n if (v > w) std::swap(v, w);\n bag[id] = { u, v, w };\n const int dv = g[v].size(), dw = g[w].size();\n g[v].emplace_back(w, dw);\n g[w].emplace_back(v, dv);\n remove_multiedges(g, v, dv);\n remove_multiedges(g, w, dw);\n push_if_removable(v);\n push_if_removable(w);\n link[v].push_back(id);\n link[w].push_back(id);\n }\n std::reverse(link[u].begin(), link[u].end());\n for (int id2 : link[u]) if (not uf.same(id, id2)) {\n edges.emplace_back(id, id2);\n uf.merge(id, id2);\n }\n g[u].clear(), g[u].shrink_to_fit(), link[u].clear(), link[u].shrink_to_fit();\n }\n const int root_num = roots.size();\n for (int i = 0; i < root_num - 1; ++i) {\n edges.emplace_back(roots[i], roots[i + 1]);\n }\n std::vector<DecompNode> res(_n);\n for (int i = 0; i < _n; ++i) {\n res[i].bag = std::move(bag[i]);\n std::sort(res[i].bag.begin(), res[i].bag.end());\n }\n for (auto& [i, j] : edges) {\n res[i].adj.push_back(j);\n res[j].adj.push_back(i);\n }\n return res;\n }\n std::optional<std::vector<DecompNodeRooted>> nice_decomp() const {\n auto opt_decomp = decomp();\n if (not opt_decomp.has_value()) return std::nullopt;\n std::vector<DecompNodeRooted> res(_n);\n for (int i = 0; i < _n; ++i) {\n res[i].bag = std::move((*opt_decomp)[i].bag);\n }\n\n const int root = 0;\n\n std::vector<std::vector<std::pair<int, int>>> adj_idx(_n);\n for (int i = 0; i < _n; ++i) for (int j : (*opt_decomp)[i].adj) if (i < j) {\n int u = i, v = j;\n auto fix_deg = [&](int& z) {\n if ((z == root) + adj_idx[z].size() != 3) return;\n const int n = res.size();\n const int idx_zw = 0;\n const auto [w, idx_wz] = adj_idx[z][idx_zw];\n auto& node = res.emplace_back();\n node.bag = res[z].bag;\n adj_idx.push_back({ { z, idx_zw }, { w, idx_wz } });\n adj_idx[z][idx_zw] = { n, 0 };\n adj_idx[w][idx_wz] = { n, 1 };\n z = n;\n };\n fix_deg(u), fix_deg(v);\n const int du = adj_idx[u].size(), dv = adj_idx[v].size();\n adj_idx[u].emplace_back(v, dv);\n adj_idx[v].emplace_back(u, du);\n }\n for (int i = 0; i < int(res.size()); ++i) {\n res[i].ch.reserve(adj_idx[i].size());\n for (auto [j, idx] : adj_idx[i]) res[i].ch.push_back(j);\n adj_idx[i].clear(), adj_idx[i].shrink_to_fit();\n }\n adj_idx.clear(), adj_idx.shrink_to_fit();\n\n std::deque<int> dq{ root };\n while (dq.size()) {\n int u = dq.front();\n dq.pop_front();\n for (int v : res[u].ch) {\n res[v].par = u;\n res[v].ch.erase(std::find(res[v].ch.begin(), res[v].ch.end(), u));\n dq.push_back(v);\n }\n\n auto fix_path = [&](int u, int v) {\n std::vector<int> dif;\n std::set_difference(res[v].bag.begin(), res[v].bag.end(), res[u].bag.begin(), res[u].bag.end(), std::back_inserter(dif));\n std::set_difference(res[u].bag.begin(), res[u].bag.end(), res[v].bag.begin(), res[v].bag.end(), std::back_inserter(dif));\n assert(dif.size());\n res[u].ch.erase(std::find(res[u].ch.begin(), res[u].ch.end(), v));\n while (dif.size() > 1) {\n const int n = res.size();\n auto& node = res.emplace_back();\n std::set_symmetric_difference(res[u].bag.begin(), res[u].bag.end(), std::prev(dif.end()), dif.end(), std::back_inserter(node.bag));\n res[u].ch.push_back(n);\n dif.pop_back();\n node.par = u;\n u = n;\n }\n res[u].ch.push_back(v);\n res[v].par = u;\n };\n\n if (res[u].ch.size() == 2) {\n for (int v : res[u].ch) if (res[u].bag != res[v].bag) {\n const int n = res.size();\n *std::find(res[u].ch.begin(), res[u].ch.end(), v) = n;\n auto& node = res.emplace_back();\n node.bag = res[u].bag;\n node.ch = { v };\n node.par = u;\n fix_path(n, v);\n }\n } else if (res[u].ch.size() == 1) {\n fix_path(u, res[u].ch[0]);\n } else if (res[u].ch.size() == 0) {\n while (res[u].bag.size() > 1) {\n const int n = res.size();\n auto& node = res.emplace_back();\n node.bag = std::vector<int>(res[u].bag.begin(), std::prev(res[u].bag.end()));\n node.par = u;\n res[u].ch.push_back(n);\n u = n;\n }\n } else {\n assert(false);\n }\n }\n res[root].par = -1;\n\n return res;\n }\n\n static void assert_nice(const std::vector<DecompNodeRooted>& nodes, int root) {\n auto dfs = [&](auto dfs, int u) -> void {\n for (int v : nodes[u].ch) dfs(dfs, v);\n assert(nodes[u].ch.size() <= 2);\n if (nodes[u].ch.size() == 2) {\n int x = nodes[u].ch[0], y = nodes[u].ch[1];\n assert(nodes[u].bag == nodes[x].bag and nodes[u].bag == nodes[y].bag);\n } else if (nodes[u].ch.size() == 1) {\n int x = nodes[u].ch[0];\n std::vector<int> d;\n std::set_symmetric_difference(nodes[u].bag.begin(), nodes[u].bag.end(), nodes[x].bag.begin(), nodes[x].bag.end(), std::back_inserter(d));\n assert(d.size() == 1);\n } else {\n assert(nodes[u].bag.size() == 1);\n }\n };\n dfs(dfs, root);\n }\n private:\n int _n;\n std::vector<std::pair<int, int>> _edges;\n\n static int remove_edge(std::vector<std::vector<std::pair<int, int>>>& g, int u, int idx_uv) {\n auto [v, idx_vu] = g[u][idx_uv];\n\n if (idx_vu != int(g[v].size()) - 1) {\n auto [w, idx_wv] = g[v].back();\n std::swap(g[v][idx_vu], g[v].back());\n g[w][idx_wv].second = idx_vu;\n }\n g[v].pop_back();\n if (idx_uv != int(g[u].size()) - 1) {\n auto [z, idx_zu] = g[u].back();\n std::swap(g[u][idx_uv], g[u].back());\n g[z][idx_zu].second = idx_uv;\n }\n g[u].pop_back();\n\n remove_multiedges(g, v, idx_vu);\n remove_multiedges(g, u, idx_uv);\n\n return v;\n }\n static void remove_multiedges(std::vector<std::vector<std::pair<int, int>>>& g, int u, int idx_uv) {\n auto is_unnecessary = [&](int idx_uv) {\n const int du = int(g[u].size());\n if (idx_uv >= du) return false;\n if (idx_uv + 1 < du and g[u][idx_uv].first == g[u][idx_uv + 1].first) return true;\n if (idx_uv + 2 < du and g[u][idx_uv].first == g[u][idx_uv + 2].first) return true;\n if (idx_uv - 1 >= 0 and g[u][idx_uv].first == g[u][idx_uv - 1].first) return true;\n if (idx_uv - 2 >= 0 and g[u][idx_uv].first == g[u][idx_uv - 2].first) return true;\n return false;\n };\n while (is_unnecessary(idx_uv)) remove_edge(g, u, idx_uv);\n }\n };\n} // namespace suisen\n\nnamespace suisen {\n enum class NodeType {\n LEAF,\n INTRODUCE,\n FORGET,\n JOIN\n };\n\n struct NiceDecompTree {\n static constexpr int root = 0;\n\n NiceDecompTree() = default;\n NiceDecompTree(std::vector<DecompNodeRooted>&& nodes) : _n(nodes.size()), _nodes(std::move(nodes)), _pst(_n, -1) {}\n NiceDecompTree(const std::vector<DecompNodeRooted>& nodes) : _n(nodes.size()), _nodes(nodes), _pst(_n, -1) {}\n NiceDecompTree(int n, const std::vector<std::pair<int, int>>& edges) : NiceDecompTree(*TreeDecompositionTW2{ n, edges }.nice_decomp()) {}\n NiceDecompTree(const std::vector<std::vector<int>>& g) : NiceDecompTree(*TreeDecompositionTW2{ g }.nice_decomp()) {}\n\n int size() const { return _n; }\n\n NodeType get_node_type(int i) const {\n if (_nodes[i].ch.size() == 0) return NodeType::LEAF;\n if (_nodes[i].ch.size() == 2) return NodeType::JOIN;\n if (_nodes[i].bag.size() > _nodes[_nodes[i].ch[0]].bag.size()) return NodeType::INTRODUCE;\n return NodeType::FORGET;\n }\n std::vector<NodeType> get_node_types() const {\n std::vector<NodeType> types(_n);\n for (int i = 0; i < _n; ++i) types[i] = get_node_type(i);\n return types;\n }\n\n const DecompNodeRooted& operator[](int i) const { return _nodes[i]; }\n DecompNodeRooted& operator[](int i) { return _nodes[i]; }\n\n template <typename T> T run_dp(\n std::function<T(const DecompNodeRooted& node, int leaf_vertex)> leaf,\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node, const T& child_result, int introduce_vertex)> introduce,\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node, const T& child_result, int forget_vertex)> forget,\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node_1, const T& child_result_1, const DecompNodeRooted& child_node_2, const T& child_result_2)> join\n ) const {\n prepare_post_order();\n std::vector<T> dp(_n);\n for (int i : _pst) {\n dp[i] = [&, this] {\n switch (get_node_type(i)) {\n case NodeType::LEAF:\n {\n return leaf(_nodes[i], _nodes[i].bag[0]);\n }\n case NodeType::INTRODUCE:\n {\n int j = _nodes[i].ch[0];\n int sj = _nodes[j].bag.size();\n int v = _nodes[i].bag[sj];\n for (int k = 0; k < sj; ++k) if (_nodes[i].bag[k] != _nodes[j].bag[k]) {\n v = _nodes[i].bag[k];\n break;\n }\n return introduce(_nodes[i], _nodes[j], dp[j], v);\n }\n case NodeType::FORGET:\n {\n int j = _nodes[i].ch[0];\n int si = _nodes[i].bag.size();\n int v = _nodes[j].bag[si];\n for (int k = 0; k < si; ++k) if (_nodes[i].bag[k] != _nodes[j].bag[k]) {\n v = _nodes[j].bag[k];\n break;\n }\n return forget(_nodes[i], _nodes[j], dp[j], v);\n }\n case NodeType::JOIN:\n {\n int j = _nodes[i].ch[0], k = _nodes[i].ch[1];\n return join(_nodes[i], _nodes[j], dp[j], _nodes[k], dp[k]);\n }\n default:\n {\n assert(false);\n }\n }\n }();\n }\n return dp[root];\n }\n\n private:\n int _n;\n std::vector<DecompNodeRooted> _nodes;\n\n mutable std::vector<int> _pst;\n\n void prepare_post_order() const {\n if (_pst.empty() or _pst.front() >= 0) return;\n auto it = _pst.begin();\n std::vector<std::size_t> eid(_n, 0);\n for (int cur = root; cur >= 0;) {\n if (eid[cur] == _nodes[cur].ch.size()) {\n *it++ = cur;\n cur = _nodes[cur].par;\n } else {\n cur = _nodes[cur].ch[eid[cur]++];\n }\n }\n }\n };\n} // namespace suisen\n\nusing match = std::pair<int, int>;\nusing table_key = std::vector<match>;\nusing table_value = long long;\nusing table_entry = std::pair<table_key, table_value>;\nusing table = std::map<table_key, long long>;\n\nstruct state {\n static constexpr int Forgotten = -2;\n static constexpr int None = -1;\n table mp;\n};\n\nvoid solve() {\n using namespace suisen;\n\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int n, m;\n std::cin >> n >> m;\n\n if (n == 0 and m == 0) exit(0);\n\n std::vector<std::set<int>> adj(n);\n\n std::vector<std::pair<int, int>> edges;\n for (int i = 0; i < n; ++i) {\n edges.emplace_back(i, (i + 1) % n);\n }\n for (int i = 0; i < m; ++i) {\n int u, v;\n std::cin >> u >> v;\n --u, --v;\n edges.emplace_back(u, v);\n }\n\n for (const auto &[u, v] : edges) {\n adj[u].insert(v);\n adj[v].insert(u);\n }\n\n auto leaf = [&](const DecompNodeRooted&, int leaf_vertex) -> state {\n return state { table{ table_entry{ table_key{ match{ leaf_vertex, state::None } }, table_value{ 1 } } } };\n };\n auto introduce = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result, int introduce_vertex) -> state {\n table ndp;\n for (auto [matching, val] : child_result.mp) {\n {\n auto nxt_matching = matching;\n nxt_matching.emplace_back(introduce_vertex, state::None);\n std::sort(nxt_matching.begin(), nxt_matching.end());\n ndp[nxt_matching] += val;\n }\n const int k = matching.size();\n for (int i = 0; i < k; ++i) {\n auto [u, v] = matching[i];\n if (v != state::None or adj[introduce_vertex].find(u) == adj[introduce_vertex].end()) continue;\n auto nxt_matching = matching;\n nxt_matching[i].second = introduce_vertex;\n nxt_matching.emplace_back(introduce_vertex, u);\n std::sort(nxt_matching.begin(), nxt_matching.end());\n ndp[nxt_matching] += val;\n }\n }\n for (auto &[_, val] : ndp) val %= mod;\n return state { ndp };\n };\n auto forget = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result, int forget_vertex) -> state {\n table ndp;\n for (auto [matching, val] : child_result.mp) {\n bool ok = true;\n table_key nxt_matching;\n for (auto [u, v] : matching) {\n if (u == forget_vertex) {\n ok &= v != state::None;\n continue;\n }\n if (v == forget_vertex) {\n nxt_matching.emplace_back(u, state::Forgotten);\n } else {\n nxt_matching.emplace_back(u, v);\n }\n }\n if (not ok) {\n continue;\n }\n std::sort(nxt_matching.begin(), nxt_matching.end());\n ndp[nxt_matching] += val;\n }\n for (auto &[_, val] : ndp) val %= mod;\n return state { ndp };\n };\n auto join = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result_1, const DecompNodeRooted&, const state& child_result_2) -> state {\n table ndp;\n for (auto [matching1, val1] : child_result_1.mp) for (auto [matching2, val2] : child_result_2.mp) {\n bool ok = true;\n const int k = matching1.size();\n table_key nxt_matching;\n for (int i = 0; i < k; ++i) {\n auto [u1, v1] = matching1[i];\n auto [u2, v2] = matching2[i];\n assert(u1 == u2);\n if (v1 > v2) std::swap(v1, v2);\n if (v1 == state::Forgotten) {\n if (v2 == state::Forgotten) {\n ok = false;\n break;\n } else if (v2 == state::None) {\n nxt_matching.emplace_back(u1, v1);\n } else {\n ok = false;\n break;\n }\n } else if (v1 == state::None) {\n if (v2 == state::None) {\n nxt_matching.emplace_back(u1, v1);\n } else {\n ok = false;\n break;\n }\n } else {\n if (v1 != v2) {\n ok = false;\n break;\n } else {\n nxt_matching.emplace_back(u1, v1);\n }\n }\n if (not ok) break;\n }\n if (ok) {\n std::sort(nxt_matching.begin(), nxt_matching.end());\n ndp[nxt_matching] += val1 * val2;\n }\n }\n for (auto &[_, val] : ndp) val %= mod;\n return state { ndp };\n };\n\n state dp_root = NiceDecompTree(n, edges).run_dp<state>(leaf, introduce, forget, join);\n\n long long ans = 0;\n for (auto [matching, val] : dp_root.mp) {\n bool ok = true;\n for (auto &[u, v] : matching) {\n if (v == state::None) {\n ok = false;\n break;\n }\n }\n if (ok) {\n ans += val;\n }\n }\n\n std::cout << ans % mod << std::endl;\n}\n\nint main() {\n while (true) solve();\n}","accuracy":1,"time_ms":1200,"memory_kb":103696,"score_of_the_acc":-1.1698,"final_rank":20},{"submission_id":"aoj_2405_6000386","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 = 1000003;;\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-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 << 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\n\n\n\nint n, m;\nvoid solve() {\n\tvector<P> vp;\n\tvp.push_back({ 0,n - 1 });\n\trep(i, m) {\n\t\tint l, r; cin >> l >> r; l--; r--;\n\t\tif (l > r)swap(l, r);\n\t\tvp.push_back({ l,r });\n\t}\n\tauto comp = [&](P a, P b) {\n\t\treturn a.first != b.first ? a.first < b.first : a.second > b.second;\n\t};\n\tsort(all(vp), comp);\n\tvector<vector<int>> G(vp.size());\n\tvector<int> ind;\n\trep(i, vp.size()) {\n\t\twhile (ind.size() && vp[ind.back()].second <= vp[i].first)ind.pop_back();\n\t\tif (ind.size()) {\n\t\t\t//cout << \"? \" << ind.back() << \" \" << i << \"\\n\";\n\t\t\tG[ind.back()].push_back(i);\n\t\t}\n\t\tind.push_back(i);\n\t}\n\t//cout << G[0].size() << \"\\n\";\n\tusing ar = array<modint, 4>;\n\tfunction<ar(int)> dfs = [&](int id)->ar {\n\t\tint l = vp[id].first;\n\t\tint r = vp[id].second;\n\t\tar res;\n\t\tif (G[id].empty()) {\n\t\t\tif ((l + r) % 2) {\n\t\t\t\tres = { 1,0,0,1 };\n\t\t\t}\n\t\t\telse {\n\t\t\t\tres = { 0,1,1,0 };\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\trep(i, G[id].size()) {\n\t\t\t\tint to = G[id][i];\n\t\t\t\tar nex = dfs(to);\n\t\t\t\tif (i == 0) {\n\t\t\t\t\tres = nex;\n\t\t\t\t\t//cout << \"! \" << id << \" \" <<to<<\" \"<< vp[to].first << \" \" << l << \"\\n\";\n\t\t\t\t\tif ((vp[to].first + l) % 2) {\n\t\t\t\t\t\tswap(res[0], res[1]);\n\t\t\t\t\t\tswap(res[2], res[3]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tar ndp; rep(j, 4)ndp[j] = 0;\n\t\t\t\t\trep(j, 4) {\n\t\t\t\t\t\trep(k, 4) {\n\t\t\t\t\t\t\tint c = vp[to].first - vp[G[id][i - 1]].second + 1;\n\t\t\t\t\t\t\tc %= 2;\n\t\t\t\t\t\t\tif (j & 2)c ^= 1;\n\t\t\t\t\t\t\tif (k & 1)c ^= 1;\n\t\t\t\t\t\t\tif (c)continue;\n\t\t\t\t\t\t\tint nj = 0;\n\t\t\t\t\t\t\tif (j & 1)nj |= 1;\n\t\t\t\t\t\t\tif (k & 2)nj |= 2;\n\t\t\t\t\t\t\tndp[nj] += res[j]*nex[k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tswap(res, ndp);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint las = vp[G[id].back()].second;\n\t\t\tif((r + las) % 2) {\n\t\t\t\tswap(res[0], res[2]);\n\t\t\t\tswap(res[1], res[3]);\n\t\t\t}\n\t\t}\n\t\tres[3] += res[0];\n\t\t//cout << \"? \" << id;\n\t\t//rep(j, 4)cout << \" \" << res[j];\n\t\t//cout << \"\\n\";\n\t\treturn res;\n\t};\n\tar a = dfs(0);\n\tcout << a[3] << \"\\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\twhile(cin>>n>>m,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":12640,"score_of_the_acc":-0.0628,"final_rank":5},{"submission_id":"aoj_2405_5948566","code_snippet":"#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\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 i = 0; i < (x); ++i)\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 REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate <class T = int>\nusing V = std::vector<T>;\ntemplate <class T = int>\nusing VV = std::vector<std::vector<T>>;\ntemplate <class T>\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair<int, int>;\nusing pll = std::pair<long long, long long>;\n\n// input macro\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate <class T, class U>\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\ntemplate <class T>\nvoid scan(std::vector<T> &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate <class Head, class... Tail>\nvoid INPUT(Head &head, Tail &... tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector<type> name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector<std::vector<type>> name(h, std::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\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate <class T>\nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate <class Head, class... Tail>\nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate <class T>\nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate <class T>\nvoid printel(const std::vector<T> &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate <class Head, class... Tail>\nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate <class T>\nvoid view(const std::vector<T> &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate <class T>\nvoid view(const std::vector<std::vector<T>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::vector<std::pair<T, U>> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::map<T, U> &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate <class T, class U>\nvoid view(const std::pair<T, U> &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate <class T>\nvoid view(const std::set<T> &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate <class T>\nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n\tdebugger::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(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate <class T>\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate <class T>\nvoid UNIQUE(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<T> press(std::vector<T> &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate <class T>\nvoid ADD(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate <class T>\nvoid SUB(std::vector<T> &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector<std::pair<char, int>> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector<std::pair<char, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate <class T>\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\n\tint n = v.size();\n\tstd::vector<std::pair<T, int>> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector<int> iota(int n) {\n\tstd::vector<int> p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate <class T>\nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate <class U>\n\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector<T> cum;\n};\n\n// math macro\ntemplate <class T, class U>\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate <class T, class U>\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate <class T>\nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate <class T>\nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate <class T, class F>\nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 1 \"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\"\n\n\n\n#line 6 \"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\"\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#line 1 \"/Users/nok0/Documents/Programming/nok0/atcoder/internal_math.hpp\"\n\n\n\n#line 5 \"/Users/nok0/Documents/Programming/nok0/atcoder/internal_math.hpp\"\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 1 \"/Users/nok0/Documents/Programming/nok0/atcoder/internal_type_traits.hpp\"\n\n\n\n#line 7 \"/Users/nok0/Documents/Programming/nok0/atcoder/internal_type_traits.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 14 \"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 4 \"/Users/nok0/Documents/Programming/nok0/math/factorial.hpp\"\n\n#line 6 \"/Users/nok0/Documents/Programming/nok0/math/factorial.hpp\"\n\ntemplate <class T>\nstruct factorial {\npublic:\n\tstatic int MAX;\n\tstatic std::vector<T> fac, finv, inv;\n\n\tfactorial() {}\n\n\tT binom(int n, int r) {\n\t\tif(n < r or n < 0 or r < 0) return T(0);\n\t\tassert(n < MAX);\n\t\treturn fac[n] * finv[r] * finv[n - r];\n\t}\n\n\tT large_binom(int n, int r) {\n\t\tif(n < r or n < 0 or r < 0) return T(0);\n\t\tassert(r < MAX);\n\t\tT ret = finv[r];\n\t\tfor(int i = 1; i <= r; ++i)\n\t\t\tret *= (n + 1 - i);\n\t\treturn ret;\n\t}\n\n\tstatic void set_size(int n = 3000000) {\n\t\tMAX = (n > 1 ? n : 1) + 1;\n\t\tif((int)fac.size() >= MAX) return;\n\t\tfac.resize(MAX);\n\t\tfinv.resize(MAX);\n\t\tinv.resize(MAX);\n\t\tconst int MOD = T::mod();\n\t\tfac[0] = fac[1] = 1;\n\t\tfinv[0] = finv[1] = 1;\n\t\tinv[1] = 1;\n\t\tfor(int i = 2; i < MAX; i++) {\n\t\t\tfac[i] = fac[i - 1] * i;\n\t\t\tinv[i] = (T)MOD - inv[MOD % i] * (MOD / i);\n\t\t\tfinv[i] = finv[i - 1] * inv[i];\n\t\t}\n\t}\n};\ntemplate <class T>\nint factorial<T>::MAX = 0;\ntemplate <class T>\nstd::vector<T> factorial<T>::fac;\ntemplate <class T>\nstd::vector<T> factorial<T>::finv;\ntemplate <class T>\nstd::vector<T> factorial<T>::inv;\n#line 2 \"/Users/nok0/Documents/Programming/nok0/math/modint_iostream.hpp\"\n\n#line 4 \"/Users/nok0/Documents/Programming/nok0/math/modint_iostream.hpp\"\ntemplate <int m>\nstd::istream &std::operator>>(std::istream &is, atcoder::static_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &std::operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::ostream &std::operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &std::operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#line 3 \"f.cpp\"\n\nusing mint = atcoder::static_modint<1000003>;\n\nvoid main_() {\n\twhile(1) {\n\t\tINT(n, m);\n\t\tif(n & 1) {\n\t\t\tprint(0);\n\t\t\tcontinue;\n\t\t}\n\t\tV<pii> uv(m);\n\t\tif(!n) break;\n\t\tauto f_hash = [n](int l, int r) {\n\t\t\treturn (ll)l * n + r;\n\t\t};\n\t\tunordered_set<ll> es;\n\t\tvector<vector<int>> valid(n);\n\t\tREP(i, n - 1) {\n\t\t\tvalid[i].pb(i + 1);\n\t\t}\n\t\tREP(i, m) {\n\t\t\tINT(u, v);\n\t\t\t--u, --v;\n\t\t\tif(u > v) swap(u, v);\n\t\t\tes.insert(f_hash(u, v));\n\t\t\tuv[i] = {u, v};\n\t\t\tif((v - u) & 1) {\n\t\t\t\tvalid[u].pb(v);\n\t\t\t\tvalid[v].pb(u);\n\t\t\t}\n\t\t}\n\t\tREP(i, n) {\n\t\t\tSORT(valid[i]);\n\t\t}\n\t\tauto dp = [&](auto dp, int l, int r) -> mint {\n\t\t\tif(l + 1 == r) return 1;\n\t\t\tll h = f_hash(l, r);\n\t\t\tmint ret = 0;\n\t\t\tif(es.count(h)) ret += dp(dp, l + 1, r - 1);\n\t\t\tint x = lb(valid[l], r) - 1;\n\t\t\tif(x >= 0 and x < SZ(valid[l]) and valid[l][x] >= l) {\n\t\t\t\tret += dp(dp, l, valid[l][x]) * dp(dp, valid[l][x] + 1, r);\n\t\t\t}\n\t\t\treturn ret;\n\t\t};\n\t\tmint res = 0;\n\t\tres += dp(dp, 1, n - 2);\n\t\tif(SZ(valid[0])) {\n\t\t\tint x = valid[0].back();\n\t\t\tif(x != n - 1) {\n\t\t\t\tres += dp(dp, 0, x) * dp(dp, x + 1, n - 1);\n\t\t\t}\n\t\t}\n\t\tprint(res);\n\t}\n}","accuracy":1,"time_ms":6970,"memory_kb":11384,"score_of_the_acc":-1.0484,"final_rank":19},{"submission_id":"aoj_2405_5405430","code_snippet":"#line 1 \"other/sister.cpp\"\n// #undef _GLIBCXX_DEBUG\n// #define NDEBUG\n#include <bits/extc++.h>\n\n#line 2 \"Library/lib/alias\"\n\n/**\n * @file alias\n * @brief Alias\n */\n\n#line 13 \"Library/lib/alias\"\n\n#line 2 \"Library/lib/bit\"\n\n#if __cplusplus > 201703L\n\n#include <bit>\n\n#else\n\n#ifndef _GLIBCXX_BIT\n#define _GLIBCXX_BIT 1\n\n#include <limits>\n#include <type_traits>\n\nnamespace std {\n\ntemplate <typename _Tp> constexpr int __countl_zero(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n\n if (__x == 0) return _Nd;\n\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\n\n if\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u) {\n constexpr int __diff = _Nd_u - _Nd;\n return __builtin_clz(__x) - __diff;\n }\n else if\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) {\n constexpr int __diff = _Nd_ul - _Nd;\n return __builtin_clzl(__x) - __diff;\n }\n else if\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) {\n constexpr int __diff = _Nd_ull - _Nd;\n return __builtin_clzll(__x) - __diff;\n }\n else // (_Nd > _Nd_ull)\n {\n static_assert(_Nd <= (2 * _Nd_ull),\n \"Maximum supported integer size is 128-bit\");\n\n unsigned long long __high = __x >> _Nd_ull;\n if (__high != 0) {\n constexpr int __diff = (2 * _Nd_ull) - _Nd;\n return __builtin_clzll(__high) - __diff;\n }\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\n unsigned long long __low = __x & __max_ull;\n return (_Nd - _Nd_ull) + __builtin_clzll(__low);\n }\n}\n\ntemplate <typename _Tp> constexpr int __countr_zero(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n\n if (__x == 0) return _Nd;\n\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\n\n if\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u)\n return __builtin_ctz(__x);\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) return __builtin_ctzl(__x);\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) return __builtin_ctzll(__x);\n else // (_Nd > _Nd_ull)\n {\n static_assert(_Nd <= (2 * _Nd_ull),\n \"Maximum supported integer size is 128-bit\");\n\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\n unsigned long long __low = __x & __max_ull;\n if (__low != 0) return __builtin_ctzll(__low);\n unsigned long long __high = __x >> _Nd_ull;\n return __builtin_ctzll(__high) + _Nd_ull;\n }\n}\n\ntemplate <typename _Tp> constexpr int __popcount(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n\n if (__x == 0) return 0;\n\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\n\n if\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u)\n return __builtin_popcount(__x);\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) return __builtin_popcountl(__x);\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) return __builtin_popcountll(__x);\n else // (_Nd > _Nd_ull)\n {\n static_assert(_Nd <= (2 * _Nd_ull),\n \"Maximum supported integer size is 128-bit\");\n\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\n unsigned long long __low = __x & __max_ull;\n unsigned long long __high = __x >> _Nd_ull;\n return __builtin_popcountll(__low) + __builtin_popcountll(__high);\n }\n}\n\ntemplate <typename _Tp> constexpr _Tp __bit_ceil(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n if (__x == 0 || __x == 1) return 1;\n auto __shift_exponent = _Nd - __countl_zero((_Tp)(__x - 1u));\n#ifdef _GLIBCXX_HAVE_BUILTIN_IS_CONSTANT_EVALUATED\n if (!__builtin_is_constant_evaluated()) {\n __glibcxx_assert(__shift_exponent != numeric_limits<_Tp>::digits);\n }\n#endif\n using __promoted_type = decltype(__x << 1);\n if\n _GLIBCXX17_CONSTEXPR(!is_same<__promoted_type, _Tp>::value) {\n const int __extra_exp = sizeof(__promoted_type) / sizeof(_Tp) / 2;\n __shift_exponent |= (__shift_exponent & _Nd) << __extra_exp;\n }\n return (_Tp)1u << __shift_exponent;\n}\n\ntemplate <typename _Tp> constexpr _Tp __bit_floor(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n if (__x == 0) return 0;\n return (_Tp)1u << (_Nd - __countl_zero((_Tp)(__x >> 1)));\n}\n\ntemplate <typename _Tp> constexpr _Tp __bit_width(_Tp __x) noexcept {\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\n return _Nd - __countl_zero(__x);\n}\n\n} // namespace std\n\n#endif\n\n#endif\n#line 2 \"Library/lib/limits\"\n\n#line 4 \"Library/lib/limits\"\n\nnamespace workspace {\n\ntemplate <class _Tp> struct numeric_limits : std::numeric_limits<_Tp> {};\n\n#ifdef __SIZEOF_INT128__\n\ntemplate <> struct numeric_limits<__uint128_t> {\n constexpr static __uint128_t max() { return ~__uint128_t(0); }\n constexpr static __uint128_t min() { return 0; }\n};\n\ntemplate <> struct numeric_limits<__int128_t> {\n constexpr static __int128_t max() {\n return numeric_limits<__uint128_t>::max() >> 1;\n }\n constexpr static __int128_t min() { return -max() - 1; }\n};\n\n#endif\n\n} // namespace workspace\n#line 16 \"Library/lib/alias\"\n\nnamespace workspace {\n\nconstexpr char eol = '\\n';\n\nusing namespace std;\n\nusing i32 = int_least32_t;\nusing u32 = uint_least32_t;\nusing i64 = int_least64_t;\nusing u64 = uint_least64_t;\n\n#ifdef __SIZEOF_INT128__\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n#else\n#warning 128bit integer is not available.\n#endif\n\nnamespace _alias_impl {\n\ntemplate <class> struct first_arg { using type = void; };\n\ntemplate <class _Tp, class = void> struct parse_comp : first_arg<_Tp> {};\n\ntemplate <class _Tp>\nstruct parse_comp<_Tp, std::__void_t<decltype(&_Tp::operator())>>\n : first_arg<decltype(&_Tp::operator())> {};\n\ntemplate <class _R, class _Tp, class... _Args>\nstruct first_arg<_R(_Tp, _Args...)> {\n using type = _Tp;\n};\n\ntemplate <class _R, class _Tp, class... _Args>\nstruct first_arg<_R (*)(_Tp, _Args...)> {\n using type = _Tp;\n};\n\ntemplate <class _G, class _R, class _Tp, class... _Args>\nstruct first_arg<_R (_G::*)(_Tp, _Args...)> {\n using type = _Tp;\n};\n\ntemplate <class _G, class _R, class _Tp, class... _Args>\nstruct first_arg<_R (_G::*)(_Tp, _Args...) const> {\n using type = _Tp;\n};\n\n} // namespace _alias_impl\n\ntemplate <class _Tp = void, class _Compare = std::less<_Tp>>\ndecltype(auto) make_priority_queue(_Compare __x = _Compare()) noexcept {\n using type = std::conditional_t<\n std::is_void<_Tp>::value,\n std::decay_t<typename _alias_impl::parse_comp<_Compare>::type>, _Tp>;\n\n return std::priority_queue<type, std::vector<type>, _Compare>(__x);\n}\n\ntemplate <class _Tp = void, class _Compare = std::less<_Tp>>\ndecltype(auto) make_set(_Compare __x = _Compare()) noexcept {\n using type = std::conditional_t<\n std::is_void<_Tp>::value,\n std::decay_t<typename _alias_impl::parse_comp<_Compare>::type>, _Tp>;\n\n return std::set<type, _Compare>(__x);\n}\n\ntemplate <class _Key, class _Mapped, class _Compare = std::less<_Key>>\ndecltype(auto) make_map(_Compare __x = _Compare()) noexcept {\n return std::map<_Key, _Mapped, _Compare>(__x);\n}\n\ntemplate <class _T1, class _T2,\n typename = decltype(std::declval<const _T2 &>() <\n std::declval<const _T1 &>())>\nconstexpr\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\n typename std::common_type<_T1, _T2>::type>::type\n min(const _T1 &__x, const _T2 &__y) noexcept {\n return __y < __x ? __y : __x;\n}\n\ntemplate <class _T1, class _T2, class _Compare,\n typename = decltype(std::declval<_Compare>()(\n std::declval<const _T2 &>(), std::declval<const _T1 &>()))>\nconstexpr\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\n typename std::common_type<_T1, _T2>::type>::type\n min(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {\n return __comp(__y, __x) ? __y : __x;\n}\n\ntemplate <class _Tp, typename = decltype(std::declval<const _Tp &>() <\n std::declval<const _Tp &>())>\nconstexpr _Tp min(std::initializer_list<_Tp> __x) noexcept {\n return *std::min_element(__x.begin(), __x.end());\n}\n\ntemplate <class _Tp, class _Compare,\n typename = decltype(std::declval<_Compare>()(\n std::declval<const _Tp &>(), std::declval<const _Tp &>()))>\nconstexpr _Tp min(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {\n return *std::min_element(__x.begin(), __x.end(), __comp);\n}\n\ntemplate <class _T1, class _T2,\n typename = decltype(std::declval<const _T1 &>() <\n std::declval<const _T2 &>())>\n\nconstexpr\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\n typename std::common_type<_T1, _T2>::type>::type\n max(const _T1 &__x, const _T2 &__y) noexcept {\n return __x < __y ? __y : __x;\n}\n\ntemplate <class _T1, class _T2, class _Compare,\n typename = decltype(std::declval<_Compare>()(\n std::declval<const _T1 &>(), std::declval<const _T2 &>()))>\nconstexpr\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\n typename std::common_type<_T1, _T2>::type>::type\n max(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {\n return __comp(__x, __y) ? __y : __x;\n}\n\ntemplate <class _Tp, typename = decltype(std::declval<const _Tp &>() <\n std::declval<const _Tp &>())>\nconstexpr _Tp max(std::initializer_list<_Tp> __x) noexcept {\n return *std::max_element(__x.begin(), __x.end());\n}\n\ntemplate <class _Tp, class _Compare,\n typename = decltype(std::declval<_Compare>()(\n std::declval<const _Tp &>(), std::declval<const _Tp &>()))>\nconstexpr _Tp max(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {\n return *std::max_element(__x.begin(), __x.end(), __comp);\n}\n\ntemplate <typename _Tp> constexpr _Tp __bsf(_Tp __x) noexcept {\n return std::__countr_zero(__x);\n}\n\ntemplate <typename _Tp> constexpr _Tp __bsr(_Tp __x) noexcept {\n return std::__bit_width(__x) - 1;\n}\n\n} // namespace workspace\n#line 2 \"Library/src/modular/modint.hpp\"\n\n/**\n * @file modint.hpp\n *\n * @brief Modular Arithmetic\n */\n\n#line 12 \"Library/src/modular/modint.hpp\"\n\n#line 2 \"Library/src/number_theory/sqrt_mod.hpp\"\n\n/**\n * @file sqrt_mod.hpp\n * @brief Tonelli-Shanks Algorithm\n */\n\n#line 2 \"Library/src/number_theory/pow_mod.hpp\"\n\n/**\n * @file mod_pow.hpp\n * @brief Modular Exponentiation\n */\n\n#line 9 \"Library/src/number_theory/pow_mod.hpp\"\n\n#line 2 \"Library/src/utils/sfinae.hpp\"\n\n/**\n * @file sfinae.hpp\n * @brief SFINAE\n */\n\n#line 10 \"Library/src/utils/sfinae.hpp\"\n#include <type_traits>\n\n#ifndef __INT128_DEFINED__\n\n#ifdef __SIZEOF_INT128__\n#define __INT128_DEFINED__ 1\n#else\n#define __INT128_DEFINED__ 0\n#endif\n\n#endif\n\nnamespace std {\n\n#if __INT128_DEFINED__\n\ntemplate <> struct make_signed<__uint128_t> { using type = __int128_t; };\ntemplate <> struct make_signed<__int128_t> { using type = __int128_t; };\n\ntemplate <> struct make_unsigned<__uint128_t> { using type = __uint128_t; };\ntemplate <> struct make_unsigned<__int128_t> { using type = __uint128_t; };\n\ntemplate <> struct is_signed<__uint128_t> : std::false_type {};\ntemplate <> struct is_signed<__int128_t> : std::true_type {};\n\ntemplate <> struct is_unsigned<__uint128_t> : std::true_type {};\ntemplate <> struct is_unsigned<__int128_t> : std::false_type {};\n\n#endif\n\n} // namespace std\n\nnamespace workspace {\n\ntemplate <class Tp, class... Args> struct variadic_front { using type = Tp; };\n\ntemplate <class... Args> struct variadic_back;\n\ntemplate <class Tp> struct variadic_back<Tp> { using type = Tp; };\n\ntemplate <class Tp, class... Args> struct variadic_back<Tp, Args...> {\n using type = typename variadic_back<Args...>::type;\n};\n\ntemplate <class type, template <class> class trait>\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\n\n/**\n * @brief Return type of subscripting ( @c [] ) access.\n */\ntemplate <class _Tp>\nusing subscripted_type =\n typename std::decay<decltype(std::declval<_Tp&>()[0])>::type;\n\ntemplate <class Container>\nusing element_type = typename std::decay<decltype(\n *std::begin(std::declval<Container&>()))>::type;\n\ntemplate <class _Tp, class = std::nullptr_t>\nstruct has_begin : std::false_type {};\n\ntemplate <class _Tp>\nstruct has_begin<_Tp, decltype(std::begin(std::declval<_Tp>()), nullptr)>\n : std::true_type {};\n\ntemplate <class _Tp, class = std::nullptr_t>\nstruct has_mod : std::false_type {};\n\ntemplate <class _Tp>\nstruct has_mod<_Tp, decltype(_Tp::mod, nullptr)> : std::true_type {};\n\ntemplate <class _Tp, class = void> struct is_integral_ext : std::false_type {};\ntemplate <class _Tp>\nstruct is_integral_ext<\n _Tp, typename std::enable_if<std::is_integral<_Tp>::value>::type>\n : std::true_type {};\n\n#if __INT128_DEFINED__\n\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\n\n#endif\n\n#if __cplusplus >= 201402\n\ntemplate <class _Tp>\nconstexpr static bool is_integral_ext_v = is_integral_ext<_Tp>::value;\n\n#endif\n\ntemplate <typename _Tp, typename = void> struct multiplicable_uint {\n using type = uint_least32_t;\n};\ntemplate <typename _Tp>\nstruct multiplicable_uint<\n _Tp,\n typename std::enable_if<(2 < sizeof(_Tp)) &&\n (!__INT128_DEFINED__ || sizeof(_Tp) <= 4)>::type> {\n using type = uint_least64_t;\n};\n\n#if __INT128_DEFINED__\n\ntemplate <typename _Tp>\nstruct multiplicable_uint<_Tp,\n typename std::enable_if<(4 < sizeof(_Tp))>::type> {\n using type = __uint128_t;\n};\n\n#endif\n\ntemplate <typename _Tp> struct multiplicable_int {\n using type =\n typename std::make_signed<typename multiplicable_uint<_Tp>::type>::type;\n};\n\ntemplate <typename _Tp> struct multiplicable {\n using type = std::conditional_t<\n is_integral_ext<_Tp>::value,\n std::conditional_t<std::is_signed<_Tp>::value,\n typename multiplicable_int<_Tp>::type,\n typename multiplicable_uint<_Tp>::type>,\n _Tp>;\n};\n\n} // namespace workspace\n#line 11 \"Library/src/number_theory/pow_mod.hpp\"\n\nnamespace workspace {\n\n/**\n * @brief Compile time modular exponentiation.\n *\n * @param __x\n * @param __n Exponent\n * @param __mod Modulus\n * @return\n */\ntemplate <class _Tp>\nconstexpr std::enable_if_t<(is_integral_ext<_Tp>::value), _Tp> pow_mod(\n _Tp __x, _Tp __n, _Tp __mod) noexcept {\n assert(__mod > 0);\n\n using mul_type = typename multiplicable_uint<_Tp>::type;\n\n if ((__x %= __mod) < 0) __x += __mod;\n\n mul_type __y{1};\n\n while (__n) {\n if (__n & 1) (__y *= __x) %= __mod;\n __x = (mul_type)__x * __x % __mod;\n __n >>= 1;\n }\n\n return __y;\n};\n\n} // namespace workspace\n#line 10 \"Library/src/number_theory/sqrt_mod.hpp\"\n\nnamespace workspace {\n\n/**\n * @brief Compile time modular square root.\n *\n * @param __x\n * @param __mod Modulus\n * @return One if it exists. Otherwise -1.\n */\ntemplate <class _Tp>\nconstexpr std::enable_if_t<(is_integral_ext<_Tp>::value), _Tp> sqrt_mod(\n _Tp __x, _Tp __mod) noexcept {\n assert(__mod > 0);\n\n using mul_type = typename multiplicable_uint<_Tp>::type;\n\n if ((__x %= __mod) < 0) __x += __mod;\n\n if (!__x) return 0;\n\n if (__mod == 2) return __x;\n\n if (pow_mod(__x, __mod >> 1, __mod) != 1) return -1;\n\n _Tp __z = __builtin_ctz(__mod - 1), __q = __mod >> __z;\n\n mul_type __a = pow_mod(__x, (__q + 1) >> 1, __mod), __b = 2;\n while (pow_mod<_Tp>(__b, __mod >> 1, __mod) == 1) ++__b;\n __b = pow_mod<_Tp>(__b, __q, __mod);\n\n _Tp __shift = 0;\n\n for (auto __r = __a * __a % __mod * pow_mod(__x, __mod - 2, __mod) % __mod;\n __r != 1; (__r *= (__b *= __b) %= __mod) %= __mod) {\n auto __bsf = __z;\n\n for (auto __e = __r; __e != 1; --__bsf) (__e *= __e) %= __mod;\n\n while (++__shift != __bsf) (__b *= __b) %= __mod;\n\n (__a *= __b) %= __mod;\n }\n\n return __a;\n};\n\n} // namespace workspace\n#line 15 \"Library/src/modular/modint.hpp\"\n\nnamespace workspace {\n\nnamespace _modint_impl {\n\ntemplate <auto _Mod, unsigned _Storage> struct modint {\n static_assert(is_integral_ext<decltype(_Mod)>::value,\n \"_Mod must be integral type.\");\n\n using mod_type = std::make_signed_t<typename std::conditional<\n 0 < _Mod, std::add_const_t<decltype(_Mod)>, decltype(_Mod)>::type>;\n\n using value_type = std::decay_t<mod_type>;\n\n using mul_type = typename multiplicable_uint<value_type>::type;\n\n // Modulus\n static mod_type mod;\n\n static unsigned storage;\n\n private:\n value_type value = 0;\n\n struct direct_ctor_t {};\n constexpr static direct_ctor_t direct_ctor_tag{};\n\n // Direct constructor\n template <class _Tp>\n constexpr modint(_Tp __n, direct_ctor_t) noexcept : value(__n) {}\n\n public:\n constexpr modint() noexcept = default;\n\n template <class _Tp, typename = std::enable_if_t<is_integral_ext<_Tp>::value>>\n constexpr modint(_Tp __n) noexcept\n : value((__n %= mod) < 0 ? __n += mod : __n) {}\n\n constexpr modint(bool __n) noexcept : value(__n) {}\n\n constexpr operator value_type() const noexcept { return value; }\n\n // unary operators {{\n constexpr modint operator++(int) noexcept {\n modint __t{*this};\n operator++();\n return __t;\n }\n\n constexpr modint operator--(int) noexcept {\n modint __t{*this};\n operator--();\n return __t;\n }\n\n constexpr modint &operator++() noexcept {\n if (++value == mod) value = 0;\n return *this;\n }\n\n constexpr modint &operator--() noexcept {\n if (!value)\n value = mod - 1;\n else\n --value;\n return *this;\n }\n\n constexpr modint operator+() const noexcept { return *this; }\n\n constexpr modint operator-() const noexcept {\n return {value ? mod - value : 0, direct_ctor_tag};\n }\n\n // }} unary operators\n\n // operator+= {{\n\n constexpr modint &operator+=(const modint &__x) noexcept {\n if ((value += __x.value) >= mod) value -= mod;\n return *this;\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\n operator+=(_Tp const &__x) noexcept {\n if (((value += __x) %= mod) < 0) value += mod;\n return *this;\n }\n\n // }} operator+=\n\n // operator+ {{\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator+(_Tp const &__x) const noexcept {\n return modint{*this} += __x;\n }\n\n constexpr modint operator+(modint __x) const noexcept { return __x += *this; }\n\n template <class _Tp>\n constexpr friend\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator+(_Tp const &__x, modint __y) noexcept {\n return __y += __x;\n }\n\n // }} operator+\n\n // operator-= {{\n\n constexpr modint &operator-=(const modint &__x) noexcept {\n if ((value -= __x.value) < 0) value += mod;\n return *this;\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\n operator-=(_Tp __x) noexcept {\n if (((value -= __x) %= mod) < 0) value += mod;\n return *this;\n }\n\n // }} operator-=\n\n // operator- {{\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator-(_Tp const &__x) const noexcept {\n return modint{*this} -= __x;\n }\n\n constexpr modint operator-(const modint &__x) const noexcept {\n return modint{*this} -= __x;\n }\n\n template <class _Tp>\n constexpr friend\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator-(_Tp __x, const modint &__y) noexcept {\n if (((__x -= __y.value) %= mod) < 0) __x += mod;\n return {__x, direct_ctor_tag};\n }\n\n // }} operator-\n\n // operator*= {{\n\n constexpr modint &operator*=(const modint &__x) noexcept {\n value =\n static_cast<value_type>(value * static_cast<mul_type>(__x.value) % mod);\n return *this;\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\n operator*=(_Tp __x) noexcept {\n value = static_cast<value_type>(\n value * mul_type((__x %= mod) < 0 ? __x + mod : __x) % mod);\n return *this;\n }\n\n // }} operator*=\n\n // operator* {{\n\n constexpr modint operator*(const modint &__x) const noexcept {\n return {static_cast<mul_type>(value) * __x.value % mod, direct_ctor_tag};\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator*(_Tp __x) const noexcept {\n __x %= mod;\n if (__x < 0) __x += mod;\n return {static_cast<mul_type>(value) * __x % mod, direct_ctor_tag};\n }\n\n template <class _Tp>\n constexpr friend\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator*(_Tp __x, const modint &__y) noexcept {\n __x %= mod;\n if (__x < 0) __x += mod;\n return {static_cast<mul_type>(__x) * __y.value % mod, direct_ctor_tag};\n }\n\n // }} operator*\n\n protected:\n static value_type _mem(value_type __x) {\n static std::vector<value_type> __m{0, 1};\n static value_type __i = (__m.reserve(storage), 1);\n while (__i < __x) {\n ++__i;\n __m.emplace_back(mod - mul_type(mod / __i) * __m[mod % __i] % mod);\n }\n return __m[__x];\n }\n\n template <class _Tp>\n constexpr static\n typename std::enable_if<is_integral_ext<_Tp>::value, value_type>::type\n _div(mul_type __r, _Tp __x) noexcept {\n assert(__x != _Tp(0));\n if (!__r) return 0;\n\n std::make_signed_t<_Tp> __v{};\n bool __neg = __x < 0 ? __x = -__x, true : false;\n\n if (static_cast<decltype(storage)>(__x) < storage)\n __v = _mem(__x);\n else {\n decltype(__v) __y{mod}, __u{1}, __t;\n\n while (__x)\n __t = __y / __x, __y ^= __x ^= (__y -= __t * __x) ^= __x,\n __v ^= __u ^= (__v -= __t * __u) ^= __u;\n\n if (__y < 0) __neg ^= 1;\n }\n\n if (__neg)\n __v = 0 < __v ? mod - __v : -__v;\n else if (__v < 0)\n __v += mod;\n\n return __r == mul_type(1) ? static_cast<value_type>(__v)\n : static_cast<value_type>(__r * __v % mod);\n }\n\n public:\n // operator/= {{\n\n constexpr modint &operator/=(const modint &__x) noexcept {\n if (value) value = _div(value, __x.value);\n return *this;\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\n operator/=(_Tp __x) noexcept {\n if (value) value = _div(value, __x %= mod);\n return *this;\n }\n\n // }} operator/=\n\n // operator/ {{\n\n constexpr modint operator/(const modint &__x) const noexcept {\n if (!value) return {};\n return {_div(value, __x.value), direct_ctor_tag};\n }\n\n template <class _Tp>\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator/(_Tp __x) const noexcept {\n if (!value) return {};\n return {_div(value, __x %= mod), direct_ctor_tag};\n }\n\n template <class _Tp>\n constexpr friend\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\n operator/(_Tp __x, const modint &__y) noexcept {\n if (!__x) return {};\n if ((__x %= mod) < 0) __x += mod;\n return {_div(__x, __y.value), direct_ctor_tag};\n }\n\n // }} operator/\n\n constexpr modint inv() const noexcept { return _div(1, value); }\n\n template <class _Tp>\n constexpr std::__enable_if_t<is_integral_ext<_Tp>::value, modint> pow(\n _Tp __e) const noexcept {\n modint __r{1, direct_ctor_tag};\n\n for (modint __b{__e < 0 ? __e = -__e, _div(1, value) : value,\n direct_ctor_tag};\n __e; __e >>= 1, __b *= __b)\n if (__e & 1) __r *= __b;\n\n return __r;\n }\n\n template <class _Tp>\n friend constexpr std::__enable_if_t<is_integral_ext<_Tp>::value, modint> pow(\n modint __b, _Tp __e) noexcept {\n if (__e < 0) {\n __e = -__e;\n __b.value = _div(1, __b.value);\n }\n\n modint __r{1, direct_ctor_tag};\n\n for (; __e; __e >>= 1, __b *= __b)\n if (__e & 1) __r *= __b;\n\n return __r;\n }\n\n constexpr modint sqrt() const noexcept {\n return {sqrt_mod(value, mod), direct_ctor_tag};\n }\n\n friend constexpr modint sqrt(const modint &__x) noexcept {\n return {sqrt_mod(__x.value, mod), direct_ctor_tag};\n }\n\n template <class _Os>\n friend _Os &operator<<(_Os &__os, const modint &__x) noexcept {\n return __os << __x.value;\n }\n\n friend std::istream &operator>>(std::istream &__is, modint &__x) noexcept {\n std::string __s;\n __is >> __s;\n bool __neg = false;\n if (__s.front() == '-') {\n __neg = true;\n __s.erase(__s.begin());\n }\n __x = 0;\n for (char __c : __s) __x = __x * 10 + (__c - '0');\n if (__neg) __x = -__x;\n return __is;\n }\n};\n\ntemplate <auto _Mod, unsigned _Storage>\ntypename modint<_Mod, _Storage>::mod_type modint<_Mod, _Storage>::mod =\n _Mod > 0 ? _Mod : 0;\n\ntemplate <auto _Mod, unsigned _Storage>\nunsigned modint<_Mod, _Storage>::storage = _Storage;\n\n} // namespace _modint_impl\n\ntemplate <auto _Mod, unsigned _Storage = 0,\n typename = std::enable_if_t<(_Mod > 0)>>\nusing modint = _modint_impl::modint<_Mod, _Storage>;\n\ntemplate <unsigned _Id = 0>\nusing modint_runtime = _modint_impl::modint<-(signed)_Id, 0>;\n\n} // namespace workspace\n#line 7 \"other/sister.cpp\"\n\nnamespace workspace {\n\nusing mint = modint<1000003>;\n\nint main() {\n // start here!\n\n int n, m;\n cin >> n >> m;\n if (!n) {\n return 1;\n }\n if (!m) {\n cout << (n % 2 ? 0 : (n != 2 ? 2 : 1)) << \"\\n\";\n return 0;\n }\n\n vector<pair<int, int>> tree;\n\n // make tree representation\n {\n vector<pair<int, int>> tmp;\n while (m--) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n if (a > b) {\n swap(a, b);\n }\n tmp.emplace_back(a, b);\n }\n\n auto [l, r] = *min_element(begin(tmp), end(tmp), [](auto x, auto y) {\n return x.second - x.first < y.second - y.first;\n });\n\n auto conv = [&](int i) -> int {\n if (i > l) {\n assert(i >= r);\n return i - r;\n }\n return n - r + i;\n };\n\n vector<vector<pair<int, int>>> at_lft(n), lenof(n);\n\n for (auto [x, y] : tmp) {\n x = conv(x);\n y = conv(y);\n if (x > y) {\n swap(x, y);\n }\n lenof[y - x].emplace_back(x, y);\n }\n\n for (auto &&ve : lenof) {\n for (auto &&[l, r] : ve) {\n at_lft[l].emplace_back(l, r);\n }\n }\n\n reverse(begin(at_lft), end(at_lft));\n\n for (auto &&ve : at_lft) {\n for (auto &&x : ve) {\n tree.push_back(x);\n }\n }\n\n n = r - l - 1;\n n %= 2;\n }\n\n struct dp {\n int left, right;\n mint ways[2][2];\n\n dp operator+(dp x) const {\n assert(right <= x.left);\n dp ret = {left, x.right};\n for (auto i1 : {0, 1}) {\n for (auto j2 : {0, 1}) {\n for (auto j1 : {0, 1}) {\n auto i2 = (x.left - right) % 2 ? j1 : !j1;\n ret.ways[i1][j2] += ways[i1][j1] * x.ways[i2][j2];\n }\n }\n }\n return ret;\n }\n };\n\n stack<dp> Q;\n\n for (auto [s, t] : tree) {\n dp here = {s, s, {1, 0, 0, 1}};\n while (!Q.empty()) {\n if (Q.top().right > t) {\n break;\n }\n here = here + Q.top();\n Q.pop();\n }\n here = here + dp{t, t, {1, 0, 0, 1}};\n here.ways[0][0] += here.ways[1][1];\n swap(here.ways[0][0], here.ways[1][1]);\n swap(here.ways[0][1], here.ways[1][0]);\n Q.push(here);\n }\n\n assert(Q.size() == 1);\n\n auto all = Q.top();\n cout << all.ways[0][n] + all.ways[1][!n] << \"\\n\";\n\n return 0;\n}\n\n} // namespace workspace\n\nint main() {\n while (!workspace::main())\n ;\n}","accuracy":1,"time_ms":70,"memory_kb":9240,"score_of_the_acc":-0.0335,"final_rank":4},{"submission_id":"aoj_2405_4801918","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=1000003;\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\nvector<vector<P>> path;\n\nint main(){\n int n,m;\n int i,j,k;\n LL a,b,c;\n map<int,int> m1;\n vector<P> vs,path2;\n\n while(cin>>n>>m){\n if(n==0)return 0;\n path.assign(n,vector<P>());\n vs.assign(m+10,P());\n path2.assign(m+10,P());\n m1.clear();\n for(i=0;i<m;i++){\n cin>>a>>b;\n a--,b--;\n if(a<b)swap(a,b);\n if((a-b)%2==0)continue;\n path[b].push_back(make_pair(a,i));\n path2[i]=make_pair(b,a);\n }\n path[0].push_back(make_pair(n-1,m));\n path2[m]=make_pair(0,n-1);\n for(i=0;i<n;i++){\n sort(path[i].begin(),path[i].end());\n }\n if(n%2){\n cout<<0<<endl;\n continue;\n }\n for(i=n-1;i>=0;i--){\n for(auto node:path[i]){\n j=node.second;\n a=path2[j].first,b=path2[j].second;\n vs[j].first=1,vs[j].second=1;\n while(1){\n auto itr=m1.begin();\n if(itr==m1.end() || itr->first>=b)break;\n k=itr->second;\n if((itr->first-a)%2==1){\n vs[j].first*=vs[k].second;\n vs[j].second*=vs[k].first;\n }else{\n vs[j].first*=vs[k].first;\n vs[j].second*=vs[k].second;\n }\n vs[j].first%=MAX,vs[j].second%=MAX;\n m1.erase(itr);\n }\n // cout<<a<<\" \"<<b<<endl;\n // cout<<vs[j].first<<\" \"<<vs[j].second<<endl;\n vs[j].second+=vs[j].first;\n vs[j].second%=MAX;\n m1[a]=j;\n }\n }\n cout<<vs[m].second<<endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":6984,"score_of_the_acc":-0.0102,"final_rank":2},{"submission_id":"aoj_2405_4426992","code_snippet":"#include<bits/stdc++.h>\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 pb push_back\n#define eb emplace_back\n\nint in(){int x;cin>>x;return x;}\n\n\n \n#define ll long long\nvector<vector<int>> g;\nvector<int> nxt;\nconstexpr ll MOD = 1000003;\n\nmain(){\n while(1){\n int n=in(),m=in();\n if(!n)return 0;\n g=vector<vector<int>>(n);\n vector<vector<int>> v(2);\n using P = pair<int,int> ;\n vector<P> ed;\n rep(i,m){\n int a=in()-1,b=in()-1;\n if(a>b)swap(a,b);\n if((a+b)&1){\n g[a].pb(b);\n v[a&1].pb(a);\n ed.eb(P(a,b));\n }\n }\n if(n&1){\n cout<<0<<endl;continue;\n }\n #define all(c) (c).begin(),(c).end()\n vector<pair<int,ll>> dp(n);\n ed.emplace_back(0,n-1);\n sort(all(ed),[](P x,P y){return x.second-x.first<y.second-y.first;});\n rep(i,n-1) dp[i] = P(i+1,1);\n for(auto p:ed){\n int a = p.first,b=p.second;\n ll ans = 1;\n int now = a+1;\n while(now!=b){\n ans=(ans*dp[now].second)%MOD;\n now = dp[now].first+1;\n }\n dp[a+1]={b-1,ans};\n now = a,ans = 1;\n while(now!=b+1){\n ans = (ans*dp[now].second)%MOD;\n now = dp[now].first+1;\n }\n ans+=dp[a+1].second;\n if(ans>=MOD)ans-=MOD;\n dp[a] = {b,ans};\n }\n cout<<dp[0].second<<endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":6688,"score_of_the_acc":-0.0072,"final_rank":1},{"submission_id":"aoj_2405_4206148","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\nconst int mod = 1000003;\n\nconst int64 infll = (1LL << 58) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T >\nstruct edge {\n int src, to;\n T cost;\n\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n};\n\ntemplate< typename T >\nusing Edges = vector< edge< T > >;\ntemplate< typename T >\nusing WeightedGraph = vector< Edges< T > >;\nusing UnWeightedGraph = vector< vector< int > >;\ntemplate< typename T >\nusing Matrix = vector< vector< T > >;\n\n/**\n * @bref Tree-Decomposition(木分解)\n */\nstruct DecompNode {\n vector< int > bag, child;\n\n DecompNode() = default;\n};\n\nstruct TreeDecomposition {\n\n vector< vector< int > > g;\n\n explicit TreeDecomposition(int V) : g(V) {}\n\n void add_edge(int a, int b) {\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n\n vector< DecompNode > build() {\n const int N = (int) g.size();\n\n vector< int > used(N, -1), deg(N);\n queue< int > que;\n for(int i = 0; i < N; i++) {\n deg[i] = (int) g[i].size();\n if(deg[i] <= 2) que.emplace(i);\n }\n\n vector< set< int > > exists(N);\n for(int i = 0; i < N; i++) {\n for(auto &j : g[i]) {\n if(i < j) exists[i].emplace(j);\n }\n }\n\n vector< DecompNode > ret;\n ret.emplace_back();\n while(!que.empty()) {\n int idx = que.front();\n que.pop();\n if(deg[idx] > 2 || used[idx] != -1) continue;\n\n DecompNode r;\n r.bag.emplace_back(idx);\n int u = -1, v = -1;\n for(auto &to : g[idx]) {\n if(used[to] == -1) {\n (u == -1 ? u : v) = to;\n r.bag.emplace_back(to);\n } else if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n used[to] = -2;\n }\n }\n\n if(u == -1) {\n\n } else if(v == -1) {\n --deg[u];\n } else {\n if(u > v) swap(u, v);\n if(!exists[u].count(v)) {\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n exists[u].emplace(v);\n } else {\n --deg[u];\n --deg[v];\n }\n }\n\n for(auto &to : g[idx]) {\n if(deg[to] <= 2) que.emplace(to);\n }\n\n used[idx] = (int) ret.size();\n deg[idx] = 0;\n ret.emplace_back(r);\n }\n for(int i = 0; i < N; i++) {\n if(deg[i] > 0) return {};\n }\n ret.front() = ret.back();\n ret.pop_back();\n return ret;\n }\n};\n\n\nvoid to_nice(vector< DecompNode > &g, int root = 0) {\n\n for(auto &p : g) {\n sort(p.bag.begin(), p.bag.end());\n }\n\n stack< int > st;\n st.emplace(root);\n\n while(!st.empty()) {\n int idx = st.top();\n st.pop();\n\n // join\n while(g[idx].child.size() > 2) {\n DecompNode r;\n r.child.resize(2);\n r.child[0] = g[idx].child.back();\n g[idx].child.pop_back();\n r.child[1] = g[idx].child.back();\n g[idx].child.pop_back();\n r.bag = g[idx].bag;\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n\n if(g[idx].child.size() == 2) {\n for(auto &ch : g[idx].child) {\n if(g[ch].bag != g[idx].bag) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n }\n\n // introduce / forget\n if(g[idx].child.size() == 1) {\n int &ch = g[idx].child[0];\n\n vector< int > latte, malta;\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\n g[ch].bag.begin(), g[ch].bag.end(),\n back_inserter(latte));\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\n g[idx].bag.begin(), g[idx].bag.end(),\n back_inserter(malta));\n if(latte.size() + malta.size() > 1) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n if(!latte.empty()) {\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\n } else {\n r.bag.emplace_back(malta.back());\n }\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n\n // leaf\n if(g[idx].child.empty()) {\n if(g[idx].bag.size() > 1) {\n DecompNode r;\n r.bag = g[idx].bag;\n r.bag.pop_back();\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n }\n\n for(auto &ch : g[idx].child) {\n st.emplace(ch);\n }\n }\n}\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nusing modint = ModInt< mod >;\n\nint main() {\n int N, M;\n while(cin >> N >> M, N) {\n TreeDecomposition td(N);\n set< pair< int, int > > edges;\n for(int i = 0; i < N; i++) {\n td.add_edge(i, (i + 1) % N);\n edges.emplace(minmax(i, (i + 1) % N));\n }\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n td.add_edge(a, b);\n edges.emplace(minmax(a, b));\n }\n\n if(N % 2) {\n cout << 0 << endl;\n continue;\n }\n\n auto t = td.build();\n to_nice(t);\n vector< vector< modint > > dps(t.size());\n vector< int > buff(N), buff2(N, -1);\n MFP([&](auto rec, int idx) -> void {\n\n auto &ch = t[idx].child;\n auto &bag = t[idx].bag;\n\n for(auto &to : ch) rec(to);\n vector< modint > dp(1 << bag.size());\n\n if(ch.empty()) { // leaf\n dp[0] = 1;\n } else if(ch.size() == 2) { // join\n for(int i = 0; i < dp.size(); i++) {\n for(int j = 0; j < dp.size(); j++) {\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\n }\n }\n } else {\n auto &ch_bag = t[ch[0]].bag;\n auto &ch_dp = dps[ch[0]];\n\n for(int i = 0; i < bag.size(); i++) {\n buff[bag[i]] = 1 << i;\n buff2[bag[i]] = idx;\n }\n\n if(ch_bag.size() + 1 == bag.size()) { // introduce\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\n }\n dp[bit] = ch_dp[i];\n }\n } else { // forget\n int v = -1;\n for(int i = 0; i < ch_bag.size(); i++) {\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\n }\n vector< int > ok_match(bag.size());\n for(int i = 0; i < bag.size(); i++) {\n ok_match[i] = edges.count(minmax(bag[i], v));\n }\n\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n bool v_use = false;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) {\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\n } else {\n if(v == ch_bag[j]) v_use = true;\n }\n }\n if(v_use) {\n for(int j = 0; j < bag.size(); j++) {\n if((bit >> j) & 1) continue;\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\n }\n } else {\n dp[bit] += ch_dp[i];\n }\n }\n }\n }\n dps[idx].swap(dp);\n })(0);\n auto &dp = dps[0];\n cout << dp.back() << endl;\n }\n}","accuracy":1,"time_ms":850,"memory_kb":56508,"score_of_the_acc":-0.633,"final_rank":15},{"submission_id":"aoj_2405_4188312","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2405\"\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\n// Assume Connected\nstruct NiceTree{\n vector< vector<int> > G;\n vector< set<int> > ex;\n vector<int> buff;\n NiceTree(int n):G(n),ex(n),buff(n){}\n\n void add_edge(int u,int v){\n if(u>v) swap(u,v);\n if(ex[u].count(v)) return;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n ex[u].emplace(v);\n }\n\n enum Type{LEAF, JOIN, INTRODUCE, FORGET};\n struct Node{\n int type;\n\n // index for G\n vector<int> bag;\n void add_vertex(int v){bag.emplace_back(v);}\n\n // index for T\n vector<int> child;\n void add_child(int v){child.emplace_back(v);}\n };\n\n vector<Node> T;\n void to_nice(){\n for(auto &v:T)\n sort(v.bag.begin(),v.bag.end());\n\n stack<int> st;\n st.emplace(0);\n\n while(!st.empty()){\n int v=st.top();st.pop();\n\n while(T[v].child.size()>2){\n Node r;\n r.add_child(T[v].child.back());\n T[v].child.pop_back();\n r.add_child(T[v].child.back());\n T[v].child.pop_back();\n r.bag=T[v].bag;\n T[v].add_child(T.size());\n T.emplace_back(r);\n }\n\n if(T[v].child.size()==2){\n for(auto &u:T[v].child){\n if(T[u].bag!=T[v].bag){\n Node r;\n r.add_child(u);\n r.bag=T[v].bag;\n u=T.size();\n T.emplace_back(r);\n }\n }\n T[v].type=JOIN;\n }\n\n if(T[v].child.size()==1){\n int &u=T[v].child[0];\n vector<int> latte,malta;\n auto &ps=T[v].bag;\n auto &qs=T[u].bag;\n set_difference(ps.begin(),ps.end(),qs.begin(),qs.end(),\n back_inserter(latte));\n set_difference(qs.begin(),qs.end(),ps.begin(),ps.end(),\n back_inserter(malta));\n if(latte.size()+malta.size()>1){\n Node r;\n r.add_child(u);\n r.bag=T[v].bag;\n if(!latte.empty()){\n r.bag.erase(find(r.bag.begin(),r.bag.end(),latte.back()));\n }else{\n r.bag.emplace_back(malta.back());\n }\n u=T.size();\n T.emplace_back(r);\n }\n if(T[v].bag.size()<T[u].bag.size()) T[v].type=FORGET;\n if(T[v].bag.size()>T[u].bag.size()) T[v].type=INTRODUCE;\n }\n\n if(T[v].child.empty()){\n if(T[v].bag.size()>1){\n Node r;\n r.bag=T[v].bag;\n r.bag.pop_back();\n T[v].type=INTRODUCE;\n T[v].add_child(T.size());\n T.emplace_back(r);\n }else{\n T[v].type=LEAF;\n }\n }\n\n for(auto &u:T[v].child)\n st.emplace(u);\n }\n }\n\n // root = 0\n void build(){\n int n=G.size();\n if(n<=3){\n Node r;\n for(int i=0;i<n;i++) r.add_vertex(i);\n T=vector<Node>({r});\n return to_nice();\n }\n\n vector<int> deg(n);\n queue<int> que;\n for(int i=0;i<n;i++){\n deg[i]=G[i].size();\n if(deg[i]<=2) que.emplace(i);\n }\n\n vector<int> used(n,-1);\n T.emplace_back();\n while(!que.empty()){\n int v=que.front();que.pop();\n if(deg[v]>2||used[v]!=-1) continue;\n Node r;\n r.add_vertex(v);\n\n int p=-1,q=-1;\n for(int u:G[v]){\n if(used[u]==-1){\n (p==-1?p:q)=u;\n r.add_vertex(u);\n }else if(used[u]>=0){\n r.add_child(used[u]);\n used[u]=-2;\n }\n }\n\n if(deg[v]==0){\n used[v]=T.size();\n T.emplace_back(r);\n continue;\n }\n\n if(q==-1){\n deg[p]--;\n }else{\n if(p>q) swap(p,q);\n if(!ex[p].count(q)){\n add_edge(p,q);\n }else{\n deg[p]--;\n deg[q]--;\n }\n }\n for(int u:G[v])\n if(deg[u]<=2) que.emplace(u);\n deg[v]=0;\n used[v]=T.size();\n T.emplace_back(r);\n }\n\n for(int i=0;i<n;i++){\n if(deg[i]>0){\n T={};\n return;\n }\n }\n\n T.front()=T.back();T.pop_back();\n to_nice();\n }\n\n template<typename F1,typename F2,typename F3,typename F4>\n void dfs(int v,F1 &leaf,F2 &join,F3 &introduce,F4 &forget){\n const auto &chd=T[v].child;\n for(int u:chd) dfs(u,leaf,join,introduce,forget);\n\n if(T[v].type==LEAF){\n leaf(v);\n return;\n }\n if(T[v].type==JOIN){\n join(v);\n return;\n }\n\n const auto &bag=T[v].bag;\n for(int i=0;i<(int)bag.size();i++)\n buff[bag[i]]=1<<i;\n\n const auto &chd_bag=T[chd[0]].bag;\n int dif=0;\n for(int b:bag) dif^=b;\n for(int b:chd_bag) dif^=b;\n\n if(T[v].type==INTRODUCE){\n introduce(v,dif);\n return;\n }\n if(T[v].type==FORGET){\n forget(v,dif);\n return;\n }\n }\n};\n//END CUT HERE\n#ifndef call_from_test\n\n#define call_from_test\n#include \"../tools/fastio.cpp\"\n#include \"../tools/chminmax.cpp\"\n#undef call_from_test\n\nsigned CSA_SPECIAL_MVC(){\n int n,m;\n cin>>n>>m;\n NiceTree G(n);\n using P = pair<int, int>;\n set<P> es;\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G.add_edge(a,b);\n es.emplace(a,b);\n es.emplace(b,a);\n }\n\n G.build();\n auto &T=G.T;\n auto &buff=G.buff;\n\n vector< vector<int> > dps(T.size());\n\n const int INF = 1e9;\n auto base=\n [&](int v){\n const auto &bag=T[v].bag;\n auto &dp=dps[v];\n dp.assign(1<<bag.size(),-INF);\n };\n\n auto leaf=\n [&](int v){\n base(v);\n auto &dp=dps[v];\n dp[0]=0;\n dp[1]=1;\n };\n\n auto join=\n [&](int v){\n base(v);\n const auto &chd=T[v].child;\n auto &dp=dps[v];\n for(int i=0;i<(int)dp.size();i++)\n chmax(dp[i],dps[chd[0]][i]+dps[chd[1]][i]-__builtin_popcount(i));\n };\n\n auto introduce=\n [&](int v,int add){\n base(v);\n\n const auto &chd=T[v].child;\n const auto &chd_bag=T[chd[0]].bag;\n const auto &pr=dps[chd[0]];\n\n auto &dp=dps[v];\n for(int i=0;i<(int)pr.size();i++){\n int bit=0,valid=1;\n for(int j=0;j<(int)chd_bag.size();j++){\n if((~i>>j)&1) continue;\n bit|=buff[chd_bag[j]];\n valid&=!es.count(P(chd_bag[j],add));\n }\n assert(!(bit&buff[add]));\n if(valid) chmax(dp[bit|buff[add]],pr[i]+1);\n chmax(dp[bit],pr[i]);\n }\n };\n\n auto forget=\n [&](int v,int rmv){\n base(v);\n\n const auto &chd=T[v].child;\n const auto &chd_bag=T[chd[0]].bag;\n const auto &pr=dps[chd[0]];\n\n auto &dp=dps[v];\n for(int i=0;i<(int)pr.size();i++){\n int bit=0;\n for(int j=0;j<(int)chd_bag.size();j++){\n if((~i>>j)&1) continue;\n if(rmv!=chd_bag[j]) bit|=buff[chd_bag[j]];\n }\n chmax(dp[bit],pr[i]);\n }\n };\n\n G.dfs(0,leaf,join,introduce,forget);\n auto &dp=dps[0];\n cout<<n-*max_element(dp.begin(),dp.end())<<endl;\n return 0;\n}\n/*\n verified 2020/02/21\n https://csacademy.com/contest/archive/task/special-mvc/statement/\n*/\n\nsigned main(){\n CSA_SPECIAL_MVC();\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include<bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T,T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T,T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n//END CUT HERE\n#ifndef call_from_test\n\n//INSERT ABOVE HERE\nsigned ABC127_E(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int h,w,k;\n cin>>h>>w>>k;\n using M = Mint<int>;\n\n M ans{0};\n for(int d=1;d<h;d++)\n ans+=M(d)*M(h-d)*M(w)*M(w);\n\n for(int d=1;d<w;d++)\n ans+=M(d)*M(w-d)*M(h)*M(h);\n\n ans*=M::comb(h*w-2,k-2);\n cout<<ans<<endl;\n return 0;\n}\n/*\n verified on 2019/06/12\n https://atcoder.jp/contests/abc127/tasks/abc127_e\n*/\n\nsigned main(){\n //ABC127_E();\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n int n,m;\n while(cin>>n>>m,n){\n NiceTree G(n);\n using P = pair<int, int>;\n set<P> es;\n for(int i=0;i<n;i++){\n int j=(i+1)%n;\n G.add_edge(i,j);\n es.emplace(i,j);\n es.emplace(j,i);\n }\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G.add_edge(a,b);\n es.emplace(a,b);\n es.emplace(b,a);\n }\n if(n&1){\n cout<<0<<endl;\n continue;\n }\n G.build();\n auto &T=G.T;\n auto &buff=G.buff;\n\n using M = Mint<int, 1000003>;\n vector<vector<M>> dps(T.size());\n\n auto base=\n [&](int v){\n const auto &bag=T[v].bag;\n auto &dp=dps[v];\n dp.assign(1<<bag.size(),0);\n };\n\n auto leaf=\n [&](int v){\n base(v);\n auto &dp=dps[v];\n dp[0]=M(1);\n };\n\n auto join=\n [&](int v){\n base(v);\n const auto &chd=T[v].child;\n auto &dp=dps[v];\n\n for(int i=0;i<(int)dp.size();i++)\n for(int j=0;j<(int)dp.size();j++)\n if((i&j)==0) dp[i|j]+=dps[chd[0]][i]*dps[chd[1]][j];\n };\n\n auto introduce=\n [&](int v,int){\n base(v);\n const auto &chd=T[v].child;\n\n const auto &chd_bag=T[chd[0]].bag;\n const auto &pr=dps[chd[0]];\n\n auto &dp=dps[v];\n for(int i=0;i<(int)pr.size();i++){\n int bit=0;\n for(int j=0;j<(int)chd_bag.size();j++)\n if((i>>j)&1) bit|=buff[chd_bag[j]];\n dp[bit]=pr[i];\n }\n };\n\n auto forget=\n [&](int v,int rmv){\n base(v);\n const auto &bag=T[v].bag;\n const auto &chd=T[v].child;\n\n const auto &chd_bag=T[chd[0]].bag;\n const auto &pr=dps[chd[0]];\n\n auto &dp=dps[v];\n\n for(int i=0;i<(int)pr.size();i++){\n int bit=0,used=0;\n for(int j=0;j<(int)chd_bag.size();j++){\n if((~i>>j)&1) continue;\n if(rmv==chd_bag[j]) used=1;\n if(rmv!=chd_bag[j]) bit|=buff[chd_bag[j]];\n }\n if(!used){\n for(int j=0;j<(int)bag.size();j++){\n if((bit>>j)&1) continue;\n if(es.count(P(bag[j],rmv))) dp[bit|(1<<j)]+=pr[i];\n }\n }else{\n dp[bit]+=pr[i];\n }\n }\n };\n\n G.dfs(0,leaf,join,introduce,forget);\n\n auto &dp=dps[0];\n if(es.count(P(T[0].bag[0],T[0].bag[1])))\n dp.back()+=dp[0];\n cout<<dp.back()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1040,"memory_kb":64500,"score_of_the_acc":-0.7427,"final_rank":17},{"submission_id":"aoj_2405_4186722","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n// Assume Connected\nstruct NiceTree{\n vector< vector<int> > G;\n vector< set<int> > ex;\n NiceTree(int n):G(n),ex(n){}\n\n void add_edge(int u,int v){\n if(u>v) swap(u,v);\n if(ex[u].count(v)) return;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n ex[u].emplace(v);\n }\n\n enum Type{LEAF, INTRODUCE, FORGET, JOIN};\n struct Node{\n int type;\n\n // index for G\n vector<int> bag;\n void add_vertex(int v){bag.emplace_back(v);}\n\n // index for T\n vector<int> child;\n void add_child(int v){child.emplace_back(v);}\n };\n\n void to_nice(vector<Node> &T){\n for(auto &v:T)\n sort(v.bag.begin(),v.bag.end());\n\n stack<int> st;\n st.emplace(0);\n\n while(!st.empty()){\n int v=st.top();st.pop();\n\n while(T[v].child.size()>2){\n Node r;\n r.add_child(T[v].child.back());\n T[v].child.pop_back();\n r.add_child(T[v].child.back());\n T[v].child.pop_back();\n r.bag=T[v].bag;\n T[v].add_child(T.size());\n T.emplace_back(r);\n }\n\n if(T[v].child.size()==2){\n for(auto &u:T[v].child){\n if(T[u].bag!=T[v].bag){\n Node r;\n r.add_child(u);\n r.bag=T[v].bag;\n u=T.size();\n T.emplace_back(r);\n }\n }\n T[v].type=JOIN;\n }\n\n if(T[v].child.size()==1){\n int &u=T[v].child[0];\n vector<int> latte,malta;\n auto &ps=T[v].bag;\n auto &qs=T[u].bag;\n set_difference(ps.begin(),ps.end(),qs.begin(),qs.end(),\n back_inserter(latte));\n set_difference(qs.begin(),qs.end(),ps.begin(),ps.end(),\n back_inserter(malta));\n if(latte.size()+malta.size()>1){\n Node r;\n r.add_child(u);\n r.bag=T[v].bag;\n if(!latte.empty()){\n r.bag.erase(find(r.bag.begin(),r.bag.end(),latte.back()));\n }else{\n r.bag.emplace_back(malta.back());\n }\n u=T.size();\n T.emplace_back(r);\n }\n if(T[v].bag.size()<T[u].bag.size()) T[v].type=FORGET;\n if(T[v].bag.size()>T[u].bag.size()) T[v].type=INTRODUCE;\n }\n\n if(T[v].child.empty()){\n if(T[v].bag.size()>1){\n Node r;\n r.bag=T[v].bag;\n r.bag.pop_back();\n T[v].type=INTRODUCE;\n T[v].add_child(T.size());\n T.emplace_back(r);\n }else{\n T[v].type=LEAF;\n }\n }\n\n for(auto &u:T[v].child)\n st.emplace(u);\n }\n }\n\n // root = 0\n vector<Node> build(){\n int n=G.size();\n if(n<=3){\n Node r;\n for(int i=0;i<n;i++) r.add_vertex(i);\n return {r};\n }\n\n vector<int> deg(n);\n queue<int> que;\n for(int i=0;i<n;i++){\n deg[i]=G[i].size();\n if(deg[i]<=2) que.emplace(i);\n }\n\n vector<int> used(n,-1);\n vector<Node> T;\n T.emplace_back();\n while(!que.empty()){\n int v=que.front();que.pop();\n if(deg[v]==0||deg[v]>2||used[v]!=-1) continue;\n Node r;\n r.add_vertex(v);\n\n int p=-1,q=-1;\n for(int u:G[v]){\n if(used[u]==-1){\n (p==-1?p:q)=u;\n r.add_vertex(u);\n }else if(used[u]>=0){\n r.add_child(used[u]);\n used[u]=-2;\n }\n }\n if(q==-1){\n deg[p]--;\n }else{\n if(p>q) swap(p,q);\n if(!ex[p].count(q)){\n add_edge(p,q);\n }else{\n deg[p]--;\n deg[q]--;\n }\n }\n for(int u:G[v]){\n if(deg[u]==0) continue;\n if(deg[u]<=2) que.emplace(u);\n }\n used[v]=T.size();\n deg[v]=0;\n T.emplace_back(r);\n }\n\n for(int i=0;i<n;i++)\n if(deg[i]>0) return {};\n\n T.front()=T.back();T.pop_back();\n to_nice(T);\n return T;\n }\n};\n\n\ntemplate<typename T,T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T,T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n\n\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n\n\nstruct FastIO{\n FastIO(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n}fastio_beet;\n\n//INSERT ABOVE HERE\nsigned main(){\n int n,m;\n while(cin>>n>>m,n){\n NiceTree G(n);\n using P = pair<int, int>;\n set<P> es;\n for(int i=0;i<n;i++){\n int j=(i+1)%n;\n G.add_edge(i,j);\n es.emplace(i,j);\n es.emplace(j,i);\n }\n for(int i=0;i<m;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G.add_edge(a,b);\n es.emplace(a,b);\n es.emplace(b,a);\n }\n if(n&1){\n cout<<0<<endl;\n continue;\n }\n auto T=G.build();\n\n using M = Mint<int, 1000003>;\n vector<vector<M>> dps(T.size());\n vector<int> buff1(n),buff2(n,-1);\n MFP([&](auto dfs,int v)->void{\n const auto &bag=T[v].bag;\n const auto &chd=T[v].child;\n\n for(int u:chd) dfs(u);\n auto &dp=dps[v];\n dp.assign(1<<bag.size(),0);\n\n if(T[v].type==NiceTree::LEAF){\n dp[0]=M(1);\n return;\n }\n\n if(T[v].type==NiceTree::JOIN){\n for(int i=0;i<(int)dp.size();i++)\n for(int j=0;j<(int)dp.size();j++)\n if((i&j)==0) dp[i|j]+=dps[chd[0]][i]*dps[chd[1]][j];\n return;\n }\n\n const auto &chd_bag=T[chd[0]].bag;\n const auto &pr=dps[chd[0]];\n\n for(int i=0;i<(int)bag.size();i++){\n buff1[bag[i]]=1<<i;\n buff2[bag[i]]=v;\n }\n\n if(T[v].type==NiceTree::INTRODUCE){\n for(int i=0;i<(int)pr.size();i++){\n int bit=0;\n for(int j=0;j<(int)chd_bag.size();j++)\n if((i>>j)&1) bit|=buff1[chd_bag[j]];\n dp[bit]=pr[i];\n }\n return;\n }\n\n if(T[v].type==NiceTree::FORGET){\n int add=-1;\n for(int i=0;i<(int)chd_bag.size();i++)\n if(buff2[chd_bag[i]]!=v) add=chd_bag[i];\n\n vector<int> ex(bag.size());\n for(int i=0;i<(int)bag.size();i++)\n ex[i]=es.count(P(bag[i],add));\n\n for(int i=0;i<(int)pr.size();i++){\n int bit=0,used=0;\n for(int j=0;j<(int)chd_bag.size();j++){\n if((~i>>j)&1) continue;\n if(add==chd_bag[j]) used=1;\n if(add!=chd_bag[j]) bit|=buff1[chd_bag[j]];\n }\n if(!used){\n for(int j=0;j<(int)bag.size();j++){\n if((bit>>j)&1) continue;\n if(ex[j]) dp[bit|(1<<j)]+=pr[i];\n }\n }else{\n dp[bit]+=pr[i];\n }\n }\n return;\n }\n })(0);\n\n auto &dp=dps[0];\n if(es.count(P(T[0].bag[0],T[0].bag[1])))\n dp.back()+=dp[0];\n cout<<dp.back()<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1040,"memory_kb":67912,"score_of_the_acc":-0.7779,"final_rank":18},{"submission_id":"aoj_2405_4171495","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\nconst int mod = 1000003;\n\nconst int64 infll = (1LL << 58) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\nstruct DecompNode {\n vector< int > bag, child;\n\n DecompNode() = default;\n};\n\nstruct TreeDecomposition {\n\n vector< vector< int > > g;\n\n explicit TreeDecomposition(int V) : g(V) {}\n\n void add_edge(int a, int b) {\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n\n vector< DecompNode > build() {\n const int N = (int) g.size();\n\n if(N <= 3) {\n DecompNode r;\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\n return {r};\n }\n\n vector< int > used(N, -1), deg(N);\n queue< int > que;\n for(int i = 0; i < N; i++) {\n deg[i] = (int) g[i].size();\n if(deg[i] <= 2) que.emplace(i);\n }\n\n vector< set< int > > exists(N);\n for(int i = 0; i < N; i++) {\n for(auto &j : g[i]) {\n if(i < j) exists[i].emplace(j);\n }\n }\n\n vector< DecompNode > ret;\n while(!que.empty()) {\n int idx = que.front();\n que.pop();\n if(deg[idx] == 0 || deg[idx] > 2 || used[idx] != -1) continue;\n DecompNode r;\n r.bag.emplace_back(idx);\n int u = -1, v = -1;\n for(auto &to : g[idx]) {\n if(used[to] == -1) {\n (u == -1 ? u : v) = to;\n r.bag.emplace_back(to);\n } else if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n used[to] = -2;\n }\n }\n\n if(v == -1) {\n --deg[u];\n } else {\n if(u > v) swap(u, v);\n if(!exists[u].count(v)) {\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n exists[u].emplace(v);\n } else {\n --deg[u];\n --deg[v];\n }\n }\n\n for(auto &to : g[idx]) {\n if(deg[to] == 0) continue;\n if(deg[to] <= 2) que.emplace(to);\n }\n\n used[idx] = (int) ret.size();\n deg[idx] = 0;\n ret.emplace_back(r);\n }\n for(int i = 0; i < N; i++) {\n if(deg[i] > 0) return {};\n }\n return ret;\n }\n};\n\nint to_nice(vector< DecompNode > &g, int root = -1) {\n if(root == -1) root = (int) g.size() - 1;\n\n for(auto &p : g) {\n sort(p.bag.begin(), p.bag.end());\n }\n\n stack< int > st;\n st.emplace(root);\n\n while(!st.empty()) {\n int idx = st.top();\n st.pop();\n\n // join\n while(g[idx].child.size() > 2) {\n DecompNode r;\n r.child.resize(2);\n r.child[0] = g[idx].child.back();\n g[idx].child.pop_back();\n r.child[1] = g[idx].child.back();\n g[idx].child.pop_back();\n r.bag = g[idx].bag;\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n\n if(g[idx].child.size() == 2) {\n for(auto &ch : g[idx].child) {\n if(g[ch].bag != g[idx].bag) {\n DecompNode r;\n r.child.resize(1);\n r.child[0] = ch;\n r.bag = g[idx].bag;\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n }\n\n // introduce / forgot\n if(g[idx].child.size() == 1) {\n int &ch = g[idx].child[0];\n\n vector< int > latte, malta;\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\n g[ch].bag.begin(), g[ch].bag.end(),\n back_inserter(latte));\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\n g[idx].bag.begin(), g[idx].bag.end(),\n back_inserter(malta));\n if(latte.size() + malta.size() > 1) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n if(!latte.empty()) {\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\n } else {\n r.bag.emplace_back(malta.back());\n }\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n\n // leaf\n if(g[idx].child.empty()) {\n if(g[idx].bag.size() > 1) {\n DecompNode r;\n r.bag = g[idx].bag;\n r.bag.pop_back();\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n }\n\n for(auto &ch : g[idx].child) {\n st.emplace(ch);\n }\n }\n return root;\n}\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt &operator^=(int64_t n) {\n int y = x;\n x = 1;\n while(n > 0) {\n if(n & 1) x = 1LL * x * y % mod;\n y = 1LL * y * y % mod;\n n >>= 1;\n }\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 ModInt operator^(const int64_t n) const { return ModInt(*this) ^= n; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n a -= t * b;\n swap(a, b);\n u -= t * v;\n swap(u, v);\n }\n return ModInt(u);\n }\n\n friend ostream &operator<<(ostream &os, const ModInt< mod > &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt< mod > &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n};\n\nusing modint = ModInt< mod >;\n\nint main() {\n int N, M;\n while(cin >> N >> M, N) {\n TreeDecomposition g(N);\n set< pair< int, int > > edges;\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n edges.emplace(minmax(a, b));\n g.add_edge(a, b);\n }\n if(N % 2) {\n cout << 0 << endl;\n continue;\n }\n for(int i = 0; i < N; i++) {\n edges.emplace(minmax(i, (i + 1) % N));\n g.add_edge(i, (i + 1) % N);\n }\n auto t = g.build();\n int root = to_nice(t);\n vector< vector< modint > > dps(t.size());\n vector< int > buff(N), buff2(N, -1);\n\n MFP([&](auto rec, int idx) -> void {\n\n auto &ch = t[idx].child;\n auto &bag = t[idx].bag;\n\n for(auto &to : ch) rec(to);\n vector< modint > dp(1 << bag.size());\n\n if(ch.empty()) { // leaf\n dp[0] = 1;\n } else if(ch.size() == 2) { // join\n for(int i = 0; i < dp.size(); i++) {\n for(int j = 0; j < dp.size(); j++) {\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\n }\n }\n } else {\n auto &ch_bag = t[ch[0]].bag;\n auto &ch_dp = dps[ch[0]];\n\n for(int i = 0; i < bag.size(); i++) {\n buff[bag[i]] = 1 << i;\n buff2[bag[i]] = idx;\n }\n\n if(ch_bag.size() + 1 == bag.size()) { // introduce\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\n }\n dp[bit] = ch_dp[i];\n }\n } else { // forgot\n int v = -1;\n for(int i = 0; i < ch_bag.size(); i++) {\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\n }\n vector< int > ok_match(bag.size());\n for(int i = 0; i < bag.size(); i++) {\n ok_match[i] = edges.count(minmax(bag[i], v));\n }\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n bool v_use = false;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) {\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\n } else {\n if(v == ch_bag[j]) v_use = true;\n }\n }\n if(v_use) {\n for(int j = 0; j < bag.size(); j++) {\n if((bit >> j) & 1) continue;\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\n }\n } else {\n dp[bit] += ch_dp[i];\n }\n }\n }\n }\n dps[idx].swap(dp);\n })(root);\n auto &dp = dps[root];\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\n cout << dp.back() << endl;\n }\n}","accuracy":1,"time_ms":780,"memory_kb":57796,"score_of_the_acc":-0.6362,"final_rank":16},{"submission_id":"aoj_2405_4171487","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\nconst int mod = 1000003;\n\nconst int64 infll = (1LL << 58) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\nstruct DecompNode {\n vector< int > bag, child;\n\n DecompNode() = default;\n};\n\nstruct TreeDecomposition {\n\n vector< vector< int > > g;\n\n explicit TreeDecomposition(int V) : g(V) {}\n\n void add_edge(int a, int b) {\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n\n vector< DecompNode > build() {\n const int N = (int) g.size();\n\n if(N <= 3) {\n DecompNode r;\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\n return {r};\n }\n\n vector< int > used(N, -1), deg(N);\n queue< int > que;\n for(int i = 0; i < N; i++) {\n deg[i] = (int) g[i].size();\n if(deg[i] <= 2) que.emplace(i);\n }\n\n vector< set< int > > exists(N);\n for(int i = 0; i < N; i++) {\n for(auto &j : g[i]) {\n if(i < j) exists[i].emplace(j);\n }\n }\n\n vector< DecompNode > ret;\n while(!que.empty()) {\n int idx = que.front();\n que.pop();\n if(deg[idx] == 0 || deg[idx] > 2 || used[idx] != -1) continue;\n DecompNode r;\n r.bag.emplace_back(idx);\n int u = -1, v = -1;\n for(auto &to : g[idx]) {\n if(used[to] == -1) {\n (u == -1 ? u : v) = to;\n r.bag.emplace_back(to);\n } else if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n used[to] = -2;\n }\n }\n\n if(v == -1) {\n --deg[u];\n } else {\n if(u > v) swap(u, v);\n if(!exists[u].count(v)) {\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n exists[u].emplace(v);\n } else {\n --deg[u];\n --deg[v];\n }\n }\n\n for(auto &to : g[idx]) {\n if(deg[to] == 0) continue;\n if(deg[to] <= 2) que.emplace(to);\n }\n\n used[idx] = (int) ret.size();\n deg[idx] = 0;\n ret.emplace_back(r);\n }\n for(int i = 0; i < N; i++) {\n if(deg[i] > 0) return {};\n }\n return ret;\n }\n};\n\nint to_nice(vector< DecompNode > &g, int root = -1) {\n if(root == -1) root = (int) g.size() - 1;\n\n for(auto &p : g) {\n sort(p.bag.begin(), p.bag.end());\n }\n\n stack< int > st;\n st.emplace(root);\n\n while(!st.empty()) {\n int idx = st.top();\n st.pop();\n\n // join\n while(g[idx].child.size() > 2) {\n DecompNode r;\n r.child.resize(2);\n r.child[0] = g[idx].child.back();\n g[idx].child.pop_back();\n r.child[1] = g[idx].child.back();\n g[idx].child.pop_back();\n r.bag = g[idx].bag;\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n\n if(g[idx].child.size() == 2) {\n for(auto &ch : g[idx].child) {\n if(g[ch].bag != g[idx].bag) {\n DecompNode r;\n r.child.resize(1);\n r.child[0] = ch;\n r.bag = g[idx].bag;\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n }\n\n // introduce / forgot\n if(g[idx].child.size() == 1) {\n int &ch = g[idx].child[0];\n\n vector< int > latte, malta;\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\n g[ch].bag.begin(), g[ch].bag.end(),\n back_inserter(latte));\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\n g[idx].bag.begin(), g[idx].bag.end(),\n back_inserter(malta));\n if(latte.size() + malta.size() > 1) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n if(!latte.empty()) {\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\n } else {\n r.bag.emplace_back(malta.back());\n }\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n\n for(auto &ch : g[idx].child) {\n st.emplace(ch);\n }\n }\n return root;\n}\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt &operator^=(int64_t n) {\n int y = x;\n x = 1;\n while(n > 0) {\n if(n & 1) x = 1LL * x * y % mod;\n y = 1LL * y * y % mod;\n n >>= 1;\n }\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 ModInt operator^(const int64_t n) const { return ModInt(*this) ^= n; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n a -= t * b;\n swap(a, b);\n u -= t * v;\n swap(u, v);\n }\n return ModInt(u);\n }\n\n friend ostream &operator<<(ostream &os, const ModInt< mod > &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt< mod > &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n};\n\nusing modint = ModInt< mod >;\n\nint main() {\n int N, M;\n while(cin >> N >> M, N) {\n TreeDecomposition g(N);\n set< pair< int, int > > edges;\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n edges.emplace(minmax(a, b));\n g.add_edge(a, b);\n }\n if(N % 2) {\n cout << 0 << endl;\n continue;\n }\n for(int i = 0; i < N; i++) {\n edges.emplace(minmax(i, (i + 1) % N));\n g.add_edge(i, (i + 1) % N);\n }\n auto t = g.build();\n int root = to_nice(t);\n vector< vector< modint > > dps(t.size());\n vector< int > buff(N), buff2(N, -1);\n\n MFP([&](auto rec, int idx) -> void {\n\n auto &ch = t[idx].child;\n auto &bag = t[idx].bag;\n\n for(auto &to : ch) rec(to);\n vector< modint > dp(1 << bag.size());\n\n if(ch.empty()) { // leaf\n dp[0] = 1;\n } else if(ch.size() == 2) { // join\n for(int i = 0; i < dp.size(); i++) {\n for(int j = 0; j < dp.size(); j++) {\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\n }\n }\n } else {\n auto &ch_bag = t[ch[0]].bag;\n auto &ch_dp = dps[ch[0]];\n\n for(int i = 0; i < bag.size(); i++) {\n buff[bag[i]] = 1 << i;\n buff2[bag[i]] = idx;\n }\n\n if(ch_bag.size() + 1 == bag.size()) { // introduce\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\n }\n dp[bit] = ch_dp[i];\n }\n } else { // forgot\n int v = -1;\n for(int i = 0; i < ch_bag.size(); i++) {\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\n }\n vector< int > ok_match(bag.size());\n for(int i = 0; i < bag.size(); i++) {\n ok_match[i] = edges.count(minmax(bag[i], v));\n }\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n bool v_use = false;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) {\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\n } else {\n if(v == ch_bag[j]) v_use = true;\n }\n }\n if(v_use) {\n for(int j = 0; j < bag.size(); j++) {\n if((bit >> j) & 1) continue;\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\n }\n } else {\n dp[bit] += ch_dp[i];\n }\n }\n }\n }\n dps[idx].swap(dp);\n })(root);\n auto &dp = dps[root];\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\n cout << dp.back() << endl;\n }\n}","accuracy":1,"time_ms":740,"memory_kb":52380,"score_of_the_acc":-0.5746,"final_rank":12},{"submission_id":"aoj_2405_4170680","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\nconst int mod = 1000003;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\nstruct DecompNode {\n vector< int > bag, child;\n\n DecompNode() = default;\n};\n\nstruct TreeDecomposition {\n\n vector< vector< int > > g;\n\n explicit TreeDecomposition(int V) : g(V) {}\n\n void add_edge(int a, int b) {\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n\n vector< DecompNode > build() {\n const int N = (int) g.size();\n\n if(N <= 3) {\n DecompNode r;\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\n return {r};\n }\n\n vector< int > used(N, -1), deg(N);\n queue< int > que;\n for(int i = 0; i < N; i++) {\n deg[i] = (int) g[i].size();\n if(deg[i] == 2) que.emplace(i);\n }\n\n vector< set< int > > exists(N);\n for(int i = 0; i < N; i++) {\n for(auto &j : g[i]) {\n if(i < j) exists[i].emplace(j);\n }\n }\n\n vector< DecompNode > ret;\n while(!que.empty()) {\n int idx = que.front();\n que.pop();\n if(deg[idx] != 2 || used[idx] != -1) continue;\n\n DecompNode r;\n r.bag.emplace_back(idx);\n int u = -1, v = -1;\n for(auto &to : g[idx]) {\n if(used[to] == -1) {\n (u == -1 ? u : v) = to;\n r.bag.emplace_back(to);\n } else if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n used[to] = -2;\n }\n }\n\n if(u > v) swap(u, v);\n if(!exists[u].count(v)) {\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n exists[u].emplace(v);\n } else {\n --deg[u];\n --deg[v];\n }\n\n for(auto &to : g[idx]) {\n if(deg[to] == 2) que.emplace(to);\n }\n\n used[idx] = (int) ret.size();\n deg[idx] = 0;\n ret.emplace_back(r);\n }\n\n DecompNode r;\n for(int i = 0; i < N; i++) {\n if(deg[i] == 1) r.bag.emplace_back(i);\n }\n if(r.bag.size() != 2) return {};\n for(auto &to : g[r.bag[0]]) {\n if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n }\n }\n ret.emplace_back(r);\n return ret;\n }\n};\n\n\nint to_nice(vector< DecompNode > &g, int root = -1) {\n if(root == -1) root = (int) g.size() - 1;\n\n for(auto &p : g) {\n sort(p.bag.begin(), p.bag.end());\n }\n\n stack< int > st;\n st.emplace(root);\n\n while(!st.empty()) {\n int idx = st.top();\n st.pop();\n\n // join\n while(g[idx].child.size() > 2) {\n DecompNode r;\n r.child.resize(2);\n r.child[0] = g[idx].child.back();\n g[idx].child.pop_back();\n r.child[1] = g[idx].child.back();\n g[idx].child.pop_back();\n r.bag = g[idx].bag;\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n\n if(g[idx].child.size() == 2) {\n for(auto &ch : g[idx].child) {\n if(g[ch].bag != g[idx].bag) {\n DecompNode r;\n r.child.resize(1);\n r.child[0] = ch;\n r.bag = g[idx].bag;\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n }\n\n // introduce / forgot\n if(g[idx].child.size() == 1) {\n int &ch = g[idx].child[0];\n\n vector< int > latte, malta;\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\n g[ch].bag.begin(), g[ch].bag.end(),\n back_inserter(latte));\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\n g[idx].bag.begin(), g[idx].bag.end(),\n back_inserter(malta));\n if(latte.size() + malta.size() > 1) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n if(!latte.empty()) {\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\n } else {\n r.bag.emplace_back(malta.back());\n }\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n\n for(auto &ch : g[idx].child) {\n st.emplace(ch);\n }\n }\n return root;\n}\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nusing modint = ModInt< mod >;\n\nint main() {\n int N, M;\n while(cin >> N >> M, N) {\n TreeDecomposition g(N);\n set< pair< int, int > > edges;\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n edges.emplace(minmax(a, b));\n g.add_edge(a, b);\n }\n if(N % 2) {\n cout << 0 << endl;\n continue;\n }\n for(int i = 0; i < N; i++) {\n edges.emplace(minmax(i, (i + 1) % N));\n g.add_edge(i, (i + 1) % N);\n }\n auto t = g.build();\n int root = to_nice(t);\n vector< vector< modint > > dps(t.size());\n vector< int > buff(N), buff2(N, -1);\n\n MFP([&](auto rec, int idx) -> void {\n\n auto &ch = t[idx].child;\n auto &bag = t[idx].bag;\n\n for(auto &to : ch) rec(to);\n vector< modint > dp(1 << bag.size());\n\n if(ch.empty()) { // leaf\n dp[0] = 1;\n } else if(ch.size() == 2) { // join\n for(int i = 0; i < dp.size(); i++) {\n for(int j = 0; j < dp.size(); j++) {\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\n }\n }\n } else {\n auto &ch_bag = t[ch[0]].bag;\n auto &ch_dp = dps[ch[0]];\n\n for(int i = 0; i < bag.size(); i++) {\n buff[bag[i]] = 1 << i;\n buff2[bag[i]] = idx;\n }\n\n if(ch_bag.size() + 1 == bag.size()) { // introduce\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\n }\n dp[bit] = ch_dp[i];\n }\n } else { // forgot\n int v = -1;\n for(int i = 0; i < ch_bag.size(); i++) {\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\n }\n vector< int > ok_match(bag.size());\n for(int i = 0; i < bag.size(); i++) {\n ok_match[i] = edges.count(minmax(bag[i], v));\n }\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n bool v_use = false;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) {\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\n } else {\n if(v == ch_bag[j]) v_use = true;\n }\n }\n if(v_use) {\n for(int j = 0; j < bag.size(); j++) {\n if((bit >> j) & 1) continue;\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\n }\n } else {\n dp[bit] += ch_dp[i];\n }\n }\n }\n }\n dps[idx].swap(dp);\n })(root);\n auto &dp = dps[root];\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\n cout << dp.back() << endl;\n }\n}","accuracy":1,"time_ms":730,"memory_kb":52444,"score_of_the_acc":-0.5738,"final_rank":11},{"submission_id":"aoj_2405_4170678","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n\nusing int64 = long long;\nconst int mod = 1000003;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\nstruct DecompNode {\n vector< int > bag, child;\n\n DecompNode() = default;\n};\n\nstruct TreeDecomposition {\n\n vector< vector< int > > g;\n\n explicit TreeDecomposition(int V) : g(V) {}\n\n void add_edge(int a, int b) {\n g[a].emplace_back(b);\n g[b].emplace_back(a);\n }\n\n vector< DecompNode > build() {\n const int N = (int) g.size();\n\n if(N <= 3) {\n DecompNode r;\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\n return {r};\n }\n\n vector< int > used(N, -1), deg(N);\n queue< int > que;\n for(int i = 0; i < N; i++) {\n deg[i] = (int) g[i].size();\n if(deg[i] == 2) que.emplace(i);\n }\n\n vector< set< int > > exists(N);\n for(int i = 0; i < N; i++) {\n for(auto &j : g[i]) {\n if(i < j) exists[i].emplace(j);\n }\n }\n\n vector< DecompNode > ret;\n while(!que.empty()) {\n int idx = que.front();\n que.pop();\n if(deg[idx] != 2 || used[idx] != -1) continue;\n\n DecompNode r;\n r.bag.emplace_back(idx);\n int u = -1, v = -1;\n for(auto &to : g[idx]) {\n if(used[to] == -1) {\n (u == -1 ? u : v) = to;\n r.bag.emplace_back(to);\n } else if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n used[to] = -2;\n }\n }\n\n if(u > v) swap(u, v);\n if(!exists[u].count(v)) {\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n exists[u].emplace(v);\n } else {\n --deg[u];\n --deg[v];\n }\n\n for(auto &to : g[idx]) {\n if(deg[to] == 2) que.emplace(to);\n }\n\n used[idx] = (int) ret.size();\n deg[idx] = 0;\n ret.emplace_back(r);\n }\n\n DecompNode r;\n for(int i = 0; i < N; i++) {\n if(deg[i] == 1) r.bag.emplace_back(i);\n }\n if(r.bag.size() != 2) return {};\n for(auto &to : g[r.bag[0]]) {\n if(used[to] >= 0) {\n r.child.emplace_back(used[to]);\n }\n }\n ret.emplace_back(r);\n return ret;\n }\n};\n\n\nint to_nice(vector< DecompNode > &g, int root = -1) {\n if(root == -1) root = (int) g.size() - 1;\n\n for(auto &p : g) {\n sort(p.bag.begin(), p.bag.end());\n }\n\n stack< int > st;\n st.emplace(root);\n\n while(!st.empty()) {\n int idx = st.top();\n st.pop();\n\n // join\n while(g[idx].child.size() > 2) {\n DecompNode r;\n r.child.resize(2);\n r.child[0] = g[idx].child.back();\n g[idx].child.pop_back();\n r.child[1] = g[idx].child.back();\n g[idx].child.pop_back();\n r.bag = g[idx].bag;\n g[idx].child.emplace_back((int) g.size());\n g.emplace_back(r);\n }\n\n if(g[idx].child.size() == 2) {\n for(auto &ch : g[idx].child) {\n if(g[ch].bag != g[idx].bag) {\n DecompNode r;\n r.child.resize(1);\n r.child[0] = ch;\n r.bag = g[idx].bag;\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n }\n\n // introduce / forgot\n if(g[idx].child.size() == 1) {\n int &ch = g[idx].child[0];\n\n vector< int > latte, malta;\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\n g[ch].bag.begin(), g[ch].bag.end(),\n back_inserter(latte));\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\n g[idx].bag.begin(), g[idx].bag.end(),\n back_inserter(malta));\n if(latte.size() + malta.size() > 1) {\n DecompNode r;\n r.child = {ch};\n r.bag = g[idx].bag;\n if(!latte.empty()) {\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\n } else {\n r.bag.emplace_back(malta.back());\n }\n ch = (int) g.size();\n g.emplace_back(r);\n }\n }\n\n for(auto &ch : g[idx].child) {\n st.emplace(ch);\n }\n }\n return root;\n}\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n\n ModInt() : x(0) {}\n\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n\n ModInt operator-() const { return ModInt(-x); }\n\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\n bool operator==(const ModInt &p) const { return x == p.x; }\n\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nusing modint = ModInt< mod >;\n\nint main() {\n int N, M;\n while(cin >> N >> M, N) {\n TreeDecomposition g(N);\n set< pair< int, int > > edges;\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n --a, --b;\n edges.emplace(minmax(a, b));\n g.add_edge(a, b);\n }\n if(N == 3) {\n cout << 0 << endl;\n continue;\n }\n for(int i = 0; i < N; i++) {\n edges.emplace(minmax(i, (i + 1) % N));\n g.add_edge(i, (i + 1) % N);\n }\n auto t = g.build();\n int root = to_nice(t);\n vector< vector< modint > > dps(t.size());\n vector< int > buff(N), buff2(N, -1);\n\n MFP([&](auto rec, int idx) -> void {\n\n auto &ch = t[idx].child;\n auto &bag = t[idx].bag;\n\n for(auto &to : ch) rec(to);\n vector< modint > dp(1 << bag.size());\n\n if(ch.empty()) { // leaf\n dp[0] = 1;\n } else if(ch.size() == 2) { // join\n dp[0] = 1;\n for(auto &ch_dp : {dps[ch[0]], dps[ch[1]]}) {\n vector< modint > dp2(1 << bag.size(), 0);\n for(int i = 0; i < dp.size(); i++) {\n for(int j = 0; j < ch_dp.size(); j++) {\n if((i & j) == 0) dp2[i | j] += dp[i] * ch_dp[j];\n }\n }\n dp2.swap(dp);\n }\n } else {\n auto &ch_bag = t[ch[0]].bag;\n auto &ch_dp = dps[ch[0]];\n\n for(int i = 0; i < bag.size(); i++) {\n buff[bag[i]] = 1 << i;\n buff2[bag[i]] = idx;\n }\n\n if(ch_bag.size() + 1 == bag.size()) { // introduce\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\n }\n dp[bit] = ch_dp[i];\n }\n } else { // forgot\n int v = -1;\n for(int i = 0; i < ch_bag.size(); i++) {\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\n }\n vector< int > ok_match(bag.size());\n for(int i = 0; i < bag.size(); i++) {\n ok_match[i] = edges.count(minmax(bag[i], v));\n }\n for(int i = 0; i < ch_dp.size(); i++) {\n int bit = 0;\n bool v_use = false;\n for(int j = 0; j < ch_bag.size(); j++) {\n if((i >> j) & 1) {\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\n } else {\n if(v == ch_bag[j]) v_use = true;\n }\n }\n if(v_use) {\n for(int j = 0; j < bag.size(); j++) {\n if((bit >> j) & 1) continue;\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\n }\n } else {\n dp[bit] += ch_dp[i];\n }\n }\n }\n }\n dps[idx].swap(dp);\n })(root);\n auto &dp = dps[root];\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\n cout << dp.back() << endl;\n }\n}","accuracy":1,"time_ms":740,"memory_kb":57132,"score_of_the_acc":-0.6236,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2405_10826161\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nusing ull=unsigned long long;\\nusing P=pair<ll,ll>;\\ntemplate<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}\\ntemplate<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}\\ntemplate<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}\\ntemplate<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}\\ntemplate<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}\\ntemplate<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}\\ntemplate<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}\\ntemplate<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}\\ntemplate<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}\\n#define overload3(_1,_2,_3,name,...) name\\n#define rep1(i,n) for(int i=0;i<(int)(n);i++)\\n#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)\\n#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\\n#define reps(i,l,r) rep2(i,l,r)\\n#define all(x) x.begin(),x.end()\\n#define pcnt(x) __builtin_popcountll(x)\\n#define fin(x) return cout<<(x)<<'\\\\n',static_cast<void>(0)\\n#define yn(x) cout<<((x)?\\\"Yes\\\\n\\\":\\\"No\\\\n\\\")\\n#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())\\ntemplate<typename T>\\ninline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}\\nll myceil(ll a,ll b){return (a+b-1)/b;}\\ntemplate<typename T,size_t n,size_t id=0>\\nauto vec(const int (&d)[n],const T &init=T()){\\n if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));\\n else return init;\\n}\\n#ifdef LOCAL\\n#include<debug.h>\\n#define SWITCH(a,b) (a)\\n#else\\n#define debug(...) static_cast<void>(0)\\n#define debugg(...) static_cast<void>(0)\\n#define SWITCH(a,b) (b)\\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\\n#endif\\nstruct Timer{\\n clock_t start;\\n Timer(){\\n start=clock();\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout<<fixed<<setprecision(16);\\n }\\n inline double now(){return (double)(clock()-start)/1000;}\\n #ifdef LOCAL\\n ~Timer(){\\n cerr<<\\\"time:\\\";\\n cerr<<now();\\n cerr<<\\\"ms\\\\n\\\";\\n }\\n #endif\\n}timer;\\nvoid SOLVE();\\nint main(){\\n int testcase=1;\\n //cin>>testcase;\\n for(int i=0;i<testcase;i++){\\n SOLVE();\\n }\\n}\\n#include<type_traits>\\nnamespace Random{\\n std::mt19937_64 mt(std::random_device{}());\\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T> get(){return mt();}\\n template<typename T>inline std::enable_if_t<std::is_floating_point_v<T>,T> get(){return T(mt())/T(-1ull);}\\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T n){return mt()%n;}\\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T l,T r){return l+mt()%(r-l);}\\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,std::pair<T,T>>distinct(T n){\\n T l=mt()%n,r=mt()%(n-1);\\n if(l==r)r++;\\n if(l>r)std::swap(l,r);\\n return std::make_pair(l,r);\\n }\\n}\\n#include<concepts>\\ntemplate<typename T>\\nconstexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>msb(T n){return n==0?-1:31-__builtin_clz(n);}\\ntemplate<typename T>\\nconstexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>msb(T n){return n==0?-1:63-__builtin_clzll(n);}\\n\\ntemplate<typename T>\\nconstexpr std::enable_if_t<std::numeric_limits<T>::digits<=32,int>lsb(T n){return n==0?-1:__builtin_ctz(n);}\\ntemplate<typename T>\\nconstexpr std::enable_if_t<(std::numeric_limits<T>::digits>32),int>lsb(T n){return n==0?-1:__builtin_ctzll(n);}\\n\\ntemplate<typename T>\\nconstexpr std::enable_if_t<std::is_integral_v<T>,T>floor_pow2(T n){return n==0?0:T(1)<<msb(n);}\\n\\ntemplate<typename T>\\nconstexpr std::enable_if_t<std::is_integral_v<T>,T>ceil_pow2(T n){return n<=1?1:T(1)<<(msb(n-1)+1);}\\n\\ntemplate<std::integral T>\\nconstexpr T safe_div(T a,T b){return a/b-(a%b&&(a^b)<0);}\\ntemplate<std::integral T>\\nconstexpr T safe_ceil(T a,T b){return a/b+(a%b&&(a^b)>0);}\\n#include<initializer_list>\\nbool isprime(unsigned long long n)noexcept{\\n using u64=unsigned long long;\\n if(n<=1)return false;\\n if(n%2==0)return n==2;\\n u64 d=n-1;\\n int s=0;\\n while(!(d&1))d>>=1,s++;\\n int q=63;\\n while(!(d>>q))q--;\\n u64 r=n;\\n for(int i=0;i<5;i++)r*=2-r*n;\\n auto redc=[&r,&n](__uint128_t x)->u64 {\\n x=(x+__uint128_t(u64(x)*-r)*n)>>64;\\n return x>=n?x-n:x;\\n };\\n __uint128_t r2=-__uint128_t(n)%n;\\n u64 one=redc(r2);\\n for(u64 base:{2,325,9375,28178,450775,9780504,1795265022}){\\n if(base%n==0)continue;\\n u64 a=base=redc((base%n)*r2);\\n for(int i=q-1;i>=0;i--){\\n a=redc(__uint128_t(a)*a);\\n if(d>>i&1)a=redc(__uint128_t(a)*base);\\n }\\n if(a==one)continue;\\n for(int i=1;a!=n-one;i++){\\n if(i>=s)return false;\\n a=redc(__uint128_t(a)*a);\\n }\\n }\\n return true;\\n}\\nnamespace Random{\\ntemplate<typename T>\\ninline std::enable_if_t<std::is_integral_v<T>,T>prime(T l,T r){\\n T res=0;\\n while(!isprime(res))res=range(l,r);\\n return res;\\n}\\n}\\nstruct BarrettReduction{\\nprivate:\\n using i64=long long;\\n using u64=unsigned long long;\\n using u32=unsigned int;\\n using u128=__uint128_t;\\n u32 m;\\n u64 im;\\npublic:\\n BarrettReduction():m(0),im(0){}\\n BarrettReduction(u32 n):m(n),im(u64(-1)/n+1){}\\n inline i64 quo(u64 x)const{\\n if(m==1)return x;\\n u64 y=u64((u128(x)*im)>>64);\\n u32 r=x-y*m;\\n return m<=r?y-1:y;\\n }\\n inline u32 rem(u64 x)const{\\n if(m==1)return 0;\\n u64 y=u64((u128(x)*im)>>64);\\n u32 r=x-y*m;\\n return m<=r?r+m:r;\\n }\\n inline std::pair<u64,u32>quo_rem(u64 x)const{\\n if(m==0)return std::make_pair(x,0);\\n u64 y=u64((u128(x)*im)>>64);\\n u32 r=x-y*m;\\n return m<=r?std::make_pair(y-1,r+m):std::make_pair(y,r);\\n }\\n inline u32 pow(u32 a,u64 p)const{\\n u32 res=m!=1;\\n while(p){\\n if(p&1)res=rem(u64(res)*a);\\n a=rem(u64(a)*a);\\n p>>=1;\\n }\\n return res;\\n }\\n};\\ntemplate<typename Key,typename Val>\\nstruct HashMap{\\n static_assert(std::is_integral_v<Key>);\\nprivate:\\n const int p;\\n const Val def;\\n std::vector<Key>key;\\n std::vector<Val>value;\\n BarrettReduction brp,brp1;\\n static constexpr Key none=std::numeric_limits<std::make_signed_t<Key>>::max();\\npublic:\\n struct Iterator{\\n using k_itr=typename std::vector<Key>::const_iterator;\\n using v_itr=typename std::vector<Val>::iterator;\\n k_itr kp;\\n v_itr vp;\\n k_itr kp2;\\n Iterator operator++(){\\n ++kp,++vp;\\n step();\\n return *this;\\n }\\n inline void step(){\\n while(kp!=kp2&&(*kp)==none)++kp,++vp;\\n }\\n std::pair<const Key&,Val&> operator*(){\\n return {*kp,*vp};\\n }\\n bool operator!=(Iterator rhs){return kp!=rhs.kp;}\\n };\\n HashMap(){}\\n HashMap(int n,Val def_=Val()):def(def_),p(Random::prime(n*4/3,n*4/3+1000)){\\n key.resize(p,none);\\n value.resize(p,def);\\n brp=BarrettReduction(p);\\n brp1=BarrettReduction(p-1);\\n }\\n Val get(const Key&k)const{\\n int now=brp.rem(k);\\n int of=brp1.rem(k)+1;\\n while(key[now]!=none&&key[now]!=k){\\n now+=of;\\n if(now>=p)now-=p;\\n }\\n return key[now]==none?def:value[now];\\n }\\n Val& set(const Key&k){\\n int now=brp.rem(k);\\n int of=brp1.rem(k)+1;\\n while(key[now]!=none&&key[now]!=k){\\n now+=of;\\n if(now>=p)now-=p;\\n }\\n key[now]=k;\\n return value[now];\\n }\\n Val &operator[](const Key&k){return set(k);}\\n const Val& exist_get(const Key&k)const{\\n int now=brp.rem(k);\\n int of=brp1.rem(k)+1;\\n while(key[now]!=k){\\n now+=of;\\n if(now>=p)now-=p;\\n }\\n return value[now];\\n }\\n Iterator begin(){\\n Iterator res;\\n res.kp=key.begin();\\n res.vp=value.begin();\\n res.kp2=key.end();\\n res.step();\\n return res;\\n }\\n Iterator end(){\\n Iterator res;\\n res.kp=res.kp2=key.end();\\n res.vp=value.end();\\n return res;\\n }\\n};\\ntemplate<typename T=int>\\nstruct Edge{\\n int from,to;\\n T weight;\\n int index;\\n Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}\\n Edge():from(-1),to(-1),weight(),index(-1){}\\n friend std::ostream &operator<<(std::ostream &os,const Edge&e){\\n os<<'[';\\n os<<\\\"from:\\\"<<e.from;\\n os<<\\\"to:\\\"<<e.to;\\n os<<\\\"weight:\\\"<<e.weight;\\n os<<\\\"index:\\\"<<e.index;\\n os<<']';\\n return os;\\n }\\n};\\ntemplate<typename T=int>\\nstruct Graph{\\nprivate:\\n int n;\\n std::vector<Edge<T>>edge;\\n std::vector<Edge<T>>g;\\n std::vector<int>ptr;\\n bool directed;\\n struct graph_range{\\n using iterator=typename std::vector<Edge<T>>::iterator;\\n iterator l,r;\\n iterator begin()const{return l;}\\n iterator end()const{return r;}\\n int size()const{return r-l;}\\n Edge<T> &operator[](int i)const{return l[i];}\\n };\\n struct const_graph_range{\\n using iterator=typename std::vector<Edge<T>>::const_iterator;\\n iterator l,r;\\n iterator begin()const{return l;}\\n iterator end()const{return r;}\\n int size()const{return r-l;}\\n const Edge<T> &operator[](int i)const{return l[i];}\\n };\\npublic:\\n Graph(int n_,bool dir_):n(n_),directed(dir_){}\\n Graph():n(0){}\\n Graph(int n_,bool dir_,const std::vector<Edge<T>>&e):n(n_),directed(dir_),edge(e){build();}\\n template<bool weighted=false,bool index=1>\\n void read(int m){\\n edge.reserve(m);\\n for(int i=0;i<m;i++){\\n int u,v;\\n std::cin>>u>>v;\\n T w;\\n if constexpr(index)u--,v--;\\n if constexpr(weighted)std::cin>>w;\\n else w=1;\\n edge.emplace_back(u,v,w,i);\\n }\\n build();\\n }\\n void add_edge(int u,int v){\\n int id=edge.size();\\n edge.emplace_back(u,v,1,id);\\n }\\n void add_edge(int u,int v,T w){\\n int id=edge.size();\\n edge.emplace_back(u,v,w,id);\\n }\\n void add_edge(int u,int v,T w,int index){\\n edge.emplace_back(u,v,w,index);\\n }\\n void build(){\\n std::vector<int>cnt(n+1,0);\\n for(const Edge<T>&e:edge){\\n cnt[e.from+1]++;\\n if(!directed)cnt[e.to+1]++;\\n }\\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\\n ptr=cnt;\\n g.resize(cnt[n]);\\n for(const Edge<T>&e:edge){\\n g[cnt[e.from]++]=e;\\n if(!directed)g[cnt[e.to]++]=Edge<T>(e.to,e.from,e.weight,e.index);\\n }\\n }\\n void reverse(){\\n if(directed){\\n for(Edge<T>&e:edge)std::swap(e.from,e.to);\\n build();\\n }\\n }\\n inline void to_directed(){\\n directed=true;\\n build();\\n }\\n inline void to_undirected(){\\n directed=false;\\n build();\\n }\\n void reserve(int m){edge.reserve(m);}\\n graph_range operator[](int i){return graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const_graph_range operator[](int i)const{return const_graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const Edge<T>& get_edge(int i)const{return edge[i];}\\n std::vector<Edge<T>>get_edges()const{return edge;}\\n inline bool is_directed()const{return directed;}\\n inline int size()const{return n;}\\n inline int edge_size()const{return edge.size();}\\n typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}\\n typename std::vector<Edge<T>>::iterator end(){return edge.end();}\\n typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}\\n typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}\\n};\\ntemplate<typename T>\\nstd::pair<std::vector<std::pair<int,int>>,std::vector<std::array<int,3>>>nice_tree_decomposition(const Graph<T>&g){\\n assert(!g.is_directed());\\n std::vector<std::unordered_set<int>>adj(g.size());\\n for(const Edge<T>&e:g){\\n adj[e.from].insert(e.to);\\n adj[e.to].insert(e.from);\\n }\\n std::vector<int>deg(g.size());\\n std::queue<int>que;\\n for(int i=0;i<g.size();i++)if((deg[i]=adj[i].size())<=2)que.push(i);\\n std::vector<int>idx(g.size(),-1);\\n std::vector<std::pair<int,int>>child(1);\\n std::vector<std::array<int,3>>vs(1);\\n auto make_nice=[&](int&ch,const std::array<int,3>&par)->void {\\n std::array<int,3>ar;\\n int pos1=0,pos2=0;\\n while(pos1<3&&vs[ch][pos1]!=-1)pos1++;\\n while(pos2<3&&par[pos2]!=-1)pos2++;\\n for(int i=0;pos1>1;){\\n bool found=false;\\n for(;i<pos1;i++){\\n if(std::find(par.begin(),par.begin()+pos2,vs[ch][i])==par.begin()+pos2){\\n child.emplace_back(ch,-1);\\n assert(ch!=child.size()-1);\\n std::array<int,3>&fix=vs.emplace_back(vs[ch]);\\n for(int j=i;j+1<3;j++)fix[j]=fix[j+1];\\n fix[2]=-1;\\n ch=child.size()-1;\\n found=true;\\n pos1--;\\n break;\\n }\\n }\\n if(!found)break;\\n }\\n for(int i=0;i<pos2;i++){\\n if(std::find(vs[ch].begin(),vs[ch].begin()+pos1,par[i])==vs[ch].begin()+pos1){\\n child.emplace_back(ch,-1);\\n std::array<int,3>&fix=vs.emplace_back(vs[ch]);\\n fix[pos1++]=par[i];\\n ch=child.size()-1;\\n }\\n }\\n };\\n auto merge=[&](int lc,int rc,const std::array<int,3>&par)->int {\\n make_nice(lc,par);\\n make_nice(rc,par);\\n child.emplace_back(lc,rc);\\n vs.emplace_back(par);\\n return child.size()-1;\\n };\\n while(!que.empty()){\\n int x=que.front();que.pop();\\n if(idx[x]!=-1)continue;\\n std::array<int,3>v;\\n v[0]=x;\\n v[1]=v[2]=-1;\\n for(int y:adj[x]){\\n if(idx[y]==-1){\\n if(v[1]==-1)v[1]=y;\\n else v[2]=y;\\n }\\n }\\n std::pair<int,int>c=std::make_pair(-1,-1);\\n for(int y:adj[x])if(idx[y]>=0){\\n if(c.first==-1)c.first=idx[y];\\n else if(c.second==-1)c.second=idx[y];\\n else{\\n c.first=merge(c.first,c.second,v);\\n c.second=idx[y];\\n }\\n idx[y]=-2;\\n }\\n deg[x]=0;\\n if(c.first==-1){\\n idx[x]=child.size();\\n child.emplace_back(c);\\n vs.emplace_back(std::move(v));\\n int u=idx[x];\\n if(vs[u][2]!=-1){\\n child[u].first=child.size();\\n child.emplace_back(-1,-1);\\n vs.emplace_back(vs[u])[2]=-1;\\n u=child.size()-1;\\n }\\n if(vs[u][1]!=-1){\\n child[u].first=child.size();\\n child.emplace_back(-1,-1);\\n vs.emplace_back(vs[u])[1]=-1;\\n u=child.size()-1;\\n }\\n }\\n else if(c.second==-1){\\n make_nice(c.first,v);\\n idx[x]=c.first;\\n }\\n else{\\n idx[x]=merge(c.first,c.second,v);\\n }\\n if(v[1]!=-1){\\n if(v[2]!=-1){\\n if(adj[v[1]].contains(v[2])){\\n for(int i=1;i<=2;i++){\\n if(--deg[v[i]]<=2&&idx[v[i]]==-1)que.push(v[i]);\\n }\\n }\\n else{\\n adj[v[1]].insert(v[2]);\\n adj[v[2]].insert(v[1]);\\n }\\n }\\n else if(--deg[v[1]]<=2&&idx[v[1]]==-1)que.push(v[1]);\\n }\\n }\\n if(std::any_of(deg.begin(),deg.end(),[](int x){return x!=0;}))return {{},{}};\\n child[0]=std::move(child.back()),child.pop_back();\\n vs[0]=std::move(vs.back()),vs.pop_back();\\n que.push(0);\\n while(!que.empty()){\\n int x=que.front();que.pop();\\n if(child[x].second!=-1){\\n vs[child[x].first]=vs[child[x].second]=vs[x];\\n que.push(child[x].first);\\n que.push(child[x].second);\\n }\\n else if(child[x].first!=-1){\\n std::array<int,3>nxt=vs[x];\\n std::array<int,3>&nc=vs[child[x].first];\\n if(std::count(vs[x].begin(),vs[x].end(),-1)<std::count(nc.begin(),nc.end(),-1)){\\n for(int i=0;i<3;i++){\\n if(nxt[i]!=-1&&std::find(nc.begin(),nc.end(),nxt[i])==nc.end()){\\n nxt[i]=-1;\\n }\\n }\\n }\\n else{\\n for(int i=0;i<3;i++){\\n if(nc[i]!=-1&&std::find(vs[x].begin(),vs[x].end(),nc[i])==vs[x].end()){\\n nxt[std::find(nxt.begin(),nxt.end(),-1)-nxt.begin()]=nc[i];\\n }\\n }\\n }\\n nc=std::move(nxt);\\n que.push(child[x].first);\\n }\\n }\\n return std::make_pair(std::move(child),std::move(vs));\\n}\\n#include<optional>\\nconstexpr int carmichael_constexpr(int n){\\n if(n==998244353)return 998244352;\\n if(n==1000000007)return 1000000006;\\n if(n<=1)return n;\\n int res=1;\\n int t=0;\\n while(n%2==0){\\n n/=2;\\n t++;\\n }\\n if(t==2)res=2;\\n else if(t>=3)res=1<<(t-2);\\n for(int i=3;i*i<=n;i++)if(n%i==0){\\n int c=0;\\n while(n%i==0){\\n n/=i;\\n c++;\\n }\\n int prod=i-1;\\n for(int j=0;j<c-1;j++)prod*=i;\\n res=std::lcm(res,prod);\\n }\\n if(n!=1)res=std::lcm(res,n-1);\\n return res;\\n}\\ntemplate<int m>\\nstruct mod_int{\\nprivate:\\n static constexpr unsigned int umod=static_cast<unsigned int>(m);\\n static constexpr unsigned int car=carmichael_constexpr(m);\\n using uint=unsigned int;\\n using mint=mod_int;\\n uint v;\\n static_assert(m<uint(1)<<31);\\n mint sqrt_impl()const{\\n if(this->val()<=1)return *this;\\n if constexpr(m%8==1){\\n mint b=2;\\n while(b.pow((m-1)/2).val()==1)b++;\\n int m2=m-1,e=0;\\n while(m2%2==0)m2>>=1,e++;\\n mint x=this->pow((m2-1)/2);\\n mint y=(*this)*x*x;\\n x*=*this;\\n mint z=b.pow(m2);\\n while(y.val()!=1){\\n int j=0;\\n mint t=y;\\n while(t.val()!=1)t*=t,j++;\\n z=z.pow(1<<(e-j-1));\\n x*=z;\\n z*=z;\\n y*=z;e=j;\\n }\\n return x;\\n }\\n else if constexpr(m%8==5){\\n mint ret=this->pow((m+3)/8);\\n if((ret*ret).val()==this->val())return ret;\\n else return ret*mint::raw(2).pow((m-1)/4);\\n }\\n else{\\n return this->pow((m+1)/4);\\n }\\n }\\npublic:\\n using value_type=uint;\\n mod_int():v(0){}\\n template<typename T,std::enable_if_t<std::is_signed_v<T>,std::nullptr_t> =nullptr>\\n mod_int(T a){\\n a%=m;\\n if(a<0)v=a+umod;\\n else v=a;\\n }\\n template<typename T,std::enable_if_t<std::is_unsigned_v<T>,std::nullptr_t> =nullptr>\\n mod_int(T a):v(a%umod){}\\n static constexpr mint raw(int a){\\n mint ret;\\n ret.v=a;\\n return ret;\\n }\\n inline uint val()const{return this->v;}\\n static constexpr int mod(){return m;}\\n inline mint &operator+=(const mint &b){\\n this->v+=b.v;\\n if(this->v>=umod)this->v-=umod;\\n return *this;\\n }\\n inline mint &operator-=(const mint &b){\\n this->v-=b.v;\\n if(this->v>=umod)this->v+=umod;\\n return *this;\\n }\\n inline mint &operator*=(const mint &b){\\n this->v=((unsigned long long)this->v*b.v)%umod;\\n return *this;\\n }\\n inline mint &operator/=(const mint &b){\\n *this*=b.inv();\\n return *this;\\n }\\n inline mint operator+()const{return *this;}\\n inline mint operator-()const{return mint()-*this;}\\n friend inline mint operator+(const mint &a,const mint &b){return mint(a)+=b;}\\n friend inline mint operator-(const mint &a,const mint &b){return mint(a)-=b;}\\n friend inline mint operator*(const mint &a,const mint &b){return mint(a)*=b;}\\n friend inline mint operator/(const mint &a,const mint &b){return mint(a)/=b;}\\n friend inline bool operator==(const mint &a,const mint &b){return a.val()==b.val();}\\n friend inline bool operator!=(const mint &a,const mint &b){return !(a==b);}\\n inline mint operator++(int){\\n mint ret=*this;\\n *this+=mint::raw(1);\\n return ret;\\n }\\n inline mint operator--(int){\\n mint ret=*this;\\n *this-=mint::raw(1);\\n return ret;\\n }\\n mint pow(long long n)const{\\n mint ret=mint::raw(1),a(*this);\\n while(n){\\n if(n&1)ret*=a;\\n a*=a;\\n n>>=1;\\n }\\n return ret;\\n }\\n inline mint inv()const{\\n assert(this->v!=0);\\n return pow(car-1);\\n }\\n std::optional<mint>sqrt()const{\\n if(this->val()<=1||this->pow((m-1)/2)==1)return std::make_optional(this->sqrt_impl());\\n else return std::nullopt;\\n }\\n static constexpr unsigned int order(){return car;}\\n friend std::istream &operator>>(std::istream &is,mint &b){\\n long long a;\\n is>>a;\\n b=mint(a);\\n return is;\\n }\\n friend std::ostream &operator<<(std::ostream &os,const mint &b){\\n os<<b.val();\\n return os;\\n }\\n};\\ntemplate<int m>\\nstruct std::hash<mod_int<m>>{\\n std::size_t operator()(mod_int<m>x)const{\\n return std::hash<unsigned int>()(x.val());\\n }\\n};\\nusing mint998=mod_int<998244353>;\\nusing mint107=mod_int<1000000007>;\\nusing mint=mod_int<1000003>;\\nvoid SOLVE(){\\n while(true){\\n int n,m;\\n cin>>n>>m;\\n if(n==0)break;\\n if(n&1){\\n cout<<\\\"0\\\\n\\\";\\n continue;\\n }\\n Graph g(n,false);\\n g.reserve(n+m);\\n HashMap<ll,char>mp(n+m);\\n auto add_edge=[&](int u,int v)->void {\\n if(u>v)swap(u,v);\\n mp[ll(u)*n+v]=true;\\n g.add_edge(u,v);\\n };\\n auto find_edge=[&](int u,int v)->bool {\\n if(u>v)swap(u,v);\\n if(u==-1)return false;\\n return mp.get(ll(u)*n+v);\\n };\\n rep(i,n)add_edge(i,(i+1)%n);\\n rep(i,m){\\n int u,v;\\n cin>>u>>v;\\n u--,v--;\\n add_edge(u,v);\\n }\\n g.build();\\n auto result=nice_tree_decomposition(g);\\n auto child=result.first;\\n auto vs=result.second;\\n using Data=array<mint,8>;\\n auto dfs=[&](auto self,int x)->Data {\\n if(child[x].first==-1){\\n Data res;\\n res.fill(0);\\n res[0]=1;\\n return res;\\n }\\n else if(child[x].second==-1){\\n int c=child[x].first;\\n int pos=0;\\n while(vs[x][pos]==vs[c][pos])pos++;\\n Data cdp=self(self,c);\\n Data res;\\n res.fill(0);\\n if(vs[x][pos]==-1){//forget\\n rep(i,8){\\n if(i>>pos&1)res[i^(1<<pos)]+=cdp[i];\\n else{\\n rep(j,3)if(pos!=j&&!(i>>j&1)&&find_edge(vs[c][pos],vs[c][j])){\\n res[i|(1<<j)]+=cdp[i];\\n }\\n }\\n }\\n }\\n else{\\n res=cdp;\\n }\\n return res;\\n }\\n else{\\n auto ldp=self(self,child[x].first);\\n auto rdp=self(self,child[x].second);\\n Data res;\\n res.fill(0);\\n rep(i,8)rep(j,8){\\n if(i&j)continue;\\n res[i|j]+=ldp[i]*rdp[j];\\n }\\n return res;\\n }\\n };\\n auto dp=dfs(dfs,0);\\n int mask=0;\\n rep(i,3)if(vs[0][i]!=-1)mask|=1<<i;\\n cout<<dp[mask]<<'\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 56404,\n \"score_of_the_acc\": -0.5398,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2405_9403442\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nmap<pair<pair<ll,ll>,ll>,ll> DP;\\nvector<set<ll>> G;\\nvector<ll> Rightest;\\nconst ll mod=1000003;\\n\\nvoid dfs(ll L,ll R){\\n if(L>=R)return;\\n if(L+1==R){\\n DP[{{L,R},0}]=1;\\n DP[{{L,R},3}]=1;\\n return;\\n }\\n ll mid=R-1;\\n if(Rightest[R]>L){\\n mid=*(G[R].upper_bound(L));\\n }\\n if((mid-L)!=1){\\n dfs(L,mid);\\n }\\n else{\\n DP[{{L,mid},0}]=1;\\n DP[{{L,mid},3}]=1;\\n }\\n if((R-mid)!=1){\\n dfs(mid,R);\\n }\\n else{\\n DP[{{mid,R},0}]=1;\\n DP[{{mid,R},3}]=1;\\n }\\n \\n\\n rep(lbit,4)rep(rbit,4){\\n ll d=(lbit%2)+(rbit/2);\\n if(d!=1)continue;\\n ll nl=lbit/2;\\n ll nr=rbit%2;\\n DP[{{L,R},nl*2+nr}]+=DP[{{L,mid},lbit}]*DP[{{mid,R},rbit}]%mod;\\n if(nl*2+nr==0&&G[L].count(R)){\\n DP[{{L,R},3}]+=DP[{{L,mid},lbit}]*DP[{{mid,R},rbit}]%mod;\\n }\\n }\\n rep(i,4){\\n DP[{{L,R},i}]%=mod;\\n }\\n return;\\n\\n \\n}\\n\\n\\nvoid solve(ll N,ll M) {\\n DP.clear();\\n G.resize(N);\\n rep(i,N)G[i].clear();\\n Rightest.assign(N,-1e18);\\n Rightest[N-1]=0;\\n rep(i,M){\\n ll A,B;\\n cin>>A>>B;\\n A--,B--;\\n if(A>B)swap(A,B);\\n if((B-A)%2==1){\\n G[A].insert(B);\\n G[B].insert(A);\\n Rightest[B]=max(Rightest[B],A);\\n }\\n }\\n G[0].insert(N-1);\\n if(N%2==1){\\n cout<<0<<endl;\\n return;\\n }\\n\\n dfs(0,N-1);\\n cout<<DP[{{0,N-1},3}]<<endl;\\n \\n}\\n\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N,K;\\n while (cin >> N>>K, N != 0)solve(N,K);\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 49480,\n \"score_of_the_acc\": -0.5994,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2405_9267166\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nbool is_end = false;\\nconst ll MOD = 1000003;\\n\\nll calc_dp(int left, int right, map<array<int, 2>, int> &mp, const vector<vector<ll>> &edge, const vector<int> &next_v)\\n{\\n // cout << left << \\\" \\\" << right << endl;\\n assert(left % 2 == right % 2);\\n \\n if (left >= right)\\n {\\n return 1;\\n }\\n if (mp.find({left, right}) != mp.end())\\n {\\n return mp[{left, right}];\\n }\\n \\n ll ret = 0;\\n for (auto mid : edge[left])\\n {\\n ret += calc_dp(left + 1, mid - 1, mp, edge, next_v) * calc_dp(next_v[mid], right, mp, edge, next_v);\\n }\\n return mp[{left, right}] = ret % MOD;\\n}\\n\\n\\nvoid solve()\\n{\\n ll N, M; cin >> N >> M;\\n if (N == 0 && M == 0)\\n {\\n is_end = true;\\n return;\\n }\\n \\n if (N % 2 == 1)\\n {\\n cout << 0 << endl;\\n return;\\n }\\n \\n vector<vector<ll>> edge(N);\\n for (int i = 0; i < M; ++i)\\n {\\n ll a, b; cin >> a >> b;\\n a--, b--;\\n ll c = min(a, b), d = max(a, b) + 1;\\n if (c % 2 == d % 2) edge[c].emplace_back(d);\\n }\\n vector<int> next_v(N+1, 0);\\n {\\n ll nxt = N;\\n for (int i = N; i >= 0; i -= 2)\\n {\\n if (edge[i].size()) nxt = i;\\n next_v[i] = nxt;\\n }\\n nxt = N - 1;\\n for (int i = N - 1; i >= 0; i -= 2)\\n {\\n if (edge[i].size()) nxt = i;\\n next_v[i] = nxt;\\n }\\n \\n // for (int i = 0; i < N; ++i)\\n // {\\n // cout << i << \\\" \\\" << next_v[i] << endl;\\n // }\\n }\\n \\n for (int i = 0; i < N - 1; ++i)\\n {\\n edge[i].emplace_back(i+2);\\n }\\n edge[0].emplace_back(N);\\n for (int i = 0; i < N; ++i)\\n {\\n sort(edge[i].begin(), edge[i].end());\\n }\\n \\n map<array<int, 2>, int> mp;\\n ll res = calc_dp(0, N, mp, edge, next_v);\\n cout << res << endl;\\n \\n return;\\n}\\n\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 14124,\n \"score_of_the_acc\": -0.0925,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2405_9099293\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n// #include<sys/time.h>\\n// #include<atcoder/fenwicktree>\\n\\nusing namespace std;\\n\\n// using mint = atcoder::modint1000000007;\\n\\nusing P = pair<int, int>;\\n\\nconst int mod = 1000003;\\nvector<vector<int>> edge;\\n\\narray<long long, 4> dfs(int l, int r) {\\n if (l == r - 1) {\\n return { 1, 0, 0, 1 };\\n }\\n bool lr = false;\\n if (edge[l].back() == r) {\\n lr = true;\\n edge[l].pop_back();\\n }\\n int m = edge[l].back();\\n auto vl = dfs(l, m);\\n auto vr = dfs(m, r);\\n array<long long, 4> res{};\\n res[0] = (vl[0] * vr[2] + vl[1] * vr[0]) % mod;\\n res[1] = (vl[0] * vr[3] + vl[1] * vr[1]) % mod;\\n res[2] = (vl[2] * vr[2] + vl[3] * vr[0]) % mod;\\n res[3] = (vl[2] * vr[3] + vl[3] * vr[1]) % mod;\\n if (lr) {\\n res[3] = (res[3] + vl[0] * vr[2] + vl[1] * vr[0]) % mod;\\n }\\n return res;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0) break;\\n\\n edge = vector<vector<int>>(n);\\n for (int i = 0; i + 1 < n; ++i) {\\n edge[i].push_back(i + 1);\\n }\\n edge[0].push_back(n - 1);\\n for (int i = 0; i < m; ++i) {\\n int u, v;\\n cin >> u >> v;\\n --u;\\n --v;\\n if (u > v) {\\n swap(u, v);\\n }\\n edge[u].push_back(v);\\n }\\n for (int i = 0; i < n; ++i) {\\n sort(edge[i].begin(), edge[i].end());\\n }\\n auto res = dfs(0, n - 1);\\n cout << res[3] << '\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 15316,\n \"score_of_the_acc\": -0.0918,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2405_9096892\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n// #include<sys/time.h>\\n// #include<atcoder/fenwicktree>\\n\\nusing namespace std;\\n\\n// using mint = atcoder::modint1000000007;\\n\\nusing P = pair<int, int>;\\n\\nconst int mod = 1000003;\\nvector<vector<int>> edge;\\nunordered_map<long long, array<long long, 4>> memo;\\n\\narray<long long, 4> dfs(int l, int r) {\\n if (l == r - 1) {\\n return { 1, 0, 0, 1 };\\n }\\n long long h = l * (long long)mod + r;\\n if (memo.count(h)) {\\n return memo[h];\\n }\\n bool lr = false;\\n if (edge[l].back() == r) {\\n lr = true;\\n edge[l].pop_back();\\n }\\n int m = edge[l].back();\\n auto vl = dfs(l, m);\\n auto vr = dfs(m, r);\\n array<long long, 4> res{};\\n res[0] = (vl[0] * vr[2] + vl[1] * vr[0]) % mod;\\n res[1] = (vl[0] * vr[3] + vl[1] * vr[1]) % mod;\\n res[2] = (vl[2] * vr[2] + vl[3] * vr[0]) % mod;\\n res[3] = (vl[2] * vr[3] + vl[3] * vr[1]) % mod;\\n if (lr) {\\n res[3] = (res[3] + vl[0] * vr[2] + vl[1] * vr[0]) % mod;\\n }\\n return memo[h] = res;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0) break;\\n\\n edge = vector<vector<int>>(n);\\n memo = unordered_map<long long, array<long long, 4>>();\\n for (int i = 0; i + 1 < n; ++i) {\\n edge[i].push_back(i + 1);\\n }\\n edge[0].push_back(n - 1);\\n for (int i = 0; i < m; ++i) {\\n int u, v;\\n cin >> u >> v;\\n --u;\\n --v;\\n if (u > v) {\\n swap(u, v);\\n }\\n edge[u].push_back(v);\\n }\\n for (int i = 0; i < n; ++i) {\\n sort(edge[i].begin(), edge[i].end());\\n }\\n auto res = dfs(0, n - 1);\\n cout << res[3] << '\\\\n';\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 19480,\n \"score_of_the_acc\": -0.1391,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2405_8492342\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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 rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)), end(v));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst int inf = (1 << 30) - 1;\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\ntemplate <int mod>\\nstruct modint {\\n int x;\\n\\n modint() : x(0) {}\\n\\n modint(ll y) {\\n x = y % mod;\\n if (x < 0) x += mod;\\n }\\n\\n static int get_mod() { return mod; }\\n\\n modint &operator+=(modint p) {\\n x += p.x;\\n if (x >= mod) x -= mod;\\n return *this;\\n }\\n\\n modint &operator-=(modint p) {\\n x -= p.x;\\n if (x < 0) x += mod;\\n return *this;\\n }\\n\\n modint &operator*=(modint p) {\\n x = (1LL * x * p.x) % mod;\\n return *this;\\n }\\n\\n modint &operator/=(modint p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n modint operator-() { return modint(-x); }\\n modint operator+(modint p) { return modint(*this) += p; }\\n modint operator-(modint p) { return modint(*this) -= p; }\\n modint operator*(modint p) { return modint(*this) *= p; }\\n modint operator/(modint p) { return modint(*this) /= p; }\\n bool operator==(modint p) { return x == p.x; }\\n bool operator!=(modint p) { return x != p.x; }\\n\\n modint pow(ll k) {\\n modint ret = 1, now = *this;\\n while (k > 0) {\\n if (k & 1) ret *= now;\\n now *= now;\\n k >>= 1;\\n }\\n return ret;\\n }\\n\\n modint inverse() { return pow(mod - 2); }\\n\\n friend istream &operator>>(istream &is, modint &p) {\\n ll y;\\n is >> y;\\n p = modint(y);\\n return is;\\n }\\n\\n friend ostream &operator<<(ostream &os, modint p) { return os << p.x; }\\n};\\n\\nusing mint = modint<1000003>;\\n\\nvoid solve() {\\n int N, M;\\n cin >> N >> M;\\n\\n if (N == 0 && M == 0) exit(0);\\n\\n vector<int> IN(N, 0), OUT(N, 0);\\n\\n rep(i, M) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n if (u > v) swap(u, v);\\n if (u % 2 == v % 2) continue;\\n IN[u]++, OUT[v]++;\\n }\\n\\n IN[0]++, OUT[N - 1]++;\\n\\n if (N & 1) {\\n cout << 0 << '\\\\n';\\n return;\\n }\\n\\n vector<int> l, r;\\n vector<vector<int>> es;\\n\\n stack<int> st;\\n\\n rep(i, N) {\\n rep(j, OUT[i]) {\\n assert(!empty(st));\\n int v = st.top();\\n st.pop();\\n r[v] = i;\\n if (!empty(st)) {\\n int p = st.top();\\n es[p].eb(v);\\n }\\n }\\n rep(j, IN[i]) {\\n int v = sz(l);\\n l.eb(i), r.eb(-1);\\n es.eb();\\n st.emplace(v);\\n }\\n }\\n\\n auto rec = [&](auto &&rec, int now) -> pair<mint, mint> {\\n int L = sz(es[now]);\\n vector<pair<mint, mint>> ps(L);\\n rep(i, L) {\\n int e = es[now][i];\\n ps[i] = rec(rec, e);\\n }\\n\\n auto count = [&](int s) {\\n mint ret = 1;\\n rep(i, L) {\\n int e = es[now][i];\\n if (l[e] < s || l[e] % 2 != s % 2) {\\n ret *= ps[i].second;\\n } else {\\n ret *= ps[i].first;\\n }\\n }\\n return ret;\\n };\\n\\n mint x = count(l[now]), y = count(l[now] + 1);\\n\\n return make_pair(x + y, y);\\n };\\n\\n auto [x, y] = rec(rec, 0);\\n cout << x << '\\\\n';\\n}\\n\\nint main() {\\n while (true) solve(); //\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7848,\n \"score_of_the_acc\": -0.012,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2405_8305291\",\n \"code_snippet\": \"#include <iostream>\\n#include <set>\\n#include <vector>\\nusing namespace std;\\n\\nconst long long mod = 1000003;\\nlong long N;\\nlong long M, A[200009], B[200009];\\nlong long DP[200009][3];\\nlong long NumArea = 1;\\nset<pair<int, int>> Set;\\nvector<pair<int, int>> G[200009];\\n\\nvoid Initialize() {\\n\\tNumArea = 1;\\n\\tSet.clear();\\n\\tfor (int i = 0; i < 200000; i++) {\\n\\t\\tA[i] = 0; B[i] = 0; G[i].clear();\\n\\t\\tfor (int j = 0; j < 3; j++) DP[i][j] = 0;\\n\\t}\\n}\\n\\nvoid dfs(int pos, int cl, int cr) {\\n\\tvector<pair<int, int>> Edges;\\n\\tint cur = cl; if (cl == -1) cur = 0;\\n\\tint target = cr; if (cr == -1) target = 100000000;\\n\\n\\t// Get Childs\\n\\twhile (true) {\\n\\t\\tauto itr = Set.lower_bound(make_pair(cur, -target));\\n\\t\\tif (Edges.size() == 0 || (cl == -1 && Edges.size() == 1)) itr = Set.lower_bound(make_pair(cur, -target + 1));\\n\\n\\t\\t// Add Edges\\n\\t\\tint pl = (*itr).first;\\n\\t\\tint pr = -(*itr).second;\\n\\t\\tif (cr != -1 && pl >= cr) break;\\n\\t\\tif (cr == -1 && Edges.size() >= 1 && pl >= Edges[0].first + N) break;\\n\\t\\tEdges.push_back(make_pair(pl, pr));\\n\\t\\tcur = pr;\\n\\t\\tif (cr == -1 && Edges.size() == 1) target = pl + N;\\n\\t}\\n\\n\\t// DFS\\n\\tint BASE = NumArea; NumArea += Edges.size();\\n\\tfor (int i = 0; i < Edges.size(); i++) {\\n\\t\\tint col = Edges[i].first % 2;\\n\\t\\tif (Edges[i].first % 2 == Edges[i].second % 2) col = -1;\\n\\t\\tG[pos].push_back(make_pair(BASE + i, col));\\n\\t}\\n\\tfor (int i = 0; i < Edges.size(); i++) dfs(BASE + i, Edges[i].first, Edges[i].second);\\n}\\n\\nvoid dfs2(int pos) {\\n\\t// Recursion\\n\\tfor (pair<int, int> i : G[pos]) dfs2(i.first);\\n\\tlong long Way0 = 1;\\n\\tlong long Way1 = 1;\\n\\tlong long WayN = 1;\\n\\n\\t// Multiplication\\n\\tfor (int i = 0; i < G[pos].size(); i++) {\\n\\t\\tint to = G[pos][i].first;\\n\\t\\tint col = G[pos][i].second;\\n\\t\\tif (col == 0) Way0 *= (DP[to][0] + DP[to][1] + DP[to][2] + DP[to][2]);\\n\\t\\tif (col != 0) Way0 *= (DP[to][0] + DP[to][2]);\\n\\t\\tif (col == 1) Way1 *= (DP[to][0] + DP[to][1] + DP[to][2] + DP[to][2]);\\n\\t\\tif (col != 1) Way1 *= (DP[to][1] + DP[to][2]);\\n\\t\\tWayN *= DP[to][2];\\n\\t\\tWay0 %= mod; Way1 %= mod; WayN %= mod;\\n\\t}\\n\\tDP[pos][0] += (Way0 - WayN + mod) % mod;\\n\\tDP[pos][1] += (Way1 - WayN + mod) % mod;\\n\\tDP[pos][2] += WayN;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\t// Step 1. Input\\n\\t\\tInitialize();\\n\\t\\tcin >> N >> M; if (N + M == 0) break;\\n\\t\\tfor (int i = 0; i < M; i++) cin >> A[i] >> B[i];\\n\\t\\tfor (int i = 0; i < M; i++) A[i] -= 1;\\n\\t\\tfor (int i = 0; i < M; i++) B[i] -= 1;\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tif (A[i] > B[i]) swap(A[i], B[i]);\\n\\t\\t}\\n\\t\\tif (N % 2 == 1) {\\n\\t\\t\\tcout << \\\"0\\\" << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif (M == 0) {\\n\\t\\t\\tcout << \\\"2\\\" << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\t// Step 2. Make Tree\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 0, -(B[i] + N * 0)));\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 0, -(A[i] + N * 1)));\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 1, -(B[i] + N * 1)));\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 1, -(A[i] + N * 2)));\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(A[i] + N * 2, -(B[i] + N * 2)));\\n\\t\\tfor (int i = 0; i < M; i++) Set.insert(make_pair(B[i] + N * 2, -(A[i] + N * 3)));\\n\\t\\tdfs(0, -1, -1);\\n\\n\\t\\t// Step 3. Get Answer\\n\\t\\tdfs2(0);\\n\\t\\tcout << (DP[0][0] + DP[0][1] + 2LL) % mod << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 37540,\n \"score_of_the_acc\": -0.367,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2405_7069478\",\n \"code_snippet\": \"#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2405&lang=jp\\\"\\n\\n#include <iostream>\\n#include <map>\\n#include <set>\\n\\nconstexpr int mod = 1000003;\\n\\n#include <functional>\\n\\n#include <algorithm>\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\n#include <deque>\\n#include <optional>\\n#include <utility>\\n\\nnamespace suisen {\\n struct DecompNode {\\n std::vector<int> bag;\\n std::vector<int> adj;\\n };\\n struct DecompNodeRooted {\\n std::vector<int> bag;\\n int par;\\n std::vector<int> ch;\\n };\\n\\n struct TreeDecompositionTW2 {\\n TreeDecompositionTW2(const int n = 0, const std::vector<std::pair<int, int>>& edges = {}) : _n(n), _edges(edges) {}\\n TreeDecompositionTW2(const std::vector<std::vector<int>>& g) : TreeDecompositionTW2(g.size()) {\\n for (int i = 0; i < _n; ++i) for (int j : g[i]) if (i < j) add_edge(i, j);\\n }\\n\\n void add_edge(int u, int v) {\\n _edges.emplace_back(u, v);\\n }\\n\\n std::optional<std::vector<DecompNode>> decomp() const {\\n std::vector<std::vector<std::pair<int, int>>> g(_n);\\n for (auto [u, v] : _edges) if (u != v) {\\n if (u > v) std::swap(u, v);\\n const int du = g[u].size(), dv = g[v].size();\\n g[u].emplace_back(v, dv);\\n g[v].emplace_back(u, du);\\n }\\n\\n std::vector<int8_t> seen(_n, false);\\n std::deque<int> dq;\\n auto push_if_removable = [&](int i) {\\n if (g[i].size() > 2 or std::exchange(seen[i], true)) return;\\n if (g[i].size() == 2) dq.push_back(i);\\n else dq.push_front(i);\\n };\\n for (int i = 0; i < _n; ++i) push_if_removable(i);\\n\\n std::vector<int> roots;\\n std::vector<std::pair<int, int>> edges;\\n edges.reserve(_n - 1);\\n std::vector<std::vector<int>> bag(_n);\\n std::vector<std::vector<int>> link(_n);\\n\\n atcoder::dsu uf(_n);\\n for (int id = 0; id < _n; ++id) {\\n if (dq.empty()) return std::nullopt;\\n int u = dq.front();\\n dq.pop_front();\\n if (g[u].size() == 0) {\\n bag[id] = { u };\\n roots.push_back(id);\\n } else if (g[u].size() == 1) {\\n int v = remove_edge(g, u, 0);\\n push_if_removable(v);\\n bag[id] = { u, v };\\n link[v].push_back(id);\\n } else {\\n int v = remove_edge(g, u, 0);\\n int w = remove_edge(g, u, 0);\\n if (v > w) std::swap(v, w);\\n bag[id] = { u, v, w };\\n const int dv = g[v].size(), dw = g[w].size();\\n g[v].emplace_back(w, dw);\\n g[w].emplace_back(v, dv);\\n remove_multiedges(g, v, dv);\\n remove_multiedges(g, w, dw);\\n push_if_removable(v);\\n push_if_removable(w);\\n link[v].push_back(id);\\n link[w].push_back(id);\\n }\\n std::reverse(link[u].begin(), link[u].end());\\n for (int id2 : link[u]) if (not uf.same(id, id2)) {\\n edges.emplace_back(id, id2);\\n uf.merge(id, id2);\\n }\\n g[u].clear(), g[u].shrink_to_fit(), link[u].clear(), link[u].shrink_to_fit();\\n }\\n const int root_num = roots.size();\\n for (int i = 0; i < root_num - 1; ++i) {\\n edges.emplace_back(roots[i], roots[i + 1]);\\n }\\n std::vector<DecompNode> res(_n);\\n for (int i = 0; i < _n; ++i) {\\n res[i].bag = std::move(bag[i]);\\n std::sort(res[i].bag.begin(), res[i].bag.end());\\n }\\n for (auto& [i, j] : edges) {\\n res[i].adj.push_back(j);\\n res[j].adj.push_back(i);\\n }\\n return res;\\n }\\n std::optional<std::vector<DecompNodeRooted>> nice_decomp() const {\\n auto opt_decomp = decomp();\\n if (not opt_decomp.has_value()) return std::nullopt;\\n std::vector<DecompNodeRooted> res(_n);\\n for (int i = 0; i < _n; ++i) {\\n res[i].bag = std::move((*opt_decomp)[i].bag);\\n }\\n\\n const int root = 0;\\n\\n std::vector<std::vector<std::pair<int, int>>> adj_idx(_n);\\n for (int i = 0; i < _n; ++i) for (int j : (*opt_decomp)[i].adj) if (i < j) {\\n int u = i, v = j;\\n auto fix_deg = [&](int& z) {\\n if ((z == root) + adj_idx[z].size() != 3) return;\\n const int n = res.size();\\n const int idx_zw = 0;\\n const auto [w, idx_wz] = adj_idx[z][idx_zw];\\n auto& node = res.emplace_back();\\n node.bag = res[z].bag;\\n adj_idx.push_back({ { z, idx_zw }, { w, idx_wz } });\\n adj_idx[z][idx_zw] = { n, 0 };\\n adj_idx[w][idx_wz] = { n, 1 };\\n z = n;\\n };\\n fix_deg(u), fix_deg(v);\\n const int du = adj_idx[u].size(), dv = adj_idx[v].size();\\n adj_idx[u].emplace_back(v, dv);\\n adj_idx[v].emplace_back(u, du);\\n }\\n for (int i = 0; i < int(res.size()); ++i) {\\n res[i].ch.reserve(adj_idx[i].size());\\n for (auto [j, idx] : adj_idx[i]) res[i].ch.push_back(j);\\n adj_idx[i].clear(), adj_idx[i].shrink_to_fit();\\n }\\n adj_idx.clear(), adj_idx.shrink_to_fit();\\n\\n std::deque<int> dq{ root };\\n while (dq.size()) {\\n int u = dq.front();\\n dq.pop_front();\\n for (int v : res[u].ch) {\\n res[v].par = u;\\n res[v].ch.erase(std::find(res[v].ch.begin(), res[v].ch.end(), u));\\n dq.push_back(v);\\n }\\n\\n auto fix_path = [&](int u, int v) {\\n std::vector<int> dif;\\n std::set_difference(res[v].bag.begin(), res[v].bag.end(), res[u].bag.begin(), res[u].bag.end(), std::back_inserter(dif));\\n std::set_difference(res[u].bag.begin(), res[u].bag.end(), res[v].bag.begin(), res[v].bag.end(), std::back_inserter(dif));\\n assert(dif.size());\\n res[u].ch.erase(std::find(res[u].ch.begin(), res[u].ch.end(), v));\\n while (dif.size() > 1) {\\n const int n = res.size();\\n auto& node = res.emplace_back();\\n std::set_symmetric_difference(res[u].bag.begin(), res[u].bag.end(), std::prev(dif.end()), dif.end(), std::back_inserter(node.bag));\\n res[u].ch.push_back(n);\\n dif.pop_back();\\n node.par = u;\\n u = n;\\n }\\n res[u].ch.push_back(v);\\n res[v].par = u;\\n };\\n\\n if (res[u].ch.size() == 2) {\\n for (int v : res[u].ch) if (res[u].bag != res[v].bag) {\\n const int n = res.size();\\n *std::find(res[u].ch.begin(), res[u].ch.end(), v) = n;\\n auto& node = res.emplace_back();\\n node.bag = res[u].bag;\\n node.ch = { v };\\n node.par = u;\\n fix_path(n, v);\\n }\\n } else if (res[u].ch.size() == 1) {\\n fix_path(u, res[u].ch[0]);\\n } else if (res[u].ch.size() == 0) {\\n while (res[u].bag.size() > 1) {\\n const int n = res.size();\\n auto& node = res.emplace_back();\\n node.bag = std::vector<int>(res[u].bag.begin(), std::prev(res[u].bag.end()));\\n node.par = u;\\n res[u].ch.push_back(n);\\n u = n;\\n }\\n } else {\\n assert(false);\\n }\\n }\\n res[root].par = -1;\\n\\n return res;\\n }\\n\\n static void assert_nice(const std::vector<DecompNodeRooted>& nodes, int root) {\\n auto dfs = [&](auto dfs, int u) -> void {\\n for (int v : nodes[u].ch) dfs(dfs, v);\\n assert(nodes[u].ch.size() <= 2);\\n if (nodes[u].ch.size() == 2) {\\n int x = nodes[u].ch[0], y = nodes[u].ch[1];\\n assert(nodes[u].bag == nodes[x].bag and nodes[u].bag == nodes[y].bag);\\n } else if (nodes[u].ch.size() == 1) {\\n int x = nodes[u].ch[0];\\n std::vector<int> d;\\n std::set_symmetric_difference(nodes[u].bag.begin(), nodes[u].bag.end(), nodes[x].bag.begin(), nodes[x].bag.end(), std::back_inserter(d));\\n assert(d.size() == 1);\\n } else {\\n assert(nodes[u].bag.size() == 1);\\n }\\n };\\n dfs(dfs, root);\\n }\\n private:\\n int _n;\\n std::vector<std::pair<int, int>> _edges;\\n\\n static int remove_edge(std::vector<std::vector<std::pair<int, int>>>& g, int u, int idx_uv) {\\n auto [v, idx_vu] = g[u][idx_uv];\\n\\n if (idx_vu != int(g[v].size()) - 1) {\\n auto [w, idx_wv] = g[v].back();\\n std::swap(g[v][idx_vu], g[v].back());\\n g[w][idx_wv].second = idx_vu;\\n }\\n g[v].pop_back();\\n if (idx_uv != int(g[u].size()) - 1) {\\n auto [z, idx_zu] = g[u].back();\\n std::swap(g[u][idx_uv], g[u].back());\\n g[z][idx_zu].second = idx_uv;\\n }\\n g[u].pop_back();\\n\\n remove_multiedges(g, v, idx_vu);\\n remove_multiedges(g, u, idx_uv);\\n\\n return v;\\n }\\n static void remove_multiedges(std::vector<std::vector<std::pair<int, int>>>& g, int u, int idx_uv) {\\n auto is_unnecessary = [&](int idx_uv) {\\n const int du = int(g[u].size());\\n if (idx_uv >= du) return false;\\n if (idx_uv + 1 < du and g[u][idx_uv].first == g[u][idx_uv + 1].first) return true;\\n if (idx_uv + 2 < du and g[u][idx_uv].first == g[u][idx_uv + 2].first) return true;\\n if (idx_uv - 1 >= 0 and g[u][idx_uv].first == g[u][idx_uv - 1].first) return true;\\n if (idx_uv - 2 >= 0 and g[u][idx_uv].first == g[u][idx_uv - 2].first) return true;\\n return false;\\n };\\n while (is_unnecessary(idx_uv)) remove_edge(g, u, idx_uv);\\n }\\n };\\n} // namespace suisen\\n\\nnamespace suisen {\\n enum class NodeType {\\n LEAF,\\n INTRODUCE,\\n FORGET,\\n JOIN\\n };\\n\\n struct NiceDecompTree {\\n static constexpr int root = 0;\\n\\n NiceDecompTree() = default;\\n NiceDecompTree(std::vector<DecompNodeRooted>&& nodes) : _n(nodes.size()), _nodes(std::move(nodes)), _pst(_n, -1) {}\\n NiceDecompTree(const std::vector<DecompNodeRooted>& nodes) : _n(nodes.size()), _nodes(nodes), _pst(_n, -1) {}\\n NiceDecompTree(int n, const std::vector<std::pair<int, int>>& edges) : NiceDecompTree(*TreeDecompositionTW2{ n, edges }.nice_decomp()) {}\\n NiceDecompTree(const std::vector<std::vector<int>>& g) : NiceDecompTree(*TreeDecompositionTW2{ g }.nice_decomp()) {}\\n\\n int size() const { return _n; }\\n\\n NodeType get_node_type(int i) const {\\n if (_nodes[i].ch.size() == 0) return NodeType::LEAF;\\n if (_nodes[i].ch.size() == 2) return NodeType::JOIN;\\n if (_nodes[i].bag.size() > _nodes[_nodes[i].ch[0]].bag.size()) return NodeType::INTRODUCE;\\n return NodeType::FORGET;\\n }\\n std::vector<NodeType> get_node_types() const {\\n std::vector<NodeType> types(_n);\\n for (int i = 0; i < _n; ++i) types[i] = get_node_type(i);\\n return types;\\n }\\n\\n const DecompNodeRooted& operator[](int i) const { return _nodes[i]; }\\n DecompNodeRooted& operator[](int i) { return _nodes[i]; }\\n\\n template <typename T> T run_dp(\\n std::function<T(const DecompNodeRooted& node, int leaf_vertex)> leaf,\\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node, const T& child_result, int introduce_vertex)> introduce,\\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node, const T& child_result, int forget_vertex)> forget,\\n std::function<T(const DecompNodeRooted& node, const DecompNodeRooted& child_node_1, const T& child_result_1, const DecompNodeRooted& child_node_2, const T& child_result_2)> join\\n ) const {\\n prepare_post_order();\\n std::vector<T> dp(_n);\\n for (int i : _pst) {\\n dp[i] = [&, this] {\\n switch (get_node_type(i)) {\\n case NodeType::LEAF:\\n {\\n return leaf(_nodes[i], _nodes[i].bag[0]);\\n }\\n case NodeType::INTRODUCE:\\n {\\n int j = _nodes[i].ch[0];\\n int sj = _nodes[j].bag.size();\\n int v = _nodes[i].bag[sj];\\n for (int k = 0; k < sj; ++k) if (_nodes[i].bag[k] != _nodes[j].bag[k]) {\\n v = _nodes[i].bag[k];\\n break;\\n }\\n return introduce(_nodes[i], _nodes[j], dp[j], v);\\n }\\n case NodeType::FORGET:\\n {\\n int j = _nodes[i].ch[0];\\n int si = _nodes[i].bag.size();\\n int v = _nodes[j].bag[si];\\n for (int k = 0; k < si; ++k) if (_nodes[i].bag[k] != _nodes[j].bag[k]) {\\n v = _nodes[j].bag[k];\\n break;\\n }\\n return forget(_nodes[i], _nodes[j], dp[j], v);\\n }\\n case NodeType::JOIN:\\n {\\n int j = _nodes[i].ch[0], k = _nodes[i].ch[1];\\n return join(_nodes[i], _nodes[j], dp[j], _nodes[k], dp[k]);\\n }\\n default:\\n {\\n assert(false);\\n }\\n }\\n }();\\n }\\n return dp[root];\\n }\\n\\n private:\\n int _n;\\n std::vector<DecompNodeRooted> _nodes;\\n\\n mutable std::vector<int> _pst;\\n\\n void prepare_post_order() const {\\n if (_pst.empty() or _pst.front() >= 0) return;\\n auto it = _pst.begin();\\n std::vector<std::size_t> eid(_n, 0);\\n for (int cur = root; cur >= 0;) {\\n if (eid[cur] == _nodes[cur].ch.size()) {\\n *it++ = cur;\\n cur = _nodes[cur].par;\\n } else {\\n cur = _nodes[cur].ch[eid[cur]++];\\n }\\n }\\n }\\n };\\n} // namespace suisen\\n\\nusing match = std::pair<int, int>;\\nusing table_key = std::vector<match>;\\nusing table_value = long long;\\nusing table_entry = std::pair<table_key, table_value>;\\nusing table = std::map<table_key, long long>;\\n\\nstruct state {\\n static constexpr int Forgotten = -2;\\n static constexpr int None = -1;\\n table mp;\\n};\\n\\nvoid solve() {\\n using namespace suisen;\\n\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n\\n int n, m;\\n std::cin >> n >> m;\\n\\n if (n == 0 and m == 0) exit(0);\\n\\n std::vector<std::set<int>> adj(n);\\n\\n std::vector<std::pair<int, int>> edges;\\n for (int i = 0; i < n; ++i) {\\n edges.emplace_back(i, (i + 1) % n);\\n }\\n for (int i = 0; i < m; ++i) {\\n int u, v;\\n std::cin >> u >> v;\\n --u, --v;\\n edges.emplace_back(u, v);\\n }\\n\\n for (const auto &[u, v] : edges) {\\n adj[u].insert(v);\\n adj[v].insert(u);\\n }\\n\\n auto leaf = [&](const DecompNodeRooted&, int leaf_vertex) -> state {\\n return state { table{ table_entry{ table_key{ match{ leaf_vertex, state::None } }, table_value{ 1 } } } };\\n };\\n auto introduce = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result, int introduce_vertex) -> state {\\n table ndp;\\n for (auto [matching, val] : child_result.mp) {\\n {\\n auto nxt_matching = matching;\\n nxt_matching.emplace_back(introduce_vertex, state::None);\\n std::sort(nxt_matching.begin(), nxt_matching.end());\\n ndp[nxt_matching] += val;\\n }\\n const int k = matching.size();\\n for (int i = 0; i < k; ++i) {\\n auto [u, v] = matching[i];\\n if (v != state::None or adj[introduce_vertex].find(u) == adj[introduce_vertex].end()) continue;\\n auto nxt_matching = matching;\\n nxt_matching[i].second = introduce_vertex;\\n nxt_matching.emplace_back(introduce_vertex, u);\\n std::sort(nxt_matching.begin(), nxt_matching.end());\\n ndp[nxt_matching] += val;\\n }\\n }\\n for (auto &[_, val] : ndp) val %= mod;\\n return state { ndp };\\n };\\n auto forget = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result, int forget_vertex) -> state {\\n table ndp;\\n for (auto [matching, val] : child_result.mp) {\\n bool ok = true;\\n table_key nxt_matching;\\n for (auto [u, v] : matching) {\\n if (u == forget_vertex) {\\n ok &= v != state::None;\\n continue;\\n }\\n if (v == forget_vertex) {\\n nxt_matching.emplace_back(u, state::Forgotten);\\n } else {\\n nxt_matching.emplace_back(u, v);\\n }\\n }\\n if (not ok) {\\n continue;\\n }\\n std::sort(nxt_matching.begin(), nxt_matching.end());\\n ndp[nxt_matching] += val;\\n }\\n for (auto &[_, val] : ndp) val %= mod;\\n return state { ndp };\\n };\\n auto join = [&](const DecompNodeRooted&, const DecompNodeRooted&, const state& child_result_1, const DecompNodeRooted&, const state& child_result_2) -> state {\\n table ndp;\\n for (auto [matching1, val1] : child_result_1.mp) for (auto [matching2, val2] : child_result_2.mp) {\\n bool ok = true;\\n const int k = matching1.size();\\n table_key nxt_matching;\\n for (int i = 0; i < k; ++i) {\\n auto [u1, v1] = matching1[i];\\n auto [u2, v2] = matching2[i];\\n assert(u1 == u2);\\n if (v1 > v2) std::swap(v1, v2);\\n if (v1 == state::Forgotten) {\\n if (v2 == state::Forgotten) {\\n ok = false;\\n break;\\n } else if (v2 == state::None) {\\n nxt_matching.emplace_back(u1, v1);\\n } else {\\n ok = false;\\n break;\\n }\\n } else if (v1 == state::None) {\\n if (v2 == state::None) {\\n nxt_matching.emplace_back(u1, v1);\\n } else {\\n ok = false;\\n break;\\n }\\n } else {\\n if (v1 != v2) {\\n ok = false;\\n break;\\n } else {\\n nxt_matching.emplace_back(u1, v1);\\n }\\n }\\n if (not ok) break;\\n }\\n if (ok) {\\n std::sort(nxt_matching.begin(), nxt_matching.end());\\n ndp[nxt_matching] += val1 * val2;\\n }\\n }\\n for (auto &[_, val] : ndp) val %= mod;\\n return state { ndp };\\n };\\n\\n state dp_root = NiceDecompTree(n, edges).run_dp<state>(leaf, introduce, forget, join);\\n\\n long long ans = 0;\\n for (auto [matching, val] : dp_root.mp) {\\n bool ok = true;\\n for (auto &[u, v] : matching) {\\n if (v == state::None) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n ans += val;\\n }\\n }\\n\\n std::cout << ans % mod << std::endl;\\n}\\n\\nint main() {\\n while (true) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 103696,\n \"score_of_the_acc\": -1.1698,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2405_6000386\",\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 = 1000003;;\\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-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 << 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\\n\\n\\n\\nint n, m;\\nvoid solve() {\\n\\tvector<P> vp;\\n\\tvp.push_back({ 0,n - 1 });\\n\\trep(i, m) {\\n\\t\\tint l, r; cin >> l >> r; l--; r--;\\n\\t\\tif (l > r)swap(l, r);\\n\\t\\tvp.push_back({ l,r });\\n\\t}\\n\\tauto comp = [&](P a, P b) {\\n\\t\\treturn a.first != b.first ? a.first < b.first : a.second > b.second;\\n\\t};\\n\\tsort(all(vp), comp);\\n\\tvector<vector<int>> G(vp.size());\\n\\tvector<int> ind;\\n\\trep(i, vp.size()) {\\n\\t\\twhile (ind.size() && vp[ind.back()].second <= vp[i].first)ind.pop_back();\\n\\t\\tif (ind.size()) {\\n\\t\\t\\t//cout << \\\"? \\\" << ind.back() << \\\" \\\" << i << \\\"\\\\n\\\";\\n\\t\\t\\tG[ind.back()].push_back(i);\\n\\t\\t}\\n\\t\\tind.push_back(i);\\n\\t}\\n\\t//cout << G[0].size() << \\\"\\\\n\\\";\\n\\tusing ar = array<modint, 4>;\\n\\tfunction<ar(int)> dfs = [&](int id)->ar {\\n\\t\\tint l = vp[id].first;\\n\\t\\tint r = vp[id].second;\\n\\t\\tar res;\\n\\t\\tif (G[id].empty()) {\\n\\t\\t\\tif ((l + r) % 2) {\\n\\t\\t\\t\\tres = { 1,0,0,1 };\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tres = { 0,1,1,0 };\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\trep(i, G[id].size()) {\\n\\t\\t\\t\\tint to = G[id][i];\\n\\t\\t\\t\\tar nex = dfs(to);\\n\\t\\t\\t\\tif (i == 0) {\\n\\t\\t\\t\\t\\tres = nex;\\n\\t\\t\\t\\t\\t//cout << \\\"! \\\" << id << \\\" \\\" <<to<<\\\" \\\"<< vp[to].first << \\\" \\\" << l << \\\"\\\\n\\\";\\n\\t\\t\\t\\t\\tif ((vp[to].first + l) % 2) {\\n\\t\\t\\t\\t\\t\\tswap(res[0], res[1]);\\n\\t\\t\\t\\t\\t\\tswap(res[2], res[3]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tar ndp; rep(j, 4)ndp[j] = 0;\\n\\t\\t\\t\\t\\trep(j, 4) {\\n\\t\\t\\t\\t\\t\\trep(k, 4) {\\n\\t\\t\\t\\t\\t\\t\\tint c = vp[to].first - vp[G[id][i - 1]].second + 1;\\n\\t\\t\\t\\t\\t\\t\\tc %= 2;\\n\\t\\t\\t\\t\\t\\t\\tif (j & 2)c ^= 1;\\n\\t\\t\\t\\t\\t\\t\\tif (k & 1)c ^= 1;\\n\\t\\t\\t\\t\\t\\t\\tif (c)continue;\\n\\t\\t\\t\\t\\t\\t\\tint nj = 0;\\n\\t\\t\\t\\t\\t\\t\\tif (j & 1)nj |= 1;\\n\\t\\t\\t\\t\\t\\t\\tif (k & 2)nj |= 2;\\n\\t\\t\\t\\t\\t\\t\\tndp[nj] += res[j]*nex[k];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tswap(res, ndp);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint las = vp[G[id].back()].second;\\n\\t\\t\\tif((r + las) % 2) {\\n\\t\\t\\t\\tswap(res[0], res[2]);\\n\\t\\t\\t\\tswap(res[1], res[3]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tres[3] += res[0];\\n\\t\\t//cout << \\\"? \\\" << id;\\n\\t\\t//rep(j, 4)cout << \\\" \\\" << res[j];\\n\\t\\t//cout << \\\"\\\\n\\\";\\n\\t\\treturn res;\\n\\t};\\n\\tar a = dfs(0);\\n\\tcout << a[3] << \\\"\\\\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\\twhile(cin>>n>>m,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12640,\n \"score_of_the_acc\": -0.0628,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2405_5948566\",\n \"code_snippet\": \"#line 1 \\\"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma region Macros\\n// rep macro\\n#define foa(v, a) for(auto &v : a)\\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 i = 0; i < (x); ++i)\\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 REPSname(a, b, c, ...) c\\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\\n#define RREPname(a, b, c, d, e, ...) e\\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\\n#define RREPSname(a, b, c, ...) c\\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\\n\\n// name macro\\n#define pb push_back\\n#define eb emplace_back\\n#define SZ(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define popcnt(x) __builtin_popcountll(x)\\ntemplate <class T = int>\\nusing V = std::vector<T>;\\ntemplate <class T = int>\\nusing VV = std::vector<std::vector<T>>;\\ntemplate <class T>\\nusing pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\nusing ll = long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\nusing pii = std::pair<int, int>;\\nusing pll = std::pair<long long, long long>;\\n\\n// input macro\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n\\tis >> p.first >> p.second;\\n\\treturn is;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n\\tfor(T &i : v) is >> i;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\\n\\tstd::string s;\\n\\tis >> s;\\n\\t__int128_t ret = 0;\\n\\tfor(int i = 0; i < s.length(); i++)\\n\\t\\tif('0' <= s[i] and s[i] <= '9')\\n\\t\\t\\tret = 10 * ret + s[i] - '0';\\n\\ta = ret * (s[0] == '-' ? -1 : 1);\\n\\treturn is;\\n}\\nnamespace scanner {\\nvoid scan(int &a) { std::cin >> a; }\\nvoid scan(long long &a) { std::cin >> a; }\\nvoid scan(std::string &a) { std::cin >> a; }\\nvoid scan(char &a) { std::cin >> a; }\\nvoid scan(char a[]) { std::scanf(\\\"%s\\\", a); }\\nvoid scan(double &a) { std::cin >> a; }\\nvoid scan(long double &a) { std::cin >> a; }\\ntemplate <class T, class U>\\nvoid scan(std::pair<T, U> &p) { std::cin >> p; }\\ntemplate <class T>\\nvoid scan(std::vector<T> &a) { std::cin >> a; }\\nvoid INPUT() {}\\ntemplate <class Head, class... Tail>\\nvoid INPUT(Head &head, Tail &... tail) {\\n\\tscan(head);\\n\\tINPUT(tail...);\\n}\\n} // namespace scanner\\n#define VEC(type, name, size) \\\\\\n\\tstd::vector<type> name(size); \\\\\\n\\tscanner::INPUT(name)\\n#define VVEC(type, name, h, w) \\\\\\n\\tstd::vector<std::vector<type>> name(h, std::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\\tstd::string __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define CHAR(...) \\\\\\n\\tchar __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define DOUBLE(...) \\\\\\n\\tdouble __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n#define LD(...) \\\\\\n\\tlong double __VA_ARGS__; \\\\\\n\\tscanner::INPUT(__VA_ARGS__)\\n\\n// output-macro\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n\\tos << p.first << \\\" \\\" << p.second;\\n\\treturn os;\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {\\n\\tfor(int i = 0; i < int(a.size()); ++i) {\\n\\t\\tif(i) os << \\\" \\\";\\n\\t\\tos << a[i];\\n\\t}\\n\\treturn os;\\n}\\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\\n\\tstd::ostream::sentry s(dest);\\n\\tif(s) {\\n\\t\\t__uint128_t tmp = value < 0 ? -value : value;\\n\\t\\tchar buffer[128];\\n\\t\\tchar *d = std::end(buffer);\\n\\t\\tdo {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = \\\"0123456789\\\"[tmp % 10];\\n\\t\\t\\ttmp /= 10;\\n\\t\\t} while(tmp != 0);\\n\\t\\tif(value < 0) {\\n\\t\\t\\t--d;\\n\\t\\t\\t*d = '-';\\n\\t\\t}\\n\\t\\tint len = std::end(buffer) - d;\\n\\t\\tif(dest.rdbuf()->sputn(d, len) != len) {\\n\\t\\t\\tdest.setstate(std::ios_base::badbit);\\n\\t\\t}\\n\\t}\\n\\treturn dest;\\n}\\ntemplate <class T>\\nvoid print(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class Head, class... Tail>\\nvoid print(Head H, Tail... T) {\\n\\tstd::cout << H << ' ';\\n\\tprint(T...);\\n}\\ntemplate <class T>\\nvoid printel(const T a) { std::cout << a << '\\\\n'; }\\ntemplate <class T>\\nvoid printel(const std::vector<T> &a) {\\n\\tfor(const auto &v : a)\\n\\t\\tstd::cout << v << '\\\\n';\\n}\\ntemplate <class Head, class... Tail>\\nvoid printel(Head H, Tail... T) {\\n\\tstd::cout << H << '\\\\n';\\n\\tprintel(T...);\\n}\\nvoid Yes(const bool b = true) { std::cout << (b ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No() { std::cout << \\\"No\\\\n\\\"; }\\nvoid YES(const bool b = true) { std::cout << (b ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO() { std::cout << \\\"NO\\\\n\\\"; }\\nvoid err(const bool b = true) {\\n\\tif(b) {\\n\\t\\tstd::cout << \\\"-1\\\\n\\\", exit(0);\\n\\t}\\n}\\n\\n//debug macro\\nnamespace debugger {\\ntemplate <class T>\\nvoid view(const std::vector<T> &a) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << v << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\ntemplate <class T>\\nvoid view(const std::vector<std::vector<T>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &v : a) {\\n\\t\\tstd::cerr << \\\"\\\\t\\\";\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\"\\\\n\\\";\\n\\t}\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::vector<std::pair<T, U>> &a) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : a) std::cerr << \\\"\\\\t(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::map<T, U> &m) {\\n\\tstd::cerr << \\\"{\\\\n\\\";\\n\\tfor(const auto &p : m) std::cerr << \\\"\\\\t[\\\" << p.first << \\\"] : \\\" << p.second << \\\"\\\\n\\\";\\n\\tstd::cerr << \\\"}\\\";\\n}\\ntemplate <class T, class U>\\nvoid view(const std::pair<T, U> &p) { std::cerr << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\ntemplate <class T>\\nvoid view(const std::set<T> &s) {\\n\\tstd::cerr << \\\"{ \\\";\\n\\tfor(auto &v : s) {\\n\\t\\tview(v);\\n\\t\\tstd::cerr << \\\", \\\";\\n\\t}\\n\\tstd::cerr << \\\"\\\\b\\\\b }\\\";\\n}\\n\\ntemplate <class T>\\nvoid view(const T &e) { std::cerr << e; }\\n} // namespace debugger\\n#ifdef LOCAL\\nvoid debug_out() {}\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n\\tdebugger::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(false)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\n// vector macro\\ntemplate <class T>\\nint lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nint ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\\ntemplate <class T>\\nvoid UNIQUE(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<T> press(std::vector<T> &a) {\\n\\tauto res = a;\\n\\tUNIQUE(res);\\n\\tfor(auto &v : a)\\n\\t\\tv = lb(res, v);\\n\\treturn res;\\n}\\n#define SORTname(a, b, c, ...) c\\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\\n#define SORT0(a) std::sort((a).begin(), (a).end())\\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\\ntemplate <class T>\\nvoid ADD(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v += x;\\n}\\ntemplate <class T>\\nvoid SUB(std::vector<T> &a, const T x = 1) {\\n\\tfor(auto &v : a) v -= x;\\n}\\nstd::vector<std::pair<char, int>> rle(const string &s) {\\n\\tint n = s.size();\\n\\tstd::vector<std::pair<char, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and s[l] == s[r]; r++) {}\\n\\t\\tret.emplace_back(s[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T>\\nstd::vector<std::pair<T, int>> rle(const std::vector<T> &v) {\\n\\tint n = v.size();\\n\\tstd::vector<std::pair<T, int>> ret;\\n\\tfor(int l = 0; l < n;) {\\n\\t\\tint r = l + 1;\\n\\t\\tfor(; r < n and v[l] == v[r]; r++) {}\\n\\t\\tret.emplace_back(v[l], r - l);\\n\\t\\tl = r;\\n\\t}\\n\\treturn ret;\\n}\\nstd::vector<int> iota(int n) {\\n\\tstd::vector<int> p(n);\\n\\tstd::iota(p.begin(), p.end(), 0);\\n\\treturn p;\\n}\\ntemplate <class T>\\nstruct cum_vector {\\npublic:\\n\\tcum_vector() = default;\\n\\ttemplate <class U>\\n\\tcum_vector(const std::vector<U> &vec) : cum((int)vec.size() + 1) {\\n\\t\\tfor(int i = 0; i < (int)vec.size(); i++)\\n\\t\\t\\tcum[i + 1] = cum[i] + vec[i];\\n\\t}\\n\\tT prod(int l, int r) {\\n\\t\\treturn cum[r] - cum[l];\\n\\t}\\n\\nprivate:\\n\\tstd::vector<T> cum;\\n};\\n\\n// math macro\\ntemplate <class T, class U>\\ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\\ntemplate <class T, class U>\\ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\\ntemplate <class T>\\nT divup(T x, T y) { return (x + y - 1) / y; }\\ntemplate <class T>\\nT POW(T a, long long n) {\\n\\tT ret = 1;\\n\\twhile(n) {\\n\\t\\tif(n & 1) ret *= a;\\n\\t\\ta *= a;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\n// modpow\\nlong long POW(long long a, long long n, const int mod) {\\n\\tlong long ret = 1;\\n\\ta = (a % mod + mod) % mod;\\n\\twhile(n) {\\n\\t\\tif(n & 1) (ret *= a) %= mod;\\n\\t\\t(a *= a) %= mod;\\n\\t\\tn >>= 1;\\n\\t}\\n\\treturn ret;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f) {\\n\\twhile(abs(ok - ng) > 1) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\ntemplate <class T, class F>\\nT bin_search(T ok, T ng, const F &f, int loop) {\\n\\tfor(int i = 0; i < loop; i++) {\\n\\t\\tT mid = (ok + ng) >> 1;\\n\\t\\t(f(mid) ? ok : ng) = mid;\\n\\t}\\n\\treturn ok;\\n}\\n\\n// others\\nstruct fast_io {\\n\\tfast_io() {\\n\\t\\tios::sync_with_stdio(false);\\n\\t\\tcin.tie(nullptr);\\n\\t\\tcout << fixed << setprecision(15);\\n\\t}\\n} fast_io_;\\nconst int inf = 1e9;\\nconst ll INF = 1e18;\\n#pragma endregion\\n\\nvoid main_();\\n\\nint main() {\\n\\tmain_();\\n\\treturn 0;\\n}\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\\\"\\n\\n\\n\\n#line 6 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\\\"\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/internal_math.hpp\\\"\\n\\n\\n\\n#line 5 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/internal_math.hpp\\\"\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n// @param n `n < 2^32`\\n// @param m `1 <= m < 2^32`\\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n // y_max < m * (n + 1)\\n // floor(y_max / m) <= n\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 1 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/internal_type_traits.hpp\\\"\\n\\n\\n\\n#line 7 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/internal_type_traits.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 14 \\\"/Users/nok0/Documents/Programming/nok0/atcoder/modint.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 4 \\\"/Users/nok0/Documents/Programming/nok0/math/factorial.hpp\\\"\\n\\n#line 6 \\\"/Users/nok0/Documents/Programming/nok0/math/factorial.hpp\\\"\\n\\ntemplate <class T>\\nstruct factorial {\\npublic:\\n\\tstatic int MAX;\\n\\tstatic std::vector<T> fac, finv, inv;\\n\\n\\tfactorial() {}\\n\\n\\tT binom(int n, int r) {\\n\\t\\tif(n < r or n < 0 or r < 0) return T(0);\\n\\t\\tassert(n < MAX);\\n\\t\\treturn fac[n] * finv[r] * finv[n - r];\\n\\t}\\n\\n\\tT large_binom(int n, int r) {\\n\\t\\tif(n < r or n < 0 or r < 0) return T(0);\\n\\t\\tassert(r < MAX);\\n\\t\\tT ret = finv[r];\\n\\t\\tfor(int i = 1; i <= r; ++i)\\n\\t\\t\\tret *= (n + 1 - i);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tstatic void set_size(int n = 3000000) {\\n\\t\\tMAX = (n > 1 ? n : 1) + 1;\\n\\t\\tif((int)fac.size() >= MAX) return;\\n\\t\\tfac.resize(MAX);\\n\\t\\tfinv.resize(MAX);\\n\\t\\tinv.resize(MAX);\\n\\t\\tconst int MOD = T::mod();\\n\\t\\tfac[0] = fac[1] = 1;\\n\\t\\tfinv[0] = finv[1] = 1;\\n\\t\\tinv[1] = 1;\\n\\t\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\t\\tfac[i] = fac[i - 1] * i;\\n\\t\\t\\tinv[i] = (T)MOD - inv[MOD % i] * (MOD / i);\\n\\t\\t\\tfinv[i] = finv[i - 1] * inv[i];\\n\\t\\t}\\n\\t}\\n};\\ntemplate <class T>\\nint factorial<T>::MAX = 0;\\ntemplate <class T>\\nstd::vector<T> factorial<T>::fac;\\ntemplate <class T>\\nstd::vector<T> factorial<T>::finv;\\ntemplate <class T>\\nstd::vector<T> factorial<T>::inv;\\n#line 2 \\\"/Users/nok0/Documents/Programming/nok0/math/modint_iostream.hpp\\\"\\n\\n#line 4 \\\"/Users/nok0/Documents/Programming/nok0/math/modint_iostream.hpp\\\"\\ntemplate <int m>\\nstd::istream &std::operator>>(std::istream &is, atcoder::static_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &std::operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::ostream &std::operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &std::operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#line 3 \\\"f.cpp\\\"\\n\\nusing mint = atcoder::static_modint<1000003>;\\n\\nvoid main_() {\\n\\twhile(1) {\\n\\t\\tINT(n, m);\\n\\t\\tif(n & 1) {\\n\\t\\t\\tprint(0);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tV<pii> uv(m);\\n\\t\\tif(!n) break;\\n\\t\\tauto f_hash = [n](int l, int r) {\\n\\t\\t\\treturn (ll)l * n + r;\\n\\t\\t};\\n\\t\\tunordered_set<ll> es;\\n\\t\\tvector<vector<int>> valid(n);\\n\\t\\tREP(i, n - 1) {\\n\\t\\t\\tvalid[i].pb(i + 1);\\n\\t\\t}\\n\\t\\tREP(i, m) {\\n\\t\\t\\tINT(u, v);\\n\\t\\t\\t--u, --v;\\n\\t\\t\\tif(u > v) swap(u, v);\\n\\t\\t\\tes.insert(f_hash(u, v));\\n\\t\\t\\tuv[i] = {u, v};\\n\\t\\t\\tif((v - u) & 1) {\\n\\t\\t\\t\\tvalid[u].pb(v);\\n\\t\\t\\t\\tvalid[v].pb(u);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tREP(i, n) {\\n\\t\\t\\tSORT(valid[i]);\\n\\t\\t}\\n\\t\\tauto dp = [&](auto dp, int l, int r) -> mint {\\n\\t\\t\\tif(l + 1 == r) return 1;\\n\\t\\t\\tll h = f_hash(l, r);\\n\\t\\t\\tmint ret = 0;\\n\\t\\t\\tif(es.count(h)) ret += dp(dp, l + 1, r - 1);\\n\\t\\t\\tint x = lb(valid[l], r) - 1;\\n\\t\\t\\tif(x >= 0 and x < SZ(valid[l]) and valid[l][x] >= l) {\\n\\t\\t\\t\\tret += dp(dp, l, valid[l][x]) * dp(dp, valid[l][x] + 1, r);\\n\\t\\t\\t}\\n\\t\\t\\treturn ret;\\n\\t\\t};\\n\\t\\tmint res = 0;\\n\\t\\tres += dp(dp, 1, n - 2);\\n\\t\\tif(SZ(valid[0])) {\\n\\t\\t\\tint x = valid[0].back();\\n\\t\\t\\tif(x != n - 1) {\\n\\t\\t\\t\\tres += dp(dp, 0, x) * dp(dp, x + 1, n - 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprint(res);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6970,\n \"memory_kb\": 11384,\n \"score_of_the_acc\": -1.0484,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2405_5405430\",\n \"code_snippet\": \"#line 1 \\\"other/sister.cpp\\\"\\n// #undef _GLIBCXX_DEBUG\\n// #define NDEBUG\\n#include <bits/extc++.h>\\n\\n#line 2 \\\"Library/lib/alias\\\"\\n\\n/**\\n * @file alias\\n * @brief Alias\\n */\\n\\n#line 13 \\\"Library/lib/alias\\\"\\n\\n#line 2 \\\"Library/lib/bit\\\"\\n\\n#if __cplusplus > 201703L\\n\\n#include <bit>\\n\\n#else\\n\\n#ifndef _GLIBCXX_BIT\\n#define _GLIBCXX_BIT 1\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace std {\\n\\ntemplate <typename _Tp> constexpr int __countl_zero(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n\\n if (__x == 0) return _Nd;\\n\\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\\n\\n if\\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u) {\\n constexpr int __diff = _Nd_u - _Nd;\\n return __builtin_clz(__x) - __diff;\\n }\\n else if\\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) {\\n constexpr int __diff = _Nd_ul - _Nd;\\n return __builtin_clzl(__x) - __diff;\\n }\\n else if\\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) {\\n constexpr int __diff = _Nd_ull - _Nd;\\n return __builtin_clzll(__x) - __diff;\\n }\\n else // (_Nd > _Nd_ull)\\n {\\n static_assert(_Nd <= (2 * _Nd_ull),\\n \\\"Maximum supported integer size is 128-bit\\\");\\n\\n unsigned long long __high = __x >> _Nd_ull;\\n if (__high != 0) {\\n constexpr int __diff = (2 * _Nd_ull) - _Nd;\\n return __builtin_clzll(__high) - __diff;\\n }\\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\\n unsigned long long __low = __x & __max_ull;\\n return (_Nd - _Nd_ull) + __builtin_clzll(__low);\\n }\\n}\\n\\ntemplate <typename _Tp> constexpr int __countr_zero(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n\\n if (__x == 0) return _Nd;\\n\\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\\n\\n if\\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u)\\n return __builtin_ctz(__x);\\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) return __builtin_ctzl(__x);\\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) return __builtin_ctzll(__x);\\n else // (_Nd > _Nd_ull)\\n {\\n static_assert(_Nd <= (2 * _Nd_ull),\\n \\\"Maximum supported integer size is 128-bit\\\");\\n\\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\\n unsigned long long __low = __x & __max_ull;\\n if (__low != 0) return __builtin_ctzll(__low);\\n unsigned long long __high = __x >> _Nd_ull;\\n return __builtin_ctzll(__high) + _Nd_ull;\\n }\\n}\\n\\ntemplate <typename _Tp> constexpr int __popcount(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n\\n if (__x == 0) return 0;\\n\\n constexpr auto _Nd_ull = numeric_limits<unsigned long long>::digits;\\n constexpr auto _Nd_ul = numeric_limits<unsigned long>::digits;\\n constexpr auto _Nd_u = numeric_limits<unsigned>::digits;\\n\\n if\\n _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_u)\\n return __builtin_popcount(__x);\\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ul) return __builtin_popcountl(__x);\\n else if _GLIBCXX17_CONSTEXPR(_Nd <= _Nd_ull) return __builtin_popcountll(__x);\\n else // (_Nd > _Nd_ull)\\n {\\n static_assert(_Nd <= (2 * _Nd_ull),\\n \\\"Maximum supported integer size is 128-bit\\\");\\n\\n constexpr auto __max_ull = numeric_limits<unsigned long long>::max();\\n unsigned long long __low = __x & __max_ull;\\n unsigned long long __high = __x >> _Nd_ull;\\n return __builtin_popcountll(__low) + __builtin_popcountll(__high);\\n }\\n}\\n\\ntemplate <typename _Tp> constexpr _Tp __bit_ceil(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n if (__x == 0 || __x == 1) return 1;\\n auto __shift_exponent = _Nd - __countl_zero((_Tp)(__x - 1u));\\n#ifdef _GLIBCXX_HAVE_BUILTIN_IS_CONSTANT_EVALUATED\\n if (!__builtin_is_constant_evaluated()) {\\n __glibcxx_assert(__shift_exponent != numeric_limits<_Tp>::digits);\\n }\\n#endif\\n using __promoted_type = decltype(__x << 1);\\n if\\n _GLIBCXX17_CONSTEXPR(!is_same<__promoted_type, _Tp>::value) {\\n const int __extra_exp = sizeof(__promoted_type) / sizeof(_Tp) / 2;\\n __shift_exponent |= (__shift_exponent & _Nd) << __extra_exp;\\n }\\n return (_Tp)1u << __shift_exponent;\\n}\\n\\ntemplate <typename _Tp> constexpr _Tp __bit_floor(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n if (__x == 0) return 0;\\n return (_Tp)1u << (_Nd - __countl_zero((_Tp)(__x >> 1)));\\n}\\n\\ntemplate <typename _Tp> constexpr _Tp __bit_width(_Tp __x) noexcept {\\n constexpr auto _Nd = numeric_limits<_Tp>::digits;\\n return _Nd - __countl_zero(__x);\\n}\\n\\n} // namespace std\\n\\n#endif\\n\\n#endif\\n#line 2 \\\"Library/lib/limits\\\"\\n\\n#line 4 \\\"Library/lib/limits\\\"\\n\\nnamespace workspace {\\n\\ntemplate <class _Tp> struct numeric_limits : std::numeric_limits<_Tp> {};\\n\\n#ifdef __SIZEOF_INT128__\\n\\ntemplate <> struct numeric_limits<__uint128_t> {\\n constexpr static __uint128_t max() { return ~__uint128_t(0); }\\n constexpr static __uint128_t min() { return 0; }\\n};\\n\\ntemplate <> struct numeric_limits<__int128_t> {\\n constexpr static __int128_t max() {\\n return numeric_limits<__uint128_t>::max() >> 1;\\n }\\n constexpr static __int128_t min() { return -max() - 1; }\\n};\\n\\n#endif\\n\\n} // namespace workspace\\n#line 16 \\\"Library/lib/alias\\\"\\n\\nnamespace workspace {\\n\\nconstexpr char eol = '\\\\n';\\n\\nusing namespace std;\\n\\nusing i32 = int_least32_t;\\nusing u32 = uint_least32_t;\\nusing i64 = int_least64_t;\\nusing u64 = uint_least64_t;\\n\\n#ifdef __SIZEOF_INT128__\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n#else\\n#warning 128bit integer is not available.\\n#endif\\n\\nnamespace _alias_impl {\\n\\ntemplate <class> struct first_arg { using type = void; };\\n\\ntemplate <class _Tp, class = void> struct parse_comp : first_arg<_Tp> {};\\n\\ntemplate <class _Tp>\\nstruct parse_comp<_Tp, std::__void_t<decltype(&_Tp::operator())>>\\n : first_arg<decltype(&_Tp::operator())> {};\\n\\ntemplate <class _R, class _Tp, class... _Args>\\nstruct first_arg<_R(_Tp, _Args...)> {\\n using type = _Tp;\\n};\\n\\ntemplate <class _R, class _Tp, class... _Args>\\nstruct first_arg<_R (*)(_Tp, _Args...)> {\\n using type = _Tp;\\n};\\n\\ntemplate <class _G, class _R, class _Tp, class... _Args>\\nstruct first_arg<_R (_G::*)(_Tp, _Args...)> {\\n using type = _Tp;\\n};\\n\\ntemplate <class _G, class _R, class _Tp, class... _Args>\\nstruct first_arg<_R (_G::*)(_Tp, _Args...) const> {\\n using type = _Tp;\\n};\\n\\n} // namespace _alias_impl\\n\\ntemplate <class _Tp = void, class _Compare = std::less<_Tp>>\\ndecltype(auto) make_priority_queue(_Compare __x = _Compare()) noexcept {\\n using type = std::conditional_t<\\n std::is_void<_Tp>::value,\\n std::decay_t<typename _alias_impl::parse_comp<_Compare>::type>, _Tp>;\\n\\n return std::priority_queue<type, std::vector<type>, _Compare>(__x);\\n}\\n\\ntemplate <class _Tp = void, class _Compare = std::less<_Tp>>\\ndecltype(auto) make_set(_Compare __x = _Compare()) noexcept {\\n using type = std::conditional_t<\\n std::is_void<_Tp>::value,\\n std::decay_t<typename _alias_impl::parse_comp<_Compare>::type>, _Tp>;\\n\\n return std::set<type, _Compare>(__x);\\n}\\n\\ntemplate <class _Key, class _Mapped, class _Compare = std::less<_Key>>\\ndecltype(auto) make_map(_Compare __x = _Compare()) noexcept {\\n return std::map<_Key, _Mapped, _Compare>(__x);\\n}\\n\\ntemplate <class _T1, class _T2,\\n typename = decltype(std::declval<const _T2 &>() <\\n std::declval<const _T1 &>())>\\nconstexpr\\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\\n typename std::common_type<_T1, _T2>::type>::type\\n min(const _T1 &__x, const _T2 &__y) noexcept {\\n return __y < __x ? __y : __x;\\n}\\n\\ntemplate <class _T1, class _T2, class _Compare,\\n typename = decltype(std::declval<_Compare>()(\\n std::declval<const _T2 &>(), std::declval<const _T1 &>()))>\\nconstexpr\\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\\n typename std::common_type<_T1, _T2>::type>::type\\n min(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {\\n return __comp(__y, __x) ? __y : __x;\\n}\\n\\ntemplate <class _Tp, typename = decltype(std::declval<const _Tp &>() <\\n std::declval<const _Tp &>())>\\nconstexpr _Tp min(std::initializer_list<_Tp> __x) noexcept {\\n return *std::min_element(__x.begin(), __x.end());\\n}\\n\\ntemplate <class _Tp, class _Compare,\\n typename = decltype(std::declval<_Compare>()(\\n std::declval<const _Tp &>(), std::declval<const _Tp &>()))>\\nconstexpr _Tp min(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {\\n return *std::min_element(__x.begin(), __x.end(), __comp);\\n}\\n\\ntemplate <class _T1, class _T2,\\n typename = decltype(std::declval<const _T1 &>() <\\n std::declval<const _T2 &>())>\\n\\nconstexpr\\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\\n typename std::common_type<_T1, _T2>::type>::type\\n max(const _T1 &__x, const _T2 &__y) noexcept {\\n return __x < __y ? __y : __x;\\n}\\n\\ntemplate <class _T1, class _T2, class _Compare,\\n typename = decltype(std::declval<_Compare>()(\\n std::declval<const _T1 &>(), std::declval<const _T2 &>()))>\\nconstexpr\\n typename std::conditional<std::is_same<_T1, _T2>::value, const _T1 &,\\n typename std::common_type<_T1, _T2>::type>::type\\n max(const _T1 &__x, const _T2 &__y, _Compare __comp) noexcept {\\n return __comp(__x, __y) ? __y : __x;\\n}\\n\\ntemplate <class _Tp, typename = decltype(std::declval<const _Tp &>() <\\n std::declval<const _Tp &>())>\\nconstexpr _Tp max(std::initializer_list<_Tp> __x) noexcept {\\n return *std::max_element(__x.begin(), __x.end());\\n}\\n\\ntemplate <class _Tp, class _Compare,\\n typename = decltype(std::declval<_Compare>()(\\n std::declval<const _Tp &>(), std::declval<const _Tp &>()))>\\nconstexpr _Tp max(std::initializer_list<_Tp> __x, _Compare __comp) noexcept {\\n return *std::max_element(__x.begin(), __x.end(), __comp);\\n}\\n\\ntemplate <typename _Tp> constexpr _Tp __bsf(_Tp __x) noexcept {\\n return std::__countr_zero(__x);\\n}\\n\\ntemplate <typename _Tp> constexpr _Tp __bsr(_Tp __x) noexcept {\\n return std::__bit_width(__x) - 1;\\n}\\n\\n} // namespace workspace\\n#line 2 \\\"Library/src/modular/modint.hpp\\\"\\n\\n/**\\n * @file modint.hpp\\n *\\n * @brief Modular Arithmetic\\n */\\n\\n#line 12 \\\"Library/src/modular/modint.hpp\\\"\\n\\n#line 2 \\\"Library/src/number_theory/sqrt_mod.hpp\\\"\\n\\n/**\\n * @file sqrt_mod.hpp\\n * @brief Tonelli-Shanks Algorithm\\n */\\n\\n#line 2 \\\"Library/src/number_theory/pow_mod.hpp\\\"\\n\\n/**\\n * @file mod_pow.hpp\\n * @brief Modular Exponentiation\\n */\\n\\n#line 9 \\\"Library/src/number_theory/pow_mod.hpp\\\"\\n\\n#line 2 \\\"Library/src/utils/sfinae.hpp\\\"\\n\\n/**\\n * @file sfinae.hpp\\n * @brief SFINAE\\n */\\n\\n#line 10 \\\"Library/src/utils/sfinae.hpp\\\"\\n#include <type_traits>\\n\\n#ifndef __INT128_DEFINED__\\n\\n#ifdef __SIZEOF_INT128__\\n#define __INT128_DEFINED__ 1\\n#else\\n#define __INT128_DEFINED__ 0\\n#endif\\n\\n#endif\\n\\nnamespace std {\\n\\n#if __INT128_DEFINED__\\n\\ntemplate <> struct make_signed<__uint128_t> { using type = __int128_t; };\\ntemplate <> struct make_signed<__int128_t> { using type = __int128_t; };\\n\\ntemplate <> struct make_unsigned<__uint128_t> { using type = __uint128_t; };\\ntemplate <> struct make_unsigned<__int128_t> { using type = __uint128_t; };\\n\\ntemplate <> struct is_signed<__uint128_t> : std::false_type {};\\ntemplate <> struct is_signed<__int128_t> : std::true_type {};\\n\\ntemplate <> struct is_unsigned<__uint128_t> : std::true_type {};\\ntemplate <> struct is_unsigned<__int128_t> : std::false_type {};\\n\\n#endif\\n\\n} // namespace std\\n\\nnamespace workspace {\\n\\ntemplate <class Tp, class... Args> struct variadic_front { using type = Tp; };\\n\\ntemplate <class... Args> struct variadic_back;\\n\\ntemplate <class Tp> struct variadic_back<Tp> { using type = Tp; };\\n\\ntemplate <class Tp, class... Args> struct variadic_back<Tp, Args...> {\\n using type = typename variadic_back<Args...>::type;\\n};\\n\\ntemplate <class type, template <class> class trait>\\nusing enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;\\n\\n/**\\n * @brief Return type of subscripting ( @c [] ) access.\\n */\\ntemplate <class _Tp>\\nusing subscripted_type =\\n typename std::decay<decltype(std::declval<_Tp&>()[0])>::type;\\n\\ntemplate <class Container>\\nusing element_type = typename std::decay<decltype(\\n *std::begin(std::declval<Container&>()))>::type;\\n\\ntemplate <class _Tp, class = std::nullptr_t>\\nstruct has_begin : std::false_type {};\\n\\ntemplate <class _Tp>\\nstruct has_begin<_Tp, decltype(std::begin(std::declval<_Tp>()), nullptr)>\\n : std::true_type {};\\n\\ntemplate <class _Tp, class = std::nullptr_t>\\nstruct has_mod : std::false_type {};\\n\\ntemplate <class _Tp>\\nstruct has_mod<_Tp, decltype(_Tp::mod, nullptr)> : std::true_type {};\\n\\ntemplate <class _Tp, class = void> struct is_integral_ext : std::false_type {};\\ntemplate <class _Tp>\\nstruct is_integral_ext<\\n _Tp, typename std::enable_if<std::is_integral<_Tp>::value>::type>\\n : std::true_type {};\\n\\n#if __INT128_DEFINED__\\n\\ntemplate <> struct is_integral_ext<__int128_t> : std::true_type {};\\ntemplate <> struct is_integral_ext<__uint128_t> : std::true_type {};\\n\\n#endif\\n\\n#if __cplusplus >= 201402\\n\\ntemplate <class _Tp>\\nconstexpr static bool is_integral_ext_v = is_integral_ext<_Tp>::value;\\n\\n#endif\\n\\ntemplate <typename _Tp, typename = void> struct multiplicable_uint {\\n using type = uint_least32_t;\\n};\\ntemplate <typename _Tp>\\nstruct multiplicable_uint<\\n _Tp,\\n typename std::enable_if<(2 < sizeof(_Tp)) &&\\n (!__INT128_DEFINED__ || sizeof(_Tp) <= 4)>::type> {\\n using type = uint_least64_t;\\n};\\n\\n#if __INT128_DEFINED__\\n\\ntemplate <typename _Tp>\\nstruct multiplicable_uint<_Tp,\\n typename std::enable_if<(4 < sizeof(_Tp))>::type> {\\n using type = __uint128_t;\\n};\\n\\n#endif\\n\\ntemplate <typename _Tp> struct multiplicable_int {\\n using type =\\n typename std::make_signed<typename multiplicable_uint<_Tp>::type>::type;\\n};\\n\\ntemplate <typename _Tp> struct multiplicable {\\n using type = std::conditional_t<\\n is_integral_ext<_Tp>::value,\\n std::conditional_t<std::is_signed<_Tp>::value,\\n typename multiplicable_int<_Tp>::type,\\n typename multiplicable_uint<_Tp>::type>,\\n _Tp>;\\n};\\n\\n} // namespace workspace\\n#line 11 \\\"Library/src/number_theory/pow_mod.hpp\\\"\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Compile time modular exponentiation.\\n *\\n * @param __x\\n * @param __n Exponent\\n * @param __mod Modulus\\n * @return\\n */\\ntemplate <class _Tp>\\nconstexpr std::enable_if_t<(is_integral_ext<_Tp>::value), _Tp> pow_mod(\\n _Tp __x, _Tp __n, _Tp __mod) noexcept {\\n assert(__mod > 0);\\n\\n using mul_type = typename multiplicable_uint<_Tp>::type;\\n\\n if ((__x %= __mod) < 0) __x += __mod;\\n\\n mul_type __y{1};\\n\\n while (__n) {\\n if (__n & 1) (__y *= __x) %= __mod;\\n __x = (mul_type)__x * __x % __mod;\\n __n >>= 1;\\n }\\n\\n return __y;\\n};\\n\\n} // namespace workspace\\n#line 10 \\\"Library/src/number_theory/sqrt_mod.hpp\\\"\\n\\nnamespace workspace {\\n\\n/**\\n * @brief Compile time modular square root.\\n *\\n * @param __x\\n * @param __mod Modulus\\n * @return One if it exists. Otherwise -1.\\n */\\ntemplate <class _Tp>\\nconstexpr std::enable_if_t<(is_integral_ext<_Tp>::value), _Tp> sqrt_mod(\\n _Tp __x, _Tp __mod) noexcept {\\n assert(__mod > 0);\\n\\n using mul_type = typename multiplicable_uint<_Tp>::type;\\n\\n if ((__x %= __mod) < 0) __x += __mod;\\n\\n if (!__x) return 0;\\n\\n if (__mod == 2) return __x;\\n\\n if (pow_mod(__x, __mod >> 1, __mod) != 1) return -1;\\n\\n _Tp __z = __builtin_ctz(__mod - 1), __q = __mod >> __z;\\n\\n mul_type __a = pow_mod(__x, (__q + 1) >> 1, __mod), __b = 2;\\n while (pow_mod<_Tp>(__b, __mod >> 1, __mod) == 1) ++__b;\\n __b = pow_mod<_Tp>(__b, __q, __mod);\\n\\n _Tp __shift = 0;\\n\\n for (auto __r = __a * __a % __mod * pow_mod(__x, __mod - 2, __mod) % __mod;\\n __r != 1; (__r *= (__b *= __b) %= __mod) %= __mod) {\\n auto __bsf = __z;\\n\\n for (auto __e = __r; __e != 1; --__bsf) (__e *= __e) %= __mod;\\n\\n while (++__shift != __bsf) (__b *= __b) %= __mod;\\n\\n (__a *= __b) %= __mod;\\n }\\n\\n return __a;\\n};\\n\\n} // namespace workspace\\n#line 15 \\\"Library/src/modular/modint.hpp\\\"\\n\\nnamespace workspace {\\n\\nnamespace _modint_impl {\\n\\ntemplate <auto _Mod, unsigned _Storage> struct modint {\\n static_assert(is_integral_ext<decltype(_Mod)>::value,\\n \\\"_Mod must be integral type.\\\");\\n\\n using mod_type = std::make_signed_t<typename std::conditional<\\n 0 < _Mod, std::add_const_t<decltype(_Mod)>, decltype(_Mod)>::type>;\\n\\n using value_type = std::decay_t<mod_type>;\\n\\n using mul_type = typename multiplicable_uint<value_type>::type;\\n\\n // Modulus\\n static mod_type mod;\\n\\n static unsigned storage;\\n\\n private:\\n value_type value = 0;\\n\\n struct direct_ctor_t {};\\n constexpr static direct_ctor_t direct_ctor_tag{};\\n\\n // Direct constructor\\n template <class _Tp>\\n constexpr modint(_Tp __n, direct_ctor_t) noexcept : value(__n) {}\\n\\n public:\\n constexpr modint() noexcept = default;\\n\\n template <class _Tp, typename = std::enable_if_t<is_integral_ext<_Tp>::value>>\\n constexpr modint(_Tp __n) noexcept\\n : value((__n %= mod) < 0 ? __n += mod : __n) {}\\n\\n constexpr modint(bool __n) noexcept : value(__n) {}\\n\\n constexpr operator value_type() const noexcept { return value; }\\n\\n // unary operators {{\\n constexpr modint operator++(int) noexcept {\\n modint __t{*this};\\n operator++();\\n return __t;\\n }\\n\\n constexpr modint operator--(int) noexcept {\\n modint __t{*this};\\n operator--();\\n return __t;\\n }\\n\\n constexpr modint &operator++() noexcept {\\n if (++value == mod) value = 0;\\n return *this;\\n }\\n\\n constexpr modint &operator--() noexcept {\\n if (!value)\\n value = mod - 1;\\n else\\n --value;\\n return *this;\\n }\\n\\n constexpr modint operator+() const noexcept { return *this; }\\n\\n constexpr modint operator-() const noexcept {\\n return {value ? mod - value : 0, direct_ctor_tag};\\n }\\n\\n // }} unary operators\\n\\n // operator+= {{\\n\\n constexpr modint &operator+=(const modint &__x) noexcept {\\n if ((value += __x.value) >= mod) value -= mod;\\n return *this;\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\\n operator+=(_Tp const &__x) noexcept {\\n if (((value += __x) %= mod) < 0) value += mod;\\n return *this;\\n }\\n\\n // }} operator+=\\n\\n // operator+ {{\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator+(_Tp const &__x) const noexcept {\\n return modint{*this} += __x;\\n }\\n\\n constexpr modint operator+(modint __x) const noexcept { return __x += *this; }\\n\\n template <class _Tp>\\n constexpr friend\\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator+(_Tp const &__x, modint __y) noexcept {\\n return __y += __x;\\n }\\n\\n // }} operator+\\n\\n // operator-= {{\\n\\n constexpr modint &operator-=(const modint &__x) noexcept {\\n if ((value -= __x.value) < 0) value += mod;\\n return *this;\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\\n operator-=(_Tp __x) noexcept {\\n if (((value -= __x) %= mod) < 0) value += mod;\\n return *this;\\n }\\n\\n // }} operator-=\\n\\n // operator- {{\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator-(_Tp const &__x) const noexcept {\\n return modint{*this} -= __x;\\n }\\n\\n constexpr modint operator-(const modint &__x) const noexcept {\\n return modint{*this} -= __x;\\n }\\n\\n template <class _Tp>\\n constexpr friend\\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator-(_Tp __x, const modint &__y) noexcept {\\n if (((__x -= __y.value) %= mod) < 0) __x += mod;\\n return {__x, direct_ctor_tag};\\n }\\n\\n // }} operator-\\n\\n // operator*= {{\\n\\n constexpr modint &operator*=(const modint &__x) noexcept {\\n value =\\n static_cast<value_type>(value * static_cast<mul_type>(__x.value) % mod);\\n return *this;\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\\n operator*=(_Tp __x) noexcept {\\n value = static_cast<value_type>(\\n value * mul_type((__x %= mod) < 0 ? __x + mod : __x) % mod);\\n return *this;\\n }\\n\\n // }} operator*=\\n\\n // operator* {{\\n\\n constexpr modint operator*(const modint &__x) const noexcept {\\n return {static_cast<mul_type>(value) * __x.value % mod, direct_ctor_tag};\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator*(_Tp __x) const noexcept {\\n __x %= mod;\\n if (__x < 0) __x += mod;\\n return {static_cast<mul_type>(value) * __x % mod, direct_ctor_tag};\\n }\\n\\n template <class _Tp>\\n constexpr friend\\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator*(_Tp __x, const modint &__y) noexcept {\\n __x %= mod;\\n if (__x < 0) __x += mod;\\n return {static_cast<mul_type>(__x) * __y.value % mod, direct_ctor_tag};\\n }\\n\\n // }} operator*\\n\\n protected:\\n static value_type _mem(value_type __x) {\\n static std::vector<value_type> __m{0, 1};\\n static value_type __i = (__m.reserve(storage), 1);\\n while (__i < __x) {\\n ++__i;\\n __m.emplace_back(mod - mul_type(mod / __i) * __m[mod % __i] % mod);\\n }\\n return __m[__x];\\n }\\n\\n template <class _Tp>\\n constexpr static\\n typename std::enable_if<is_integral_ext<_Tp>::value, value_type>::type\\n _div(mul_type __r, _Tp __x) noexcept {\\n assert(__x != _Tp(0));\\n if (!__r) return 0;\\n\\n std::make_signed_t<_Tp> __v{};\\n bool __neg = __x < 0 ? __x = -__x, true : false;\\n\\n if (static_cast<decltype(storage)>(__x) < storage)\\n __v = _mem(__x);\\n else {\\n decltype(__v) __y{mod}, __u{1}, __t;\\n\\n while (__x)\\n __t = __y / __x, __y ^= __x ^= (__y -= __t * __x) ^= __x,\\n __v ^= __u ^= (__v -= __t * __u) ^= __u;\\n\\n if (__y < 0) __neg ^= 1;\\n }\\n\\n if (__neg)\\n __v = 0 < __v ? mod - __v : -__v;\\n else if (__v < 0)\\n __v += mod;\\n\\n return __r == mul_type(1) ? static_cast<value_type>(__v)\\n : static_cast<value_type>(__r * __v % mod);\\n }\\n\\n public:\\n // operator/= {{\\n\\n constexpr modint &operator/=(const modint &__x) noexcept {\\n if (value) value = _div(value, __x.value);\\n return *this;\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type &\\n operator/=(_Tp __x) noexcept {\\n if (value) value = _div(value, __x %= mod);\\n return *this;\\n }\\n\\n // }} operator/=\\n\\n // operator/ {{\\n\\n constexpr modint operator/(const modint &__x) const noexcept {\\n if (!value) return {};\\n return {_div(value, __x.value), direct_ctor_tag};\\n }\\n\\n template <class _Tp>\\n constexpr typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator/(_Tp __x) const noexcept {\\n if (!value) return {};\\n return {_div(value, __x %= mod), direct_ctor_tag};\\n }\\n\\n template <class _Tp>\\n constexpr friend\\n typename std::enable_if<is_integral_ext<_Tp>::value, modint>::type\\n operator/(_Tp __x, const modint &__y) noexcept {\\n if (!__x) return {};\\n if ((__x %= mod) < 0) __x += mod;\\n return {_div(__x, __y.value), direct_ctor_tag};\\n }\\n\\n // }} operator/\\n\\n constexpr modint inv() const noexcept { return _div(1, value); }\\n\\n template <class _Tp>\\n constexpr std::__enable_if_t<is_integral_ext<_Tp>::value, modint> pow(\\n _Tp __e) const noexcept {\\n modint __r{1, direct_ctor_tag};\\n\\n for (modint __b{__e < 0 ? __e = -__e, _div(1, value) : value,\\n direct_ctor_tag};\\n __e; __e >>= 1, __b *= __b)\\n if (__e & 1) __r *= __b;\\n\\n return __r;\\n }\\n\\n template <class _Tp>\\n friend constexpr std::__enable_if_t<is_integral_ext<_Tp>::value, modint> pow(\\n modint __b, _Tp __e) noexcept {\\n if (__e < 0) {\\n __e = -__e;\\n __b.value = _div(1, __b.value);\\n }\\n\\n modint __r{1, direct_ctor_tag};\\n\\n for (; __e; __e >>= 1, __b *= __b)\\n if (__e & 1) __r *= __b;\\n\\n return __r;\\n }\\n\\n constexpr modint sqrt() const noexcept {\\n return {sqrt_mod(value, mod), direct_ctor_tag};\\n }\\n\\n friend constexpr modint sqrt(const modint &__x) noexcept {\\n return {sqrt_mod(__x.value, mod), direct_ctor_tag};\\n }\\n\\n template <class _Os>\\n friend _Os &operator<<(_Os &__os, const modint &__x) noexcept {\\n return __os << __x.value;\\n }\\n\\n friend std::istream &operator>>(std::istream &__is, modint &__x) noexcept {\\n std::string __s;\\n __is >> __s;\\n bool __neg = false;\\n if (__s.front() == '-') {\\n __neg = true;\\n __s.erase(__s.begin());\\n }\\n __x = 0;\\n for (char __c : __s) __x = __x * 10 + (__c - '0');\\n if (__neg) __x = -__x;\\n return __is;\\n }\\n};\\n\\ntemplate <auto _Mod, unsigned _Storage>\\ntypename modint<_Mod, _Storage>::mod_type modint<_Mod, _Storage>::mod =\\n _Mod > 0 ? _Mod : 0;\\n\\ntemplate <auto _Mod, unsigned _Storage>\\nunsigned modint<_Mod, _Storage>::storage = _Storage;\\n\\n} // namespace _modint_impl\\n\\ntemplate <auto _Mod, unsigned _Storage = 0,\\n typename = std::enable_if_t<(_Mod > 0)>>\\nusing modint = _modint_impl::modint<_Mod, _Storage>;\\n\\ntemplate <unsigned _Id = 0>\\nusing modint_runtime = _modint_impl::modint<-(signed)_Id, 0>;\\n\\n} // namespace workspace\\n#line 7 \\\"other/sister.cpp\\\"\\n\\nnamespace workspace {\\n\\nusing mint = modint<1000003>;\\n\\nint main() {\\n // start here!\\n\\n int n, m;\\n cin >> n >> m;\\n if (!n) {\\n return 1;\\n }\\n if (!m) {\\n cout << (n % 2 ? 0 : (n != 2 ? 2 : 1)) << \\\"\\\\n\\\";\\n return 0;\\n }\\n\\n vector<pair<int, int>> tree;\\n\\n // make tree representation\\n {\\n vector<pair<int, int>> tmp;\\n while (m--) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n if (a > b) {\\n swap(a, b);\\n }\\n tmp.emplace_back(a, b);\\n }\\n\\n auto [l, r] = *min_element(begin(tmp), end(tmp), [](auto x, auto y) {\\n return x.second - x.first < y.second - y.first;\\n });\\n\\n auto conv = [&](int i) -> int {\\n if (i > l) {\\n assert(i >= r);\\n return i - r;\\n }\\n return n - r + i;\\n };\\n\\n vector<vector<pair<int, int>>> at_lft(n), lenof(n);\\n\\n for (auto [x, y] : tmp) {\\n x = conv(x);\\n y = conv(y);\\n if (x > y) {\\n swap(x, y);\\n }\\n lenof[y - x].emplace_back(x, y);\\n }\\n\\n for (auto &&ve : lenof) {\\n for (auto &&[l, r] : ve) {\\n at_lft[l].emplace_back(l, r);\\n }\\n }\\n\\n reverse(begin(at_lft), end(at_lft));\\n\\n for (auto &&ve : at_lft) {\\n for (auto &&x : ve) {\\n tree.push_back(x);\\n }\\n }\\n\\n n = r - l - 1;\\n n %= 2;\\n }\\n\\n struct dp {\\n int left, right;\\n mint ways[2][2];\\n\\n dp operator+(dp x) const {\\n assert(right <= x.left);\\n dp ret = {left, x.right};\\n for (auto i1 : {0, 1}) {\\n for (auto j2 : {0, 1}) {\\n for (auto j1 : {0, 1}) {\\n auto i2 = (x.left - right) % 2 ? j1 : !j1;\\n ret.ways[i1][j2] += ways[i1][j1] * x.ways[i2][j2];\\n }\\n }\\n }\\n return ret;\\n }\\n };\\n\\n stack<dp> Q;\\n\\n for (auto [s, t] : tree) {\\n dp here = {s, s, {1, 0, 0, 1}};\\n while (!Q.empty()) {\\n if (Q.top().right > t) {\\n break;\\n }\\n here = here + Q.top();\\n Q.pop();\\n }\\n here = here + dp{t, t, {1, 0, 0, 1}};\\n here.ways[0][0] += here.ways[1][1];\\n swap(here.ways[0][0], here.ways[1][1]);\\n swap(here.ways[0][1], here.ways[1][0]);\\n Q.push(here);\\n }\\n\\n assert(Q.size() == 1);\\n\\n auto all = Q.top();\\n cout << all.ways[0][n] + all.ways[1][!n] << \\\"\\\\n\\\";\\n\\n return 0;\\n}\\n\\n} // namespace workspace\\n\\nint main() {\\n while (!workspace::main())\\n ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 9240,\n \"score_of_the_acc\": -0.0335,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2405_4801918\",\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=1000003;\\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\\nvector<vector<P>> path;\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n LL a,b,c;\\n map<int,int> m1;\\n vector<P> vs,path2;\\n\\n while(cin>>n>>m){\\n if(n==0)return 0;\\n path.assign(n,vector<P>());\\n vs.assign(m+10,P());\\n path2.assign(m+10,P());\\n m1.clear();\\n for(i=0;i<m;i++){\\n cin>>a>>b;\\n a--,b--;\\n if(a<b)swap(a,b);\\n if((a-b)%2==0)continue;\\n path[b].push_back(make_pair(a,i));\\n path2[i]=make_pair(b,a);\\n }\\n path[0].push_back(make_pair(n-1,m));\\n path2[m]=make_pair(0,n-1);\\n for(i=0;i<n;i++){\\n sort(path[i].begin(),path[i].end());\\n }\\n if(n%2){\\n cout<<0<<endl;\\n continue;\\n }\\n for(i=n-1;i>=0;i--){\\n for(auto node:path[i]){\\n j=node.second;\\n a=path2[j].first,b=path2[j].second;\\n vs[j].first=1,vs[j].second=1;\\n while(1){\\n auto itr=m1.begin();\\n if(itr==m1.end() || itr->first>=b)break;\\n k=itr->second;\\n if((itr->first-a)%2==1){\\n vs[j].first*=vs[k].second;\\n vs[j].second*=vs[k].first;\\n }else{\\n vs[j].first*=vs[k].first;\\n vs[j].second*=vs[k].second;\\n }\\n vs[j].first%=MAX,vs[j].second%=MAX;\\n m1.erase(itr);\\n }\\n // cout<<a<<\\\" \\\"<<b<<endl;\\n // cout<<vs[j].first<<\\\" \\\"<<vs[j].second<<endl;\\n vs[j].second+=vs[j].first;\\n vs[j].second%=MAX;\\n m1[a]=j;\\n }\\n }\\n cout<<vs[m].second<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6984,\n \"score_of_the_acc\": -0.0102,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2405_4426992\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\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 pb push_back\\n#define eb emplace_back\\n\\nint in(){int x;cin>>x;return x;}\\n\\n\\n \\n#define ll long long\\nvector<vector<int>> g;\\nvector<int> nxt;\\nconstexpr ll MOD = 1000003;\\n\\nmain(){\\n while(1){\\n int n=in(),m=in();\\n if(!n)return 0;\\n g=vector<vector<int>>(n);\\n vector<vector<int>> v(2);\\n using P = pair<int,int> ;\\n vector<P> ed;\\n rep(i,m){\\n int a=in()-1,b=in()-1;\\n if(a>b)swap(a,b);\\n if((a+b)&1){\\n g[a].pb(b);\\n v[a&1].pb(a);\\n ed.eb(P(a,b));\\n }\\n }\\n if(n&1){\\n cout<<0<<endl;continue;\\n }\\n #define all(c) (c).begin(),(c).end()\\n vector<pair<int,ll>> dp(n);\\n ed.emplace_back(0,n-1);\\n sort(all(ed),[](P x,P y){return x.second-x.first<y.second-y.first;});\\n rep(i,n-1) dp[i] = P(i+1,1);\\n for(auto p:ed){\\n int a = p.first,b=p.second;\\n ll ans = 1;\\n int now = a+1;\\n while(now!=b){\\n ans=(ans*dp[now].second)%MOD;\\n now = dp[now].first+1;\\n }\\n dp[a+1]={b-1,ans};\\n now = a,ans = 1;\\n while(now!=b+1){\\n ans = (ans*dp[now].second)%MOD;\\n now = dp[now].first+1;\\n }\\n ans+=dp[a+1].second;\\n if(ans>=MOD)ans-=MOD;\\n dp[a] = {b,ans};\\n }\\n cout<<dp[0].second<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 6688,\n \"score_of_the_acc\": -0.0072,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2405_4206148\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nusing int64 = long long;\\nconst int mod = 1000003;\\n\\nconst int64 infll = (1LL << 58) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename T >\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T >\\nusing Edges = vector< edge< T > >;\\ntemplate< typename T >\\nusing WeightedGraph = vector< Edges< T > >;\\nusing UnWeightedGraph = vector< vector< int > >;\\ntemplate< typename T >\\nusing Matrix = vector< vector< T > >;\\n\\n/**\\n * @bref Tree-Decomposition(木分解)\\n */\\nstruct DecompNode {\\n vector< int > bag, child;\\n\\n DecompNode() = default;\\n};\\n\\nstruct TreeDecomposition {\\n\\n vector< vector< int > > g;\\n\\n explicit TreeDecomposition(int V) : g(V) {}\\n\\n void add_edge(int a, int b) {\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n\\n vector< DecompNode > build() {\\n const int N = (int) g.size();\\n\\n vector< int > used(N, -1), deg(N);\\n queue< int > que;\\n for(int i = 0; i < N; i++) {\\n deg[i] = (int) g[i].size();\\n if(deg[i] <= 2) que.emplace(i);\\n }\\n\\n vector< set< int > > exists(N);\\n for(int i = 0; i < N; i++) {\\n for(auto &j : g[i]) {\\n if(i < j) exists[i].emplace(j);\\n }\\n }\\n\\n vector< DecompNode > ret;\\n ret.emplace_back();\\n while(!que.empty()) {\\n int idx = que.front();\\n que.pop();\\n if(deg[idx] > 2 || used[idx] != -1) continue;\\n\\n DecompNode r;\\n r.bag.emplace_back(idx);\\n int u = -1, v = -1;\\n for(auto &to : g[idx]) {\\n if(used[to] == -1) {\\n (u == -1 ? u : v) = to;\\n r.bag.emplace_back(to);\\n } else if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n used[to] = -2;\\n }\\n }\\n\\n if(u == -1) {\\n\\n } else if(v == -1) {\\n --deg[u];\\n } else {\\n if(u > v) swap(u, v);\\n if(!exists[u].count(v)) {\\n g[u].emplace_back(v);\\n g[v].emplace_back(u);\\n exists[u].emplace(v);\\n } else {\\n --deg[u];\\n --deg[v];\\n }\\n }\\n\\n for(auto &to : g[idx]) {\\n if(deg[to] <= 2) que.emplace(to);\\n }\\n\\n used[idx] = (int) ret.size();\\n deg[idx] = 0;\\n ret.emplace_back(r);\\n }\\n for(int i = 0; i < N; i++) {\\n if(deg[i] > 0) return {};\\n }\\n ret.front() = ret.back();\\n ret.pop_back();\\n return ret;\\n }\\n};\\n\\n\\nvoid to_nice(vector< DecompNode > &g, int root = 0) {\\n\\n for(auto &p : g) {\\n sort(p.bag.begin(), p.bag.end());\\n }\\n\\n stack< int > st;\\n st.emplace(root);\\n\\n while(!st.empty()) {\\n int idx = st.top();\\n st.pop();\\n\\n // join\\n while(g[idx].child.size() > 2) {\\n DecompNode r;\\n r.child.resize(2);\\n r.child[0] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.child[1] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.bag = g[idx].bag;\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n\\n if(g[idx].child.size() == 2) {\\n for(auto &ch : g[idx].child) {\\n if(g[ch].bag != g[idx].bag) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n }\\n\\n // introduce / forget\\n if(g[idx].child.size() == 1) {\\n int &ch = g[idx].child[0];\\n\\n vector< int > latte, malta;\\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\\n g[ch].bag.begin(), g[ch].bag.end(),\\n back_inserter(latte));\\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\\n g[idx].bag.begin(), g[idx].bag.end(),\\n back_inserter(malta));\\n if(latte.size() + malta.size() > 1) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n if(!latte.empty()) {\\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\\n } else {\\n r.bag.emplace_back(malta.back());\\n }\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n\\n // leaf\\n if(g[idx].child.empty()) {\\n if(g[idx].bag.size() > 1) {\\n DecompNode r;\\n r.bag = g[idx].bag;\\n r.bag.pop_back();\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n }\\n\\n for(auto &ch : g[idx].child) {\\n st.emplace(ch);\\n }\\n }\\n}\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\nint main() {\\n int N, M;\\n while(cin >> N >> M, N) {\\n TreeDecomposition td(N);\\n set< pair< int, int > > edges;\\n for(int i = 0; i < N; i++) {\\n td.add_edge(i, (i + 1) % N);\\n edges.emplace(minmax(i, (i + 1) % N));\\n }\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n td.add_edge(a, b);\\n edges.emplace(minmax(a, b));\\n }\\n\\n if(N % 2) {\\n cout << 0 << endl;\\n continue;\\n }\\n\\n auto t = td.build();\\n to_nice(t);\\n vector< vector< modint > > dps(t.size());\\n vector< int > buff(N), buff2(N, -1);\\n MFP([&](auto rec, int idx) -> void {\\n\\n auto &ch = t[idx].child;\\n auto &bag = t[idx].bag;\\n\\n for(auto &to : ch) rec(to);\\n vector< modint > dp(1 << bag.size());\\n\\n if(ch.empty()) { // leaf\\n dp[0] = 1;\\n } else if(ch.size() == 2) { // join\\n for(int i = 0; i < dp.size(); i++) {\\n for(int j = 0; j < dp.size(); j++) {\\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\\n }\\n }\\n } else {\\n auto &ch_bag = t[ch[0]].bag;\\n auto &ch_dp = dps[ch[0]];\\n\\n for(int i = 0; i < bag.size(); i++) {\\n buff[bag[i]] = 1 << i;\\n buff2[bag[i]] = idx;\\n }\\n\\n if(ch_bag.size() + 1 == bag.size()) { // introduce\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\\n }\\n dp[bit] = ch_dp[i];\\n }\\n } else { // forget\\n int v = -1;\\n for(int i = 0; i < ch_bag.size(); i++) {\\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\\n }\\n vector< int > ok_match(bag.size());\\n for(int i = 0; i < bag.size(); i++) {\\n ok_match[i] = edges.count(minmax(bag[i], v));\\n }\\n\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n bool v_use = false;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) {\\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\\n } else {\\n if(v == ch_bag[j]) v_use = true;\\n }\\n }\\n if(v_use) {\\n for(int j = 0; j < bag.size(); j++) {\\n if((bit >> j) & 1) continue;\\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\\n }\\n } else {\\n dp[bit] += ch_dp[i];\\n }\\n }\\n }\\n }\\n dps[idx].swap(dp);\\n })(0);\\n auto &dp = dps[0];\\n cout << dp.back() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 56508,\n \"score_of_the_acc\": -0.633,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2405_4188312\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2405\\\"\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define call_from_test\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\n// Assume Connected\\nstruct NiceTree{\\n vector< vector<int> > G;\\n vector< set<int> > ex;\\n vector<int> buff;\\n NiceTree(int n):G(n),ex(n),buff(n){}\\n\\n void add_edge(int u,int v){\\n if(u>v) swap(u,v);\\n if(ex[u].count(v)) return;\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n ex[u].emplace(v);\\n }\\n\\n enum Type{LEAF, JOIN, INTRODUCE, FORGET};\\n struct Node{\\n int type;\\n\\n // index for G\\n vector<int> bag;\\n void add_vertex(int v){bag.emplace_back(v);}\\n\\n // index for T\\n vector<int> child;\\n void add_child(int v){child.emplace_back(v);}\\n };\\n\\n vector<Node> T;\\n void to_nice(){\\n for(auto &v:T)\\n sort(v.bag.begin(),v.bag.end());\\n\\n stack<int> st;\\n st.emplace(0);\\n\\n while(!st.empty()){\\n int v=st.top();st.pop();\\n\\n while(T[v].child.size()>2){\\n Node r;\\n r.add_child(T[v].child.back());\\n T[v].child.pop_back();\\n r.add_child(T[v].child.back());\\n T[v].child.pop_back();\\n r.bag=T[v].bag;\\n T[v].add_child(T.size());\\n T.emplace_back(r);\\n }\\n\\n if(T[v].child.size()==2){\\n for(auto &u:T[v].child){\\n if(T[u].bag!=T[v].bag){\\n Node r;\\n r.add_child(u);\\n r.bag=T[v].bag;\\n u=T.size();\\n T.emplace_back(r);\\n }\\n }\\n T[v].type=JOIN;\\n }\\n\\n if(T[v].child.size()==1){\\n int &u=T[v].child[0];\\n vector<int> latte,malta;\\n auto &ps=T[v].bag;\\n auto &qs=T[u].bag;\\n set_difference(ps.begin(),ps.end(),qs.begin(),qs.end(),\\n back_inserter(latte));\\n set_difference(qs.begin(),qs.end(),ps.begin(),ps.end(),\\n back_inserter(malta));\\n if(latte.size()+malta.size()>1){\\n Node r;\\n r.add_child(u);\\n r.bag=T[v].bag;\\n if(!latte.empty()){\\n r.bag.erase(find(r.bag.begin(),r.bag.end(),latte.back()));\\n }else{\\n r.bag.emplace_back(malta.back());\\n }\\n u=T.size();\\n T.emplace_back(r);\\n }\\n if(T[v].bag.size()<T[u].bag.size()) T[v].type=FORGET;\\n if(T[v].bag.size()>T[u].bag.size()) T[v].type=INTRODUCE;\\n }\\n\\n if(T[v].child.empty()){\\n if(T[v].bag.size()>1){\\n Node r;\\n r.bag=T[v].bag;\\n r.bag.pop_back();\\n T[v].type=INTRODUCE;\\n T[v].add_child(T.size());\\n T.emplace_back(r);\\n }else{\\n T[v].type=LEAF;\\n }\\n }\\n\\n for(auto &u:T[v].child)\\n st.emplace(u);\\n }\\n }\\n\\n // root = 0\\n void build(){\\n int n=G.size();\\n if(n<=3){\\n Node r;\\n for(int i=0;i<n;i++) r.add_vertex(i);\\n T=vector<Node>({r});\\n return to_nice();\\n }\\n\\n vector<int> deg(n);\\n queue<int> que;\\n for(int i=0;i<n;i++){\\n deg[i]=G[i].size();\\n if(deg[i]<=2) que.emplace(i);\\n }\\n\\n vector<int> used(n,-1);\\n T.emplace_back();\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n if(deg[v]>2||used[v]!=-1) continue;\\n Node r;\\n r.add_vertex(v);\\n\\n int p=-1,q=-1;\\n for(int u:G[v]){\\n if(used[u]==-1){\\n (p==-1?p:q)=u;\\n r.add_vertex(u);\\n }else if(used[u]>=0){\\n r.add_child(used[u]);\\n used[u]=-2;\\n }\\n }\\n\\n if(deg[v]==0){\\n used[v]=T.size();\\n T.emplace_back(r);\\n continue;\\n }\\n\\n if(q==-1){\\n deg[p]--;\\n }else{\\n if(p>q) swap(p,q);\\n if(!ex[p].count(q)){\\n add_edge(p,q);\\n }else{\\n deg[p]--;\\n deg[q]--;\\n }\\n }\\n for(int u:G[v])\\n if(deg[u]<=2) que.emplace(u);\\n deg[v]=0;\\n used[v]=T.size();\\n T.emplace_back(r);\\n }\\n\\n for(int i=0;i<n;i++){\\n if(deg[i]>0){\\n T={};\\n return;\\n }\\n }\\n\\n T.front()=T.back();T.pop_back();\\n to_nice();\\n }\\n\\n template<typename F1,typename F2,typename F3,typename F4>\\n void dfs(int v,F1 &leaf,F2 &join,F3 &introduce,F4 &forget){\\n const auto &chd=T[v].child;\\n for(int u:chd) dfs(u,leaf,join,introduce,forget);\\n\\n if(T[v].type==LEAF){\\n leaf(v);\\n return;\\n }\\n if(T[v].type==JOIN){\\n join(v);\\n return;\\n }\\n\\n const auto &bag=T[v].bag;\\n for(int i=0;i<(int)bag.size();i++)\\n buff[bag[i]]=1<<i;\\n\\n const auto &chd_bag=T[chd[0]].bag;\\n int dif=0;\\n for(int b:bag) dif^=b;\\n for(int b:chd_bag) dif^=b;\\n\\n if(T[v].type==INTRODUCE){\\n introduce(v,dif);\\n return;\\n }\\n if(T[v].type==FORGET){\\n forget(v,dif);\\n return;\\n }\\n }\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\n\\n#define call_from_test\\n#include \\\"../tools/fastio.cpp\\\"\\n#include \\\"../tools/chminmax.cpp\\\"\\n#undef call_from_test\\n\\nsigned CSA_SPECIAL_MVC(){\\n int n,m;\\n cin>>n>>m;\\n NiceTree G(n);\\n using P = pair<int, int>;\\n set<P> es;\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n G.add_edge(a,b);\\n es.emplace(a,b);\\n es.emplace(b,a);\\n }\\n\\n G.build();\\n auto &T=G.T;\\n auto &buff=G.buff;\\n\\n vector< vector<int> > dps(T.size());\\n\\n const int INF = 1e9;\\n auto base=\\n [&](int v){\\n const auto &bag=T[v].bag;\\n auto &dp=dps[v];\\n dp.assign(1<<bag.size(),-INF);\\n };\\n\\n auto leaf=\\n [&](int v){\\n base(v);\\n auto &dp=dps[v];\\n dp[0]=0;\\n dp[1]=1;\\n };\\n\\n auto join=\\n [&](int v){\\n base(v);\\n const auto &chd=T[v].child;\\n auto &dp=dps[v];\\n for(int i=0;i<(int)dp.size();i++)\\n chmax(dp[i],dps[chd[0]][i]+dps[chd[1]][i]-__builtin_popcount(i));\\n };\\n\\n auto introduce=\\n [&](int v,int add){\\n base(v);\\n\\n const auto &chd=T[v].child;\\n const auto &chd_bag=T[chd[0]].bag;\\n const auto &pr=dps[chd[0]];\\n\\n auto &dp=dps[v];\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0,valid=1;\\n for(int j=0;j<(int)chd_bag.size();j++){\\n if((~i>>j)&1) continue;\\n bit|=buff[chd_bag[j]];\\n valid&=!es.count(P(chd_bag[j],add));\\n }\\n assert(!(bit&buff[add]));\\n if(valid) chmax(dp[bit|buff[add]],pr[i]+1);\\n chmax(dp[bit],pr[i]);\\n }\\n };\\n\\n auto forget=\\n [&](int v,int rmv){\\n base(v);\\n\\n const auto &chd=T[v].child;\\n const auto &chd_bag=T[chd[0]].bag;\\n const auto &pr=dps[chd[0]];\\n\\n auto &dp=dps[v];\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0;\\n for(int j=0;j<(int)chd_bag.size();j++){\\n if((~i>>j)&1) continue;\\n if(rmv!=chd_bag[j]) bit|=buff[chd_bag[j]];\\n }\\n chmax(dp[bit],pr[i]);\\n }\\n };\\n\\n G.dfs(0,leaf,join,introduce,forget);\\n auto &dp=dps[0];\\n cout<<n-*max_element(dp.begin(),dp.end())<<endl;\\n return 0;\\n}\\n/*\\n verified 2020/02/21\\n https://csacademy.com/contest/archive/task/special-mvc/statement/\\n*/\\n\\nsigned main(){\\n CSA_SPECIAL_MVC();\\n return 0;\\n}\\n#endif\\n\\n#ifndef call_from_test\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T,T MOD = 1000000007>\\nstruct Mint{\\n static constexpr T mod = MOD;\\n T v;\\n Mint():v(0){}\\n Mint(signed v):v(v){}\\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\\n\\n Mint pow(long long k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n\\n static Mint add_identity(){return Mint(0);}\\n static Mint mul_identity(){return Mint(1);}\\n\\n Mint inv(){return pow(MOD-2);}\\n\\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n\\n Mint operator+(Mint a) const{return Mint(v)+=a;}\\n Mint operator-(Mint a) const{return Mint(v)-=a;}\\n Mint operator*(Mint a) const{return Mint(v)*=a;}\\n Mint operator/(Mint a) const{return Mint(v)/=a;}\\n\\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n bool operator <(const Mint a)const{return v <a.v;}\\n\\n static Mint comb(long long n,int k){\\n Mint num(1),dom(1);\\n for(int i=0;i<k;i++){\\n num*=Mint(n-i);\\n dom*=Mint(i+1);\\n }\\n return num/dom;\\n }\\n};\\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\\ntemplate<typename T,T MOD>\\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\\n//END CUT HERE\\n#ifndef call_from_test\\n\\n//INSERT ABOVE HERE\\nsigned ABC127_E(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int h,w,k;\\n cin>>h>>w>>k;\\n using M = Mint<int>;\\n\\n M ans{0};\\n for(int d=1;d<h;d++)\\n ans+=M(d)*M(h-d)*M(w)*M(w);\\n\\n for(int d=1;d<w;d++)\\n ans+=M(d)*M(w-d)*M(h)*M(h);\\n\\n ans*=M::comb(h*w-2,k-2);\\n cout<<ans<<endl;\\n return 0;\\n}\\n/*\\n verified on 2019/06/12\\n https://atcoder.jp/contests/abc127/tasks/abc127_e\\n*/\\n\\nsigned main(){\\n //ABC127_E();\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n int n,m;\\n while(cin>>n>>m,n){\\n NiceTree G(n);\\n using P = pair<int, int>;\\n set<P> es;\\n for(int i=0;i<n;i++){\\n int j=(i+1)%n;\\n G.add_edge(i,j);\\n es.emplace(i,j);\\n es.emplace(j,i);\\n }\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n G.add_edge(a,b);\\n es.emplace(a,b);\\n es.emplace(b,a);\\n }\\n if(n&1){\\n cout<<0<<endl;\\n continue;\\n }\\n G.build();\\n auto &T=G.T;\\n auto &buff=G.buff;\\n\\n using M = Mint<int, 1000003>;\\n vector<vector<M>> dps(T.size());\\n\\n auto base=\\n [&](int v){\\n const auto &bag=T[v].bag;\\n auto &dp=dps[v];\\n dp.assign(1<<bag.size(),0);\\n };\\n\\n auto leaf=\\n [&](int v){\\n base(v);\\n auto &dp=dps[v];\\n dp[0]=M(1);\\n };\\n\\n auto join=\\n [&](int v){\\n base(v);\\n const auto &chd=T[v].child;\\n auto &dp=dps[v];\\n\\n for(int i=0;i<(int)dp.size();i++)\\n for(int j=0;j<(int)dp.size();j++)\\n if((i&j)==0) dp[i|j]+=dps[chd[0]][i]*dps[chd[1]][j];\\n };\\n\\n auto introduce=\\n [&](int v,int){\\n base(v);\\n const auto &chd=T[v].child;\\n\\n const auto &chd_bag=T[chd[0]].bag;\\n const auto &pr=dps[chd[0]];\\n\\n auto &dp=dps[v];\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0;\\n for(int j=0;j<(int)chd_bag.size();j++)\\n if((i>>j)&1) bit|=buff[chd_bag[j]];\\n dp[bit]=pr[i];\\n }\\n };\\n\\n auto forget=\\n [&](int v,int rmv){\\n base(v);\\n const auto &bag=T[v].bag;\\n const auto &chd=T[v].child;\\n\\n const auto &chd_bag=T[chd[0]].bag;\\n const auto &pr=dps[chd[0]];\\n\\n auto &dp=dps[v];\\n\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0,used=0;\\n for(int j=0;j<(int)chd_bag.size();j++){\\n if((~i>>j)&1) continue;\\n if(rmv==chd_bag[j]) used=1;\\n if(rmv!=chd_bag[j]) bit|=buff[chd_bag[j]];\\n }\\n if(!used){\\n for(int j=0;j<(int)bag.size();j++){\\n if((bit>>j)&1) continue;\\n if(es.count(P(bag[j],rmv))) dp[bit|(1<<j)]+=pr[i];\\n }\\n }else{\\n dp[bit]+=pr[i];\\n }\\n }\\n };\\n\\n G.dfs(0,leaf,join,introduce,forget);\\n\\n auto &dp=dps[0];\\n if(es.count(P(T[0].bag[0],T[0].bag[1])))\\n dp.back()+=dp[0];\\n cout<<dp.back()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 64500,\n \"score_of_the_acc\": -0.7427,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2405_4186722\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n// Assume Connected\\nstruct NiceTree{\\n vector< vector<int> > G;\\n vector< set<int> > ex;\\n NiceTree(int n):G(n),ex(n){}\\n\\n void add_edge(int u,int v){\\n if(u>v) swap(u,v);\\n if(ex[u].count(v)) return;\\n G[u].emplace_back(v);\\n G[v].emplace_back(u);\\n ex[u].emplace(v);\\n }\\n\\n enum Type{LEAF, INTRODUCE, FORGET, JOIN};\\n struct Node{\\n int type;\\n\\n // index for G\\n vector<int> bag;\\n void add_vertex(int v){bag.emplace_back(v);}\\n\\n // index for T\\n vector<int> child;\\n void add_child(int v){child.emplace_back(v);}\\n };\\n\\n void to_nice(vector<Node> &T){\\n for(auto &v:T)\\n sort(v.bag.begin(),v.bag.end());\\n\\n stack<int> st;\\n st.emplace(0);\\n\\n while(!st.empty()){\\n int v=st.top();st.pop();\\n\\n while(T[v].child.size()>2){\\n Node r;\\n r.add_child(T[v].child.back());\\n T[v].child.pop_back();\\n r.add_child(T[v].child.back());\\n T[v].child.pop_back();\\n r.bag=T[v].bag;\\n T[v].add_child(T.size());\\n T.emplace_back(r);\\n }\\n\\n if(T[v].child.size()==2){\\n for(auto &u:T[v].child){\\n if(T[u].bag!=T[v].bag){\\n Node r;\\n r.add_child(u);\\n r.bag=T[v].bag;\\n u=T.size();\\n T.emplace_back(r);\\n }\\n }\\n T[v].type=JOIN;\\n }\\n\\n if(T[v].child.size()==1){\\n int &u=T[v].child[0];\\n vector<int> latte,malta;\\n auto &ps=T[v].bag;\\n auto &qs=T[u].bag;\\n set_difference(ps.begin(),ps.end(),qs.begin(),qs.end(),\\n back_inserter(latte));\\n set_difference(qs.begin(),qs.end(),ps.begin(),ps.end(),\\n back_inserter(malta));\\n if(latte.size()+malta.size()>1){\\n Node r;\\n r.add_child(u);\\n r.bag=T[v].bag;\\n if(!latte.empty()){\\n r.bag.erase(find(r.bag.begin(),r.bag.end(),latte.back()));\\n }else{\\n r.bag.emplace_back(malta.back());\\n }\\n u=T.size();\\n T.emplace_back(r);\\n }\\n if(T[v].bag.size()<T[u].bag.size()) T[v].type=FORGET;\\n if(T[v].bag.size()>T[u].bag.size()) T[v].type=INTRODUCE;\\n }\\n\\n if(T[v].child.empty()){\\n if(T[v].bag.size()>1){\\n Node r;\\n r.bag=T[v].bag;\\n r.bag.pop_back();\\n T[v].type=INTRODUCE;\\n T[v].add_child(T.size());\\n T.emplace_back(r);\\n }else{\\n T[v].type=LEAF;\\n }\\n }\\n\\n for(auto &u:T[v].child)\\n st.emplace(u);\\n }\\n }\\n\\n // root = 0\\n vector<Node> build(){\\n int n=G.size();\\n if(n<=3){\\n Node r;\\n for(int i=0;i<n;i++) r.add_vertex(i);\\n return {r};\\n }\\n\\n vector<int> deg(n);\\n queue<int> que;\\n for(int i=0;i<n;i++){\\n deg[i]=G[i].size();\\n if(deg[i]<=2) que.emplace(i);\\n }\\n\\n vector<int> used(n,-1);\\n vector<Node> T;\\n T.emplace_back();\\n while(!que.empty()){\\n int v=que.front();que.pop();\\n if(deg[v]==0||deg[v]>2||used[v]!=-1) continue;\\n Node r;\\n r.add_vertex(v);\\n\\n int p=-1,q=-1;\\n for(int u:G[v]){\\n if(used[u]==-1){\\n (p==-1?p:q)=u;\\n r.add_vertex(u);\\n }else if(used[u]>=0){\\n r.add_child(used[u]);\\n used[u]=-2;\\n }\\n }\\n if(q==-1){\\n deg[p]--;\\n }else{\\n if(p>q) swap(p,q);\\n if(!ex[p].count(q)){\\n add_edge(p,q);\\n }else{\\n deg[p]--;\\n deg[q]--;\\n }\\n }\\n for(int u:G[v]){\\n if(deg[u]==0) continue;\\n if(deg[u]<=2) que.emplace(u);\\n }\\n used[v]=T.size();\\n deg[v]=0;\\n T.emplace_back(r);\\n }\\n\\n for(int i=0;i<n;i++)\\n if(deg[i]>0) return {};\\n\\n T.front()=T.back();T.pop_back();\\n to_nice(T);\\n return T;\\n }\\n};\\n\\n\\ntemplate<typename T,T MOD = 1000000007>\\nstruct Mint{\\n static constexpr T mod = MOD;\\n T v;\\n Mint():v(0){}\\n Mint(signed v):v(v){}\\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\\n\\n Mint pow(long long k){\\n Mint res(1),tmp(v);\\n while(k){\\n if(k&1) res*=tmp;\\n tmp*=tmp;\\n k>>=1;\\n }\\n return res;\\n }\\n\\n static Mint add_identity(){return Mint(0);}\\n static Mint mul_identity(){return Mint(1);}\\n\\n Mint inv(){return pow(MOD-2);}\\n\\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\\n\\n Mint operator+(Mint a) const{return Mint(v)+=a;}\\n Mint operator-(Mint a) const{return Mint(v)-=a;}\\n Mint operator*(Mint a) const{return Mint(v)*=a;}\\n Mint operator/(Mint a) const{return Mint(v)/=a;}\\n\\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\\n\\n bool operator==(const Mint a)const{return v==a.v;}\\n bool operator!=(const Mint a)const{return v!=a.v;}\\n bool operator <(const Mint a)const{return v <a.v;}\\n\\n static Mint comb(long long n,int k){\\n Mint num(1),dom(1);\\n for(int i=0;i<k;i++){\\n num*=Mint(n-i);\\n dom*=Mint(i+1);\\n }\\n return num/dom;\\n }\\n};\\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\\ntemplate<typename T,T MOD>\\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\\n\\n\\ntemplate<typename F>\\nstruct FixPoint : F{\\n FixPoint(F&& f):F(forward<F>(f)){}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const{\\n return F::operator()(*this,forward<Args>(args)...);\\n }\\n};\\ntemplate<typename F>\\ninline decltype(auto) MFP(F&& f){\\n return FixPoint<F>{forward<F>(f)};\\n}\\n\\n\\nstruct FastIO{\\n FastIO(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n}fastio_beet;\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n int n,m;\\n while(cin>>n>>m,n){\\n NiceTree G(n);\\n using P = pair<int, int>;\\n set<P> es;\\n for(int i=0;i<n;i++){\\n int j=(i+1)%n;\\n G.add_edge(i,j);\\n es.emplace(i,j);\\n es.emplace(j,i);\\n }\\n for(int i=0;i<m;i++){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n G.add_edge(a,b);\\n es.emplace(a,b);\\n es.emplace(b,a);\\n }\\n if(n&1){\\n cout<<0<<endl;\\n continue;\\n }\\n auto T=G.build();\\n\\n using M = Mint<int, 1000003>;\\n vector<vector<M>> dps(T.size());\\n vector<int> buff1(n),buff2(n,-1);\\n MFP([&](auto dfs,int v)->void{\\n const auto &bag=T[v].bag;\\n const auto &chd=T[v].child;\\n\\n for(int u:chd) dfs(u);\\n auto &dp=dps[v];\\n dp.assign(1<<bag.size(),0);\\n\\n if(T[v].type==NiceTree::LEAF){\\n dp[0]=M(1);\\n return;\\n }\\n\\n if(T[v].type==NiceTree::JOIN){\\n for(int i=0;i<(int)dp.size();i++)\\n for(int j=0;j<(int)dp.size();j++)\\n if((i&j)==0) dp[i|j]+=dps[chd[0]][i]*dps[chd[1]][j];\\n return;\\n }\\n\\n const auto &chd_bag=T[chd[0]].bag;\\n const auto &pr=dps[chd[0]];\\n\\n for(int i=0;i<(int)bag.size();i++){\\n buff1[bag[i]]=1<<i;\\n buff2[bag[i]]=v;\\n }\\n\\n if(T[v].type==NiceTree::INTRODUCE){\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0;\\n for(int j=0;j<(int)chd_bag.size();j++)\\n if((i>>j)&1) bit|=buff1[chd_bag[j]];\\n dp[bit]=pr[i];\\n }\\n return;\\n }\\n\\n if(T[v].type==NiceTree::FORGET){\\n int add=-1;\\n for(int i=0;i<(int)chd_bag.size();i++)\\n if(buff2[chd_bag[i]]!=v) add=chd_bag[i];\\n\\n vector<int> ex(bag.size());\\n for(int i=0;i<(int)bag.size();i++)\\n ex[i]=es.count(P(bag[i],add));\\n\\n for(int i=0;i<(int)pr.size();i++){\\n int bit=0,used=0;\\n for(int j=0;j<(int)chd_bag.size();j++){\\n if((~i>>j)&1) continue;\\n if(add==chd_bag[j]) used=1;\\n if(add!=chd_bag[j]) bit|=buff1[chd_bag[j]];\\n }\\n if(!used){\\n for(int j=0;j<(int)bag.size();j++){\\n if((bit>>j)&1) continue;\\n if(ex[j]) dp[bit|(1<<j)]+=pr[i];\\n }\\n }else{\\n dp[bit]+=pr[i];\\n }\\n }\\n return;\\n }\\n })(0);\\n\\n auto &dp=dps[0];\\n if(es.count(P(T[0].bag[0],T[0].bag[1])))\\n dp.back()+=dp[0];\\n cout<<dp.back()<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 67912,\n \"score_of_the_acc\": -0.7779,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2405_4171495\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nusing int64 = long long;\\nconst int mod = 1000003;\\n\\nconst int64 infll = (1LL << 58) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\nstruct DecompNode {\\n vector< int > bag, child;\\n\\n DecompNode() = default;\\n};\\n\\nstruct TreeDecomposition {\\n\\n vector< vector< int > > g;\\n\\n explicit TreeDecomposition(int V) : g(V) {}\\n\\n void add_edge(int a, int b) {\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n\\n vector< DecompNode > build() {\\n const int N = (int) g.size();\\n\\n if(N <= 3) {\\n DecompNode r;\\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\\n return {r};\\n }\\n\\n vector< int > used(N, -1), deg(N);\\n queue< int > que;\\n for(int i = 0; i < N; i++) {\\n deg[i] = (int) g[i].size();\\n if(deg[i] <= 2) que.emplace(i);\\n }\\n\\n vector< set< int > > exists(N);\\n for(int i = 0; i < N; i++) {\\n for(auto &j : g[i]) {\\n if(i < j) exists[i].emplace(j);\\n }\\n }\\n\\n vector< DecompNode > ret;\\n while(!que.empty()) {\\n int idx = que.front();\\n que.pop();\\n if(deg[idx] == 0 || deg[idx] > 2 || used[idx] != -1) continue;\\n DecompNode r;\\n r.bag.emplace_back(idx);\\n int u = -1, v = -1;\\n for(auto &to : g[idx]) {\\n if(used[to] == -1) {\\n (u == -1 ? u : v) = to;\\n r.bag.emplace_back(to);\\n } else if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n used[to] = -2;\\n }\\n }\\n\\n if(v == -1) {\\n --deg[u];\\n } else {\\n if(u > v) swap(u, v);\\n if(!exists[u].count(v)) {\\n g[u].emplace_back(v);\\n g[v].emplace_back(u);\\n exists[u].emplace(v);\\n } else {\\n --deg[u];\\n --deg[v];\\n }\\n }\\n\\n for(auto &to : g[idx]) {\\n if(deg[to] == 0) continue;\\n if(deg[to] <= 2) que.emplace(to);\\n }\\n\\n used[idx] = (int) ret.size();\\n deg[idx] = 0;\\n ret.emplace_back(r);\\n }\\n for(int i = 0; i < N; i++) {\\n if(deg[i] > 0) return {};\\n }\\n return ret;\\n }\\n};\\n\\nint to_nice(vector< DecompNode > &g, int root = -1) {\\n if(root == -1) root = (int) g.size() - 1;\\n\\n for(auto &p : g) {\\n sort(p.bag.begin(), p.bag.end());\\n }\\n\\n stack< int > st;\\n st.emplace(root);\\n\\n while(!st.empty()) {\\n int idx = st.top();\\n st.pop();\\n\\n // join\\n while(g[idx].child.size() > 2) {\\n DecompNode r;\\n r.child.resize(2);\\n r.child[0] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.child[1] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.bag = g[idx].bag;\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n\\n if(g[idx].child.size() == 2) {\\n for(auto &ch : g[idx].child) {\\n if(g[ch].bag != g[idx].bag) {\\n DecompNode r;\\n r.child.resize(1);\\n r.child[0] = ch;\\n r.bag = g[idx].bag;\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n }\\n\\n // introduce / forgot\\n if(g[idx].child.size() == 1) {\\n int &ch = g[idx].child[0];\\n\\n vector< int > latte, malta;\\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\\n g[ch].bag.begin(), g[ch].bag.end(),\\n back_inserter(latte));\\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\\n g[idx].bag.begin(), g[idx].bag.end(),\\n back_inserter(malta));\\n if(latte.size() + malta.size() > 1) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n if(!latte.empty()) {\\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\\n } else {\\n r.bag.emplace_back(malta.back());\\n }\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n\\n // leaf\\n if(g[idx].child.empty()) {\\n if(g[idx].bag.size() > 1) {\\n DecompNode r;\\n r.bag = g[idx].bag;\\n r.bag.pop_back();\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n }\\n\\n for(auto &ch : g[idx].child) {\\n st.emplace(ch);\\n }\\n }\\n return root;\\n}\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt &operator^=(int64_t n) {\\n int y = x;\\n x = 1;\\n while(n > 0) {\\n if(n & 1) x = 1LL * x * y % mod;\\n y = 1LL * y * y % mod;\\n n >>= 1;\\n }\\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 ModInt operator^(const int64_t n) const { return ModInt(*this) ^= n; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n a -= t * b;\\n swap(a, b);\\n u -= t * v;\\n swap(u, v);\\n }\\n return ModInt(u);\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt< mod > &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt< mod > &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\nint main() {\\n int N, M;\\n while(cin >> N >> M, N) {\\n TreeDecomposition g(N);\\n set< pair< int, int > > edges;\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n edges.emplace(minmax(a, b));\\n g.add_edge(a, b);\\n }\\n if(N % 2) {\\n cout << 0 << endl;\\n continue;\\n }\\n for(int i = 0; i < N; i++) {\\n edges.emplace(minmax(i, (i + 1) % N));\\n g.add_edge(i, (i + 1) % N);\\n }\\n auto t = g.build();\\n int root = to_nice(t);\\n vector< vector< modint > > dps(t.size());\\n vector< int > buff(N), buff2(N, -1);\\n\\n MFP([&](auto rec, int idx) -> void {\\n\\n auto &ch = t[idx].child;\\n auto &bag = t[idx].bag;\\n\\n for(auto &to : ch) rec(to);\\n vector< modint > dp(1 << bag.size());\\n\\n if(ch.empty()) { // leaf\\n dp[0] = 1;\\n } else if(ch.size() == 2) { // join\\n for(int i = 0; i < dp.size(); i++) {\\n for(int j = 0; j < dp.size(); j++) {\\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\\n }\\n }\\n } else {\\n auto &ch_bag = t[ch[0]].bag;\\n auto &ch_dp = dps[ch[0]];\\n\\n for(int i = 0; i < bag.size(); i++) {\\n buff[bag[i]] = 1 << i;\\n buff2[bag[i]] = idx;\\n }\\n\\n if(ch_bag.size() + 1 == bag.size()) { // introduce\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\\n }\\n dp[bit] = ch_dp[i];\\n }\\n } else { // forgot\\n int v = -1;\\n for(int i = 0; i < ch_bag.size(); i++) {\\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\\n }\\n vector< int > ok_match(bag.size());\\n for(int i = 0; i < bag.size(); i++) {\\n ok_match[i] = edges.count(minmax(bag[i], v));\\n }\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n bool v_use = false;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) {\\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\\n } else {\\n if(v == ch_bag[j]) v_use = true;\\n }\\n }\\n if(v_use) {\\n for(int j = 0; j < bag.size(); j++) {\\n if((bit >> j) & 1) continue;\\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\\n }\\n } else {\\n dp[bit] += ch_dp[i];\\n }\\n }\\n }\\n }\\n dps[idx].swap(dp);\\n })(root);\\n auto &dp = dps[root];\\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\\n cout << dp.back() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 57796,\n \"score_of_the_acc\": -0.6362,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2405_4171487\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nusing int64 = long long;\\nconst int mod = 1000003;\\n\\nconst int64 infll = (1LL << 58) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\nstruct DecompNode {\\n vector< int > bag, child;\\n\\n DecompNode() = default;\\n};\\n\\nstruct TreeDecomposition {\\n\\n vector< vector< int > > g;\\n\\n explicit TreeDecomposition(int V) : g(V) {}\\n\\n void add_edge(int a, int b) {\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n\\n vector< DecompNode > build() {\\n const int N = (int) g.size();\\n\\n if(N <= 3) {\\n DecompNode r;\\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\\n return {r};\\n }\\n\\n vector< int > used(N, -1), deg(N);\\n queue< int > que;\\n for(int i = 0; i < N; i++) {\\n deg[i] = (int) g[i].size();\\n if(deg[i] <= 2) que.emplace(i);\\n }\\n\\n vector< set< int > > exists(N);\\n for(int i = 0; i < N; i++) {\\n for(auto &j : g[i]) {\\n if(i < j) exists[i].emplace(j);\\n }\\n }\\n\\n vector< DecompNode > ret;\\n while(!que.empty()) {\\n int idx = que.front();\\n que.pop();\\n if(deg[idx] == 0 || deg[idx] > 2 || used[idx] != -1) continue;\\n DecompNode r;\\n r.bag.emplace_back(idx);\\n int u = -1, v = -1;\\n for(auto &to : g[idx]) {\\n if(used[to] == -1) {\\n (u == -1 ? u : v) = to;\\n r.bag.emplace_back(to);\\n } else if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n used[to] = -2;\\n }\\n }\\n\\n if(v == -1) {\\n --deg[u];\\n } else {\\n if(u > v) swap(u, v);\\n if(!exists[u].count(v)) {\\n g[u].emplace_back(v);\\n g[v].emplace_back(u);\\n exists[u].emplace(v);\\n } else {\\n --deg[u];\\n --deg[v];\\n }\\n }\\n\\n for(auto &to : g[idx]) {\\n if(deg[to] == 0) continue;\\n if(deg[to] <= 2) que.emplace(to);\\n }\\n\\n used[idx] = (int) ret.size();\\n deg[idx] = 0;\\n ret.emplace_back(r);\\n }\\n for(int i = 0; i < N; i++) {\\n if(deg[i] > 0) return {};\\n }\\n return ret;\\n }\\n};\\n\\nint to_nice(vector< DecompNode > &g, int root = -1) {\\n if(root == -1) root = (int) g.size() - 1;\\n\\n for(auto &p : g) {\\n sort(p.bag.begin(), p.bag.end());\\n }\\n\\n stack< int > st;\\n st.emplace(root);\\n\\n while(!st.empty()) {\\n int idx = st.top();\\n st.pop();\\n\\n // join\\n while(g[idx].child.size() > 2) {\\n DecompNode r;\\n r.child.resize(2);\\n r.child[0] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.child[1] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.bag = g[idx].bag;\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n\\n if(g[idx].child.size() == 2) {\\n for(auto &ch : g[idx].child) {\\n if(g[ch].bag != g[idx].bag) {\\n DecompNode r;\\n r.child.resize(1);\\n r.child[0] = ch;\\n r.bag = g[idx].bag;\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n }\\n\\n // introduce / forgot\\n if(g[idx].child.size() == 1) {\\n int &ch = g[idx].child[0];\\n\\n vector< int > latte, malta;\\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\\n g[ch].bag.begin(), g[ch].bag.end(),\\n back_inserter(latte));\\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\\n g[idx].bag.begin(), g[idx].bag.end(),\\n back_inserter(malta));\\n if(latte.size() + malta.size() > 1) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n if(!latte.empty()) {\\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\\n } else {\\n r.bag.emplace_back(malta.back());\\n }\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n\\n for(auto &ch : g[idx].child) {\\n st.emplace(ch);\\n }\\n }\\n return root;\\n}\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt &operator^=(int64_t n) {\\n int y = x;\\n x = 1;\\n while(n > 0) {\\n if(n & 1) x = 1LL * x * y % mod;\\n y = 1LL * y * y % mod;\\n n >>= 1;\\n }\\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 ModInt operator^(const int64_t n) const { return ModInt(*this) ^= n; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n a -= t * b;\\n swap(a, b);\\n u -= t * v;\\n swap(u, v);\\n }\\n return ModInt(u);\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt< mod > &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt< mod > &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\nint main() {\\n int N, M;\\n while(cin >> N >> M, N) {\\n TreeDecomposition g(N);\\n set< pair< int, int > > edges;\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n edges.emplace(minmax(a, b));\\n g.add_edge(a, b);\\n }\\n if(N % 2) {\\n cout << 0 << endl;\\n continue;\\n }\\n for(int i = 0; i < N; i++) {\\n edges.emplace(minmax(i, (i + 1) % N));\\n g.add_edge(i, (i + 1) % N);\\n }\\n auto t = g.build();\\n int root = to_nice(t);\\n vector< vector< modint > > dps(t.size());\\n vector< int > buff(N), buff2(N, -1);\\n\\n MFP([&](auto rec, int idx) -> void {\\n\\n auto &ch = t[idx].child;\\n auto &bag = t[idx].bag;\\n\\n for(auto &to : ch) rec(to);\\n vector< modint > dp(1 << bag.size());\\n\\n if(ch.empty()) { // leaf\\n dp[0] = 1;\\n } else if(ch.size() == 2) { // join\\n for(int i = 0; i < dp.size(); i++) {\\n for(int j = 0; j < dp.size(); j++) {\\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\\n }\\n }\\n } else {\\n auto &ch_bag = t[ch[0]].bag;\\n auto &ch_dp = dps[ch[0]];\\n\\n for(int i = 0; i < bag.size(); i++) {\\n buff[bag[i]] = 1 << i;\\n buff2[bag[i]] = idx;\\n }\\n\\n if(ch_bag.size() + 1 == bag.size()) { // introduce\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\\n }\\n dp[bit] = ch_dp[i];\\n }\\n } else { // forgot\\n int v = -1;\\n for(int i = 0; i < ch_bag.size(); i++) {\\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\\n }\\n vector< int > ok_match(bag.size());\\n for(int i = 0; i < bag.size(); i++) {\\n ok_match[i] = edges.count(minmax(bag[i], v));\\n }\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n bool v_use = false;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) {\\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\\n } else {\\n if(v == ch_bag[j]) v_use = true;\\n }\\n }\\n if(v_use) {\\n for(int j = 0; j < bag.size(); j++) {\\n if((bit >> j) & 1) continue;\\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\\n }\\n } else {\\n dp[bit] += ch_dp[i];\\n }\\n }\\n }\\n }\\n dps[idx].swap(dp);\\n })(root);\\n auto &dp = dps[root];\\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\\n cout << dp.back() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 52380,\n \"score_of_the_acc\": -0.5746,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2405_4170680\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nusing int64 = long long;\\nconst int mod = 1000003;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\nstruct DecompNode {\\n vector< int > bag, child;\\n\\n DecompNode() = default;\\n};\\n\\nstruct TreeDecomposition {\\n\\n vector< vector< int > > g;\\n\\n explicit TreeDecomposition(int V) : g(V) {}\\n\\n void add_edge(int a, int b) {\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n\\n vector< DecompNode > build() {\\n const int N = (int) g.size();\\n\\n if(N <= 3) {\\n DecompNode r;\\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\\n return {r};\\n }\\n\\n vector< int > used(N, -1), deg(N);\\n queue< int > que;\\n for(int i = 0; i < N; i++) {\\n deg[i] = (int) g[i].size();\\n if(deg[i] == 2) que.emplace(i);\\n }\\n\\n vector< set< int > > exists(N);\\n for(int i = 0; i < N; i++) {\\n for(auto &j : g[i]) {\\n if(i < j) exists[i].emplace(j);\\n }\\n }\\n\\n vector< DecompNode > ret;\\n while(!que.empty()) {\\n int idx = que.front();\\n que.pop();\\n if(deg[idx] != 2 || used[idx] != -1) continue;\\n\\n DecompNode r;\\n r.bag.emplace_back(idx);\\n int u = -1, v = -1;\\n for(auto &to : g[idx]) {\\n if(used[to] == -1) {\\n (u == -1 ? u : v) = to;\\n r.bag.emplace_back(to);\\n } else if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n used[to] = -2;\\n }\\n }\\n\\n if(u > v) swap(u, v);\\n if(!exists[u].count(v)) {\\n g[u].emplace_back(v);\\n g[v].emplace_back(u);\\n exists[u].emplace(v);\\n } else {\\n --deg[u];\\n --deg[v];\\n }\\n\\n for(auto &to : g[idx]) {\\n if(deg[to] == 2) que.emplace(to);\\n }\\n\\n used[idx] = (int) ret.size();\\n deg[idx] = 0;\\n ret.emplace_back(r);\\n }\\n\\n DecompNode r;\\n for(int i = 0; i < N; i++) {\\n if(deg[i] == 1) r.bag.emplace_back(i);\\n }\\n if(r.bag.size() != 2) return {};\\n for(auto &to : g[r.bag[0]]) {\\n if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n }\\n }\\n ret.emplace_back(r);\\n return ret;\\n }\\n};\\n\\n\\nint to_nice(vector< DecompNode > &g, int root = -1) {\\n if(root == -1) root = (int) g.size() - 1;\\n\\n for(auto &p : g) {\\n sort(p.bag.begin(), p.bag.end());\\n }\\n\\n stack< int > st;\\n st.emplace(root);\\n\\n while(!st.empty()) {\\n int idx = st.top();\\n st.pop();\\n\\n // join\\n while(g[idx].child.size() > 2) {\\n DecompNode r;\\n r.child.resize(2);\\n r.child[0] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.child[1] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.bag = g[idx].bag;\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n\\n if(g[idx].child.size() == 2) {\\n for(auto &ch : g[idx].child) {\\n if(g[ch].bag != g[idx].bag) {\\n DecompNode r;\\n r.child.resize(1);\\n r.child[0] = ch;\\n r.bag = g[idx].bag;\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n }\\n\\n // introduce / forgot\\n if(g[idx].child.size() == 1) {\\n int &ch = g[idx].child[0];\\n\\n vector< int > latte, malta;\\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\\n g[ch].bag.begin(), g[ch].bag.end(),\\n back_inserter(latte));\\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\\n g[idx].bag.begin(), g[idx].bag.end(),\\n back_inserter(malta));\\n if(latte.size() + malta.size() > 1) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n if(!latte.empty()) {\\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\\n } else {\\n r.bag.emplace_back(malta.back());\\n }\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n\\n for(auto &ch : g[idx].child) {\\n st.emplace(ch);\\n }\\n }\\n return root;\\n}\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\nint main() {\\n int N, M;\\n while(cin >> N >> M, N) {\\n TreeDecomposition g(N);\\n set< pair< int, int > > edges;\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n edges.emplace(minmax(a, b));\\n g.add_edge(a, b);\\n }\\n if(N % 2) {\\n cout << 0 << endl;\\n continue;\\n }\\n for(int i = 0; i < N; i++) {\\n edges.emplace(minmax(i, (i + 1) % N));\\n g.add_edge(i, (i + 1) % N);\\n }\\n auto t = g.build();\\n int root = to_nice(t);\\n vector< vector< modint > > dps(t.size());\\n vector< int > buff(N), buff2(N, -1);\\n\\n MFP([&](auto rec, int idx) -> void {\\n\\n auto &ch = t[idx].child;\\n auto &bag = t[idx].bag;\\n\\n for(auto &to : ch) rec(to);\\n vector< modint > dp(1 << bag.size());\\n\\n if(ch.empty()) { // leaf\\n dp[0] = 1;\\n } else if(ch.size() == 2) { // join\\n for(int i = 0; i < dp.size(); i++) {\\n for(int j = 0; j < dp.size(); j++) {\\n if((i & j) == 0) dp[i | j] += dps[ch[0]][i] * dps[ch[1]][j];\\n }\\n }\\n } else {\\n auto &ch_bag = t[ch[0]].bag;\\n auto &ch_dp = dps[ch[0]];\\n\\n for(int i = 0; i < bag.size(); i++) {\\n buff[bag[i]] = 1 << i;\\n buff2[bag[i]] = idx;\\n }\\n\\n if(ch_bag.size() + 1 == bag.size()) { // introduce\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\\n }\\n dp[bit] = ch_dp[i];\\n }\\n } else { // forgot\\n int v = -1;\\n for(int i = 0; i < ch_bag.size(); i++) {\\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\\n }\\n vector< int > ok_match(bag.size());\\n for(int i = 0; i < bag.size(); i++) {\\n ok_match[i] = edges.count(minmax(bag[i], v));\\n }\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n bool v_use = false;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) {\\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\\n } else {\\n if(v == ch_bag[j]) v_use = true;\\n }\\n }\\n if(v_use) {\\n for(int j = 0; j < bag.size(); j++) {\\n if((bit >> j) & 1) continue;\\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\\n }\\n } else {\\n dp[bit] += ch_dp[i];\\n }\\n }\\n }\\n }\\n dps[idx].swap(dp);\\n })(root);\\n auto &dp = dps[root];\\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\\n cout << dp.back() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 52444,\n \"score_of_the_acc\": -0.5738,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2405_4170678\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n\\nusing int64 = long long;\\nconst int mod = 1000003;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\nstruct DecompNode {\\n vector< int > bag, child;\\n\\n DecompNode() = default;\\n};\\n\\nstruct TreeDecomposition {\\n\\n vector< vector< int > > g;\\n\\n explicit TreeDecomposition(int V) : g(V) {}\\n\\n void add_edge(int a, int b) {\\n g[a].emplace_back(b);\\n g[b].emplace_back(a);\\n }\\n\\n vector< DecompNode > build() {\\n const int N = (int) g.size();\\n\\n if(N <= 3) {\\n DecompNode r;\\n for(int i = 0; i < N; i++) r.bag.emplace_back(i);\\n return {r};\\n }\\n\\n vector< int > used(N, -1), deg(N);\\n queue< int > que;\\n for(int i = 0; i < N; i++) {\\n deg[i] = (int) g[i].size();\\n if(deg[i] == 2) que.emplace(i);\\n }\\n\\n vector< set< int > > exists(N);\\n for(int i = 0; i < N; i++) {\\n for(auto &j : g[i]) {\\n if(i < j) exists[i].emplace(j);\\n }\\n }\\n\\n vector< DecompNode > ret;\\n while(!que.empty()) {\\n int idx = que.front();\\n que.pop();\\n if(deg[idx] != 2 || used[idx] != -1) continue;\\n\\n DecompNode r;\\n r.bag.emplace_back(idx);\\n int u = -1, v = -1;\\n for(auto &to : g[idx]) {\\n if(used[to] == -1) {\\n (u == -1 ? u : v) = to;\\n r.bag.emplace_back(to);\\n } else if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n used[to] = -2;\\n }\\n }\\n\\n if(u > v) swap(u, v);\\n if(!exists[u].count(v)) {\\n g[u].emplace_back(v);\\n g[v].emplace_back(u);\\n exists[u].emplace(v);\\n } else {\\n --deg[u];\\n --deg[v];\\n }\\n\\n for(auto &to : g[idx]) {\\n if(deg[to] == 2) que.emplace(to);\\n }\\n\\n used[idx] = (int) ret.size();\\n deg[idx] = 0;\\n ret.emplace_back(r);\\n }\\n\\n DecompNode r;\\n for(int i = 0; i < N; i++) {\\n if(deg[i] == 1) r.bag.emplace_back(i);\\n }\\n if(r.bag.size() != 2) return {};\\n for(auto &to : g[r.bag[0]]) {\\n if(used[to] >= 0) {\\n r.child.emplace_back(used[to]);\\n }\\n }\\n ret.emplace_back(r);\\n return ret;\\n }\\n};\\n\\n\\nint to_nice(vector< DecompNode > &g, int root = -1) {\\n if(root == -1) root = (int) g.size() - 1;\\n\\n for(auto &p : g) {\\n sort(p.bag.begin(), p.bag.end());\\n }\\n\\n stack< int > st;\\n st.emplace(root);\\n\\n while(!st.empty()) {\\n int idx = st.top();\\n st.pop();\\n\\n // join\\n while(g[idx].child.size() > 2) {\\n DecompNode r;\\n r.child.resize(2);\\n r.child[0] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.child[1] = g[idx].child.back();\\n g[idx].child.pop_back();\\n r.bag = g[idx].bag;\\n g[idx].child.emplace_back((int) g.size());\\n g.emplace_back(r);\\n }\\n\\n if(g[idx].child.size() == 2) {\\n for(auto &ch : g[idx].child) {\\n if(g[ch].bag != g[idx].bag) {\\n DecompNode r;\\n r.child.resize(1);\\n r.child[0] = ch;\\n r.bag = g[idx].bag;\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n }\\n\\n // introduce / forgot\\n if(g[idx].child.size() == 1) {\\n int &ch = g[idx].child[0];\\n\\n vector< int > latte, malta;\\n set_difference(g[idx].bag.begin(), g[idx].bag.end(),\\n g[ch].bag.begin(), g[ch].bag.end(),\\n back_inserter(latte));\\n set_difference(g[ch].bag.begin(), g[ch].bag.end(),\\n g[idx].bag.begin(), g[idx].bag.end(),\\n back_inserter(malta));\\n if(latte.size() + malta.size() > 1) {\\n DecompNode r;\\n r.child = {ch};\\n r.bag = g[idx].bag;\\n if(!latte.empty()) {\\n r.bag.erase(find(r.bag.begin(), r.bag.end(), latte.back()));\\n } else {\\n r.bag.emplace_back(malta.back());\\n }\\n ch = (int) g.size();\\n g.emplace_back(r);\\n }\\n }\\n\\n for(auto &ch : g[idx].child) {\\n st.emplace(ch);\\n }\\n }\\n return root;\\n}\\n\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n\\n ModInt() : x(0) {}\\n\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n\\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n\\n ModInt operator-() const { return ModInt(-x); }\\n\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n\\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n\\n static int get_mod() { return mod; }\\n};\\n\\nusing modint = ModInt< mod >;\\n\\nint main() {\\n int N, M;\\n while(cin >> N >> M, N) {\\n TreeDecomposition g(N);\\n set< pair< int, int > > edges;\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n edges.emplace(minmax(a, b));\\n g.add_edge(a, b);\\n }\\n if(N == 3) {\\n cout << 0 << endl;\\n continue;\\n }\\n for(int i = 0; i < N; i++) {\\n edges.emplace(minmax(i, (i + 1) % N));\\n g.add_edge(i, (i + 1) % N);\\n }\\n auto t = g.build();\\n int root = to_nice(t);\\n vector< vector< modint > > dps(t.size());\\n vector< int > buff(N), buff2(N, -1);\\n\\n MFP([&](auto rec, int idx) -> void {\\n\\n auto &ch = t[idx].child;\\n auto &bag = t[idx].bag;\\n\\n for(auto &to : ch) rec(to);\\n vector< modint > dp(1 << bag.size());\\n\\n if(ch.empty()) { // leaf\\n dp[0] = 1;\\n } else if(ch.size() == 2) { // join\\n dp[0] = 1;\\n for(auto &ch_dp : {dps[ch[0]], dps[ch[1]]}) {\\n vector< modint > dp2(1 << bag.size(), 0);\\n for(int i = 0; i < dp.size(); i++) {\\n for(int j = 0; j < ch_dp.size(); j++) {\\n if((i & j) == 0) dp2[i | j] += dp[i] * ch_dp[j];\\n }\\n }\\n dp2.swap(dp);\\n }\\n } else {\\n auto &ch_bag = t[ch[0]].bag;\\n auto &ch_dp = dps[ch[0]];\\n\\n for(int i = 0; i < bag.size(); i++) {\\n buff[bag[i]] = 1 << i;\\n buff2[bag[i]] = idx;\\n }\\n\\n if(ch_bag.size() + 1 == bag.size()) { // introduce\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) bit |= buff[ch_bag[j]];\\n }\\n dp[bit] = ch_dp[i];\\n }\\n } else { // forgot\\n int v = -1;\\n for(int i = 0; i < ch_bag.size(); i++) {\\n if(buff2[ch_bag[i]] != idx) v = ch_bag[i];\\n }\\n vector< int > ok_match(bag.size());\\n for(int i = 0; i < bag.size(); i++) {\\n ok_match[i] = edges.count(minmax(bag[i], v));\\n }\\n for(int i = 0; i < ch_dp.size(); i++) {\\n int bit = 0;\\n bool v_use = false;\\n for(int j = 0; j < ch_bag.size(); j++) {\\n if((i >> j) & 1) {\\n if(v != ch_bag[j]) bit |= buff[ch_bag[j]];\\n } else {\\n if(v == ch_bag[j]) v_use = true;\\n }\\n }\\n if(v_use) {\\n for(int j = 0; j < bag.size(); j++) {\\n if((bit >> j) & 1) continue;\\n if(ok_match[j]) dp[bit | (1 << j)] += ch_dp[i];\\n }\\n } else {\\n dp[bit] += ch_dp[i];\\n }\\n }\\n }\\n }\\n dps[idx].swap(dp);\\n })(root);\\n auto &dp = dps[root];\\n if(edges.count(minmax(t[root].bag[0], t[root].bag[1]))) dp.back() += dp[0];\\n cout << dp.back() << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 57132,\n \"score_of_the_acc\": -0.6236,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1374,"cells":{"group_id":{"kind":"string","value":"aoj_2398_cpp"},"problem_description":{"kind":"string","value":"Tree Allocation\nA tree is one of the most popular data structures in computer science.\nTree itself is very elegant, but it is incompatible with current computer architecture.\nIn the current architecture, memory can be regarded as a one-dimensional array.\nSince a tree is not a one-dimensional structure, cache efficiency may come into question when we allocate a tree on memory.\nWe can access the data faster if it is contained in cache.\nLet us consider the allocation of nodes of a tree which achieves high cache performance.\nWe define the cost of allocation for a tree as follows.\nFor simplicity, we regard memory to be separated to blocks each can store at most\nB\nnodes of a tree.\nWhen we access data in a block, all data in the block are stored in cache and access request to data in the block will be faster.\nThe cost of an access to node\nu\nafter node\nv\nis 0 if\nu\nand\nv\nare in same block, and 1 otherwise.\nInitially, cache has no data and the cost of an access to a node is always 1.\nThe cost of the path\nv_1\n,\nv_2\n,...,\nv_n\nis sum of the cost when we access the nodes\nv_1\n,\nv_2\n,...,\nv_n\nin this order.\nFor a tree, we define the cost of allocation as a maximum cost of the paths from root node to each terminal node.\nThe figures below show examples of allocation when B = 4 and node 1 is the root node (it corresponds to the tree described in the third sample input).\nEach frame represents a block.\nThe left figure is an example of allocation whose cost is 3.\nIt is not optimal, because\nthe right example achieves the optimal allocation cost 2.\nGiven a tree, for each node\ni\nin the tree, calculate the minimum cost of allocation when the node\ni\nis the root node.\nInput\nThe input contains several test cases.\nEach test case starts with a line containing two integers\nN\n(\n1 \\leq N \\leq 100,000\n) and\nB\n(\n1\\leq B \\leq N\n), separated by a single space.\nEach of the next\nN-1\nlines contains an integer.\nThe\ni\n-th integer\np_i\n(\n1 \\leq p_i \\leq i\n) denotes that the node\ni+1\nand the node\np_i\nare connected.\nThe nodes are numbered from 1 to\nN\n.\nThe last test case is followed by a line containing two zeros.\nOutput\nFor each test case, print its case number.\nThen print\nN\nlines.\nThe\ni\n-th line should contain an integer which denotes the minimum cost of allocation of the given tree when node\ni\nis the root node.\nFollow the format of the sample output.\nSample Input\n3 1\n1\n2\n3 2\n1\n1\n10 4\n1\n1\n2\n3\n3\n4\n4\n4\n5\n0 0\nOutput for the Sample Input\nCase 1:\n3\n2\n3\nCase 2:\n2\n2\n2\nCase 3:\n2\n2\n2\n2\n2\n2\n2\n2\n2\n3"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2398_10852730","code_snippet":"#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst int Maxn = 100010;\t\nint n, b;\nvector<int> vec[Maxn];\nint dp[Maxn], B[Maxn],tmpdp[Maxn];\nbool cmp(int x, int y)\n{\n\treturn dp[x] > dp[y];\n}\nvoid dfs(int x,int l)\n{\n\tfor (int i = 0; i < vec[x].size(); ++i)\n\t{\n\t\tint x1 = vec[x][i];\n\t\tif (x1 == l) continue;\n\t\tdfs(x1, x);\t\n\t}\n\tsort(vec[x].begin(), vec[x].end(), cmp);\n\tif (vec[x].size() == 1)\n\t{\n\t\tdp[x] = 1;\n\t\tB[x] = 1;\n\t//\tcout << x <<\" \" << dp[x] << endl;\n\t\treturn;\n\t}\n\tint tmpb = 0;\n\tfor (int i = 0; i < vec[x].size() && dp[vec[x][0]] == dp[vec[x][i]]; ++i)\n\t\ttmpb += B[vec[x][i]];\n\tif (tmpb >= b)\n\t\tdp[x] = dp[vec[x][0]] + 1, B[x] = 1;\n\telse dp[x] = dp[vec[x][0]], B[x] = tmpb + 1;\n\ttmpdp[x] = dp[x];\n\t//cout << x <<\" \" << dp[x] << endl;\n}\nint ans[Maxn];\nvoid DFS(int x, int l, int pdp, int pB)\n{\n\t//cout << x <<\" \" << pdp <<\" \" << pB << endl;\n\tif (pB >= b) ans[x] = max(dp[x], pdp + 1);\n\telse if (pdp < dp[x]) ans[x] = dp[x];\n\telse if(pdp > dp[x]) ans[x] = pdp;\n\telse if (pB + B[x] <= b) ans[x] = dp[x];\n\telse ans[x] = dp[x] + 1;\n\tif (vec[x].size() == 1) return;\n\tdp[l] = pdp, B[l] = pB;\n\tsort(vec[x].begin(), vec[x].end(), cmp);\n\tint tmpa = 0, tmpb = 0;\n\tfor (int i = 0; i < vec[x].size() && dp[vec[x][0]] == dp[vec[x][i]]; ++i)\n\t\ttmpa += B[vec[x][i]];\n\tfor (int i = 1; i < vec[x].size() && dp[vec[x][1]] == dp[vec[x][i]]; ++i)\n\t\ttmpb += B[vec[x][i]];\n\t\n\tfor (int i = 0; i < vec[x].size(); ++i)\n\t{\n\t\tint x1 = vec[x][i];\n\t\tif (x1 == l) continue;\n\t\tint tmp = tmpa, DP = dp[vec[x][0]];\n\t\tif (DP == dp[x1])\n\t\t{\n\t\t\tif (tmpa == B[x1]) tmp = tmpb, DP = dp[vec[x][1]];\n\t\t\telse tmp -= B[x1];\n\t\t}\n\t\tif (tmp >= b) DFS(x1, x, DP + 1, 1);\n\t\telse DFS(x1, x, DP, tmp + 1);\n\t}\n\tdp[l] = tmpdp[l];\n}\nint main()\n{\n\tint cas = 1;\n\twhile (scanf(\"%d%d\", &n, &b) != EOF)\n\t{\n\t\tif (n == 0) break;\n\t\tprintf(\"Case %d:\\n\", cas++);\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t\tvec[i].clear();\n\t\tfor (int i = 2; i <= n; ++i)\n\t\t{\n\t\t\tint x;\n\t\t\tscanf(\"%d\", &x);\n\t\t\tvec[x].push_back(i), vec[i].push_back(x);\n\t\t}\n\t\tvec[1].push_back(0);\n\t\tmemset(dp, -1, sizeof(dp));\n\t\t//cout <<\"begin\" << endl;\n\t\tdfs(1, 0);\n\t\t\n\t\tDFS(1, 0, 0, b);\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t\tprintf(\"%d\\n\", ans[i]);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":19924,"score_of_the_acc":-0.1341,"final_rank":6},{"submission_id":"aoj_2398_10779267","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstatic const int MAXN = 100000;\n\nint N, B;\nvector<int> adj[MAXN+1];\nint parent_[MAXN+1], order_[MAXN+1], ord_sz;\n\n// Для поддерева при корне=1:\nint cut_down[MAXN+1], sz_down[MAXN+1];\n// Для «подъёма» над v при reroot:\nint cut_up[MAXN+1], sz_up[MAXN+1];\n// Итоговая стоимость:\nint answer_[MAXN+1];\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int tc = 0;\n while (true) {\n cin >> N >> B;\n if ((N==0 && B==0)) break;\n ++tc;\n for(int i=1;i<=N;i++){\n adj[i].clear();\n }\n // Ввод: N-1 чисел p_i, ребро (p_i, i+1)\n for(int i=2, p;i<=N;i++){\n cin >> p;\n adj[p].push_back(i);\n adj[i].push_back(p);\n }\n\n // --- 1) Построим parent_[] и порядок обхода ---\n ord_sz = 0;\n {\n // Итеративный DFS\n vector<int> st;\n st.reserve(N);\n st.push_back(1);\n parent_[1] = 0;\n while (!st.empty()) {\n int v = st.back(); st.pop_back();\n order_[ord_sz++] = v;\n for (int u: adj[v]) {\n if (u == parent_[v]) continue;\n parent_[u] = v;\n st.push_back(u);\n }\n }\n }\n // --- 2) Посчитаем DP_down в обратном порядке ---\n for(int idx = ord_sz-1; idx >= 0; --idx){\n int v = order_[idx];\n int m1 = 0, m2 = 0, S1 = 0, S2 = 0, cnt1 = 0;\n // Смотрим только детей (u != parent)\n for(int u: adj[v]){\n if (u == parent_[v]) continue;\n int c = cut_down[u], s = sz_down[u];\n if (c > m1) {\n m2 = m1; S2 = S1;\n m1 = c; S1 = s; cnt1 = 1;\n } else if (c == m1) {\n S1 += s; cnt1++;\n } else if (c > m2) {\n m2 = c; S2 = s;\n } else if (c == m2) {\n S2 += s;\n }\n }\n if (S1 <= B-1) {\n cut_down[v] = m1;\n sz_down[v] = 1 + S1;\n } else {\n cut_down[v] = m1 + 1;\n sz_down[v] = 1;\n }\n }\n\n // --- 3) Reroot: посчитаем cut_up, sz_up и сразу же итог answer_ ---\n // Pre-order обход:\n {\n // стек пар (v, parent)\n vector<pair<int,int>> st;\n st.reserve(N);\n st.emplace_back(1, 0);\n cut_up[1] = 0; // не используется для v=1, но нужен для унификации\n sz_up[1] = 0;\n\n while (!st.empty()) {\n auto [v, p] = st.back(); st.pop_back();\n\n // Собираем DPchild = дети + «подъем»:\n int m1 = 0, m2 = 0, S1 = 0, S2 = 0, cnt1 = 0;\n // учтём «подъем» только если есть parent\n if (p != 0) {\n int c = cut_up[v], s = sz_up[v];\n if (c > m1) {\n m2 = m1; S2 = S1;\n m1 = c; S1 = s; cnt1 = 1;\n } else if (c == m1) {\n S1 += s; cnt1++;\n } else if (c > m2) {\n m2 = c; S2 = s;\n } else if (c == m2) {\n S2 += s;\n }\n }\n // и теперь всех «настоящих» детей:\n for(int u: adj[v]){\n if (u == p) continue;\n int c = cut_down[u], s = sz_down[u];\n if (c > m1) {\n m2 = m1; S2 = S1;\n m1 = c; S1 = s; cnt1 = 1;\n } else if (c == m1) {\n S1 += s; cnt1++;\n } else if (c > m2) {\n m2 = c; S2 = s;\n } else if (c == m2) {\n S2 += s;\n }\n }\n\n // Вычисляем итоговую стоимость для корня=v\n int bestCut = (S1 <= B-1 ? m1 : (m1+1));\n answer_[v] = bestCut + 1;\n\n // Готовим DP_up для детей\n for(int u: adj[v]){\n if (u == p) continue;\n int c_u = cut_down[u], s_u = sz_down[u];\n int m_ex, S_ex;\n if (c_u < m1) {\n // ребёнок не наивысший => m1,S1 не меняются\n m_ex = m1; S_ex = S1;\n } else if (c_u == m1) {\n if (cnt1 > 1) {\n // есть ещё кто-то с тем же cut=m1\n m_ex = m1;\n S_ex = S1 - s_u;\n } else {\n // этот ребёнок был **единственным** с cut=m1\n m_ex = m2;\n S_ex = S2;\n }\n } else {\n // не может быть >m1, т.к. m1=max\n m_ex = m1; S_ex = S1; // формально\n }\n if (S_ex <= B-1) {\n cut_up[u] = m_ex;\n sz_up[u] = 1 + S_ex;\n } else {\n cut_up[u] = m_ex + 1;\n sz_up[u] = 1;\n }\n st.emplace_back(u, v);\n }\n }\n }\n\n // --- 4) Вывод ---\n cout << \"Case \" << tc << \":\\n\";\n for(int i=1;i<=N;i++){\n cout << answer_[i] << \"\\n\";\n }\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":13668,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2398_10771672","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#ifdef LOCAL\n#include \"algo/debug.h\"\n#else\n#define debug(...) 42\n#endif\n\nconst int MAXN = 1e5 + 10;\nconst int INF = 1e9;\nvector<int> g[MAXN];\n\npair<int, int> dp[MAXN];\nint n, b;\n\npair<int, int> cmp(pair<int, int> x, pair<int, int> y) {\n if (x.first < y.first) return y;\n if (x.first > y.first) return x;\n return {x.first, x.second + y.second};\n}\n\nvoid dfs(int u) {\n if (g[u].size() == 0 && u != 1) {\n dp[u] = {1, 1};\n return;\n }\n int cnt = 0, mx = 0;\n for (int v : g[u]) {\n dfs(v);\n if (mx < dp[v].first) {\n mx = dp[v].first;\n cnt = dp[v].second;\n } else if (mx == dp[v].first) {\n cnt += dp[v].second;\n }\n }\n dp[u] = {mx + 1, 1};\n if (cnt < b) dp[u] = min(dp[u], {mx, cnt + 1});\n}\n\npair<int, int> dp2[MAXN], ans[MAXN]; // dp par\n\npair<int, int> suf[MAXN], pre[MAXN];\n\nvoid dfs2(int u, int p) {\n pair<int, int> c = dp2[u];\n for (int v : g[u]) {\n c = cmp(c, dp[v]);\n }\n// debug(dp2[u], u);\n if (u == 1) ans[u] = dp[u];\n else {\n if (c.second < b) ans[u] = {c.first, c.second + 1};\n else ans[u] = {c.first + 1, 1};\n }\n for (int i = 0; i < (int)g[u].size(); i++) {\n pre[i] = dp[g[u][i]];\n if (i) pre[i] = cmp(pre[i], pre[i - 1]);\n }\n for (int i = (int)g[u].size() - 1; i >= 0; i--) {\n suf[i] = dp[g[u][i]];\n if (i < g[u].size() - 1) suf[i] = cmp(suf[i], suf[i + 1]);\n }\n for (int i = 0; i < (int)g[u].size(); i++) {\n pair<int, int> tmp = dp2[u];\n if (i) tmp = cmp(tmp, pre[i - 1]);\n if (i < g[u].size() - 1) tmp = cmp(tmp, suf[i + 1]);\n// debug(u, g[u][i], tmp);\n if (tmp.second < b) tmp = {tmp.first, tmp.second + 1};\n else tmp.first++, tmp.second = 1;\n// dp2[g[u][i]] = tmp;\n// if (tmp.second < b)\n dp2[g[u][i]] = tmp;\n }\n for (int v : g[u]) dfs2(v, u);\n}\n\nint main() {\n #define NAME \"\"\n if (fopen(NAME\".inp\", \"r\")) {\n freopen(NAME\".inp\", \"r\", stdin);\n freopen(NAME\".out\", \"w\", stdout);\n }\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n int cur = 0;\n while (cin >> n >> b) {\n if (n == 0 && b == 0) return 0;\n cout << \"Case \" << ++cur << \":\\n\";\n if (n == 1) {\n cout << 1 << '\\n';\n continue;\n }\n for (int i = 1; i < n; i++) {\n int p;\n cin >> p;\n g[p].emplace_back(i + 1);\n// g[i + 1].emplace_back(p);\n }\n dp2[1] = {1, 0};\n dfs(1);\n dfs2(1, 1);\n// debug(dp[1], dp[2], dp[3], dp2[2]);\n for (int i = 1; i <= n; i++) {\n cout << ans[i].first << '\\n';\n }\n for (int i = 1; i <= n; i++) g[i].clear(), ans[i] = dp[i] = dp2[i] = suf[i] = pre[i] = {0, 0};\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":20592,"score_of_the_acc":-0.1142,"final_rank":5},{"submission_id":"aoj_2398_10771286","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 FORD(i, a, b) for(int i = (a); i >= (b); --i)\n#define REP(i, a) for(int i = 0; i < (a); ++i)\n#define sz(a) (int)(a).size()\n#define all(a) (a).begin(), (a).end()\n#define bit(s, i) (((s) >> (i)) & 1)\n#define ii pair <int, int>\n#define fi first\n#define se second\n#define ll long long\n#define eb emplace_back\n#define pb push_back\n#define __builtin_popcount __builtin_popcountll\n\ntemplate <class X, class Y>\n bool maxi(X &x, Y y) {\n if(x < y) {\n x = y;\n return true;\n }\n return false;\n }\n\ntemplate <class X, class Y>\n bool mini(X &x, Y y) {\n if(x > y) {\n x = y;\n return true;\n }\n return false;\n }\n\nconst int N=1e5+5;\n\nint n,b,ans[N]; ii dp[N],p[N],s[N],out[N];\nvector<int> adj[N];\n\nii cmb(ii x, ii y){\n if(x.fi>y.fi) return x;\n if(x.fi<y.fi) return y;\n return {x.fi,x.se+y.se};\n}\n\nvoid dfs(int u){\n ii tmp={1,0};\n for(int v:adj[u]){\n dfs(v);\n tmp=cmb(tmp,dp[v]);\n }\n if(tmp.se+1<=b) dp[u]={tmp.fi,tmp.se+1};\n else dp[u]={tmp.fi+1,1};\n}\n\nvoid dfs2(int u){\n ii hi=out[u];\n for(int v:adj[u]){\n hi=cmb(hi,dp[v]);\n }\n if(hi.se+1<=b) ans[u]=hi.fi;\n else ans[u]=hi.fi+1;\n\n FOR(i,0,sz(adj[u])-1){\n p[i]=dp[adj[u][i]];\n if(i>0) p[i]=cmb(p[i],p[i-1]);\n }\n FORD(i,sz(adj[u])-1,0){\n s[i]=dp[adj[u][i]];\n if(i<sz(adj[u])-1) s[i]=cmb(s[i],s[i+1]);\n }\n\n FOR(i,0,sz(adj[u])-1){\n ii tmp=out[u];\n if(i>0) tmp=cmb(tmp,p[i-1]);\n if(i<sz(adj[u])-1) tmp=cmb(tmp,s[i+1]);\n\n if(tmp.se+1<=b) tmp={tmp.fi,tmp.se+1};\n else tmp={tmp.fi+1,1};\n\n out[adj[u][i]]=tmp;\n }\n for(int v:adj[u]) dfs2(v);\n}\n\nvoid solve(){\n FOR(i,1,n) adj[i].clear();\n FOR(i,2,n){\n int p; cin>>p;\n adj[p].eb(i);\n }\n FOR(i,1,n) out[i]={1,0};\n\n dfs(1);\n dfs2(1);\n\n FOR(i,1,n) cout<<ans[i]<<'\\n';\n}\n\nint32_t main() {\n #define task \"test\"\n if(fopen(task\".inp\", \"r\")){\n freopen(task\".inp\", \"r\", stdin);\n freopen(task\".out\", \"w\", stdout);\n }\n cin.tie(0)->sync_with_stdio(0);\n\n int tc=0;\n while(cin>>n>>b){\n if(n==0&&b==0) return 0;\n cout<<\"Case \"<<(++tc)<<\":\\n\",solve();\n }\n}","accuracy":1,"time_ms":120,"memory_kb":20272,"score_of_the_acc":-0.1089,"final_rank":4},{"submission_id":"aoj_2398_9461744","code_snippet":"#if !defined(MYLOCAL)//提出時用テンプレート\n\n#pragma GCC optimize(\"Ofast\")\n#if defined(NDEBUG)\n#undef NDEBUG\n#endif\n#include \"bits/stdc++.h\"\n#if !defined(_MSC_VER) && __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing namespace std;\nusing ll=long long; using dd=double; \nusing vll=vector< ll>; using vdd=vector< dd>;\nusing vvll=vector< vll>; using vvdd=vector<vdd>;\nusing vvvll=vector< vvll>; using vvvdd=vector<vvdd>;\nusing vvvvll=vector<vvvll>;\nusing pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\nusing vvpll=vector<vpll>; using vvtll=vector<vtll>; using vvqll=vector<vqll>;\nusing namespace chrono;\nconstexpr ll INF = 1001001001001001001;\nstruct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;\n#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)\n#define REP(i, N) REPS(i, 0, (N)-1)\n#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)\n#define DEP(i, N) DEPS(i, 0, (N)-1)\n#define EXPAND( x ) x//VS用おまじない\n#define overload3(_1,_2,_3,name,...) name\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload5(_1,_2,_3,_4,_5,name,...) name\n#define rep3(i, S, E) for (ll i = (S); i <= (E); i++)\n#define rep4(i, S, E, t) for (ll i = (S); i <= (E); i+=(t))\n#define rep(...) EXPAND(overload4(__VA_ARGS__,rep4,rep3,_,_)(__VA_ARGS__))\n#define dep3(i, E, S) for (ll i = (E); i >= (S); i--)\n#define dep4(i, E, S, t) for (ll i = (E); i >= (S); i-=(t))\n#define dep(...) EXPAND(overload4(__VA_ARGS__, dep4, dep3,_,_)(__VA_ARGS__))\n#define each2(e,v) for (auto && e:v)\n#define each3(a,b,v) for (auto &&[a,b]:v)\n#define each4(a,b,c,v) for (auto &&[a,b,c]:v)\n#define each5(a,b,c,d,v) for (auto &&[a,b,c,d]:v)\n#define each(...) EXPAND(overload5(__VA_ARGS__,each5,each4,each3,each2,_)(__VA_ARGS__))\n#define ALL1(v) (v).begin(), (v).end()\n#define ALL2(v,E) (v).begin(), (v).begin()+((E)+1)\n#define ALL3(v,S,E) (v).begin()+(S), (v).begin()+((E)+1)\n#define ALL(...) EXPAND(overload3(__VA_ARGS__, ALL3, ALL2, ALL1)(__VA_ARGS__))\n#define all ALL\n#define RALL1(v) (v).rbegin(), (v).rend()\n#define RALL2(v,E) (v).rbegin(), (v).rbegin()+((E)+1)\n#define RALL3(v,S,E) (v).rbegin()+(S), (v).rbegin()+((E)+1)\n#define RALL(...) EXPAND(overload3(__VA_ARGS__, RALL3, RALL2, RALL1)(__VA_ARGS__))\n#define rall RALL\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; }\ntemplate<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }\ntemplate<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }\ntemplate<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }\ntemplate<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }\ntemplate<class T> inline auto maxe(T &&v,ll S,ll E){ return *max_element(ALL(v,S,E)); }\ntemplate<class T> inline auto maxe(T &&v){ return *max_element(ALL(v)); }\ntemplate<class T> inline auto mine(T &&v,ll S,ll E){ return *min_element(ALL(v,S,E)); }\ntemplate<class T> inline auto mine(T &&v){ return *min_element(ALL(v)); }\ntemplate<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }\ntemplate<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }\ntemplate<class T,class U=typename remove_reference<T>::type::value_type>\ninline U sum(T &&v,ll S,ll E) {return accumulate(all(v,S,E),U());}\ntemplate<class T> inline auto sum(T &&v) {return sum(v,0,v.end()-v.begin()-1);}\ntemplate<class T> inline ll sz(T &&v){ return (ll)v.size(); }\ninline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; } //負もOK\ninline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); } //負もOK\n\n//pair用テンプレート\ntemplate<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a,const pair<T,S> &b){ pair<T,S> c=a; return c-=b; }\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }\ntemplate<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }\n\n//tuple用テンプレート 出力用のみ\ntemplate<class T,class S,class R> inline ostream &operator<<(ostream &os,const tuple<T,S,R> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a); }\ntemplate<class T,class S,class R,class Q> inline ostream &operator<<(ostream &os,const tuple<T,S,R,Q> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a) << ' ' << get<3>(a); }\n\n//vector用テンプレート\ntemplate<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?\" \":\"\")<<a[i]; return os; }\n\n//array用テンプレート\ntemplate<class T,size_t S> inline array<T,S>& operator+=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]+=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator-=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]-=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator*=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]*=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator/=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]/=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator%=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]%=b[i]; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator+=(array<T,S> &a,R b){ for (T &e: a) e+=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator-=(array<T,S> &a,R b){ for (T &e: a) e-=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator*=(array<T,S> &a,R b){ for (T &e: a) e*=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator/=(array<T,S> &a,R b){ for (T &e: a) e/=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator%=(array<T,S> &a,R b){ for (T &e: a) e%=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator+(const array<T,S> &a,R b){ array<T,S> c=a; return c+=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(const array<T,S> &a,R b){ array<T,S> c=a; return c-=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator*(const array<T,S> &a,R b){ array<T,S> c=a; return c*=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator/(const array<T,S> &a,R b){ array<T,S> c=a; return c/=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator%(const array<T,S> &a,R b){ array<T,S> c=a; return c%=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(R b,const array<T,S> &a){ array<T,S> c=-a; return c+=b; }\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a,const array<T,S> &b){ array<T,S> c=a; return c-=b; }\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a){ array<T,S> c=a; return c*=(-1); }\ntemplate<class T,size_t S> inline ostream &operator<<(ostream &os,const array<T,S> &a){ for (ll i=0; i<(ll)S; i++) os<<(i>0?\" \":\"\")<<a[i]; return os; }\n\n\n#endif//テンプレートend\n\n#if defined(_MSC_VER) && __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#if defined(_MSC_VER)\n#pragma warning( disable : 4996 )\n#endif\nstruct{\n\tsystem_clock::time_point st = system_clock::now();\n\tll operator()()const{return duration_cast<microseconds>(system_clock::now()-st).count()/1000;}\n} timeget;\n//////////////////////////////////////////\n\nstruct cinutil{\n\ttemplate<class T> static void cin1core(T &a){ cin>>a; }\n\ttemplate<class T,class S> static void cin1core(pair<T,S> &a){\n\t\tcin1core(a.first), cin1core(a.second);\n\t}\n\ttemplate<class... Args> static void cin1core(tuple<Args...> &a){\n\t\tcinTplRec<tuple<Args...>,sizeof...(Args)-1>()(a);\n\t}\nprivate:\n\ttemplate<class Tpl,int i> struct cinTplRec{\n\t\tvoid operator()(Tpl &a){ cinTplRec<Tpl,i-1>()(a); cin1core(get<i>(a)); }\n\t};\n\ttemplate<class Tpl> struct cinTplRec<Tpl,0>{\n\t\tvoid operator()(Tpl &a){ cin1core(get<0>(a)); }\n\t};\n};\ntemplate<class T> T cin1(){ T a; cinutil::cin1core(a); return a; }\ntemplate<class... Args> tuple<Args...> cins(){ return cin1<tuple<Args...>>(); }\n\n\ntemplate<long long MOD> struct mll_{\n\tusing Int = long long;\n\tusing ll = long long;\n\tll val_=0;\n\t/*---- utility ----*/\n\tmll_ &norm(){ return normR().normS(); }//正規化\n\tmll_ &normR(){ val_%=MOD; return *this; }//剰余正規化のみ\n\tmll_ &normS(){ if (val_<0) val_+=MOD; return *this; }//正負正規化のみ\n\tmll_ &normP(){ if (val_>=MOD) val_-=MOD; return *this; }//加算時正規化\n\tmll_ &invsg(){ val_=-val_; return normS(); }//正負反転\n\tll modinv(int a){//a^-1 mod MOD\n\t\tint ypre=0,y=1,apre=MOD;\n\t\twhile (a>1){\n\t\t\tint t=apre/a;\n\t\t\tapre-=a*t,swap(a,apre);\n\t\t\typre-=y*t,swap(y,ypre);\n\t\t}\n\t\treturn y<0 ? y+MOD: y;\n\t}\n\t/*---- I/F ----*/\n\tmll_(){}\n\tmll_(ll v): val_(v){ norm(); }\n\tmll_(ll v,bool b): val_(v){} //正規化無のコンストラクタ\n\tInt val()const{ return (Int)val_; }\n\tbool isnone() const { return val_==-1; } //true:値なし\n\tmll_ &none() { val_=-1; return *this; } //値なしにする\n\tmll_ &inv(){ val_=modinv((int)val_); return *this; }\n\tmll_ &operator+=(mll_ b){ val_+=b.val_; return normP(); }\n\tmll_ &operator-=(mll_ b){ val_-=b.val_; return normS(); }\n\tmll_ &operator*=(mll_ b){ val_*=b.val_; return normR(); }\n\tmll_ &operator/=(mll_ b){ return *this*=b.inv(); }\n\tmll_ &operator+=(ll b){ return *this+=mll_(b); }\n\tmll_ &operator-=(ll b){ return *this-=mll_(b); }\n\tmll_ &operator*=(ll b){ return *this*=mll_(b); }\n\tmll_ &operator/=(ll b){ return *this/=mll_(b); }\n\tmll_ operator-()const{ return mll_(*this).invsg(); }\n\tmll_ operator+(mll_ b)const{ return mll_(*this)+=b; }\n\tmll_ operator-(mll_ b)const{ return mll_(*this)-=b; }\n\tmll_ operator*(mll_ b)const{ return mll_(*this)*=b; }\n\tmll_ operator/(mll_ b)const{ return mll_(*this)/=b; }\n\tmll_ operator+(ll b)const{ return mll_(*this)+=b; }\n\tmll_ operator-(ll b)const{ return mll_(*this)-=b; }\n\tmll_ operator*(ll b)const{ return mll_(*this)*=b; }\n\tmll_ operator/(ll b)const{ return mll_(*this)/=b; }\n\tfriend mll_ operator+(ll a,mll_ b){ return b+a; }\n\tfriend mll_ operator-(ll a,mll_ b){ return -b+a; }\n\tfriend mll_ operator*(ll a,mll_ b){ return b*a; }\n\tfriend mll_ operator/(ll a,mll_ b){ return mll_(a)/b; }\n\tbool operator==(mll_ b)const{ return val_==b.val_; }\n\tbool operator!=(mll_ b)const{ return val_!=b.val_; }\n\tbool operator==(ll b)const{ return *this==mll_(b); }\n\tbool operator!=(ll b)const{ return *this!=mll_(b); }\n\tfriend bool operator==(ll a,mll_ b){ return mll_(a)==b; }\n\tfriend bool operator!=(ll a,mll_ b){ return mll_(a)!=b; }\n\tfriend ostream &operator<<(ostream &os,mll_ a){ return os << a.val_; }\n\tfriend istream &operator>>(istream &is,mll_ &a){ return is >> a.val_; }\n\tmll_ pow(ll k)const{\n\t\tmll_ ret(1,false),a(*this);\n\t\tfor (; k>0; k>>=1,a*=a) if (k&1)ret*=a;\n\t\treturn ret;\n\t}\n\tstatic constexpr int mod() { return MOD; }\n\t//enum{ modll=MOD };\n};\n#if 0\n#define MODLL (1000000007LL)\n#else\n#define MODLL (998244353LL)\n#endif\nusing mll = mll_<MODLL>;\n//using mll = fraction;\nusing vmll = std::vector<mll>;\nusing vvmll = std::vector<vmll>;\nusing vvvmll = std::vector<vvmll>;\nusing vvvvmll = std::vector<vvvmll>;\n\n\ntemplate<class T> struct Vector: vector<T>{\n\tusing Int = long long;\n\tusing vT=vector<T>;\n\tusing cvT=const vector<T>;\n\tusing cT=const T;\n\tusing vT::vT; //親クラスのコンストラクタの隠蔽を回避\n\tusing vT::begin,vT::end,vT::insert,vT::erase;\n\tauto it(Int i){ return begin()+i; }\n\tauto it(Int i)const{ return begin()+i; }\n\tVector(cvT& b):vT(b){}\n\tVector(vT&& b):vT(move(b)){}\n\ttemplate<class S> Vector(const Vector<S>& b):vT(b.begin(),b.end()){}\n\ttemplate<class S> Vector(const vector<S>& b):vT(b.begin(),b.end()){}\n\tVector(Int n,T s,T d){ iota(n,s,d); }\n\tVector(Int n,function<T(Int)> g):vT(n){ for (Int i=0;i<n;++i) (*this)[i]=g(i); }\n\ttemplate<class S> Vector &operator+=(S x){ for (T &e: *this) e+=x; return *this; }\n\ttemplate<class S> Vector &operator-=(S x){ for (T &e: *this) e-=x; return *this; }\n\ttemplate<class S> Vector &operator*=(S x){ for (T &e: *this) e*=x; return *this; }\n\ttemplate<class S> Vector &operator/=(S x){ for (T &e: *this) e/=x; return *this; }\n\ttemplate<class S> Vector &operator%=(S x){ for (T &e: *this) e%=x; return *this; }\n\ttemplate<class S> Vector operator+(S x)const{ return Vector(*this)+=x; }\n\ttemplate<class S> Vector operator-(S x)const{ return Vector(*this)-=x; }\n\ttemplate<class S> Vector operator*(S x)const{ return Vector(*this)*=x; }\n\ttemplate<class S> Vector operator/(S x)const{ return Vector(*this)/=x; }\n\ttemplate<class S> Vector operator%(S x)const{ return Vector(*this)%=x; }\n\tVector operator-()const{ return Vector(*this)*=-1; }\n\ttemplate<class S> friend Vector operator-(S x,const Vector &a){ return -a+=x; }\n\tInt size()const{ return (Int)vT::size(); }\n\tVector &push_back(cT& x){ vT::push_back(x); return *this; }\n\tVector &pop_back(){ vT::pop_back(); return *this; }\n\tVector &push_front(cT& x){ insert(begin(),x); return *this; }\n\tVector &pop_front(){ erase(0); return *this; }\n\tVector &insert(Int i,cT& x){ insert(it(i),x); return *this; }\n\tVector &insert(Int i,cvT& b){ insert(it(i),b.begin(),b.end()); return *this; }\n\tVector &erase(Int i){ erase(it(i)); return *this; }\n\tVector &erase(Int l,Int r){ erase(it(l),it(r+1)); return *this; }\n\tVector &concat(cvT &b){ insert(end(),b.begin(),b.end()); return *this; }\n\tVector &concat(cvT &b,Int n){ for (int i=0;i<n;++i) concat(b); return *this; }\n\tVector &repeat(Int n){ concat(vT(*this),n-1); return *this; }\n\tVector &reverse(){ std::reverse(begin(),end()); return *this; }\n\tVector &sort(){ std::sort(begin(),end()); return *this; }\n\tVector &rsort(){ std::sort(vT::rbegin(),vT::rend()); return *this; }\n\ttemplate<class Pr> Vector &sort(Pr pr){ std::sort(begin(),end(),pr); return *this; }\n\tVector &uniq(){ erase(unique(begin(),end()),end()); return *this; }\n\tVector &sortq(){ return sort().uniq(); }\n\tVector &fill(Int l,Int r,cT& x){ std::fill(it(l),it(r+1),x); return *this; }\n\ttemplate<class S=Int> Vector &iota(Int n,T s=0,S d=1){\n\t\tvT::resize(n);\n\t\tif (n==0) return *this;\n\t\t(*this)[0]=s;\n\t\tfor (int i=1;i<n;++i) (*this)[i]=(*this)[i-1]+d;\n\t\treturn *this;\n\t}\n\tInt count(cT& x)const{ return Int(std::count(begin(),end(),x)); }\n\tInt count(Int l,Int r,cT& x)const{ return Int(std::count(it(l),it(r+1),x)); }\n\ttemplate<class Pr> Int countif(Pr pr)const{ return Int(count_if(begin(),end(),pr)); }\n\ttemplate<class Pr> Int countif(Int l,Int r,Pr pr)const{ return Int(count_if(it(l),it(r+1),pr)); }\n\tInt find(cT& x)const{ return Int(std::find(begin(),end(),x)-begin()); }\n\tInt find(Int l,Int r,cT& x)const{ return Int(std::find(it(l),it(r+1),x)-begin()); }\n\ttemplate<class Pr> Int findif(Pr pr)const{ return Int(find_if(begin(),end(),pr)-begin()); }\n\ttemplate<class Pr> Int findif(Int l,Int r,Pr pr)const{ return Int(find_if(it(l),it(r+1),pr)-begin()); }\n\tVector<Int> findall(cT& x)const{ return findall(0,size()-1,x); }\n\tVector<Int> findall(Int l,Int r,cT& x)const{ return findallif(l,r,[&](cT& y){return y==x;}); }\n\ttemplate<class Pr> Vector<Int> findallif(Pr pr)const{ return findallif(0,size()-1,pr); }\n\ttemplate<class Pr> Vector<Int> findallif(Int l,Int r,Pr pr)const{\n\t\tVector<Int> ret;\n\t\tfor (Int i=l;i<=r;++i) if (pr((*this)[i])) ret.push_back(i);\n\t\treturn ret;\n\t}\n\tInt flooridx(cT& x)const{ return Int(upper_bound(begin(),end(),x)-begin()-1); }\n\tInt ceilidx(cT& x)const{ return Int(lower_bound(begin(),end(),x)-begin()); }\n\tInt leftnmof(cT& x)const{ return flooridx(x)+1; }\n\tInt rightnmof(cT& x)const{ return size()-ceilidx(x); }\n\tbool contains(cT& x)const{ Int i=flooridx(x); return i>=0 && (*this)[i]==x; }\n\ttemplate<class Pr> Int flooridx(cT& x,Pr pr)const{ return Int(upper_bound(begin(),end(),x,pr)-begin()-1); }\n\ttemplate<class Pr> Int ceilidx(cT& x,Pr pr)const{ return Int(lower_bound(begin(),end(),x,pr)-begin()); }\n\ttemplate<class Pr> Int leftnmof(cT& x,Pr pr)const{ return flooridx(x,pr)+1; }\n\ttemplate<class Pr> Int rightnmof(cT& x,Pr pr)const{ return size()-ceilidx(x,pr); }\n\ttemplate<class Pr> bool contains(cT& x,Pr pr)const{ Int i=flooridx(x,pr); return i>=0 && (*this)[i]==x; }\n};\n/*\nvll a={9,8,7},b={1,2,3};\nvpll p={{5,3},{7,8},{0,2},};\n- -------- 操作系 --------\na+=x a-=x a*=x a/=x a%=x a+x a-x a*x a/x a%x -a x-a //∀i a[i]にxを演算\na.push_front(x);\na.push_back(x);\na.pop_front();\na.pop_back();\na.insert(i,x); //a[i]にx挿入\na.insert(i,b); //a[i]にvll b挿入\na.erase(i); //a[i]削除\na.erase(l,r); //区間[l,r]削除\na.concat(b); //aにbを結合\na.concat(b,n); //aにbをn回結合\na.repeat(n); //aをn回繰り返す\na.reverse(); //反転\na.sort(); //ソート\na.rsort(); //逆順ソート\np.sort([&](pll x,pll y){return x.second<y.second;});//比較関数指定ソート\na.uniq(); //連続同値を1つにする\na.sortq(); //ソートしてユニーク\na.fill(l,r,x); //[l,r]にx代入\na.iota(n,s,d); //aを等差数列にする 長さn,初項s,公差d\nvll a(n,s,d); //コンストラクタ版iota\n- -------- 検索系 --------\nauto pr=[&](auto &x){ return x>0; }; //検索条件\nll m=a.count(x); //xの個数\nll m=a.count(l,r,x); //xの個数in[l,r]\nll m=a.countif(pr); //条件満たす個数\nll m=a.countif(l,r,pr); //条件満たす個数in[l,r]\nll i=a.find(x); //xの最左位置i ない時N(配列長)\nll i=a.find(l,r,x); //xの最左位置i in[l,r] ない時r+1\nll i=a.findif(pr); //条件満たす最左位置i ない時N(配列長)\nll i=a.findif(l,r,pr); //条件満たす最左位置i in[l,r] ない時r+1\nvll is=a.findall(x); //xの位置i列挙\nvll is=a.findall(l,r,x); //xの位置i列挙in[l,r]\nvll is=a.findallif(pr); //条件満たす位置i列挙\nvll is=a.findallif(l,r,pr); //条件満たす位置i列挙in[l,r]\n- -------- 昇順sort済み配列用 --------\nll i=a.flooridx(x); //x以下の最近傍位置i ない時-1\nll i=a.ceilidx(x); //x以上の最近傍位置i ない時N(配列長)\nll m=a.leftnmof(x); //x以下の個数\nll m=a.rightnmof(x); //x以上の個数\nbool b=a.contains(x); //xを含む\n- -------- 比較関数prでsort済みの配列用 --------\nauto pr=[&](auto &x,auto &y){ return x>y; }; //降順ソート時\nll i=a.flooridx(x,pr); //x以左の最近傍位置i ない時-1\nll i=a.ceilidx(x,pr); //x以右の最近傍位置i ない時N(配列長)\nll m=a.leftnmof(x,pr); //x以左の個数\nll m=a.rightnmof(x,pr); //x以右の個数\nbool b=a.contains(x,pr); //xを含む\n\na.concat(b,n).pop_back().rsort().uniq(); //連続適用できる\n*/\n\n\nnamespace SolvingSpace{\n\ntemplate<class T> using vector = Vector<T>;\nusing vll=vector< ll>; using vmll=vector< mll>; using vdd=vector< dd>;\nusing vvll=vector< vll>; using vvmll=vector< vmll>; using vvdd=vector< vdd>;\nusing vvvll=vector< vvll>; using vvvmll=vector< vvmll>; using vvvdd=vector<vvdd>;\nusing vvvvll=vector<vvvll>; using vvvvmll=vector<vvvmll>;\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\nusing vvpll=vector< vpll>; using vvtll=vector< vtll>; using vvqll=vector<vqll>;\nusing vss=vector<string>;\ntemplate<class T> vector<T> cinv(ll nm){ return vector<T>(nm,[](ll i){ (void)i; return cin1<T>(); }); }\ntemplate<class T> vector<vector<T>> cinvv(ll H,ll W){ return vector<vector<T>>(H,[&](ll i){ (void)i; return cinv<T>(W); }); }\n\n\n\ntemplate<class Edge,class VAL,class Adde,class Ope,class Addv,class Ini>\nstruct rerootingDP{\n using Int = long long;\n using ll = long long;\n vector<vector<Edge>> *pto=nullptr;\n Adde fe;\n Ope merge;\n Addv fv;\n Ini ini; //ini(v):DPの初期値(葉の値)\n vector<ll> parent;//parent[v]:vの親 dfs1実行時セットされる\n vector<vector<VAL>> dp; //dp[0][v]:親→v辺の値 dp[1][v]:v→親辺の値\n //dp[2][v]:根=vでのvの値\n ll root;\n rerootingDP(VAL,vector<vector<Edge>> &to,\n Adde fe_,Ope merge_,Addv fv_,Ini ini_,Int root_=0)\n :pto(&to),fe(fe_),merge(merge_),fv(fv_),ini(ini_),parent(to.size(),-1),\n dp(3,vector<VAL>(to.size())),root(root_)\n {\n dfs1(root);\n dfs2(root);\n }\n vector<VAL> &reroot(){ return dp[2]; }\n const VAL &subtree(Int u,Int v){//有向辺u→vに対応するサブ木の値\n return parent[v]==u ? dp[0][v] : dp[1][u];\n }\nprivate:\n bool isleaf(ll v){ return (*pto)[v].size() - (v!=root) == 0; }\n void dfs1(ll v,ll p=-1){\n parent[v]=p;\n if(isleaf(v)){\n dp[0][v]=ini(v);\n return;\n }\n for(ll u : (*pto)[v]) if(u!=p) dfs1(u,v);\n bool isFirst=true;\n VAL val=VAL();\n for(const Edge &eg: (*pto)[v]){\n ll u=(ll)eg;\n if(u==p) continue;\n VAL valb=fe(dp[0][u],v,eg);\n if(isFirst) val=valb,isFirst=false;\n else val=merge(val,valb);\n }\n dp[0][v]=fv(val,v);\n }\n void dfs2(ll v,ll p=-1){\n ll M=(ll)(*pto)[v].size(); //vの隣接頂点数\n //-- vの隣接頂点にfe適用\n vector<VAL> tmp;\n for(const Edge &eg: (*pto)[v]){\n ll u=(ll)eg;\n tmp.push_back(fe(u==p?dp[1][v]:dp[0][u],v,eg));\n }\n //-- 左右累積配列作成\n vector<VAL> cml=tmp,cmr=tmp;\n for(ll i=1;i<M;++i) cml[i]=merge(cml[i-1],cml[i]); //左\n for(ll i=M-2;i>=0;--i) cmr[i]=merge(cmr[i],cmr[i+1]); //右\n\n //-- dp[2][v]計算\n if(M>0) dp[2][v]=fv(cml[M-1],v);\n else dp[2][v]=ini(v);\n\n //-- dp[1][u]計算\n if(v==root && M==1){ //根が葉(次数1)の時は初期値\n ll u=(*pto)[v][0];\n dp[1][u]=ini(v);\n }\n else{\n for(ll i=0;i<M;++i){\n ll u=(*pto)[v][i];\n if(u==p) continue;\n //以下、子があるときしか来ない 必ずM>=2\n if(i==0) dp[1][u]=fv(cmr[i+1],v);\n else if(i==M-1) dp[1][u]=fv(cml[i-1],v);\n else dp[1][u]=fv(merge(cml[i-1],cmr[i+1]),v);\n }\n }\n //-- 子を再帰処理\n for(ll u : (*pto)[v]) if(u!=p) dfs2(u,v);\n }\n};\n\n\nvoid cin2solve()\n{\n rep(t,1,INF-1){\n auto [N,B]=cins<ll,ll>();\n if (N==0 and B==0) break;\n vll P;\n rep(i,0,N-1-1){ ll P__; cin>>P__; P.push_back(P__-1); }\n\n auto makeRootedTree=[](ll n,vll &p){\n vvll to(n);\n rep(v,1,n-1){\n to[v].push_back(p[v-1]);\n to[p[v-1]].push_back(v);\n }\n return to;\n };\n vvll to=makeRootedTree(N,P);\n\n using VAL=pll;\n using Edge=ll; //グラフの辺の種類 通常の木ならll\n auto fe=[&](const VAL &x,ll v,const Edge &eg){ return x; };\n auto merge=[&](const VAL &x,const VAL &y)->VAL{\n auto [Bx,rx]=x;\n auto [By,ry]=y;\n if(Bx>By) swap(Bx,By),swap(rx,ry);\n if(Bx==By) return {Bx,rx+ry};\n else return {By,ry};\n };\n auto fv=[&](const VAL &x,ll v)->VAL{\n auto [Bx,rx]=x;\n rx++;\n if(rx<B) return {Bx,rx};\n else{\n rx=min(rx-B,1ll);\n return {Bx+1,rx};\n }\n };\n auto ini=[&](ll v)->VAL{\n ll Bx=1/B;\n ll r=1%B;\n return {Bx,r};\n };\n rerootingDP rdp(VAL(),to,fe,merge,fv,ini);\n\n vector<VAL> vals=rdp.reroot();\n\n cout << \"Case \"<<t<<\":\" << '\\n';\n for(auto&& e: vals) cout << e.first+(e.second>0) << '\\n';\n }\n\n\treturn;\n}\n\n};//SolvingSpace\n\n//////////////////////////////////////////\n\nint main(){\n\t#if 1\n\t//SolvingSpace::labo();\n\tSolvingSpace::cin2solve();\n\t//SolvingSpace::generand();\n\t#else\n\tll t; cin >> t;\n\trep(i,0,t-1){\n\t\tSolvingSpace::cin2solve();\n\t\t//SolvingSpace::generand();\n\t} \n\t#endif\n\t//cerr << timeget() <<\"ms\"<< '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":300,"memory_kb":47820,"score_of_the_acc":-0.6744,"final_rank":11},{"submission_id":"aoj_2398_6811274","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=100005,INF=1<<30;\n\nvector<int> G[MAX];\npair<int,int> dp[MAX];\nint N,B;\nint ans[MAX];\n\nvoid pre(int u,int p){\n int ma=-1,sum=0;\n for(int to:G[u]){\n if(to==p) continue;\n pre(to,u);\n if(ma<dp[to].fi){\n ma=dp[to].fi;\n sum=dp[to].se;\n }else if(ma==dp[to].fi){\n sum+=dp[to].se;\n }\n }\n if(ma==-1){\n dp[u]=mp(1,1);\n }else{\n if(sum+1<=B){\n dp[u]=mp(ma,sum+1);\n }else{\n dp[u]=mp(ma+1,1);\n }\n }\n}\n\nvoid solve(int u,int p){\n vector<pair<int,int>> dat,L,R;\n for(int to:G[u]){\n dat.push_back(dp[to]);\n }\n \n L=dat;R=dat;\n for(int i=1;i<si(L);i++){\n if(L[i].fi>L[i-1].fi){\n \n }else if(L[i].fi==L[i-1].fi){\n L[i].se+=L[i-1].se;\n }else{\n L[i]=L[i-1];\n }\n }\n \n for(int i=si(R)-2;i>=0;i--){\n if(R[i].fi>R[i+1].fi){\n \n }else if(R[i].fi==R[i+1].fi){\n R[i].se+=R[i+1].se;\n }else{\n R[i]=R[i+1];\n }\n }\n \n if(L.back().se+1<=B){\n dp[u]=mp(L.back().fi,L.back().se+1);\n }else{\n dp[u]=mp(L.back().fi+1,1);\n }\n \n ans[u]=dp[u].fi;\n \n //cout<<u<<endl;\n //for(int t=0;t<si(L);t++) cout<<L[t].fi<<\" \"<<L[t].se<<endl;\n \n for(int q=0;q<si(G[u]);q++){\n if(G[u][q]==p) continue;\n int to=G[u][q];\n \n auto savu=dp[u],savto=dp[to];\n \n int ma=-1,sum=0;\n if(q){\n ma=L[q-1].fi;\n sum=L[q-1].se;\n }\n if(q+1<si(R)){\n if(ma<R[q+1].fi){\n ma=R[q+1].fi;\n sum=R[q+1].se;\n }else if(ma==R[q+1].fi){\n sum+=R[q+1].se;\n }\n }\n \n if(ma==-1){\n dp[u]=mp(1,1);\n }else{\n if(sum+1<=B){\n dp[u]=mp(ma,sum+1);\n }else{\n dp[u]=mp(ma+1,1);\n }\n }\n \n solve(to,u);\n \n dp[u]=savu;\n dp[to]=savto;\n }\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int T=1;\n while(1){\n cin>>N>>B;\n if(N==0) break;\n cout<<\"Case \"<<T<<\":\\n\";T++;\n \n if(N==1){\n cout<<1<<\"\\n\";\n continue;\n }\n for(int i=0;i<N;i++){\n G[i].clear();\n dp[i]=mp(INF,INF);\n }\n for(int i=0;i<N-1;i++){\n int p;cin>>p;p--;\n G[p].push_back(i+1);\n G[i+1].push_back(p);\n }\n pre(0,-1);\n solve(0,-1);\n for(int i=0;i<N;i++) cout<<ans[i]<<\"\\n\";\n }\n}","accuracy":1,"time_ms":210,"memory_kb":36652,"score_of_the_acc":-0.4347,"final_rank":7},{"submission_id":"aoj_2398_6730426","code_snippet":"#line 1 \"g.cpp\"\n/*\tauthor: Kite_kuma\n\tcreated: 2022.06.18 08:53:34 */\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) {\n\t\t\treturn a.first > b.first;\n\t\t};\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] == -1 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/rerooting.hpp\"\n\ntemplate <class result_type, class cost_type,\n\t\t result_type (*e)(),\t\t\t\t\t\t\t\t\t\t // identity element of monoid\n\t\t result_type (*merge)(result_type, result_type, int),\t\t // left_result, right_result, parent_id\n\t\t result_type (*send)(result_type, int, int, int, cost_type) // child_res, child_id, parent_id, edge_id, edge_cost\n\t\t >\nstd::vector<result_type> rerooting(const graph<cost_type>& tr) {\n\tstd::vector<std::vector<result_type>> child_results(tr.size());\n\tstd::vector<result_type> ret(tr.size(), e());\n\tconst int root = 0;\n\n\tauto tree_dp = [&tr, &child_results](auto self, const int& now, const int& par) -> result_type {\n\t\tresult_type res = e();\n\t\tchild_results[now].resize(tr[now].size(), e());\n\t\tfor(int i = 0; i < int(tr[now].size()); i++) {\n\t\t\tconst typename graph<cost_type>::edge& ed = tr[now][i];\n\t\t\tif(ed.to == par) continue;\n\t\t\tchild_results[now][i] = send(self(self, ed.to, now), ed.to, now, ed.id, ed.cost);\n\t\t\tres = merge(res, child_results[now][i], now);\n\t\t}\n\t\treturn res;\n\t};\n\ttree_dp(tree_dp, root, -1);\n\n\tauto rerooting_internal = [&tr, &child_results, &ret](auto self, const int& now, const int& par, const result_type& ans_par) -> void {\n\t\tstd::vector<result_type>& child_result = child_results[now];\n\t\tconst int children_count = int(child_result.size());\n\t\tstd::vector<result_type> cumulated_result_front(children_count + 1), cumulated_result_back(children_count + 1);\n\t\tcumulated_result_front.front() = cumulated_result_back.back() = e();\n\t\tfor(int i = 0; i < children_count; i++)\n\t\t\tif(tr[now][i].to == par) {\n\t\t\t\tchild_result[i] = ans_par;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tfor(int i = 0; i < children_count; i++) {\n\t\t\tcumulated_result_front[i + 1] = merge(cumulated_result_front[i], child_result[i], now);\n\t\t\tcumulated_result_back[children_count - i - 1] =\n\t\t\t\tmerge(cumulated_result_back[children_count - i], child_result[children_count - i - 1], now);\n\t\t}\n\t\tret[now] = cumulated_result_front.back();\n\t\tfor(int i = 0; i < children_count; i++) {\n\t\t\tconst typename graph<cost_type>::edge& ed = tr[now][i];\n\t\t\tif(ed.to != par)\n\t\t\t\tself(self, ed.to, now,\n\t\t\t\t\t send(merge(cumulated_result_front[i], cumulated_result_back[i + 1], now), now, ed.to, ed.id, ed.cost));\n\t\t}\n\t\treturn;\n\t};\n\trerooting_internal(rerooting_internal, root, -1, e());\n\n\treturn ret;\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 6 \"g.cpp\"\n\n// struct res_type {\n// \tint max_cost, size;\n// \tres_type(int m, int s) {\n// \t\tmax_cost = m;\n// \t\tsize = s;\n// \t}\n// };\n\nusing res_type = pair<int, int>; // max_cost, size;\n\nres_type e() { return res_type(0, 0); }\n\nres_type merge(res_type a, res_type b, int par_id) {\n\tint max_cost = max(a.first, b.first);\n\tint size = 0;\n\tif(a.first == max_cost) size += a.second;\n\tif(b.first == max_cost) size += b.second;\n\treturn res_type(max_cost, size);\n}\n\nint blocksize_max;\n\nres_type send(res_type child_res, int child_id, int parent_id, int edge_id,\n\t\t\t int edge_cost) // child_res, child_id, parent_id, edge_id, edge_cost\n{\n\tint mc = child_res.first;\n\tint sz = (child_res.second + 1);\n\tif(sz > blocksize_max) {\n\t\tmc++;\n\t\tsz = 1;\n\t}\n\treturn res_type(mc, sz);\n}\n\nvoid solve(int n) {\n\t// INT(blocksize_max);\n\tcin >> blocksize_max;\n\tgraph<int> g(n);\n\trep(i, 1, n) {\n\t\tint p;\n\t\tcin >> p;\n\t\tg.add_edge(p - 1, i, 1, false, 0);\n\t}\n\n\tauto res = rerooting<res_type, int, e, merge, send>(g);\n\n\trep(root, n) {\n\t\tres_type ans = send(res[root], root, -1, -1, -1);\n\t\tprint(ans.first + 1);\n\t}\n\n\treturn;\n}\n\nint main() {\n\tint n;\n\tint casecount = 1;\n\twhile(cin >> n && n) {\n\t\t// cout << solve(n)<<'\\n';\n\t\t// print(\"Case \")\n\t\tcout << \"Case \" << casecount++ << \":\\n\";\n\t\tsolve(n);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":290,"memory_kb":38112,"score_of_the_acc":-0.5081,"final_rank":8},{"submission_id":"aoj_2398_6165500","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\nint k;\nconst int mn = 1 << 17;\nstruct edge {\n\tint to;\n};\nusing Data = P;\nvector<edge> G[mn];\nvector<int> ids[mn];\nvector<Data> memo[mn];\nint root;\n\n\nData dfs(int id, int fr) {\n\tData res;\n\t//\n\t//initialize\n\t//\n\tmap<int, int> mp;\n\tfor (edge e : G[id]) {\n\t\tif (e.to == fr)continue;\n\t\tData nex = dfs(e.to, id);\n\t\t//\n\t\t//update with edge\n\t\t//\n\t\tids[id].push_back(e.to);\n\t\tmemo[id].push_back(nex);\n\t\tmp[nex.first] += nex.second;\n\t}\n\t//\n\t//update for return\n\tif (mp.empty())return { 1,1 };\n\telse {\n\t\tP p = *--mp.end();\n\t\tif (p.second + 1 > k) {\n\t\t\treturn { p.first+1,1 };\n\t\t}\n\t\telse {\n\t\t\treturn { p.first,p.second+1 };\n\t\t}\n\t}\n\t//\n\treturn res;\n}\nint ans[mn];\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\tmap<int, int> mp;\n\tfor (Data d : v) {\n\t\tmp[d.first] += d.second;\n\t}\n\t//\n\t//calcurate id's ans\n\tif (mp.size()) {\n\t\tP p = *--mp.end();\n\t\tif (p.second + 1 <= k)ans[id] = p.first;\n\t\telse ans[id] = p.first + 1;\n\t}\n\telse {\n\t\tans[id] = 1;\n\t}\n\n\trep(i, ids[id].size()) {\n\t\tint to = ids[id][i];\n\t\tData d;\n\t\tmp[v[i].first] -= v[i].second;\n\t\tif (mp[v[i].first] == 0)mp.erase(v[i].first);\n\t\tif (mp.empty())d = { 1,1 };\n\t\telse {\n\t\t\tP p = *--mp.end();\n\t\t\tif (p.second + 1 > k) {\n\t\t\t\td = { p.first + 1,1 };\n\t\t\t}\n\t\t\telse {\n\t\t\t\td = { p.first,p.second + 1 };\n\t\t\t}\n\t\t}\n\t\t//\n\t\t//update for return\n\t\t//\n\t\tinvdfs(to, id, d);\n\n\t\tmp[v[i].first] += v[i].second;\n\t}\n}\nvoid yaru() {\n\tdfs(root, -1);\n\tinvdfs(root, -1, { 0,0 });\n}\n\n\nint tmp = 0;\nvoid outputx() {\n\tcout << \"Case \" << tmp << \":\\n\";\n}\nint n;\nvoid solve() {\n\ttmp++;\n\trep(i, n) {\n\t\tG[i].clear();\n\t\tids[i].clear();\n\t\tmemo[i].clear();\n\t}\n\trep1(i, n - 1) {\n\t\tint p; cin >> p; p--;\n\t\tG[p].push_back({ i });\n\t\tG[i].push_back({ p });\n\t}\n\tyaru();\n\toutputx();\n\trep(i, n)cout << ans[i] << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << 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\twhile (cin >> n >> k,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":59960,"score_of_the_acc":-0.85,"final_rank":12},{"submission_id":"aoj_2398_3531513","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\ntemplate<typename Data, typename T>\nstruct ReRooting{\n struct Node{\n Int to,rev;\n Data data;\n Node(Int to,Int rev,Data data):to(to),rev(rev),data(data){}\n };\n \n using F1 = function<T(T,T)>;\n using F2 = function<T(T,Data)>;\n \n vector<vector<Node> > G;\n vector<vector<T> > ld,rd;\n vector<Int> lp,rp;\n \n const F1 f1;\n const F2 f2;\n const T id;\n\n ReRooting(Int n,const F1 f1,const F2 f2,const T id):\n G(n),ld(n),rd(n),lp(n),rp(n),f1(f1),f2(f2),id(id){}\n\n void add_edge(Int u,Int v,Data d){\n G[u].emplace_back(v,(Int)G[v].size(),d);\n G[v].emplace_back(u,(Int)G[u].size()-1,d);\n }\n\n T dfs(Int v,Int p){\n while(lp[v]!=p&&lp[v]<(Int)G[v].size()){\n auto &e=G[v][lp[v]];\n ld[v][lp[v]+1]=f1(ld[v][lp[v]],f2(dfs(e.to,e.rev),e.data)); \n lp[v]++;\n }\n while(rp[v]!=p&&rp[v]>=0){\n auto &e=G[v][rp[v]];\n rd[v][rp[v]]=f1(rd[v][rp[v]+1],f2(dfs(e.to,e.rev),e.data));\n rp[v]--;\n }\n if(p<0) return rd[v][0];\n return f1(ld[v][p],rd[v][p+1]); \n }\n\n vector<T> build(){\n for(Int i=0;i<(Int)G.size();i++){\n ld[i].assign((Int)G[i].size()+1,id);\n rd[i].assign((Int)G[i].size()+1,id);\n lp[i]=0;\n rp[i]=(Int)G[i].size()-1; \n }\n vector<T> res;\n for(Int i=0;i<(Int)G.size();i++){\n res.emplace_back(dfs(i,-1));\n }\n return res;\n }\n};\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n,bs;\n Int uku=0;\n while(cin>>n>>bs,n){\n using P = pair<Int, Int>;\n auto f1=[&](P a,P b){\n if(a.first!=b.first) return max(a,b);\n return P(a.first,a.second+b.second);\n };\n auto f2=[&](P a,Int b){\n if(a.second+b<=bs) return P(a.first,a.second+b);\n return P(a.first+1,b);\n };\n P ti(0,0);\n ReRooting<Int, P> G(n,f1,f2,ti);\n for(Int i=1;i<n;i++){\n Int p;\n cin>>p;\n p--;\n G.add_edge(p,i,1);\n } \n auto ans=G.build();\n cout<<\"Case \"<<++uku<<\":\"<<endl;\n for(Int i=0;i<n;i++) cout<<f2(ans[i],1).first+1<<\"\\n\";\n cout<<flush;\n }\n return 0;\n}","accuracy":1,"time_ms":750,"memory_kb":74296,"score_of_the_acc":-1.3889,"final_rank":15},{"submission_id":"aoj_2398_3530504","code_snippet":"#include<iomanip>\n#include<limits>\n#include<thread>\n#include<utility>\n#include<iostream>\n#include<string>\n#include<algorithm>\n#include<set>\n#include<map>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<cmath>\n#include<numeric>\n#include<cassert>\n#include<random>\n#include<chrono>\n#include<unordered_set>\n#include<unordered_map>\n#include<fstream>\n#include<list>\n#include<functional>\n#include<bitset>\n#include<complex>\n#include<tuple>\nusing namespace std;\ntypedef unsigned long long int ull;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\ntypedef pair<int,int> pi;\ntypedef pair<double,double> pd;\ntypedef pair<double,ll> pdl;\n#define F first\n#define S second\nconst ll E=1e18+7;\nconst ll MOD=1000000007;\n\nconst ll MX=100000;\n\nvector<ll> cnt(MX);\nll n=0;\nll b;\nvector<vector<ll>> edge(MX);\nvector<pll> node(MX); //amari,takasa\nvector<ll> ans(MX);\n\nvoid init(){for(int i=0;i<n;i++){edge[i].clear(); cnt[i]=0;}}\n\nvoid dfs(ll w){\n ll mx=0;\n ll ch=1;\n for(auto &I:edge[w]){\n dfs(I);\n mx=max(mx,node[I].S);\n }\n for(auto &I:edge[w]){\n if(node[I].S==mx){ch+=node[I].F;}\n }\n if(ch>b){mx++; ch=1;}\n else if(ch==b){mx++; ch=0;}\n node[w]={ch,mx};\n}\n\nvoid dfs2(ll w,pll p){\n //cout<<w<<\" \"<<p.F<<\" \"<<p.S<<endl;\n pll mx1={p.S,-1},mx2={p.S,-1};\n for(auto &I:edge[w]){\n if(node[I].S>mx2.F){mx2={node[I].S,I};}\n if(mx2>mx1){swap(mx2,mx1);}\n }\n ll cnt1=1,cnt2=1;\n for(auto &I:edge[w]){\n if(node[I].S==mx1.F){cnt1+=node[I].F;}\n if(node[I].S==mx2.F){cnt2+=node[I].F;}\n }\n if(p.S==mx1.F){cnt1+=p.F;}\n if(p.S==mx2.F){cnt2+=p.F;}\n ans[w]=mx1.F+1;\n if(cnt1>b){ans[w]++;}\n \n for(auto &I:edge[w]){\n if(I==mx1.S){\n ll cnt=cnt2;\n ll high=mx2.F;\n if(node[I].S==mx2.F){cnt-=node[I].F;}\n if(cnt>b){high++; cnt=1;}\n else if(cnt==b){high++; cnt=0;}\n dfs2(I,{cnt,high});\n }\n else{\n ll cnt=cnt1;\n ll high=mx1.F;\n if(node[I].S==mx1.F){cnt-=node[I].F;}\n if(cnt>b){high++; cnt=1;}\n else if(cnt==b){high++; cnt=0;}\n dfs2(I,{cnt,high});\n }\n }\n}\n\n\nint main(){\n for(int C=1;;C++){\n init();\n cin>>n>>b;\n if(n==0){break;}\n cout<<\"Case \"<<C<<\":\"<<endl;\n for(int i=1;i<n;i++){\n ll p;\n cin>>p;\n p--;\n edge[p].push_back(i);\n }\n dfs(0);\n dfs2(0,{0,0});\n for(int i=0;i<n;i++){cout<<ans[i]<<endl;}\n //for(int i=0;i<n;i++){cout<<node[i].F<<\" \"<<node[i].S<<endl;}\n }\n \n return 0;\n}","accuracy":1,"time_ms":1360,"memory_kb":24412,"score_of_the_acc":-0.9426,"final_rank":13},{"submission_id":"aoj_2398_3236471","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\n\nstruct Node{\n\tint parent,depth,size;\n\tint child_max_depth,child_max_size,child_second_depth,child_second_size;\n};\n\nint num_case;\nint V,B;\nint root;\nint out_num[NUM];\nint ANS[NUM];\nbool visited[NUM];\nNode nodes[NUM];\nvector<int> G[NUM];\n\nvoid func(){\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tG[i].clear();\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\t\tnodes[i].parent = -1;\n\t\tout_num[i] = 0;\n\t}\n\n\tint from,to;\n\n\tfor(int loop = 1; loop <= V-1; loop++){\n\n\t\tscanf(\"%d\",&to);\n\t\tfrom = loop;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tvisited[i] = false;\n\t}\n\n\troot = 0;\n\tqueue<int> Q;\n\tint node_id,child;\n\n\tvisited[root] = true;\n\n\t//木構造を作る\n\tQ.push(root);\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\t\tchild = G[node_id][i];\n\t\t\tif(visited[child])continue;\n\n\t\t\tvisited[child] = true;\n\t\t\tnodes[child].parent = node_id;\n\t\t\tout_num[node_id]++;\n\n\t\t\tQ.push(child);\n\t\t}\n\t}\n\n\t/*★葉からボトムアップで、必要な情報を収集する★*/\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tif(out_num[i] == 0){ //葉\n\n\t\t\tQ.push(i);\n\t\t\t//printf(\"%dが葉\\n\",i);\n\t\t}\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tnodes[node_id].child_max_depth = 0; //子の中で最大の深さ\n\t\tnodes[node_id].child_max_size = 0; //最大の深さを持つ子の数\n\n\t\t//2番目に大きい値\n\t\tnodes[node_id].child_second_depth = 0;\n\t\tnodes[node_id].child_second_size = 0;\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\t\tchild = G[node_id][i];\n\t\t\tif(child == nodes[node_id].parent)continue;\n\n\t\t\tif(nodes[child].depth > nodes[node_id].child_max_depth){ //最大値更新\n\n\t\t\t\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\n\t\t\t\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\n\n\t\t\t\tnodes[node_id].child_max_depth = nodes[child].depth;\n\t\t\t\tnodes[node_id].child_max_size = nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth == nodes[node_id].child_max_depth){ //最大値と同点\n\n\t\t\t\tnodes[node_id].child_max_size += nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\n\n\t\t\t\tnodes[node_id].child_second_depth = nodes[child].depth;\n\t\t\t\tnodes[node_id].child_second_size = nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth == nodes[node_id].child_second_depth){ //2番目と同点\n\n\t\t\t\tnodes[node_id].child_second_size += nodes[child].size;\n\t\t\t}\n\t\t}\n\n\t\tif(nodes[node_id].child_max_depth == 0){ //子がいない場合\n\n\t\t\tnodes[node_id].depth = 1;\n\t\t\tnodes[node_id].size = 1;\n\n\t\t}else if(nodes[node_id].child_max_size+1 <= B){\n\n\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth;\n\t\t\tnodes[node_id].size = nodes[node_id].child_max_size+1;\n\n\t\t}else{ //nodes[node_id].child_max_size+1 > B\n\n\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\n\t\t\tnodes[node_id].size = 1;\n\t\t}\n\n\t\tif(nodes[node_id].parent == -1)continue;\n\n\t\tout_num[nodes[node_id].parent] -= 1;//親の出次数を1減らす\n\n\t\tif(out_num[nodes[node_id].parent] == 0){\n\n\t\t\tQ.push(nodes[node_id].parent);\n\t\t}\n\t}\n\n\n\tANS[root] = nodes[root].depth;\n\tfor(int i = 0; i < G[root].size(); i++){\n\t\tQ.push(G[root][i]);\n\t}\n\n\tint parent,parent_depth,parent_size;\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tparent = nodes[node_id].parent;\n\n\t\t//★親方向をnode_idの子の1つとして見なした場合★のコスト、およびサイズを場合分けして設定\n\n\t\tif(nodes[node_id].depth < nodes[parent].child_max_depth){ //node_idが非最大\n\n\t\t\t//node_idにとっては、parentが最大の深さを持つ子になる\n\t\t\tparent_size = nodes[parent].size;\n\t\t\tparent_depth = nodes[parent].depth;\n\n\t\t}else{ //node_idが最大\n\n\t\t\tif(nodes[parent].child_max_size == nodes[node_id].size){ //node_idが単独一位\n\n\t\t\t\t//親の、2番目の子を見る\n\t\t\t\tif(nodes[parent].child_second_depth == 0){ //2番目の子なし:親が葉になる\n\n\t\t\t\t\tparent_depth = 1;\n\t\t\t\t\tparent_size = 1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(nodes[parent].child_second_size+1 <= B){\n\n\t\t\t\t\t\tparent_depth = nodes[parent].child_second_depth;\n\t\t\t\t\t\tparent_size = nodes[parent].child_second_size+1;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tparent_depth = nodes[parent].child_second_depth+1;\n\t\t\t\t\t\tparent_size = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else{ //node_idと同点一位が1つ以上ある\n\n\t\t\t\tif(nodes[parent].child_max_size-nodes[node_id].size+1 <= B){\n\n\t\t\t\t\tparent_depth = nodes[parent].child_max_depth;\n\t\t\t\t\tparent_size = nodes[parent].child_max_size-nodes[node_id].size+1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tparent_depth = nodes[parent].child_max_depth+1;\n\t\t\t\t\tparent_size = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\t//ANSの設定<★depthとsizeを設定しなおす★>\n\t\tif(parent_depth > nodes[node_id].child_max_depth){ //親方向のコストが最大\n\n\t\t\tif(parent_size+1 <= B){\n\n\t\t\t\tANS[node_id] = parent_depth;\n\n\t\t\t\tnodes[node_id].depth = parent_depth;\n\t\t\t\tnodes[node_id].size = parent_size+1;\n\n\t\t\t}else{\n\n\t\t\t\tANS[node_id] = parent_depth+1;\n\n\t\t\t\tnodes[node_id].depth = parent_depth+1;\n\t\t\t\tnodes[node_id].size = 1;\n\t\t\t}\n\t\t}else if(parent_depth == nodes[node_id].child_max_depth){ //親方向のコストが、最大値と同じ\n\n\t\t\tif(nodes[node_id].child_max_size+parent_size+1 <= B){\n\n\t\t\t\tANS[node_id] = nodes[node_id].child_max_depth;\n\n\t\t\t\tnodes[node_id].size += parent_size;\n\n\t\t\t}else{\n\n\t\t\t\tANS[node_id] = nodes[node_id].child_max_depth+1;\n\n\t\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\n\t\t\t\tnodes[node_id].size = 1;\n\t\t\t}\n\n\t\t}else{ //親方向へのコストが最大でない→仮にコスト1をかけて親に渡ったとしても、最大値は更新されない\n\n\t\t\tANS[node_id] = nodes[node_id].depth;\n\t\t}\n\n\t\t//secondの再設定\n\t\tif(parent_depth > nodes[node_id].child_max_depth){ //最大値更新\n\n\t\t\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\n\t\t\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\n\n\t\t\tnodes[node_id].child_max_depth = parent_depth;\n\t\t\tnodes[node_id].child_max_size = parent_size;\n\n\t\t}else if(parent_depth == nodes[node_id].child_max_depth){ //最大値と同点\n\n\t\t\tnodes[node_id].child_max_size += parent_size;\n\n\t\t}else if(parent_depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\n\n\t\t\tnodes[node_id].child_second_depth = parent_depth;\n\t\t\tnodes[node_id].child_second_size = parent_size;\n\n\t\t}else if(parent_depth == nodes[node_id].child_second_depth){ //2番目と同点\n\n\t\t\tnodes[node_id].child_second_size += parent_size;\n\t\t}\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\tif(G[node_id][i] == nodes[node_id].parent)continue;\n\n\t\t\tQ.push(G[node_id][i]);\n\t\t}\n\t}\n\n\tprintf(\"Case %d:\\n\",num_case);\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tprintf(\"%d\\n\",ANS[i]);\n\t}\n}\n\nint main(){\n\n\tnum_case = 1;\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&V,&B);\n\t\tif(V == 0 && B == 0)break;\n\n\t\tfunc();\n\t\tnum_case++;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":13768,"score_of_the_acc":-0.051,"final_rank":3},{"submission_id":"aoj_2398_3236468","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\n\nstruct Node{\n\tint parent,depth,size;\n\tint child_max_depth,child_max_size,child_second_depth,child_second_size;\n};\n\nint num_case;\nint V,B;\nint root;\nint out_num[NUM];\nint ANS[NUM];\nbool visited[NUM];\nNode nodes[NUM];\nvector<int> G[NUM];\n\nvoid func(){\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tG[i].clear();\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\t\tnodes[i].parent = -1;\n\t\tout_num[i] = 0;\n\t}\n\n\tint from,to;\n\n\tfor(int loop = 1; loop <= V-1; loop++){\n\n\t\tscanf(\"%d\",&to);\n\t\tfrom = loop;\n\t\tto--;\n\n\t\tG[from].push_back(to);\n\t\tG[to].push_back(from);\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tvisited[i] = false;\n\t}\n\n\troot = 0;\n\tqueue<int> Q;\n\tint node_id,child;\n\n\tvisited[root] = true;\n\n\t//木構造を作る\n\tQ.push(root);\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\t\tchild = G[node_id][i];\n\t\t\tif(visited[child])continue;\n\n\t\t\tvisited[child] = true;\n\t\t\tnodes[child].parent = node_id;\n\t\t\tout_num[node_id]++;\n\n\t\t\tQ.push(child);\n\t\t}\n\t}\n\n\t/*★葉からボトムアップで、必要な情報を収集する★*/\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tif(out_num[i] == 0){ //葉\n\n\t\t\tQ.push(i);\n\t\t\t//printf(\"%dが葉\\n\",i);\n\t\t}\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tnodes[node_id].child_max_depth = 0; //子の中で最大の深さ\n\t\tnodes[node_id].child_max_size = 0; //最大の深さを持つ子の数\n\n\t\t//2番目に大きい値\n\t\tnodes[node_id].child_second_depth = 0;\n\t\tnodes[node_id].child_second_size = 0;\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\t\tchild = G[node_id][i];\n\t\t\tif(child == nodes[node_id].parent)continue;\n\n\t\t\tif(nodes[child].depth > nodes[node_id].child_max_depth){ //最大値更新\n\n\t\t\t\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\n\t\t\t\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\n\n\t\t\t\tnodes[node_id].child_max_depth = nodes[child].depth;\n\t\t\t\tnodes[node_id].child_max_size = nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth == nodes[node_id].child_max_depth){ //最大値と同点\n\n\t\t\t\tnodes[node_id].child_max_size += nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\n\n\t\t\t\tnodes[node_id].child_second_depth = nodes[child].depth;\n\t\t\t\tnodes[node_id].child_second_size = nodes[child].size;\n\n\t\t\t}else if(nodes[child].depth == nodes[node_id].child_second_depth){ //2番目と同点\n\n\t\t\t\tnodes[node_id].child_second_size += nodes[child].size;\n\t\t\t}\n\t\t}\n\n\t\tif(nodes[node_id].child_max_depth == 0){ //子がいない場合\n\n\t\t\tnodes[node_id].depth = 1;\n\t\t\tnodes[node_id].size = 1;\n\n\t\t}else if(nodes[node_id].child_max_size+1 <= B){\n\n\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth;\n\t\t\tnodes[node_id].size = nodes[node_id].child_max_size+1;\n\n\t\t}else{ //nodes[node_id].child_max_size+1 > B\n\n\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\n\t\t\tnodes[node_id].size = 1;\n\t\t}\n\n\t\t/*printf(\"node:%d depth:%d size:%d\\n\",node_id,nodes[node_id].depth,nodes[node_id].size);\n\t\tprintf(\"max_depth:%d second_depth:%d\\n\",nodes[node_id].child_max_depth,nodes[node_id].child_second_depth);*/\n\n\t\tif(nodes[node_id].parent == -1)continue;\n\n\t\tout_num[nodes[node_id].parent] -= 1;//親の出次数を1減らす\n\n\t\tif(out_num[nodes[node_id].parent] == 0){\n\n\t\t\tQ.push(nodes[node_id].parent);\n\t\t}\n\t}\n\n\n\t//printf(\"\\n\\n\");\n\tANS[root] = nodes[root].depth;\n\tfor(int i = 0; i < G[root].size(); i++){\n\t\tQ.push(G[root][i]);\n\t}\n\n\tint parent,parent_depth,parent_size;\n\n\twhile(!Q.empty()){\n\n\t\tnode_id = Q.front();\n\t\tQ.pop();\n\n\t\tparent = nodes[node_id].parent;\n\n\t\t//printf(\"node_id:%d parent:%d\\n\",node_id,parent);\n\n\t\t//★親方向をnode_idの子の1つとして見なした場合★のコスト、およびサイズを場合分けして設定\n\n\t\tif(nodes[node_id].depth < nodes[parent].child_max_depth){ //node_idが非最大\n\n\t\t\t//printf(\"node_id:%dが非最大\\n\",node_id);\n\n\t\t\t//node_idにとっては、parentが最大の深さを持つ子になる\n\t\t\tparent_size = nodes[parent].size;\n\t\t\tparent_depth = nodes[parent].depth;\n\n\t\t}else{ //node_idが最大\n\n\t\t\tif(nodes[parent].child_max_size == nodes[node_id].size){ //node_idが単独一位\n\n\t\t\t\t//printf(\"node_id:%d 単独一位\\n\",node_id);\n\n\t\t\t\t//親の、2番目の子を見る\n\t\t\t\tif(nodes[parent].child_second_depth == 0){ //2番目の子なし:親が葉になる\n\n\t\t\t\t\t//printf(\"node_id:%d 親が葉\\n\",node_id);\n\n\t\t\t\t\tparent_depth = 1;\n\t\t\t\t\tparent_size = 1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tif(nodes[parent].child_second_size+1 <= B){\n\n\t\t\t\t\t\t//printf(\"親がsecondと一緒になれる\\n\");\n\n\t\t\t\t\t\tparent_depth = nodes[parent].child_second_depth;\n\t\t\t\t\t\tparent_size = nodes[parent].child_second_size+1;\n\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\t//printf(\"親がsecondとは別\\n\");\n\n\t\t\t\t\t\tparent_depth = nodes[parent].child_second_depth+1;\n\t\t\t\t\t\tparent_size = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else{ //node_idと同点一位が1つ以上ある\n\n\t\t\t\t//printf(\"node_id:%d 他にもいる\\n\",node_id);\n\n\t\t\t\tif(nodes[parent].child_max_size-nodes[node_id].size+1 <= B){\n\n\t\t\t\t\tparent_depth = nodes[parent].child_max_depth;\n\t\t\t\t\tparent_size = nodes[parent].child_max_size-nodes[node_id].size+1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tparent_depth = nodes[parent].child_max_depth+1;\n\t\t\t\t\tparent_size = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t//printf(\"node_id:%d parent_depth:%d parent_size:%d\\n\",node_id,parent_depth,parent_size);\n\n\n\t\t//ANSの設定<★sizeを設定しなおす★>\n\t\tif(parent_depth > nodes[node_id].child_max_depth){ //親方向のコストが最大\n\n\t\t\tif(parent_size+1 <= B){\n\n\t\t\t\tANS[node_id] = parent_depth;\n\n\t\t\t\tnodes[node_id].depth = parent_depth;\n\t\t\t\tnodes[node_id].size = parent_size+1;\n\n\t\t\t}else{\n\n\t\t\t\tANS[node_id] = parent_depth+1;\n\n\t\t\t\tnodes[node_id].depth = parent_depth+1;\n\t\t\t\tnodes[node_id].size = 1;\n\t\t\t}\n\t\t}else if(parent_depth == nodes[node_id].child_max_depth){ //親方向のコストが、最大値と同じ\n\n\t\t\tif(nodes[node_id].child_max_size+parent_size+1 <= B){\n\n\t\t\t\tANS[node_id] = nodes[node_id].child_max_depth;\n\n\t\t\t\tnodes[node_id].size += parent_size;\n\n\t\t\t}else{\n\n\t\t\t\tANS[node_id] = nodes[node_id].child_max_depth+1;\n\n\t\t\t\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\n\t\t\t\tnodes[node_id].size = 1;\n\t\t\t}\n\n\t\t}else{ //親方向へのコストが最大でない→仮にコスト1をかけて親に渡ったとしても、最大値は更新されない\n\n\t\t\tANS[node_id] = nodes[node_id].depth;\n\t\t}\n\n\t\t//printf(\"node_id:%d depth:%d size:%d\\n\\n\",node_id,nodes[node_id].depth,nodes[node_id].size);\n\n\t\t//secondの再設定\n\t\tif(parent_depth > nodes[node_id].child_max_depth){ //最大値更新\n\n\t\t\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\n\t\t\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\n\n\t\t\tnodes[node_id].child_max_depth = parent_depth;\n\t\t\tnodes[node_id].child_max_size = parent_size;\n\n\t\t}else if(parent_depth == nodes[node_id].child_max_depth){ //最大値と同点\n\n\t\t\tnodes[node_id].child_max_size += parent_size;\n\n\t\t}else if(parent_depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\n\n\t\t\tnodes[node_id].child_second_depth = parent_depth;\n\t\t\tnodes[node_id].child_second_size = parent_size;\n\n\t\t}else if(parent_depth == nodes[node_id].child_second_depth){ //2番目と同点\n\n\t\t\tnodes[node_id].child_second_size += parent_size;\n\t\t}\n\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\tif(G[node_id][i] == nodes[node_id].parent)continue;\n\n\t\t\tQ.push(G[node_id][i]);\n\t\t}\n\t}\n\n\tprintf(\"Case %d:\\n\",num_case);\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tprintf(\"%d\\n\",ANS[i]);\n\t}\n}\n\nint main(){\n\n\tnum_case = 1;\n\n\twhile(true){\n\n\t\tscanf(\"%d %d\",&V,&B);\n\t\tif(V == 0 && B == 0)break;\n\n\t\tfunc();\n\t\tnum_case++;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":13760,"score_of_the_acc":-0.0509,"final_rank":2},{"submission_id":"aoj_2398_2531549","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int testcase = 1;\n int N, B;\n while(scanf(\"%d %d\", &N, &B), N) {\n vector< int > g[100000];\n for(int i = 1; i < N; i++) {\n int P;\n scanf(\"%d\", &P);\n --P;\n g[P].emplace_back(i);\n g[i].emplace_back(P);\n }\n\n printf(\"Case %d:\\n\", testcase++);\n\n if(N <= 2) {\n if(N == 1) cout << 1 << endl;\n else if(B == 1) cout << 2 << endl << 2 << endl;\n else cout << 1 << endl << 1 << endl;\n continue;\n }\n\n int root;\n for(int i = 0; i < N; i++) {\n if(g[i].size() >= 2) root = i;\n }\n\n vector< int > sz(N), dep(N), ans(N);\n\n function< void(int, int) > dfs1 = [&](int idx, int par)\n {\n int depmax = 1, size = 0;\n for(auto &to : g[idx]) {\n if(to != par) {\n dfs1(to, idx);\n if(depmax < dep[to]) depmax = dep[to], size = sz[to];\n else if(depmax == dep[to]) size += sz[to];\n }\n }\n if(size + 1 <= B) {\n sz[idx] = size + 1;\n dep[idx] = depmax;\n } else {\n sz[idx] = 1;\n dep[idx] = depmax + 1;\n }\n };\n\n\n function< void(int, int, int, int) > dfs2 = [&](int idx, int pardep, int parsz, int par)\n {\n map< int, int > vs;\n if(~par) vs[pardep] += parsz;\n for(auto &to : g[idx]) {\n if(to != par) vs[dep[to]] += sz[to];\n }\n const auto latte = prev(vs.end());\n if(latte->second + 1 <= B) ans[idx] = latte->first;\n else ans[idx] = latte->first + 1;\n\n for(auto &to : g[idx]) {\n if(to != par) {\n if(vs.find(dep[to]) == latte) {\n if(latte->second - sz[to] == 0) {\n assert(begin(vs) != latte);\n const auto malta = prev(latte);\n if(malta->second + 1 <= B) dfs2(to, malta->first, malta->second + 1, idx);\n else dfs2(to, malta->first + 1, 1, idx);\n } else {\n if(latte->second - sz[to] + 1 <= B) dfs2(to, latte->first, latte->second - sz[to] + 1, idx);\n else dfs2(to, latte->first + 1, 1, idx);\n }\n } else {\n if(latte->second + 1 <= B) dfs2(to, latte->first, latte->second + 1, idx);\n else dfs2(to, latte->first + 1, 1, idx);\n }\n }\n }\n };\n\n dfs1(root, -1);\n dfs2(root, 1, 0, -1);\n\n for(int i = 0; i < N; i++) {\n printf(\"%d\\n\", ans[i]);\n }\n\n }\n\n}","accuracy":1,"time_ms":350,"memory_kb":45488,"score_of_the_acc":-0.6668,"final_rank":9},{"submission_id":"aoj_2398_2531545","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int testcase = 1;\n int N, B;\n while(scanf(\"%d %d\", &N, &B), N) {\n vector< int > g[100000];\n for(int i = 1; i < N; i++) {\n int P;\n scanf(\"%d\", &P);\n --P;\n g[P].emplace_back(i);\n g[i].emplace_back(P);\n }\n\n cout << \"Case \" << testcase++ << \":\" << endl;\n\n if(N <= 2) {\n if(N == 1) cout << 1 << endl;\n else if(B == 1) cout << 2 << endl << 2 << endl;\n else cout << 1 << endl << 1 << endl;\n continue;\n }\n\n int root;\n for(int i = 0; i < N; i++) {\n if(g[i].size() >= 2) root = i;\n }\n\n vector< int > sz(N), dep(N), ans(N);\n\n function< void(int, int) > dfs1 = [&](int idx, int par)\n {\n int depmax = 1, size = 0;\n for(auto &to : g[idx]) {\n if(to != par) {\n dfs1(to, idx);\n if(depmax < dep[to]) depmax = dep[to], size = sz[to];\n else if(depmax == dep[to]) size += sz[to];\n }\n }\n if(size + 1 <= B) {\n sz[idx] = size + 1;\n dep[idx] = depmax;\n } else {\n sz[idx] = 1;\n dep[idx] = depmax + 1;\n }\n };\n\n\n function< void(int, int, int, int) > dfs2 = [&](int idx, int pardep, int parsz, int par)\n {\n map< int, int > vs;\n if(~par) vs[pardep] += parsz;\n for(auto &to : g[idx]) {\n if(to != par) vs[dep[to]] += sz[to];\n }\n const auto latte = prev(vs.end());\n if(latte->second + 1 <= B) ans[idx] = latte->first;\n else ans[idx] = latte->first + 1;\n\n for(auto &to : g[idx]) {\n if(to != par) {\n if(vs.find(dep[to]) == latte) {\n if(latte->second - sz[to] == 0) {\n assert(begin(vs) != latte);\n const auto malta = prev(latte);\n if(malta->second + 1 <= B) dfs2(to, malta->first, malta->second + 1, idx);\n else dfs2(to, malta->first + 1, 1, idx);\n } else {\n if(latte->second - sz[to] + 1 <= B) dfs2(to, latte->first, latte->second - sz[to] + 1, idx);\n else dfs2(to, latte->first + 1, 1, idx);\n }\n } else {\n if(latte->second + 1 <= B) dfs2(to, latte->first, latte->second + 1, idx);\n else dfs2(to, latte->first + 1, 1, idx);\n }\n }\n }\n };\n\n dfs1(root, -1);\n dfs2(root, 1, 0, -1);\n\n for(int i = 0; i < N; i++) {\n printf(\"%d\\n\", ans[i]);\n }\n fflush(stdout);\n\n }\n\n}","accuracy":1,"time_ms":350,"memory_kb":45576,"score_of_the_acc":-0.6683,"final_rank":10},{"submission_id":"aoj_2398_381105","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nvector<int> g[100010];\nmap<pair<int, int>, pair<int, int> > memo;\npair<int, int> candidate[100010][2];\nint notEnd[100010];\nint n, B;\n\nvoid CandidatePlus(int from, pair<int, int> nret) {\n if (nret.first > candidate[from][0].first) {\n candidate[from][1] = candidate[from][0];\n candidate[from][0] = nret;\n } else if (nret.first == candidate[from][0].first) {\n candidate[from][0].second += nret.second;\n } else if (nret.first > candidate[from][1].first) {\n candidate[from][1] = nret;\n } else if (nret.first == candidate[from][1].first) {\n candidate[from][1].second += nret.second;\n }\n}\n\npair<int, int> dfs(int from, int parent) {\n int depth = -1;\n int size = -1;\n if (candidate[from][0].first == -1) {\n candidate[from][0] = make_pair(0, 0);\n FORIT(it, g[from]) {\n if (*it == parent) { continue; }\n pair<int, int> nret = dfs(*it, from);\n memo[make_pair(from, *it)] = nret;\n CandidatePlus(from, nret);\n }\n }\n if (notEnd[from] == parent) {\n depth = candidate[from][0].first;\n size = candidate[from][0].second + 1;\n } else if (notEnd[from] != -1) {\n pair<int, int> nret = dfs(notEnd[from], from);\n memo[make_pair(from, notEnd[from])] = nret;\n CandidatePlus(from, nret);\n notEnd[from] = -1;\n return dfs(from, parent);\n } else {\n pair<int, int> used = memo[make_pair(from, parent)];\n if (candidate[from][0].first == used.first &&\n candidate[from][0].second == used.second) {\n depth = candidate[from][1].first;\n size = candidate[from][1].second + 1;\n } else if (candidate[from][0].first == used.first) {\n depth = candidate[from][0].first;\n size = candidate[from][0].second - used.second + 1;\n } else {\n depth = candidate[from][0].first;\n size = candidate[from][0].second + 1;\n }\n }\n depth = max(depth, 1);\n if (size > B) {\n depth = max(1, depth + 1);\n size = 1;\n }\n return make_pair(depth, size);\n}\n\nint main() {\n int test_case = 0;\n while (scanf(\"%d %d\", &n, &B), n|B) {\n test_case++;\n MEMSET(candidate, -1);\n REP(i, n) { g[i].clear(); }\n memo.clear();\n notEnd[0] = -1;\n REP(i, n - 1) {\n int t;\n scanf(\"%d\", &t);\n t--;\n g[i + 1].push_back(t);\n g[t].push_back(i + 1);\n notEnd[i + 1] = t;\n }\n for (int i = n - 1; i > 0; i--) { dfs(i, notEnd[i]); }\n printf(\"Case %d:\\n\", test_case);\n REP(i, n) {\n printf(\"%d\\n\", dfs(i, i).first);\n }\n }\n}","accuracy":1,"time_ms":1740,"memory_kb":19000,"score_of_the_acc":-1.0879,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2398_10852730\",\n \"code_snippet\": \"#include <cstring>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\nconst int Maxn = 100010;\\t\\nint n, b;\\nvector<int> vec[Maxn];\\nint dp[Maxn], B[Maxn],tmpdp[Maxn];\\nbool cmp(int x, int y)\\n{\\n\\treturn dp[x] > dp[y];\\n}\\nvoid dfs(int x,int l)\\n{\\n\\tfor (int i = 0; i < vec[x].size(); ++i)\\n\\t{\\n\\t\\tint x1 = vec[x][i];\\n\\t\\tif (x1 == l) continue;\\n\\t\\tdfs(x1, x);\\t\\n\\t}\\n\\tsort(vec[x].begin(), vec[x].end(), cmp);\\n\\tif (vec[x].size() == 1)\\n\\t{\\n\\t\\tdp[x] = 1;\\n\\t\\tB[x] = 1;\\n\\t//\\tcout << x <<\\\" \\\" << dp[x] << endl;\\n\\t\\treturn;\\n\\t}\\n\\tint tmpb = 0;\\n\\tfor (int i = 0; i < vec[x].size() && dp[vec[x][0]] == dp[vec[x][i]]; ++i)\\n\\t\\ttmpb += B[vec[x][i]];\\n\\tif (tmpb >= b)\\n\\t\\tdp[x] = dp[vec[x][0]] + 1, B[x] = 1;\\n\\telse dp[x] = dp[vec[x][0]], B[x] = tmpb + 1;\\n\\ttmpdp[x] = dp[x];\\n\\t//cout << x <<\\\" \\\" << dp[x] << endl;\\n}\\nint ans[Maxn];\\nvoid DFS(int x, int l, int pdp, int pB)\\n{\\n\\t//cout << x <<\\\" \\\" << pdp <<\\\" \\\" << pB << endl;\\n\\tif (pB >= b) ans[x] = max(dp[x], pdp + 1);\\n\\telse if (pdp < dp[x]) ans[x] = dp[x];\\n\\telse if(pdp > dp[x]) ans[x] = pdp;\\n\\telse if (pB + B[x] <= b) ans[x] = dp[x];\\n\\telse ans[x] = dp[x] + 1;\\n\\tif (vec[x].size() == 1) return;\\n\\tdp[l] = pdp, B[l] = pB;\\n\\tsort(vec[x].begin(), vec[x].end(), cmp);\\n\\tint tmpa = 0, tmpb = 0;\\n\\tfor (int i = 0; i < vec[x].size() && dp[vec[x][0]] == dp[vec[x][i]]; ++i)\\n\\t\\ttmpa += B[vec[x][i]];\\n\\tfor (int i = 1; i < vec[x].size() && dp[vec[x][1]] == dp[vec[x][i]]; ++i)\\n\\t\\ttmpb += B[vec[x][i]];\\n\\t\\n\\tfor (int i = 0; i < vec[x].size(); ++i)\\n\\t{\\n\\t\\tint x1 = vec[x][i];\\n\\t\\tif (x1 == l) continue;\\n\\t\\tint tmp = tmpa, DP = dp[vec[x][0]];\\n\\t\\tif (DP == dp[x1])\\n\\t\\t{\\n\\t\\t\\tif (tmpa == B[x1]) tmp = tmpb, DP = dp[vec[x][1]];\\n\\t\\t\\telse tmp -= B[x1];\\n\\t\\t}\\n\\t\\tif (tmp >= b) DFS(x1, x, DP + 1, 1);\\n\\t\\telse DFS(x1, x, DP, tmp + 1);\\n\\t}\\n\\tdp[l] = tmpdp[l];\\n}\\nint main()\\n{\\n\\tint cas = 1;\\n\\twhile (scanf(\\\"%d%d\\\", &n, &b) != EOF)\\n\\t{\\n\\t\\tif (n == 0) break;\\n\\t\\tprintf(\\\"Case %d:\\\\n\\\", cas++);\\n\\t\\tfor (int i = 1; i <= n; ++i)\\n\\t\\t\\tvec[i].clear();\\n\\t\\tfor (int i = 2; i <= n; ++i)\\n\\t\\t{\\n\\t\\t\\tint x;\\n\\t\\t\\tscanf(\\\"%d\\\", &x);\\n\\t\\t\\tvec[x].push_back(i), vec[i].push_back(x);\\n\\t\\t}\\n\\t\\tvec[1].push_back(0);\\n\\t\\tmemset(dp, -1, sizeof(dp));\\n\\t\\t//cout <<\\\"begin\\\" << endl;\\n\\t\\tdfs(1, 0);\\n\\t\\t\\n\\t\\tDFS(1, 0, 0, b);\\n\\t\\tfor (int i = 1; i <= n; ++i)\\n\\t\\t\\tprintf(\\\"%d\\\\n\\\", ans[i]);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 19924,\n \"score_of_the_acc\": -0.1341,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2398_10779267\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstatic const int MAXN = 100000;\\n\\nint N, B;\\nvector<int> adj[MAXN+1];\\nint parent_[MAXN+1], order_[MAXN+1], ord_sz;\\n\\n// Для поддерева при корне=1:\\nint cut_down[MAXN+1], sz_down[MAXN+1];\\n// Для «подъёма» над v при reroot:\\nint cut_up[MAXN+1], sz_up[MAXN+1];\\n// Итоговая стоимость:\\nint answer_[MAXN+1];\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int tc = 0;\\n while (true) {\\n cin >> N >> B;\\n if ((N==0 && B==0)) break;\\n ++tc;\\n for(int i=1;i<=N;i++){\\n adj[i].clear();\\n }\\n // Ввод: N-1 чисел p_i, ребро (p_i, i+1)\\n for(int i=2, p;i<=N;i++){\\n cin >> p;\\n adj[p].push_back(i);\\n adj[i].push_back(p);\\n }\\n\\n // --- 1) Построим parent_[] и порядок обхода ---\\n ord_sz = 0;\\n {\\n // Итеративный DFS\\n vector<int> st;\\n st.reserve(N);\\n st.push_back(1);\\n parent_[1] = 0;\\n while (!st.empty()) {\\n int v = st.back(); st.pop_back();\\n order_[ord_sz++] = v;\\n for (int u: adj[v]) {\\n if (u == parent_[v]) continue;\\n parent_[u] = v;\\n st.push_back(u);\\n }\\n }\\n }\\n // --- 2) Посчитаем DP_down в обратном порядке ---\\n for(int idx = ord_sz-1; idx >= 0; --idx){\\n int v = order_[idx];\\n int m1 = 0, m2 = 0, S1 = 0, S2 = 0, cnt1 = 0;\\n // Смотрим только детей (u != parent)\\n for(int u: adj[v]){\\n if (u == parent_[v]) continue;\\n int c = cut_down[u], s = sz_down[u];\\n if (c > m1) {\\n m2 = m1; S2 = S1;\\n m1 = c; S1 = s; cnt1 = 1;\\n } else if (c == m1) {\\n S1 += s; cnt1++;\\n } else if (c > m2) {\\n m2 = c; S2 = s;\\n } else if (c == m2) {\\n S2 += s;\\n }\\n }\\n if (S1 <= B-1) {\\n cut_down[v] = m1;\\n sz_down[v] = 1 + S1;\\n } else {\\n cut_down[v] = m1 + 1;\\n sz_down[v] = 1;\\n }\\n }\\n\\n // --- 3) Reroot: посчитаем cut_up, sz_up и сразу же итог answer_ ---\\n // Pre-order обход:\\n {\\n // стек пар (v, parent)\\n vector<pair<int,int>> st;\\n st.reserve(N);\\n st.emplace_back(1, 0);\\n cut_up[1] = 0; // не используется для v=1, но нужен для унификации\\n sz_up[1] = 0;\\n\\n while (!st.empty()) {\\n auto [v, p] = st.back(); st.pop_back();\\n\\n // Собираем DPchild = дети + «подъем»:\\n int m1 = 0, m2 = 0, S1 = 0, S2 = 0, cnt1 = 0;\\n // учтём «подъем» только если есть parent\\n if (p != 0) {\\n int c = cut_up[v], s = sz_up[v];\\n if (c > m1) {\\n m2 = m1; S2 = S1;\\n m1 = c; S1 = s; cnt1 = 1;\\n } else if (c == m1) {\\n S1 += s; cnt1++;\\n } else if (c > m2) {\\n m2 = c; S2 = s;\\n } else if (c == m2) {\\n S2 += s;\\n }\\n }\\n // и теперь всех «настоящих» детей:\\n for(int u: adj[v]){\\n if (u == p) continue;\\n int c = cut_down[u], s = sz_down[u];\\n if (c > m1) {\\n m2 = m1; S2 = S1;\\n m1 = c; S1 = s; cnt1 = 1;\\n } else if (c == m1) {\\n S1 += s; cnt1++;\\n } else if (c > m2) {\\n m2 = c; S2 = s;\\n } else if (c == m2) {\\n S2 += s;\\n }\\n }\\n\\n // Вычисляем итоговую стоимость для корня=v\\n int bestCut = (S1 <= B-1 ? m1 : (m1+1));\\n answer_[v] = bestCut + 1;\\n\\n // Готовим DP_up для детей\\n for(int u: adj[v]){\\n if (u == p) continue;\\n int c_u = cut_down[u], s_u = sz_down[u];\\n int m_ex, S_ex;\\n if (c_u < m1) {\\n // ребёнок не наивысший => m1,S1 не меняются\\n m_ex = m1; S_ex = S1;\\n } else if (c_u == m1) {\\n if (cnt1 > 1) {\\n // есть ещё кто-то с тем же cut=m1\\n m_ex = m1;\\n S_ex = S1 - s_u;\\n } else {\\n // этот ребёнок был **единственным** с cut=m1\\n m_ex = m2;\\n S_ex = S2;\\n }\\n } else {\\n // не может быть >m1, т.к. m1=max\\n m_ex = m1; S_ex = S1; // формально\\n }\\n if (S_ex <= B-1) {\\n cut_up[u] = m_ex;\\n sz_up[u] = 1 + S_ex;\\n } else {\\n cut_up[u] = m_ex + 1;\\n sz_up[u] = 1;\\n }\\n st.emplace_back(u, v);\\n }\\n }\\n }\\n\\n // --- 4) Вывод ---\\n cout << \\\"Case \\\" << tc << \\\":\\\\n\\\";\\n for(int i=1;i<=N;i++){\\n cout << answer_[i] << \\\"\\\\n\\\";\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 13668,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2398_10771672\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#ifdef LOCAL\\n#include \\\"algo/debug.h\\\"\\n#else\\n#define debug(...) 42\\n#endif\\n\\nconst int MAXN = 1e5 + 10;\\nconst int INF = 1e9;\\nvector<int> g[MAXN];\\n\\npair<int, int> dp[MAXN];\\nint n, b;\\n\\npair<int, int> cmp(pair<int, int> x, pair<int, int> y) {\\n if (x.first < y.first) return y;\\n if (x.first > y.first) return x;\\n return {x.first, x.second + y.second};\\n}\\n\\nvoid dfs(int u) {\\n if (g[u].size() == 0 && u != 1) {\\n dp[u] = {1, 1};\\n return;\\n }\\n int cnt = 0, mx = 0;\\n for (int v : g[u]) {\\n dfs(v);\\n if (mx < dp[v].first) {\\n mx = dp[v].first;\\n cnt = dp[v].second;\\n } else if (mx == dp[v].first) {\\n cnt += dp[v].second;\\n }\\n }\\n dp[u] = {mx + 1, 1};\\n if (cnt < b) dp[u] = min(dp[u], {mx, cnt + 1});\\n}\\n\\npair<int, int> dp2[MAXN], ans[MAXN]; // dp par\\n\\npair<int, int> suf[MAXN], pre[MAXN];\\n\\nvoid dfs2(int u, int p) {\\n pair<int, int> c = dp2[u];\\n for (int v : g[u]) {\\n c = cmp(c, dp[v]);\\n }\\n// debug(dp2[u], u);\\n if (u == 1) ans[u] = dp[u];\\n else {\\n if (c.second < b) ans[u] = {c.first, c.second + 1};\\n else ans[u] = {c.first + 1, 1};\\n }\\n for (int i = 0; i < (int)g[u].size(); i++) {\\n pre[i] = dp[g[u][i]];\\n if (i) pre[i] = cmp(pre[i], pre[i - 1]);\\n }\\n for (int i = (int)g[u].size() - 1; i >= 0; i--) {\\n suf[i] = dp[g[u][i]];\\n if (i < g[u].size() - 1) suf[i] = cmp(suf[i], suf[i + 1]);\\n }\\n for (int i = 0; i < (int)g[u].size(); i++) {\\n pair<int, int> tmp = dp2[u];\\n if (i) tmp = cmp(tmp, pre[i - 1]);\\n if (i < g[u].size() - 1) tmp = cmp(tmp, suf[i + 1]);\\n// debug(u, g[u][i], tmp);\\n if (tmp.second < b) tmp = {tmp.first, tmp.second + 1};\\n else tmp.first++, tmp.second = 1;\\n// dp2[g[u][i]] = tmp;\\n// if (tmp.second < b)\\n dp2[g[u][i]] = tmp;\\n }\\n for (int v : g[u]) dfs2(v, u);\\n}\\n\\nint main() {\\n #define NAME \\\"\\\"\\n if (fopen(NAME\\\".inp\\\", \\\"r\\\")) {\\n freopen(NAME\\\".inp\\\", \\\"r\\\", stdin);\\n freopen(NAME\\\".out\\\", \\\"w\\\", stdout);\\n }\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int cur = 0;\\n while (cin >> n >> b) {\\n if (n == 0 && b == 0) return 0;\\n cout << \\\"Case \\\" << ++cur << \\\":\\\\n\\\";\\n if (n == 1) {\\n cout << 1 << '\\\\n';\\n continue;\\n }\\n for (int i = 1; i < n; i++) {\\n int p;\\n cin >> p;\\n g[p].emplace_back(i + 1);\\n// g[i + 1].emplace_back(p);\\n }\\n dp2[1] = {1, 0};\\n dfs(1);\\n dfs2(1, 1);\\n// debug(dp[1], dp[2], dp[3], dp2[2]);\\n for (int i = 1; i <= n; i++) {\\n cout << ans[i].first << '\\\\n';\\n }\\n for (int i = 1; i <= n; i++) g[i].clear(), ans[i] = dp[i] = dp2[i] = suf[i] = pre[i] = {0, 0};\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 20592,\n \"score_of_the_acc\": -0.1142,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2398_10771286\",\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 FORD(i, a, b) for(int i = (a); i >= (b); --i)\\n#define REP(i, a) for(int i = 0; i < (a); ++i)\\n#define sz(a) (int)(a).size()\\n#define all(a) (a).begin(), (a).end()\\n#define bit(s, i) (((s) >> (i)) & 1)\\n#define ii pair <int, int>\\n#define fi first\\n#define se second\\n#define ll long long\\n#define eb emplace_back\\n#define pb push_back\\n#define __builtin_popcount __builtin_popcountll\\n\\ntemplate <class X, class Y>\\n bool maxi(X &x, Y y) {\\n if(x < y) {\\n x = y;\\n return true;\\n }\\n return false;\\n }\\n\\ntemplate <class X, class Y>\\n bool mini(X &x, Y y) {\\n if(x > y) {\\n x = y;\\n return true;\\n }\\n return false;\\n }\\n\\nconst int N=1e5+5;\\n\\nint n,b,ans[N]; ii dp[N],p[N],s[N],out[N];\\nvector<int> adj[N];\\n\\nii cmb(ii x, ii y){\\n if(x.fi>y.fi) return x;\\n if(x.fi<y.fi) return y;\\n return {x.fi,x.se+y.se};\\n}\\n\\nvoid dfs(int u){\\n ii tmp={1,0};\\n for(int v:adj[u]){\\n dfs(v);\\n tmp=cmb(tmp,dp[v]);\\n }\\n if(tmp.se+1<=b) dp[u]={tmp.fi,tmp.se+1};\\n else dp[u]={tmp.fi+1,1};\\n}\\n\\nvoid dfs2(int u){\\n ii hi=out[u];\\n for(int v:adj[u]){\\n hi=cmb(hi,dp[v]);\\n }\\n if(hi.se+1<=b) ans[u]=hi.fi;\\n else ans[u]=hi.fi+1;\\n\\n FOR(i,0,sz(adj[u])-1){\\n p[i]=dp[adj[u][i]];\\n if(i>0) p[i]=cmb(p[i],p[i-1]);\\n }\\n FORD(i,sz(adj[u])-1,0){\\n s[i]=dp[adj[u][i]];\\n if(i<sz(adj[u])-1) s[i]=cmb(s[i],s[i+1]);\\n }\\n\\n FOR(i,0,sz(adj[u])-1){\\n ii tmp=out[u];\\n if(i>0) tmp=cmb(tmp,p[i-1]);\\n if(i<sz(adj[u])-1) tmp=cmb(tmp,s[i+1]);\\n\\n if(tmp.se+1<=b) tmp={tmp.fi,tmp.se+1};\\n else tmp={tmp.fi+1,1};\\n\\n out[adj[u][i]]=tmp;\\n }\\n for(int v:adj[u]) dfs2(v);\\n}\\n\\nvoid solve(){\\n FOR(i,1,n) adj[i].clear();\\n FOR(i,2,n){\\n int p; cin>>p;\\n adj[p].eb(i);\\n }\\n FOR(i,1,n) out[i]={1,0};\\n\\n dfs(1);\\n dfs2(1);\\n\\n FOR(i,1,n) cout<<ans[i]<<'\\\\n';\\n}\\n\\nint32_t main() {\\n #define task \\\"test\\\"\\n if(fopen(task\\\".inp\\\", \\\"r\\\")){\\n freopen(task\\\".inp\\\", \\\"r\\\", stdin);\\n freopen(task\\\".out\\\", \\\"w\\\", stdout);\\n }\\n cin.tie(0)->sync_with_stdio(0);\\n\\n int tc=0;\\n while(cin>>n>>b){\\n if(n==0&&b==0) return 0;\\n cout<<\\\"Case \\\"<<(++tc)<<\\\":\\\\n\\\",solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 20272,\n \"score_of_the_acc\": -0.1089,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2398_9461744\",\n \"code_snippet\": \"#if !defined(MYLOCAL)//提出時用テンプレート\\n\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#if defined(NDEBUG)\\n#undef NDEBUG\\n#endif\\n#include \\\"bits/stdc++.h\\\"\\n#if !defined(_MSC_VER) && __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\nusing namespace std;\\nusing ll=long long; using dd=double; \\nusing vll=vector< ll>; using vdd=vector< dd>;\\nusing vvll=vector< vll>; using vvdd=vector<vdd>;\\nusing vvvll=vector< vvll>; using vvvdd=vector<vvdd>;\\nusing vvvvll=vector<vvvll>;\\nusing pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;\\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\\nusing vvpll=vector<vpll>; using vvtll=vector<vtll>; using vvqll=vector<vqll>;\\nusing namespace chrono;\\nconstexpr ll INF = 1001001001001001001;\\nstruct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;\\n#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)\\n#define REP(i, N) REPS(i, 0, (N)-1)\\n#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)\\n#define DEP(i, N) DEPS(i, 0, (N)-1)\\n#define EXPAND( x ) x//VS用おまじない\\n#define overload3(_1,_2,_3,name,...) name\\n#define overload4(_1,_2,_3,_4,name,...) name\\n#define overload5(_1,_2,_3,_4,_5,name,...) name\\n#define rep3(i, S, E) for (ll i = (S); i <= (E); i++)\\n#define rep4(i, S, E, t) for (ll i = (S); i <= (E); i+=(t))\\n#define rep(...) EXPAND(overload4(__VA_ARGS__,rep4,rep3,_,_)(__VA_ARGS__))\\n#define dep3(i, E, S) for (ll i = (E); i >= (S); i--)\\n#define dep4(i, E, S, t) for (ll i = (E); i >= (S); i-=(t))\\n#define dep(...) EXPAND(overload4(__VA_ARGS__, dep4, dep3,_,_)(__VA_ARGS__))\\n#define each2(e,v) for (auto && e:v)\\n#define each3(a,b,v) for (auto &&[a,b]:v)\\n#define each4(a,b,c,v) for (auto &&[a,b,c]:v)\\n#define each5(a,b,c,d,v) for (auto &&[a,b,c,d]:v)\\n#define each(...) EXPAND(overload5(__VA_ARGS__,each5,each4,each3,each2,_)(__VA_ARGS__))\\n#define ALL1(v) (v).begin(), (v).end()\\n#define ALL2(v,E) (v).begin(), (v).begin()+((E)+1)\\n#define ALL3(v,S,E) (v).begin()+(S), (v).begin()+((E)+1)\\n#define ALL(...) EXPAND(overload3(__VA_ARGS__, ALL3, ALL2, ALL1)(__VA_ARGS__))\\n#define all ALL\\n#define RALL1(v) (v).rbegin(), (v).rend()\\n#define RALL2(v,E) (v).rbegin(), (v).rbegin()+((E)+1)\\n#define RALL3(v,S,E) (v).rbegin()+(S), (v).rbegin()+((E)+1)\\n#define RALL(...) EXPAND(overload3(__VA_ARGS__, RALL3, RALL2, RALL1)(__VA_ARGS__))\\n#define rall RALL\\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; }\\ntemplate<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }\\ntemplate<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }\\ntemplate<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }\\ntemplate<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }\\ntemplate<class T> inline auto maxe(T &&v,ll S,ll E){ return *max_element(ALL(v,S,E)); }\\ntemplate<class T> inline auto maxe(T &&v){ return *max_element(ALL(v)); }\\ntemplate<class T> inline auto mine(T &&v,ll S,ll E){ return *min_element(ALL(v,S,E)); }\\ntemplate<class T> inline auto mine(T &&v){ return *min_element(ALL(v)); }\\ntemplate<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }\\ntemplate<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }\\ntemplate<class T,class U=typename remove_reference<T>::type::value_type>\\ninline U sum(T &&v,ll S,ll E) {return accumulate(all(v,S,E),U());}\\ntemplate<class T> inline auto sum(T &&v) {return sum(v,0,v.end()-v.begin()-1);}\\ntemplate<class T> inline ll sz(T &&v){ return (ll)v.size(); }\\ninline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; } //負もOK\\ninline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); } //負もOK\\n\\n//pair用テンプレート\\ntemplate<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }\\ntemplate<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }\\ntemplate<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }\\ntemplate<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }\\ntemplate<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }\\ntemplate<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }\\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a,const pair<T,S> &b){ pair<T,S> c=a; return c-=b; }\\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }\\ntemplate<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }\\n\\n//tuple用テンプレート 出力用のみ\\ntemplate<class T,class S,class R> inline ostream &operator<<(ostream &os,const tuple<T,S,R> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a); }\\ntemplate<class T,class S,class R,class Q> inline ostream &operator<<(ostream &os,const tuple<T,S,R,Q> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a) << ' ' << get<3>(a); }\\n\\n//vector用テンプレート\\ntemplate<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?\\\" \\\":\\\"\\\")<<a[i]; return os; }\\n\\n//array用テンプレート\\ntemplate<class T,size_t S> inline array<T,S>& operator+=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]+=b[i]; return a; }\\ntemplate<class T,size_t S> inline array<T,S>& operator-=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]-=b[i]; return a; }\\ntemplate<class T,size_t S> inline array<T,S>& operator*=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]*=b[i]; return a; }\\ntemplate<class T,size_t S> inline array<T,S>& operator/=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]/=b[i]; return a; }\\ntemplate<class T,size_t S> inline array<T,S>& operator%=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]%=b[i]; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S>& operator+=(array<T,S> &a,R b){ for (T &e: a) e+=b; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S>& operator-=(array<T,S> &a,R b){ for (T &e: a) e-=b; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S>& operator*=(array<T,S> &a,R b){ for (T &e: a) e*=b; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S>& operator/=(array<T,S> &a,R b){ for (T &e: a) e/=b; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S>& operator%=(array<T,S> &a,R b){ for (T &e: a) e%=b; return a; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator+(const array<T,S> &a,R b){ array<T,S> c=a; return c+=b; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(const array<T,S> &a,R b){ array<T,S> c=a; return c-=b; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator*(const array<T,S> &a,R b){ array<T,S> c=a; return c*=b; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator/(const array<T,S> &a,R b){ array<T,S> c=a; return c/=b; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator%(const array<T,S> &a,R b){ array<T,S> c=a; return c%=b; }\\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(R b,const array<T,S> &a){ array<T,S> c=-a; return c+=b; }\\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a,const array<T,S> &b){ array<T,S> c=a; return c-=b; }\\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a){ array<T,S> c=a; return c*=(-1); }\\ntemplate<class T,size_t S> inline ostream &operator<<(ostream &os,const array<T,S> &a){ for (ll i=0; i<(ll)S; i++) os<<(i>0?\\\" \\\":\\\"\\\")<<a[i]; return os; }\\n\\n\\n#endif//テンプレートend\\n\\n#if defined(_MSC_VER) && __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n#if defined(_MSC_VER)\\n#pragma warning( disable : 4996 )\\n#endif\\nstruct{\\n\\tsystem_clock::time_point st = system_clock::now();\\n\\tll operator()()const{return duration_cast<microseconds>(system_clock::now()-st).count()/1000;}\\n} timeget;\\n//////////////////////////////////////////\\n\\nstruct cinutil{\\n\\ttemplate<class T> static void cin1core(T &a){ cin>>a; }\\n\\ttemplate<class T,class S> static void cin1core(pair<T,S> &a){\\n\\t\\tcin1core(a.first), cin1core(a.second);\\n\\t}\\n\\ttemplate<class... Args> static void cin1core(tuple<Args...> &a){\\n\\t\\tcinTplRec<tuple<Args...>,sizeof...(Args)-1>()(a);\\n\\t}\\nprivate:\\n\\ttemplate<class Tpl,int i> struct cinTplRec{\\n\\t\\tvoid operator()(Tpl &a){ cinTplRec<Tpl,i-1>()(a); cin1core(get<i>(a)); }\\n\\t};\\n\\ttemplate<class Tpl> struct cinTplRec<Tpl,0>{\\n\\t\\tvoid operator()(Tpl &a){ cin1core(get<0>(a)); }\\n\\t};\\n};\\ntemplate<class T> T cin1(){ T a; cinutil::cin1core(a); return a; }\\ntemplate<class... Args> tuple<Args...> cins(){ return cin1<tuple<Args...>>(); }\\n\\n\\ntemplate<long long MOD> struct mll_{\\n\\tusing Int = long long;\\n\\tusing ll = long long;\\n\\tll val_=0;\\n\\t/*---- utility ----*/\\n\\tmll_ &norm(){ return normR().normS(); }//正規化\\n\\tmll_ &normR(){ val_%=MOD; return *this; }//剰余正規化のみ\\n\\tmll_ &normS(){ if (val_<0) val_+=MOD; return *this; }//正負正規化のみ\\n\\tmll_ &normP(){ if (val_>=MOD) val_-=MOD; return *this; }//加算時正規化\\n\\tmll_ &invsg(){ val_=-val_; return normS(); }//正負反転\\n\\tll modinv(int a){//a^-1 mod MOD\\n\\t\\tint ypre=0,y=1,apre=MOD;\\n\\t\\twhile (a>1){\\n\\t\\t\\tint t=apre/a;\\n\\t\\t\\tapre-=a*t,swap(a,apre);\\n\\t\\t\\typre-=y*t,swap(y,ypre);\\n\\t\\t}\\n\\t\\treturn y<0 ? y+MOD: y;\\n\\t}\\n\\t/*---- I/F ----*/\\n\\tmll_(){}\\n\\tmll_(ll v): val_(v){ norm(); }\\n\\tmll_(ll v,bool b): val_(v){} //正規化無のコンストラクタ\\n\\tInt val()const{ return (Int)val_; }\\n\\tbool isnone() const { return val_==-1; } //true:値なし\\n\\tmll_ &none() { val_=-1; return *this; } //値なしにする\\n\\tmll_ &inv(){ val_=modinv((int)val_); return *this; }\\n\\tmll_ &operator+=(mll_ b){ val_+=b.val_; return normP(); }\\n\\tmll_ &operator-=(mll_ b){ val_-=b.val_; return normS(); }\\n\\tmll_ &operator*=(mll_ b){ val_*=b.val_; return normR(); }\\n\\tmll_ &operator/=(mll_ b){ return *this*=b.inv(); }\\n\\tmll_ &operator+=(ll b){ return *this+=mll_(b); }\\n\\tmll_ &operator-=(ll b){ return *this-=mll_(b); }\\n\\tmll_ &operator*=(ll b){ return *this*=mll_(b); }\\n\\tmll_ &operator/=(ll b){ return *this/=mll_(b); }\\n\\tmll_ operator-()const{ return mll_(*this).invsg(); }\\n\\tmll_ operator+(mll_ b)const{ return mll_(*this)+=b; }\\n\\tmll_ operator-(mll_ b)const{ return mll_(*this)-=b; }\\n\\tmll_ operator*(mll_ b)const{ return mll_(*this)*=b; }\\n\\tmll_ operator/(mll_ b)const{ return mll_(*this)/=b; }\\n\\tmll_ operator+(ll b)const{ return mll_(*this)+=b; }\\n\\tmll_ operator-(ll b)const{ return mll_(*this)-=b; }\\n\\tmll_ operator*(ll b)const{ return mll_(*this)*=b; }\\n\\tmll_ operator/(ll b)const{ return mll_(*this)/=b; }\\n\\tfriend mll_ operator+(ll a,mll_ b){ return b+a; }\\n\\tfriend mll_ operator-(ll a,mll_ b){ return -b+a; }\\n\\tfriend mll_ operator*(ll a,mll_ b){ return b*a; }\\n\\tfriend mll_ operator/(ll a,mll_ b){ return mll_(a)/b; }\\n\\tbool operator==(mll_ b)const{ return val_==b.val_; }\\n\\tbool operator!=(mll_ b)const{ return val_!=b.val_; }\\n\\tbool operator==(ll b)const{ return *this==mll_(b); }\\n\\tbool operator!=(ll b)const{ return *this!=mll_(b); }\\n\\tfriend bool operator==(ll a,mll_ b){ return mll_(a)==b; }\\n\\tfriend bool operator!=(ll a,mll_ b){ return mll_(a)!=b; }\\n\\tfriend ostream &operator<<(ostream &os,mll_ a){ return os << a.val_; }\\n\\tfriend istream &operator>>(istream &is,mll_ &a){ return is >> a.val_; }\\n\\tmll_ pow(ll k)const{\\n\\t\\tmll_ ret(1,false),a(*this);\\n\\t\\tfor (; k>0; k>>=1,a*=a) if (k&1)ret*=a;\\n\\t\\treturn ret;\\n\\t}\\n\\tstatic constexpr int mod() { return MOD; }\\n\\t//enum{ modll=MOD };\\n};\\n#if 0\\n#define MODLL (1000000007LL)\\n#else\\n#define MODLL (998244353LL)\\n#endif\\nusing mll = mll_<MODLL>;\\n//using mll = fraction;\\nusing vmll = std::vector<mll>;\\nusing vvmll = std::vector<vmll>;\\nusing vvvmll = std::vector<vvmll>;\\nusing vvvvmll = std::vector<vvvmll>;\\n\\n\\ntemplate<class T> struct Vector: vector<T>{\\n\\tusing Int = long long;\\n\\tusing vT=vector<T>;\\n\\tusing cvT=const vector<T>;\\n\\tusing cT=const T;\\n\\tusing vT::vT; //親クラスのコンストラクタの隠蔽を回避\\n\\tusing vT::begin,vT::end,vT::insert,vT::erase;\\n\\tauto it(Int i){ return begin()+i; }\\n\\tauto it(Int i)const{ return begin()+i; }\\n\\tVector(cvT& b):vT(b){}\\n\\tVector(vT&& b):vT(move(b)){}\\n\\ttemplate<class S> Vector(const Vector<S>& b):vT(b.begin(),b.end()){}\\n\\ttemplate<class S> Vector(const vector<S>& b):vT(b.begin(),b.end()){}\\n\\tVector(Int n,T s,T d){ iota(n,s,d); }\\n\\tVector(Int n,function<T(Int)> g):vT(n){ for (Int i=0;i<n;++i) (*this)[i]=g(i); }\\n\\ttemplate<class S> Vector &operator+=(S x){ for (T &e: *this) e+=x; return *this; }\\n\\ttemplate<class S> Vector &operator-=(S x){ for (T &e: *this) e-=x; return *this; }\\n\\ttemplate<class S> Vector &operator*=(S x){ for (T &e: *this) e*=x; return *this; }\\n\\ttemplate<class S> Vector &operator/=(S x){ for (T &e: *this) e/=x; return *this; }\\n\\ttemplate<class S> Vector &operator%=(S x){ for (T &e: *this) e%=x; return *this; }\\n\\ttemplate<class S> Vector operator+(S x)const{ return Vector(*this)+=x; }\\n\\ttemplate<class S> Vector operator-(S x)const{ return Vector(*this)-=x; }\\n\\ttemplate<class S> Vector operator*(S x)const{ return Vector(*this)*=x; }\\n\\ttemplate<class S> Vector operator/(S x)const{ return Vector(*this)/=x; }\\n\\ttemplate<class S> Vector operator%(S x)const{ return Vector(*this)%=x; }\\n\\tVector operator-()const{ return Vector(*this)*=-1; }\\n\\ttemplate<class S> friend Vector operator-(S x,const Vector &a){ return -a+=x; }\\n\\tInt size()const{ return (Int)vT::size(); }\\n\\tVector &push_back(cT& x){ vT::push_back(x); return *this; }\\n\\tVector &pop_back(){ vT::pop_back(); return *this; }\\n\\tVector &push_front(cT& x){ insert(begin(),x); return *this; }\\n\\tVector &pop_front(){ erase(0); return *this; }\\n\\tVector &insert(Int i,cT& x){ insert(it(i),x); return *this; }\\n\\tVector &insert(Int i,cvT& b){ insert(it(i),b.begin(),b.end()); return *this; }\\n\\tVector &erase(Int i){ erase(it(i)); return *this; }\\n\\tVector &erase(Int l,Int r){ erase(it(l),it(r+1)); return *this; }\\n\\tVector &concat(cvT &b){ insert(end(),b.begin(),b.end()); return *this; }\\n\\tVector &concat(cvT &b,Int n){ for (int i=0;i<n;++i) concat(b); return *this; }\\n\\tVector &repeat(Int n){ concat(vT(*this),n-1); return *this; }\\n\\tVector &reverse(){ std::reverse(begin(),end()); return *this; }\\n\\tVector &sort(){ std::sort(begin(),end()); return *this; }\\n\\tVector &rsort(){ std::sort(vT::rbegin(),vT::rend()); return *this; }\\n\\ttemplate<class Pr> Vector &sort(Pr pr){ std::sort(begin(),end(),pr); return *this; }\\n\\tVector &uniq(){ erase(unique(begin(),end()),end()); return *this; }\\n\\tVector &sortq(){ return sort().uniq(); }\\n\\tVector &fill(Int l,Int r,cT& x){ std::fill(it(l),it(r+1),x); return *this; }\\n\\ttemplate<class S=Int> Vector &iota(Int n,T s=0,S d=1){\\n\\t\\tvT::resize(n);\\n\\t\\tif (n==0) return *this;\\n\\t\\t(*this)[0]=s;\\n\\t\\tfor (int i=1;i<n;++i) (*this)[i]=(*this)[i-1]+d;\\n\\t\\treturn *this;\\n\\t}\\n\\tInt count(cT& x)const{ return Int(std::count(begin(),end(),x)); }\\n\\tInt count(Int l,Int r,cT& x)const{ return Int(std::count(it(l),it(r+1),x)); }\\n\\ttemplate<class Pr> Int countif(Pr pr)const{ return Int(count_if(begin(),end(),pr)); }\\n\\ttemplate<class Pr> Int countif(Int l,Int r,Pr pr)const{ return Int(count_if(it(l),it(r+1),pr)); }\\n\\tInt find(cT& x)const{ return Int(std::find(begin(),end(),x)-begin()); }\\n\\tInt find(Int l,Int r,cT& x)const{ return Int(std::find(it(l),it(r+1),x)-begin()); }\\n\\ttemplate<class Pr> Int findif(Pr pr)const{ return Int(find_if(begin(),end(),pr)-begin()); }\\n\\ttemplate<class Pr> Int findif(Int l,Int r,Pr pr)const{ return Int(find_if(it(l),it(r+1),pr)-begin()); }\\n\\tVector<Int> findall(cT& x)const{ return findall(0,size()-1,x); }\\n\\tVector<Int> findall(Int l,Int r,cT& x)const{ return findallif(l,r,[&](cT& y){return y==x;}); }\\n\\ttemplate<class Pr> Vector<Int> findallif(Pr pr)const{ return findallif(0,size()-1,pr); }\\n\\ttemplate<class Pr> Vector<Int> findallif(Int l,Int r,Pr pr)const{\\n\\t\\tVector<Int> ret;\\n\\t\\tfor (Int i=l;i<=r;++i) if (pr((*this)[i])) ret.push_back(i);\\n\\t\\treturn ret;\\n\\t}\\n\\tInt flooridx(cT& x)const{ return Int(upper_bound(begin(),end(),x)-begin()-1); }\\n\\tInt ceilidx(cT& x)const{ return Int(lower_bound(begin(),end(),x)-begin()); }\\n\\tInt leftnmof(cT& x)const{ return flooridx(x)+1; }\\n\\tInt rightnmof(cT& x)const{ return size()-ceilidx(x); }\\n\\tbool contains(cT& x)const{ Int i=flooridx(x); return i>=0 && (*this)[i]==x; }\\n\\ttemplate<class Pr> Int flooridx(cT& x,Pr pr)const{ return Int(upper_bound(begin(),end(),x,pr)-begin()-1); }\\n\\ttemplate<class Pr> Int ceilidx(cT& x,Pr pr)const{ return Int(lower_bound(begin(),end(),x,pr)-begin()); }\\n\\ttemplate<class Pr> Int leftnmof(cT& x,Pr pr)const{ return flooridx(x,pr)+1; }\\n\\ttemplate<class Pr> Int rightnmof(cT& x,Pr pr)const{ return size()-ceilidx(x,pr); }\\n\\ttemplate<class Pr> bool contains(cT& x,Pr pr)const{ Int i=flooridx(x,pr); return i>=0 && (*this)[i]==x; }\\n};\\n/*\\nvll a={9,8,7},b={1,2,3};\\nvpll p={{5,3},{7,8},{0,2},};\\n- -------- 操作系 --------\\na+=x a-=x a*=x a/=x a%=x a+x a-x a*x a/x a%x -a x-a //∀i a[i]にxを演算\\na.push_front(x);\\na.push_back(x);\\na.pop_front();\\na.pop_back();\\na.insert(i,x); //a[i]にx挿入\\na.insert(i,b); //a[i]にvll b挿入\\na.erase(i); //a[i]削除\\na.erase(l,r); //区間[l,r]削除\\na.concat(b); //aにbを結合\\na.concat(b,n); //aにbをn回結合\\na.repeat(n); //aをn回繰り返す\\na.reverse(); //反転\\na.sort(); //ソート\\na.rsort(); //逆順ソート\\np.sort([&](pll x,pll y){return x.second<y.second;});//比較関数指定ソート\\na.uniq(); //連続同値を1つにする\\na.sortq(); //ソートしてユニーク\\na.fill(l,r,x); //[l,r]にx代入\\na.iota(n,s,d); //aを等差数列にする 長さn,初項s,公差d\\nvll a(n,s,d); //コンストラクタ版iota\\n- -------- 検索系 --------\\nauto pr=[&](auto &x){ return x>0; }; //検索条件\\nll m=a.count(x); //xの個数\\nll m=a.count(l,r,x); //xの個数in[l,r]\\nll m=a.countif(pr); //条件満たす個数\\nll m=a.countif(l,r,pr); //条件満たす個数in[l,r]\\nll i=a.find(x); //xの最左位置i ない時N(配列長)\\nll i=a.find(l,r,x); //xの最左位置i in[l,r] ない時r+1\\nll i=a.findif(pr); //条件満たす最左位置i ない時N(配列長)\\nll i=a.findif(l,r,pr); //条件満たす最左位置i in[l,r] ない時r+1\\nvll is=a.findall(x); //xの位置i列挙\\nvll is=a.findall(l,r,x); //xの位置i列挙in[l,r]\\nvll is=a.findallif(pr); //条件満たす位置i列挙\\nvll is=a.findallif(l,r,pr); //条件満たす位置i列挙in[l,r]\\n- -------- 昇順sort済み配列用 --------\\nll i=a.flooridx(x); //x以下の最近傍位置i ない時-1\\nll i=a.ceilidx(x); //x以上の最近傍位置i ない時N(配列長)\\nll m=a.leftnmof(x); //x以下の個数\\nll m=a.rightnmof(x); //x以上の個数\\nbool b=a.contains(x); //xを含む\\n- -------- 比較関数prでsort済みの配列用 --------\\nauto pr=[&](auto &x,auto &y){ return x>y; }; //降順ソート時\\nll i=a.flooridx(x,pr); //x以左の最近傍位置i ない時-1\\nll i=a.ceilidx(x,pr); //x以右の最近傍位置i ない時N(配列長)\\nll m=a.leftnmof(x,pr); //x以左の個数\\nll m=a.rightnmof(x,pr); //x以右の個数\\nbool b=a.contains(x,pr); //xを含む\\n\\na.concat(b,n).pop_back().rsort().uniq(); //連続適用できる\\n*/\\n\\n\\nnamespace SolvingSpace{\\n\\ntemplate<class T> using vector = Vector<T>;\\nusing vll=vector< ll>; using vmll=vector< mll>; using vdd=vector< dd>;\\nusing vvll=vector< vll>; using vvmll=vector< vmll>; using vvdd=vector< vdd>;\\nusing vvvll=vector< vvll>; using vvvmll=vector< vvmll>; using vvvdd=vector<vvdd>;\\nusing vvvvll=vector<vvvll>; using vvvvmll=vector<vvvmll>;\\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\\nusing vvpll=vector< vpll>; using vvtll=vector< vtll>; using vvqll=vector<vqll>;\\nusing vss=vector<string>;\\ntemplate<class T> vector<T> cinv(ll nm){ return vector<T>(nm,[](ll i){ (void)i; return cin1<T>(); }); }\\ntemplate<class T> vector<vector<T>> cinvv(ll H,ll W){ return vector<vector<T>>(H,[&](ll i){ (void)i; return cinv<T>(W); }); }\\n\\n\\n\\ntemplate<class Edge,class VAL,class Adde,class Ope,class Addv,class Ini>\\nstruct rerootingDP{\\n using Int = long long;\\n using ll = long long;\\n vector<vector<Edge>> *pto=nullptr;\\n Adde fe;\\n Ope merge;\\n Addv fv;\\n Ini ini; //ini(v):DPの初期値(葉の値)\\n vector<ll> parent;//parent[v]:vの親 dfs1実行時セットされる\\n vector<vector<VAL>> dp; //dp[0][v]:親→v辺の値 dp[1][v]:v→親辺の値\\n //dp[2][v]:根=vでのvの値\\n ll root;\\n rerootingDP(VAL,vector<vector<Edge>> &to,\\n Adde fe_,Ope merge_,Addv fv_,Ini ini_,Int root_=0)\\n :pto(&to),fe(fe_),merge(merge_),fv(fv_),ini(ini_),parent(to.size(),-1),\\n dp(3,vector<VAL>(to.size())),root(root_)\\n {\\n dfs1(root);\\n dfs2(root);\\n }\\n vector<VAL> &reroot(){ return dp[2]; }\\n const VAL &subtree(Int u,Int v){//有向辺u→vに対応するサブ木の値\\n return parent[v]==u ? dp[0][v] : dp[1][u];\\n }\\nprivate:\\n bool isleaf(ll v){ return (*pto)[v].size() - (v!=root) == 0; }\\n void dfs1(ll v,ll p=-1){\\n parent[v]=p;\\n if(isleaf(v)){\\n dp[0][v]=ini(v);\\n return;\\n }\\n for(ll u : (*pto)[v]) if(u!=p) dfs1(u,v);\\n bool isFirst=true;\\n VAL val=VAL();\\n for(const Edge &eg: (*pto)[v]){\\n ll u=(ll)eg;\\n if(u==p) continue;\\n VAL valb=fe(dp[0][u],v,eg);\\n if(isFirst) val=valb,isFirst=false;\\n else val=merge(val,valb);\\n }\\n dp[0][v]=fv(val,v);\\n }\\n void dfs2(ll v,ll p=-1){\\n ll M=(ll)(*pto)[v].size(); //vの隣接頂点数\\n //-- vの隣接頂点にfe適用\\n vector<VAL> tmp;\\n for(const Edge &eg: (*pto)[v]){\\n ll u=(ll)eg;\\n tmp.push_back(fe(u==p?dp[1][v]:dp[0][u],v,eg));\\n }\\n //-- 左右累積配列作成\\n vector<VAL> cml=tmp,cmr=tmp;\\n for(ll i=1;i<M;++i) cml[i]=merge(cml[i-1],cml[i]); //左\\n for(ll i=M-2;i>=0;--i) cmr[i]=merge(cmr[i],cmr[i+1]); //右\\n\\n //-- dp[2][v]計算\\n if(M>0) dp[2][v]=fv(cml[M-1],v);\\n else dp[2][v]=ini(v);\\n\\n //-- dp[1][u]計算\\n if(v==root && M==1){ //根が葉(次数1)の時は初期値\\n ll u=(*pto)[v][0];\\n dp[1][u]=ini(v);\\n }\\n else{\\n for(ll i=0;i<M;++i){\\n ll u=(*pto)[v][i];\\n if(u==p) continue;\\n //以下、子があるときしか来ない 必ずM>=2\\n if(i==0) dp[1][u]=fv(cmr[i+1],v);\\n else if(i==M-1) dp[1][u]=fv(cml[i-1],v);\\n else dp[1][u]=fv(merge(cml[i-1],cmr[i+1]),v);\\n }\\n }\\n //-- 子を再帰処理\\n for(ll u : (*pto)[v]) if(u!=p) dfs2(u,v);\\n }\\n};\\n\\n\\nvoid cin2solve()\\n{\\n rep(t,1,INF-1){\\n auto [N,B]=cins<ll,ll>();\\n if (N==0 and B==0) break;\\n vll P;\\n rep(i,0,N-1-1){ ll P__; cin>>P__; P.push_back(P__-1); }\\n\\n auto makeRootedTree=[](ll n,vll &p){\\n vvll to(n);\\n rep(v,1,n-1){\\n to[v].push_back(p[v-1]);\\n to[p[v-1]].push_back(v);\\n }\\n return to;\\n };\\n vvll to=makeRootedTree(N,P);\\n\\n using VAL=pll;\\n using Edge=ll; //グラフの辺の種類 通常の木ならll\\n auto fe=[&](const VAL &x,ll v,const Edge &eg){ return x; };\\n auto merge=[&](const VAL &x,const VAL &y)->VAL{\\n auto [Bx,rx]=x;\\n auto [By,ry]=y;\\n if(Bx>By) swap(Bx,By),swap(rx,ry);\\n if(Bx==By) return {Bx,rx+ry};\\n else return {By,ry};\\n };\\n auto fv=[&](const VAL &x,ll v)->VAL{\\n auto [Bx,rx]=x;\\n rx++;\\n if(rx<B) return {Bx,rx};\\n else{\\n rx=min(rx-B,1ll);\\n return {Bx+1,rx};\\n }\\n };\\n auto ini=[&](ll v)->VAL{\\n ll Bx=1/B;\\n ll r=1%B;\\n return {Bx,r};\\n };\\n rerootingDP rdp(VAL(),to,fe,merge,fv,ini);\\n\\n vector<VAL> vals=rdp.reroot();\\n\\n cout << \\\"Case \\\"<<t<<\\\":\\\" << '\\\\n';\\n for(auto&& e: vals) cout << e.first+(e.second>0) << '\\\\n';\\n }\\n\\n\\treturn;\\n}\\n\\n};//SolvingSpace\\n\\n//////////////////////////////////////////\\n\\nint main(){\\n\\t#if 1\\n\\t//SolvingSpace::labo();\\n\\tSolvingSpace::cin2solve();\\n\\t//SolvingSpace::generand();\\n\\t#else\\n\\tll t; cin >> t;\\n\\trep(i,0,t-1){\\n\\t\\tSolvingSpace::cin2solve();\\n\\t\\t//SolvingSpace::generand();\\n\\t} \\n\\t#endif\\n\\t//cerr << timeget() <<\\\"ms\\\"<< '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 47820,\n \"score_of_the_acc\": -0.6744,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2398_6811274\",\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=100005,INF=1<<30;\\n\\nvector<int> G[MAX];\\npair<int,int> dp[MAX];\\nint N,B;\\nint ans[MAX];\\n\\nvoid pre(int u,int p){\\n int ma=-1,sum=0;\\n for(int to:G[u]){\\n if(to==p) continue;\\n pre(to,u);\\n if(ma<dp[to].fi){\\n ma=dp[to].fi;\\n sum=dp[to].se;\\n }else if(ma==dp[to].fi){\\n sum+=dp[to].se;\\n }\\n }\\n if(ma==-1){\\n dp[u]=mp(1,1);\\n }else{\\n if(sum+1<=B){\\n dp[u]=mp(ma,sum+1);\\n }else{\\n dp[u]=mp(ma+1,1);\\n }\\n }\\n}\\n\\nvoid solve(int u,int p){\\n vector<pair<int,int>> dat,L,R;\\n for(int to:G[u]){\\n dat.push_back(dp[to]);\\n }\\n \\n L=dat;R=dat;\\n for(int i=1;i<si(L);i++){\\n if(L[i].fi>L[i-1].fi){\\n \\n }else if(L[i].fi==L[i-1].fi){\\n L[i].se+=L[i-1].se;\\n }else{\\n L[i]=L[i-1];\\n }\\n }\\n \\n for(int i=si(R)-2;i>=0;i--){\\n if(R[i].fi>R[i+1].fi){\\n \\n }else if(R[i].fi==R[i+1].fi){\\n R[i].se+=R[i+1].se;\\n }else{\\n R[i]=R[i+1];\\n }\\n }\\n \\n if(L.back().se+1<=B){\\n dp[u]=mp(L.back().fi,L.back().se+1);\\n }else{\\n dp[u]=mp(L.back().fi+1,1);\\n }\\n \\n ans[u]=dp[u].fi;\\n \\n //cout<<u<<endl;\\n //for(int t=0;t<si(L);t++) cout<<L[t].fi<<\\\" \\\"<<L[t].se<<endl;\\n \\n for(int q=0;q<si(G[u]);q++){\\n if(G[u][q]==p) continue;\\n int to=G[u][q];\\n \\n auto savu=dp[u],savto=dp[to];\\n \\n int ma=-1,sum=0;\\n if(q){\\n ma=L[q-1].fi;\\n sum=L[q-1].se;\\n }\\n if(q+1<si(R)){\\n if(ma<R[q+1].fi){\\n ma=R[q+1].fi;\\n sum=R[q+1].se;\\n }else if(ma==R[q+1].fi){\\n sum+=R[q+1].se;\\n }\\n }\\n \\n if(ma==-1){\\n dp[u]=mp(1,1);\\n }else{\\n if(sum+1<=B){\\n dp[u]=mp(ma,sum+1);\\n }else{\\n dp[u]=mp(ma+1,1);\\n }\\n }\\n \\n solve(to,u);\\n \\n dp[u]=savu;\\n dp[to]=savto;\\n }\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int T=1;\\n while(1){\\n cin>>N>>B;\\n if(N==0) break;\\n cout<<\\\"Case \\\"<<T<<\\\":\\\\n\\\";T++;\\n \\n if(N==1){\\n cout<<1<<\\\"\\\\n\\\";\\n continue;\\n }\\n for(int i=0;i<N;i++){\\n G[i].clear();\\n dp[i]=mp(INF,INF);\\n }\\n for(int i=0;i<N-1;i++){\\n int p;cin>>p;p--;\\n G[p].push_back(i+1);\\n G[i+1].push_back(p);\\n }\\n pre(0,-1);\\n solve(0,-1);\\n for(int i=0;i<N;i++) cout<<ans[i]<<\\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 36652,\n \"score_of_the_acc\": -0.4347,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2398_6730426\",\n \"code_snippet\": \"#line 1 \\\"g.cpp\\\"\\n/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.06.18 08:53:34 */\\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) {\\n\\t\\t\\treturn a.first > b.first;\\n\\t\\t};\\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] == -1 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/rerooting.hpp\\\"\\n\\ntemplate <class result_type, class cost_type,\\n\\t\\t result_type (*e)(),\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t // identity element of monoid\\n\\t\\t result_type (*merge)(result_type, result_type, int),\\t\\t // left_result, right_result, parent_id\\n\\t\\t result_type (*send)(result_type, int, int, int, cost_type) // child_res, child_id, parent_id, edge_id, edge_cost\\n\\t\\t >\\nstd::vector<result_type> rerooting(const graph<cost_type>& tr) {\\n\\tstd::vector<std::vector<result_type>> child_results(tr.size());\\n\\tstd::vector<result_type> ret(tr.size(), e());\\n\\tconst int root = 0;\\n\\n\\tauto tree_dp = [&tr, &child_results](auto self, const int& now, const int& par) -> result_type {\\n\\t\\tresult_type res = e();\\n\\t\\tchild_results[now].resize(tr[now].size(), e());\\n\\t\\tfor(int i = 0; i < int(tr[now].size()); i++) {\\n\\t\\t\\tconst typename graph<cost_type>::edge& ed = tr[now][i];\\n\\t\\t\\tif(ed.to == par) continue;\\n\\t\\t\\tchild_results[now][i] = send(self(self, ed.to, now), ed.to, now, ed.id, ed.cost);\\n\\t\\t\\tres = merge(res, child_results[now][i], now);\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\ttree_dp(tree_dp, root, -1);\\n\\n\\tauto rerooting_internal = [&tr, &child_results, &ret](auto self, const int& now, const int& par, const result_type& ans_par) -> void {\\n\\t\\tstd::vector<result_type>& child_result = child_results[now];\\n\\t\\tconst int children_count = int(child_result.size());\\n\\t\\tstd::vector<result_type> cumulated_result_front(children_count + 1), cumulated_result_back(children_count + 1);\\n\\t\\tcumulated_result_front.front() = cumulated_result_back.back() = e();\\n\\t\\tfor(int i = 0; i < children_count; i++)\\n\\t\\t\\tif(tr[now][i].to == par) {\\n\\t\\t\\t\\tchild_result[i] = ans_par;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\tfor(int i = 0; i < children_count; i++) {\\n\\t\\t\\tcumulated_result_front[i + 1] = merge(cumulated_result_front[i], child_result[i], now);\\n\\t\\t\\tcumulated_result_back[children_count - i - 1] =\\n\\t\\t\\t\\tmerge(cumulated_result_back[children_count - i], child_result[children_count - i - 1], now);\\n\\t\\t}\\n\\t\\tret[now] = cumulated_result_front.back();\\n\\t\\tfor(int i = 0; i < children_count; i++) {\\n\\t\\t\\tconst typename graph<cost_type>::edge& ed = tr[now][i];\\n\\t\\t\\tif(ed.to != par)\\n\\t\\t\\t\\tself(self, ed.to, now,\\n\\t\\t\\t\\t\\t send(merge(cumulated_result_front[i], cumulated_result_back[i + 1], now), now, ed.to, ed.id, ed.cost));\\n\\t\\t}\\n\\t\\treturn;\\n\\t};\\n\\trerooting_internal(rerooting_internal, root, -1, e());\\n\\n\\treturn ret;\\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 6 \\\"g.cpp\\\"\\n\\n// struct res_type {\\n// \\tint max_cost, size;\\n// \\tres_type(int m, int s) {\\n// \\t\\tmax_cost = m;\\n// \\t\\tsize = s;\\n// \\t}\\n// };\\n\\nusing res_type = pair<int, int>; // max_cost, size;\\n\\nres_type e() { return res_type(0, 0); }\\n\\nres_type merge(res_type a, res_type b, int par_id) {\\n\\tint max_cost = max(a.first, b.first);\\n\\tint size = 0;\\n\\tif(a.first == max_cost) size += a.second;\\n\\tif(b.first == max_cost) size += b.second;\\n\\treturn res_type(max_cost, size);\\n}\\n\\nint blocksize_max;\\n\\nres_type send(res_type child_res, int child_id, int parent_id, int edge_id,\\n\\t\\t\\t int edge_cost) // child_res, child_id, parent_id, edge_id, edge_cost\\n{\\n\\tint mc = child_res.first;\\n\\tint sz = (child_res.second + 1);\\n\\tif(sz > blocksize_max) {\\n\\t\\tmc++;\\n\\t\\tsz = 1;\\n\\t}\\n\\treturn res_type(mc, sz);\\n}\\n\\nvoid solve(int n) {\\n\\t// INT(blocksize_max);\\n\\tcin >> blocksize_max;\\n\\tgraph<int> g(n);\\n\\trep(i, 1, n) {\\n\\t\\tint p;\\n\\t\\tcin >> p;\\n\\t\\tg.add_edge(p - 1, i, 1, false, 0);\\n\\t}\\n\\n\\tauto res = rerooting<res_type, int, e, merge, send>(g);\\n\\n\\trep(root, n) {\\n\\t\\tres_type ans = send(res[root], root, -1, -1, -1);\\n\\t\\tprint(ans.first + 1);\\n\\t}\\n\\n\\treturn;\\n}\\n\\nint main() {\\n\\tint n;\\n\\tint casecount = 1;\\n\\twhile(cin >> n && n) {\\n\\t\\t// cout << solve(n)<<'\\\\n';\\n\\t\\t// print(\\\"Case \\\")\\n\\t\\tcout << \\\"Case \\\" << casecount++ << \\\":\\\\n\\\";\\n\\t\\tsolve(n);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 38112,\n \"score_of_the_acc\": -0.5081,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2398_6165500\",\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\\nint k;\\nconst int mn = 1 << 17;\\nstruct edge {\\n\\tint to;\\n};\\nusing Data = P;\\nvector<edge> G[mn];\\nvector<int> ids[mn];\\nvector<Data> memo[mn];\\nint root;\\n\\n\\nData dfs(int id, int fr) {\\n\\tData res;\\n\\t//\\n\\t//initialize\\n\\t//\\n\\tmap<int, int> mp;\\n\\tfor (edge e : G[id]) {\\n\\t\\tif (e.to == fr)continue;\\n\\t\\tData nex = dfs(e.to, id);\\n\\t\\t//\\n\\t\\t//update with edge\\n\\t\\t//\\n\\t\\tids[id].push_back(e.to);\\n\\t\\tmemo[id].push_back(nex);\\n\\t\\tmp[nex.first] += nex.second;\\n\\t}\\n\\t//\\n\\t//update for return\\n\\tif (mp.empty())return { 1,1 };\\n\\telse {\\n\\t\\tP p = *--mp.end();\\n\\t\\tif (p.second + 1 > k) {\\n\\t\\t\\treturn { p.first+1,1 };\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn { p.first,p.second+1 };\\n\\t\\t}\\n\\t}\\n\\t//\\n\\treturn res;\\n}\\nint ans[mn];\\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\\tmap<int, int> mp;\\n\\tfor (Data d : v) {\\n\\t\\tmp[d.first] += d.second;\\n\\t}\\n\\t//\\n\\t//calcurate id's ans\\n\\tif (mp.size()) {\\n\\t\\tP p = *--mp.end();\\n\\t\\tif (p.second + 1 <= k)ans[id] = p.first;\\n\\t\\telse ans[id] = p.first + 1;\\n\\t}\\n\\telse {\\n\\t\\tans[id] = 1;\\n\\t}\\n\\n\\trep(i, ids[id].size()) {\\n\\t\\tint to = ids[id][i];\\n\\t\\tData d;\\n\\t\\tmp[v[i].first] -= v[i].second;\\n\\t\\tif (mp[v[i].first] == 0)mp.erase(v[i].first);\\n\\t\\tif (mp.empty())d = { 1,1 };\\n\\t\\telse {\\n\\t\\t\\tP p = *--mp.end();\\n\\t\\t\\tif (p.second + 1 > k) {\\n\\t\\t\\t\\td = { p.first + 1,1 };\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\td = { p.first,p.second + 1 };\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//\\n\\t\\t//update for return\\n\\t\\t//\\n\\t\\tinvdfs(to, id, d);\\n\\n\\t\\tmp[v[i].first] += v[i].second;\\n\\t}\\n}\\nvoid yaru() {\\n\\tdfs(root, -1);\\n\\tinvdfs(root, -1, { 0,0 });\\n}\\n\\n\\nint tmp = 0;\\nvoid outputx() {\\n\\tcout << \\\"Case \\\" << tmp << \\\":\\\\n\\\";\\n}\\nint n;\\nvoid solve() {\\n\\ttmp++;\\n\\trep(i, n) {\\n\\t\\tG[i].clear();\\n\\t\\tids[i].clear();\\n\\t\\tmemo[i].clear();\\n\\t}\\n\\trep1(i, n - 1) {\\n\\t\\tint p; cin >> p; p--;\\n\\t\\tG[p].push_back({ i });\\n\\t\\tG[i].push_back({ p });\\n\\t}\\n\\tyaru();\\n\\toutputx();\\n\\trep(i, n)cout << ans[i] << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << 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\\twhile (cin >> n >> k,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 59960,\n \"score_of_the_acc\": -0.85,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2398_3531513\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n\\n\\ntemplate<typename Data, typename T>\\nstruct ReRooting{\\n struct Node{\\n Int to,rev;\\n Data data;\\n Node(Int to,Int rev,Data data):to(to),rev(rev),data(data){}\\n };\\n \\n using F1 = function<T(T,T)>;\\n using F2 = function<T(T,Data)>;\\n \\n vector<vector<Node> > G;\\n vector<vector<T> > ld,rd;\\n vector<Int> lp,rp;\\n \\n const F1 f1;\\n const F2 f2;\\n const T id;\\n\\n ReRooting(Int n,const F1 f1,const F2 f2,const T id):\\n G(n),ld(n),rd(n),lp(n),rp(n),f1(f1),f2(f2),id(id){}\\n\\n void add_edge(Int u,Int v,Data d){\\n G[u].emplace_back(v,(Int)G[v].size(),d);\\n G[v].emplace_back(u,(Int)G[u].size()-1,d);\\n }\\n\\n T dfs(Int v,Int p){\\n while(lp[v]!=p&&lp[v]<(Int)G[v].size()){\\n auto &e=G[v][lp[v]];\\n ld[v][lp[v]+1]=f1(ld[v][lp[v]],f2(dfs(e.to,e.rev),e.data)); \\n lp[v]++;\\n }\\n while(rp[v]!=p&&rp[v]>=0){\\n auto &e=G[v][rp[v]];\\n rd[v][rp[v]]=f1(rd[v][rp[v]+1],f2(dfs(e.to,e.rev),e.data));\\n rp[v]--;\\n }\\n if(p<0) return rd[v][0];\\n return f1(ld[v][p],rd[v][p+1]); \\n }\\n\\n vector<T> build(){\\n for(Int i=0;i<(Int)G.size();i++){\\n ld[i].assign((Int)G[i].size()+1,id);\\n rd[i].assign((Int)G[i].size()+1,id);\\n lp[i]=0;\\n rp[i]=(Int)G[i].size()-1; \\n }\\n vector<T> res;\\n for(Int i=0;i<(Int)G.size();i++){\\n res.emplace_back(dfs(i,-1));\\n }\\n return res;\\n }\\n};\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n Int n,bs;\\n Int uku=0;\\n while(cin>>n>>bs,n){\\n using P = pair<Int, Int>;\\n auto f1=[&](P a,P b){\\n if(a.first!=b.first) return max(a,b);\\n return P(a.first,a.second+b.second);\\n };\\n auto f2=[&](P a,Int b){\\n if(a.second+b<=bs) return P(a.first,a.second+b);\\n return P(a.first+1,b);\\n };\\n P ti(0,0);\\n ReRooting<Int, P> G(n,f1,f2,ti);\\n for(Int i=1;i<n;i++){\\n Int p;\\n cin>>p;\\n p--;\\n G.add_edge(p,i,1);\\n } \\n auto ans=G.build();\\n cout<<\\\"Case \\\"<<++uku<<\\\":\\\"<<endl;\\n for(Int i=0;i<n;i++) cout<<f2(ans[i],1).first+1<<\\\"\\\\n\\\";\\n cout<<flush;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 74296,\n \"score_of_the_acc\": -1.3889,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2398_3530504\",\n \"code_snippet\": \"#include<iomanip>\\n#include<limits>\\n#include<thread>\\n#include<utility>\\n#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<set>\\n#include<map>\\n#include<vector>\\n#include<stack>\\n#include<queue>\\n#include<cmath>\\n#include<numeric>\\n#include<cassert>\\n#include<random>\\n#include<chrono>\\n#include<unordered_set>\\n#include<unordered_map>\\n#include<fstream>\\n#include<list>\\n#include<functional>\\n#include<bitset>\\n#include<complex>\\n#include<tuple>\\nusing namespace std;\\ntypedef unsigned long long int ull;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\ntypedef pair<int,int> pi;\\ntypedef pair<double,double> pd;\\ntypedef pair<double,ll> pdl;\\n#define F first\\n#define S second\\nconst ll E=1e18+7;\\nconst ll MOD=1000000007;\\n\\nconst ll MX=100000;\\n\\nvector<ll> cnt(MX);\\nll n=0;\\nll b;\\nvector<vector<ll>> edge(MX);\\nvector<pll> node(MX); //amari,takasa\\nvector<ll> ans(MX);\\n\\nvoid init(){for(int i=0;i<n;i++){edge[i].clear(); cnt[i]=0;}}\\n\\nvoid dfs(ll w){\\n ll mx=0;\\n ll ch=1;\\n for(auto &I:edge[w]){\\n dfs(I);\\n mx=max(mx,node[I].S);\\n }\\n for(auto &I:edge[w]){\\n if(node[I].S==mx){ch+=node[I].F;}\\n }\\n if(ch>b){mx++; ch=1;}\\n else if(ch==b){mx++; ch=0;}\\n node[w]={ch,mx};\\n}\\n\\nvoid dfs2(ll w,pll p){\\n //cout<<w<<\\\" \\\"<<p.F<<\\\" \\\"<<p.S<<endl;\\n pll mx1={p.S,-1},mx2={p.S,-1};\\n for(auto &I:edge[w]){\\n if(node[I].S>mx2.F){mx2={node[I].S,I};}\\n if(mx2>mx1){swap(mx2,mx1);}\\n }\\n ll cnt1=1,cnt2=1;\\n for(auto &I:edge[w]){\\n if(node[I].S==mx1.F){cnt1+=node[I].F;}\\n if(node[I].S==mx2.F){cnt2+=node[I].F;}\\n }\\n if(p.S==mx1.F){cnt1+=p.F;}\\n if(p.S==mx2.F){cnt2+=p.F;}\\n ans[w]=mx1.F+1;\\n if(cnt1>b){ans[w]++;}\\n \\n for(auto &I:edge[w]){\\n if(I==mx1.S){\\n ll cnt=cnt2;\\n ll high=mx2.F;\\n if(node[I].S==mx2.F){cnt-=node[I].F;}\\n if(cnt>b){high++; cnt=1;}\\n else if(cnt==b){high++; cnt=0;}\\n dfs2(I,{cnt,high});\\n }\\n else{\\n ll cnt=cnt1;\\n ll high=mx1.F;\\n if(node[I].S==mx1.F){cnt-=node[I].F;}\\n if(cnt>b){high++; cnt=1;}\\n else if(cnt==b){high++; cnt=0;}\\n dfs2(I,{cnt,high});\\n }\\n }\\n}\\n\\n\\nint main(){\\n for(int C=1;;C++){\\n init();\\n cin>>n>>b;\\n if(n==0){break;}\\n cout<<\\\"Case \\\"<<C<<\\\":\\\"<<endl;\\n for(int i=1;i<n;i++){\\n ll p;\\n cin>>p;\\n p--;\\n edge[p].push_back(i);\\n }\\n dfs(0);\\n dfs2(0,{0,0});\\n for(int i=0;i<n;i++){cout<<ans[i]<<endl;}\\n //for(int i=0;i<n;i++){cout<<node[i].F<<\\\" \\\"<<node[i].S<<endl;}\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1360,\n \"memory_kb\": 24412,\n \"score_of_the_acc\": -0.9426,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2398_3236471\",\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\\n\\nstruct Node{\\n\\tint parent,depth,size;\\n\\tint child_max_depth,child_max_size,child_second_depth,child_second_size;\\n};\\n\\nint num_case;\\nint V,B;\\nint root;\\nint out_num[NUM];\\nint ANS[NUM];\\nbool visited[NUM];\\nNode nodes[NUM];\\nvector<int> G[NUM];\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\t\\tnodes[i].parent = -1;\\n\\t\\tout_num[i] = 0;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int loop = 1; loop <= V-1; loop++){\\n\\n\\t\\tscanf(\\\"%d\\\",&to);\\n\\t\\tfrom = loop;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\troot = 0;\\n\\tqueue<int> Q;\\n\\tint node_id,child;\\n\\n\\tvisited[root] = true;\\n\\n\\t//木構造を作る\\n\\tQ.push(root);\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\t\\tchild = G[node_id][i];\\n\\t\\t\\tif(visited[child])continue;\\n\\n\\t\\t\\tvisited[child] = true;\\n\\t\\t\\tnodes[child].parent = node_id;\\n\\t\\t\\tout_num[node_id]++;\\n\\n\\t\\t\\tQ.push(child);\\n\\t\\t}\\n\\t}\\n\\n\\t/*★葉からボトムアップで、必要な情報を収集する★*/\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tif(out_num[i] == 0){ //葉\\n\\n\\t\\t\\tQ.push(i);\\n\\t\\t\\t//printf(\\\"%dが葉\\\\n\\\",i);\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tnodes[node_id].child_max_depth = 0; //子の中で最大の深さ\\n\\t\\tnodes[node_id].child_max_size = 0; //最大の深さを持つ子の数\\n\\n\\t\\t//2番目に大きい値\\n\\t\\tnodes[node_id].child_second_depth = 0;\\n\\t\\tnodes[node_id].child_second_size = 0;\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\t\\tchild = G[node_id][i];\\n\\t\\t\\tif(child == nodes[node_id].parent)continue;\\n\\n\\t\\t\\tif(nodes[child].depth > nodes[node_id].child_max_depth){ //最大値更新\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\\n\\t\\t\\t\\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\\n\\n\\t\\t\\t\\tnodes[node_id].child_max_depth = nodes[child].depth;\\n\\t\\t\\t\\tnodes[node_id].child_max_size = nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth == nodes[node_id].child_max_depth){ //最大値と同点\\n\\n\\t\\t\\t\\tnodes[node_id].child_max_size += nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_depth = nodes[child].depth;\\n\\t\\t\\t\\tnodes[node_id].child_second_size = nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth == nodes[node_id].child_second_depth){ //2番目と同点\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_size += nodes[child].size;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(nodes[node_id].child_max_depth == 0){ //子がいない場合\\n\\n\\t\\t\\tnodes[node_id].depth = 1;\\n\\t\\t\\tnodes[node_id].size = 1;\\n\\n\\t\\t}else if(nodes[node_id].child_max_size+1 <= B){\\n\\n\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth;\\n\\t\\t\\tnodes[node_id].size = nodes[node_id].child_max_size+1;\\n\\n\\t\\t}else{ //nodes[node_id].child_max_size+1 > B\\n\\n\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\\n\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t}\\n\\n\\t\\tif(nodes[node_id].parent == -1)continue;\\n\\n\\t\\tout_num[nodes[node_id].parent] -= 1;//親の出次数を1減らす\\n\\n\\t\\tif(out_num[nodes[node_id].parent] == 0){\\n\\n\\t\\t\\tQ.push(nodes[node_id].parent);\\n\\t\\t}\\n\\t}\\n\\n\\n\\tANS[root] = nodes[root].depth;\\n\\tfor(int i = 0; i < G[root].size(); i++){\\n\\t\\tQ.push(G[root][i]);\\n\\t}\\n\\n\\tint parent,parent_depth,parent_size;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tparent = nodes[node_id].parent;\\n\\n\\t\\t//★親方向をnode_idの子の1つとして見なした場合★のコスト、およびサイズを場合分けして設定\\n\\n\\t\\tif(nodes[node_id].depth < nodes[parent].child_max_depth){ //node_idが非最大\\n\\n\\t\\t\\t//node_idにとっては、parentが最大の深さを持つ子になる\\n\\t\\t\\tparent_size = nodes[parent].size;\\n\\t\\t\\tparent_depth = nodes[parent].depth;\\n\\n\\t\\t}else{ //node_idが最大\\n\\n\\t\\t\\tif(nodes[parent].child_max_size == nodes[node_id].size){ //node_idが単独一位\\n\\n\\t\\t\\t\\t//親の、2番目の子を見る\\n\\t\\t\\t\\tif(nodes[parent].child_second_depth == 0){ //2番目の子なし:親が葉になる\\n\\n\\t\\t\\t\\t\\tparent_depth = 1;\\n\\t\\t\\t\\t\\tparent_size = 1;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(nodes[parent].child_second_size+1 <= B){\\n\\n\\t\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_second_depth;\\n\\t\\t\\t\\t\\t\\tparent_size = nodes[parent].child_second_size+1;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_second_depth+1;\\n\\t\\t\\t\\t\\t\\tparent_size = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{ //node_idと同点一位が1つ以上ある\\n\\n\\t\\t\\t\\tif(nodes[parent].child_max_size-nodes[node_id].size+1 <= B){\\n\\n\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_max_depth;\\n\\t\\t\\t\\t\\tparent_size = nodes[parent].child_max_size-nodes[node_id].size+1;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_max_depth+1;\\n\\t\\t\\t\\t\\tparent_size = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\t//ANSの設定<★depthとsizeを設定しなおす★>\\n\\t\\tif(parent_depth > nodes[node_id].child_max_depth){ //親方向のコストが最大\\n\\n\\t\\t\\tif(parent_size+1 <= B){\\n\\n\\t\\t\\t\\tANS[node_id] = parent_depth;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = parent_depth;\\n\\t\\t\\t\\tnodes[node_id].size = parent_size+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tANS[node_id] = parent_depth+1;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = parent_depth+1;\\n\\t\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t\\t}\\n\\t\\t}else if(parent_depth == nodes[node_id].child_max_depth){ //親方向のコストが、最大値と同じ\\n\\n\\t\\t\\tif(nodes[node_id].child_max_size+parent_size+1 <= B){\\n\\n\\t\\t\\t\\tANS[node_id] = nodes[node_id].child_max_depth;\\n\\n\\t\\t\\t\\tnodes[node_id].size += parent_size;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tANS[node_id] = nodes[node_id].child_max_depth+1;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\\n\\t\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //親方向へのコストが最大でない→仮にコスト1をかけて親に渡ったとしても、最大値は更新されない\\n\\n\\t\\t\\tANS[node_id] = nodes[node_id].depth;\\n\\t\\t}\\n\\n\\t\\t//secondの再設定\\n\\t\\tif(parent_depth > nodes[node_id].child_max_depth){ //最大値更新\\n\\n\\t\\t\\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\\n\\t\\t\\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\\n\\n\\t\\t\\tnodes[node_id].child_max_depth = parent_depth;\\n\\t\\t\\tnodes[node_id].child_max_size = parent_size;\\n\\n\\t\\t}else if(parent_depth == nodes[node_id].child_max_depth){ //最大値と同点\\n\\n\\t\\t\\tnodes[node_id].child_max_size += parent_size;\\n\\n\\t\\t}else if(parent_depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\\n\\n\\t\\t\\tnodes[node_id].child_second_depth = parent_depth;\\n\\t\\t\\tnodes[node_id].child_second_size = parent_size;\\n\\n\\t\\t}else if(parent_depth == nodes[node_id].child_second_depth){ //2番目と同点\\n\\n\\t\\t\\tnodes[node_id].child_second_size += parent_size;\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\tif(G[node_id][i] == nodes[node_id].parent)continue;\\n\\n\\t\\t\\tQ.push(G[node_id][i]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"Case %d:\\\\n\\\",num_case);\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ANS[i]);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tnum_case = 1;\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&V,&B);\\n\\t\\tif(V == 0 && B == 0)break;\\n\\n\\t\\tfunc();\\n\\t\\tnum_case++;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 13768,\n \"score_of_the_acc\": -0.051,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2398_3236468\",\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\\n\\nstruct Node{\\n\\tint parent,depth,size;\\n\\tint child_max_depth,child_max_size,child_second_depth,child_second_size;\\n};\\n\\nint num_case;\\nint V,B;\\nint root;\\nint out_num[NUM];\\nint ANS[NUM];\\nbool visited[NUM];\\nNode nodes[NUM];\\nvector<int> G[NUM];\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < NUM; i++){\\n\\t\\tG[i].clear();\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\t\\tnodes[i].parent = -1;\\n\\t\\tout_num[i] = 0;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int loop = 1; loop <= V-1; loop++){\\n\\n\\t\\tscanf(\\\"%d\\\",&to);\\n\\t\\tfrom = loop;\\n\\t\\tto--;\\n\\n\\t\\tG[from].push_back(to);\\n\\t\\tG[to].push_back(from);\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\n\\troot = 0;\\n\\tqueue<int> Q;\\n\\tint node_id,child;\\n\\n\\tvisited[root] = true;\\n\\n\\t//木構造を作る\\n\\tQ.push(root);\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\t\\tchild = G[node_id][i];\\n\\t\\t\\tif(visited[child])continue;\\n\\n\\t\\t\\tvisited[child] = true;\\n\\t\\t\\tnodes[child].parent = node_id;\\n\\t\\t\\tout_num[node_id]++;\\n\\n\\t\\t\\tQ.push(child);\\n\\t\\t}\\n\\t}\\n\\n\\t/*★葉からボトムアップで、必要な情報を収集する★*/\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tif(out_num[i] == 0){ //葉\\n\\n\\t\\t\\tQ.push(i);\\n\\t\\t\\t//printf(\\\"%dが葉\\\\n\\\",i);\\n\\t\\t}\\n\\t}\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tnodes[node_id].child_max_depth = 0; //子の中で最大の深さ\\n\\t\\tnodes[node_id].child_max_size = 0; //最大の深さを持つ子の数\\n\\n\\t\\t//2番目に大きい値\\n\\t\\tnodes[node_id].child_second_depth = 0;\\n\\t\\tnodes[node_id].child_second_size = 0;\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\t\\tchild = G[node_id][i];\\n\\t\\t\\tif(child == nodes[node_id].parent)continue;\\n\\n\\t\\t\\tif(nodes[child].depth > nodes[node_id].child_max_depth){ //最大値更新\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\\n\\t\\t\\t\\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\\n\\n\\t\\t\\t\\tnodes[node_id].child_max_depth = nodes[child].depth;\\n\\t\\t\\t\\tnodes[node_id].child_max_size = nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth == nodes[node_id].child_max_depth){ //最大値と同点\\n\\n\\t\\t\\t\\tnodes[node_id].child_max_size += nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_depth = nodes[child].depth;\\n\\t\\t\\t\\tnodes[node_id].child_second_size = nodes[child].size;\\n\\n\\t\\t\\t}else if(nodes[child].depth == nodes[node_id].child_second_depth){ //2番目と同点\\n\\n\\t\\t\\t\\tnodes[node_id].child_second_size += nodes[child].size;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(nodes[node_id].child_max_depth == 0){ //子がいない場合\\n\\n\\t\\t\\tnodes[node_id].depth = 1;\\n\\t\\t\\tnodes[node_id].size = 1;\\n\\n\\t\\t}else if(nodes[node_id].child_max_size+1 <= B){\\n\\n\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth;\\n\\t\\t\\tnodes[node_id].size = nodes[node_id].child_max_size+1;\\n\\n\\t\\t}else{ //nodes[node_id].child_max_size+1 > B\\n\\n\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\\n\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t}\\n\\n\\t\\t/*printf(\\\"node:%d depth:%d size:%d\\\\n\\\",node_id,nodes[node_id].depth,nodes[node_id].size);\\n\\t\\tprintf(\\\"max_depth:%d second_depth:%d\\\\n\\\",nodes[node_id].child_max_depth,nodes[node_id].child_second_depth);*/\\n\\n\\t\\tif(nodes[node_id].parent == -1)continue;\\n\\n\\t\\tout_num[nodes[node_id].parent] -= 1;//親の出次数を1減らす\\n\\n\\t\\tif(out_num[nodes[node_id].parent] == 0){\\n\\n\\t\\t\\tQ.push(nodes[node_id].parent);\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//printf(\\\"\\\\n\\\\n\\\");\\n\\tANS[root] = nodes[root].depth;\\n\\tfor(int i = 0; i < G[root].size(); i++){\\n\\t\\tQ.push(G[root][i]);\\n\\t}\\n\\n\\tint parent,parent_depth,parent_size;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tnode_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tparent = nodes[node_id].parent;\\n\\n\\t\\t//printf(\\\"node_id:%d parent:%d\\\\n\\\",node_id,parent);\\n\\n\\t\\t//★親方向をnode_idの子の1つとして見なした場合★のコスト、およびサイズを場合分けして設定\\n\\n\\t\\tif(nodes[node_id].depth < nodes[parent].child_max_depth){ //node_idが非最大\\n\\n\\t\\t\\t//printf(\\\"node_id:%dが非最大\\\\n\\\",node_id);\\n\\n\\t\\t\\t//node_idにとっては、parentが最大の深さを持つ子になる\\n\\t\\t\\tparent_size = nodes[parent].size;\\n\\t\\t\\tparent_depth = nodes[parent].depth;\\n\\n\\t\\t}else{ //node_idが最大\\n\\n\\t\\t\\tif(nodes[parent].child_max_size == nodes[node_id].size){ //node_idが単独一位\\n\\n\\t\\t\\t\\t//printf(\\\"node_id:%d 単独一位\\\\n\\\",node_id);\\n\\n\\t\\t\\t\\t//親の、2番目の子を見る\\n\\t\\t\\t\\tif(nodes[parent].child_second_depth == 0){ //2番目の子なし:親が葉になる\\n\\n\\t\\t\\t\\t\\t//printf(\\\"node_id:%d 親が葉\\\\n\\\",node_id);\\n\\n\\t\\t\\t\\t\\tparent_depth = 1;\\n\\t\\t\\t\\t\\tparent_size = 1;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tif(nodes[parent].child_second_size+1 <= B){\\n\\n\\t\\t\\t\\t\\t\\t//printf(\\\"親がsecondと一緒になれる\\\\n\\\");\\n\\n\\t\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_second_depth;\\n\\t\\t\\t\\t\\t\\tparent_size = nodes[parent].child_second_size+1;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\t//printf(\\\"親がsecondとは別\\\\n\\\");\\n\\n\\t\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_second_depth+1;\\n\\t\\t\\t\\t\\t\\tparent_size = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{ //node_idと同点一位が1つ以上ある\\n\\n\\t\\t\\t\\t//printf(\\\"node_id:%d 他にもいる\\\\n\\\",node_id);\\n\\n\\t\\t\\t\\tif(nodes[parent].child_max_size-nodes[node_id].size+1 <= B){\\n\\n\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_max_depth;\\n\\t\\t\\t\\t\\tparent_size = nodes[parent].child_max_size-nodes[node_id].size+1;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tparent_depth = nodes[parent].child_max_depth+1;\\n\\t\\t\\t\\t\\tparent_size = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d parent_depth:%d parent_size:%d\\\\n\\\",node_id,parent_depth,parent_size);\\n\\n\\n\\t\\t//ANSの設定<★sizeを設定しなおす★>\\n\\t\\tif(parent_depth > nodes[node_id].child_max_depth){ //親方向のコストが最大\\n\\n\\t\\t\\tif(parent_size+1 <= B){\\n\\n\\t\\t\\t\\tANS[node_id] = parent_depth;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = parent_depth;\\n\\t\\t\\t\\tnodes[node_id].size = parent_size+1;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tANS[node_id] = parent_depth+1;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = parent_depth+1;\\n\\t\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t\\t}\\n\\t\\t}else if(parent_depth == nodes[node_id].child_max_depth){ //親方向のコストが、最大値と同じ\\n\\n\\t\\t\\tif(nodes[node_id].child_max_size+parent_size+1 <= B){\\n\\n\\t\\t\\t\\tANS[node_id] = nodes[node_id].child_max_depth;\\n\\n\\t\\t\\t\\tnodes[node_id].size += parent_size;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tANS[node_id] = nodes[node_id].child_max_depth+1;\\n\\n\\t\\t\\t\\tnodes[node_id].depth = nodes[node_id].child_max_depth+1;\\n\\t\\t\\t\\tnodes[node_id].size = 1;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //親方向へのコストが最大でない→仮にコスト1をかけて親に渡ったとしても、最大値は更新されない\\n\\n\\t\\t\\tANS[node_id] = nodes[node_id].depth;\\n\\t\\t}\\n\\n\\t\\t//printf(\\\"node_id:%d depth:%d size:%d\\\\n\\\\n\\\",node_id,nodes[node_id].depth,nodes[node_id].size);\\n\\n\\t\\t//secondの再設定\\n\\t\\tif(parent_depth > nodes[node_id].child_max_depth){ //最大値更新\\n\\n\\t\\t\\tnodes[node_id].child_second_depth = nodes[node_id].child_max_depth;\\n\\t\\t\\tnodes[node_id].child_second_size = nodes[node_id].child_max_size;\\n\\n\\t\\t\\tnodes[node_id].child_max_depth = parent_depth;\\n\\t\\t\\tnodes[node_id].child_max_size = parent_size;\\n\\n\\t\\t}else if(parent_depth == nodes[node_id].child_max_depth){ //最大値と同点\\n\\n\\t\\t\\tnodes[node_id].child_max_size += parent_size;\\n\\n\\t\\t}else if(parent_depth > nodes[node_id].child_second_depth){ //最大ではないが、2番目の値更新\\n\\n\\t\\t\\tnodes[node_id].child_second_depth = parent_depth;\\n\\t\\t\\tnodes[node_id].child_second_size = parent_size;\\n\\n\\t\\t}else if(parent_depth == nodes[node_id].child_second_depth){ //2番目と同点\\n\\n\\t\\t\\tnodes[node_id].child_second_size += parent_size;\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\tif(G[node_id][i] == nodes[node_id].parent)continue;\\n\\n\\t\\t\\tQ.push(G[node_id][i]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"Case %d:\\\\n\\\",num_case);\\n\\n\\tfor(int i = 0; i < V; i++){\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ANS[i]);\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tnum_case = 1;\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&V,&B);\\n\\t\\tif(V == 0 && B == 0)break;\\n\\n\\t\\tfunc();\\n\\t\\tnum_case++;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 13760,\n \"score_of_the_acc\": -0.0509,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2398_2531549\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int testcase = 1;\\n int N, B;\\n while(scanf(\\\"%d %d\\\", &N, &B), N) {\\n vector< int > g[100000];\\n for(int i = 1; i < N; i++) {\\n int P;\\n scanf(\\\"%d\\\", &P);\\n --P;\\n g[P].emplace_back(i);\\n g[i].emplace_back(P);\\n }\\n\\n printf(\\\"Case %d:\\\\n\\\", testcase++);\\n\\n if(N <= 2) {\\n if(N == 1) cout << 1 << endl;\\n else if(B == 1) cout << 2 << endl << 2 << endl;\\n else cout << 1 << endl << 1 << endl;\\n continue;\\n }\\n\\n int root;\\n for(int i = 0; i < N; i++) {\\n if(g[i].size() >= 2) root = i;\\n }\\n\\n vector< int > sz(N), dep(N), ans(N);\\n\\n function< void(int, int) > dfs1 = [&](int idx, int par)\\n {\\n int depmax = 1, size = 0;\\n for(auto &to : g[idx]) {\\n if(to != par) {\\n dfs1(to, idx);\\n if(depmax < dep[to]) depmax = dep[to], size = sz[to];\\n else if(depmax == dep[to]) size += sz[to];\\n }\\n }\\n if(size + 1 <= B) {\\n sz[idx] = size + 1;\\n dep[idx] = depmax;\\n } else {\\n sz[idx] = 1;\\n dep[idx] = depmax + 1;\\n }\\n };\\n\\n\\n function< void(int, int, int, int) > dfs2 = [&](int idx, int pardep, int parsz, int par)\\n {\\n map< int, int > vs;\\n if(~par) vs[pardep] += parsz;\\n for(auto &to : g[idx]) {\\n if(to != par) vs[dep[to]] += sz[to];\\n }\\n const auto latte = prev(vs.end());\\n if(latte->second + 1 <= B) ans[idx] = latte->first;\\n else ans[idx] = latte->first + 1;\\n\\n for(auto &to : g[idx]) {\\n if(to != par) {\\n if(vs.find(dep[to]) == latte) {\\n if(latte->second - sz[to] == 0) {\\n assert(begin(vs) != latte);\\n const auto malta = prev(latte);\\n if(malta->second + 1 <= B) dfs2(to, malta->first, malta->second + 1, idx);\\n else dfs2(to, malta->first + 1, 1, idx);\\n } else {\\n if(latte->second - sz[to] + 1 <= B) dfs2(to, latte->first, latte->second - sz[to] + 1, idx);\\n else dfs2(to, latte->first + 1, 1, idx);\\n }\\n } else {\\n if(latte->second + 1 <= B) dfs2(to, latte->first, latte->second + 1, idx);\\n else dfs2(to, latte->first + 1, 1, idx);\\n }\\n }\\n }\\n };\\n\\n dfs1(root, -1);\\n dfs2(root, 1, 0, -1);\\n\\n for(int i = 0; i < N; i++) {\\n printf(\\\"%d\\\\n\\\", ans[i]);\\n }\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 45488,\n \"score_of_the_acc\": -0.6668,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2398_2531545\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int testcase = 1;\\n int N, B;\\n while(scanf(\\\"%d %d\\\", &N, &B), N) {\\n vector< int > g[100000];\\n for(int i = 1; i < N; i++) {\\n int P;\\n scanf(\\\"%d\\\", &P);\\n --P;\\n g[P].emplace_back(i);\\n g[i].emplace_back(P);\\n }\\n\\n cout << \\\"Case \\\" << testcase++ << \\\":\\\" << endl;\\n\\n if(N <= 2) {\\n if(N == 1) cout << 1 << endl;\\n else if(B == 1) cout << 2 << endl << 2 << endl;\\n else cout << 1 << endl << 1 << endl;\\n continue;\\n }\\n\\n int root;\\n for(int i = 0; i < N; i++) {\\n if(g[i].size() >= 2) root = i;\\n }\\n\\n vector< int > sz(N), dep(N), ans(N);\\n\\n function< void(int, int) > dfs1 = [&](int idx, int par)\\n {\\n int depmax = 1, size = 0;\\n for(auto &to : g[idx]) {\\n if(to != par) {\\n dfs1(to, idx);\\n if(depmax < dep[to]) depmax = dep[to], size = sz[to];\\n else if(depmax == dep[to]) size += sz[to];\\n }\\n }\\n if(size + 1 <= B) {\\n sz[idx] = size + 1;\\n dep[idx] = depmax;\\n } else {\\n sz[idx] = 1;\\n dep[idx] = depmax + 1;\\n }\\n };\\n\\n\\n function< void(int, int, int, int) > dfs2 = [&](int idx, int pardep, int parsz, int par)\\n {\\n map< int, int > vs;\\n if(~par) vs[pardep] += parsz;\\n for(auto &to : g[idx]) {\\n if(to != par) vs[dep[to]] += sz[to];\\n }\\n const auto latte = prev(vs.end());\\n if(latte->second + 1 <= B) ans[idx] = latte->first;\\n else ans[idx] = latte->first + 1;\\n\\n for(auto &to : g[idx]) {\\n if(to != par) {\\n if(vs.find(dep[to]) == latte) {\\n if(latte->second - sz[to] == 0) {\\n assert(begin(vs) != latte);\\n const auto malta = prev(latte);\\n if(malta->second + 1 <= B) dfs2(to, malta->first, malta->second + 1, idx);\\n else dfs2(to, malta->first + 1, 1, idx);\\n } else {\\n if(latte->second - sz[to] + 1 <= B) dfs2(to, latte->first, latte->second - sz[to] + 1, idx);\\n else dfs2(to, latte->first + 1, 1, idx);\\n }\\n } else {\\n if(latte->second + 1 <= B) dfs2(to, latte->first, latte->second + 1, idx);\\n else dfs2(to, latte->first + 1, 1, idx);\\n }\\n }\\n }\\n };\\n\\n dfs1(root, -1);\\n dfs2(root, 1, 0, -1);\\n\\n for(int i = 0; i < N; i++) {\\n printf(\\\"%d\\\\n\\\", ans[i]);\\n }\\n fflush(stdout);\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 45576,\n \"score_of_the_acc\": -0.6683,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2398_381105\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nvector<int> g[100010];\\nmap<pair<int, int>, pair<int, int> > memo;\\npair<int, int> candidate[100010][2];\\nint notEnd[100010];\\nint n, B;\\n\\nvoid CandidatePlus(int from, pair<int, int> nret) {\\n if (nret.first > candidate[from][0].first) {\\n candidate[from][1] = candidate[from][0];\\n candidate[from][0] = nret;\\n } else if (nret.first == candidate[from][0].first) {\\n candidate[from][0].second += nret.second;\\n } else if (nret.first > candidate[from][1].first) {\\n candidate[from][1] = nret;\\n } else if (nret.first == candidate[from][1].first) {\\n candidate[from][1].second += nret.second;\\n }\\n}\\n\\npair<int, int> dfs(int from, int parent) {\\n int depth = -1;\\n int size = -1;\\n if (candidate[from][0].first == -1) {\\n candidate[from][0] = make_pair(0, 0);\\n FORIT(it, g[from]) {\\n if (*it == parent) { continue; }\\n pair<int, int> nret = dfs(*it, from);\\n memo[make_pair(from, *it)] = nret;\\n CandidatePlus(from, nret);\\n }\\n }\\n if (notEnd[from] == parent) {\\n depth = candidate[from][0].first;\\n size = candidate[from][0].second + 1;\\n } else if (notEnd[from] != -1) {\\n pair<int, int> nret = dfs(notEnd[from], from);\\n memo[make_pair(from, notEnd[from])] = nret;\\n CandidatePlus(from, nret);\\n notEnd[from] = -1;\\n return dfs(from, parent);\\n } else {\\n pair<int, int> used = memo[make_pair(from, parent)];\\n if (candidate[from][0].first == used.first &&\\n candidate[from][0].second == used.second) {\\n depth = candidate[from][1].first;\\n size = candidate[from][1].second + 1;\\n } else if (candidate[from][0].first == used.first) {\\n depth = candidate[from][0].first;\\n size = candidate[from][0].second - used.second + 1;\\n } else {\\n depth = candidate[from][0].first;\\n size = candidate[from][0].second + 1;\\n }\\n }\\n depth = max(depth, 1);\\n if (size > B) {\\n depth = max(1, depth + 1);\\n size = 1;\\n }\\n return make_pair(depth, size);\\n}\\n\\nint main() {\\n int test_case = 0;\\n while (scanf(\\\"%d %d\\\", &n, &B), n|B) {\\n test_case++;\\n MEMSET(candidate, -1);\\n REP(i, n) { g[i].clear(); }\\n memo.clear();\\n notEnd[0] = -1;\\n REP(i, n - 1) {\\n int t;\\n scanf(\\\"%d\\\", &t);\\n t--;\\n g[i + 1].push_back(t);\\n g[t].push_back(i + 1);\\n notEnd[i + 1] = t;\\n }\\n for (int i = n - 1; i > 0; i--) { dfs(i, notEnd[i]); }\\n printf(\\\"Case %d:\\\\n\\\", test_case);\\n REP(i, n) {\\n printf(\\\"%d\\\\n\\\", dfs(i, i).first);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1740,\n \"memory_kb\": 19000,\n \"score_of_the_acc\": -1.0879,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1375,"cells":{"group_id":{"kind":"string","value":"aoj_2410_cpp"},"problem_description":{"kind":"string","value":"E - じゃんけん\n問題文\nE 君はじゃんけんが大好きである (ちなみにじゃんけんのルールについては\nWikipediaのじゃんけんのページ\nを参照せよ)．\nある日，町内でじゃんけん大会があるということを知った E 君は，じゃんけんの腕に自信があったこともあり早速出場することにした．\nところが大会当日，E 君を待ち受けていたのは，普通の「グー・チョキ・パー」のみからなる普通のじゃんけんではなく，\nより多くの手からなる\n一般化されたじゃんけん\nであった．\n一般化されたじゃんけん\nは 2 人のプレイヤーで行われるゲームである．\nまず，2 人にはこのじゃんけんにおいて使用出来る手の個数\nN\nと，\nN\n個の手の勝敗関係を示す表が伝えられる．\nそして，通常のじゃんけんと同じように同時に手を出しあい，伝えられた手の勝敗関係に基いて勝敗を決める．これを 1,000 回 繰り返す．\n1 回のじゃんけんの勝敗の結果によって得点が手に入り，相手に勝利した場合は 3 点，相手と「あいこ」になった場合は 1 点が手に入る．相手に負けてしまった場合は得点を得られない．\nこのなんだかよくわからないルールのじゃんけんにすっかり戦意を喪失してしまった E 君であったが，どうやら聞くところによると，最終的に相手に得点で勝てなくても，\n350 点\n以上を獲得すれば何か景品がもらえるらしい．\nめんどくさいので\n350 点\nを得てさっさと大会を後にすることにした．\nこの問題の目的は，一般化されたじゃんけんをプレイする AI を作成し，ジャッジ側の用意した AI と対戦させて\n350 点\n以上を獲得することである．\n入出力形式\nまず入力が以下の形式で与えられる．\nN\na\n1,1\n...\na\n1,N\n...\na\nN,1\n...\na\nN,N\nN\nはじゃんけんの手の数である．\n各\na\ni,j\nは\nN\n個の手の勝敗関係を表す．\na\ni,j\nは\n-\n，\no\n，\nx\nのいずれかであり，\n-\nならば手\ni\nが手\nj\nに対し引き分けることを，\no\nならば手\ni\nが手\nj\nに対し勝つことを，\nx\nなら負けることを示す．\nこの条件の下で 1,000回 AI とじゃんけんをする．\nプログラムは自分の使う手を出力すると，ジャッジの AI が使った手を入力で受けとる事ができる．\n例えば C/C++で 3 番目の手を使う場合は\nprintf(\"3\\n\"); fflush(stdout);\nとする．次に，\nscanf(\"%d\", &judge_ai_hand);\nとすると変数\njudge_ai_hand\nにジャッジの AI が使った手が入る．\nなおじゃんけんの手は1-indexedである．\n1,000 回のじゃんけんを終えた後は直ちにプログラムを終了せよ．その後，獲得できた得点の合計が 350 点以上であれば正答と判定される．\n制約\n3 ≤ N ≤ 10\ni ≠ j\nのとき，\na\ni,j\n∈ {\no\n,\nx\n} であり，\na\ni,j\n=\no\n，\na\nj,i\n=\nx\nまたは\na\ni,j\n=\nx\n，\na\nj,i\n=\no\nのどちらか片方が成り立つ．\ni = j\nのとき，\na\ni,j\n=\n-\nである．\nAI の出す手は勝敗関係の表\na\ni,j\nと AI の過去の手にだけ依存し，競技者のプログラムの過去の手や直前に出した手には依存しない．\nN\nは整数である．\nデータセットに\nN=10\nのテストケースは高々 6 個しか含まれていない．\n入出力例1\nじゃんけんの説明\nプログラムの出力\nプログラムへの入力\n4\n-oox\nx-oo\nxx-o\noxx-\n1 回目に競技者の AI が使った手\n1\n1 回目にジャッジの AI が使った手\n2\n...\n...\n...\n1,000 回目に競技者の AI が使った手\n4\n1,000 回目にジャッジの AI が使った手\n3\n最初にプログラムはじゃんけんの手の表を受け取る．その後，1,000 回のじゃんけんを行う．\nここで，1 回目のじゃんけんでは競技者の AI はジャッジの AI に勝利しているが，\n1,000 回目のじゃんけんでは競技者の AI はジャッジの AI に敗北していることに注意せよ．\nWriter: 楠本充，小浜翔太郎\nTester: 森槙悟"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2410_5021796","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\n\nclass Random {\n\tmt19937 engine;\n\trandom_device rd;\n\npublic:\n\tRandom() {\n\t\tseed();\n\t}\n\tvoid seed() {\n\t\tengine.seed(rd());\n\t}\n\tvoid seed(uint_fast32_t s) {\n\t\tengine.seed(s);\n\t}\n\ttemplate <class T> T get(T l, T r) {\n\t\tassert(l <= r);\n\t\treturn uniform_int_distribution<T>(l, r)(engine);\n\t}\n} rnd;\n\nint main() {\n\tint n;\n\tcin >> n;\n\tVS s(n);\n\trep(i, n) cin >> s[i];\n\n\tVI v;\n\trep(i, n) {\n\t\tif (s[i].find('o') != string::npos) {\n\t\t\tv.push_back(i + 1);\n\t\t}\n\t}\n\trep(i, 1000) {\n\t\tcout << 10 << endl;\n\t\tint x;\n\t\tcin >> x;\n\t}\n}","accuracy":0.02702702702702703,"time_ms":10,"memory_kb":3356,"score_of_the_acc":-0.2308,"final_rank":19},{"submission_id":"aoj_2410_4244189","code_snippet":"/*\nDear ToM,\nCongratulations on your graduation!\nYou did a great job!\n ☆ﾟ*＠*ﾟ☆\n (＠*｡☆｡*＠\n /☆｡*＠ﾟ*☆\n▲/／｡＠｡*☆＠*\n ▼―ｰ｡*＠ﾟ*☆\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,s,n) for(int i=s; i<n; ++i)\n#define rep(i,n) REP(i,0,n)\n#define SORT(c) sort((c).begin(),(c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n#define DEBUG false\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\n\nint main(){\n\tll n;\n\tcin >> n;\n\tvector<string> a(n);\n\trep(i, n) cin >> a[i];\n\n\tint maxi_ind = 0;\n\tint maxi_e = 0;\n\trep(i, n){\n\t\tint e = 0;\n\t\trep(j, n){\n\t\t\tif(a[i][j] == '-') e += 1;\n\t\t\telse if(a[i][j] == 'o') e += 3;\n\t\t}\n\t\tif(e > maxi_e){\n\t\t\tmaxi_ind = i;\n\t\t\tmaxi_e = e;\n\t\t}\n\t}\n\n\tsrand((unsigned int)time(NULL)+1);\n\tint pre = 1;\n\trep(i, 1000){\n\t\t//cout << (maxi_ind + 1) << endl;\n\t\t//cout << (rand() % n + 1) << endl;\n\t\tcout << pre << endl;\n\t\tfflush(stdout);\n\n\t\t//int tmp;\n\t\tcin >> pre;\n\t}\n\n\treturn 0;\n}","accuracy":0.21621621621621623,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.6923,"final_rank":12},{"submission_id":"aoj_2410_4244129","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n if(lose == rhs.lose)return win > rhs.win;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n int win = 0, tie = 0, lose = 0;\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int my_hand;\n if(lose < 500){\n int idx = rnd() % (int)(ans.size());\n my_hand = ans[idx];\n }else{\n my_hand = rnd() % n + 1;\n }\n cout << my_hand << endl;\n cin >> ai_hand;\n if(v[my_hand-1][ai_hand-1] == -1)lose++;\n else if(v[my_hand-1][ai_hand-1] == 0)tie++;\n else win++;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.9231,"final_rank":2},{"submission_id":"aoj_2410_4244102","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n if(lose == rhs.lose)return win > rhs.win;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int hand = rnd() % (int)(ans.size());\n cout << ans[hand] << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.4615,"final_rank":4},{"submission_id":"aoj_2410_4244100","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n if(lose == rhs.lose)return win > rhs.win;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int hand = rnd() % (int)(ans.size());\n cout << ans[0] << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.4615,"final_rank":4},{"submission_id":"aoj_2410_4244096","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n if(lose == rhs.lose)return tie > rhs.tie;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int hand = rnd() % (int)(ans.size());\n cout << ans[0] << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.9231,"final_rank":8},{"submission_id":"aoj_2410_4244094","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n if(lose == rhs.lose)return tie > rhs.tie;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int hand = rnd() % (int)(ans.size());\n cout << ans[hand] << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.6923,"final_rank":6},{"submission_id":"aoj_2410_4244092","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nstruct Hand{\n int lose, win, tie, num;\n bool operator<(const Hand &rhs)const{\n //if(lose == rhs.lose)return tie > rhs.tie;\n return lose < rhs.lose;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n vector<Hand> hands;\n for(int i=0;i<n;++i){\n Hand h({0, 0, 0, 0});\n h.num = i + 1;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)h.lose++;\n else if(v[i][j] == 0)h.tie++;\n else h.win++;\n }\n hands.push_back(h);\n }\n sort(hands.begin(), hands.end());\n /*\n for(auto e: hands){\n cout << e.num << \" \" << e.win << \" \" << e.tie << \" \" << e.lose << endl;\n }\n */\n vector<int> ans;\n ans.push_back(hands[0].num);\n for(int i=1;i<n;++i){\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\n else break;\n }\n random_device rnd;\n for(int i=0;i<1000;++i){\n int ai_hand;\n int hand = rnd() % (int)(ans.size());\n cout << ans[hand] << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.6923,"final_rank":6},{"submission_id":"aoj_2410_4244049","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 0);\n vector<int> pre;\n for(int i=0;i<n;i++){\n pre.push_back(i+1);\n }\n for(int t=0;t<q;t++){\n int hnd = 1, maxi = -INF;\n for(auto x : pre){\n cnt[x]++;\n }\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += 2*cnt[j];\n else if(a[i][j]== '-') scr += cnt[j];\n // else scr--;\n // if(a[i][j] == 'x') scr-=cnt[j];\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n pre.push_back(ai-1);\n if(pre.size() > 50) pre.erase(pre.begin());\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.9231,"final_rank":2},{"submission_id":"aoj_2410_4244029","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> v(n, vector<int>(n));\n for(int i=0;i<n;++i){\n for(int j=0;j<n;++j){\n char c;\n cin >> c;\n if(c == '-')v[i][j] = 0;\n else if(c == 'o')v[i][j] = 1;\n else v[i][j] = -1;\n }\n }\n int mini = n, hand = 0;\n for(int i=0;i<n;++i){\n int cnt = 0;\n for(int j=0;j<n;++j){\n if(v[i][j] == -1)cnt++;\n }\n if(cnt < mini){\n mini = cnt;\n hand = i + 1;\n }\n }\n for(int i=0;i<1000;++i){\n int ai_hand;\n cout << hand << endl;\n cin >> ai_hand;\n }\n\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.9231,"final_rank":8},{"submission_id":"aoj_2410_4244028","code_snippet":"/*\nDear ToM,\nCongratulations on your graduation!\nYou did a great job!\n ☆ﾟ*＠*ﾟ☆\n (＠*｡☆｡*＠\n /☆｡*＠ﾟ*☆\n▲/／｡＠｡*☆＠*\n ▼―ｰ｡*＠ﾟ*☆\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,s,n) for(int i=s; i<n; ++i)\n#define rep(i,n) REP(i,0,n)\n#define SORT(c) sort((c).begin(),(c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n#define DEBUG false\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\n\nint main(){\n\tll n;\n\tcin >> n;\n\tvector<string> a(n);\n\trep(i, n) cin >> a[i];\n\n\tint maxi_ind = 0;\n\tint maxi_e = 0;\n\trep(i, n){\n\t\tint e = 0;\n\t\trep(j, n){\n\t\t\tif(a[i][j] == '-') e += 1;\n\t\t\telse if(a[i][j] == 'o') e += 3;\n\t\t}\n\t\tif(e > maxi_e){\n\t\t\tmaxi_ind = i;\n\t\t\tmaxi_e = e;\n\t\t}\n\t}\n\n\trep(i, 1000){\n\t\tcout << (maxi_ind + 1) << endl;\n\t\tfflush(stdout);\n\n\t\tint tmp;\n\t\tcin >> tmp;\n\t}\n\n\treturn 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3396,"score_of_the_acc":-1,"final_rank":11},{"submission_id":"aoj_2410_4243943","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 1, maxi = -INF;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n // if(a[i][j] == 'o') scr += 2*cnt[j];\n // else if(a[i][j]== '-') scr += cnt[j];\n // else scr--;\n if(a[i][j] == 'x') scr-=cnt[j];\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]++;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.1891891891891892,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.6923,"final_rank":13},{"submission_id":"aoj_2410_4243941","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 1, maxi = 0;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += cnt[j];\n else if(a[i][j]== '-') scr += cnt[j];\n else scr-=2;\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]+=1;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.1891891891891892,"time_ms":10,"memory_kb":3388,"score_of_the_acc":-0.8462,"final_rank":14},{"submission_id":"aoj_2410_4243935","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 1, maxi = 0;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += 2*cnt[j];\n else if(a[i][j]== '-') scr += cnt[j];\n else scr--;\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]++;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.13513513513513514,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.4615,"final_rank":16},{"submission_id":"aoj_2410_4243927","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 1, maxi = 0;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += 2*cnt[j];\n else if(a[i][j]== '-') scr += cnt[j];\n else scr--;\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]+=5;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.13513513513513514,"time_ms":10,"memory_kb":3344,"score_of_the_acc":0,"final_rank":15},{"submission_id":"aoj_2410_4243917","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 0, maxi = 0;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += 3*cnt[j];\n if(a[i][j ]== '-') scr += cnt[j];\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]+=100;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.13513513513513514,"time_ms":10,"memory_kb":3388,"score_of_the_acc":-0.8462,"final_rank":17},{"submission_id":"aoj_2410_4243912","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<ll,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1 << 30;\nconstexpr ll MOD = ll(1e9) + 7;\nconstexpr int di[] = {0, 1, 0, -1};\nconstexpr int dj[] = {1, 0, -1, 0};\nconstexpr double EPS = 1e-8;\n\nbool solve(){\n int n, q = 1000;\n cin >> n;\n vector<string> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> cnt(n, 1);\n for(int t=0;t<q;t++){\n int hnd = 0, maxi = 0;\n for(int i=0;i<n;i++){\n int scr = 0;\n for(int j=0;j<n;j++){\n if(a[i][j] == 'o') scr += 3*cnt[j];\n if(a[i][j ]== '-') scr += cnt[j];\n }\n if(scr > maxi){\n maxi = scr;\n hnd = i+1;\n }\n }\n cout << hnd << endl;\n int ai;\n cin >> ai;\n cnt[ai-1]+=5;\n }\n return false;\n}\n\nint main(){\n solve();\n // while(!solve());\n // int t; cin >> t; for(;t>0;t--) solve();\n return 0;\n}","accuracy":0.13513513513513514,"time_ms":10,"memory_kb":3388,"score_of_the_acc":-0.8462,"final_rank":17},{"submission_id":"aoj_2410_4146880","code_snippet":"// これはなに?\n#include<iostream>\n#include<random>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n char s[n][n];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n cin >> s[i][j];\n }\n }\n int e = rand()%n+1;\n for(int i = 0; i < 1000; i++){\n cout << e << endl;\n int x; cin >> x;\n if(s[e-1][x-1] == 'x') e = rand()%n+1;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3376,"score_of_the_acc":-0.6154,"final_rank":1},{"submission_id":"aoj_2410_4146878","code_snippet":"// これはなに?\n#include<iostream>\n#include<random>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n char s[n][n];\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n cin >> s[i][j];\n }\n }\n int e = rand()%n+1;\n for(int i = 0; i < 1000; i++){\n cout << 10 << endl;\n int x; cin >> x;\n if(s[x-1][e-1] == 'x') e = rand()%n+1;\n }\n return 0;\n}","accuracy":0.02702702702702703,"time_ms":10,"memory_kb":3360,"score_of_the_acc":-0.3077,"final_rank":20},{"submission_id":"aoj_2410_4146816","code_snippet":"#include<iostream>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n int me = -1, cnt = 0;\n for(int i = 0; i < n; i++){\n int tmp = 0;\n for(int j = 0; j < n; j++){\n char c; cin >> c;\n tmp += c=='o';\n }\n if(tmp > cnt) cnt = tmp, me = i;\n }\n me++;\n for(int i = 0; i < 1000; i++){\n cout << me << endl << flush;\n int x; cin >> x;\n }\n return 0;\n}","accuracy":0.4864864864864865,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.9231,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2410_5021796\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\n\\nclass Random {\\n\\tmt19937 engine;\\n\\trandom_device rd;\\n\\npublic:\\n\\tRandom() {\\n\\t\\tseed();\\n\\t}\\n\\tvoid seed() {\\n\\t\\tengine.seed(rd());\\n\\t}\\n\\tvoid seed(uint_fast32_t s) {\\n\\t\\tengine.seed(s);\\n\\t}\\n\\ttemplate <class T> T get(T l, T r) {\\n\\t\\tassert(l <= r);\\n\\t\\treturn uniform_int_distribution<T>(l, r)(engine);\\n\\t}\\n} rnd;\\n\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tVS s(n);\\n\\trep(i, n) cin >> s[i];\\n\\n\\tVI v;\\n\\trep(i, n) {\\n\\t\\tif (s[i].find('o') != string::npos) {\\n\\t\\t\\tv.push_back(i + 1);\\n\\t\\t}\\n\\t}\\n\\trep(i, 1000) {\\n\\t\\tcout << 10 << endl;\\n\\t\\tint x;\\n\\t\\tcin >> x;\\n\\t}\\n}\",\n \"accuracy\": 0.02702702702702703,\n \"time_ms\": 10,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.2308,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2410_4244189\",\n \"code_snippet\": \"/*\\nDear ToM,\\nCongratulations on your graduation!\\nYou did a great job!\\n ☆ﾟ*＠*ﾟ☆\\n (＠*｡☆｡*＠\\n /☆｡*＠ﾟ*☆\\n▲/／｡＠｡*☆＠*\\n ▼―ｰ｡*＠ﾟ*☆\\n*/\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,s,n) for(int i=s; i<n; ++i)\\n#define rep(i,n) REP(i,0,n)\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define IINF INT_MAX\\n#define LLINF LLONG_MAX\\n#define DEBUG false\\n\\ntypedef long long ll;\\ntypedef pair<int, int> ii;\\n\\nint main(){\\n\\tll n;\\n\\tcin >> n;\\n\\tvector<string> a(n);\\n\\trep(i, n) cin >> a[i];\\n\\n\\tint maxi_ind = 0;\\n\\tint maxi_e = 0;\\n\\trep(i, n){\\n\\t\\tint e = 0;\\n\\t\\trep(j, n){\\n\\t\\t\\tif(a[i][j] == '-') e += 1;\\n\\t\\t\\telse if(a[i][j] == 'o') e += 3;\\n\\t\\t}\\n\\t\\tif(e > maxi_e){\\n\\t\\t\\tmaxi_ind = i;\\n\\t\\t\\tmaxi_e = e;\\n\\t\\t}\\n\\t}\\n\\n\\tsrand((unsigned int)time(NULL)+1);\\n\\tint pre = 1;\\n\\trep(i, 1000){\\n\\t\\t//cout << (maxi_ind + 1) << endl;\\n\\t\\t//cout << (rand() % n + 1) << endl;\\n\\t\\tcout << pre << endl;\\n\\t\\tfflush(stdout);\\n\\n\\t\\t//int tmp;\\n\\t\\tcin >> pre;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.21621621621621623,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.6923,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2410_4244129\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n if(lose == rhs.lose)return win > rhs.win;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n int win = 0, tie = 0, lose = 0;\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int my_hand;\\n if(lose < 500){\\n int idx = rnd() % (int)(ans.size());\\n my_hand = ans[idx];\\n }else{\\n my_hand = rnd() % n + 1;\\n }\\n cout << my_hand << endl;\\n cin >> ai_hand;\\n if(v[my_hand-1][ai_hand-1] == -1)lose++;\\n else if(v[my_hand-1][ai_hand-1] == 0)tie++;\\n else win++;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2410_4244102\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n if(lose == rhs.lose)return win > rhs.win;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int hand = rnd() % (int)(ans.size());\\n cout << ans[hand] << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.4615,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2410_4244100\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n if(lose == rhs.lose)return win > rhs.win;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int hand = rnd() % (int)(ans.size());\\n cout << ans[0] << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.4615,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2410_4244096\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n if(lose == rhs.lose)return tie > rhs.tie;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int hand = rnd() % (int)(ans.size());\\n cout << ans[0] << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2410_4244094\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n if(lose == rhs.lose)return tie > rhs.tie;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int hand = rnd() % (int)(ans.size());\\n cout << ans[hand] << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.6923,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2410_4244092\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nstruct Hand{\\n int lose, win, tie, num;\\n bool operator<(const Hand &rhs)const{\\n //if(lose == rhs.lose)return tie > rhs.tie;\\n return lose < rhs.lose;\\n }\\n};\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n vector<Hand> hands;\\n for(int i=0;i<n;++i){\\n Hand h({0, 0, 0, 0});\\n h.num = i + 1;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)h.lose++;\\n else if(v[i][j] == 0)h.tie++;\\n else h.win++;\\n }\\n hands.push_back(h);\\n }\\n sort(hands.begin(), hands.end());\\n /*\\n for(auto e: hands){\\n cout << e.num << \\\" \\\" << e.win << \\\" \\\" << e.tie << \\\" \\\" << e.lose << endl;\\n }\\n */\\n vector<int> ans;\\n ans.push_back(hands[0].num);\\n for(int i=1;i<n;++i){\\n if(hands[i].lose == hands[0].lose)ans.push_back(hands[0].num);\\n else break;\\n }\\n random_device rnd;\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n int hand = rnd() % (int)(ans.size());\\n cout << ans[hand] << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.6923,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2410_4244049\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 0);\\n vector<int> pre;\\n for(int i=0;i<n;i++){\\n pre.push_back(i+1);\\n }\\n for(int t=0;t<q;t++){\\n int hnd = 1, maxi = -INF;\\n for(auto x : pre){\\n cnt[x]++;\\n }\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += 2*cnt[j];\\n else if(a[i][j]== '-') scr += cnt[j];\\n // else scr--;\\n // if(a[i][j] == 'x') scr-=cnt[j];\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n pre.push_back(ai-1);\\n if(pre.size() > 50) pre.erase(pre.begin());\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2410_4244029\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> v(n, vector<int>(n));\\n for(int i=0;i<n;++i){\\n for(int j=0;j<n;++j){\\n char c;\\n cin >> c;\\n if(c == '-')v[i][j] = 0;\\n else if(c == 'o')v[i][j] = 1;\\n else v[i][j] = -1;\\n }\\n }\\n int mini = n, hand = 0;\\n for(int i=0;i<n;++i){\\n int cnt = 0;\\n for(int j=0;j<n;++j){\\n if(v[i][j] == -1)cnt++;\\n }\\n if(cnt < mini){\\n mini = cnt;\\n hand = i + 1;\\n }\\n }\\n for(int i=0;i<1000;++i){\\n int ai_hand;\\n cout << hand << endl;\\n cin >> ai_hand;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2410_4244028\",\n \"code_snippet\": \"/*\\nDear ToM,\\nCongratulations on your graduation!\\nYou did a great job!\\n ☆ﾟ*＠*ﾟ☆\\n (＠*｡☆｡*＠\\n /☆｡*＠ﾟ*☆\\n▲/／｡＠｡*☆＠*\\n ▼―ｰ｡*＠ﾟ*☆\\n*/\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i,s,n) for(int i=s; i<n; ++i)\\n#define rep(i,n) REP(i,0,n)\\n#define SORT(c) sort((c).begin(),(c).end())\\n#define IINF INT_MAX\\n#define LLINF LLONG_MAX\\n#define DEBUG false\\n\\ntypedef long long ll;\\ntypedef pair<int, int> ii;\\n\\nint main(){\\n\\tll n;\\n\\tcin >> n;\\n\\tvector<string> a(n);\\n\\trep(i, n) cin >> a[i];\\n\\n\\tint maxi_ind = 0;\\n\\tint maxi_e = 0;\\n\\trep(i, n){\\n\\t\\tint e = 0;\\n\\t\\trep(j, n){\\n\\t\\t\\tif(a[i][j] == '-') e += 1;\\n\\t\\t\\telse if(a[i][j] == 'o') e += 3;\\n\\t\\t}\\n\\t\\tif(e > maxi_e){\\n\\t\\t\\tmaxi_ind = i;\\n\\t\\t\\tmaxi_e = e;\\n\\t\\t}\\n\\t}\\n\\n\\trep(i, 1000){\\n\\t\\tcout << (maxi_ind + 1) << endl;\\n\\t\\tfflush(stdout);\\n\\n\\t\\tint tmp;\\n\\t\\tcin >> tmp;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -1,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2410_4243943\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 1, maxi = -INF;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n // if(a[i][j] == 'o') scr += 2*cnt[j];\\n // else if(a[i][j]== '-') scr += cnt[j];\\n // else scr--;\\n if(a[i][j] == 'x') scr-=cnt[j];\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]++;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.6923,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2410_4243941\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 1, maxi = 0;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += cnt[j];\\n else if(a[i][j]== '-') scr += cnt[j];\\n else scr-=2;\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]+=1;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.1891891891891892,\n \"time_ms\": 10,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.8462,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2410_4243935\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 1, maxi = 0;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += 2*cnt[j];\\n else if(a[i][j]== '-') scr += cnt[j];\\n else scr--;\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]++;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.4615,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2410_4243927\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 1, maxi = 0;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += 2*cnt[j];\\n else if(a[i][j]== '-') scr += cnt[j];\\n else scr--;\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]+=5;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 10,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": 0,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2410_4243917\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 0, maxi = 0;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += 3*cnt[j];\\n if(a[i][j ]== '-') scr += cnt[j];\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]+=100;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 10,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.8462,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2410_4243912\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long int;\\nusing P = pair<int, int>;\\nusing P3 = pair<ll,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF = 1 << 30;\\nconstexpr ll MOD = ll(1e9) + 7;\\nconstexpr int di[] = {0, 1, 0, -1};\\nconstexpr int dj[] = {1, 0, -1, 0};\\nconstexpr double EPS = 1e-8;\\n\\nbool solve(){\\n int n, q = 1000;\\n cin >> n;\\n vector<string> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n vector<int> cnt(n, 1);\\n for(int t=0;t<q;t++){\\n int hnd = 0, maxi = 0;\\n for(int i=0;i<n;i++){\\n int scr = 0;\\n for(int j=0;j<n;j++){\\n if(a[i][j] == 'o') scr += 3*cnt[j];\\n if(a[i][j ]== '-') scr += cnt[j];\\n }\\n if(scr > maxi){\\n maxi = scr;\\n hnd = i+1;\\n }\\n }\\n cout << hnd << endl;\\n int ai;\\n cin >> ai;\\n cnt[ai-1]+=5;\\n }\\n return false;\\n}\\n\\nint main(){\\n solve();\\n // while(!solve());\\n // int t; cin >> t; for(;t>0;t--) solve();\\n return 0;\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 10,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.8462,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2410_4146880\",\n \"code_snippet\": \"// これはなに?\\n#include<iostream>\\n#include<random>\\nusing namespace std;\\n\\nint main(){\\n int n;\\n cin >> n;\\n char s[n][n];\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++){\\n cin >> s[i][j];\\n }\\n }\\n int e = rand()%n+1;\\n for(int i = 0; i < 1000; i++){\\n cout << e << endl;\\n int x; cin >> x;\\n if(s[e-1][x-1] == 'x') e = rand()%n+1;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.6154,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2410_4146878\",\n \"code_snippet\": \"// これはなに?\\n#include<iostream>\\n#include<random>\\nusing namespace std;\\n\\nint main(){\\n int n;\\n cin >> n;\\n char s[n][n];\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++){\\n cin >> s[i][j];\\n }\\n }\\n int e = rand()%n+1;\\n for(int i = 0; i < 1000; i++){\\n cout << 10 << endl;\\n int x; cin >> x;\\n if(s[x-1][e-1] == 'x') e = rand()%n+1;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.02702702702702703,\n \"time_ms\": 10,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.3077,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2410_4146816\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint main(){\\n int n;\\n cin >> n;\\n int me = -1, cnt = 0;\\n for(int i = 0; i < n; i++){\\n int tmp = 0;\\n for(int j = 0; j < n; j++){\\n char c; cin >> c;\\n tmp += c=='o';\\n }\\n if(tmp > cnt) cnt = tmp, me = i;\\n }\\n me++;\\n for(int i = 0; i < 1000; i++){\\n cout << me << endl << flush;\\n int x; cin >> x;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.4864864864864865,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.9231,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1376,"cells":{"group_id":{"kind":"string","value":"aoj_2412_cpp"},"problem_description":{"kind":"string","value":"G - 村\n問題文\nきつねのしえるは，休暇でとある小さな村を訪れている．彼女が驚いたのは，その村の表札がもつ性質である．\n村には\nN\n個の家屋がある．ここでは簡単のため，村は 2 次元平面であるとし，家屋はこの平面上の点であると見なす．\nそれぞれの家屋には表札が 1 個設けられており，その家の苗字を表していた．しえるは村の中を訪問するにつれて，この村の表札が次のような性質を持っていることに気付いた．\nある実数\nR\nが存在する．\nもし 2 つの家屋の距離が\nR\n以下であるなら，その 2 つの家屋は同じ表札を持つ．\nもし 2 つの家屋の距離が\n3R\n以上であるなら，その 2 つの家屋は異なる表札を持つ．\n任意の 2 つの家屋の距離は\nR\n以下であるか\n3R\n以上であるかのどちらかである．\nここで，家屋同士の距離は，平面上のユークリッド距離によって計測するものとする．\nしえるはこの村に表札が全部で何種類あるのかが気になったが，この村は意外に広いということに気付いたので，計算機を使ってこの答えを模索することにした．\n入力形式\n入力は以下の形式で与えられる．\nN\nR\nx\n1\ny\n1\nx\n2\ny\n2\n...\nx\nN\ny\nN\nN\nは家屋の個数である．\nR\nは家屋の配置の制約に関する値である．\n(x\ni\n, y\ni\n)\nは家屋\ni\nの座標を表す．\n出力形式\n村に存在する表札の種類の数を求めよ．\n制約\n1 ≤ N ≤ 2 × 10\n5\n1 ≤ R ≤ 10\n3\n|x\ni\n|, |y\ni\n| ≤ 10\n6\nN\nは整数である．\nR, x\ni\n, y\ni\nは実数で，小数第 3 位まで表される．\n任意の\n1 ≤ i < j ≤ N\nに対して\nd\nij\n= √{(x\ni\n- x\nj\n)\n2\n+ (y\ni\n- y\nj\n)\n2\n}\nとおくとき，\nd\nij\n≤ R\nか\n3R ≤ d\nij\nのどちらかが満たされる．\nこの問題の判定には，15 点分のテストケースのグループが設定されている． このグループに含まれるテストケースは上記の制約に加えて下記の制約も満たす．\n答えは 10 以下である．\n入出力例\n入力例 1\n5 3.000\n1.000 0.000\n0.000 0.000\n-1.000 0.000\n10.000 0.000\n-10.000 0.000\n出力例 1\n3\n家屋 1,2,3 と家屋 4 と家屋 5 で表札が異なる．全体で 3 つの表札が存在する．\n入力例 2\n12 1.234\n0.500 0.000\n-0.500 0.000\n0.000 0.000\n0.000 -0.500\n55.500 55.000\n-55.500 55.000\n55.000 55.000\n55.000 -55.500\n99.500 99.000\n-99.500 99.000\n99.000 99.000\n99.000 -99.500\n出力例 2\n7\n入力例 3\n5 99.999\n0.000 0.000\n49.999 0.001\n0.000 0.000\n-49.999 -0.001\n0.000 0.000\n出力例 3\n1\nWriter: 楠本充\nTester: 小浜翔太郎"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2412_10916185","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <cstdint>\nusing namespace std;\n\nstruct DSU {\n vector<int> p, sz;\n DSU(int n) : p(n), sz(n, 1) { for (int i = 0; i < n; ++i) p[i] = i; }\n int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }\n void unite(int a, int b) {\n a = find(a); b = find(b);\n if (a == b) return;\n if (sz[a] < sz[b]) swap(a, b);\n p[b] = a; sz[a] += sz[b];\n }\n};\n\nstruct PairHash {\n size_t operator()(const pair<long long,long long>& v) const {\n return hash<long long>()((v.first<<32) ^ v.second);\n }\n};\n\nlong long parseScaled(const string& s) {\n int sign = 1;\n size_t i = 0;\n if (s[i] == '-') { sign = -1; i++; }\n long long ip = 0, fp = 0;\n while (i < s.size() && s[i] != '.') { ip = ip*10 + (s[i]-'0'); i++; }\n if (i < s.size() && s[i] == '.') {\n i++;\n int k = 0;\n while (i < s.size() && k < 3 && s[i] != ' ') { fp = fp*10 + (s[i]-'0'); i++; k++; }\n while (k < 3) { fp *= 10; k++; }\n } else {\n fp = 0;\n }\n return sign * (ip*1000 + fp);\n}\n\nlong long floor_div(long long a, long long b) {\n if (a >= 0) return a / b;\n return - ((-a + b - 1) / b);\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N;\n string Rs;\n if (!(cin >> N >> Rs)) return 0;\n long long R = parseScaled(Rs);\n long long R2 = R * R;\n\n vector<long long> x(N), y(N);\n for (int i = 0; i < N; ++i) {\n string xs, ys;\n cin >> xs >> ys;\n x[i] = parseScaled(xs);\n y[i] = parseScaled(ys);\n }\n\n DSU dsu(N);\n unordered_map<pair<long long,long long>, vector<int>, PairHash> cells;\n cells.reserve(N*2);\n\n for (int i = 0; i < N; ++i) {\n long long cx = floor_div(x[i], R);\n long long cy = floor_div(y[i], R);\n bool linked = false;\n for (int dx = -1; dx <= 1 && !linked; ++dx) {\n for (int dy = -1; dy <= 1 && !linked; ++dy) {\n auto it = cells.find({cx + dx, cy + dy});\n if (it == cells.end()) continue;\n const vector<int>& vec = it->second;\n for (int j : vec) {\n long long dxv = x[i] - x[j];\n long long dyv = y[i] - y[j];\n if (dxv*dxv + dyv*dyv <= R2) {\n dsu.unite(i, j);\n linked = true;\n break;\n }\n }\n }\n }\n cells[{cx, cy}].push_back(i);\n }\n\n int cnt = 0;\n for (int i = 0; i < N; ++i) if (dsu.find(i) == i) cnt++;\n cout << cnt << '\\n';\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":28020,"score_of_the_acc":-0.8016,"final_rank":8},{"submission_id":"aoj_2412_5960351","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};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int n; double r;\n cin >> n >> r;\n set<pair<int, int>> st;int ans = 0;\n REP(i,n) {\n double x, y; cin >> x >> y;\n x = floor(x/r), y = floor(y/r);\n bool f = false;\n for(int j=-1; j<=1; j++) {\n for(int k=-1; k<=1; k++) {\n if(st.find({x+j,y+k}) != st.end()) f = true;\n }\n }\n if(!f) ans++;\n st.insert({x, y});\n }\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":12040,"score_of_the_acc":-0.2562,"final_rank":4},{"submission_id":"aoj_2412_3051998","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <utility>\nusing namespace std;\nint dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint dy[8] = {-1, 0, 1, -1, 1, -1, 0 ,1};\n\nvoid dfs(pair<int, int> curr, set<pair<int, int> > &block){\n if(block.find(curr) == block.end()) return;\n block.erase(curr);\n for(int i=0; i<8; i++){\n dfs(make_pair(curr.first +dx[i], curr.second +dy[i]), block);\n }\n}\n\nint main(){\n int n;\n double r;\n cin >> n >> r;\n\n set<pair<int, int> > block; \n for(int i=0; i<n; i++){\n double x,y;\n cin >> x >> y;\n int xi = (x +1e6)/r;\n int yi = (y +1e6)/r;\n block.insert(make_pair(xi, yi));\n }\n\n int ans = 0;\n while(!block.empty()){\n ans++;\n pair<int, int> curr = *(block.begin());\n dfs(curr, block);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":11716,"score_of_the_acc":-0.2498,"final_rank":3},{"submission_id":"aoj_2412_2948812","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\nint n;\ndouble r;\nvector<pair<int,int> > vec; \nset<pair<int,int> > visited;\nset<pair<int,int> > exist;\n\nint main(){\n \n scanf(\"%d%lf\", &n,&r);\n\n for(int i=0;i<n;i++){\n double x,y;\n scanf(\"%lf%lf\", &x, &y);\n if(x >= 0) x += r;\n if(y >= 0) y += r;\n vec.push_back({x/r, y/r});\n exist.insert(vec[i]);\n }\n\n int ans = 0;\n\n int dx[8] = {0,0,1,-1,1,1,-1,-1};\n int dy[8] = {1,-1,0,0,1,-1,1,-1};\n \n for(int i=0;i<n;i++){\n if(visited.find(vec[i]) != visited.end())\n continue;\n\n ans++;\n\n queue<pair<int,int> > que;\n que.push(vec[i]);\n while(que.size()){\n auto p = que.front();\n que.pop();\n \n if(visited.find(p) != visited.end()) continue;\n visited.insert(p);\n \n for(int j=0;j<8;j++){\n if(exist.find({p.first + dx[j], p.second + dy[j]}) != exist.end())\n que.push({p.first + dx[j], p.second + dy[j]});\n }\n }\n }\n\n cout << ans << endl;\n \n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":21416,"score_of_the_acc":-0.6456,"final_rank":7},{"submission_id":"aoj_2412_2807258","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//// < \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\a.txt\" > \"d:\\d_download\\visual studio 2015\\projects\\programing_contest_c++\\debug\\b.txt\"\n\n\nint main() {\n\tint N;cin>>N;\n\tld R;cin>>R;\n\tvector<pair<ld,ld>>houses;\n\tfor (int i = 0; i < N; ++i) {\n\t\tld a,b;cin>>a>>b;\n\t\thouses.push_back(make_pair(a,b));\n\t}\n\n\tint ans=0;\n\tvector<int>used(N,false);\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (!used[i]) {\n\t\t\tans++;\n\t\t\tused[i]=true;\n\t\t\tfor (int j = 0; j < N; ++j) {\n\t\t\t\tif (!used[j]) {\n\t\t\t\t\tld dx=houses[i].first-houses[j].first;\n\t\t\t\t\tld dy=houses[i].second-houses[j].second;\n\t\t\t\t\tld len=dx*dx+dy*dy;\n\t\t\t\t\tif (len <= R*R) {\n\t\t\t\t\t\tused[j]=true;\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\treturn 0;\n}","accuracy":0.4090909090909091,"time_ms":200,"memory_kb":11348,"score_of_the_acc":-0.2163,"final_rank":18},{"submission_id":"aoj_2412_2667097","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 pl = pair<ll,ll>;\n\nstruct UF{\n int n;\n //正だったらその頂点の親,負だったら根で連結成分の個数\n vector<int> d;\n UF() {}\n UF(int N):n(N), d(N,-1){}\n int root(int v){\n if(d[v]<0) return v;\n return d[v]=root(d[v]);\n }\n bool unite(int X,int Y){\n X=root(X); Y=root(Y);\n if(X==Y) return false;\n if(size(X) < size(Y)) swap(X,Y);\n d[X]+=d[Y];\n d[Y]=X;\n return true;\n }\n int size(int v){ return -d[root(v)]; }\n bool same(int X,int Y){ return root(X)==root(Y); }\n};\n\nll read()\n{\n string s;\n cin >>s;\n\n int m = 1;\n if(s[0]=='-')\n {\n m = -1;\n s = s.substr(1);\n }\n\n int S = s.size();\n ll ret = atoll(s.substr(0,S-4).c_str())*1000 + atoll(s.substr(S-3).c_str());\n\n return m*ret;\n}\n\nint main()\n{\n int n;\n scanf(\" %d\", &n);\n\n ll R = read();\n\n vector<pl> p(n);\n rep(i,n)\n {\n ll x=read(), y=read();\n p[i] = {x,y};\n }\n sort(all(p));\n\n UF uf(n);\n int idx = 0;\n set<pl> now;\n rep(i,n)\n {\n while(idx<n && p[idx].fi<=p[i].fi+R)\n {\n now.insert({p[idx].se,idx});\n ++idx;\n }\n\n auto itr = now.lower_bound({p[i].se-R,-1});\n while(itr!=now.end() && itr->fi<=p[i].se+R)\n {\n int id = itr->se;\n uf.unite(i,id);\n itr = now.erase(itr);\n }\n }\n\n set<int> s;\n rep(i,n) s.insert(uf.root(i));\n cout << s.size() << endl;\n return 0;\n}","accuracy":1,"time_ms":400,"memory_kb":19328,"score_of_the_acc":-0.5705,"final_rank":5},{"submission_id":"aoj_2412_2667076","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 pl = pair<ll,ll>;\n\nstruct UF{\n int n;\n //正だったらその頂点の親,負だったら根で連結成分の個数\n vector<int> d;\n UF() {}\n UF(int N):n(N), d(N,-1){}\n int root(int v){\n if(d[v]<0) return v;\n return d[v]=root(d[v]);\n }\n bool unite(int X,int Y){\n X=root(X); Y=root(Y);\n if(X==Y) return false;\n if(size(X) < size(Y)) swap(X,Y);\n d[X]+=d[Y];\n d[Y]=X;\n return true;\n }\n int size(int v){ return -d[root(v)]; }\n bool same(int X,int Y){ return root(X)==root(Y); }\n};\n\nll read()\n{\n double t;\n scanf(\" %lf\", &t);\n return t*1000;\n}\n\nint main()\n{\n int n;\n scanf(\" %d\", &n);\n\n ll R = read();\n\n vector<pl> p(n);\n rep(i,n)\n {\n ll x=read(), y=read();\n p[i] = {x,y};\n }\n sort(all(p));\n\n UF uf(n);\n int idx = 0;\n set<pl> now;\n rep(i,n)\n {\n while(idx<n && p[idx].fi<=p[i].fi+R)\n {\n now.insert({p[idx].se,idx});\n ++idx;\n }\n\n auto itr = now.lower_bound({p[i].se-R,-1});\n while(itr!=now.end() && itr->fi<=p[i].se+R)\n {\n int id = itr->se;\n uf.unite(i,id);\n itr = now.erase(itr);\n }\n }\n\n set<int> s;\n rep(i,n) s.insert(uf.root(i));\n cout << s.size() << endl;\n return 0;\n}","accuracy":0.5303030303030303,"time_ms":120,"memory_kb":9496,"score_of_the_acc":-0.1246,"final_rank":14},{"submission_id":"aoj_2412_2667073","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 pl = pair<ll,ll>;\n\nstruct UF{\n int n;\n //正だったらその頂点の親,負だったら根で連結成分の個数\n vector<int> d;\n UF() {}\n UF(int N):n(N), d(N,-1){}\n int root(int v){\n if(d[v]<0) return v;\n return d[v]=root(d[v]);\n }\n bool unite(int X,int Y){\n X=root(X); Y=root(Y);\n if(X==Y) return false;\n if(size(X) < size(Y)) swap(X,Y);\n d[X]+=d[Y];\n d[Y]=X;\n return true;\n }\n int size(int v){ return -d[root(v)]; }\n bool same(int X,int Y){ return root(X)==root(Y); }\n};\n\nll read()\n{\n double t;\n scanf(\" %lf\", &t);\n return t*1000;\n}\n\nint main()\n{\n int n;\n scanf(\" %d\", &n);\n\n ll R = read();\n\n vector<pl> p(n);\n rep(i,n)\n {\n ll x=read(), y=read();\n p[i] = {x,y};\n }\n sort(all(p));\n\n UF uf(n);\n int idx = 0;\n set<pl> now;\n vector<bool> vis(n);\n rep(i,n)if(!vis[i])\n {\n vis[i] = true;\n while(idx<n && p[idx].fi<=p[i].fi+R)\n {\n now.insert({p[idx].se,idx});\n ++idx;\n }\n\n auto itr = now.lower_bound({p[i].se-R,-1});\n while(itr!=now.end() && itr->fi<=p[i].se+R)\n {\n int id = itr->se;\n uf.unite(i,id);\n vis[id]=true;\n itr = now.erase(itr);\n }\n }\n\n set<int> s;\n rep(i,n) s.insert(uf.root(i));\n cout << s.size() << endl;\n return 0;\n}","accuracy":0.5303030303030303,"time_ms":120,"memory_kb":9448,"score_of_the_acc":-0.1228,"final_rank":13},{"submission_id":"aoj_2412_2592809","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\ntypedef pair<int,int> Point;\n\nint diff_x[8] = {-1,0,1,-1,1,-1,0,1},diff_y[8] = {-1,-1,-1,0,0,1,1,1};\nset<Point> SET;\n\nint main(){\n\n\tint N;\n\tdouble R;\n\n\tscanf(\"%d %lf\",&N,&R);\n\n\tdouble tmp_x,tmp_y;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lf %lf\",&tmp_x,&tmp_y);\n\t\tSET.insert(Point((int)(tmp_x/R),(int)(tmp_y/R)));\n\t}\n\n\tint ans = 0;\n\n\twhile(SET.size() != 0){\n\t\tset<Point>::iterator it = SET.begin();\n\t\tPoint point = *it;\n\t\tSET.erase(it);\n\t\tans++;\n\t\tfor(int i = 0; i < 8; i++){\n\t\t\tPoint tmp = Point(point.first + diff_x[i],point.second + diff_y[i]);\n\t\t\tit = SET.find(tmp);\n\t\t\tif(it != SET.end())SET.erase(it);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}","accuracy":1,"time_ms":150,"memory_kb":11712,"score_of_the_acc":-0.2157,"final_rank":2},{"submission_id":"aoj_2412_2294887","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<double,double> P;\ntypedef pair<int,int> PP;\n \ndouble D(P a,P b) {return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));}\nconst int N=222222;\nint p[N],r[N];\nvoid init(){for(int i=0; i<N; i++) p[i]=i,r[i]=0;}\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\nvoid unite(int x,int y) {\n x=find(x),y=find(y);\n if(x==y)return;\n if(r[x]<r[y])p[x]=y;\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\n}\n \nint main() {\n init();\n int n;\n double d;\n cin>>n>>d;\n P a[n];\n for(int i=0; i<n; i++) cin>>a[i].F>>a[i].S;\n map<PP,int> m;\n for(int i=0; i<n; i++) {\n int x=floor(a[i].F/d),y=floor(a[i].S/d);\n for(int dx=-1; dx<2; dx++)for(int dy=-1; dy<2; dy++)if(m.count(PP(x+dx,y+dy))) unite(i,m[PP(x+dx,y+dy)]);\n m[PP(x,y)]=i;\n }\n set<int> s;\n for(int i=0; i<n; i++) s.insert(find(i));\n cout<<s.size()<<endl;\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":26912,"score_of_the_acc":-0.8705,"final_rank":10},{"submission_id":"aoj_2412_2293934","code_snippet":"#include<bits/stdc++.h>\n#define EPS (1e-8)\n#define N_MAX 200005\nusing namespace std;\ntypedef double ll;\n\nint N;\nll R,x[N_MAX],y[N_MAX];\nbool used[N_MAX];\n\nstruct node{\n vector<ll> Point;\n int l,r;\n node(){}\n node(vector<ll> a){Point=a,l=r=-1;}\n};\n\nconst int K=2;// K:?¬??????°\nint D;// D:?????????????????????????????????????¬????\nvector<vector<ll> > P;// ???????????????????´????K+1???(K???????¬????????????????????????????number)\nvector<node> G;\n\nbool compare(const vector<ll> &A,const vector<ll> &B){return A[D]<B[D];}\n\nint make_tree(int depth,int l,int r){\n if(l>r)return -1;\n D=depth%K;\n sort(P.begin()+l,P.begin()+r+1,compare);\n int m=(l+r)/2,res=G.size();\n G.push_back(node(P[m]));\n\n int vl=make_tree(depth+1,l,m-1);\n int vr=make_tree(depth+1,m+1,r);\n\n G[res].l=vl; G[res].r=vr;\n return res;\n}\n\nvector<int> num;// search??§?????????????????¨?????§????????????number????????????\n\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\n bool f=true;\n for(int i=0;i<K;i++)\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\n\n if(f)num.push_back(G[x].Point[K]);\n\n D=depth%K;\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\n D=depth%K;\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\n}\n\nint main(){\n \n cin>>N>>R;\n \n P.resize(N);\n \n for(int i=0;i<N;i++){\n \n scanf(\"%lf %lf\",&x[i],&y[i]);\n \n P[i].resize(K+1);\n \n P[i][K]=i;\n P[i][0]=x[i],P[i][1]=y[i];\n }\n \n make_tree(0,0,P.size()-1);\n \n int ans=0;\n for(int i=0;i<N;i++){\n \n if(used[i])continue;\n \n vector<ll> L2(K),R2(K);\n \n L2[0]=x[i]-R-EPS;\n R2[0]=x[i]+R+EPS;\n \n L2[1]=y[i]-R-EPS;\n R2[1]=y[i]+R+EPS;\n \n num.clear();\n \n search(0,0,L2,R2);\n \n for(int j=0;j<num.size();j++) used[num[j]]=1;\n \n ans++;\n }\n \n cout<<ans<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":3610,"memory_kb":31360,"score_of_the_acc":-1.9263,"final_rank":12},{"submission_id":"aoj_2412_2293930","code_snippet":"#include<bits/stdc++.h>\n#define EPS (1e-8)\n#define N_MAX 200005\nusing namespace std;\ntypedef double ll;\n\nint N;\nll R,x[N_MAX],y[N_MAX];\nbool used[N_MAX];\n\nstruct node{\n vector<ll> Point;\n int l,r;\n node(){}\n node(vector<ll> a){Point=a,l=r=-1;}\n};\n\nconst int K=2;// K:テヲツャツ。テ・ツ?εヲツ閉ー\nint D;// D:テ」ツ?敕」ツ?ョテヲツ卍づ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ凝・ツ淞コテヲツコツ姪」ツ?ョテヲツャツ。テ・ツ??\nvector<vector<ll> > P;// テ」ツ?敕」ツつ古」ツ?榲」ツつ古」ツ?ョティツヲツ?ァツエツ?」ツ?ッK+1テ・ツ??Kテ・ツ?凝」ツ?ョテヲツャツ。テ・ツ?ε」ツ?ョテァツ閉ェテ・ツ渉キテッツシツ凝、ツサツ佚」ツ?妥」ツ?淌」ツ??umber)\nvector<node> G;\n\nbool compare(const vector<ll> &A,const vector<ll> &B){return A[D]<B[D];}\n\nint make_tree(int depth,int l,int r){\n if(l>r)return -1;\n D=depth%K;\n sort(P.begin()+l,P.begin()+r+1,compare);\n int m=(l+r)/2,res=G.size();\n G.push_back(node(P[m]));\n\n int vl=make_tree(depth+1,l,m-1);\n int vr=make_tree(depth+1,m+1,r);\n\n G[res].l=vl; G[res].r=vr;\n return res;\n}\n\nvector<int> num;// searchテ」ツ?ァティツヲツ凝」ツ?、テ」ツ?妥」ツつ凝」ツ?禿」ツ?ィテ」ツ?古」ツ?ァテ」ツ?催」ツ?淌ァツつケテ」ツ?ョnumberテ」ツつ津」ツ??」ツつ古」ツつ?\n\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\n bool f=true;\n for(int i=0;i<K;i++)\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\n\n if(f)num.push_back(G[x].Point[K]);\n\n D=depth%K;\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\n D=depth%K;\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\n}\n\nint main(){\n \n cin>>N>>R;\n \n P.resize(N);\n \n for(int i=0;i<N;i++){\n \n scanf(\"%lf %lf\",&x[i],&y[i]);\n \n P[i].resize(K+1);\n \n P[i][K]=i;\n P[i][0]=x[i],P[i][1]=y[i];\n }\n \n make_tree(0,0,P.size()-1);\n \n int ans=0;\n for(int i=0;i<N;i++){\n \n if(used[i])continue;\n \n vector<ll> L2(K),R2(K);\n \n L2[0]=x[i]-R-EPS;\n R2[0]=x[i]+R+EPS;\n \n L2[1]=y[i]-R-EPS;\n R2[1]=y[i]+R+EPS;\n \n num.clear();\n \n search(0,0,L2,R2);\n \n for(int j=0;j<num.size();j++) used[num[j]]=1;\n \n ans++;\n }\n \n cout<<ans<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":3560,"memory_kb":31472,"score_of_the_acc":-1.9163,"final_rank":11},{"submission_id":"aoj_2412_2293915","code_snippet":"#include<bits/stdc++.h>\n#define N_MAX 200005\nusing namespace std;\ntypedef double ll;\n\nint N;\nll R,x[N_MAX],y[N_MAX];\nbool used[N_MAX];\n\nstruct node{\n vector<ll> Point;\n int l,r;\n node(){}\n node(vector<ll> a){Point=a,l=r=-1;}\n};\n\nconst int K=2;// K:テヲツャツ。テ・ツ?εヲツ閉ー\nint D;// D:テ」ツ?敕」ツ?ョテヲツ卍づ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ凝・ツ淞コテヲツコツ姪」ツ?ョテヲツャツ。テ・ツ??\nvector<vector<ll> > P;// テ」ツ?敕」ツつ古」ツ?榲」ツつ古」ツ?ョティツヲツ?ァツエツ?」ツ?ッK+1テ・ツ??Kテ・ツ?凝」ツ?ョテヲツャツ。テ・ツ?ε」ツ?ョテァツ閉ェテ・ツ渉キテッツシツ凝、ツサツ佚」ツ?妥」ツ?淌」ツ??umber)\nvector<node> G;\n\nbool compare(vector<ll> A,vector<ll> B){return A[D]<B[D];}\n\nint make_tree(int depth,int l,int r){\n if(l>r)return -1;\n D=depth%K;\n sort(P.begin()+l,P.begin()+r+1,compare);\n int m=(l+r)/2,res=G.size();\n G.push_back(node(P[m]));\n\n int vl=make_tree(depth+1,l,m-1);\n int vr=make_tree(depth+1,m+1,r);\n\n G[res].l=vl; G[res].r=vr;\n return res;\n}\n\nvector<int> num;// searchテ」ツ?ァティツヲツ凝」ツ?、テ」ツ?妥」ツつ凝」ツ?禿」ツ?ィテ」ツ?古」ツ?ァテ」ツ?催」ツ?淌ァツつケテ」ツ?ョnumberテ」ツつ津」ツ??」ツつ古」ツつ?\n\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\n bool f=true;\n for(int i=0;i<K;i++)\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\n\n if(f)num.push_back(G[x].Point[K]);\n\n D=depth%K;\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\n D=depth%K;\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\n}\n\nint main(){\n \n cin>>N>>R;\n \n P.resize(N);\n \n for(int i=0;i<N;i++){\n \n cin>>x[i]>>y[i];\n \n P[i].resize(K+1);\n \n P[i][K]=i;\n P[i][0]=x[i],P[i][1]=y[i];\n }\n \n make_tree(0,0,P.size()-1);\n \n int ans=0;\n for(int i=0;i<N;i++){\n \n if(used[i])continue;\n \n vector<ll> L2(K),R2(K);\n \n L2[0]=x[i]-R;\n R2[0]=x[i]+R;\n \n L2[1]=y[i]-R;\n R2[1]=y[i]+R;\n \n num.clear();\n \n search(0,0,L2,R2);\n \n for(int j=0;j<num.size();j++) used[num[j]]=1;\n ans++;\n }\n \n cout<<ans<<endl;\n\n return 0;\n}","accuracy":0.5303030303030303,"time_ms":2320,"memory_kb":33336,"score_of_the_acc":-1.6356,"final_rank":15},{"submission_id":"aoj_2412_2293681","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<double,double> P;\ntypedef pair<int,int> PP;\n\ndouble D(P a,P b) {\n return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));\n}\n\nint p[222222],r[222222];\nvoid init(){for(int i=0; i<222222; i++) p[i]=i,r[i]=0;}\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\nvoid unite(int x,int y) {\n x=find(x),y=find(y);\n if(x==y)return;\n if(r[x]<r[y])p[x]=y;\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\n}\n\nint main() {\n init();\n int n;\n double d;\n cin >> n >> d;\n P a[n];\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\n map<PP,int> m;\n for(int i=0; i<n; i++) {\n int x=floor(a[i].F/d),y=floor(a[i].S/d);\n for(int dx=-1; dx<2; dx++) {\n for(int dy=-1; dy<2; dy++) {\n if(m.count(PP(x+dx,y+dy))) unite(i,m[PP(x+dx,y+dy)]);\n }\n }\n m[PP(x,y)]=i;\n }\n set<int> s;\n for(int i=0; i<n; i++) s.insert(find(i));\n cout << s.size() << endl;\n return 0;\n}","accuracy":1,"time_ms":430,"memory_kb":26976,"score_of_the_acc":-0.8644,"final_rank":9},{"submission_id":"aoj_2412_2293453","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define F first\n#define S second\ntypedef pair<double,double> P;\n\ndouble D(P a,P b) {\n return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));\n}\n\nint main() {\n int n;\n double r;\n cin >> n >> r;\n P a[n];\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\n bool u[n];\n memset(u,0,sizeof(u));\n int ans=0;\n for(int i=0; i<n; i++) {\n if(u[i]) continue;\n u[i]=1;\n ans++;\n for(int j=i+1; j<n; j++) {\n if(u[j]) continue;\n if(D(a[i],a[j])<=r) u[j]=1;\n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":0.4090909090909091,"time_ms":180,"memory_kb":6536,"score_of_the_acc":-0.0311,"final_rank":16},{"submission_id":"aoj_2412_2164546","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<tuple>\nusing namespace std;\nclass UnionFind {\nprivate:\n\tunsigned size_; std::vector<unsigned> par, rank;\npublic:\n\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\n\tUnionFind(unsigned size__) : size_(size__) {\n\t\tpar.resize(size_); rank.resize(size_);\n\t\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\n\t}\n\tunsigned size() { return size_; }\n\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\n\tvoid unite(unsigned x, unsigned y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) par[x] = y;\n\t\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\n\t\telse par[y] = x;\n\t}\n\tbool operator==(const UnionFind &u) { return par == u.par; }\n\tbool operator!=(const UnionFind &u) { return par != u.par; }\n};\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\nbool used[200000]; tuple<long double, long double, int>p[200000];\nlong double dst(long double px, long double py, long double qx, long double qy) {\n\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\n}\nint main() {\n\tcin >> n >> R; int ans = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i] >> y[i];\n\t\tx[i] *= r2; y[i] *= r2;\n\t\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\n\t\tx[i] -= J2; y[i] += J1; p[i] = make_tuple(x[i], y[i], i);\n\t}\n\tsort(p, p + n); UnionFind UF(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tif (used[i] == true)continue; ans++; used[i] = true;\n\t\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\n\t\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\n\t\tfor (int j = pos1; j < pos2; j++) {\n\t\t\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R*1.001l) {\n\t\t\t\tif (UF.same(i, get<2>(p[j])) == false) {\n\t\t\t\t\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\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":420,"memory_kb":20316,"score_of_the_acc":-0.613,"final_rank":6},{"submission_id":"aoj_2412_2164536","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<tuple>\nusing namespace std;\nclass UnionFind {\nprivate:\n\tunsigned size_; std::vector<unsigned> par, rank;\npublic:\n\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\n\tUnionFind(unsigned size__) : size_(size__) {\n\t\tpar.resize(size_); rank.resize(size_);\n\t\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\n\t}\n\tunsigned size() { return size_; }\n\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\n\tvoid unite(unsigned x, unsigned y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) par[x] = y;\n\t\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\n\t\telse par[y] = x;\n\t}\n\tbool operator==(const UnionFind &u) { return par == u.par; }\n\tbool operator!=(const UnionFind &u) { return par != u.par; }\n};\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\nbool used[200000]; tuple<long double, long double, int>p[200000];\nlong double dst(long double px, long double py, long double qx, long double qy) {\n\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\n}\nint main() {\n\tcin >> n >> R; int ans = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i] >> y[i];\n\t\tx[i] *= r2; y[i] *= r2;\n\t\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\n\t\tx[i] -= J1; y[i] += J2; p[i] = make_tuple(x[i], y[i], i);\n\t}\n\tsort(p, p + n); UnionFind UF(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tif (used[i] == true)continue; ans++; used[i] = true;\n\t\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\n\t\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\n\t\tfor (int j = pos1; j < pos2; j++) {\n\t\t\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R*1.001l) {\n\t\t\t\tif (UF.same(i, get<2>(p[j])) == false) {\n\t\t\t\t\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.4090909090909091,"time_ms":220,"memory_kb":20288,"score_of_the_acc":-0.5555,"final_rank":19},{"submission_id":"aoj_2412_2164535","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<tuple>\nusing namespace std;\nclass UnionFind {\nprivate:\n\tunsigned size_; std::vector<unsigned> par, rank;\npublic:\n\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\n\tUnionFind(unsigned size__) : size_(size__) {\n\t\tpar.resize(size_); rank.resize(size_);\n\t\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\n\t}\n\tunsigned size() { return size_; }\n\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\n\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\n\tvoid unite(unsigned x, unsigned y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return;\n\t\tif (rank[x] < rank[y]) par[x] = y;\n\t\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\n\t\telse par[y] = x;\n\t}\n\tbool operator==(const UnionFind &u) { return par == u.par; }\n\tbool operator!=(const UnionFind &u) { return par != u.par; }\n};\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\nbool used[200000]; tuple<int, int, int>p[200000];\nlong double dst(long double px, long double py, long double qx, long double qy) {\n\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\n}\nint main() {\n\tcin >> n >> R; int ans = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i] >> y[i];\n\t\tx[i] *= r2; y[i] *= r2;\n\t\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\n\t\tx[i] -= J1; y[i] += J2; p[i] = make_tuple(x[i], y[i], i);\n\t}\n\tsort(p, p + n); UnionFind UF(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tif (used[i] == true)continue; ans++;\n\t\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\n\t\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\n\t\tfor (int j = pos1; j < pos2; j++) {\n\t\t\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R) {\n\t\t\t\tif (UF.same(i, get<2>(p[j])) == false) {\n\t\t\t\t\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.19696969696969696,"time_ms":200,"memory_kb":13156,"score_of_the_acc":-0.2837,"final_rank":20},{"submission_id":"aoj_2412_2138357","code_snippet":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#pragma warning(disable : 4996)\nusing namespace std;\nint n; double r, x, y, cx[200009], cy[200009]; pair<double, double> p[200009]; bool vis[200009];\nint main() {\n\tscanf(\"%d%lf\", &n, &r);\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%lf%lf\", &x, &y);\n\t\tdouble ex = x * 0.28 - y * 0.96;\n\t\tdouble ey = x * 0.96 + y * 0.28;\n\t\tp[i] = make_pair(ex, ey);\n\t}\n\tsort(p, p + n);\n\tfor (int i = 0; i < n; i++) cx[i] = p[i].first, cy[i] = p[i].second;\n\tint ret = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (vis[i]) continue;\n\t\tint ptl = lower_bound(cx, cx + n, cx[i] - r - 1.0e-4) - cx;\n\t\tint ptr = lower_bound(cx, cx + n, cx[i] + r + 1.0e-4) - cx;\n\t\tfor (int j = ptl; j < ptr; j++) {\n\t\t\tdouble dx = cx[i] - cx[j];\n\t\t\tdouble dy = cy[i] - cy[j];\n\t\t\tif (dx * dx + dy * dy <= 2.0 * r * r) vis[j] = true;\n\t\t}\n\t\tret++;\n\t}\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":9724,"score_of_the_acc":-0.1303,"final_rank":1},{"submission_id":"aoj_2412_2138355","code_snippet":"#include <cmath>\n#include <cstdio>\n#include <iostream>\n#include <algorithm>\n#pragma warning(disable : 4996)\nusing namespace std;\nint n; double r, x, y, cx[200009], cy[200009]; pair<double, double> p[200009]; bool vis[200009];\nint main() {\n\tscanf(\"%d%lf\", &n, &r);\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%lf%lf\", &x, &y);\n\t\tdouble ex = x * 0.28 - y * 0.96;\n\t\tdouble ey = x * 0.96 + y * 0.28;\n\t\tp[i] = make_pair(ex, ey);\n\t}\n\tsort(p, p + n);\n\tfor (int i = 0; i < n; i++) cx[i] = p[i].first, cy[i] = p[i].second;\n\tint ret = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (vis[i]) continue;\n\t\tint ptl = lower_bound(cx, cx + n, cx[i] - r - 1.0e-6) - cx;\n\t\tint ptr = lower_bound(cx, cx + n, cx[i] + r + 1.0e-6) - cx;\n\t\tfor (int j = ptl; j < ptr; j++) {\n\t\t\tdouble dx = cx[i] - cx[j];\n\t\t\tdouble dy = cy[i] - cy[j];\n\t\t\tif (dx * dx + dy * dy <= r * r) vis[j] = true;\n\t\t}\n\t\tret++;\n\t}\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":0.4090909090909091,"time_ms":80,"memory_kb":9664,"score_of_the_acc":-0.1195,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2412_10916185\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <unordered_map>\\n#include <utility>\\n#include <cstdint>\\nusing namespace std;\\n\\nstruct DSU {\\n vector<int> p, sz;\\n DSU(int n) : p(n), sz(n, 1) { for (int i = 0; i < n; ++i) p[i] = i; }\\n int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }\\n void unite(int a, int b) {\\n a = find(a); b = find(b);\\n if (a == b) return;\\n if (sz[a] < sz[b]) swap(a, b);\\n p[b] = a; sz[a] += sz[b];\\n }\\n};\\n\\nstruct PairHash {\\n size_t operator()(const pair<long long,long long>& v) const {\\n return hash<long long>()((v.first<<32) ^ v.second);\\n }\\n};\\n\\nlong long parseScaled(const string& s) {\\n int sign = 1;\\n size_t i = 0;\\n if (s[i] == '-') { sign = -1; i++; }\\n long long ip = 0, fp = 0;\\n while (i < s.size() && s[i] != '.') { ip = ip*10 + (s[i]-'0'); i++; }\\n if (i < s.size() && s[i] == '.') {\\n i++;\\n int k = 0;\\n while (i < s.size() && k < 3 && s[i] != ' ') { fp = fp*10 + (s[i]-'0'); i++; k++; }\\n while (k < 3) { fp *= 10; k++; }\\n } else {\\n fp = 0;\\n }\\n return sign * (ip*1000 + fp);\\n}\\n\\nlong long floor_div(long long a, long long b) {\\n if (a >= 0) return a / b;\\n return - ((-a + b - 1) / b);\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int N;\\n string Rs;\\n if (!(cin >> N >> Rs)) return 0;\\n long long R = parseScaled(Rs);\\n long long R2 = R * R;\\n\\n vector<long long> x(N), y(N);\\n for (int i = 0; i < N; ++i) {\\n string xs, ys;\\n cin >> xs >> ys;\\n x[i] = parseScaled(xs);\\n y[i] = parseScaled(ys);\\n }\\n\\n DSU dsu(N);\\n unordered_map<pair<long long,long long>, vector<int>, PairHash> cells;\\n cells.reserve(N*2);\\n\\n for (int i = 0; i < N; ++i) {\\n long long cx = floor_div(x[i], R);\\n long long cy = floor_div(y[i], R);\\n bool linked = false;\\n for (int dx = -1; dx <= 1 && !linked; ++dx) {\\n for (int dy = -1; dy <= 1 && !linked; ++dy) {\\n auto it = cells.find({cx + dx, cy + dy});\\n if (it == cells.end()) continue;\\n const vector<int>& vec = it->second;\\n for (int j : vec) {\\n long long dxv = x[i] - x[j];\\n long long dyv = y[i] - y[j];\\n if (dxv*dxv + dyv*dyv <= R2) {\\n dsu.unite(i, j);\\n linked = true;\\n break;\\n }\\n }\\n }\\n }\\n cells[{cx, cy}].push_back(i);\\n }\\n\\n int cnt = 0;\\n for (int i = 0; i < N; ++i) if (dsu.find(i) == i) cnt++;\\n cout << cnt << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 28020,\n \"score_of_the_acc\": -0.8016,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2412_5960351\",\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};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n int n; double r;\\n cin >> n >> r;\\n set<pair<int, int>> st;int ans = 0;\\n REP(i,n) {\\n double x, y; cin >> x >> y;\\n x = floor(x/r), y = floor(y/r);\\n bool f = false;\\n for(int j=-1; j<=1; j++) {\\n for(int k=-1; k<=1; k++) {\\n if(st.find({x+j,y+k}) != st.end()) f = true;\\n }\\n }\\n if(!f) ans++;\\n st.insert({x, y});\\n }\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 12040,\n \"score_of_the_acc\": -0.2562,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2412_3051998\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <set>\\n#include <utility>\\nusing namespace std;\\nint dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint dy[8] = {-1, 0, 1, -1, 1, -1, 0 ,1};\\n\\nvoid dfs(pair<int, int> curr, set<pair<int, int> > &block){\\n if(block.find(curr) == block.end()) return;\\n block.erase(curr);\\n for(int i=0; i<8; i++){\\n dfs(make_pair(curr.first +dx[i], curr.second +dy[i]), block);\\n }\\n}\\n\\nint main(){\\n int n;\\n double r;\\n cin >> n >> r;\\n\\n set<pair<int, int> > block; \\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n int xi = (x +1e6)/r;\\n int yi = (y +1e6)/r;\\n block.insert(make_pair(xi, yi));\\n }\\n\\n int ans = 0;\\n while(!block.empty()){\\n ans++;\\n pair<int, int> curr = *(block.begin());\\n dfs(curr, block);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 11716,\n \"score_of_the_acc\": -0.2498,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2412_2948812\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\nint n;\\ndouble r;\\nvector<pair<int,int> > vec; \\nset<pair<int,int> > visited;\\nset<pair<int,int> > exist;\\n\\nint main(){\\n \\n scanf(\\\"%d%lf\\\", &n,&r);\\n\\n for(int i=0;i<n;i++){\\n double x,y;\\n scanf(\\\"%lf%lf\\\", &x, &y);\\n if(x >= 0) x += r;\\n if(y >= 0) y += r;\\n vec.push_back({x/r, y/r});\\n exist.insert(vec[i]);\\n }\\n\\n int ans = 0;\\n\\n int dx[8] = {0,0,1,-1,1,1,-1,-1};\\n int dy[8] = {1,-1,0,0,1,-1,1,-1};\\n \\n for(int i=0;i<n;i++){\\n if(visited.find(vec[i]) != visited.end())\\n continue;\\n\\n ans++;\\n\\n queue<pair<int,int> > que;\\n que.push(vec[i]);\\n while(que.size()){\\n auto p = que.front();\\n que.pop();\\n \\n if(visited.find(p) != visited.end()) continue;\\n visited.insert(p);\\n \\n for(int j=0;j<8;j++){\\n if(exist.find({p.first + dx[j], p.second + dy[j]}) != exist.end())\\n que.push({p.first + dx[j], p.second + dy[j]});\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 21416,\n \"score_of_the_acc\": -0.6456,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2412_2807258\",\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//// < \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\a.txt\\\" > \\\"d:\\\\d_download\\\\visual studio 2015\\\\projects\\\\programing_contest_c++\\\\debug\\\\b.txt\\\"\\n\\n\\nint main() {\\n\\tint N;cin>>N;\\n\\tld R;cin>>R;\\n\\tvector<pair<ld,ld>>houses;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tld a,b;cin>>a>>b;\\n\\t\\thouses.push_back(make_pair(a,b));\\n\\t}\\n\\n\\tint ans=0;\\n\\tvector<int>used(N,false);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (!used[i]) {\\n\\t\\t\\tans++;\\n\\t\\t\\tused[i]=true;\\n\\t\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\t\\tif (!used[j]) {\\n\\t\\t\\t\\t\\tld dx=houses[i].first-houses[j].first;\\n\\t\\t\\t\\t\\tld dy=houses[i].second-houses[j].second;\\n\\t\\t\\t\\t\\tld len=dx*dx+dy*dy;\\n\\t\\t\\t\\t\\tif (len <= R*R) {\\n\\t\\t\\t\\t\\t\\tused[j]=true;\\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\\treturn 0;\\n}\",\n \"accuracy\": 0.4090909090909091,\n \"time_ms\": 200,\n \"memory_kb\": 11348,\n \"score_of_the_acc\": -0.2163,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2412_2667097\",\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 pl = pair<ll,ll>;\\n\\nstruct UF{\\n int n;\\n //正だったらその頂点の親,負だったら根で連結成分の個数\\n vector<int> d;\\n UF() {}\\n UF(int N):n(N), d(N,-1){}\\n int root(int v){\\n if(d[v]<0) return v;\\n return d[v]=root(d[v]);\\n }\\n bool unite(int X,int Y){\\n X=root(X); Y=root(Y);\\n if(X==Y) return false;\\n if(size(X) < size(Y)) swap(X,Y);\\n d[X]+=d[Y];\\n d[Y]=X;\\n return true;\\n }\\n int size(int v){ return -d[root(v)]; }\\n bool same(int X,int Y){ return root(X)==root(Y); }\\n};\\n\\nll read()\\n{\\n string s;\\n cin >>s;\\n\\n int m = 1;\\n if(s[0]=='-')\\n {\\n m = -1;\\n s = s.substr(1);\\n }\\n\\n int S = s.size();\\n ll ret = atoll(s.substr(0,S-4).c_str())*1000 + atoll(s.substr(S-3).c_str());\\n\\n return m*ret;\\n}\\n\\nint main()\\n{\\n int n;\\n scanf(\\\" %d\\\", &n);\\n\\n ll R = read();\\n\\n vector<pl> p(n);\\n rep(i,n)\\n {\\n ll x=read(), y=read();\\n p[i] = {x,y};\\n }\\n sort(all(p));\\n\\n UF uf(n);\\n int idx = 0;\\n set<pl> now;\\n rep(i,n)\\n {\\n while(idx<n && p[idx].fi<=p[i].fi+R)\\n {\\n now.insert({p[idx].se,idx});\\n ++idx;\\n }\\n\\n auto itr = now.lower_bound({p[i].se-R,-1});\\n while(itr!=now.end() && itr->fi<=p[i].se+R)\\n {\\n int id = itr->se;\\n uf.unite(i,id);\\n itr = now.erase(itr);\\n }\\n }\\n\\n set<int> s;\\n rep(i,n) s.insert(uf.root(i));\\n cout << s.size() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 19328,\n \"score_of_the_acc\": -0.5705,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2412_2667076\",\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 pl = pair<ll,ll>;\\n\\nstruct UF{\\n int n;\\n //正だったらその頂点の親,負だったら根で連結成分の個数\\n vector<int> d;\\n UF() {}\\n UF(int N):n(N), d(N,-1){}\\n int root(int v){\\n if(d[v]<0) return v;\\n return d[v]=root(d[v]);\\n }\\n bool unite(int X,int Y){\\n X=root(X); Y=root(Y);\\n if(X==Y) return false;\\n if(size(X) < size(Y)) swap(X,Y);\\n d[X]+=d[Y];\\n d[Y]=X;\\n return true;\\n }\\n int size(int v){ return -d[root(v)]; }\\n bool same(int X,int Y){ return root(X)==root(Y); }\\n};\\n\\nll read()\\n{\\n double t;\\n scanf(\\\" %lf\\\", &t);\\n return t*1000;\\n}\\n\\nint main()\\n{\\n int n;\\n scanf(\\\" %d\\\", &n);\\n\\n ll R = read();\\n\\n vector<pl> p(n);\\n rep(i,n)\\n {\\n ll x=read(), y=read();\\n p[i] = {x,y};\\n }\\n sort(all(p));\\n\\n UF uf(n);\\n int idx = 0;\\n set<pl> now;\\n rep(i,n)\\n {\\n while(idx<n && p[idx].fi<=p[i].fi+R)\\n {\\n now.insert({p[idx].se,idx});\\n ++idx;\\n }\\n\\n auto itr = now.lower_bound({p[i].se-R,-1});\\n while(itr!=now.end() && itr->fi<=p[i].se+R)\\n {\\n int id = itr->se;\\n uf.unite(i,id);\\n itr = now.erase(itr);\\n }\\n }\\n\\n set<int> s;\\n rep(i,n) s.insert(uf.root(i));\\n cout << s.size() << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5303030303030303,\n \"time_ms\": 120,\n \"memory_kb\": 9496,\n \"score_of_the_acc\": -0.1246,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2412_2667073\",\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 pl = pair<ll,ll>;\\n\\nstruct UF{\\n int n;\\n //正だったらその頂点の親,負だったら根で連結成分の個数\\n vector<int> d;\\n UF() {}\\n UF(int N):n(N), d(N,-1){}\\n int root(int v){\\n if(d[v]<0) return v;\\n return d[v]=root(d[v]);\\n }\\n bool unite(int X,int Y){\\n X=root(X); Y=root(Y);\\n if(X==Y) return false;\\n if(size(X) < size(Y)) swap(X,Y);\\n d[X]+=d[Y];\\n d[Y]=X;\\n return true;\\n }\\n int size(int v){ return -d[root(v)]; }\\n bool same(int X,int Y){ return root(X)==root(Y); }\\n};\\n\\nll read()\\n{\\n double t;\\n scanf(\\\" %lf\\\", &t);\\n return t*1000;\\n}\\n\\nint main()\\n{\\n int n;\\n scanf(\\\" %d\\\", &n);\\n\\n ll R = read();\\n\\n vector<pl> p(n);\\n rep(i,n)\\n {\\n ll x=read(), y=read();\\n p[i] = {x,y};\\n }\\n sort(all(p));\\n\\n UF uf(n);\\n int idx = 0;\\n set<pl> now;\\n vector<bool> vis(n);\\n rep(i,n)if(!vis[i])\\n {\\n vis[i] = true;\\n while(idx<n && p[idx].fi<=p[i].fi+R)\\n {\\n now.insert({p[idx].se,idx});\\n ++idx;\\n }\\n\\n auto itr = now.lower_bound({p[i].se-R,-1});\\n while(itr!=now.end() && itr->fi<=p[i].se+R)\\n {\\n int id = itr->se;\\n uf.unite(i,id);\\n vis[id]=true;\\n itr = now.erase(itr);\\n }\\n }\\n\\n set<int> s;\\n rep(i,n) s.insert(uf.root(i));\\n cout << s.size() << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5303030303030303,\n \"time_ms\": 120,\n \"memory_kb\": 9448,\n \"score_of_the_acc\": -0.1228,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2412_2592809\",\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\\ntypedef pair<int,int> Point;\\n\\nint diff_x[8] = {-1,0,1,-1,1,-1,0,1},diff_y[8] = {-1,-1,-1,0,0,1,1,1};\\nset<Point> SET;\\n\\nint main(){\\n\\n\\tint N;\\n\\tdouble R;\\n\\n\\tscanf(\\\"%d %lf\\\",&N,&R);\\n\\n\\tdouble tmp_x,tmp_y;\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lf %lf\\\",&tmp_x,&tmp_y);\\n\\t\\tSET.insert(Point((int)(tmp_x/R),(int)(tmp_y/R)));\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\twhile(SET.size() != 0){\\n\\t\\tset<Point>::iterator it = SET.begin();\\n\\t\\tPoint point = *it;\\n\\t\\tSET.erase(it);\\n\\t\\tans++;\\n\\t\\tfor(int i = 0; i < 8; i++){\\n\\t\\t\\tPoint tmp = Point(point.first + diff_x[i],point.second + diff_y[i]);\\n\\t\\t\\tit = SET.find(tmp);\\n\\t\\t\\tif(it != SET.end())SET.erase(it);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 11712,\n \"score_of_the_acc\": -0.2157,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2412_2294887\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\ntypedef pair<double,double> P;\\ntypedef pair<int,int> PP;\\n \\ndouble D(P a,P b) {return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));}\\nconst int N=222222;\\nint p[N],r[N];\\nvoid init(){for(int i=0; i<N; i++) p[i]=i,r[i]=0;}\\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\\nvoid unite(int x,int y) {\\n x=find(x),y=find(y);\\n if(x==y)return;\\n if(r[x]<r[y])p[x]=y;\\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\\n}\\n \\nint main() {\\n init();\\n int n;\\n double d;\\n cin>>n>>d;\\n P a[n];\\n for(int i=0; i<n; i++) cin>>a[i].F>>a[i].S;\\n map<PP,int> m;\\n for(int i=0; i<n; i++) {\\n int x=floor(a[i].F/d),y=floor(a[i].S/d);\\n for(int dx=-1; dx<2; dx++)for(int dy=-1; dy<2; dy++)if(m.count(PP(x+dx,y+dy))) unite(i,m[PP(x+dx,y+dy)]);\\n m[PP(x,y)]=i;\\n }\\n set<int> s;\\n for(int i=0; i<n; i++) s.insert(find(i));\\n cout<<s.size()<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 26912,\n \"score_of_the_acc\": -0.8705,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2412_2293934\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define EPS (1e-8)\\n#define N_MAX 200005\\nusing namespace std;\\ntypedef double ll;\\n\\nint N;\\nll R,x[N_MAX],y[N_MAX];\\nbool used[N_MAX];\\n\\nstruct node{\\n vector<ll> Point;\\n int l,r;\\n node(){}\\n node(vector<ll> a){Point=a,l=r=-1;}\\n};\\n\\nconst int K=2;// K:?¬??????°\\nint D;// D:?????????????????????????????????????¬????\\nvector<vector<ll> > P;// ???????????????????´????K+1???(K???????¬????????????????????????????number)\\nvector<node> G;\\n\\nbool compare(const vector<ll> &A,const vector<ll> &B){return A[D]<B[D];}\\n\\nint make_tree(int depth,int l,int r){\\n if(l>r)return -1;\\n D=depth%K;\\n sort(P.begin()+l,P.begin()+r+1,compare);\\n int m=(l+r)/2,res=G.size();\\n G.push_back(node(P[m]));\\n\\n int vl=make_tree(depth+1,l,m-1);\\n int vr=make_tree(depth+1,m+1,r);\\n\\n G[res].l=vl; G[res].r=vr;\\n return res;\\n}\\n\\nvector<int> num;// search??§?????????????????¨?????§????????????number????????????\\n\\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\\n bool f=true;\\n for(int i=0;i<K;i++)\\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\\n\\n if(f)num.push_back(G[x].Point[K]);\\n\\n D=depth%K;\\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\\n D=depth%K;\\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\\n}\\n\\nint main(){\\n \\n cin>>N>>R;\\n \\n P.resize(N);\\n \\n for(int i=0;i<N;i++){\\n \\n scanf(\\\"%lf %lf\\\",&x[i],&y[i]);\\n \\n P[i].resize(K+1);\\n \\n P[i][K]=i;\\n P[i][0]=x[i],P[i][1]=y[i];\\n }\\n \\n make_tree(0,0,P.size()-1);\\n \\n int ans=0;\\n for(int i=0;i<N;i++){\\n \\n if(used[i])continue;\\n \\n vector<ll> L2(K),R2(K);\\n \\n L2[0]=x[i]-R-EPS;\\n R2[0]=x[i]+R+EPS;\\n \\n L2[1]=y[i]-R-EPS;\\n R2[1]=y[i]+R+EPS;\\n \\n num.clear();\\n \\n search(0,0,L2,R2);\\n \\n for(int j=0;j<num.size();j++) used[num[j]]=1;\\n \\n ans++;\\n }\\n \\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3610,\n \"memory_kb\": 31360,\n \"score_of_the_acc\": -1.9263,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2412_2293930\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define EPS (1e-8)\\n#define N_MAX 200005\\nusing namespace std;\\ntypedef double ll;\\n\\nint N;\\nll R,x[N_MAX],y[N_MAX];\\nbool used[N_MAX];\\n\\nstruct node{\\n vector<ll> Point;\\n int l,r;\\n node(){}\\n node(vector<ll> a){Point=a,l=r=-1;}\\n};\\n\\nconst int K=2;// K:テヲツャツ。テ・ツ?εヲツ閉ー\\nint D;// D:テ」ツ?敕」ツ?ョテヲツ卍づ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ凝・ツ淞コテヲツコツ姪」ツ?ョテヲツャツ。テ・ツ??\\nvector<vector<ll> > P;// テ」ツ?敕」ツつ古」ツ?榲」ツつ古」ツ?ョティツヲツ?ァツエツ?」ツ?ッK+1テ・ツ??Kテ・ツ?凝」ツ?ョテヲツャツ。テ・ツ?ε」ツ?ョテァツ閉ェテ・ツ渉キテッツシツ凝、ツサツ佚」ツ?妥」ツ?淌」ツ??umber)\\nvector<node> G;\\n\\nbool compare(const vector<ll> &A,const vector<ll> &B){return A[D]<B[D];}\\n\\nint make_tree(int depth,int l,int r){\\n if(l>r)return -1;\\n D=depth%K;\\n sort(P.begin()+l,P.begin()+r+1,compare);\\n int m=(l+r)/2,res=G.size();\\n G.push_back(node(P[m]));\\n\\n int vl=make_tree(depth+1,l,m-1);\\n int vr=make_tree(depth+1,m+1,r);\\n\\n G[res].l=vl; G[res].r=vr;\\n return res;\\n}\\n\\nvector<int> num;// searchテ」ツ?ァティツヲツ凝」ツ?、テ」ツ?妥」ツつ凝」ツ?禿」ツ?ィテ」ツ?古」ツ?ァテ」ツ?催」ツ?淌ァツつケテ」ツ?ョnumberテ」ツつ津」ツ??」ツつ古」ツつ?\\n\\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\\n bool f=true;\\n for(int i=0;i<K;i++)\\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\\n\\n if(f)num.push_back(G[x].Point[K]);\\n\\n D=depth%K;\\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\\n D=depth%K;\\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\\n}\\n\\nint main(){\\n \\n cin>>N>>R;\\n \\n P.resize(N);\\n \\n for(int i=0;i<N;i++){\\n \\n scanf(\\\"%lf %lf\\\",&x[i],&y[i]);\\n \\n P[i].resize(K+1);\\n \\n P[i][K]=i;\\n P[i][0]=x[i],P[i][1]=y[i];\\n }\\n \\n make_tree(0,0,P.size()-1);\\n \\n int ans=0;\\n for(int i=0;i<N;i++){\\n \\n if(used[i])continue;\\n \\n vector<ll> L2(K),R2(K);\\n \\n L2[0]=x[i]-R-EPS;\\n R2[0]=x[i]+R+EPS;\\n \\n L2[1]=y[i]-R-EPS;\\n R2[1]=y[i]+R+EPS;\\n \\n num.clear();\\n \\n search(0,0,L2,R2);\\n \\n for(int j=0;j<num.size();j++) used[num[j]]=1;\\n \\n ans++;\\n }\\n \\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3560,\n \"memory_kb\": 31472,\n \"score_of_the_acc\": -1.9163,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2412_2293915\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N_MAX 200005\\nusing namespace std;\\ntypedef double ll;\\n\\nint N;\\nll R,x[N_MAX],y[N_MAX];\\nbool used[N_MAX];\\n\\nstruct node{\\n vector<ll> Point;\\n int l,r;\\n node(){}\\n node(vector<ll> a){Point=a,l=r=-1;}\\n};\\n\\nconst int K=2;// K:テヲツャツ。テ・ツ?εヲツ閉ー\\nint D;// D:テ」ツ?敕」ツ?ョテヲツ卍づ」ツ?ォテ」ツつステ」ツδシテ」ツδ暗」ツ?凖」ツつ凝・ツ淞コテヲツコツ姪」ツ?ョテヲツャツ。テ・ツ??\\nvector<vector<ll> > P;// テ」ツ?敕」ツつ古」ツ?榲」ツつ古」ツ?ョティツヲツ?ァツエツ?」ツ?ッK+1テ・ツ??Kテ・ツ?凝」ツ?ョテヲツャツ。テ・ツ?ε」ツ?ョテァツ閉ェテ・ツ渉キテッツシツ凝、ツサツ佚」ツ?妥」ツ?淌」ツ??umber)\\nvector<node> G;\\n\\nbool compare(vector<ll> A,vector<ll> B){return A[D]<B[D];}\\n\\nint make_tree(int depth,int l,int r){\\n if(l>r)return -1;\\n D=depth%K;\\n sort(P.begin()+l,P.begin()+r+1,compare);\\n int m=(l+r)/2,res=G.size();\\n G.push_back(node(P[m]));\\n\\n int vl=make_tree(depth+1,l,m-1);\\n int vr=make_tree(depth+1,m+1,r);\\n\\n G[res].l=vl; G[res].r=vr;\\n return res;\\n}\\n\\nvector<int> num;// searchテ」ツ?ァティツヲツ凝」ツ?、テ」ツ?妥」ツつ凝」ツ?禿」ツ?ィテ」ツ?古」ツ?ァテ」ツ?催」ツ?淌ァツつケテ」ツ?ョnumberテ」ツつ津」ツ??」ツつ古」ツつ?\\n\\nvoid search(int x,int depth,vector<ll> &L,vector<ll> &R){\\n bool f=true;\\n for(int i=0;i<K;i++)\\n if(G[x].Point[i]<L[i]||R[i]<G[x].Point[i])f=false;\\n\\n if(f)num.push_back(G[x].Point[K]);\\n\\n D=depth%K;\\n if(G[x].Point[D]<=R[D]&&G[x].r!=-1)search(G[x].r,depth+1,L,R);\\n D=depth%K;\\n if(L[D]<=G[x].Point[D]&&G[x].l!=-1)search(G[x].l,depth+1,L,R);\\n}\\n\\nint main(){\\n \\n cin>>N>>R;\\n \\n P.resize(N);\\n \\n for(int i=0;i<N;i++){\\n \\n cin>>x[i]>>y[i];\\n \\n P[i].resize(K+1);\\n \\n P[i][K]=i;\\n P[i][0]=x[i],P[i][1]=y[i];\\n }\\n \\n make_tree(0,0,P.size()-1);\\n \\n int ans=0;\\n for(int i=0;i<N;i++){\\n \\n if(used[i])continue;\\n \\n vector<ll> L2(K),R2(K);\\n \\n L2[0]=x[i]-R;\\n R2[0]=x[i]+R;\\n \\n L2[1]=y[i]-R;\\n R2[1]=y[i]+R;\\n \\n num.clear();\\n \\n search(0,0,L2,R2);\\n \\n for(int j=0;j<num.size();j++) used[num[j]]=1;\\n ans++;\\n }\\n \\n cout<<ans<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5303030303030303,\n \"time_ms\": 2320,\n \"memory_kb\": 33336,\n \"score_of_the_acc\": -1.6356,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2412_2293681\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\ntypedef pair<double,double> P;\\ntypedef pair<int,int> PP;\\n\\ndouble D(P a,P b) {\\n return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));\\n}\\n\\nint p[222222],r[222222];\\nvoid init(){for(int i=0; i<222222; i++) p[i]=i,r[i]=0;}\\nint find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}\\nvoid unite(int x,int y) {\\n x=find(x),y=find(y);\\n if(x==y)return;\\n if(r[x]<r[y])p[x]=y;\\n else{p[y]=x;if(r[x]==r[y])r[x]++;}\\n}\\n\\nint main() {\\n init();\\n int n;\\n double d;\\n cin >> n >> d;\\n P a[n];\\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\\n map<PP,int> m;\\n for(int i=0; i<n; i++) {\\n int x=floor(a[i].F/d),y=floor(a[i].S/d);\\n for(int dx=-1; dx<2; dx++) {\\n for(int dy=-1; dy<2; dy++) {\\n if(m.count(PP(x+dx,y+dy))) unite(i,m[PP(x+dx,y+dy)]);\\n }\\n }\\n m[PP(x,y)]=i;\\n }\\n set<int> s;\\n for(int i=0; i<n; i++) s.insert(find(i));\\n cout << s.size() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 26976,\n \"score_of_the_acc\": -0.8644,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2412_2293453\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define F first\\n#define S second\\ntypedef pair<double,double> P;\\n\\ndouble D(P a,P b) {\\n return sqrt((a.F-b.F)*(a.F-b.F)+(a.S-b.S)*(a.S-b.S));\\n}\\n\\nint main() {\\n int n;\\n double r;\\n cin >> n >> r;\\n P a[n];\\n for(int i=0; i<n; i++) cin >> a[i].F >> a[i].S;\\n bool u[n];\\n memset(u,0,sizeof(u));\\n int ans=0;\\n for(int i=0; i<n; i++) {\\n if(u[i]) continue;\\n u[i]=1;\\n ans++;\\n for(int j=i+1; j<n; j++) {\\n if(u[j]) continue;\\n if(D(a[i],a[j])<=r) u[j]=1;\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.4090909090909091,\n \"time_ms\": 180,\n \"memory_kb\": 6536,\n \"score_of_the_acc\": -0.0311,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2412_2164546\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<tuple>\\nusing namespace std;\\nclass UnionFind {\\nprivate:\\n\\tunsigned size_; std::vector<unsigned> par, rank;\\npublic:\\n\\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\\n\\tUnionFind(unsigned size__) : size_(size__) {\\n\\t\\tpar.resize(size_); rank.resize(size_);\\n\\t\\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\\n\\t}\\n\\tunsigned size() { return size_; }\\n\\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\\n\\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\\n\\tvoid unite(unsigned x, unsigned y) {\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif (x == y) return;\\n\\t\\tif (rank[x] < rank[y]) par[x] = y;\\n\\t\\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\\n\\t\\telse par[y] = x;\\n\\t}\\n\\tbool operator==(const UnionFind &u) { return par == u.par; }\\n\\tbool operator!=(const UnionFind &u) { return par != u.par; }\\n};\\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\\nbool used[200000]; tuple<long double, long double, int>p[200000];\\nlong double dst(long double px, long double py, long double qx, long double qy) {\\n\\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\\n}\\nint main() {\\n\\tcin >> n >> R; int ans = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t\\tx[i] *= r2; y[i] *= r2;\\n\\t\\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\\n\\t\\tx[i] -= J2; y[i] += J1; p[i] = make_tuple(x[i], y[i], i);\\n\\t}\\n\\tsort(p, p + n); UnionFind UF(n);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (used[i] == true)continue; ans++; used[i] = true;\\n\\t\\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\\n\\t\\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\\n\\t\\tfor (int j = pos1; j < pos2; j++) {\\n\\t\\t\\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R*1.001l) {\\n\\t\\t\\t\\tif (UF.same(i, get<2>(p[j])) == false) {\\n\\t\\t\\t\\t\\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\\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\": 420,\n \"memory_kb\": 20316,\n \"score_of_the_acc\": -0.613,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2412_2164536\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<tuple>\\nusing namespace std;\\nclass UnionFind {\\nprivate:\\n\\tunsigned size_; std::vector<unsigned> par, rank;\\npublic:\\n\\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\\n\\tUnionFind(unsigned size__) : size_(size__) {\\n\\t\\tpar.resize(size_); rank.resize(size_);\\n\\t\\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\\n\\t}\\n\\tunsigned size() { return size_; }\\n\\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\\n\\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\\n\\tvoid unite(unsigned x, unsigned y) {\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif (x == y) return;\\n\\t\\tif (rank[x] < rank[y]) par[x] = y;\\n\\t\\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\\n\\t\\telse par[y] = x;\\n\\t}\\n\\tbool operator==(const UnionFind &u) { return par == u.par; }\\n\\tbool operator!=(const UnionFind &u) { return par != u.par; }\\n};\\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\\nbool used[200000]; tuple<long double, long double, int>p[200000];\\nlong double dst(long double px, long double py, long double qx, long double qy) {\\n\\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\\n}\\nint main() {\\n\\tcin >> n >> R; int ans = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t\\tx[i] *= r2; y[i] *= r2;\\n\\t\\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\\n\\t\\tx[i] -= J1; y[i] += J2; p[i] = make_tuple(x[i], y[i], i);\\n\\t}\\n\\tsort(p, p + n); UnionFind UF(n);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (used[i] == true)continue; ans++; used[i] = true;\\n\\t\\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\\n\\t\\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\\n\\t\\tfor (int j = pos1; j < pos2; j++) {\\n\\t\\t\\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R*1.001l) {\\n\\t\\t\\t\\tif (UF.same(i, get<2>(p[j])) == false) {\\n\\t\\t\\t\\t\\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4090909090909091,\n \"time_ms\": 220,\n \"memory_kb\": 20288,\n \"score_of_the_acc\": -0.5555,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2412_2164535\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<tuple>\\nusing namespace std;\\nclass UnionFind {\\nprivate:\\n\\tunsigned size_; std::vector<unsigned> par, rank;\\npublic:\\n\\tUnionFind() : size_(0), par(std::vector<unsigned>()), rank(std::vector<unsigned>()) {};\\n\\tUnionFind(unsigned size__) : size_(size__) {\\n\\t\\tpar.resize(size_); rank.resize(size_);\\n\\t\\tfor (unsigned i = 0; i < size_; i++) par[i] = i, rank[i] = 0;\\n\\t}\\n\\tunsigned size() { return size_; }\\n\\tunsigned root(unsigned x) { return par[x] == x ? x : par[x] = root(par[x]); }\\n\\tbool same(unsigned x, unsigned y) { return root(x) == root(y); }\\n\\tvoid unite(unsigned x, unsigned y) {\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif (x == y) return;\\n\\t\\tif (rank[x] < rank[y]) par[x] = y;\\n\\t\\telse if (rank[x] == rank[y]) par[y] = x, rank[x]++;\\n\\t\\telse par[y] = x;\\n\\t}\\n\\tbool operator==(const UnionFind &u) { return par == u.par; }\\n\\tbool operator!=(const UnionFind &u) { return par != u.par; }\\n};\\nint n; long double x[200000], y[200000], R, r1 = 0.1145141919, r2 = 0.9868864999;\\nbool used[200000]; tuple<int, int, int>p[200000];\\nlong double dst(long double px, long double py, long double qx, long double qy) {\\n\\treturn sqrtl((px - qx)*(px - qx) + (py - qy)*(py - qy));\\n}\\nint main() {\\n\\tcin >> n >> R; int ans = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> x[i] >> y[i];\\n\\t\\tx[i] *= r2; y[i] *= r2;\\n\\t\\tlong double J1 = x[i], J2 = y[i]; J1 *= r1 / r2; J2 *= r1 / r2;\\n\\t\\tx[i] -= J1; y[i] += J2; p[i] = make_tuple(x[i], y[i], i);\\n\\t}\\n\\tsort(p, p + n); UnionFind UF(n);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (used[i] == true)continue; ans++;\\n\\t\\tint pos1 = lower_bound(p, p + n, make_tuple(x[i] - R, y[i], i)) - p;\\n\\t\\tint pos2 = lower_bound(p, p + n, make_tuple(x[i] + R, y[i], i)) - p;\\n\\t\\tfor (int j = pos1; j < pos2; j++) {\\n\\t\\t\\tif (dst(x[i], y[i], get<0>(p[j]), get<1>(p[j])) <= R) {\\n\\t\\t\\t\\tif (UF.same(i, get<2>(p[j])) == false) {\\n\\t\\t\\t\\t\\tUF.unite(i, get<2>(p[j])); used[get<2>(p[j])] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.19696969696969696,\n \"time_ms\": 200,\n \"memory_kb\": 13156,\n \"score_of_the_acc\": -0.2837,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2412_2138357\",\n \"code_snippet\": \"#include <cmath>\\n#include <cstdio>\\n#include <iostream>\\n#include <algorithm>\\n#pragma warning(disable : 4996)\\nusing namespace std;\\nint n; double r, x, y, cx[200009], cy[200009]; pair<double, double> p[200009]; bool vis[200009];\\nint main() {\\n\\tscanf(\\\"%d%lf\\\", &n, &r);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tscanf(\\\"%lf%lf\\\", &x, &y);\\n\\t\\tdouble ex = x * 0.28 - y * 0.96;\\n\\t\\tdouble ey = x * 0.96 + y * 0.28;\\n\\t\\tp[i] = make_pair(ex, ey);\\n\\t}\\n\\tsort(p, p + n);\\n\\tfor (int i = 0; i < n; i++) cx[i] = p[i].first, cy[i] = p[i].second;\\n\\tint ret = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (vis[i]) continue;\\n\\t\\tint ptl = lower_bound(cx, cx + n, cx[i] - r - 1.0e-4) - cx;\\n\\t\\tint ptr = lower_bound(cx, cx + n, cx[i] + r + 1.0e-4) - cx;\\n\\t\\tfor (int j = ptl; j < ptr; j++) {\\n\\t\\t\\tdouble dx = cx[i] - cx[j];\\n\\t\\t\\tdouble dy = cy[i] - cy[j];\\n\\t\\t\\tif (dx * dx + dy * dy <= 2.0 * r * r) vis[j] = true;\\n\\t\\t}\\n\\t\\tret++;\\n\\t}\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 9724,\n \"score_of_the_acc\": -0.1303,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2412_2138355\",\n \"code_snippet\": \"#include <cmath>\\n#include <cstdio>\\n#include <iostream>\\n#include <algorithm>\\n#pragma warning(disable : 4996)\\nusing namespace std;\\nint n; double r, x, y, cx[200009], cy[200009]; pair<double, double> p[200009]; bool vis[200009];\\nint main() {\\n\\tscanf(\\\"%d%lf\\\", &n, &r);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tscanf(\\\"%lf%lf\\\", &x, &y);\\n\\t\\tdouble ex = x * 0.28 - y * 0.96;\\n\\t\\tdouble ey = x * 0.96 + y * 0.28;\\n\\t\\tp[i] = make_pair(ex, ey);\\n\\t}\\n\\tsort(p, p + n);\\n\\tfor (int i = 0; i < n; i++) cx[i] = p[i].first, cy[i] = p[i].second;\\n\\tint ret = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (vis[i]) continue;\\n\\t\\tint ptl = lower_bound(cx, cx + n, cx[i] - r - 1.0e-6) - cx;\\n\\t\\tint ptr = lower_bound(cx, cx + n, cx[i] + r + 1.0e-6) - cx;\\n\\t\\tfor (int j = ptl; j < ptr; j++) {\\n\\t\\t\\tdouble dx = cx[i] - cx[j];\\n\\t\\t\\tdouble dy = cy[i] - cy[j];\\n\\t\\t\\tif (dx * dx + dy * dy <= r * r) vis[j] = true;\\n\\t\\t}\\n\\t\\tret++;\\n\\t}\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4090909090909091,\n \"time_ms\": 80,\n \"memory_kb\": 9664,\n \"score_of_the_acc\": -0.1195,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1377,"cells":{"group_id":{"kind":"string","value":"aoj_2411_cpp"},"problem_description":{"kind":"string","value":"F - Acceleration of Network\nインターネットと言う広大な海は少しずつ黒く塗りつぶされていった。\nボットの反乱、DDOS攻撃の嵐、ウィルスの蔓延、\n何度も何度も繰り返されたクラッカーとの戦争で、人もインターネットもボロボロになった。\n人の手では、インターネットはどうにもならない。\nだから人は、とんでもない時間をかけて\nインターネットを復旧できる「少女」を造った。\n少女は、インターネットの手当をはじめた。\n果てしなく広いインターネットの世界をどうにかしようと頑張った。\nまだ少女ひとりでは撚り対線を織る事くらいしかできないけど、\n長い長い時がすぎてインターネットが少し復旧すれば、\nみんなと一緒に頑張れるだろうという期待をこめて。\n問題文\n少女はかつてインターネットに存在した\nN\n個のサービスを復旧するために日々頑張っている．\n現在を 0 日目とする．\nインターネットがどの程度復旧しているかを\n復旧度\nという指標で表し，現在の復旧度は 0 であるとする．\n少女は毎日作業をし，復旧度を 1 日につき 1 ずつ上げていく．\n任意のまだ復旧していないサービス\ni\nは，復旧度が\nw\ni\n以上になると自動的に復旧する．\nサービス\ni\nが復旧すると，みんなが手伝ってくれることにより，復旧した次の日から\nx\ni\n日間だけ作業がはかどり，復旧度の増加が加速する．\nサービスには 3 つの種類があり，種類によって復旧度がどの程度増加するのかが異なる．\nサービスの種類を\n0, 1, 2\nの番号で表すとする．\nサービス\ni\nの種類を t\ni\n(∈ {0, 1, 2}) とすると，\nサービス\ni\nが復旧してから\nd-1\n日目から\nd\n日目にかけて\n(1 ≤ d ≤ x\ni\n)\n，\nt\ni\n=0\nの場合は\n1\n，\nt\ni\n=1\nの場合は\nd\n，\nそして\nt\ni\n=2\nの場合は\nd\n2\nだけ，少女の作業とは別に復旧度が増加する．\nまた，同時に複数のサービスが復旧している場合，それぞれのサービスは独立に並行して復旧度を増加させる．\n少女はサービスが復旧するまでにとんでもない時間がかかると思ったので，現在から何日目にサービスが復旧するか調べることにした．\nまたある日にち\ny\nj\nに復旧度がいくらになっているかも気になったので，それも\nQ\n日分だけ調べることにした．\n入力形式\n入力は以下の形式で与えられる．\nN\nQ\nw\n1\nt\n1\nx\n1\n...\nw\nN\nt\nN\nx\nN\ny\n1\n...\ny\nQ\n出力形式\n最初に\nN\n行出力し，\ni\n行目にはサービス\ni\nの復旧する日にちを出力せよ．次に\nQ\n行出力し，\nj\n行目には\ny\nj\n日目に復旧度がいくらになっているかを出力せよ．\nサービスが復旧する日にちが\n3,652,425\nを超える場合は\nMany years later\nと出力せよ．\n制約\n0 ≤ N ≤ 10\n5\n1 ≤ Q ≤ 10\n5\n0 ≤ w\ni\n< 2\n60\nw\ni\n≤ w\ni+1\n(1 ≤ i < N)\nt\ni\n∈ {0, 1, 2}\n1 ≤ x\ni\n≤ 10\n4\n0 ≤ y\nj\n≤ 3,652,425\ny\nj\n< y\nj+1\n(1 ≤ j < Q)\n入力値はすべて整数である．\nこの問題の判定には，15 点分のテストケースのグループが設定されている．このグループに含まれるテストケースは上記の制約に加えて下記の制約も満たす．\nN,Q,w\ni\n,y\nj\n≤ 1,000\n注意\n0 日目の復旧度は 0 である．\nw\ni\n=0\nの時，サービス\ni\nは 0 日目に復旧する．\n入出力例\n入力例1\n3 11\n1 0 2\n4 1 3\n7 2 4\n0\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n出力例1\n1\n3\n4\n0\n1\n3\n5\n7\n11\n19\n29\n46\n47\n48\n入力例2\n5 5\n10000 0 20\n10000 1 30\n10000 0 40\n10000 2 70\n30000 2 10000\n5000\n10000\n15000\n20000\n25000\n出力例2\n10000\n10000\n10000\n10000\n10039\n5000\n10000\n40711690801\n329498273301\n333383477320\n入力例3\n2 2\n3652425 0 1\n3652426 2 10000\n3652424\n3652425\n出力例3\n3652425\nMany years later\n3652424\n3652425\n2つ目のサービスは復旧する日にちが\n3,652,425\n日を超えているので\nMany years later\nと出力している．\nWriter : 森槙悟\nTester : 田村和範"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2411_10307782","code_snippet":"// AOJ #2411 Acceleration of Network\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nll Cinll() { // 整数の入力\n\tll n = 0; int c = gc();\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\nvoid Couts(const string &s) {\n for (char c : s) pc(c);\n pc('\\n');\n}\n\nconst int DMAX = 3652425;\nstruct TBL { ll weight; int type, x, triggerDay; };\nTBL tbl[100005];\nll levelHistory[DMAX+5];\n\nint main() {\n int n = Cin(), Q = Cin();\n\n for (int i = 0; i < n; ++i) {\n tbl[i].weight = Cinll(), tbl[i].type = Cin(), tbl[i].x = Cin();\n tbl[i].triggerDay = -1;\n }\n\n ll speed = 1;\n ll acc = 0;\n ll extraAcc = 0;\n ll level = -1;\n\n map<int, ll> speedMap;\n map<int, ll> accMap;\n map<int, ll> extraAccMap;\n\n int serviceIndex = 0;\n for (int day = 0; day <= DMAX; ++day) {\n acc += extraAcc;\n speed += acc;\n level += speed;\n levelHistory[day] = level;\n\n while (serviceIndex < n && tbl[serviceIndex].weight <= level) {\n tbl[serviceIndex].triggerDay = day;\n int x = tbl[serviceIndex].x;\n int type = tbl[serviceIndex].type;\n int futureDay = day + x;\n\n if (type == 0) {\n speed++;\n speedMap[futureDay] -= 1;\n } else if (type == 1) {\n acc++;\n accMap[futureDay] -= 1;\n speedMap[futureDay] -= x;\n } else {\n acc--;\n extraAcc += 2;\n extraAccMap[futureDay] -= 2;\n accMap[futureDay] -= (2 * x - 1);\n speedMap[futureDay] -= (x * x);\n }\n serviceIndex++;\n }\n\n if (extraAccMap.count(day)) {\n extraAcc += extraAccMap[day];\n extraAccMap.erase(day);\n }\n if (accMap.count(day)) {\n acc += accMap[day];\n accMap.erase(day);\n }\n if (speedMap.count(day)) {\n speed += speedMap[day];\n speedMap.erase(day);\n }\n }\n for (int i = 0; i < n; ++i) {\n if (tbl[i].triggerDay == -1) Couts(\"Many years later\");\n else Cout(tbl[i].triggerDay);\n }\n while (Q--) Cout(levelHistory[Cin()]);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":35528,"score_of_the_acc":-0.2553,"final_rank":3},{"submission_id":"aoj_2411_5960464","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};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int n, q; cin >> n >> q;\n \n vector<ll> ans(n,-1), ans2(q);\n vector<ll> w(n), t(n), x(n);\n REP(i,n) cin >> w[i] >> t[i] >> x[i];\n vector<ll> y(q);\n REP(i,q) cin >> y[i];\n int ptr1 = 0, ptr2 = 0;\n ll t0 = 0, t1 = 0, t2 = 0, t3 = 0;\n ll sum0 = 0, sum1 = 0, sum2 = 0;\n ll asum = 0;\n set<pair<int, int>> st;\n for(int i=0; i<=3652425; i++) {\n if(ptr2 < q && y[ptr2] == i) {\n ans2[ptr2] = asum;\n ptr2++;\n }\n \n while(ptr1 < n && w[ptr1] <= asum) {\n ans[ptr1] = i;\n st.insert({i+x[ptr1]-1, ptr1});\n if(t[ptr1] == 0) t0++;\n else if(t[ptr1] == 1) t1++;\n else t2++;\n\n ptr1++;\n }\n while(st.size() && st.begin()->first < i) {\n if(t[st.begin()->second] == 0) {\n t0--;\n }else if(t[st.begin()->second] == 1) {\n t1--;\n sum1 -= x[st.begin()->second];\n }else{\n sum2 -= x[st.begin()->second]*x[st.begin()->second];\n t3 -= x[st.begin()->second];\n t2--;\n }\n st.erase(st.begin());\n }\n sum1 += t1;\n sum2 += 2*t3 + t2;\n t3 += t2;\n asum += 1 + t0 + sum1 + sum2;\n asum = min(asum, (1LL<<60));\n }\n REP(i,n) {\n if(ans[i] == -1) cout << \"Many years later\" << '\\n';\n else cout << ans[i] << '\\n';\n }\n REP(i,q) {\n cout << ans2[i] << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":11772,"score_of_the_acc":-0.1344,"final_rank":1},{"submission_id":"aoj_2411_3643198","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#define MAX 3652425\n#define NUM 100005\n\nstruct Info{\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn w < arg.w;\n\t}\n\tll w,t,x,index;\n};\n\nstruct Data{\n\tData(ll arg_finish_day,ll arg_minus_A,ll arg_minus_B,ll arg_minus_C){\n\t\tfinish_day = arg_finish_day;\n\t\tminus_A = arg_minus_A;\n\t\tminus_B = arg_minus_B;\n\t\tminus_C = arg_minus_C;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\n\t\treturn finish_day > arg.finish_day; //終了日の昇順(PQ)\n\t}\n\n\tll finish_day,minus_A,minus_B,minus_C;\n};\n\nll N,num_query;\nll A,B,C;\nll REC_DAY[NUM],Y[NUM],value[MAX+1];\nInfo info[NUM];\n\n\nint main(){\n\n\tscanf(\"%lld %lld\",&N,&num_query);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tREC_DAY[i] = BIG_NUM;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lld %lld %lld\",&info[i].w,&info[i].t,&info[i].x);\n\t\tinfo[i].index = i;\n\t}\n\n\tsort(info,info+N);\n\n\tfor(int i = 0; i < num_query; i++){\n\n\t\tscanf(\"%lld\",&Y[i]);\n\t}\n\n\tll recovery = 0,num_recover = 0;\n\tll L,R,mid,max_index;\n\tA = 0, B = 0, C = 0;\n\n\tpriority_queue<Data> Q;\n\n\tfor(ll day = 0; day <= MAX; day++){\n\n\t\t//終了情報を反映\n\t\twhile(Q.empty() == false && Q.top().finish_day == day){\n\n\t\t\tA -= Q.top().minus_A;\n\t\t\tB -= Q.top().minus_B;\n\t\t\tC -= Q.top().minus_C;\n\t\t\tQ.pop();\n\t\t}\n\n\t\trecovery += A*day*day + B*day + C;\n\t\tvalue[day] = recovery;\n\n\t\tif(num_recover < N){\n\n\t\t\t//二分探索で、新たに復旧したサービスを調べる\n\t\t\tL = num_recover,R = N-1,mid = (L+R)/2;\n\t\t\tmax_index = num_recover-1;\n\n\t\t\twhile(L <= R){\n\n\t\t\t\tif(info[mid].w <= recovery){\n\n\t\t\t\t\tmax_index = mid;\n\t\t\t\t\tL = mid+1;\n\t\t\t\t}else{\n\n\t\t\t\t\tR = mid-1;\n\t\t\t\t}\n\t\t\t\tmid = (L+R)/2;\n\t\t\t}\n\n\t\t\tfor(int i = num_recover; i <= max_index; i++){\n\n\t\t\t\tREC_DAY[info[i].index] = day;\n\n\t\t\t\tswitch(info[i].t){\n\t\t\t\tcase 0:\n\t\t\t\t\tC += 1;\n\t\t\t\t\tQ.push(Data(day+1+info[i].x,0,0,1));\n\t\t\t\t\tbreak;\n\t\t\t\tcase 1:\n\t\t\t\t\tB += 1;\n\t\t\t\t\tC -= day;\n\t\t\t\t\tQ.push(Data(day+1+info[i].x,0,1,-day));\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tA += 1;\n\t\t\t\t\tB -= 2*day;\n\t\t\t\t\tC += day*day;\n\t\t\t\t\tQ.push(Data(day+1+info[i].x,1,-2*day,day*day));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tnum_recover = max_index+1;\n\n\t\t}\n\t\trecovery++;\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tif(REC_DAY[i] == BIG_NUM){\n\n\t\t\tprintf(\"Many years later\\n\");\n\t\t}else{\n\n\t\t\tprintf(\"%lld\\n\",REC_DAY[i]);\n\t\t}\n\t}\n\n\tfor(int i = 0; i < num_query; i++){\n\n\t\tprintf(\"%lld\\n\",value[Y[i]]);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":39408,"score_of_the_acc":-0.6535,"final_rank":4},{"submission_id":"aoj_2411_1431739","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define mp(a,b) make_pair((a),(b))\n#define debug(x) #x << \"=\" << (x)\n \n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define dump(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define dump(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\n//template<typename T> using vec=std::vector<T>;\n\nconst int INF=1<<30;\nconst long long int LLNF_=1LL<<58;\nconst double EPS=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n\tos << \"[\";\n\tfor (const auto &v : vec) {\n\t\tos << v << \",\";\n\t}\n\tos << \"]\";\n\treturn os;\n}\n\nstruct Service{\n\tll w;\n\tint t,x;\n\tbool operator<(const Service &s)const{\n\t\treturn true;\n\t}\n};\n\nvoid Solve(){\n\tint n,q;\n\tcin >> n >> q;\n\n\tqueue<Service> qs;\n\tvector<int> anss;\n\trep(i,0,n){\n\t\tll w;\n\t\tint t,x;\n\t\tcin >> w >> t >> x;\n\t\tqs.push(Service{w,t,x});\n\t}\n\t\n\tqueue<int> qy;\n\tvector<ll> ansy;\n\trep(i,0,q){\n\t\tint y;\n\t\tcin >> y;\n\t\tqy.push(y);\n\t}\n\t\n\tconst int limit=3652425;\n\tint num[3]={},days=0;\n\tll restore=0,accel[3]={};\n\tpriority_queue<pair<int,Service>,vector<pair<int,Service>>,greater<pair<int,Service>>> expire;\n\trep(i,0,limit+1){\n\t\tif(qy.size()&&i==qy.front()){\n\t\t\tansy.push_back(restore);\n\t\t\tqy.pop();\n\t\t}\n\t\t\n\t\twhile(qs.size()&&restore>=qs.front().w){\n\t\t\tanss.push_back(i);\n\t\t\tService service=qs.front();\n\t\t\tqs.pop();\n\t\t\t++num[service.t];\n\t\t\tif(service.t==0) ++accel[service.t];\n\t\t\texpire.push(mp(i+service.x,service));\n\t\t}\n\n\t\twhile(expire.size()&&expire.top().first==i){\n\t\t\tService service=expire.top().second;\n\t\t\texpire.pop();\n\t\t\t--num[service.t];\n\t\t\tif(service.t==0) --accel[service.t];\n\t\t\telse if(service.t==1) accel[service.t]-=service.x;\n\t\t\telse if(service.t==2){\n\t\t\t\taccel[service.t]-=(ll)service.x*service.x;\n\t\t\t\tdays-=service.x;\n\t\t\t}\n\t\t}\n\t\t\n\t\taccel[1]+=num[1];\n\t\taccel[2]+=2*days+num[2];\n\t\tdays+=num[2];\n\t\trep(j,0,3) restore+=accel[j];\n\t\t++restore;\n\t}\n\t\n\trep(i,0,n){\n\t\tif(anss.size()>i) cout << anss[i] << endl;\n\t\telse cout << \"Many years later\" << endl;\n\t}\n\trep(i,0,q) cout << ansy[i] << endl;\n}\n\nint main(){\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tSolve();\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":6888,"score_of_the_acc":-1,"final_rank":5},{"submission_id":"aoj_2411_1142987","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> pll;\n\nconst ll day_lim = 3652425;\n\nint main(){\n ll n,q;\n scanf(\"%lld%lld\",&n,&q);\n vector<ll> w(n),t(n),x(n);\n rep(i,n)scanf(\"%lld%lld%lld\",&w[i],&t[i],&x[i]);\n vector<ll> y(q);\n rep(i,q)scanf(\"%lld\",&y[i]);\n \n ll pn = 0, pq = 0;\n priority_queue< pll, vector<pll>, greater<pll> > end;\n vector<ll> ansn(n,day_lim+1), ansq(q,day_lim+1);\n ll day=0, sum = 0, a=0,b=0,c=1;\n\n while(day<=day_lim){\n if(pq<q && y[pq] == day){\n ansq[pq] = sum;\n pq++;\n }\n\n while(pn<n && w[pn]<=sum){\n ansn[pn] = day;\n if(t[pn] == 0){\n\tc++;\n }else if(t[pn] == 1){\n\tb++; c-=day;\n }else if(t[pn] == 2){\n\ta++; b-=2*day; c+=day*day;\n }\n end.push(pll(day+x[pn],pn));\n pn++;\n }\n\n while(end.size() && end.top().first==day){\n ll id = end.top().second; end.pop();\n if(t[id] == 0){\n\tc--;\n }else if(t[id] == 1){\n\tb--; c+=ansn[id];\n }else if(t[id] == 2){\n\ta--; b+=2*ansn[id]; c-=ansn[id]*ansn[id];\n }\n }\n\n day++;\n sum += a*day*day + b*day + c;\n if(pn == n && pq==q)break; \n }\n\n rep(i,n){\n if(ansn[i]>day_lim)puts(\"Many years later\");\n else printf(\"%lld\\n\",ansn[i]);\n }\n rep(i,q)printf(\"%lld\\n\",ansq[i]);\n}","accuracy":1,"time_ms":70,"memory_kb":7292,"score_of_the_acc":-0.1854,"final_rank":2},{"submission_id":"aoj_2411_907461","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652427];\nll sub_a[3652427];\nll sub_b[3652427];\nll sub_c[3652427];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n\n for(ll day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c++;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_c[day+services[next_target].speed_up_duration]++;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b++;\n\t c -= (day - 1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_b[day+services[next_target].speed_up_duration]++;\n\t sub_c[day+services[next_target].speed_up_duration] -= (day-1);\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a++;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_a[day+services[next_target].speed_up_duration]++;\n\t sub_b[day+services[next_target].speed_up_duration] -= 2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a -= sub_a[day];\n b -= sub_b[day];\n c -= sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":1,"time_ms":90,"memory_kb":119088,"score_of_the_acc":-1.2727,"final_rank":7},{"submission_id":"aoj_2411_907443","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652427];\nll sub_a[3652427];\nll sub_b[3652427];\nll sub_c[3652427];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n\n for(ll day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c++;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_c[day+services[next_target].speed_up_duration]++;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b++;\n\t c += -(day - 1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_b[day+services[next_target].speed_up_duration]++;\n\t sub_c[day+services[next_target].speed_up_duration] += -(day-1);\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a++;\n\t b += -2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_a[day+services[next_target].speed_up_duration]++;\n\t sub_b[day+services[next_target].speed_up_duration] += -2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a -= sub_a[day];\n b -= sub_b[day];\n c -= sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":1,"time_ms":90,"memory_kb":119004,"score_of_the_acc":-1.272,"final_rank":6},{"submission_id":"aoj_2411_907436","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652427];\nll sub_a[3652427];\nll sub_b[3652427];\nll sub_c[3652427];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n\n for(int day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c++;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_c[day+services[next_target].speed_up_duration]++;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b++;\n\t c += -(day - 1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_b[day+services[next_target].speed_up_duration]++;\n\t sub_c[day+services[next_target].speed_up_duration] += -(day-1);\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a++;\n\t b += -2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_a[day+services[next_target].speed_up_duration]++;\n\t sub_b[day+services[next_target].speed_up_duration] += -2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a -= sub_a[day];\n b -= sub_b[day];\n c -= sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118712,"score_of_the_acc":-1.133,"final_rank":17},{"submission_id":"aoj_2411_907419","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652427];\nll sub_a[3652427];\nll sub_b[3652427];\nll sub_c[3652427];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c += 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_c[day+services[next_target].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b += 1;\n\t c -= day - 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_b[day+services[next_target].speed_up_duration] -= 1;\n\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_a[day+services[next_target].speed_up_duration] -= 1;\n\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_907417","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c += 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_c[day+services[next_target].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b += 1;\n\t c -= day - 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_b[day+services[next_target].speed_up_duration] -= 1;\n\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\n\t sub_a[day+services[next_target].speed_up_duration] -= 1;\n\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118968,"score_of_the_acc":-1.1353,"final_rank":18},{"submission_id":"aoj_2411_907412","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,0,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=1;day <= 3652425 + 1;day++){\n\n ll recover_level = all_log[day-1];\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day - 1;\n\n\tif(services[next_target].type == 0){\n\t c += 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_c[day+services[next_target].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b += 1;\n\t c -= day - 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_b[day+services[next_target].speed_up_duration] -= 1;\n\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_a[day+services[next_target].speed_up_duration] -= 1;\n\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\n\t }\n\t}\n\tnext_target++;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n all_log[day] = recover_level + a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_907389","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=0;day <= 3652425;day++){\n recover_level += a * day * day + b * day + c;\n all_log[day] = recover_level;\n\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day;\n\n\tif(services[next_target].type == 0){\n\t c += 1;\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_c[day+services[next_target].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b += 1;\n\t c -= day;\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_b[day+services[next_target].speed_up_duration] -= 1;\n\t sub_c[day+services[next_target].speed_up_duration] += day;\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a += 1;\n\t b -= 2*day;\n\t c += day*day;\n\t if(day + services[next_target].speed_up_duration <= 3652425) {\n\t sub_a[day+services[next_target].speed_up_duration] -= 1;\n\t sub_b[day+services[next_target].speed_up_duration] += 2*day;\n\t sub_c[day+services[next_target].speed_up_duration] -= day * day;\n\t }\n\t}\n\tnext_target++;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n if(day == 0) c++; //default\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":119088,"score_of_the_acc":-1.1364,"final_rank":19},{"submission_id":"aoj_2411_907387","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=0;day <= 3652425;day++){\n recover_level += a * day * day + b * day + c;\n all_log[day] = recover_level;\n\n\n while(next_target < total_services \n\t && services[next_target].lower_bound <= recover_level){\n\trecover_log[services[next_target].service_idx] = day;\n\n\tif(services[next_target].type == 0){\n\t c += 1;\n\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\n\t sub_c[day+services[next_target].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[next_target].type == 1){\n\t b += 1;\n\t c -= day;\n\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\n\t sub_b[day+services[next_target].speed_up_duration] -= 1;\n\t sub_c[day+services[next_target].speed_up_duration] += day;\n\t }\n\t}\n\telse if(services[next_target].type == 2){\n\t a += 1;\n\t b -= 2*day;\n\t c += day*day;\n\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\n\t sub_a[day+services[next_target].speed_up_duration] -= 1;\n\t sub_b[day+services[next_target].speed_up_duration] += 2*day;\n\t sub_c[day+services[next_target].speed_up_duration] -= day * day;\n\t }\n\t}\n\tnext_target++;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n if(day == 0) c++; //default\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_907386","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=0;day <= 3652425;day++){\n recover_level += a * day * day + b * day + c;\n all_log[day] = recover_level;\n\n for(int i = next_target;\n\t (i < total_services)\n\t && (services[i].lower_bound <= recover_level);\n\t i++){\n\trecover_log[services[i].service_idx] = day;\n\n\tif(services[i].type == 0){\n\t c += 1;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day;\n\t }\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*day;\n\t c += day*day;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*day;\n\t sub_c[day+services[i].speed_up_duration] -= day * day;\n\t }\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n if(day == 0) c++; //default\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118456,"score_of_the_acc":-1.1307,"final_rank":15},{"submission_id":"aoj_2411_907384","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=0;day <= 3652425;day++){\n recover_level += a * day * day + b * day + c;\n all_log[day] = recover_level;\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level) break;\n\n\trecover_log[services[i].service_idx] = day;\n\n\tif(services[i].type == 0){\n\t c += 1;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t }\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day;\n\t }\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*day;\n\t c += day*day;\n\t if(day + day+services[i].speed_up_duration <= 3652425) {\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*day;\n\t sub_c[day+services[i].speed_up_duration] -= day * day;\n\t }\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n if(day == 0) c++; //default\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_907382","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\n\n sort(services.begin(),services.end());\n for(int day=0;day <= 3652425;day++){\n recover_level += a * day * day + b * day + c;\n all_log[day] = recover_level;\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level) break;\n\n\trecover_log[services[i].service_idx] = day;\n\n\tif(services[i].type == 0){\n\t c += 1;\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day;\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day;\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*day;\n\t c += day*day;\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*day;\n\t sub_c[day+services[i].speed_up_duration] -= day * day;\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n if(day == 0) c++;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118444,"score_of_the_acc":-1.1306,"final_rank":14},{"submission_id":"aoj_2411_907377","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652426];\nll sub_b[3652426];\nll sub_c[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n sort(services.begin(),services.end());\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n for(int day=0;day <= 3652425;day++){\n all_log[day] = recover_level;\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level) break;\n\trecover_log[services[i].service_idx] = day;\n\tif(services[i].type == 0){\n\t c += 1;\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day-1;\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day-1;\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n recover_level += a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118476,"score_of_the_acc":-1.1309,"final_rank":16},{"submission_id":"aoj_2411_907376","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652425];\nll sub_b[3652425];\nll sub_c[3652425];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\n bool operator<(const Service& s) const{\n return lower_bound < s.lower_bound;\n }\n bool operator>(const Service& s) const{\n return lower_bound > s.lower_bound;\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n sort(services.begin(),services.end());\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n for(int day=0;day <= 3652425;day++){\n all_log[day] = recover_level;\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level) break;\n\trecover_log[services[i].service_idx] = day;\n\tif(services[i].type == 0){\n\t c += 1;\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day-1;\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day-1;\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n recover_level += a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_907374","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll all_log[3652426];\nll sub_a[3652425];\nll sub_b[3652425];\nll sub_c[3652425];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n int day;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si),day(0){}\n\n Service(const Service& s,int _d){\n lower_bound = s.lower_bound;\n type = s.type;\n speed_up_duration = s.speed_up_duration;\n service_idx = s.service_idx;\n day = _d;\n }\n\n bool operator<(const Service& s) const{\n return day < s.day;\n }\n bool operator>(const Service& s) const{\n return day > s.day;\n }\n\n ll compute_recover(ll passed_days) const{\n if(type == 0){\n return 1;\n }\n else if(type == 1){\n return passed_days;\n }\n else if(type == 2){\n return passed_days * passed_days;\n }\n }\n ll compute_recover(ll first,ll last) const{\n last = min((ll)speed_up_duration,last);\n first = min((ll)speed_up_duration+1,first);\n\n ll minus = 0; \n if(first > 0){\n if(type == 0){\n\tminus = first - 1;\n }\n else if(type == 1){\n\tminus = (first-1) * (1 + (first-1)) / 2;\n }\n else if(type == 2){\n\tminus = (first-1)*(first)*(2*(first-1)+1) / 6;\n }\n }\n\n if(type == 0){\n return last - minus;\n }\n else if(type == 1){\n return last * (1 + last) / 2 - minus;\n }\n else if(type == 2){\n return last*(last+1)*(2*last+1) / 6 - minus;\n }\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(all_log,-1,sizeof(all_log));\n\n memset(sub_a,0,sizeof(sub_a));\n memset(sub_b,0,sizeof(sub_b));\n memset(sub_c,0,sizeof(sub_c));\n\n int next_target = 0;\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\n\n for(int day=0;day <= 3652425;day++){\n all_log[day] = recover_level;\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level) break;\n\trecover_log[i] = day;\n\tif(services[i].type == 0){\n\t c += 1;\n\t sub_c[day+services[i].speed_up_duration] -= 1;\n\t}\n\telse if(services[i].type == 1){\n\t b += 1;\n\t c -= day-1;\n\t sub_b[day+services[i].speed_up_duration] -= 1;\n\t sub_c[day+services[i].speed_up_duration] += day-1;\n\t}\n\telse if(services[i].type == 2){\n\t a += 1;\n\t b -= 2*(day-1);\n\t c += (day-1)*(day-1);\n\t sub_a[day+services[i].speed_up_duration] -= 1;\n\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\n\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\n\t}\n\tnext_target = i+1;\n }\n\n a += sub_a[day];\n b += sub_b[day];\n c += sub_c[day];\n recover_level += a * day * day + b * day + c;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",all_log[day]);\n }\n }\n}","accuracy":0.43333333333333335,"time_ms":60,"memory_kb":118432,"score_of_the_acc":-1.1305,"final_rank":8},{"submission_id":"aoj_2411_906567","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n\n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\nstatic const ll MAX = 1e15;\n \nstatic const int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n\nll recover_log[100001];\nll level_log[3652426];\n\nclass Service{\npublic:\n ll lower_bound;\n int type;\n int speed_up_duration;\n int service_idx;\n int day;\n Service(ll _l,int _t,int _s,int _si)\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si),day(0){}\n\n Service(const Service& s,int _d){\n lower_bound = s.lower_bound;\n type = s.type;\n speed_up_duration = s.speed_up_duration;\n service_idx = s.service_idx;\n day = _d;\n }\n\n bool operator<(const Service& s) const{\n return day + speed_up_duration < s.day + s.speed_up_duration;\n }\n bool operator>(const Service& s) const{\n return day + speed_up_duration > s.day + s.speed_up_duration;\n }\n\n ll compute_recover(ll passed_days) const{\n if(type == 0){\n return 1;\n }\n else if(type == 1){\n return passed_days;\n }\n else if(type == 2){\n return passed_days * passed_days;\n }\n }\n ll compute_recover(ll first,ll last) const{\n last = min((ll)speed_up_duration,last);\n first = min((ll)speed_up_duration+1,first);\n\n ll minus = 0; \n if(first > 0){\n if(type == 0){\n\tminus = first - 1;\n }\n else if(type == 1){\n\tminus = (first-1) * (1 + (first-1)) / 2;\n }\n else if(type == 2){\n\tminus = (first-1)*(first)*(2*(first-1)+1) / 6;\n }\n }\n\n if(type == 0){\n return last - minus;\n }\n else if(type == 1){\n return last * (1 + last) / 2 - minus;\n }\n else if(type == 2){\n return last*(last+1)*(2*last+1) / 6 - minus;\n }\n }\n};\n\nint main(){\n int total_services;\n int seek_duration;\n\n while(~scanf(\"%d %d\",&total_services,&seek_duration)){\n\n vector<Service> services;\n for(int service_idx = 0; service_idx < total_services; service_idx++){\n ll lower_bound;\n int type;\n int speed_up_duration;\n scanf(\"%lld %d %d\",&lower_bound,&type,&speed_up_duration);\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\n }\n\n ll recover_level = 0;\n memset(recover_log,-1,sizeof(recover_log)); \n memset(level_log,-1,sizeof(level_log));\n\n set<Service,greater<Service> > provider;\n \n int next_target = 0;\n for(int day=0;day <= 3652425;day++){\n ll add_recover_level = 0;\n\n for(set<Service>::iterator it = provider.begin();\n\t it != provider.end();\n\t it++){\n\tll passed_days = day - it->day;\n\tif(passed_days > it->speed_up_duration) break;\n\tadd_recover_level += it->compute_recover(passed_days);\n }\n\n for(int i = next_target; i < total_services; i++){\n\tif(services[i].lower_bound > recover_level + add_recover_level) break;\n\tif(recover_log[i] != -1) break;\n\trecover_log[i] = day;\n\tprovider.insert(Service(services[i],day));\n\tnext_target = i+1;\n }\n\n level_log[day] = recover_level + add_recover_level; \n recover_level += add_recover_level + 1;\n }\n\n for(int service_idx = 0; service_idx < total_services;service_idx++){\n if(recover_log[service_idx] == -1){\n\tprintf(\"Many years later\\n\");\n }\n else {\n\tprintf(\"%lld\\n\",recover_log[service_idx]);\n }\n }\n\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\n int day;\n scanf(\"%d\",&day);\n printf(\"%lld\\n\",level_log[day]);\n }\n }\n}","accuracy":0.03333333333333333,"time_ms":40,"memory_kb":30600,"score_of_the_acc":-0.2568,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2411_10307782\",\n \"code_snippet\": \"// AOJ #2411 Acceleration of Network\\n// 2025.3.17\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() { // 整数の入力\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nll Cinll() { // 整数の入力\\n\\tll n = 0; int c = gc();\\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\\nvoid Couts(const string &s) {\\n for (char c : s) pc(c);\\n pc('\\\\n');\\n}\\n\\nconst int DMAX = 3652425;\\nstruct TBL { ll weight; int type, x, triggerDay; };\\nTBL tbl[100005];\\nll levelHistory[DMAX+5];\\n\\nint main() {\\n int n = Cin(), Q = Cin();\\n\\n for (int i = 0; i < n; ++i) {\\n tbl[i].weight = Cinll(), tbl[i].type = Cin(), tbl[i].x = Cin();\\n tbl[i].triggerDay = -1;\\n }\\n\\n ll speed = 1;\\n ll acc = 0;\\n ll extraAcc = 0;\\n ll level = -1;\\n\\n map<int, ll> speedMap;\\n map<int, ll> accMap;\\n map<int, ll> extraAccMap;\\n\\n int serviceIndex = 0;\\n for (int day = 0; day <= DMAX; ++day) {\\n acc += extraAcc;\\n speed += acc;\\n level += speed;\\n levelHistory[day] = level;\\n\\n while (serviceIndex < n && tbl[serviceIndex].weight <= level) {\\n tbl[serviceIndex].triggerDay = day;\\n int x = tbl[serviceIndex].x;\\n int type = tbl[serviceIndex].type;\\n int futureDay = day + x;\\n\\n if (type == 0) {\\n speed++;\\n speedMap[futureDay] -= 1;\\n } else if (type == 1) {\\n acc++;\\n accMap[futureDay] -= 1;\\n speedMap[futureDay] -= x;\\n } else {\\n acc--;\\n extraAcc += 2;\\n extraAccMap[futureDay] -= 2;\\n accMap[futureDay] -= (2 * x - 1);\\n speedMap[futureDay] -= (x * x);\\n }\\n serviceIndex++;\\n }\\n\\n if (extraAccMap.count(day)) {\\n extraAcc += extraAccMap[day];\\n extraAccMap.erase(day);\\n }\\n if (accMap.count(day)) {\\n acc += accMap[day];\\n accMap.erase(day);\\n }\\n if (speedMap.count(day)) {\\n speed += speedMap[day];\\n speedMap.erase(day);\\n }\\n }\\n for (int i = 0; i < n; ++i) {\\n if (tbl[i].triggerDay == -1) Couts(\\\"Many years later\\\");\\n else Cout(tbl[i].triggerDay);\\n }\\n while (Q--) Cout(levelHistory[Cin()]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 35528,\n \"score_of_the_acc\": -0.2553,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2411_5960464\",\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};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n int n, q; cin >> n >> q;\\n \\n vector<ll> ans(n,-1), ans2(q);\\n vector<ll> w(n), t(n), x(n);\\n REP(i,n) cin >> w[i] >> t[i] >> x[i];\\n vector<ll> y(q);\\n REP(i,q) cin >> y[i];\\n int ptr1 = 0, ptr2 = 0;\\n ll t0 = 0, t1 = 0, t2 = 0, t3 = 0;\\n ll sum0 = 0, sum1 = 0, sum2 = 0;\\n ll asum = 0;\\n set<pair<int, int>> st;\\n for(int i=0; i<=3652425; i++) {\\n if(ptr2 < q && y[ptr2] == i) {\\n ans2[ptr2] = asum;\\n ptr2++;\\n }\\n \\n while(ptr1 < n && w[ptr1] <= asum) {\\n ans[ptr1] = i;\\n st.insert({i+x[ptr1]-1, ptr1});\\n if(t[ptr1] == 0) t0++;\\n else if(t[ptr1] == 1) t1++;\\n else t2++;\\n\\n ptr1++;\\n }\\n while(st.size() && st.begin()->first < i) {\\n if(t[st.begin()->second] == 0) {\\n t0--;\\n }else if(t[st.begin()->second] == 1) {\\n t1--;\\n sum1 -= x[st.begin()->second];\\n }else{\\n sum2 -= x[st.begin()->second]*x[st.begin()->second];\\n t3 -= x[st.begin()->second];\\n t2--;\\n }\\n st.erase(st.begin());\\n }\\n sum1 += t1;\\n sum2 += 2*t3 + t2;\\n t3 += t2;\\n asum += 1 + t0 + sum1 + sum2;\\n asum = min(asum, (1LL<<60));\\n }\\n REP(i,n) {\\n if(ans[i] == -1) cout << \\\"Many years later\\\" << '\\\\n';\\n else cout << ans[i] << '\\\\n';\\n }\\n REP(i,q) {\\n cout << ans2[i] << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11772,\n \"score_of_the_acc\": -0.1344,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2411_3643198\",\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#define MAX 3652425\\n#define NUM 100005\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn w < arg.w;\\n\\t}\\n\\tll w,t,x,index;\\n};\\n\\nstruct Data{\\n\\tData(ll arg_finish_day,ll arg_minus_A,ll arg_minus_B,ll arg_minus_C){\\n\\t\\tfinish_day = arg_finish_day;\\n\\t\\tminus_A = arg_minus_A;\\n\\t\\tminus_B = arg_minus_B;\\n\\t\\tminus_C = arg_minus_C;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\n\\t\\treturn finish_day > arg.finish_day; //終了日の昇順(PQ)\\n\\t}\\n\\n\\tll finish_day,minus_A,minus_B,minus_C;\\n};\\n\\nll N,num_query;\\nll A,B,C;\\nll REC_DAY[NUM],Y[NUM],value[MAX+1];\\nInfo info[NUM];\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%lld %lld\\\",&N,&num_query);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tREC_DAY[i] = BIG_NUM;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lld %lld %lld\\\",&info[i].w,&info[i].t,&info[i].x);\\n\\t\\tinfo[i].index = i;\\n\\t}\\n\\n\\tsort(info,info+N);\\n\\n\\tfor(int i = 0; i < num_query; i++){\\n\\n\\t\\tscanf(\\\"%lld\\\",&Y[i]);\\n\\t}\\n\\n\\tll recovery = 0,num_recover = 0;\\n\\tll L,R,mid,max_index;\\n\\tA = 0, B = 0, C = 0;\\n\\n\\tpriority_queue<Data> Q;\\n\\n\\tfor(ll day = 0; day <= MAX; day++){\\n\\n\\t\\t//終了情報を反映\\n\\t\\twhile(Q.empty() == false && Q.top().finish_day == day){\\n\\n\\t\\t\\tA -= Q.top().minus_A;\\n\\t\\t\\tB -= Q.top().minus_B;\\n\\t\\t\\tC -= Q.top().minus_C;\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\n\\t\\trecovery += A*day*day + B*day + C;\\n\\t\\tvalue[day] = recovery;\\n\\n\\t\\tif(num_recover < N){\\n\\n\\t\\t\\t//二分探索で、新たに復旧したサービスを調べる\\n\\t\\t\\tL = num_recover,R = N-1,mid = (L+R)/2;\\n\\t\\t\\tmax_index = num_recover-1;\\n\\n\\t\\t\\twhile(L <= R){\\n\\n\\t\\t\\t\\tif(info[mid].w <= recovery){\\n\\n\\t\\t\\t\\t\\tmax_index = mid;\\n\\t\\t\\t\\t\\tL = mid+1;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tR = mid-1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmid = (L+R)/2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = num_recover; i <= max_index; i++){\\n\\n\\t\\t\\t\\tREC_DAY[info[i].index] = day;\\n\\n\\t\\t\\t\\tswitch(info[i].t){\\n\\t\\t\\t\\tcase 0:\\n\\t\\t\\t\\t\\tC += 1;\\n\\t\\t\\t\\t\\tQ.push(Data(day+1+info[i].x,0,0,1));\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\tB += 1;\\n\\t\\t\\t\\t\\tC -= day;\\n\\t\\t\\t\\t\\tQ.push(Data(day+1+info[i].x,0,1,-day));\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\tA += 1;\\n\\t\\t\\t\\t\\tB -= 2*day;\\n\\t\\t\\t\\t\\tC += day*day;\\n\\t\\t\\t\\t\\tQ.push(Data(day+1+info[i].x,1,-2*day,day*day));\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tnum_recover = max_index+1;\\n\\n\\t\\t}\\n\\t\\trecovery++;\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tif(REC_DAY[i] == BIG_NUM){\\n\\n\\t\\t\\tprintf(\\\"Many years later\\\\n\\\");\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\"%lld\\\\n\\\",REC_DAY[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < num_query; i++){\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",value[Y[i]]);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 39408,\n \"score_of_the_acc\": -0.6535,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2411_1431739\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define mp(a,b) make_pair((a),(b))\\n#define debug(x) #x << \\\"=\\\" << (x)\\n \\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define dump(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define dump(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\n//template<typename T> using vec=std::vector<T>;\\n\\nconst int INF=1<<30;\\nconst long long int LLNF_=1LL<<58;\\nconst double EPS=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n\\tos << \\\"[\\\";\\n\\tfor (const auto &v : vec) {\\n\\t\\tos << v << \\\",\\\";\\n\\t}\\n\\tos << \\\"]\\\";\\n\\treturn os;\\n}\\n\\nstruct Service{\\n\\tll w;\\n\\tint t,x;\\n\\tbool operator<(const Service &s)const{\\n\\t\\treturn true;\\n\\t}\\n};\\n\\nvoid Solve(){\\n\\tint n,q;\\n\\tcin >> n >> q;\\n\\n\\tqueue<Service> qs;\\n\\tvector<int> anss;\\n\\trep(i,0,n){\\n\\t\\tll w;\\n\\t\\tint t,x;\\n\\t\\tcin >> w >> t >> x;\\n\\t\\tqs.push(Service{w,t,x});\\n\\t}\\n\\t\\n\\tqueue<int> qy;\\n\\tvector<ll> ansy;\\n\\trep(i,0,q){\\n\\t\\tint y;\\n\\t\\tcin >> y;\\n\\t\\tqy.push(y);\\n\\t}\\n\\t\\n\\tconst int limit=3652425;\\n\\tint num[3]={},days=0;\\n\\tll restore=0,accel[3]={};\\n\\tpriority_queue<pair<int,Service>,vector<pair<int,Service>>,greater<pair<int,Service>>> expire;\\n\\trep(i,0,limit+1){\\n\\t\\tif(qy.size()&&i==qy.front()){\\n\\t\\t\\tansy.push_back(restore);\\n\\t\\t\\tqy.pop();\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile(qs.size()&&restore>=qs.front().w){\\n\\t\\t\\tanss.push_back(i);\\n\\t\\t\\tService service=qs.front();\\n\\t\\t\\tqs.pop();\\n\\t\\t\\t++num[service.t];\\n\\t\\t\\tif(service.t==0) ++accel[service.t];\\n\\t\\t\\texpire.push(mp(i+service.x,service));\\n\\t\\t}\\n\\n\\t\\twhile(expire.size()&&expire.top().first==i){\\n\\t\\t\\tService service=expire.top().second;\\n\\t\\t\\texpire.pop();\\n\\t\\t\\t--num[service.t];\\n\\t\\t\\tif(service.t==0) --accel[service.t];\\n\\t\\t\\telse if(service.t==1) accel[service.t]-=service.x;\\n\\t\\t\\telse if(service.t==2){\\n\\t\\t\\t\\taccel[service.t]-=(ll)service.x*service.x;\\n\\t\\t\\t\\tdays-=service.x;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\taccel[1]+=num[1];\\n\\t\\taccel[2]+=2*days+num[2];\\n\\t\\tdays+=num[2];\\n\\t\\trep(j,0,3) restore+=accel[j];\\n\\t\\t++restore;\\n\\t}\\n\\t\\n\\trep(i,0,n){\\n\\t\\tif(anss.size()>i) cout << anss[i] << endl;\\n\\t\\telse cout << \\\"Many years later\\\" << endl;\\n\\t}\\n\\trep(i,0,q) cout << ansy[i] << endl;\\n}\\n\\nint main(){\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tSolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 6888,\n \"score_of_the_acc\": -1,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2411_1142987\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> pll;\\n\\nconst ll day_lim = 3652425;\\n\\nint main(){\\n ll n,q;\\n scanf(\\\"%lld%lld\\\",&n,&q);\\n vector<ll> w(n),t(n),x(n);\\n rep(i,n)scanf(\\\"%lld%lld%lld\\\",&w[i],&t[i],&x[i]);\\n vector<ll> y(q);\\n rep(i,q)scanf(\\\"%lld\\\",&y[i]);\\n \\n ll pn = 0, pq = 0;\\n priority_queue< pll, vector<pll>, greater<pll> > end;\\n vector<ll> ansn(n,day_lim+1), ansq(q,day_lim+1);\\n ll day=0, sum = 0, a=0,b=0,c=1;\\n\\n while(day<=day_lim){\\n if(pq<q && y[pq] == day){\\n ansq[pq] = sum;\\n pq++;\\n }\\n\\n while(pn<n && w[pn]<=sum){\\n ansn[pn] = day;\\n if(t[pn] == 0){\\n\\tc++;\\n }else if(t[pn] == 1){\\n\\tb++; c-=day;\\n }else if(t[pn] == 2){\\n\\ta++; b-=2*day; c+=day*day;\\n }\\n end.push(pll(day+x[pn],pn));\\n pn++;\\n }\\n\\n while(end.size() && end.top().first==day){\\n ll id = end.top().second; end.pop();\\n if(t[id] == 0){\\n\\tc--;\\n }else if(t[id] == 1){\\n\\tb--; c+=ansn[id];\\n }else if(t[id] == 2){\\n\\ta--; b+=2*ansn[id]; c-=ansn[id]*ansn[id];\\n }\\n }\\n\\n day++;\\n sum += a*day*day + b*day + c;\\n if(pn == n && pq==q)break; \\n }\\n\\n rep(i,n){\\n if(ansn[i]>day_lim)puts(\\\"Many years later\\\");\\n else printf(\\\"%lld\\\\n\\\",ansn[i]);\\n }\\n rep(i,q)printf(\\\"%lld\\\\n\\\",ansq[i]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7292,\n \"score_of_the_acc\": -0.1854,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2411_907461\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652427];\\nll sub_a[3652427];\\nll sub_b[3652427];\\nll sub_c[3652427];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n\\n for(ll day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c++;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_c[day+services[next_target].speed_up_duration]++;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b++;\\n\\t c -= (day - 1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_b[day+services[next_target].speed_up_duration]++;\\n\\t sub_c[day+services[next_target].speed_up_duration] -= (day-1);\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a++;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_a[day+services[next_target].speed_up_duration]++;\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a -= sub_a[day];\\n b -= sub_b[day];\\n c -= sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 119088,\n \"score_of_the_acc\": -1.2727,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2411_907443\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652427];\\nll sub_a[3652427];\\nll sub_b[3652427];\\nll sub_c[3652427];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n\\n for(ll day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c++;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_c[day+services[next_target].speed_up_duration]++;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b++;\\n\\t c += -(day - 1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_b[day+services[next_target].speed_up_duration]++;\\n\\t sub_c[day+services[next_target].speed_up_duration] += -(day-1);\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a++;\\n\\t b += -2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_a[day+services[next_target].speed_up_duration]++;\\n\\t sub_b[day+services[next_target].speed_up_duration] += -2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a -= sub_a[day];\\n b -= sub_b[day];\\n c -= sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 119004,\n \"score_of_the_acc\": -1.272,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2411_907436\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652427];\\nll sub_a[3652427];\\nll sub_b[3652427];\\nll sub_c[3652427];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n\\n for(int day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c++;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_c[day+services[next_target].speed_up_duration]++;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b++;\\n\\t c += -(day - 1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_b[day+services[next_target].speed_up_duration]++;\\n\\t sub_c[day+services[next_target].speed_up_duration] += -(day-1);\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a++;\\n\\t b += -2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_a[day+services[next_target].speed_up_duration]++;\\n\\t sub_b[day+services[next_target].speed_up_duration] += -2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] += (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a -= sub_a[day];\\n b -= sub_b[day];\\n c -= sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118712,\n \"score_of_the_acc\": -1.133,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2411_907419\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652427];\\nll sub_a[3652427];\\nll sub_b[3652427];\\nll sub_c[3652427];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c += 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_c[day+services[next_target].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b += 1;\\n\\t c -= day - 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_a[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_907417\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c += 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_c[day+services[next_target].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b += 1;\\n\\t c -= day - 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425 + 1) {\\n\\t sub_a[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118968,\n \"score_of_the_acc\": -1.1353,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2411_907412\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,0,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=1;day <= 3652425 + 1;day++){\\n\\n ll recover_level = all_log[day-1];\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day - 1;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c += 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_c[day+services[next_target].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b += 1;\\n\\t c -= day - 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_c[day+services[next_target].speed_up_duration] += day - 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_a[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_b[day+services[next_target].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[next_target].speed_up_duration] -= (day-1) * (day-1);\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n all_log[day] = recover_level + a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_907389\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=0;day <= 3652425;day++){\\n recover_level += a * day * day + b * day + c;\\n all_log[day] = recover_level;\\n\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c += 1;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_c[day+services[next_target].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b += 1;\\n\\t c -= day;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_c[day+services[next_target].speed_up_duration] += day;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a += 1;\\n\\t b -= 2*day;\\n\\t c += day*day;\\n\\t if(day + services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_a[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_b[day+services[next_target].speed_up_duration] += 2*day;\\n\\t sub_c[day+services[next_target].speed_up_duration] -= day * day;\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n if(day == 0) c++; //default\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 119088,\n \"score_of_the_acc\": -1.1364,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2411_907387\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=0;day <= 3652425;day++){\\n recover_level += a * day * day + b * day + c;\\n all_log[day] = recover_level;\\n\\n\\n while(next_target < total_services \\n\\t && services[next_target].lower_bound <= recover_level){\\n\\trecover_log[services[next_target].service_idx] = day;\\n\\n\\tif(services[next_target].type == 0){\\n\\t c += 1;\\n\\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_c[day+services[next_target].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 1){\\n\\t b += 1;\\n\\t c -= day;\\n\\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_b[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_c[day+services[next_target].speed_up_duration] += day;\\n\\t }\\n\\t}\\n\\telse if(services[next_target].type == 2){\\n\\t a += 1;\\n\\t b -= 2*day;\\n\\t c += day*day;\\n\\t if(day + day+services[next_target].speed_up_duration <= 3652425) {\\n\\t sub_a[day+services[next_target].speed_up_duration] -= 1;\\n\\t sub_b[day+services[next_target].speed_up_duration] += 2*day;\\n\\t sub_c[day+services[next_target].speed_up_duration] -= day * day;\\n\\t }\\n\\t}\\n\\tnext_target++;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n if(day == 0) c++; //default\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_907386\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=0;day <= 3652425;day++){\\n recover_level += a * day * day + b * day + c;\\n all_log[day] = recover_level;\\n\\n for(int i = next_target;\\n\\t (i < total_services)\\n\\t && (services[i].lower_bound <= recover_level);\\n\\t i++){\\n\\trecover_log[services[i].service_idx] = day;\\n\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day;\\n\\t }\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*day;\\n\\t c += day*day;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*day;\\n\\t sub_c[day+services[i].speed_up_duration] -= day * day;\\n\\t }\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n if(day == 0) c++; //default\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118456,\n \"score_of_the_acc\": -1.1307,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2411_907384\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=0;day <= 3652425;day++){\\n recover_level += a * day * day + b * day + c;\\n all_log[day] = recover_level;\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level) break;\\n\\n\\trecover_log[services[i].service_idx] = day;\\n\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t }\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day;\\n\\t }\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*day;\\n\\t c += day*day;\\n\\t if(day + day+services[i].speed_up_duration <= 3652425) {\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*day;\\n\\t sub_c[day+services[i].speed_up_duration] -= day * day;\\n\\t }\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n if(day == 0) c++; //default\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_907382\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=0;//f = ax^2 + b^x+c\\n\\n sort(services.begin(),services.end());\\n for(int day=0;day <= 3652425;day++){\\n recover_level += a * day * day + b * day + c;\\n all_log[day] = recover_level;\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level) break;\\n\\n\\trecover_log[services[i].service_idx] = day;\\n\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day;\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day;\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*day;\\n\\t c += day*day;\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*day;\\n\\t sub_c[day+services[i].speed_up_duration] -= day * day;\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n if(day == 0) c++;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118444,\n \"score_of_the_acc\": -1.1306,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2411_907377\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652426];\\nll sub_b[3652426];\\nll sub_c[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n sort(services.begin(),services.end());\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n for(int day=0;day <= 3652425;day++){\\n all_log[day] = recover_level;\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level) break;\\n\\trecover_log[services[i].service_idx] = day;\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day-1;\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day-1;\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n recover_level += a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118476,\n \"score_of_the_acc\": -1.1309,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2411_907376\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652425];\\nll sub_b[3652425];\\nll sub_c[3652425];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si){}\\n bool operator<(const Service& s) const{\\n return lower_bound < s.lower_bound;\\n }\\n bool operator>(const Service& s) const{\\n return lower_bound > s.lower_bound;\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n sort(services.begin(),services.end());\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n for(int day=0;day <= 3652425;day++){\\n all_log[day] = recover_level;\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level) break;\\n\\trecover_log[services[i].service_idx] = day;\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day-1;\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day-1;\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n recover_level += a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_907374\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll all_log[3652426];\\nll sub_a[3652425];\\nll sub_b[3652425];\\nll sub_c[3652425];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n int day;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si),day(0){}\\n\\n Service(const Service& s,int _d){\\n lower_bound = s.lower_bound;\\n type = s.type;\\n speed_up_duration = s.speed_up_duration;\\n service_idx = s.service_idx;\\n day = _d;\\n }\\n\\n bool operator<(const Service& s) const{\\n return day < s.day;\\n }\\n bool operator>(const Service& s) const{\\n return day > s.day;\\n }\\n\\n ll compute_recover(ll passed_days) const{\\n if(type == 0){\\n return 1;\\n }\\n else if(type == 1){\\n return passed_days;\\n }\\n else if(type == 2){\\n return passed_days * passed_days;\\n }\\n }\\n ll compute_recover(ll first,ll last) const{\\n last = min((ll)speed_up_duration,last);\\n first = min((ll)speed_up_duration+1,first);\\n\\n ll minus = 0; \\n if(first > 0){\\n if(type == 0){\\n\\tminus = first - 1;\\n }\\n else if(type == 1){\\n\\tminus = (first-1) * (1 + (first-1)) / 2;\\n }\\n else if(type == 2){\\n\\tminus = (first-1)*(first)*(2*(first-1)+1) / 6;\\n }\\n }\\n\\n if(type == 0){\\n return last - minus;\\n }\\n else if(type == 1){\\n return last * (1 + last) / 2 - minus;\\n }\\n else if(type == 2){\\n return last*(last+1)*(2*last+1) / 6 - minus;\\n }\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(all_log,-1,sizeof(all_log));\\n\\n memset(sub_a,0,sizeof(sub_a));\\n memset(sub_b,0,sizeof(sub_b));\\n memset(sub_c,0,sizeof(sub_c));\\n\\n int next_target = 0;\\n ll a=0,b=0,c=1;//f = ax^2 + b^x+c\\n\\n for(int day=0;day <= 3652425;day++){\\n all_log[day] = recover_level;\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level) break;\\n\\trecover_log[i] = day;\\n\\tif(services[i].type == 0){\\n\\t c += 1;\\n\\t sub_c[day+services[i].speed_up_duration] -= 1;\\n\\t}\\n\\telse if(services[i].type == 1){\\n\\t b += 1;\\n\\t c -= day-1;\\n\\t sub_b[day+services[i].speed_up_duration] -= 1;\\n\\t sub_c[day+services[i].speed_up_duration] += day-1;\\n\\t}\\n\\telse if(services[i].type == 2){\\n\\t a += 1;\\n\\t b -= 2*(day-1);\\n\\t c += (day-1)*(day-1);\\n\\t sub_a[day+services[i].speed_up_duration] -= 1;\\n\\t sub_b[day+services[i].speed_up_duration] += 2*(day-1);\\n\\t sub_c[day+services[i].speed_up_duration] -= (day-1) * (day-1);\\n\\t}\\n\\tnext_target = i+1;\\n }\\n\\n a += sub_a[day];\\n b += sub_b[day];\\n c += sub_c[day];\\n recover_level += a * day * day + b * day + c;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",all_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.43333333333333335,\n \"time_ms\": 60,\n \"memory_kb\": 118432,\n \"score_of_the_acc\": -1.1305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2411_906567\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n\\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\nstatic const ll MAX = 1e15;\\n \\nstatic const int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n\\nll recover_log[100001];\\nll level_log[3652426];\\n\\nclass Service{\\npublic:\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n int service_idx;\\n int day;\\n Service(ll _l,int _t,int _s,int _si)\\n : lower_bound(_l),type(_t),speed_up_duration(_s),service_idx(_si),day(0){}\\n\\n Service(const Service& s,int _d){\\n lower_bound = s.lower_bound;\\n type = s.type;\\n speed_up_duration = s.speed_up_duration;\\n service_idx = s.service_idx;\\n day = _d;\\n }\\n\\n bool operator<(const Service& s) const{\\n return day + speed_up_duration < s.day + s.speed_up_duration;\\n }\\n bool operator>(const Service& s) const{\\n return day + speed_up_duration > s.day + s.speed_up_duration;\\n }\\n\\n ll compute_recover(ll passed_days) const{\\n if(type == 0){\\n return 1;\\n }\\n else if(type == 1){\\n return passed_days;\\n }\\n else if(type == 2){\\n return passed_days * passed_days;\\n }\\n }\\n ll compute_recover(ll first,ll last) const{\\n last = min((ll)speed_up_duration,last);\\n first = min((ll)speed_up_duration+1,first);\\n\\n ll minus = 0; \\n if(first > 0){\\n if(type == 0){\\n\\tminus = first - 1;\\n }\\n else if(type == 1){\\n\\tminus = (first-1) * (1 + (first-1)) / 2;\\n }\\n else if(type == 2){\\n\\tminus = (first-1)*(first)*(2*(first-1)+1) / 6;\\n }\\n }\\n\\n if(type == 0){\\n return last - minus;\\n }\\n else if(type == 1){\\n return last * (1 + last) / 2 - minus;\\n }\\n else if(type == 2){\\n return last*(last+1)*(2*last+1) / 6 - minus;\\n }\\n }\\n};\\n\\nint main(){\\n int total_services;\\n int seek_duration;\\n\\n while(~scanf(\\\"%d %d\\\",&total_services,&seek_duration)){\\n\\n vector<Service> services;\\n for(int service_idx = 0; service_idx < total_services; service_idx++){\\n ll lower_bound;\\n int type;\\n int speed_up_duration;\\n scanf(\\\"%lld %d %d\\\",&lower_bound,&type,&speed_up_duration);\\n services.push_back(Service(lower_bound,type,speed_up_duration,service_idx));\\n }\\n\\n ll recover_level = 0;\\n memset(recover_log,-1,sizeof(recover_log)); \\n memset(level_log,-1,sizeof(level_log));\\n\\n set<Service,greater<Service> > provider;\\n \\n int next_target = 0;\\n for(int day=0;day <= 3652425;day++){\\n ll add_recover_level = 0;\\n\\n for(set<Service>::iterator it = provider.begin();\\n\\t it != provider.end();\\n\\t it++){\\n\\tll passed_days = day - it->day;\\n\\tif(passed_days > it->speed_up_duration) break;\\n\\tadd_recover_level += it->compute_recover(passed_days);\\n }\\n\\n for(int i = next_target; i < total_services; i++){\\n\\tif(services[i].lower_bound > recover_level + add_recover_level) break;\\n\\tif(recover_log[i] != -1) break;\\n\\trecover_log[i] = day;\\n\\tprovider.insert(Service(services[i],day));\\n\\tnext_target = i+1;\\n }\\n\\n level_log[day] = recover_level + add_recover_level; \\n recover_level += add_recover_level + 1;\\n }\\n\\n for(int service_idx = 0; service_idx < total_services;service_idx++){\\n if(recover_log[service_idx] == -1){\\n\\tprintf(\\\"Many years later\\\\n\\\");\\n }\\n else {\\n\\tprintf(\\\"%lld\\\\n\\\",recover_log[service_idx]);\\n }\\n }\\n\\n for(int seek_idx = 0; seek_idx < seek_duration; seek_idx++){\\n int day;\\n scanf(\\\"%d\\\",&day);\\n printf(\\\"%lld\\\\n\\\",level_log[day]);\\n }\\n }\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 40,\n \"memory_kb\": 30600,\n \"score_of_the_acc\": -0.2568,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1378,"cells":{"group_id":{"kind":"string","value":"aoj_2415_cpp"},"problem_description":{"kind":"string","value":"J - 刺身\n問題文\nきつねのしえるは川で釣りをしていた．黒くて細長い魚を手に入れることができたので，その場で切り刻んで刺身にして食べることにした．\n魚は体長が\nN\nセンチメートルある．奇妙なことに，この魚は身体の部分ごとに密度が異なっていた．\n魚の身体を頭から 1 センチメートルごとに区切って番号を\n1, 2, ..., N\nと付けるとき，身体の\ni\n番目の部分の重みは\nw_i\nであった．\n魚の\ni\n番目から\nj\n番目までの部分を\n[i..j]\nと表すことにする．\n最初，しえるは魚の身体\n[0..N-1]\nを 1 枚だけ持っていると見なせる．しえるはこれを切っていき最終的に\nN\n個に分割された魚の身体\n[0..0], [1..1], ..., [N-1..N-1]\nを得たい．\nしえるは今野外におり，まな板などを持っていないので，次のようなアクロバティックな方法で魚の身体を切っていくことにした ： まず，魚の身体を 1 枚取る．これを\n[i..j]\nとする．この魚の身体は長さが少なくとも 2 センチメートル以上でなければならない．すなわち，\nj-i ≥ 1\nでなければならない．次に，それを空中に投げる．そして日本刀を手に持ち，宙に舞う魚を真っ二つに切る．このとき，しえるは強靭な運動神経によって任意の位置でこの魚を切ることができるが，必ず 1 センチメートル区切りの位置で切るものとする．これにより，元の魚の身体\n[i..j]\nを，任意の切断位置\nk (i ≤ k < j)\nによって，\n[i..k]\nと\n[k+1..j]\nの 2 つに分割するのである．\nこのアクロバティックな方法で魚の身体を 2 つに切るとき，元の身体の重さ (=\nw\ni\n+w\ni+1\n+...+w\nj\n) だけコストがかかる．\nしえるは，魚のすべての部分を 1 センチメートル区切りに切るのにかかるコストの合計値を最小にしたい．\n入力形式\n入力は以下の形式で与えられる．\nN\nw\n1\nw\n2\n...\nw\nN\nN\nは魚の体長である．\nw\ni\nは魚の\ni\n番目の部分の重さである．\n出力形式\n魚を\nN\n個に切り分けるのにかかるコストの合計の最小値を出力せよ．\n制約\n2 ≤ N ≤ 4,000\n1 ≤ w\ni\n≤ 10\n10\n入力値はすべて整数である．\nこの問題の判定には，3 点分のテストケースのグループが設定されている． このグループに含まれるテストケースは上記の制約に加えて下記の制約も満たす．\n1 ≤ N ≤ 100\n入出力例\n入力例 1\n3\n1 2 3\n出力例 1\n9\nまず，魚全体を 2 番目と 3 番目の部分の間で切る．これには 1+2+3 = 6 のコストがかかる．\n次に，1 番目と 2 番目の部分の間で切る．これには 1+2=3 のコストがかかる．合計で 6+3=9 のコストがかかり，これが最善手である．\n入力例 2\n6\n9876543210 9876543210 9876543210 9876543210 9876543210 9876543210\n出力例 2\n158024691360\n入力例 3\n10\n127 131 137 139 149 151 157 163 167 173\n出力例 3\n5016\nWriter: 楠本充\nTester: 花田裕一朗"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2415_11008227","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\n#include <random>\n#include <chrono>\nusing namespace std;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 5000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\nconst int INF = 2147483647;\n//using ll = long long;\n\n// 問題\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2415\n\n// 参考\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\n// https://blog.hamayanhamayan.com/entry/2017/03/20/234711\n\nint N;\nlong long w[MAX_N];\nlong long cum[MAX_N];\nlong long dp[4040][4040];\nint A[4010][4010];\n\nint main() {\n\n\tcin >> N;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> w[i];\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tcum[i + 1] = cum[i] + w[i];\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tA[i][i] = i;\n\t}\n\n\tfor (int w = 1; w < N; w++) {\n\t\tfor (int l = 0; l + w <= N; l++) {\n\t\t\tint r = l + w;\n\t\t\tint a = A[l][r - 1];\n\t\t\tint b = A[l + 1][r];\n\t\t\tlong long m = LINF;\n\t\t\tint at = -1;\n\t\t\tfor (int i = a; i <= b; i++) {\n\t\t\t\tif (l > i || i >= r) continue;\n\t\t\t\tlong long tm = dp[l][i] + dp[i + 1][r];\n\t\t\t\tif (tm <= m) {\n\t\t\t\t\tat = i;\n\t\t\t\t\tm = tm;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp[l][r] = m + cum[r + 1] - cum[l];\n\t\t\tA[l][r] = at;\n\t\t}\n\t}\n\n\tcout << dp[0][N - 1] << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":195928,"score_of_the_acc":-0.8873,"final_rank":4},{"submission_id":"aoj_2415_11008225","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\n#include <random>\n#include <chrono>\nusing namespace std;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 5000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\nconst int INF = 2147483647;\n//using ll = long long;\n\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\n// https://blog.hamayanhamayan.com/entry/2017/03/20/234711\n\nint N;\nlong long w[MAX_N];\nlong long cum[MAX_N];\nlong long dp[4040][4040];\nint A[4010][4010];\n\nint main() {\n\n\tcin >> N;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> w[i];\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tcum[i + 1] = cum[i] + w[i];\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tA[i][i] = i;\n\t}\n\n\tfor (int w = 1; w < N; w++) {\n\t\tfor (int l = 0; l + w <= N; l++) {\n\t\t\tint r = l + w;\n\t\t\tint a = A[l][r - 1];\n\t\t\tint b = A[l + 1][r];\n\t\t\tlong long m = LINF;\n\t\t\tint at = -1;\n\t\t\tfor (int i = a; i <= b; i++) {\n\t\t\t\tif (l > i || i >= r) continue;\n\t\t\t\tlong long tm = dp[l][i] + dp[i + 1][r];\n\t\t\t\tif (tm <= m) {\n\t\t\t\t\tat = i;\n\t\t\t\t\tm = tm;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp[l][r] = m + cum[r + 1] - cum[l];\n\t\t\tA[l][r] = at;\n\t\t}\n\t}\n\n\tcout << dp[0][N - 1] << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":195924,"score_of_the_acc":-0.8872,"final_rank":3},{"submission_id":"aoj_2415_10996660","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++)\nconst long long mod=998244353;\nconst long long mod100=1000000007;\nvoid solve(){\n int N;\n cin>>N;\n ll w[N+1];\n for(int i=1;i<=N;i++) cin>>w[i];\n ll dp[N+1][N+1];\n for(int i=1;i<=N;i++) dp[i][i]=0;\n int K[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) K[i][j]=-1;\n }\n for(int i=1;i<=N;i++) K[i][i]=i;\n int i,j,r;\n ll sum;\n for(int a=2;a<=N;a++){\n sum=0;\n for(int b=1;b<a;b++) sum+=w[b];\n for(int b=1;b<=N-a+1;b++){\n i=b,j=b+a-1;\n r=-1;\n sum+=w[j];\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\n if(k==j) break;\n if(k==K[i][j-1]){\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum;\n r=k;\n continue;\n }\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum){\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum;\n r=k;\n }\n }\n K[i][j]=r;\n sum-=w[i];\n }\n }\n cout<<dp[1][N]<<endl;\n}\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n solve();\n}","accuracy":0.5681818181818182,"time_ms":20,"memory_kb":51984,"score_of_the_acc":0,"final_rank":17},{"submission_id":"aoj_2415_10996636","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++)\nconst long long mod=998244353;\nconst long long mod100=1000000007;\nvoid solve(){\n int N;\n cin>>N;\n ll w[N+1];\n for(int i=1;i<=N;i++) cin>>w[i];\n ll sum[N+1][N+1];\n ll dp[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++){\n sum[i][j]=0;\n }\n }\n for(int i=1;i<=N;i++) dp[i][i]=0;\n ll cnt;\n for(int i=1;i<=N;i++){\n cnt=0;\n for(int j=i;j<=N;j++){\n cnt+=w[j];\n sum[i][j]=cnt;\n }\n }\n int K[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) K[i][j]=-1;\n }\n for(int i=1;i<=N;i++) K[i][i]=i;\n int i,j,r;\n for(int a=2;a<=N;a++){\n for(int b=1;b<=N-a+1;b++){\n i=b,j=b+a-1;\n r=-1;\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\n if(k==j) break;\n if(k==K[i][j-1]){\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\n r=k;\n continue;\n }\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum[i][j]){\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\n r=k;\n }\n }\n K[i][j]=r;\n }\n }\n cout<<dp[1][N]<<endl;\n}\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n solve();\n}","accuracy":0.5681818181818182,"time_ms":20,"memory_kb":85168,"score_of_the_acc":-0.1642,"final_rank":18},{"submission_id":"aoj_2415_10996626","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++)\nconst long long mod=998244353;\nconst long long mod100=1000000007;\nvoid solve(){\n int N;\n cin>>N;\n ll w[N+1];\n for(int i=1;i<=N;i++) cin>>w[i];\n ll sum[N+1][N+1];\n ll dp[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++){\n sum[i][j]=0;\n dp[i][j]=2e18;\n }\n }\n for(int i=1;i<=N;i++) dp[i][i]=0;\n for(int i=1;i<=N;i++){\n ll cnt=0;\n for(int j=i;j<=N;j++){\n cnt+=w[j];\n sum[i][j]=cnt;\n }\n }\n int K[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) K[i][j]=-1;\n }\n for(int i=1;i<=N;i++) K[i][i]=i;\n int i,j,r;\n for(int a=2;a<=N;a++){\n for(int b=1;b<=N-a+1;b++){\n i=b,j=b+a-1;\n r=-1;\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\n if(k==j) break;\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum[i][j]){\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\n r=k;\n }\n }\n K[i][j]=r;\n }\n }\n cout<<dp[1][N]<<endl;\n}\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n solve();\n}","accuracy":0.5681818181818182,"time_ms":20,"memory_kb":85364,"score_of_the_acc":-0.1652,"final_rank":19},{"submission_id":"aoj_2415_10996609","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++)\nconst long long mod=998244353;\nconst long long mod100=1000000007;\nvoid solve(){\n int N;\n cin>>N;\n ll w[N+1];\n for(int i=1;i<=N;i++) cin>>w[i];\n ll sum[N+1][N+1];\n ll dp[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++){\n sum[i][j]=0;\n dp[i][j]=2e18;\n }\n }\n for(int i=1;i<=N;i++) dp[i][i]=0;\n for(int i=1;i<=N;i++){\n ll cnt=0;\n for(int j=i;j<=N;j++){\n cnt+=w[j];\n sum[i][j]=cnt;\n }\n }\n int K[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) K[i][j]=-1;\n }\n for(int i=1;i<=N;i++) K[i][i]=i;\n\n for(int a=2;a<=N;a++){\n for(int b=1;b<=N-a+1;b++){\n int i=b,j=b+a-1;\n int r=-1;\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\n if(k==j) break;\n ll now=dp[i][k]+dp[k+1][j]+sum[i][j];\n if(dp[i][j]>now){\n dp[i][j]=now;\n r=k;\n }\n }\n K[i][j]=r;\n }\n }\n cout<<dp[1][N]<<endl;\n}\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n solve();\n}","accuracy":0.5681818181818182,"time_ms":40,"memory_kb":85336,"score_of_the_acc":-0.215,"final_rank":20},{"submission_id":"aoj_2415_10866270","code_snippet":"#include <bits/stdc++.h>\n\n#define SQR(x) (1LL * ((x) * (x)))\n#define MASK(i) (1LL << (i))\n#define BIT(x, i) (((x) >> (i)) & 1)\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define sz(s) (int)s.size()\n#define prev __prev\n#define next __next\n#define left __left\n#define right __right\n\n#define mp make_pair\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define vi vector<int>\n#define vll vector<ll>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef unsigned int ui;\n\nusing namespace std;\n\nconst int mod = 1e9 + 7;\nconst int INF = 1e9 + 7;\nconst ll INFLL = (ll)2e18 + 7LL;\nconst ld PI = acos(-1);\n\nconst int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};\nconst int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};\n\ntemplate<class BUI, class TRONG>\n bool minimize(BUI &x, const TRONG y){\n if(x > y){\n x = y;\n return true;\n } else return false;\n }\ntemplate<class BUI, class TRONG>\n bool maximize(BUI &x, const TRONG y){\n if(x < y){\n x = y;\n return true;\n } else return false;\n }\n\n/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/\n/* Template is copied by Trong */\n\n /** Losing in Provincial Contests **/\n /** TRYING HARDER**/\n /** ORZ **/\n\n/* -----------------[ MAIN CODE GOES HERE ]----------------- */\n\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\nconst int N = 4040;\n\nint n;\nll f[N][N], w[N];\nint opt[N][N];\n\nll getRange(int i, int j) { return w[j] - w[i - 1]; }\n\nvoid solve(){\n cin >> n;\n for(int i = 1; i <= n; i++) cin >> w[i], w[i] += w[i - 1];\n memset(f, 0x3f, sizeof f);\n for(int i = 1; i <= n; i++) f[i][i] = 0, opt[i][i] = i;\n for(int l = 2; l <= n; l++) for(int i = 1; i + l - 1 <= n; i++){\n int j = i + l - 1;\n for(int k = opt[i][j - 1]; k <= opt[i + 1][j]; k++){\n if(k < j && minimize(f[i][j], f[i][k] + f[k + 1][j] + getRange(i, j))) opt[i][j] = k;\n }\n }\n cout << f[1][n] << '\\n';\n}\n\nsigned main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(0); cout.tie(0);\n\n const bool multitest = 0;\n int tt = 1; if(multitest) cin >> tt;\n\n while( tt-- ){\n\n solve();\n\n }\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":194724,"score_of_the_acc":-0.8813,"final_rank":1},{"submission_id":"aoj_2415_10400567","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\n\nusing ll = long long;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nusing pll = pair<ll, ll>;\n\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\n\ntemplate<class T, size_t n, size_t idx = 0>\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else return init;\n}\ntemplate<class T, size_t n>\nauto make_vec(const size_t (&d)[n]) noexcept {\n return make_vec(d, T{});\n}\n\nstruct Edge{ int to; ll cost; };\n\n\n//======================================================================================================\n\nll N;\nvector<ll> w;\nvector<vector<ll>> dp, K;\n\nint main(){\n cin >> N;\n w.resize(N);\n rep(i, N) cin >> w[i];\n dp.resize(N+1, vector<ll>(N+1, LINF));\n K.resize(N+1, vector<ll>(N+1));\n\n // 累積和\n vector<ll> ws({0});\n rep(i, N) ws.push_back(ws[i] + w[i]);\n\n // 区間DP, Monge性を用いてO(n^2)\n // K[i][j] = (dp[i][s] + dp[s+1][j]) がminとなる最大のs\n // sの探索範囲を K[i-1][j] ~ K[i][j-1] に狭められる\n rep(i, N){\n dp[i][i] = 0;\n K[i][i] = i;\n }\n\n rep(d, 1, N){\n rep(i, N){\n ll j = i + d;\n if (j >= N) continue;\n ll l = K[i][j-1];\n ll r = K[i+1][j];\n rep(s, l, r+1){\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\n dp[i][j] = dp[i][s] + dp[s+1][j];\n K[i][j] = s;\n }\n }\n dp[i][j] += ws[j+1] - ws[i];\n }\n }\n\n cout << dp[0][N-1] << endl;\n}","accuracy":1,"time_ms":230,"memory_kb":254080,"score_of_the_acc":-1.525,"final_rank":12},{"submission_id":"aoj_2415_10356913","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\n\nusing ll = long long;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nusing pll = pair<ll, ll>;\n\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\n\ntemplate<class T, size_t n, size_t idx = 0>\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else return init;\n}\ntemplate<class T, size_t n>\nauto make_vec(const size_t (&d)[n]) noexcept {\n return make_vec(d, T{});\n}\n\nstruct Edge{ int to; ll cost; };\n\n\n//======================================================================================================\n\nll N;\nvector<ll> w;\nvector<vector<ll>> dp, K;\n\nint main(){\n cin >> N;\n w.resize(N);\n rep(i, N) cin >> w[i];\n dp.resize(N+1, vector<ll>(N+1, LINF));\n K.resize(N+1, vector<ll>(N+1));\n\n // 累積和\n vector<ll> ws({0});\n rep(i, N) ws.push_back(ws[i] + w[i]);\n\n // 区間DP, Monge性を用いてO(n^2)\n // K[i][j] = (dp[i][s] + dp[s+1][j]) がminとなる最大のs\n // sの探索範囲を K[i-1][j] ~ K[i][j-1] に狭められる\n rep(i, N){\n dp[i][i] = 0;\n K[i][i] = i;\n }\n\n rep(d, 1, N){\n rep(i, N){\n ll j = i + d;\n if (j >= N) continue;\n ll l = K[i][j-1];\n ll r = K[i+1][j];\n rep(s, l, r+1){\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\n dp[i][j] = dp[i][s] + dp[s+1][j];\n K[i][j] = s;\n }\n }\n dp[i][j] += ws[j+1] - ws[i];\n }\n }\n\n cout << dp[0][N-1] << endl;\n}","accuracy":1,"time_ms":230,"memory_kb":254080,"score_of_the_acc":-1.525,"final_rank":12},{"submission_id":"aoj_2415_10354094","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\n\nusing ll = long long;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nusing pll = pair<ll, ll>;\n\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\n\ntemplate<class T, size_t n, size_t idx = 0>\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else return init;\n}\ntemplate<class T, size_t n>\nauto make_vec(const size_t (&d)[n]) noexcept {\n return make_vec(d, T{});\n}\n\nstruct Edge{ int to; ll cost; };\n\n\n//======================================================================================================\n\nll N;\nvector<ll> w;\nvector<vector<ll>> dp, K;\n\nint main(){\n cin >> N;\n w.resize(N);\n rep(i, N) cin >> w[i];\n dp.resize(N+1, vector<ll>(N+1, LINF));\n K.resize(N+1, vector<ll>(N+1));\n \n // 区間DP, Monge性\n\n rep(i, N){\n dp[i][i] = 0;\n K[i][i] = i;\n }\n vector<ll> ws({0});\n rep(i, N) ws.push_back(ws[i] + w[i]);\n\n rep(d, 1, N){\n rep(i, N){\n ll j = i + d;\n if (j >= N) continue;\n ll l = K[i][j-1];\n ll r = K[i+1][j];\n rep(s, l, r+1){\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\n dp[i][j] = dp[i][s] + dp[s+1][j];\n K[i][j] = s;\n }\n }\n dp[i][j] += ws[j+1] - ws[i];\n }\n }\n\n cout << dp[0][N-1] << endl;\n}","accuracy":1,"time_ms":230,"memory_kb":254080,"score_of_the_acc":-1.525,"final_rank":12},{"submission_id":"aoj_2415_9679849","code_snippet":"#ifndef HIDDEN_IN_VS // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\nusing pii = pair<int, int>;\tusing pll = pair<ll, ll>;\tusing pil = pair<int, ll>;\tusing pli = pair<ll, int>;\nusing vi = vector<int>;\t\tusing vvi = vector<vi>;\t\tusing vvvi = vector<vvi>;\tusing vvvvi = vector<vvvi>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\tusing vvvvl = vector<vvvl>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\nusing vc = vector<char>;\tusing vvc = vector<vc>;\t\tusing vvvc = vector<vvc>;\nusing vd = vector<double>;\tusing vvd = vector<vd>;\t\tusing vvvd = vector<vvd>;\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\nusing Graph = vvi;\n\n// 定数の定義\nconst double PI = acos(-1);\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nint DY[4] = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\n#define Yes(b) {cout << ((b) ? \"Yes\\n\" : \"No\\n\");}\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\n\n// 汎用関数の定義\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\n\n#endif // 折りたたみ用\n\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n\n#ifdef _MSC_VER\n#include \"localACL.hpp\"\n#endif\n\n//using mint = modint1000000007;\nusing mint = modint998244353;\n//using mint = static_modint<1000000000>;\n//using mint = modint; // mint::set_mod(m);\n\nnamespace atcoder {\n\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n}\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\n#endif\n\n\n#ifdef _MSC_VER // 手元環境（Visual Studio）\n#include \"local.hpp\"\n#else // 提出用（gcc）\ninline int popcount(int n) { return __builtin_popcount(n); }\ninline int popcount(ll n) { return __builtin_popcountll(n); }\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\ntemplate <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define dump(...)\n#define dumpel(...)\n#define dump_list(v)\n#define dump_mat(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\n#endif\n\n\n//【Knuth-Yao speedup】\n/*\n* 与えられた Monge かつ単調なコスト c[0..n][0..n] に対し，\n*\tdp[l][r] = MIN_m∈(l..r) (dp[l][m] + dp[m][r]) + c[l][r]\n* で定まる dp[0..n][0..n] を返す．\n* \n* c が単調であるとは，\n*\t∀l1, r1, l2, r2, [l1..r1) ⊂ [l2..r2) ⇒ c[l1][r1] ≦ c[l2][r2]\n* が成り立つことをいう．\n*/\ntemplate <class T>\nvector<vector<T>> knuth_yao_speedup(const vector<vector<T>>& c) {\n\tint n = sz(c) - 1;\n\n\t// dp[l][r] : [l..r) のマージにかかる最小コスト\n\tvector<vector<T>> dp(n + 1, vector<T>(n + 1, INFL));\n\trep(l, n) dp[l][l + 1] = c[l][l + 1];\n\n\t// sp[l][r] = m : [l..m) と [m..r) を最後にマージしたことを表す．\n\tvvi sp(n + 1, vi(n + 1, -1));\n\trep(i, n) sp[i][i + 1] = i + 1;\n\n\trepir(l, n - 2, 0) repi(r, l + 2, n) {\n\t\t// [l..m) と [m..r) を最後にマージする場合を考える．\n\t\t//\t調べる k の範囲を 1 つ短い区間の分割位置の間に限定している．\n\t\trepi(m, sp[l][r - 1], sp[l + 1][r]) {\n\t\t\tif (chmin(dp[l][r], dp[l][m] + dp[m][r])) sp[l][r] = m;\n\t\t}\n\n\t\t// [l..m) と [m..r) のマージにかかる m に依らないコストを加算する．\n\t\tdp[l][r] += c[l][r];\n\t}\n\n\treturn dp;\n}\n\n\nvoid MLE() {\n\tint n;\n\tcin >> n;\n\n\tvl w(n);\n\tcin >> w;\n\n\tvl acc(n + 1);\n\trep(i, n) acc[i + 1] = acc[i] + w[i];\n\n\tvvl cost(n + 1, vl(n + 1));\n\trep(l, n) repi(r, l + 2, n) cost[l][r] = acc[r] - acc[l];\n\tdumpel(cost);\n\n\tauto dp = knuth_yao_speedup(cost);\n\tdumpel(dp);\n\n\tEXIT(dp[0][n]);\n}\n\n\n//【Knuth-Yao speedup】\n/*\n* 与えられた Monge かつ単調なコスト c[0..n][0..n] に対し，\n*\tdp[l][r] = MIN_m∈(l..r) (dp[l][m] + dp[m][r]) + c[l][r]\n* で定まる dp[0..n][0..n] を返す．\n*\n* c が単調であるとは，\n*\t∀l1, r1, l2, r2, [l1..r1) ⊂ [l2..r2) ⇒ c[l1][r1] ≦ c[l2][r2]\n* が成り立つことをいう．\n*/\ntemplate <class F>\nvvl knuth_yao_speedup_func(int n, const F& c) {\n\t// dp[l][r] : [l..r) のマージにかかる最小コスト\n\tvvl dp(n + 1, vl(n + 1, INFL));\n\trep(l, n) dp[l][l + 1] = c(l, l + 1);\n\n\t// sp[l][r] = m : [l..m) と [m..r) を最後にマージしたことを表す．\n\tvvi sp(n + 1, vi(n + 1, -1));\n\trep(i, n) sp[i][i + 1] = i + 1;\n\n\trepir(l, n - 2, 0) repi(r, l + 2, n) {\n\t\t// [l..m) と [m..r) を最後にマージする場合を考える．\n\t\t//\t調べる k の範囲を 1 つ短い区間の分割位置の間に限定している．\n\t\trepi(m, sp[l][r - 1], sp[l + 1][r]) {\n\t\t\tif (chmin(dp[l][r], dp[l][m] + dp[m][r])) sp[l][r] = m;\n\t\t}\n\n\t\t// [l..m) と [m..r) のマージにかかる m に依らないコストを加算する．\n\t\tdp[l][r] += c(l, r);\n\t}\n\n\treturn dp;\n}\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tint n;\n\tcin >> n;\n\n\tvl w(n);\n\tcin >> w;\n\n\tvl acc(n + 1);\n\trep(i, n) acc[i + 1] = acc[i] + w[i];\n\n\tauto cost = [&](int l, int r) {\n\t\tif (r - l <= 1) return 0LL;\n\t\treturn acc[r] - acc[l];\n\t};\n\n\tauto dp = knuth_yao_speedup_func(n, cost);\n\tdumpel(dp);\n\n\tEXIT(dp[0][n]);\n}","accuracy":1,"time_ms":130,"memory_kb":191056,"score_of_the_acc":-0.9631,"final_rank":5},{"submission_id":"aoj_2415_9652731","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl \"\\n\"\ntypedef long long ll;\nconst int N = 4005;\n#define int long long\nint w[N];\nint dp[N][N], loc[N][N];\nvoid solved() {\n int n;\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> w[i];\n w[i] += w[i - 1];\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n dp[i][j] = 1e18;\n if (i == j) {\n dp[i][j] = 0;\n loc[i][j] = i;\n }\n }\n }\n ll tmp;\n for (int len = 1; len <= n; len++) {\n for (int i = 1; i + len - 1 <= n; i++) {\n int j = i + len - 1;\n for (int k = loc[i][j - 1]; k <= loc[i + 1][j]; k++) {\n tmp = dp[i][k] + dp[k + 1][j] + w[j] - w[i - 1];\n if (tmp < dp[i][j]) {\n dp[i][j] = tmp;\n loc[i][j] = k;\n }\n }\n }\n }\n cout << dp[1][n] << endl;\n}\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n \n solved();\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":253888,"score_of_the_acc":-1.224,"final_rank":8},{"submission_id":"aoj_2415_9652699","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl \"\\n\"\ntypedef long long ll;\nconst int N = 4005;\n#define int long long\nint w[N];\nint dp[N][N], loc[N][N];\nvoid solved() {\n int n;\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> w[i];\n w[i] += w[i - 1];\n }\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= n; j++) {\n dp[i][j] = 1e18;\n if (i == j) {\n dp[i][j] = 0;\n loc[i][j] = i;\n }\n }\n }\n ll tmp;\n for (int len = 1; len <= n; len++) {\n for (int i = 1; i + len - 1 <= n; i++) {\n int j = i + len - 1;\n for (int k = loc[i][j - 1]; k <= loc[i + 1][j]; k++) {\n tmp = dp[i][k] + dp[k + 1][j] + w[j] - w[i - 1];\n if (tmp < dp[i][j]) {\n dp[i][j] = tmp;\n loc[i][j] = k;\n }\n }\n }\n }\n cout << dp[1][n] << endl;\n}\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n /*int t = 1;\n cin >> t;\n while (t--)*/\n solved();\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":253996,"score_of_the_acc":-1.2246,"final_rank":9},{"submission_id":"aoj_2415_9652688","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\nint N;\nll W[4001],dp[4000][4000];\nint loc[4000][4000];\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = i; k < N; k++)dp[i][k] = HUGE_NUM;\n\t}\n\n\tW[0] = 0;\n\tfor(int i = 1; i <= N; i++){\n\t\tscanf(\"%lld\",&W[i]);\n\t\tW[i] += W[i-1];\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tdp[i][i] = 0;\n\t\tloc[i][i] = i;\n\t}\n\n\tint right;\n\tll tmp;\n\tfor(int length = 2; length <= N; length++){\n\t\tfor(int left = 0; left+length-1 <= N-1; left++){\n\t\t\tright = left+length-1;\n\t\t\tfor(int mid = loc[left][right-1]; mid <= loc[left+1][right]; mid++){\n\t\t\t\ttmp = dp[left][mid]+dp[mid+1][right]+W[right+1]-W[left];\n\t\t\t\tif(tmp < dp[left][right]){\n\t\t\t\t\tdp[left][right] = tmp;\n\t\t\t\t\tloc[left][right] = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",dp[0][N-1]);\n}","accuracy":1,"time_ms":100,"memory_kb":190100,"score_of_the_acc":-0.8834,"final_rank":2},{"submission_id":"aoj_2415_9556853","code_snippet":"#include <iostream>\n#include <vector>\n#include <climits>\n\nusing namespace std;\n\nint main() {\n int numElements;\n cin >> numElements;\n \n vector<long long> weights(numElements);\n for (auto& weight : weights) {\n cin >> weight;\n }\n\n // 累積和を格納するベクター。sumWeights[i]はweightsの最初のi個の要素の合計\n vector<long long> sumWeights(numElements + 1, 0);\n for (int i = 0; i < numElements; ++i) {\n sumWeights[i + 1] = sumWeights[i] + weights[i];\n }\n\n // 分割点を記録するためのテーブル\n vector<vector<int>> optimalCut(numElements, vector<int>(numElements));\n \n // 各区間の最小コストを記録するテーブル\n vector<vector<long long>> minCost(numElements, vector<long long>(numElements, 0));\n\n // 初期化: 長さ2の区間についての最小コストと分割点を計算\n for (int i = 0; i + 1 < numElements; ++i) {\n optimalCut[i][i + 1] = i;\n minCost[i][i + 1] = sumWeights[i + 2] - sumWeights[i];\n }\n\n // 動的計画法による最小コストの計算\n for (int length = 2; length < numElements; ++length) {\n for (int start = 0; start + length < numElements; ++start) {\n int end = start + length;\n long long minTotalCost = LLONG_MAX;\n int bestCut = -1;\n\n // 分割点を最適化するループ\n for (int mid = optimalCut[start][end - 1]; mid <= optimalCut[start + 1][end]; ++mid) {\n long long currentCost = minCost[start][mid] + minCost[mid + 1][end];\n if (currentCost < minTotalCost) {\n minTotalCost = currentCost;\n bestCut = mid;\n }\n }\n\n minCost[start][end] = minTotalCost + sumWeights[end + 1] - sumWeights[start];\n optimalCut[start][end] = bestCut;\n }\n }\n\n // 最終結果の出力: 配列全体を統合する最小コスト\n cout << minCost[0][numElements - 1] << endl;\n\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":191124,"score_of_the_acc":-1.1885,"final_rank":7},{"submission_id":"aoj_2415_9277451","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\nusing namespace std;\nconst int INF = 1000000007;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 1200010;\nconst int MAX_W = 600010;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\n//using ll = long long;\n\n\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\n\n// 補足: https://sssslide.com/www.slideshare.net/ikumihide/ss-50881829\n// 補足: https://blog.hamayanhamayan.com/entry/2017/03/20/234711\n\nint N;\nlong long dp[4010][4010];\nlong long w[4010];\nlong long S[4010];\nint A[4010][4010];\n\nint main() {\n\n\tcin >> N;\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> w[i];\n\t}\n\n\tfor (int i = 0; i < N; i++) {\n\t\tS[i + 1] = S[i] + w[i];\n\t}\n\n\tfor (int i = 0; i < N; i++) {\n\t\tA[i][i] = i;\n\t}\n\t\n\tfor (int k = 1; k < N; k++) {\n\t\tfor (int i = 0; i <= N - k; i++) {\n\t\t\tint j = i + k;\n\t\t\tint a = A[i][j - 1];\n\t\t\tint b = A[i + 1][j];\n\t\t\tlong long m = LINF;\n\t\t\tint at = -1;\n\t\t\tfor (int l = a; l <= b; l++) {\n\t\t\t\tif (i > l || l >= j)continue;\n\t\t\t\tlong long tm = dp[i][l] + dp[l + 1][j];\n\t\t\t\tif (tm <= m) {\n\t\t\t\t\tat = l;\n\t\t\t\t\tm = tm;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tdp[i][j] = m + S[j + 1] - S[i];\n\t\t\tA[i][j] = at;\n\t\t}\n\t}\n\n\tcout << dp[0][N - 1] << endl;\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":370,"memory_kb":125952,"score_of_the_acc":-1.241,"final_rank":10},{"submission_id":"aoj_2415_9238032","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main(){\n int n;\n cin >> n;\n \n vector<ll> w(n+1,0);\n vector<ll> wsm(n+1,0);\n for(int i=1;i<=n;i++){\n cin >> w[i];\n wsm[i]=wsm[i-1]+w[i];\n } \n if(n==2){\n cout << wsm[2] << endl;\n return 0;\n }\n \n vector dp(n+1,vector<ll>(n+1,LLONG_MAX));\n vector m(n+1,vector<int>(n+1));\n for(int i=1;i<=n;i++){\n dp[i][i]=0;\n m[i][i]=i;\n if(i<n){ \n dp[i][i+1]=w[i]+w[i+1];\n m[i][i+1]=i;\n }\n }\n \n\n \n for(int k=2;k<n;k++){\n for(int i=1;i<=n-k;i++){\n for(int j=m[i][i+k-1];j<=m[i+1][i+k];j++){\n if(dp[i][i+k]>dp[i][j]+dp[j+1][i+k]){\n dp[i][i+k]=dp[i][j]+dp[j+1][i+k];\n m[i][i+k]=j;\n }\n }\n dp[i][i+k]+=wsm[i+k]-wsm[i-1];\n }\n }\n\n cout << dp[1][n] << endl;\n}","accuracy":1,"time_ms":220,"memory_kb":191080,"score_of_the_acc":-1.1883,"final_rank":6},{"submission_id":"aoj_2415_8351144","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll INF = (1LL<<60);\nint n;\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\nint main(){\n cin >> n;\n rui[0] = 0;\n for(int i=1;i<=n;i++){\n cin >> w;\n rui[i] = w+rui[i-1];\n cut[i][i] = i;\n for(int j=i+1;j<=n;j++) dp[i][j] = INF;\n dp[i][i] = 0;\n }\n for(int i=1;i<=n;i++){\n for(int l=1;l<=n-i;l++){\n int r = l+i;\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\n if(dp[l][r] > ncut){\n dp[l][r] = ncut;\n cut[l][r] = k;\n }\n }\n }\n }\n cout << dp[1][n] << endl;\n return(0);\n}","accuracy":1,"time_ms":400,"memory_kb":158160,"score_of_the_acc":-1.4754,"final_rank":11},{"submission_id":"aoj_2415_8351142","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll INF = (1LL<<60);\nint n;\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\nint main(){\n cin >> n;\n rui[0] = 0;\n for(int i=1;i<=n;i++){\n cin >> w;\n rui[i] = w+rui[i-1];\n cut[i][i] = i;\n for(int j=1;j<=n;j++) dp[i][j] = INF;\n dp[i][i] = 0;\n }\n for(int i=1;i<=n;i++){\n for(int l=1;l<=n-i;l++){\n int r = l+i;\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\n if(dp[l][r] > ncut){\n dp[l][r] = ncut;\n cut[l][r] = k;\n }\n }\n }\n }\n cout << dp[1][n] << endl;\n return(0);\n}","accuracy":1,"time_ms":420,"memory_kb":205764,"score_of_the_acc":-1.7609,"final_rank":15},{"submission_id":"aoj_2415_8351132","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst ll INF = (1LL<<60);\nint n;\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\nint main(){\n cin >> n;\n rui[0] = 0;\n fill_n(*dp, 4004*4004, INF);\n for(int i=1;i<=n;i++){\n cin >> w;\n rui[i] = w+rui[i-1];\n cut[i][i] = i;\n dp[i][i] = 0;\n }\n for(int i=1;i<=n;i++){\n for(int l=1;l<=n-i;l++){\n int r = l+i;\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\n if(dp[l][r] > ncut){\n dp[l][r] = ncut;\n cut[l][r] = k;\n }\n }\n }\n }\n cout << dp[1][n] << endl;\n return(0);\n}","accuracy":1,"time_ms":420,"memory_kb":205884,"score_of_the_acc":-1.7615,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2415_11008227\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <cstdio>\\n#include <iostream>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\n#include <functional>\\n#include <set>\\n#include <map>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include<sstream>\\n#include<list>\\n#include<iomanip>\\n#include <cstdlib>\\n#include <cstring>\\n#include <stack>\\n#include <bitset>\\n#include <cassert>\\n#include <stdlib.h>\\n#include <stdio.h>\\n#include <random>\\n#include <chrono>\\nusing namespace std;\\nconst long long LINF = 3e18 + 7;\\nconst int MAX_N = 5000010;\\nconst int MAX_W = 10002;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\nconst int INF = 2147483647;\\n//using ll = long long;\\n\\n// 問題\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2415\\n\\n// 参考\\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\\n// https://blog.hamayanhamayan.com/entry/2017/03/20/234711\\n\\nint N;\\nlong long w[MAX_N];\\nlong long cum[MAX_N];\\nlong long dp[4040][4040];\\nint A[4010][4010];\\n\\nint main() {\\n\\n\\tcin >> N;\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> w[i];\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcum[i + 1] = cum[i] + w[i];\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tA[i][i] = i;\\n\\t}\\n\\n\\tfor (int w = 1; w < N; w++) {\\n\\t\\tfor (int l = 0; l + w <= N; l++) {\\n\\t\\t\\tint r = l + w;\\n\\t\\t\\tint a = A[l][r - 1];\\n\\t\\t\\tint b = A[l + 1][r];\\n\\t\\t\\tlong long m = LINF;\\n\\t\\t\\tint at = -1;\\n\\t\\t\\tfor (int i = a; i <= b; i++) {\\n\\t\\t\\t\\tif (l > i || i >= r) continue;\\n\\t\\t\\t\\tlong long tm = dp[l][i] + dp[i + 1][r];\\n\\t\\t\\t\\tif (tm <= m) {\\n\\t\\t\\t\\t\\tat = i;\\n\\t\\t\\t\\t\\tm = tm;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdp[l][r] = m + cum[r + 1] - cum[l];\\n\\t\\t\\tA[l][r] = at;\\n\\t\\t}\\n\\t}\\n\\n\\tcout << dp[0][N - 1] << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 195928,\n \"score_of_the_acc\": -0.8873,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2415_11008225\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <cstdio>\\n#include <iostream>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\n#include <functional>\\n#include <set>\\n#include <map>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include<sstream>\\n#include<list>\\n#include<iomanip>\\n#include <cstdlib>\\n#include <cstring>\\n#include <stack>\\n#include <bitset>\\n#include <cassert>\\n#include <stdlib.h>\\n#include <stdio.h>\\n#include <random>\\n#include <chrono>\\nusing namespace std;\\nconst long long LINF = 3e18 + 7;\\nconst int MAX_N = 5000010;\\nconst int MAX_W = 10002;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\nconst int INF = 2147483647;\\n//using ll = long long;\\n\\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\\n// https://blog.hamayanhamayan.com/entry/2017/03/20/234711\\n\\nint N;\\nlong long w[MAX_N];\\nlong long cum[MAX_N];\\nlong long dp[4040][4040];\\nint A[4010][4010];\\n\\nint main() {\\n\\n\\tcin >> N;\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> w[i];\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcum[i + 1] = cum[i] + w[i];\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tA[i][i] = i;\\n\\t}\\n\\n\\tfor (int w = 1; w < N; w++) {\\n\\t\\tfor (int l = 0; l + w <= N; l++) {\\n\\t\\t\\tint r = l + w;\\n\\t\\t\\tint a = A[l][r - 1];\\n\\t\\t\\tint b = A[l + 1][r];\\n\\t\\t\\tlong long m = LINF;\\n\\t\\t\\tint at = -1;\\n\\t\\t\\tfor (int i = a; i <= b; i++) {\\n\\t\\t\\t\\tif (l > i || i >= r) continue;\\n\\t\\t\\t\\tlong long tm = dp[l][i] + dp[i + 1][r];\\n\\t\\t\\t\\tif (tm <= m) {\\n\\t\\t\\t\\t\\tat = i;\\n\\t\\t\\t\\t\\tm = tm;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdp[l][r] = m + cum[r + 1] - cum[l];\\n\\t\\t\\tA[l][r] = at;\\n\\t\\t}\\n\\t}\\n\\n\\tcout << dp[0][N - 1] << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 195924,\n \"score_of_the_acc\": -0.8872,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2415_10996660\",\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++)\\nconst long long mod=998244353;\\nconst long long mod100=1000000007;\\nvoid solve(){\\n int N;\\n cin>>N;\\n ll w[N+1];\\n for(int i=1;i<=N;i++) cin>>w[i];\\n ll dp[N+1][N+1];\\n for(int i=1;i<=N;i++) dp[i][i]=0;\\n int K[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++) K[i][j]=-1;\\n }\\n for(int i=1;i<=N;i++) K[i][i]=i;\\n int i,j,r;\\n ll sum;\\n for(int a=2;a<=N;a++){\\n sum=0;\\n for(int b=1;b<a;b++) sum+=w[b];\\n for(int b=1;b<=N-a+1;b++){\\n i=b,j=b+a-1;\\n r=-1;\\n sum+=w[j];\\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\\n if(k==j) break;\\n if(k==K[i][j-1]){\\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum;\\n r=k;\\n continue;\\n }\\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum){\\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum;\\n r=k;\\n }\\n }\\n K[i][j]=r;\\n sum-=w[i];\\n }\\n }\\n cout<<dp[1][N]<<endl;\\n}\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n cout.tie(0);\\n solve();\\n}\",\n \"accuracy\": 0.5681818181818182,\n \"time_ms\": 20,\n \"memory_kb\": 51984,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2415_10996636\",\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++)\\nconst long long mod=998244353;\\nconst long long mod100=1000000007;\\nvoid solve(){\\n int N;\\n cin>>N;\\n ll w[N+1];\\n for(int i=1;i<=N;i++) cin>>w[i];\\n ll sum[N+1][N+1];\\n ll dp[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++){\\n sum[i][j]=0;\\n }\\n }\\n for(int i=1;i<=N;i++) dp[i][i]=0;\\n ll cnt;\\n for(int i=1;i<=N;i++){\\n cnt=0;\\n for(int j=i;j<=N;j++){\\n cnt+=w[j];\\n sum[i][j]=cnt;\\n }\\n }\\n int K[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++) K[i][j]=-1;\\n }\\n for(int i=1;i<=N;i++) K[i][i]=i;\\n int i,j,r;\\n for(int a=2;a<=N;a++){\\n for(int b=1;b<=N-a+1;b++){\\n i=b,j=b+a-1;\\n r=-1;\\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\\n if(k==j) break;\\n if(k==K[i][j-1]){\\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\\n r=k;\\n continue;\\n }\\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum[i][j]){\\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\\n r=k;\\n }\\n }\\n K[i][j]=r;\\n }\\n }\\n cout<<dp[1][N]<<endl;\\n}\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n cout.tie(0);\\n solve();\\n}\",\n \"accuracy\": 0.5681818181818182,\n \"time_ms\": 20,\n \"memory_kb\": 85168,\n \"score_of_the_acc\": -0.1642,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2415_10996626\",\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++)\\nconst long long mod=998244353;\\nconst long long mod100=1000000007;\\nvoid solve(){\\n int N;\\n cin>>N;\\n ll w[N+1];\\n for(int i=1;i<=N;i++) cin>>w[i];\\n ll sum[N+1][N+1];\\n ll dp[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++){\\n sum[i][j]=0;\\n dp[i][j]=2e18;\\n }\\n }\\n for(int i=1;i<=N;i++) dp[i][i]=0;\\n for(int i=1;i<=N;i++){\\n ll cnt=0;\\n for(int j=i;j<=N;j++){\\n cnt+=w[j];\\n sum[i][j]=cnt;\\n }\\n }\\n int K[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++) K[i][j]=-1;\\n }\\n for(int i=1;i<=N;i++) K[i][i]=i;\\n int i,j,r;\\n for(int a=2;a<=N;a++){\\n for(int b=1;b<=N-a+1;b++){\\n i=b,j=b+a-1;\\n r=-1;\\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\\n if(k==j) break;\\n if(dp[i][j]>dp[i][k]+dp[k+1][j]+sum[i][j]){\\n dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];\\n r=k;\\n }\\n }\\n K[i][j]=r;\\n }\\n }\\n cout<<dp[1][N]<<endl;\\n}\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n cout.tie(0);\\n solve();\\n}\",\n \"accuracy\": 0.5681818181818182,\n \"time_ms\": 20,\n \"memory_kb\": 85364,\n \"score_of_the_acc\": -0.1652,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2415_10996609\",\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++)\\nconst long long mod=998244353;\\nconst long long mod100=1000000007;\\nvoid solve(){\\n int N;\\n cin>>N;\\n ll w[N+1];\\n for(int i=1;i<=N;i++) cin>>w[i];\\n ll sum[N+1][N+1];\\n ll dp[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++){\\n sum[i][j]=0;\\n dp[i][j]=2e18;\\n }\\n }\\n for(int i=1;i<=N;i++) dp[i][i]=0;\\n for(int i=1;i<=N;i++){\\n ll cnt=0;\\n for(int j=i;j<=N;j++){\\n cnt+=w[j];\\n sum[i][j]=cnt;\\n }\\n }\\n int K[N+1][N+1];\\n for(int i=1;i<=N;i++){\\n for(int j=1;j<=N;j++) K[i][j]=-1;\\n }\\n for(int i=1;i<=N;i++) K[i][i]=i;\\n\\n for(int a=2;a<=N;a++){\\n for(int b=1;b<=N-a+1;b++){\\n int i=b,j=b+a-1;\\n int r=-1;\\n for(int k=K[i][j-1];k<=K[i+1][j];k++){\\n if(k==j) break;\\n ll now=dp[i][k]+dp[k+1][j]+sum[i][j];\\n if(dp[i][j]>now){\\n dp[i][j]=now;\\n r=k;\\n }\\n }\\n K[i][j]=r;\\n }\\n }\\n cout<<dp[1][N]<<endl;\\n}\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n cout.tie(0);\\n solve();\\n}\",\n \"accuracy\": 0.5681818181818182,\n \"time_ms\": 40,\n \"memory_kb\": 85336,\n \"score_of_the_acc\": -0.215,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2415_10866270\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define SQR(x) (1LL * ((x) * (x)))\\n#define MASK(i) (1LL << (i))\\n#define BIT(x, i) (((x) >> (i)) & 1)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define all(x) x.begin(), x.end()\\n#define rall(x) x.rbegin(), x.rend()\\n#define sz(s) (int)s.size()\\n#define prev __prev\\n#define next __next\\n#define left __left\\n#define right __right\\n\\n#define mp make_pair\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define vi vector<int>\\n#define vll vector<ll>\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef unsigned int ui;\\n\\nusing namespace std;\\n\\nconst int mod = 1e9 + 7;\\nconst int INF = 1e9 + 7;\\nconst ll INFLL = (ll)2e18 + 7LL;\\nconst ld PI = acos(-1);\\n\\nconst int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};\\nconst int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};\\n\\ntemplate<class BUI, class TRONG>\\n bool minimize(BUI &x, const TRONG y){\\n if(x > y){\\n x = y;\\n return true;\\n } else return false;\\n }\\ntemplate<class BUI, class TRONG>\\n bool maximize(BUI &x, const TRONG y){\\n if(x < y){\\n x = y;\\n return true;\\n } else return false;\\n }\\n\\n/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/\\n/* Template is copied by Trong */\\n\\n /** Losing in Provincial Contests **/\\n /** TRYING HARDER**/\\n /** ORZ **/\\n\\n/* -----------------[ MAIN CODE GOES HERE ]----------------- */\\n\\nmt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\nconst int N = 4040;\\n\\nint n;\\nll f[N][N], w[N];\\nint opt[N][N];\\n\\nll getRange(int i, int j) { return w[j] - w[i - 1]; }\\n\\nvoid solve(){\\n cin >> n;\\n for(int i = 1; i <= n; i++) cin >> w[i], w[i] += w[i - 1];\\n memset(f, 0x3f, sizeof f);\\n for(int i = 1; i <= n; i++) f[i][i] = 0, opt[i][i] = i;\\n for(int l = 2; l <= n; l++) for(int i = 1; i + l - 1 <= n; i++){\\n int j = i + l - 1;\\n for(int k = opt[i][j - 1]; k <= opt[i + 1][j]; k++){\\n if(k < j && minimize(f[i][j], f[i][k] + f[k + 1][j] + getRange(i, j))) opt[i][j] = k;\\n }\\n }\\n cout << f[1][n] << '\\\\n';\\n}\\n\\nsigned main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(0); cout.tie(0);\\n\\n const bool multitest = 0;\\n int tt = 1; if(multitest) cin >> tt;\\n\\n while( tt-- ){\\n\\n solve();\\n\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 194724,\n \"score_of_the_acc\": -0.8813,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2415_10400567\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\\n\\nusing ll = long long;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nusing pll = pair<ll, ll>;\\n\\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\\n\\ntemplate<class T, size_t n, size_t idx = 0>\\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else return init;\\n}\\ntemplate<class T, size_t n>\\nauto make_vec(const size_t (&d)[n]) noexcept {\\n return make_vec(d, T{});\\n}\\n\\nstruct Edge{ int to; ll cost; };\\n\\n\\n//======================================================================================================\\n\\nll N;\\nvector<ll> w;\\nvector<vector<ll>> dp, K;\\n\\nint main(){\\n cin >> N;\\n w.resize(N);\\n rep(i, N) cin >> w[i];\\n dp.resize(N+1, vector<ll>(N+1, LINF));\\n K.resize(N+1, vector<ll>(N+1));\\n\\n // 累積和\\n vector<ll> ws({0});\\n rep(i, N) ws.push_back(ws[i] + w[i]);\\n\\n // 区間DP, Monge性を用いてO(n^2)\\n // K[i][j] = (dp[i][s] + dp[s+1][j]) がminとなる最大のs\\n // sの探索範囲を K[i-1][j] ~ K[i][j-1] に狭められる\\n rep(i, N){\\n dp[i][i] = 0;\\n K[i][i] = i;\\n }\\n\\n rep(d, 1, N){\\n rep(i, N){\\n ll j = i + d;\\n if (j >= N) continue;\\n ll l = K[i][j-1];\\n ll r = K[i+1][j];\\n rep(s, l, r+1){\\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\\n dp[i][j] = dp[i][s] + dp[s+1][j];\\n K[i][j] = s;\\n }\\n }\\n dp[i][j] += ws[j+1] - ws[i];\\n }\\n }\\n\\n cout << dp[0][N-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 254080,\n \"score_of_the_acc\": -1.525,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2415_10356913\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\\n\\nusing ll = long long;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nusing pll = pair<ll, ll>;\\n\\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\\n\\ntemplate<class T, size_t n, size_t idx = 0>\\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else return init;\\n}\\ntemplate<class T, size_t n>\\nauto make_vec(const size_t (&d)[n]) noexcept {\\n return make_vec(d, T{});\\n}\\n\\nstruct Edge{ int to; ll cost; };\\n\\n\\n//======================================================================================================\\n\\nll N;\\nvector<ll> w;\\nvector<vector<ll>> dp, K;\\n\\nint main(){\\n cin >> N;\\n w.resize(N);\\n rep(i, N) cin >> w[i];\\n dp.resize(N+1, vector<ll>(N+1, LINF));\\n K.resize(N+1, vector<ll>(N+1));\\n\\n // 累積和\\n vector<ll> ws({0});\\n rep(i, N) ws.push_back(ws[i] + w[i]);\\n\\n // 区間DP, Monge性を用いてO(n^2)\\n // K[i][j] = (dp[i][s] + dp[s+1][j]) がminとなる最大のs\\n // sの探索範囲を K[i-1][j] ~ K[i][j-1] に狭められる\\n rep(i, N){\\n dp[i][i] = 0;\\n K[i][i] = i;\\n }\\n\\n rep(d, 1, N){\\n rep(i, N){\\n ll j = i + d;\\n if (j >= N) continue;\\n ll l = K[i][j-1];\\n ll r = K[i+1][j];\\n rep(s, l, r+1){\\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\\n dp[i][j] = dp[i][s] + dp[s+1][j];\\n K[i][j] = s;\\n }\\n }\\n dp[i][j] += ws[j+1] - ws[i];\\n }\\n }\\n\\n cout << dp[0][N-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 254080,\n \"score_of_the_acc\": -1.525,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2415_10354094\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#define overload4(_1, _2, _3, _4, 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 all(x) x.begin(), x.end()\\n\\nusing ll = long long;\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\nusing pll = pair<ll, ll>;\\n\\nconst int INF = 1 << 29; const ll LINF = 0x1fffffffffffffff;\\nconst ll MOD = 998244353; const ll MOD2 = 1000000007;\\n\\ntemplate<class T, size_t n, size_t idx = 0>\\nauto make_vec(const size_t (&d)[n], const T& init) noexcept {\\n if constexpr (idx < n) return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\\n else return init;\\n}\\ntemplate<class T, size_t n>\\nauto make_vec(const size_t (&d)[n]) noexcept {\\n return make_vec(d, T{});\\n}\\n\\nstruct Edge{ int to; ll cost; };\\n\\n\\n//======================================================================================================\\n\\nll N;\\nvector<ll> w;\\nvector<vector<ll>> dp, K;\\n\\nint main(){\\n cin >> N;\\n w.resize(N);\\n rep(i, N) cin >> w[i];\\n dp.resize(N+1, vector<ll>(N+1, LINF));\\n K.resize(N+1, vector<ll>(N+1));\\n \\n // 区間DP, Monge性\\n\\n rep(i, N){\\n dp[i][i] = 0;\\n K[i][i] = i;\\n }\\n vector<ll> ws({0});\\n rep(i, N) ws.push_back(ws[i] + w[i]);\\n\\n rep(d, 1, N){\\n rep(i, N){\\n ll j = i + d;\\n if (j >= N) continue;\\n ll l = K[i][j-1];\\n ll r = K[i+1][j];\\n rep(s, l, r+1){\\n if (dp[i][s] + dp[s+1][j] <= dp[i][j]){\\n dp[i][j] = dp[i][s] + dp[s+1][j];\\n K[i][j] = s;\\n }\\n }\\n dp[i][j] += ws[j+1] - ws[i];\\n }\\n }\\n\\n cout << dp[0][N-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 254080,\n \"score_of_the_acc\": -1.525,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2415_9679849\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VS // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）\\nusing pii = pair<int, int>;\\tusing pll = pair<ll, ll>;\\tusing pil = pair<int, ll>;\\tusing pli = pair<ll, int>;\\nusing vi = vector<int>;\\t\\tusing vvi = vector<vi>;\\t\\tusing vvvi = vector<vvi>;\\tusing vvvvi = vector<vvvi>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\tusing vvvvl = vector<vvvl>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\nusing vc = vector<char>;\\tusing vvc = vector<vc>;\\t\\tusing vvvc = vector<vvc>;\\nusing vd = vector<double>;\\tusing vvd = vector<vd>;\\t\\tusing vvvd = vector<vvd>;\\ntemplate <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;\\nusing Graph = vvi;\\n\\n// 定数の定義\\nconst double PI = acos(-1);\\nint DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nint DY[4] = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))\\n#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\");}\\n#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順\\n#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順\\n#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順\\n#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）\\n#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）\\n#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）\\n#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }\\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\\ntemplate <class T> inline T getb(T set, int i) { return (set >> i) & T(1); }\\ntemplate <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod\\n\\n// 演算子オーバーロード\\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }\\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }\\n\\n#endif // 折りたたみ用\\n\\n\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\n#ifdef _MSC_VER\\n#include \\\"localACL.hpp\\\"\\n#endif\\n\\n//using mint = modint1000000007;\\nusing mint = modint998244353;\\n//using mint = static_modint<1000000000>;\\n//using mint = modint; // mint::set_mod(m);\\n\\nnamespace atcoder {\\n\\tinline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n\\tinline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n}\\nusing vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;\\n#endif\\n\\n\\n#ifdef _MSC_VER // 手元環境（Visual Studio）\\n#include \\\"local.hpp\\\"\\n#else // 提出用（gcc）\\ninline int popcount(int n) { return __builtin_popcount(n); }\\ninline int popcount(ll n) { return __builtin_popcountll(n); }\\ninline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }\\ntemplate <size_t N> inline int lsb(const bitset<N>& b) { return b._Find_first(); }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define dump(...)\\n#define dumpel(...)\\n#define dump_list(v)\\n#define dump_mat(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#define Assert(b) { if (!(b)) { vc MLE(1<<30); EXIT(MLE.back()); } } // RE の代わりに MLE を出す\\n#endif\\n\\n\\n//【Knuth-Yao speedup】\\n/*\\n* 与えられた Monge かつ単調なコスト c[0..n][0..n] に対し，\\n*\\tdp[l][r] = MIN_m∈(l..r) (dp[l][m] + dp[m][r]) + c[l][r]\\n* で定まる dp[0..n][0..n] を返す．\\n* \\n* c が単調であるとは，\\n*\\t∀l1, r1, l2, r2, [l1..r1) ⊂ [l2..r2) ⇒ c[l1][r1] ≦ c[l2][r2]\\n* が成り立つことをいう．\\n*/\\ntemplate <class T>\\nvector<vector<T>> knuth_yao_speedup(const vector<vector<T>>& c) {\\n\\tint n = sz(c) - 1;\\n\\n\\t// dp[l][r] : [l..r) のマージにかかる最小コスト\\n\\tvector<vector<T>> dp(n + 1, vector<T>(n + 1, INFL));\\n\\trep(l, n) dp[l][l + 1] = c[l][l + 1];\\n\\n\\t// sp[l][r] = m : [l..m) と [m..r) を最後にマージしたことを表す．\\n\\tvvi sp(n + 1, vi(n + 1, -1));\\n\\trep(i, n) sp[i][i + 1] = i + 1;\\n\\n\\trepir(l, n - 2, 0) repi(r, l + 2, n) {\\n\\t\\t// [l..m) と [m..r) を最後にマージする場合を考える．\\n\\t\\t//\\t調べる k の範囲を 1 つ短い区間の分割位置の間に限定している．\\n\\t\\trepi(m, sp[l][r - 1], sp[l + 1][r]) {\\n\\t\\t\\tif (chmin(dp[l][r], dp[l][m] + dp[m][r])) sp[l][r] = m;\\n\\t\\t}\\n\\n\\t\\t// [l..m) と [m..r) のマージにかかる m に依らないコストを加算する．\\n\\t\\tdp[l][r] += c[l][r];\\n\\t}\\n\\n\\treturn dp;\\n}\\n\\n\\nvoid MLE() {\\n\\tint n;\\n\\tcin >> n;\\n\\n\\tvl w(n);\\n\\tcin >> w;\\n\\n\\tvl acc(n + 1);\\n\\trep(i, n) acc[i + 1] = acc[i] + w[i];\\n\\n\\tvvl cost(n + 1, vl(n + 1));\\n\\trep(l, n) repi(r, l + 2, n) cost[l][r] = acc[r] - acc[l];\\n\\tdumpel(cost);\\n\\n\\tauto dp = knuth_yao_speedup(cost);\\n\\tdumpel(dp);\\n\\n\\tEXIT(dp[0][n]);\\n}\\n\\n\\n//【Knuth-Yao speedup】\\n/*\\n* 与えられた Monge かつ単調なコスト c[0..n][0..n] に対し，\\n*\\tdp[l][r] = MIN_m∈(l..r) (dp[l][m] + dp[m][r]) + c[l][r]\\n* で定まる dp[0..n][0..n] を返す．\\n*\\n* c が単調であるとは，\\n*\\t∀l1, r1, l2, r2, [l1..r1) ⊂ [l2..r2) ⇒ c[l1][r1] ≦ c[l2][r2]\\n* が成り立つことをいう．\\n*/\\ntemplate <class F>\\nvvl knuth_yao_speedup_func(int n, const F& c) {\\n\\t// dp[l][r] : [l..r) のマージにかかる最小コスト\\n\\tvvl dp(n + 1, vl(n + 1, INFL));\\n\\trep(l, n) dp[l][l + 1] = c(l, l + 1);\\n\\n\\t// sp[l][r] = m : [l..m) と [m..r) を最後にマージしたことを表す．\\n\\tvvi sp(n + 1, vi(n + 1, -1));\\n\\trep(i, n) sp[i][i + 1] = i + 1;\\n\\n\\trepir(l, n - 2, 0) repi(r, l + 2, n) {\\n\\t\\t// [l..m) と [m..r) を最後にマージする場合を考える．\\n\\t\\t//\\t調べる k の範囲を 1 つ短い区間の分割位置の間に限定している．\\n\\t\\trepi(m, sp[l][r - 1], sp[l + 1][r]) {\\n\\t\\t\\tif (chmin(dp[l][r], dp[l][m] + dp[m][r])) sp[l][r] = m;\\n\\t\\t}\\n\\n\\t\\t// [l..m) と [m..r) のマージにかかる m に依らないコストを加算する．\\n\\t\\tdp[l][r] += c(l, r);\\n\\t}\\n\\n\\treturn dp;\\n}\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tint n;\\n\\tcin >> n;\\n\\n\\tvl w(n);\\n\\tcin >> w;\\n\\n\\tvl acc(n + 1);\\n\\trep(i, n) acc[i + 1] = acc[i] + w[i];\\n\\n\\tauto cost = [&](int l, int r) {\\n\\t\\tif (r - l <= 1) return 0LL;\\n\\t\\treturn acc[r] - acc[l];\\n\\t};\\n\\n\\tauto dp = knuth_yao_speedup_func(n, cost);\\n\\tdumpel(dp);\\n\\n\\tEXIT(dp[0][n]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 191056,\n \"score_of_the_acc\": -0.9631,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2415_9652731\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n#define endl \\\"\\\\n\\\"\\ntypedef long long ll;\\nconst int N = 4005;\\n#define int long long\\nint w[N];\\nint dp[N][N], loc[N][N];\\nvoid solved() {\\n int n;\\n cin >> n;\\n for (int i = 1; i <= n; i++) {\\n cin >> w[i];\\n w[i] += w[i - 1];\\n }\\n for (int i = 1; i <= n; i++) {\\n for (int j = 1; j <= n; j++) {\\n dp[i][j] = 1e18;\\n if (i == j) {\\n dp[i][j] = 0;\\n loc[i][j] = i;\\n }\\n }\\n }\\n ll tmp;\\n for (int len = 1; len <= n; len++) {\\n for (int i = 1; i + len - 1 <= n; i++) {\\n int j = i + len - 1;\\n for (int k = loc[i][j - 1]; k <= loc[i + 1][j]; k++) {\\n tmp = dp[i][k] + dp[k + 1][j] + w[j] - w[i - 1];\\n if (tmp < dp[i][j]) {\\n dp[i][j] = tmp;\\n loc[i][j] = k;\\n }\\n }\\n }\\n }\\n cout << dp[1][n] << endl;\\n}\\nsigned main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout.tie(0);\\n \\n solved();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 253888,\n \"score_of_the_acc\": -1.224,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2415_9652699\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n#define endl \\\"\\\\n\\\"\\ntypedef long long ll;\\nconst int N = 4005;\\n#define int long long\\nint w[N];\\nint dp[N][N], loc[N][N];\\nvoid solved() {\\n int n;\\n cin >> n;\\n for (int i = 1; i <= n; i++) {\\n cin >> w[i];\\n w[i] += w[i - 1];\\n }\\n for (int i = 1; i <= n; i++) {\\n for (int j = 1; j <= n; j++) {\\n dp[i][j] = 1e18;\\n if (i == j) {\\n dp[i][j] = 0;\\n loc[i][j] = i;\\n }\\n }\\n }\\n ll tmp;\\n for (int len = 1; len <= n; len++) {\\n for (int i = 1; i + len - 1 <= n; i++) {\\n int j = i + len - 1;\\n for (int k = loc[i][j - 1]; k <= loc[i + 1][j]; k++) {\\n tmp = dp[i][k] + dp[k + 1][j] + w[j] - w[i - 1];\\n if (tmp < dp[i][j]) {\\n dp[i][j] = tmp;\\n loc[i][j] = k;\\n }\\n }\\n }\\n }\\n cout << dp[1][n] << endl;\\n}\\nsigned main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout.tie(0);\\n /*int t = 1;\\n cin >> t;\\n while (t--)*/\\n solved();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 253996,\n \"score_of_the_acc\": -1.2246,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2415_9652688\",\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\\nint N;\\nll W[4001],dp[4000][4000];\\nint loc[4000][4000];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d\\\",&N);\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = i; k < N; k++)dp[i][k] = HUGE_NUM;\\n\\t}\\n\\n\\tW[0] = 0;\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tscanf(\\\"%lld\\\",&W[i]);\\n\\t\\tW[i] += W[i-1];\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tdp[i][i] = 0;\\n\\t\\tloc[i][i] = i;\\n\\t}\\n\\n\\tint right;\\n\\tll tmp;\\n\\tfor(int length = 2; length <= N; length++){\\n\\t\\tfor(int left = 0; left+length-1 <= N-1; left++){\\n\\t\\t\\tright = left+length-1;\\n\\t\\t\\tfor(int mid = loc[left][right-1]; mid <= loc[left+1][right]; mid++){\\n\\t\\t\\t\\ttmp = dp[left][mid]+dp[mid+1][right]+W[right+1]-W[left];\\n\\t\\t\\t\\tif(tmp < dp[left][right]){\\n\\t\\t\\t\\t\\tdp[left][right] = tmp;\\n\\t\\t\\t\\t\\tloc[left][right] = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",dp[0][N-1]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 190100,\n \"score_of_the_acc\": -0.8834,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2415_9556853\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <climits>\\n\\nusing namespace std;\\n\\nint main() {\\n int numElements;\\n cin >> numElements;\\n \\n vector<long long> weights(numElements);\\n for (auto& weight : weights) {\\n cin >> weight;\\n }\\n\\n // 累積和を格納するベクター。sumWeights[i]はweightsの最初のi個の要素の合計\\n vector<long long> sumWeights(numElements + 1, 0);\\n for (int i = 0; i < numElements; ++i) {\\n sumWeights[i + 1] = sumWeights[i] + weights[i];\\n }\\n\\n // 分割点を記録するためのテーブル\\n vector<vector<int>> optimalCut(numElements, vector<int>(numElements));\\n \\n // 各区間の最小コストを記録するテーブル\\n vector<vector<long long>> minCost(numElements, vector<long long>(numElements, 0));\\n\\n // 初期化: 長さ2の区間についての最小コストと分割点を計算\\n for (int i = 0; i + 1 < numElements; ++i) {\\n optimalCut[i][i + 1] = i;\\n minCost[i][i + 1] = sumWeights[i + 2] - sumWeights[i];\\n }\\n\\n // 動的計画法による最小コストの計算\\n for (int length = 2; length < numElements; ++length) {\\n for (int start = 0; start + length < numElements; ++start) {\\n int end = start + length;\\n long long minTotalCost = LLONG_MAX;\\n int bestCut = -1;\\n\\n // 分割点を最適化するループ\\n for (int mid = optimalCut[start][end - 1]; mid <= optimalCut[start + 1][end]; ++mid) {\\n long long currentCost = minCost[start][mid] + minCost[mid + 1][end];\\n if (currentCost < minTotalCost) {\\n minTotalCost = currentCost;\\n bestCut = mid;\\n }\\n }\\n\\n minCost[start][end] = minTotalCost + sumWeights[end + 1] - sumWeights[start];\\n optimalCut[start][end] = bestCut;\\n }\\n }\\n\\n // 最終結果の出力: 配列全体を統合する最小コスト\\n cout << minCost[0][numElements - 1] << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 191124,\n \"score_of_the_acc\": -1.1885,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2415_9277451\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <cstdio>\\n#include <iostream>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\n#include <functional>\\n#include <set>\\n#include <map>\\n#include <string>\\n#include <vector>\\n#include <cmath>\\n#include<sstream>\\n#include<list>\\n#include<iomanip>\\n#include <cstdlib>\\n#include <cstring>\\n#include <stack>\\n#include <bitset>\\n#include <cassert>\\n#include <stdlib.h>\\n#include <stdio.h>\\nusing namespace std;\\nconst int INF = 1000000007;\\nconst long long LINF = 3e18 + 7;\\nconst int MAX_N = 1200010;\\nconst int MAX_W = 600010;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\n//using ll = long long;\\n\\n\\n// https://omochan.hatenablog.com/entry/2017/07/08/122642\\n\\n// 補足: https://sssslide.com/www.slideshare.net/ikumihide/ss-50881829\\n// 補足: https://blog.hamayanhamayan.com/entry/2017/03/20/234711\\n\\nint N;\\nlong long dp[4010][4010];\\nlong long w[4010];\\nlong long S[4010];\\nint A[4010][4010];\\n\\nint main() {\\n\\n\\tcin >> N;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> w[i];\\n\\t}\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tS[i + 1] = S[i] + w[i];\\n\\t}\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tA[i][i] = i;\\n\\t}\\n\\t\\n\\tfor (int k = 1; k < N; k++) {\\n\\t\\tfor (int i = 0; i <= N - k; i++) {\\n\\t\\t\\tint j = i + k;\\n\\t\\t\\tint a = A[i][j - 1];\\n\\t\\t\\tint b = A[i + 1][j];\\n\\t\\t\\tlong long m = LINF;\\n\\t\\t\\tint at = -1;\\n\\t\\t\\tfor (int l = a; l <= b; l++) {\\n\\t\\t\\t\\tif (i > l || l >= j)continue;\\n\\t\\t\\t\\tlong long tm = dp[i][l] + dp[l + 1][j];\\n\\t\\t\\t\\tif (tm <= m) {\\n\\t\\t\\t\\t\\tat = l;\\n\\t\\t\\t\\t\\tm = tm;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdp[i][j] = m + S[j + 1] - S[i];\\n\\t\\t\\tA[i][j] = at;\\n\\t\\t}\\n\\t}\\n\\n\\tcout << dp[0][N - 1] << endl;\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 125952,\n \"score_of_the_acc\": -1.241,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2415_9238032\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main(){\\n int n;\\n cin >> n;\\n \\n vector<ll> w(n+1,0);\\n vector<ll> wsm(n+1,0);\\n for(int i=1;i<=n;i++){\\n cin >> w[i];\\n wsm[i]=wsm[i-1]+w[i];\\n } \\n if(n==2){\\n cout << wsm[2] << endl;\\n return 0;\\n }\\n \\n vector dp(n+1,vector<ll>(n+1,LLONG_MAX));\\n vector m(n+1,vector<int>(n+1));\\n for(int i=1;i<=n;i++){\\n dp[i][i]=0;\\n m[i][i]=i;\\n if(i<n){ \\n dp[i][i+1]=w[i]+w[i+1];\\n m[i][i+1]=i;\\n }\\n }\\n \\n\\n \\n for(int k=2;k<n;k++){\\n for(int i=1;i<=n-k;i++){\\n for(int j=m[i][i+k-1];j<=m[i+1][i+k];j++){\\n if(dp[i][i+k]>dp[i][j]+dp[j+1][i+k]){\\n dp[i][i+k]=dp[i][j]+dp[j+1][i+k];\\n m[i][i+k]=j;\\n }\\n }\\n dp[i][i+k]+=wsm[i+k]-wsm[i-1];\\n }\\n }\\n\\n cout << dp[1][n] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 191080,\n \"score_of_the_acc\": -1.1883,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2415_8351144\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst ll INF = (1LL<<60);\\nint n;\\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\\nint main(){\\n cin >> n;\\n rui[0] = 0;\\n for(int i=1;i<=n;i++){\\n cin >> w;\\n rui[i] = w+rui[i-1];\\n cut[i][i] = i;\\n for(int j=i+1;j<=n;j++) dp[i][j] = INF;\\n dp[i][i] = 0;\\n }\\n for(int i=1;i<=n;i++){\\n for(int l=1;l<=n-i;l++){\\n int r = l+i;\\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\\n if(dp[l][r] > ncut){\\n dp[l][r] = ncut;\\n cut[l][r] = k;\\n }\\n }\\n }\\n }\\n cout << dp[1][n] << endl;\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 158160,\n \"score_of_the_acc\": -1.4754,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2415_8351142\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst ll INF = (1LL<<60);\\nint n;\\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\\nint main(){\\n cin >> n;\\n rui[0] = 0;\\n for(int i=1;i<=n;i++){\\n cin >> w;\\n rui[i] = w+rui[i-1];\\n cut[i][i] = i;\\n for(int j=1;j<=n;j++) dp[i][j] = INF;\\n dp[i][i] = 0;\\n }\\n for(int i=1;i<=n;i++){\\n for(int l=1;l<=n-i;l++){\\n int r = l+i;\\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\\n if(dp[l][r] > ncut){\\n dp[l][r] = ncut;\\n cut[l][r] = k;\\n }\\n }\\n }\\n }\\n cout << dp[1][n] << endl;\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 205764,\n \"score_of_the_acc\": -1.7609,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2415_8351132\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nconst ll INF = (1LL<<60);\\nint n;\\nll w, rui[4004], cut[4004][4004], dp[4004][4004];\\nint main(){\\n cin >> n;\\n rui[0] = 0;\\n fill_n(*dp, 4004*4004, INF);\\n for(int i=1;i<=n;i++){\\n cin >> w;\\n rui[i] = w+rui[i-1];\\n cut[i][i] = i;\\n dp[i][i] = 0;\\n }\\n for(int i=1;i<=n;i++){\\n for(int l=1;l<=n-i;l++){\\n int r = l+i;\\n for(int k=cut[l][r-1];k<=cut[l+1][r];k++){\\n ll ncut = dp[l][k] + dp[k+1][r] + rui[r]-rui[l-1];\\n if(dp[l][r] > ncut){\\n dp[l][r] = ncut;\\n cut[l][r] = k;\\n }\\n }\\n }\\n }\\n cout << dp[1][n] << endl;\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 205884,\n \"score_of_the_acc\": -1.7615,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1379,"cells":{"group_id":{"kind":"string","value":"aoj_2413_cpp"},"problem_description":{"kind":"string","value":"H - 植林\n問題文\nとある大学の魔法学部の生徒であるK君は広大な屋敷に住んでいる．\n 屋敷の裏には林が広がっていたが，所々木が生えていない箇所があった．\n このままでは屋敷からの見た目が悪いと感じたので，K君は木が生えていない箇所に木を植えることに決めた．\n 魔法使いの卵であるK君は使い魔を召喚することが出来るので，植林の作業を使い魔にやらせようと考えた．\n林は\nH × W\n個のセルを持つ長方形領域とみなすことが出来る．\n 各セルは木が1本生えているか1本も生えていないかのどちらかである．\n K君はこの\nH × W\n個のセルのどれか 1 つを指定し，そこに使い魔を召喚する．\n しかしK君はまだ未熟者なので，魔力を調節することが出来ず，使い魔を召喚するときは必ず 5 匹召喚してしまう．\n さらに悪いことに，K君が召喚する使い魔はひねくれもので，訪れたセルに木が生えていない場合はそこに木を植えるが，訪れたセルに既に木が生えている場合はそのセルの木を消してしまう．\n 召喚された使い魔のうちの 4 匹は，指定されたセルを始点として東西南北に散らばり1直線上を進み，1つ1つセルを訪れていく．これらの使い魔は林の外に出ると消える．\n 残りの使い魔は指定されたセルのみを訪問し，その後直ちに消える．\nより正確に言えば，K君がセル\n(i, j)\nに使い魔を召喚すると，\ni\n行目か或いは\nj\n列目にある\nH+W-1\n個のセルに対し，\n 木が生えていなければ木が植えられ，木が生えていれば木が消されるという操作が行われる．\n召喚には多くの魔力を必要とするので，出来るだけ少ない召喚回数で林を木で覆いつくしたい．\n K君はどのセルに使い魔を召喚すれば最小の召喚回数で林を木で覆いつくすことが出来るだろうか．\n入力形式\n入力は以下の形式で与えられる．\nH\nW\na\n1,1\n...\na\n1,W\n...\na\nH,1\n...\na\nH,W\na\ni,j\nが\n1\nならセル\n(i,j)\nに木が生えていることを意味し,\n0\nなら生えていないことを意味する．\n出力形式\nもし林を木で覆いつくすことが不可能なら，1行に\nImpossible\nを出力せよ．\nそうでなければ，召喚回数を最小にするような召喚手順を以下の形式で\nH\n行に出力せよ．\nb\n1,1\n... b\n1,W\n...\nb\nH,1\n... b\nH,W\nb\ni,j\nは\n0\nもしくは\n1\nでなければならず,\n1\nならセル\n(i,j)\nに使い魔を召喚する事を意味し，\n0\nなら召喚しない事を意味する．\n2回同じ場所に使い魔を召喚しても意味が無いことに注意せよ．召喚回数を最小にするような召喚手順が複数ある場合はどれを出力しても良い．\n制約\n2 ≤ H，W ≤ 1000\nH，W\nは偶数\na\ni,j\n∈ {0, 1}\nこの問題の判定には，3 点分のテストケースのグループが設定されている． このグループに含まれるテストケースは上記の制約に加えて下記の制約も満たす．\nH × W ≤ 20\n入出力例\n入力例 1\n4 4\n0 0 0 1\n0 1 1 0\n0 1 1 0\n1 0 0 0\n出力例 1\n1 0 0 0\n0 0 0 0\n0 0 0 0\n0 0 0 1\nセル\n(1,1)\nとセル\n(4,4)\nに使い魔を召喚することで林を木で覆いつくすことが出来る．\nWriter: 田村和範\nTester: 花田裕一朗"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2413_10283335","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 h, w;\n cin >> h >> w;\n vector<vector<ll>> a(h, vector<ll>(w));\n vector<ll> ch(h), cw(w);\n rep(i, 0, h)\n {\n rep(j, 0, w)\n {\n cin >> a[i][j];\n ch[i] += (1 - a[i][j]);\n cw[j] += (1 - a[i][j]);\n }\n }\n rep(i, 0, h)\n {\n rep(j, 0, w)\n {\n ll C = ch[i] + cw[j];\n if (a[i][j] == 0)\n {\n C -= 1;\n }\n cout << C % 2;\n if (j != w - 1)\n {\n cout << \" \";\n }\n }\n cout << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":11264,"score_of_the_acc":-0.0831,"final_rank":12},{"submission_id":"aoj_2413_9131642","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\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h, w;\n cin >> h >> w;\n vector<int> a(h), b(w);\n vector<vector<int>> c(h, vector<int>(w));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n int w;\n cin >> w;\n if (!w) {\n c[i][j] = 1;\n a[i] ^= 1;\n b[j] ^= 1;\n }\n }\n }\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (j) cout << \" \";\n cout << (a[i] ^ b[j] ^ c[i][j]);\n }\n cout << \"\\n\";\n }\n}","accuracy":1,"time_ms":70,"memory_kb":7032,"score_of_the_acc":-0.0362,"final_rank":2},{"submission_id":"aoj_2413_5960961","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};\n\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int h, w; cin >> h >> w;\n vector<int> cnt(h), cnt2(w);\n vector<vector<int>> a(h, vector<int>(w));\n REP(i,h) {\n REP(j,w) {\n int c; cin >> c;\n a[i][j] = c;\n if(c == 0) {\n cnt[i]++;\n cnt2[j]++;\n }\n }\n }\n REP(i,h) {\n REP(j,w) {\n if(j) cout << \" \";\n if((cnt[i]+cnt2[j] - (a[i][j]==0))%2 == 1) cout << 1;\n else cout << 0;\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":7032,"score_of_the_acc":-0.0405,"final_rank":3},{"submission_id":"aoj_2413_5847041","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// clang-format off\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing vii = vector<int>;\nusing vll = vector<ll>;\nusing vdd = vector<ld>;\nusing vvii = vector<vector<int>>;\nusing vvll = vector<vector<ll>>;\nusing vvdd = vector<vector<ld>>;\nusing vvvii = vector<vector<vector<int>>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vvvdd = vector<vector<vector<ld>>>;\ntemplate<class T, class U> using P = pair<T, U>;\ntemplate<class T> using V1 = vector<T>;\ntemplate<class T> using V2 = vector<vector<T>>;\ntemplate<class T> using V3 = vector<vector<vector<T>>>;\ntemplate<class T> using pque = priority_queue<T, vector<T>, greater<T>>;\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 rep(...) _overload3(__VA_ARGS__, 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 rrep(...) _overload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(), (x).end()\n#define sz(x) ((int)(x).size())\n#define fi first\n#define se second\n#define pb push_back\n#define endl '\\n'\n#define popcnt(x) __builtin_popcountll(x)\n#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end());\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst ld DINF = numeric_limits<ld>::infinity();\nconst ll mod = 1000000007;\n//const ll mod = 998244353;\nconst ld EPS = 1e-9;\nconst ld PI = 3.1415926535897932;\nconst ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst ll dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\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<typename T> T min(const vector<T> &x) { return *min_element(all(x)); }\ntemplate<typename T> T max(const vector<T> &x) { return *max_element(all(x)); }\ntemplate<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << \"(\" << p.fi << \", \" << p.se << \")\"; }\ntemplate<class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << \"[ \"; for (auto &z : v) os << z << \" \"; os << \"]\"; return os; }\n#ifdef _DEBUG\n#define show(x) cout << #x << \" = \" << x << endl;\n#else\n#define show(x)\n#endif\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 rem(ll a, ll b) { return (a % b + b) % b; }\n// clang-format on\n\n// using mint = modint998244353;\n\nll modpow(ll a, ll N, ll mod) {\n ll res = 1;\n // 例えば3=101(2)なので、下位bitから順に1ならa倍する\n while (N) {\n if (N & 1) res = res * a % mod;\n a = a * a % mod;\n N >>= 1;\n }\n return res;\n}\n\nint main() {\n // IOS;\n int h, w;\n cin >> h >> w;\n vvii g(h, vii(w, 0));\n rep(i, h) rep(j, w) cin >> g[i][j];\n vii H(h, 0), W(w, 0);\n rep(i, h) rep(j, w) {\n H[i] ^= g[i][j];\n W[j] ^= g[i][j];\n }\n vvii ans(h, vii(w, 0));\n rep(i, h) rep(j, w) ans[i][j] = (g[i][j] ^ H[i] ^ W[j] ^ 1);\n rep(i, h) {\n rep(j, w) {\n cout << ans[i][j];\n if (j != w - 1)\n cout << \" \";\n else\n cout << endl;\n }\n }\n return 0;\n}\n\n/*\nメモ\nライツアウトの一種\n(i,j)だけひっくり返すことが、i行とj列全てのマスに対して操作することで実現可能\nひっくり返すをXORと考えると、各行各列ごとに累積XORみたいなものを前計算できるのでO(HW)になる\n前計算しなくてもO(HW(H+W))でOK(昔は通らなかったのかもしれない)\n*/","accuracy":1,"time_ms":120,"memory_kb":11348,"score_of_the_acc":-0.1147,"final_rank":14},{"submission_id":"aoj_2413_3996341","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n\nconst int INF = 0x3f3f3f3f;\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\n// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},\n// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};\n\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n/*-------------------------------------------------*/\nint main() {\n int h, w; cin >> h >> w;\n vector<vector<int> > a(h, vector<int>(w)); REP(i, h) REP(j, w) cin >> a[i][j];\n vector<int> yoko(h, 0), tate(w, 0);\n REP(i, h) REP(j, w) {\n if (a[i][j] == 0) {\n ++yoko[i];\n ++tate[j];\n }\n }\n REP(i, h) REP(j, w) cout << ((yoko[i] + tate[j] + 1 - a[i][j]) & 1 ? 1 : 0) << (j + 1 == w ? '\\n' : ' ');\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":6836,"score_of_the_acc":-0.0423,"final_rank":4},{"submission_id":"aoj_2413_2670902","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 table[1000][1000],row_memo[1000],col_memo[1000];\n\nint main(){\n\n\tint H,W;\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++)row_memo[row] = 0;\n\tfor(int col = 0; col < W; col++)col_memo[col] = 0;\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tscanf(\"%d\",&table[row][col]);\n\t\t\tif(table[row][col] == 0){\n\t\t\t\trow_memo[row]++;\n\t\t\t\tcol_memo[col]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(col > 0)printf(\" \");\n\t\t\tprintf(\"%d\",((1-table[row][col])+row_memo[row]+col_memo[col])%2);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":7128,"score_of_the_acc":-0.0549,"final_rank":5},{"submission_id":"aoj_2413_2424723","code_snippet":"#include <bits/stdc++.h>\n\n#define _overload(_1,_2,_3,name,...) name\n#define _rep(i,n) _range(i,0,n)\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\n\n#define _rrep(i,n) _rrange(i,n,0)\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\n\n#define _all(arg) begin(arg),end(arg)\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\n#define clr(a,b) memset((a),(b),sizeof(a))\n#define bit(n) (1LL<<(n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\n\nusing ll=long long;\nusing R=long double;\nconst R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\ninline R sq(R x){return sqrt(max(x,0.0L));}\n\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\n// Problem Specific Parameter:\n\nint h,w;\nint a[1010][1010];\nint fh[1010],fw[1010];\n\nint main(void){\n\tcin >> h >> w;\n\trep(i,h)rep(j,w) cin >> a[i][j];\n\n\trep(i,h)rep(j,w){\n\t\tif(a[i][j]==0){\n\t\t\tfh[i]++;\n\t\t\tfw[j]++;\n\t\t}\n\t}\n\t\n\trep(i,h){\n\t\trep(j,w) cout << (j?\" \":\"\") << (fh[i]+fw[j]+(a[i][j]==0))%2;\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":7000,"score_of_the_acc":-0.0794,"final_rank":10},{"submission_id":"aoj_2413_1681268","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\nint h,w;\nbool yoko[2000],tate[2000];\nbool mp[2000][2000];\nbool res[2000][2000];\n\nint main(){\n cin>>h>>w;\n REP(i,h)REP(j,w)cin>>mp[i][j];\n REP(i,h)REP(j,w){\n if(!mp[i][j]){\n res[i][j]^=true;\n yoko[i]^=true;\n tate[j]^=true;\n }\n }\n REP(i,h){\n REP(j,w){\n cout<<(res[i][j]^yoko[i]^tate[j])<<(j==w-1?\"\":\" \");\n }\n cout<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":7224,"score_of_the_acc":-0.1086,"final_rank":13},{"submission_id":"aoj_2413_1267932","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\n#define mp(a,b) make_pair((a),(b))\n#define debug(x) #x << \"=\" << (x)\n \n#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#define dump(x) std::cerr << debug(x) << \" (L:\" << __LINE__ << \")\" << std::endl\n#else\n#define dump(x)\n#endif\n\ntypedef long long int ll;\ntypedef pair<int,int> pii;\n//template<typename T> using vec=std::vector<T>;\n\nconst int INF=1<<30;\nconst long long int INF_=1LL<<58;\nconst double EPS=1e-9;\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\n\tos << \"[\";\n\tfor (const auto &v : vec) {\n\t\tos << v << \",\";\n\t}\n\tos << \"]\";\n\treturn os;\n}\n\nvoid Solve(){\n\tint h,w,b[1000][1000];\n\tcin >> h >> w;\n\trep(i,0,h) rep(j,0,w) cin >> b[i][j];\n\n\tint cnt[1000][1000]={};\n\trep(i,0,h){\n\t\trep(j,0,w){\n\t\t\tif(!b[i][j]){\n\t\t\t\trep(k,0,w) if(k!=j) ++cnt[i][k];\n\t\t\t\trep(k,0,h) if(k!=i) ++cnt[k][j];\n\t\t\t\t++cnt[i][j];\n\t\t\t}\n\t\t}\n\t}\n\n\trep(i,0,h){\n\t\trep(j,0,w){\n\t\t\tcout << cnt[i][j]%2;\n\t\t\tif(j==w-1) cout << endl;\n\t\t\telse cout << ' ';\n\t\t}\n\t}\n}\n\nint main(){\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tSolve();\n\treturn 0;\n}","accuracy":1,"time_ms":2340,"memory_kb":9016,"score_of_the_acc":-1.0535,"final_rank":19},{"submission_id":"aoj_2413_1143591","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint b[1000000];\nint r[1000],c[1000];\n\nint main(){\n int h,w;\n scanf(\"%d%d\",&h,&w);\n\n for(int i=0;i<h*w;i++){\n scanf(\"%d\",b+i);\n if(!b[i])r[i/w]++, c[i%w]++;\n }\n\n for(int i=0;i<h*w;i++){\n printf(\"%d%c\",(r[i/w]+c[i%w]+1-b[i])&1,i%w==w-1?'\\n':' ');\n }\n}","accuracy":1,"time_ms":200,"memory_kb":5100,"score_of_the_acc":-0.0676,"final_rank":8},{"submission_id":"aoj_2413_1143586","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint b[1000][1000];\n\nint main(){\n int h,w;\n scanf(\"%d%d\",&h,&w);\n vector<int> r(h,0), c(w,0);\n\n for(int i=0;i<h;i++)for(int j=0;j<w;j++){\n scanf(\"%d\",&b[i][j]);\n if(!b[i][j])r[i]++, c[j]++;\n }\n\n for(int i=0;i<h;i++)for(int j=0;j<w;j++){\n printf(\"%d%c\",(r[i]+c[j]+1-b[i][j])&1,j+1==w?'\\n':' ');\n }\n}","accuracy":1,"time_ms":190,"memory_kb":5104,"score_of_the_acc":-0.0632,"final_rank":6},{"submission_id":"aoj_2413_912768","code_snippet":"#include <iostream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <numeric>\n#include <utility>\n#include <iomanip>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef vector<long long> vll;\ntypedef pair<int,int> pint;\ntypedef pair<long long, long long> pll;\n\n#define MP make_pair\n#define PB push_back\n#define ALL(s) (s).begin(),(s).end()\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\n\n\nconst int MAX1 = 2020;\nconst int MAX2 = 2020;\nint SIZE1, SIZE2;\n\ntemplate<class T> struct BIT2D { \n T dat[2][2][MAX1 + 1][MAX2 + 1];\n \n void init(int n = 1, int m = 1) {\n SIZE1 = n, SIZE2 = m;\n for (int i = 0; i <= SIZE1; ++i) \n for (int j = 0; j <= SIZE2; ++j) \n dat[0][0][i][j] = dat[0][1][i][j] = dat[1][0][i][j] = dat[1][1][i][j] = 0;\n }\n \n inline void subsub_add(int f, int s, int a, int b, T x) {\n for (int i = a; i <= SIZE1; i += i & -i) \n for (int j = b; j <= SIZE2; j += j & -j) \n dat[f][s][i][j] = dat[f][s][i][j] + x;\n }\n \n inline void sub_add(int a1, int a2, long long x) {\n subsub_add(0, 0, a1, a2, x*(a1-1)*(a2-1));\n subsub_add(1, 0, a1, a2, -x*(a1-1));\n subsub_add(0, 1, a1, a2, -x*(a2-1));\n subsub_add(1, 1, a1, a2, x);\n }\n \n // a1 <= x < b1, a2 <= y < b2\n inline void add(int a1, int a2, int b1, int b2, long long x) {\n sub_add(a1, a2, x);\n sub_add(a1, b2, -x);\n sub_add(b1, a2, -x);\n sub_add(b1, b2, x);\n }\n \n inline T subsub_sum(int f, int s, int a, int b) {\n T res = 0;\n for (int i = a; i > 0; i -= i & -i) \n for (int j = b; j > 0; j -= j & -j) \n res = res + dat[f][s][i][j];\n return res;\n }\n \n inline T sub_sum(int a1, int a2) {\n T res = 0;\n res += subsub_sum(0, 0, a1-1, a2-1);\n res += subsub_sum(1, 0, a1-1, a2-1) * (a2-1);\n res += subsub_sum(0, 1, a1-1, a2-1) * (a1-1);\n res += subsub_sum(1, 1, a1-1, a2-1) * (a1-1) * (a2-1);\n return res;\n }\n \n // a1 <= x < b1, a2 <= y < b2\n inline T sum(int a1, int a2, int b1, int b2) {\n return sub_sum(b1, b2) - sub_sum(a1, b2) - sub_sum(b1, a2) + sub_sum(a1, a2);\n }\n \n void print() {\n for (int i = 1; i <= SIZE1; ++i) {\n for (int j = 1; j <= SIZE2; ++j) \n cout << sum(i, j, i+1, j+1) << \",\";\n cout << endl;\n }\n }\n};\n\nBIT2D<long long > bit;\n\n\n\n\nint H, W;\nint a[2000][2000];\n\n\nint main() {\n while (cin >> H >> W) {\n bit.init(H, W);\n \n for (int i = 1; i <= H; ++i) for (int j = 1; j <= W; ++j) {\n cin >> a[i][j];\n if (a[i][j] == 0) {\n bit.add(i, 1, i+1, W+1, 1);\n bit.add(1, j, H+1, j+1, 1);\n bit.add(i, j, i+1, j+1, -1);\n }\n }\n for (int i = 1; i <= H; ++i) {\n for (int j = 1; j <= W; ++j) {\n long long sum = bit.sum(i, j, i+1, j+1);\n cout << sum%2;\n if (j != W) cout << \" \";\n }\n cout << endl;\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":2080,"memory_kb":81024,"score_of_the_acc":-1.8865,"final_rank":20},{"submission_id":"aoj_2413_705190","code_snippet":"#include <cstdlib>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint h, w;\n\tcin >> h >> w;\n\n\tvector<vector<int> > a(h, vector<int>(w));\n\tvector<int> col(w, 0), row(h, 0);\n\tfor(int i = 0; i < h; ++i) {\n\t\tfor(int j = 0; j < w; ++j) {\n\t\t\tcin >> a[i][j];\n\n\t\t\tif(!a[i][j]) {\n\t\t\t\t++col[j];\n\t\t\t\t++row[i];\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < h; ++i) {\n\t\tfor(int j = 0; j < w; ++j) {\n\t\t\tif((col[j] + row[i] + (1 - a[i][j])) & 1)\n\t\t\t\tcout << \"1\";\n\t\t\telse\n\t\t\t\tcout << \"0\";\n\n\t\t\tcout << (j + 1 == w ? \"\\n\" : \" \");\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}","accuracy":1,"time_ms":120,"memory_kb":4964,"score_of_the_acc":-0.0308,"final_rank":1},{"submission_id":"aoj_2413_527828","code_snippet":"#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\n#include <set>\n#include <cstdio>\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\nusing namespace std;\n\nint a[1000][1000];\nint hh[1000];\nint ww[1000];\n\nint main(){\n const int h = getInt();\n const int w = getInt();\n\n REP(i,h) REP(j,w){\n a[i][j] = getInt();\n hh[i] += a[i][j];\n ww[j] += a[i][j];\n }\n\n REP(i,h) REP(j,w)\n printf(\"%d%c\", (3 * a[i][j] + hh[i] + ww[j] + 1) % 2, j == w - 1 ? '\\n' : ' ');\n\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":4944,"score_of_the_acc":-0.0655,"final_rank":7},{"submission_id":"aoj_2413_501869","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\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 <climits>\n#include <cfloat>\nusing namespace std;\n\nint main()\n{\n int h, w;\n cin >> h >> w;\n\n vector<vector<int> > a(h, vector<int>(w));\n vector<vector<int> > b(h, vector<int>(w, 0));\n vector<bool> y(h, false), x(w, false);\n for(int i=0; i<h; ++i){\n for(int j=0; j<w; ++j){\n cin >> a[i][j];\n if(!a[i][j]){\n b[i][j] = 1;\n y[i] = !y[i];\n x[j] = !x[j];\n }\n }\n }\n\n for(int i=0; i<h; ++i){\n for(int j=0; j<w; ++j){\n b[i][j] ^= (y[i] ^ x[j])? 1:0;\n }\n }\n\n for(int i=0; i<h; ++i){\n for(int j=0; j<w-1; ++j)\n cout << b[i][j] << ' ';\n cout << b[i][w-1] << endl;\n }\n}","accuracy":1,"time_ms":240,"memory_kb":8924,"score_of_the_acc":-0.1353,"final_rank":17},{"submission_id":"aoj_2413_497663","code_snippet":"#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint h, w;\nint t[1002][1002];\nint col[1002], row[1002];\n\nvoid solve(){\n memset(col, 0, sizeof(col));\n memset(row, 0, sizeof(row));\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(t[i][j] == 0){\n col[j]++;\n row[i]++;\n }\n }\n }\n\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n if(j != 0) cout << \" \";\n cout << (!t[i][j] + col[j] + row[i]) % 2;\n }\n cout << endl;\n }\n}\n\nint main(){\n while(cin >> h >> w){\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n cin >> t[i][j];\n }\n }\n\n solve();\n }\n}","accuracy":1,"time_ms":220,"memory_kb":5084,"score_of_the_acc":-0.0761,"final_rank":9},{"submission_id":"aoj_2413_496401","code_snippet":"#include <stdio.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint n, m, a[1024][1024], b[1024][1024], x[1024], y[1024];\ninline int f(int i, int j) { return (a[i][j]+b[i][j]+x[i]+y[j]) % 2; }\n\nint main() {\n scanf(\"%d%d\", &n, &m);\n rep (i, n) rep (j, m) scanf(\"%d\", a[i]+j);\n rep (k, n-1) {\n int c = 0;\n rep (i, m) c += f(k, i) != f(k+1, i);\n rep (i, m) if ((f(k, i)==f(k+1, i)) == c%2) b[k+1][i]++, y[i]++;\n x[k+1] = c;\n }\n int s = 0;\n rep (i, m) if (f(0, i)) s++;\n rep (i, m) if (f(0, i) == s%2) rep (k, n) b[k][i]++;\n rep (i, n) rep (j, m) printf(\"%d%c\", b[i][j]%2, \"\\n \"[j+1<m]);\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":9224,"score_of_the_acc":-0.1218,"final_rank":15},{"submission_id":"aoj_2413_496400","code_snippet":"#include <stdio.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint n, m, a[1024][1024], b[1024][1024], x[1024], y[1024];\ninline int f(int i, int j) { return (a[i][j]+b[i][j]+x[i]+y[j]) % 2; }\n\nint main() {\n scanf(\"%d%d\", &n, &m);\n rep (i, n) rep (j, m) scanf(\"%d\", a[i]+j);\n rep (k, n-1) {\n int c = 0;\n rep (i, m) c += f(k, i) != f(k+1, i);\n if (c%2) {\n rep (i, m) if (f(k, i) == f(k+1, i)) b[k+1][i]++, y[i]++;\n }\n else {\n rep (i, m) if (f(k, i) != f(k+1, i)) b[k+1][i]++, y[i]++;\n }\n x[k+1] = c;\n }\n int s = 0;\n rep (i, m) if (f(0, i)) s++;\n if (s%2) {\n rep (i, m) if (f(0, i)) rep (k, n) b[k][i]++;\n }\n else {\n rep (i, m) if (!f(0, i)) rep (k, n) b[k][i]++;\n }\n rep (i, n) rep (j, m) printf(\"%d%c\", b[i][j]%2, \"\\n \"[j+1<m]);\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":9224,"score_of_the_acc":-0.1218,"final_rank":15},{"submission_id":"aoj_2413_494697","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <cassert>\n#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <algorithm>\n#include <numeric>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <list>\n#include <set>\n#include <map>\n#include <bitset>\n#include <functional>\n#include <iterator>\n\nusing namespace std;\n\n#define dump(n) cout<<\"# \"<<#n<<\"=\"<<(n)<<endl\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\n#define rep(i,n) repi(i,0,n)\n#define per(i,n) peri(i,0,n)\n#define iter(c) __typeof__((c).begin())\n#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n\ntypedef unsigned int uint;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\n\nconst int INFTY=1<<29;\nconst double EPS=1e-9;\n\ntemplate<typename T1,typename T2>\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\n\treturn os<<'('<<p.first<<','<<p.second<<')';\n}\ntemplate<typename T>\nostream& operator<<(ostream& os,const vector<T>& a){\n\tos<<'[';\n\trep(i,a.size()) os<<(i?\" \":\"\")<<a[i];\n\treturn os<<']';\n}\n\nint main()\n{\n\tfor(int h,w;cin>>h>>w;){\n\t\tvvi grid(h,vi(w));\n\t\trep(i,h) rep(j,w) cin>>grid[i][j];\n\t\t\n\t\tvvi hgrid(h,vi(w+1)),vgrid(h+1,vi(w));\n\t\trep(i,h) rep(j,w) if(!grid[i][j]){\n\t\t\thgrid[i][0]++; hgrid[i][w]--;\n\t\t\thgrid[i][j]--; hgrid[i][j+1]++;\n\t\t\tvgrid[0][j]++; vgrid[h][j]--;\n\t\t}\n\t\trep(i,h) rep(j,w){\n\t\t\thgrid[i][j+1]+=hgrid[i][j];\n\t\t\tvgrid[i+1][j]+=vgrid[i][j];\n\t\t}\n\t\t\n\t\tvvi res(h,vi(w));\n\t\trep(i,h) rep(j,w)\n\t\t\tres[i][j]=hgrid[i][j]+vgrid[i][j]&1;\n\t\t\n\t\trep(i,h) rep(j,w)\n\t\t\tcout<<res[i][j]<<(j==w-1?'\\n':' ');\n\t}\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":230,"memory_kb":16844,"score_of_the_acc":-0.235,"final_rank":18},{"submission_id":"aoj_2413_488989","code_snippet":"#include<iostream>\n#include<cstdio>\n \nusing namespace std;\n \n \nint main(){\n int h,w,imap[1010][1010],H[1010],W[1010];\n for(int i=0;i<1010;i++)H[i] = W[i] = 0;\n cin >> h >> w;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cin >> imap[i][j];\n if(imap[i][j] == 0)H[i]++,W[j]++;\n }\n }\n \n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n (H[i]+W[j]-1+imap[i][j])%2==0?cout << 0:cout << 1;\n if(j != w-1)cout << ' ';\n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":5120,"score_of_the_acc":-0.0809,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_2413_10283335\",\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 h, w;\\n cin >> h >> w;\\n vector<vector<ll>> a(h, vector<ll>(w));\\n vector<ll> ch(h), cw(w);\\n rep(i, 0, h)\\n {\\n rep(j, 0, w)\\n {\\n cin >> a[i][j];\\n ch[i] += (1 - a[i][j]);\\n cw[j] += (1 - a[i][j]);\\n }\\n }\\n rep(i, 0, h)\\n {\\n rep(j, 0, w)\\n {\\n ll C = ch[i] + cw[j];\\n if (a[i][j] == 0)\\n {\\n C -= 1;\\n }\\n cout << C % 2;\\n if (j != w - 1)\\n {\\n cout << \\\" \\\";\\n }\\n }\\n cout << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11264,\n \"score_of_the_acc\": -0.0831,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2413_9131642\",\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\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int h, w;\\n cin >> h >> w;\\n vector<int> a(h), b(w);\\n vector<vector<int>> c(h, vector<int>(w));\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n int w;\\n cin >> w;\\n if (!w) {\\n c[i][j] = 1;\\n a[i] ^= 1;\\n b[j] ^= 1;\\n }\\n }\\n }\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n if (j) cout << \\\" \\\";\\n cout << (a[i] ^ b[j] ^ c[i][j]);\\n }\\n cout << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7032,\n \"score_of_the_acc\": -0.0362,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2413_5960961\",\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};\\n\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n int h, w; cin >> h >> w;\\n vector<int> cnt(h), cnt2(w);\\n vector<vector<int>> a(h, vector<int>(w));\\n REP(i,h) {\\n REP(j,w) {\\n int c; cin >> c;\\n a[i][j] = c;\\n if(c == 0) {\\n cnt[i]++;\\n cnt2[j]++;\\n }\\n }\\n }\\n REP(i,h) {\\n REP(j,w) {\\n if(j) cout << \\\" \\\";\\n if((cnt[i]+cnt2[j] - (a[i][j]==0))%2 == 1) cout << 1;\\n else cout << 0;\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7032,\n \"score_of_the_acc\": -0.0405,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2413_5847041\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// clang-format off\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pdd = pair<ld, ld>;\\nusing vii = vector<int>;\\nusing vll = vector<ll>;\\nusing vdd = vector<ld>;\\nusing vvii = vector<vector<int>>;\\nusing vvll = vector<vector<ll>>;\\nusing vvdd = vector<vector<ld>>;\\nusing vvvii = vector<vector<vector<int>>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vvvdd = vector<vector<vector<ld>>>;\\ntemplate<class T, class U> using P = pair<T, U>;\\ntemplate<class T> using V1 = vector<T>;\\ntemplate<class T> using V2 = vector<vector<T>>;\\ntemplate<class T> using V3 = vector<vector<vector<T>>>;\\ntemplate<class T> using pque = priority_queue<T, vector<T>, greater<T>>;\\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 rep(...) _overload3(__VA_ARGS__, 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 rrep(...) _overload3(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)\\n#define all(x) (x).begin(), (x).end()\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define endl '\\\\n'\\n#define popcnt(x) __builtin_popcountll(x)\\n#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end());\\n#define IOS ios::sync_with_stdio(false); cin.tie(nullptr);\\nconst int inf = 1 << 30;\\nconst ll INF = 1ll << 60;\\nconst ld DINF = numeric_limits<ld>::infinity();\\nconst ll mod = 1000000007;\\n//const ll mod = 998244353;\\nconst ld EPS = 1e-9;\\nconst ld PI = 3.1415926535897932;\\nconst ll dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconst ll dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\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<typename T> T min(const vector<T> &x) { return *min_element(all(x)); }\\ntemplate<typename T> T max(const vector<T> &x) { return *max_element(all(x)); }\\ntemplate<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\"; }\\ntemplate<class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << \\\"[ \\\"; for (auto &z : v) os << z << \\\" \\\"; os << \\\"]\\\"; return os; }\\n#ifdef _DEBUG\\n#define show(x) cout << #x << \\\" = \\\" << x << endl;\\n#else\\n#define show(x)\\n#endif\\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 rem(ll a, ll b) { return (a % b + b) % b; }\\n// clang-format on\\n\\n// using mint = modint998244353;\\n\\nll modpow(ll a, ll N, ll mod) {\\n ll res = 1;\\n // 例えば3=101(2)なので、下位bitから順に1ならa倍する\\n while (N) {\\n if (N & 1) res = res * a % mod;\\n a = a * a % mod;\\n N >>= 1;\\n }\\n return res;\\n}\\n\\nint main() {\\n // IOS;\\n int h, w;\\n cin >> h >> w;\\n vvii g(h, vii(w, 0));\\n rep(i, h) rep(j, w) cin >> g[i][j];\\n vii H(h, 0), W(w, 0);\\n rep(i, h) rep(j, w) {\\n H[i] ^= g[i][j];\\n W[j] ^= g[i][j];\\n }\\n vvii ans(h, vii(w, 0));\\n rep(i, h) rep(j, w) ans[i][j] = (g[i][j] ^ H[i] ^ W[j] ^ 1);\\n rep(i, h) {\\n rep(j, w) {\\n cout << ans[i][j];\\n if (j != w - 1)\\n cout << \\\" \\\";\\n else\\n cout << endl;\\n }\\n }\\n return 0;\\n}\\n\\n/*\\nメモ\\nライツアウトの一種\\n(i,j)だけひっくり返すことが、i行とj列全てのマスに対して操作することで実現可能\\nひっくり返すをXORと考えると、各行各列ごとに累積XORみたいなものを前計算できるのでO(HW)になる\\n前計算しなくてもO(HW(H+W))でOK(昔は通らなかったのかもしれない)\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 11348,\n \"score_of_the_acc\": -0.1147,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2413_3996341\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <chrono>\\n#define _USE_MATH_DEFINES\\n#include <cmath>\\n#include <cstring>\\n#include <ctime>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iomanip>\\n#include <iterator>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\n\\nconst int INF = 0x3f3f3f3f;\\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n// const int MOD = 998244353;\\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\n// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},\\n// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};\\n\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n/*-------------------------------------------------*/\\nint main() {\\n int h, w; cin >> h >> w;\\n vector<vector<int> > a(h, vector<int>(w)); REP(i, h) REP(j, w) cin >> a[i][j];\\n vector<int> yoko(h, 0), tate(w, 0);\\n REP(i, h) REP(j, w) {\\n if (a[i][j] == 0) {\\n ++yoko[i];\\n ++tate[j];\\n }\\n }\\n REP(i, h) REP(j, w) cout << ((yoko[i] + tate[j] + 1 - a[i][j]) & 1 ? 1 : 0) << (j + 1 == w ? '\\\\n' : ' ');\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 6836,\n \"score_of_the_acc\": -0.0423,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2413_2670902\",\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 table[1000][1000],row_memo[1000],col_memo[1000];\\n\\nint main(){\\n\\n\\tint H,W;\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\n\\tfor(int row = 0; row < H; row++)row_memo[row] = 0;\\n\\tfor(int col = 0; col < W; col++)col_memo[col] = 0;\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tscanf(\\\"%d\\\",&table[row][col]);\\n\\t\\t\\tif(table[row][col] == 0){\\n\\t\\t\\t\\trow_memo[row]++;\\n\\t\\t\\t\\tcol_memo[col]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tif(col > 0)printf(\\\" \\\");\\n\\t\\t\\tprintf(\\\"%d\\\",((1-table[row][col])+row_memo[row]+col_memo[col])%2);\\n\\t\\t}\\n\\t\\tprintf(\\\"\\\\n\\\");\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 7128,\n \"score_of_the_acc\": -0.0549,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2413_2424723\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define _overload(_1,_2,_3,name,...) name\\n#define _rep(i,n) _range(i,0,n)\\n#define _range(i,a,b) for(int i=int(a);i<int(b);++i)\\n#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)\\n\\n#define _rrep(i,n) _rrange(i,n,0)\\n#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)\\n#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)\\n\\n#define _all(arg) begin(arg),end(arg)\\n#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))\\n#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)\\n#define clr(a,b) memset((a),(b),sizeof(a))\\n#define bit(n) (1LL<<(n))\\n#define popcount(n) (__builtin_popcountll(n))\\n\\nusing namespace std;\\n\\ntemplate<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}\\ntemplate<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}\\n\\nusing ll=long long;\\nusing R=long double;\\nconst R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\\ninline int sgn(const R& r){return(r > EPS)-(r < -EPS);}\\ninline R sq(R x){return sqrt(max(x,0.0L));}\\n\\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\\n// Problem Specific Parameter:\\n\\nint h,w;\\nint a[1010][1010];\\nint fh[1010],fw[1010];\\n\\nint main(void){\\n\\tcin >> h >> w;\\n\\trep(i,h)rep(j,w) cin >> a[i][j];\\n\\n\\trep(i,h)rep(j,w){\\n\\t\\tif(a[i][j]==0){\\n\\t\\t\\tfh[i]++;\\n\\t\\t\\tfw[j]++;\\n\\t\\t}\\n\\t}\\n\\t\\n\\trep(i,h){\\n\\t\\trep(j,w) cout << (j?\\\" \\\":\\\"\\\") << (fh[i]+fw[j]+(a[i][j]==0))%2;\\n\\t\\tcout << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 7000,\n \"score_of_the_acc\": -0.0794,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2413_1681268\",\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\\nint h,w;\\nbool yoko[2000],tate[2000];\\nbool mp[2000][2000];\\nbool res[2000][2000];\\n\\nint main(){\\n cin>>h>>w;\\n REP(i,h)REP(j,w)cin>>mp[i][j];\\n REP(i,h)REP(j,w){\\n if(!mp[i][j]){\\n res[i][j]^=true;\\n yoko[i]^=true;\\n tate[j]^=true;\\n }\\n }\\n REP(i,h){\\n REP(j,w){\\n cout<<(res[i][j]^yoko[i]^tate[j])<<(j==w-1?\\\"\\\":\\\" \\\");\\n }\\n cout<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 7224,\n \"score_of_the_acc\": -0.1086,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2413_1267932\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,x,y) for(int i=(x);i<(y);++i)\\n#define mp(a,b) make_pair((a),(b))\\n#define debug(x) #x << \\\"=\\\" << (x)\\n \\n#ifdef DEBUG\\n#define _GLIBCXX_DEBUG\\n#define dump(x) std::cerr << debug(x) << \\\" (L:\\\" << __LINE__ << \\\")\\\" << std::endl\\n#else\\n#define dump(x)\\n#endif\\n\\ntypedef long long int ll;\\ntypedef pair<int,int> pii;\\n//template<typename T> using vec=std::vector<T>;\\n\\nconst int INF=1<<30;\\nconst long long int INF_=1LL<<58;\\nconst double EPS=1e-9;\\nconst int dx[]={1,0,-1,0},dy[]={0,1,0,-1};\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){\\n\\tos << \\\"[\\\";\\n\\tfor (const auto &v : vec) {\\n\\t\\tos << v << \\\",\\\";\\n\\t}\\n\\tos << \\\"]\\\";\\n\\treturn os;\\n}\\n\\nvoid Solve(){\\n\\tint h,w,b[1000][1000];\\n\\tcin >> h >> w;\\n\\trep(i,0,h) rep(j,0,w) cin >> b[i][j];\\n\\n\\tint cnt[1000][1000]={};\\n\\trep(i,0,h){\\n\\t\\trep(j,0,w){\\n\\t\\t\\tif(!b[i][j]){\\n\\t\\t\\t\\trep(k,0,w) if(k!=j) ++cnt[i][k];\\n\\t\\t\\t\\trep(k,0,h) if(k!=i) ++cnt[k][j];\\n\\t\\t\\t\\t++cnt[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\trep(i,0,h){\\n\\t\\trep(j,0,w){\\n\\t\\t\\tcout << cnt[i][j]%2;\\n\\t\\t\\tif(j==w-1) cout << endl;\\n\\t\\t\\telse cout << ' ';\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tSolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2340,\n \"memory_kb\": 9016,\n \"score_of_the_acc\": -1.0535,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2413_1143591\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint b[1000000];\\nint r[1000],c[1000];\\n\\nint main(){\\n int h,w;\\n scanf(\\\"%d%d\\\",&h,&w);\\n\\n for(int i=0;i<h*w;i++){\\n scanf(\\\"%d\\\",b+i);\\n if(!b[i])r[i/w]++, c[i%w]++;\\n }\\n\\n for(int i=0;i<h*w;i++){\\n printf(\\\"%d%c\\\",(r[i/w]+c[i%w]+1-b[i])&1,i%w==w-1?'\\\\n':' ');\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5100,\n \"score_of_the_acc\": -0.0676,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2413_1143586\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint b[1000][1000];\\n\\nint main(){\\n int h,w;\\n scanf(\\\"%d%d\\\",&h,&w);\\n vector<int> r(h,0), c(w,0);\\n\\n for(int i=0;i<h;i++)for(int j=0;j<w;j++){\\n scanf(\\\"%d\\\",&b[i][j]);\\n if(!b[i][j])r[i]++, c[j]++;\\n }\\n\\n for(int i=0;i<h;i++)for(int j=0;j<w;j++){\\n printf(\\\"%d%c\\\",(r[i]+c[j]+1-b[i][j])&1,j+1==w?'\\\\n':' ');\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 5104,\n \"score_of_the_acc\": -0.0632,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2413_912768\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <numeric>\\n#include <utility>\\n#include <iomanip>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef vector<int> vint;\\ntypedef vector<long long> vll;\\ntypedef pair<int,int> pint;\\ntypedef pair<long long, long long> pll;\\n\\n#define MP make_pair\\n#define PB push_back\\n#define ALL(s) (s).begin(),(s).end()\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) \\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P) \\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) \\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s << endl; }\\n\\n\\n\\nconst int MAX1 = 2020;\\nconst int MAX2 = 2020;\\nint SIZE1, SIZE2;\\n\\ntemplate<class T> struct BIT2D { \\n T dat[2][2][MAX1 + 1][MAX2 + 1];\\n \\n void init(int n = 1, int m = 1) {\\n SIZE1 = n, SIZE2 = m;\\n for (int i = 0; i <= SIZE1; ++i) \\n for (int j = 0; j <= SIZE2; ++j) \\n dat[0][0][i][j] = dat[0][1][i][j] = dat[1][0][i][j] = dat[1][1][i][j] = 0;\\n }\\n \\n inline void subsub_add(int f, int s, int a, int b, T x) {\\n for (int i = a; i <= SIZE1; i += i & -i) \\n for (int j = b; j <= SIZE2; j += j & -j) \\n dat[f][s][i][j] = dat[f][s][i][j] + x;\\n }\\n \\n inline void sub_add(int a1, int a2, long long x) {\\n subsub_add(0, 0, a1, a2, x*(a1-1)*(a2-1));\\n subsub_add(1, 0, a1, a2, -x*(a1-1));\\n subsub_add(0, 1, a1, a2, -x*(a2-1));\\n subsub_add(1, 1, a1, a2, x);\\n }\\n \\n // a1 <= x < b1, a2 <= y < b2\\n inline void add(int a1, int a2, int b1, int b2, long long x) {\\n sub_add(a1, a2, x);\\n sub_add(a1, b2, -x);\\n sub_add(b1, a2, -x);\\n sub_add(b1, b2, x);\\n }\\n \\n inline T subsub_sum(int f, int s, int a, int b) {\\n T res = 0;\\n for (int i = a; i > 0; i -= i & -i) \\n for (int j = b; j > 0; j -= j & -j) \\n res = res + dat[f][s][i][j];\\n return res;\\n }\\n \\n inline T sub_sum(int a1, int a2) {\\n T res = 0;\\n res += subsub_sum(0, 0, a1-1, a2-1);\\n res += subsub_sum(1, 0, a1-1, a2-1) * (a2-1);\\n res += subsub_sum(0, 1, a1-1, a2-1) * (a1-1);\\n res += subsub_sum(1, 1, a1-1, a2-1) * (a1-1) * (a2-1);\\n return res;\\n }\\n \\n // a1 <= x < b1, a2 <= y < b2\\n inline T sum(int a1, int a2, int b1, int b2) {\\n return sub_sum(b1, b2) - sub_sum(a1, b2) - sub_sum(b1, a2) + sub_sum(a1, a2);\\n }\\n \\n void print() {\\n for (int i = 1; i <= SIZE1; ++i) {\\n for (int j = 1; j <= SIZE2; ++j) \\n cout << sum(i, j, i+1, j+1) << \\\",\\\";\\n cout << endl;\\n }\\n }\\n};\\n\\nBIT2D<long long > bit;\\n\\n\\n\\n\\nint H, W;\\nint a[2000][2000];\\n\\n\\nint main() {\\n while (cin >> H >> W) {\\n bit.init(H, W);\\n \\n for (int i = 1; i <= H; ++i) for (int j = 1; j <= W; ++j) {\\n cin >> a[i][j];\\n if (a[i][j] == 0) {\\n bit.add(i, 1, i+1, W+1, 1);\\n bit.add(1, j, H+1, j+1, 1);\\n bit.add(i, j, i+1, j+1, -1);\\n }\\n }\\n for (int i = 1; i <= H; ++i) {\\n for (int j = 1; j <= W; ++j) {\\n long long sum = bit.sum(i, j, i+1, j+1);\\n cout << sum%2;\\n if (j != W) cout << \\\" \\\";\\n }\\n cout << endl;\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2080,\n \"memory_kb\": 81024,\n \"score_of_the_acc\": -1.8865,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2413_705190\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint h, w;\\n\\tcin >> h >> w;\\n\\n\\tvector<vector<int> > a(h, vector<int>(w));\\n\\tvector<int> col(w, 0), row(h, 0);\\n\\tfor(int i = 0; i < h; ++i) {\\n\\t\\tfor(int j = 0; j < w; ++j) {\\n\\t\\t\\tcin >> a[i][j];\\n\\n\\t\\t\\tif(!a[i][j]) {\\n\\t\\t\\t\\t++col[j];\\n\\t\\t\\t\\t++row[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < h; ++i) {\\n\\t\\tfor(int j = 0; j < w; ++j) {\\n\\t\\t\\tif((col[j] + row[i] + (1 - a[i][j])) & 1)\\n\\t\\t\\t\\tcout << \\\"1\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tcout << \\\"0\\\";\\n\\n\\t\\t\\tcout << (j + 1 == w ? \\\"\\\\n\\\" : \\\" \\\");\\n\\t\\t}\\n\\t}\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4964,\n \"score_of_the_acc\": -0.0308,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2413_527828\",\n \"code_snippet\": \"#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\n#include <set>\\n#include <cstdio>\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\nusing namespace std;\\n\\nint a[1000][1000];\\nint hh[1000];\\nint ww[1000];\\n\\nint main(){\\n const int h = getInt();\\n const int w = getInt();\\n\\n REP(i,h) REP(j,w){\\n a[i][j] = getInt();\\n hh[i] += a[i][j];\\n ww[j] += a[i][j];\\n }\\n\\n REP(i,h) REP(j,w)\\n printf(\\\"%d%c\\\", (3 * a[i][j] + hh[i] + ww[j] + 1) % 2, j == w - 1 ? '\\\\n' : ' ');\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 4944,\n \"score_of_the_acc\": -0.0655,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2413_501869\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\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 <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nint main()\\n{\\n int h, w;\\n cin >> h >> w;\\n\\n vector<vector<int> > a(h, vector<int>(w));\\n vector<vector<int> > b(h, vector<int>(w, 0));\\n vector<bool> y(h, false), x(w, false);\\n for(int i=0; i<h; ++i){\\n for(int j=0; j<w; ++j){\\n cin >> a[i][j];\\n if(!a[i][j]){\\n b[i][j] = 1;\\n y[i] = !y[i];\\n x[j] = !x[j];\\n }\\n }\\n }\\n\\n for(int i=0; i<h; ++i){\\n for(int j=0; j<w; ++j){\\n b[i][j] ^= (y[i] ^ x[j])? 1:0;\\n }\\n }\\n\\n for(int i=0; i<h; ++i){\\n for(int j=0; j<w-1; ++j)\\n cout << b[i][j] << ' ';\\n cout << b[i][w-1] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 8924,\n \"score_of_the_acc\": -0.1353,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2413_497663\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\nusing namespace std;\\n\\nint h, w;\\nint t[1002][1002];\\nint col[1002], row[1002];\\n\\nvoid solve(){\\n memset(col, 0, sizeof(col));\\n memset(row, 0, sizeof(row));\\n\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n if(t[i][j] == 0){\\n col[j]++;\\n row[i]++;\\n }\\n }\\n }\\n\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n if(j != 0) cout << \\\" \\\";\\n cout << (!t[i][j] + col[j] + row[i]) % 2;\\n }\\n cout << endl;\\n }\\n}\\n\\nint main(){\\n while(cin >> h >> w){\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n cin >> t[i][j];\\n }\\n }\\n\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 5084,\n \"score_of_the_acc\": -0.0761,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2413_496401\",\n \"code_snippet\": \"#include <stdio.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n\\nint n, m, a[1024][1024], b[1024][1024], x[1024], y[1024];\\ninline int f(int i, int j) { return (a[i][j]+b[i][j]+x[i]+y[j]) % 2; }\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &n, &m);\\n rep (i, n) rep (j, m) scanf(\\\"%d\\\", a[i]+j);\\n rep (k, n-1) {\\n int c = 0;\\n rep (i, m) c += f(k, i) != f(k+1, i);\\n rep (i, m) if ((f(k, i)==f(k+1, i)) == c%2) b[k+1][i]++, y[i]++;\\n x[k+1] = c;\\n }\\n int s = 0;\\n rep (i, m) if (f(0, i)) s++;\\n rep (i, m) if (f(0, i) == s%2) rep (k, n) b[k][i]++;\\n rep (i, n) rep (j, m) printf(\\\"%d%c\\\", b[i][j]%2, \\\"\\\\n \\\"[j+1<m]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 9224,\n \"score_of_the_acc\": -0.1218,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2413_496400\",\n \"code_snippet\": \"#include <stdio.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n\\nint n, m, a[1024][1024], b[1024][1024], x[1024], y[1024];\\ninline int f(int i, int j) { return (a[i][j]+b[i][j]+x[i]+y[j]) % 2; }\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &n, &m);\\n rep (i, n) rep (j, m) scanf(\\\"%d\\\", a[i]+j);\\n rep (k, n-1) {\\n int c = 0;\\n rep (i, m) c += f(k, i) != f(k+1, i);\\n if (c%2) {\\n rep (i, m) if (f(k, i) == f(k+1, i)) b[k+1][i]++, y[i]++;\\n }\\n else {\\n rep (i, m) if (f(k, i) != f(k+1, i)) b[k+1][i]++, y[i]++;\\n }\\n x[k+1] = c;\\n }\\n int s = 0;\\n rep (i, m) if (f(0, i)) s++;\\n if (s%2) {\\n rep (i, m) if (f(0, i)) rep (k, n) b[k][i]++;\\n }\\n else {\\n rep (i, m) if (!f(0, i)) rep (k, n) b[k][i]++;\\n }\\n rep (i, n) rep (j, m) printf(\\\"%d%c\\\", b[i][j]%2, \\\"\\\\n \\\"[j+1<m]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 9224,\n \"score_of_the_acc\": -0.1218,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2413_494697\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <climits>\\n#include <cassert>\\n#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <algorithm>\\n#include <numeric>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <list>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <functional>\\n#include <iterator>\\n\\nusing namespace std;\\n\\n#define dump(n) cout<<\\\"# \\\"<<#n<<\\\"=\\\"<<(n)<<endl\\n#define repi(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define peri(i,a,b) for(int i=int(b);i-->int(a);)\\n#define rep(i,n) repi(i,0,n)\\n#define per(i,n) peri(i,0,n)\\n#define iter(c) __typeof__((c).begin())\\n#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();++i)\\n#define all(c) (c).begin(),(c).end()\\n#define mp make_pair\\n\\ntypedef unsigned int uint;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\n\\nconst int INFTY=1<<29;\\nconst double EPS=1e-9;\\n\\ntemplate<typename T1,typename T2>\\nostream& operator<<(ostream& os,const pair<T1,T2>& p){\\n\\treturn os<<'('<<p.first<<','<<p.second<<')';\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os,const vector<T>& a){\\n\\tos<<'[';\\n\\trep(i,a.size()) os<<(i?\\\" \\\":\\\"\\\")<<a[i];\\n\\treturn os<<']';\\n}\\n\\nint main()\\n{\\n\\tfor(int h,w;cin>>h>>w;){\\n\\t\\tvvi grid(h,vi(w));\\n\\t\\trep(i,h) rep(j,w) cin>>grid[i][j];\\n\\t\\t\\n\\t\\tvvi hgrid(h,vi(w+1)),vgrid(h+1,vi(w));\\n\\t\\trep(i,h) rep(j,w) if(!grid[i][j]){\\n\\t\\t\\thgrid[i][0]++; hgrid[i][w]--;\\n\\t\\t\\thgrid[i][j]--; hgrid[i][j+1]++;\\n\\t\\t\\tvgrid[0][j]++; vgrid[h][j]--;\\n\\t\\t}\\n\\t\\trep(i,h) rep(j,w){\\n\\t\\t\\thgrid[i][j+1]+=hgrid[i][j];\\n\\t\\t\\tvgrid[i+1][j]+=vgrid[i][j];\\n\\t\\t}\\n\\t\\t\\n\\t\\tvvi res(h,vi(w));\\n\\t\\trep(i,h) rep(j,w)\\n\\t\\t\\tres[i][j]=hgrid[i][j]+vgrid[i][j]&1;\\n\\t\\t\\n\\t\\trep(i,h) rep(j,w)\\n\\t\\t\\tcout<<res[i][j]<<(j==w-1?'\\\\n':' ');\\n\\t}\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 16844,\n \"score_of_the_acc\": -0.235,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2413_488989\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n \\nusing namespace std;\\n \\n \\nint main(){\\n int h,w,imap[1010][1010],H[1010],W[1010];\\n for(int i=0;i<1010;i++)H[i] = W[i] = 0;\\n cin >> h >> w;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cin >> imap[i][j];\\n if(imap[i][j] == 0)H[i]++,W[j]++;\\n }\\n }\\n \\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n (H[i]+W[j]-1+imap[i][j])%2==0?cout << 0:cout << 1;\\n if(j != w-1)cout << ' ';\\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 5120,\n \"score_of_the_acc\": -0.0809,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1380,"cells":{"group_id":{"kind":"string","value":"aoj_2419_cpp"},"problem_description":{"kind":"string","value":"Acrophobia\nC: 高所恐怖症\n高杉やよいは，超売れっ子アイドルである．\nそんな彼女には，1つ苦手なものがある．\n高いところだ・・・．彼女は，極度の高所恐怖症なのである．\n彼女は今回，プロデューサーの不手際により，バラエティ番組で次のようなチャレンジに挑戦することになってしまった．\n今回のロケは，とある忍者屋敷のとある一室で行われる．\nこの部屋の床には，正方形のタイルが敷き詰められており，いくつかのタイルが抜け落ちて穴になっている．\nこの穴から落ちると数メートル下の池にまっさかさまである．\nやよいのチャレンジ内容は，この部屋の指定された場所からスタートし，部屋の中に置かれた全ての巻物を回収し，ゴール地点まで持っていくことである．\nやよいは，部屋の中を以下のルールに従って移動できる．\nあるタイルから隣のタイルへ移動するとき，上下左右のタイルにのみ移動することができる．\n穴に近くない場合，隣のタイルへ移動するためには，1秒だけ時間がかかる．\n穴に近づいた場合，やよいは怖がってしまい図C-1のように移動時間がかかる．例えば，図中の矢印のように，[2][2]から[1][2]へ移動するためには，3秒かかる．\n複数の穴が近くにある場合，最も近くにある穴に対して怖がる．\n巻物を取るためにかかる時間は，0と仮定してよい．\n図C-1: 穴の近くの移動時間\nやよいは，なるべく早くこのチャレンジを終わらせたいと考えている．\nあなたの仕事は，このチャレンジを終了するための最短時間を求めるプログラムを書き，やよいを助けてあげることである．\nInput\n忍者屋敷の床情報が与えられる．\nまず，1行目に部屋の大きさを表す，\nW\nと\nH\nがスペース区切りで入力される(2 <=\nW\n,\nH\n<= 100)．\n続く\nH\n行の各行には，\nW\n文字の文字列が入力される．\n床情報を表す文字には，以下の種類がある．\n'.' : 歩ける床\n'#' : 穴\n'S' : やよいが開始時に立っている場所\n'G' : やよいが辿りつくべき場所\n'M' : 巻物が置いてある場所\n'S'と'G'と'M'は，歩ける床である．\n'S'と'G'はそれぞれ，部屋の中にちょうど1個存在する．全ての巻物が揃っていない状態でゴールを通過しても構わない．\n'M'は，部屋の中に最小で1個，最大で5個存在する．\nOutput\n全ての巻物を集めて，スタートからゴールへたどり着くための最短タイムを1行に出力せよ．入力データには，必ずそのようなルートがあると仮定してよい．\n行の最後には，改行を出力すること．\nSample Input 1\n3 4\nS.M\n...\n...\nM.G\nSample Output 1\n9\nSample Input 2\n4 4\nS..M\n....\n...#\n#..G\nSample Output 2\n18\nSample Input 3\n11 7\nM.........M\n...........\n...#.S.#...\n...........\n...#.G.#...\n...........\nM.........M\nSample Output 3\n62"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2419_10000626","code_snippet":"#include \"bits/stdc++.h\" \n\nusing namespace std;\n\nvector<vector<int> > cst(110, vector<int>(110, 1)); \nint dist[110][110];\nint n, m;\n\nstruct node\n{\n int x, y, d;\n};\n\nvoid dejkstra(int x, int y)\n{\n queue<node> q;\n node p = {x,y,0};\n q.push(p); dist[x][y] = 0;\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\n while(!q.empty())\n {\n p = q.front(); q.pop();\n if(dist[p.x][p.y] < p.d) continue;\n for(int i = 0; i < 4; i++)\n {\n int nx = p.x + dx[i];\n int ny = p.y + dy[i];\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\n int best = p.d + cst[p.x][p.y];\n if(dist[nx][ny] > best)\n {\n dist[nx][ny] = best;\n node l = {nx,ny,best};\n q.push(l);\n }\n }\n }\n}\n\nint main()\n{\n cin >> m >> n;\n char a[n][m];\n int xS, yS, xG, yG; \n for(int i = 0; i < n; i++)\n for(int j = 0;j < m;j ++) cin >> a[i][j];\n\n vector<pair<int, int> > M;\n \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 for(int x = i - 2; x <= i + 2; x++)\n for(int y = j - 2; y <= j + 2; y++)\n if(x >= 0 && y >= 0)\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\n }\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\n if(a[i][j] == 'S') xS = i, yS = j;\n if(a[i][j] == 'G') xG = i, yG = j;\n }\n } \n \n int k = M.size();\n vector<int> perm;\n int ans = 1e9;\n \n for(int i = 0;i < k; i++) perm.push_back(i);\n do{\n vector<pair<int, int> > p;\n p.push_back(make_pair(xS,yS));\n for(auto it : perm) p.push_back(M[it]);\n p.push_back(make_pair(xG,yG));\n \n int sum = 0;\n for(int i = 0;i < p.size()-1; i++)\n {\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\n dejkstra(p[i].first, p[i].second);\n sum += dist[p[i+1].first][p[i+1].second];\n } \n ans = min(ans, sum);\n\n } while(next_permutation(perm.begin(), perm.end()));\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":230,"memory_kb":3552,"score_of_the_acc":-0.5563,"final_rank":16},{"submission_id":"aoj_2419_10000625","code_snippet":"#include \"bits/stdc++.h\" \n\nusing namespace std;\n\nvector<vector<int> > cst(110, vector<int>(110, 1)); \nint dist[110][110];\nint n, m;\n\nstruct node\n{\n int x, y, d;\n};\n\nvoid dejkstra(int x, int y)\n{\n queue<node> q;\n node p = {x,y,0};\n q.push(p); dist[x][y] = 0;\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\n while(!q.empty())\n {\n p = q.front(); q.pop();\n if(dist[p.x][p.y] < p.d) continue;\n for(int i = 0; i < 4; i++)\n {\n int nx = p.x + dx[i];\n int ny = p.y + dy[i];\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\n int best = p.d + cst[p.x][p.y];\n if(dist[nx][ny] > best)\n {\n dist[nx][ny] = best;\n node l = {nx,ny,best};\n q.push(l);\n }\n }\n }\n}\n\nint main()\n{\n cin >> m >> n;\n char a[n][m];\n int xS, yS, xG, yG; \n for(int i = 0; i < n; i++)\n for(int j = 0;j < m;j ++) cin >> a[i][j];\n\n vector<pair<int, int> > M;\n \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 for(int x = i - 2; x <= i + 2; x++)\n for(int y = j - 2; y <= j + 2; y++)\n if(x >= 0 && y >= 0)\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\n }\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\n if(a[i][j] == 'S') xS = i, yS = j;\n if(a[i][j] == 'G') xG = i, yG = j;\n }\n } \n \n int k = M.size();\n vector<int> perm;\n int ans = 1e9;\n \n for(int i = 0;i < k; i++) perm.push_back(i);\n do{\n vector<pair<int, int> > p;\n p.push_back(make_pair(xS,yS));\n for(auto it : perm) p.push_back(M[it]);\n p.push_back(make_pair(xG,yG));\n \n int sum = 0;\n for(int i = 0;i < p.size()-1; i++)\n {\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\n dejkstra(p[i].first, p[i].second);\n sum += dist[p[i+1].first][p[i+1].second];\n } \n ans = min(ans, sum);\n\n } while(next_permutation(perm.begin(), perm.end()));\n cout << ans << endl;\n}","accuracy":1,"time_ms":240,"memory_kb":3552,"score_of_the_acc":-0.5813,"final_rank":17},{"submission_id":"aoj_2419_10000566","code_snippet":"#include \"bits/stdc++.h\" \n\nusing namespace std;\n\nvector<vector<int> > cst(110, vector<int>(110, 1)); \nint dist[110][110];\nint n, m;\n\nstruct node\n{\n int x, y, d;\n};\n\nvoid dejkstra(int x, int y)\n{\n queue<node> q;\n node p = {x,y,0};\n q.push(p); dist[x][y] = 0;\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\n while(!q.empty())\n {\n p = q.front(); q.pop();\n if(dist[p.x][p.y] < p.d) continue;\n for(int i = 0; i < 4; i++)\n {\n int nx = p.x + dx[i];\n int ny = p.y + dy[i];\n //cout << p.x << ' ' << p.y << ' ' << ny << ' ' << nx << endl;\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\n int best = p.d + cst[p.x][p.y];\n //cout << nx << ' ' << ny << ' ' << best << ' ' << p.x << ' ' << p.y << ' ' << endl;\n if(dist[nx][ny] > best)\n {\n dist[nx][ny] = best;\n node l = {nx,ny,best};\n q.push(l);\n }\n }\n }\n}\n\nint main()\n{\n cin >> m >> n;\n char a[n][m];\n int xS, yS, xG, yG; \n for(int i = 0; i < n; i++)\n for(int j = 0;j < m;j ++) cin >> a[i][j];\n\n vector<pair<int, int> > M;\n \n for(int i =0 ; i< n;i++)\n {\n for(int j = 0;j < m; j++)\n {\n int f = 0;\n if(a[i][j] == '#')\n {\n for(int x = i - 2; x <= i + 2; x++)\n for(int y = j - 2; y <= j + 2; y++)\n if(x >= 0 && y >= 0)\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\n }\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\n if(a[i][j] == 'S') xS = i, yS = j;\n if(a[i][j] == 'G') xG = i, yG = j;\n }\n }\n \n int k = M.size();\n vector<int> perm;\n // for(int i = 0;i < n; i++){\n // for(int j = 0;j < m ;j++)\n // cout << cst[i][j] << ' ';\n // cout << endl;\n // }\n int ans = 1e9;\n \n for(int i = 0;i < k; i++) perm.push_back(i);\n do{\n vector<pair<int, int> > p;\n p.push_back(make_pair(xS,yS));\n for(auto it : perm) p.push_back(M[it]);\n p.push_back(make_pair(xG,yG));\n // for(auto it : p) cout << it.first << ' ' << it.second << endl;\n // cout << endl;\n int sum = 0;\n for(int i = 0;i < p.size()-1; i++)\n {\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\n dejkstra(p[i].first, p[i].second);\n // for(int i = 0;i < n; i++){\n // for(int j = 0;j < m ;j++)\n // cout << dist[i][j] << ' ';\n // cout << endl;\n // } cout << endl;\n sum += dist[p[i+1].first][p[i+1].second];\n } \n ans = min(ans, sum);\n\n } while(next_permutation(perm.begin(), perm.end()));\n\n cout << ans << endl;\n}","accuracy":1,"time_ms":240,"memory_kb":3556,"score_of_the_acc":-0.5814,"final_rank":18},{"submission_id":"aoj_2419_5034519","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(vector<bool>::reference v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 6 \"/home/yuruhiya/programming/library/template/functions.cpp\"\nusing namespace std;\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> T div_ceil(T n, T m) {\n\treturn (n + m - 1) / m;\n}\ntemplate <class T> T div_ceil2(T n, T m) {\n\treturn div_ceil(n, m) * m;\n}\ntemplate <class T> T triangle(T n) {\n\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\n}\ntemplate <class T> T nC2(T n) {\n\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\n}\ntemplate <class T> T middle(const T& l, const T& r) {\n\treturn l + (r - l) / 2;\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> bool in_range(const T& v, const T& min, const T& max) {\n\treturn min <= v && v < max;\n}\ntemplate <class T> bool in_square(T n) {\n\tT s = sqrt(n);\n\treturn s * s == n || (s + 1) * (s + 1) == n;\n}\ntemplate <class T = long long> T BIT(int b) {\n\treturn T(1) << b;\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}\ntemplate <class T, class U> T Pow(T a, U n) {\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> T Powmod(T a, U n, T 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}\nnamespace internal {\n\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\n\t\tif constexpr (N == 1) {\n\t\t\treturn vector(sizes[0], init);\n\t\t} else {\n\t\t\tint size = sizes[N - 1];\n\t\t\tsizes.pop_back();\n\t\t\treturn vector(size, make_vector<T, N - 1>(sizes, init));\n\t\t}\n\t}\n} // namespace internal\ntemplate <class T, size_t N>\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\n\tvector s(rbegin(sizes), rend(sizes));\n\treturn internal::make_vector<T, N>(s, init);\n}\n#line 7 \"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Utility/Point.cpp\"\n#include <optional>\n#line 9 \"/home/yuruhiya/programming/library/Utility/Point.cpp\"\nusing namespace std;\n\nstruct Point {\n\tstatic int H, W;\n\tstatic const vector<Point> direction;\n\tusing direction_iterator = vector<Point>::const_iterator;\n\tstatic void set_range(int _H, int _W) {\n\t\tH = _H;\n\t\tW = _W;\n\t}\n\tstatic constexpr Point zero() {\n\t\treturn {0, 0};\n\t}\n\tstatic constexpr Point one() {\n\t\treturn {1, 1};\n\t}\n\tstatic constexpr Point L() {\n\t\treturn {-1, 0};\n\t}\n\tstatic constexpr Point R() {\n\t\treturn {1, 0};\n\t}\n\tstatic constexpr Point U() {\n\t\treturn {0, -1};\n\t}\n\tstatic constexpr Point D() {\n\t\treturn {0, 1};\n\t}\n\tstatic constexpr Point LU() {\n\t\treturn {-1, -1};\n\t}\n\tstatic constexpr Point LD() {\n\t\treturn {-1, 1};\n\t}\n\tstatic constexpr Point RU() {\n\t\treturn {1, -1};\n\t}\n\tstatic constexpr Point RD() {\n\t\treturn {1, 1};\n\t}\n\n\tint x, y;\n\tconstexpr Point() : x(0), y(0) {}\n\tconstexpr Point(int _x, int _y) : x(_x), y(_y) {}\n\tconstexpr Point(const pair<int, int>& xy) : x(xy.first), y(xy.second) {}\n\tPoint(int n) : x(n % W), y(n / W) {}\n\tconstexpr Point operator+() const {\n\t\treturn *this;\n\t}\n\tconstexpr Point operator-() const {\n\t\treturn {-x, -y};\n\t}\n\tconstexpr Point operator+(const Point& p) const {\n\t\treturn Point(*this) += p;\n\t}\n\tconstexpr Point operator-(const Point& p) const {\n\t\treturn Point(*this) -= p;\n\t}\n\tconstexpr Point operator*(const Point& p) const {\n\t\treturn Point(*this) *= p;\n\t}\n\tconstexpr Point operator/(const Point& p) const {\n\t\treturn Point(*this) /= p;\n\t}\n\tconstexpr Point operator%(const Point& p) const {\n\t\treturn Point(*this) %= p;\n\t}\n\tconstexpr Point operator+(int n) const {\n\t\treturn Point(*this) += n;\n\t}\n\tconstexpr Point operator-(int n) const {\n\t\treturn Point(*this) -= n;\n\t}\n\tconstexpr Point operator*(int n) const {\n\t\treturn Point(*this) *= n;\n\t}\n\tconstexpr Point operator/(int n) const {\n\t\treturn Point(*this) /= n;\n\t}\n\tconstexpr Point operator%(int n) const {\n\t\treturn Point(*this) %= n;\n\t}\n\tconstexpr Point& operator+=(const Point& p) {\n\t\tx += p.x;\n\t\ty += p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator-=(const Point& p) {\n\t\tx -= p.x;\n\t\ty -= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator*=(const Point& p) {\n\t\tx *= p.x;\n\t\ty *= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator/=(const Point& p) {\n\t\tx /= p.x;\n\t\ty /= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator%=(const Point& p) {\n\t\tx %= p.x;\n\t\ty %= p.y;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator+=(int n) {\n\t\tx += n;\n\t\ty += n;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator-=(int n) {\n\t\tx -= n;\n\t\ty -= n;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator*=(int n) {\n\t\tx *= n;\n\t\ty *= n;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator/=(int n) {\n\t\tx /= n;\n\t\ty /= n;\n\t\treturn *this;\n\t}\n\tconstexpr Point& operator%=(int n) {\n\t\tx %= n;\n\t\ty %= n;\n\t\treturn *this;\n\t}\n\tconstexpr bool operator==(const Point& p) const {\n\t\treturn x == p.x && y == p.y;\n\t}\n\tconstexpr bool operator!=(const Point& p) const {\n\t\treturn x != p.x || y != p.y;\n\t}\n\tbool operator<(const Point& p) const {\n\t\treturn to_i() < p.to_i();\n\t}\n\tbool operator<=(const Point& p) const {\n\t\treturn to_i() <= p.to_i();\n\t}\n\tbool operator>(const Point& p) const {\n\t\treturn to_i() > p.to_i();\n\t}\n\tbool operator>=(const Point& p) const {\n\t\treturn to_i() >= p.to_i();\n\t}\n\tconstexpr int operator[](int i) const {\n\t\treturn i == 0 ? x : i == 1 ? y : 0;\n\t}\n\tconstexpr bool in_range(int height, int width) const {\n\t\treturn 0 <= x && x < width && 0 <= y && y < height;\n\t}\n\tbool in_range() const {\n\t\treturn in_range(H, W);\n\t}\n\tint to_i() const {\n\t\treturn x + y * W;\n\t}\n\tconstexpr pair<int, int> to_pair() const {\n\t\treturn {x, y};\n\t}\n\tconstexpr int manhattan_distance(const Point& p) const {\n\t\treturn abs(x - p.x) + abs(y - p.y);\n\t}\n\tconstexpr int chebyshev_distance(const Point& p) const {\n\t\treturn max(abs(x - p.x), abs(y - p.y));\n\t}\n\tconstexpr int distance_square(const Point& p) const {\n\t\treturn (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);\n\t}\n\ttemplate <class Real> constexpr Real distance(const Point& p) const {\n\t\treturn sqrt(static_cast<Real>(distance_square(p)));\n\t}\n\tconstexpr Point absolute(const Point& p) const {\n\t\treturn absolute(*this - p);\n\t}\n\tconstexpr Point absolute() const {\n\t\treturn {abs(x), abs(y)};\n\t}\n\tPoint& swap() {\n\t\tstd::swap(x, y);\n\t\treturn *this;\n\t}\n\n\tclass enumrate_adjacent_helper {\n\t\tshared_ptr<Point> p;\n\t\tdirection_iterator first, last;\n\n\t\tclass iterator {\n\t\t\tshared_ptr<Point> p;\n\t\t\tdirection_iterator it;\n\n\t\tpublic:\n\t\t\titerator(shared_ptr<Point> _p, direction_iterator _it) : p(_p), it(_it) {}\n\t\t\tPoint operator*() const {\n\t\t\t\treturn *p + *it;\n\t\t\t}\n\t\t\titerator& operator++() {\n\t\t\t\t++it;\n\t\t\t\treturn *this;\n\t\t\t}\n\t\t\tbool operator!=(iterator other) const {\n\t\t\t\treturn it != other.it;\n\t\t\t}\n\t\t};\n\n\tpublic:\n\t\tenumrate_adjacent_helper(shared_ptr<Point> _p, direction_iterator _first,\n\t\t direction_iterator _last)\n\t\t : p(_p), first(_first), last(_last) {}\n\t\titerator begin() const {\n\t\t\treturn iterator(p, first);\n\t\t}\n\t\titerator end() const {\n\t\t\treturn iterator(p, last);\n\t\t}\n\t};\n\tauto enumrate_adjacent(direction_iterator first, direction_iterator last) const {\n\t\treturn enumrate_adjacent_helper(make_shared<Point>(*this), first, last);\n\t}\n\tauto adjacent4() const {\n\t\treturn enumrate_adjacent(direction.begin(), direction.begin() + 4);\n\t}\n\tauto adjacent8() const {\n\t\treturn enumrate_adjacent(direction.begin(), direction.begin() + 8);\n\t}\n\n\tclass enumrate_adj_in_range_helper {\n\t\tshared_ptr<Point> p;\n\t\tdirection_iterator first, last;\n\n\t\tclass sentinel {};\n\t\tclass iterator {\n\t\t\tshared_ptr<Point> p;\n\t\t\tdirection_iterator first, last;\n\n\t\t\tvoid increment_until_in_range() {\n\t\t\t\tfor (; first != last; ++first) {\n\t\t\t\t\tif ((*p + *first).in_range()) return;\n\t\t\t\t}\n\t\t\t}\n\n\t\tpublic:\n\t\t\titerator(shared_ptr<Point> _p, direction_iterator _first,\n\t\t\t direction_iterator _last)\n\t\t\t : p(_p), first(_first), last(_last) {\n\t\t\t\tincrement_until_in_range();\n\t\t\t}\n\t\t\tPoint operator*() const {\n\t\t\t\treturn *p + *first;\n\t\t\t}\n\t\t\titerator& operator++() {\n\t\t\t\t++first;\n\t\t\t\tincrement_until_in_range();\n\t\t\t\treturn *this;\n\t\t\t}\n\t\t\tbool operator!=(sentinel other) const {\n\t\t\t\treturn first != last;\n\t\t\t}\n\t\t};\n\n\tpublic:\n\t\tenumrate_adj_in_range_helper(shared_ptr<Point> _p, direction_iterator _first,\n\t\t direction_iterator _last)\n\t\t : p(_p), first(_first), last(_last) {}\n\t\titerator begin() const {\n\t\t\treturn iterator(p, first, last);\n\t\t}\n\t\tsentinel end() const {\n\t\t\treturn sentinel();\n\t\t}\n\t};\n\ttemplate <class InputIterator>\n\tauto enumrate_adj_in_range(InputIterator first, InputIterator last) const {\n\t\treturn enumrate_adj_in_range_helper(make_shared<Point>(*this), first, last);\n\t}\n\tauto adj4_in_range() const {\n\t\treturn enumrate_adj_in_range(direction.begin(), direction.begin() + 4);\n\t}\n\tauto adj8_in_range() const {\n\t\treturn enumrate_adj_in_range(direction.begin(), direction.end());\n\t}\n\n\tconstexpr Point left() const {\n\t\treturn {x - 1, y};\n\t}\n\tconstexpr Point right() const {\n\t\treturn {x + 1, y};\n\t}\n\tconstexpr Point up() const {\n\t\treturn {x, y - 1};\n\t}\n\tconstexpr Point down() const {\n\t\treturn {x, y + 1};\n\t}\n\tPoint succ() const {\n\t\tif (x != W - 1) {\n\t\t\treturn {x + 1, y};\n\t\t} else {\n\t\t\treturn {0, y + 1};\n\t\t}\n\t}\n\tPoint pred() const {\n\t\tif (x != 0) {\n\t\t\treturn {x - 1, y};\n\t\t} else {\n\t\t\treturn {W - 1, y - 1};\n\t\t}\n\t}\n\tconstexpr Point moved(char c) const {\n\t\treturn Point(*this).move(c);\n\t}\n\tconstexpr Point& move(char c) {\n\t\tswitch (c) {\n\t\t\tcase 'L':\n\t\t\tcase 'l':\n\t\t\tcase 'W':\n\t\t\tcase '>':\n\t\t\t\tx--;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\tcase 'r':\n\t\t\tcase 'E':\n\t\t\tcase '<':\n\t\t\t\tx++;\n\t\t\t\tbreak;\n\t\t\tcase 'U':\n\t\t\tcase 'u':\n\t\t\tcase 'N':\n\t\t\tcase '^':\n\t\t\t\ty--;\n\t\t\t\tbreak;\n\t\t\tcase 'D':\n\t\t\tcase 'd':\n\t\t\tcase 'S':\n\t\t\tcase 'v':\n\t\t\t\ty++;\n\t\t\t\tbreak;\n\t\t}\n\t\treturn *this;\n\t}\n\tconstexpr Point rotate90() const {\n\t\treturn {y, -x};\n\t}\n\tconstexpr Point rotate180() const {\n\t\treturn {-x, -y};\n\t}\n\tconstexpr Point rotate270() const {\n\t\treturn {-y, x};\n\t}\n\tchar to_direction_char(string_view lrud = \"LRUD\") const {\n\t\tassert(4 <= lrud.size() && lrud.size() <= 5);\n\t\tif (y == 0 && x < 0) {\n\t\t\treturn lrud[0];\n\t\t} else if (y == 0 && x > 0) {\n\t\t\treturn lrud[1];\n\t\t} else if (x == 0 && y < 0) {\n\t\t\treturn lrud[2];\n\t\t} else if (x == 0 && y > 0) {\n\t\t\treturn lrud[3];\n\t\t} else if (lrud.size() == 5) {\n\t\t\treturn lrud[4];\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\n\tstatic Point to_direction(char c, string_view lrud = \"LRUD\") {\n\t\tassert(lrud.size() == 4);\n\t\tif (c == lrud[0]) {\n\t\t\treturn L();\n\t\t} else if (c == lrud[1]) {\n\t\t\treturn R();\n\t\t} else if (c == lrud[2]) {\n\t\t\treturn U();\n\t\t} else if (c == lrud[3]) {\n\t\t\treturn D();\n\t\t} else {\n\t\t\treturn zero();\n\t\t}\n\t}\n\n\ttemplate <class T, class value_type = typename T::value_type::value_type>\n\tstatic optional<Point> find(const T& grid, const value_type& val) {\n\t\tassert(static_cast<int>(grid.size()) == H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tassert(static_cast<int>(grid[i].size()) == W);\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (grid[i][j] == val) {\n\t\t\t\t\treturn Point(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn nullopt;\n\t}\n\ttemplate <class T, class Predicate>\n\tstatic optional<Point> find_if(const T& grid, Predicate pred) {\n\t\tassert(static_cast<int>(grid.size()) == H);\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tassert(static_cast<int>(grid[i].size()) == W);\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (pred(grid[i][j])) {\n\t\t\t\t\treturn Point(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn nullopt;\n\t}\n\ttemplate <class T, class value_type = typename T::value_type::value_type>\n\tstatic optional<Point> find_one(const T& grid, const value_type& val) {\n\t\tassert(static_cast<int>(grid.size()) == H);\n\t\toptional<Point> result;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tassert(static_cast<int>(grid[i].size()) == W);\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (grid[i][j] == val) {\n\t\t\t\t\tassert(!result);\n\t\t\t\t\tresult = Point(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\ttemplate <class T, class value_type = typename T::value_type::value_type>\n\tstatic vector<Point> find_all(const T& grid, const value_type& val) {\n\t\tassert(static_cast<int>(grid.size()) == H);\n\t\tvector<Point> result;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tassert(static_cast<int>(grid[i].size()) == W);\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tif (grid[i][j] == val) {\n\t\t\t\t\tresult.emplace_back(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tstatic auto enumrate_2D_points() {\n\t\tclass enumrate_2D_points_helper {\n\t\tpublic:\n\t\t\tclass iterator {\n\t\t\t\tPoint p;\n\n\t\t\tpublic:\n\t\t\t\titerator(const Point& _p) : p(_p) {}\n\t\t\t\tPoint operator*() const {\n\t\t\t\t\treturn p;\n\t\t\t\t}\n\t\t\t\titerator& operator++() {\n\t\t\t\t\tp = p.succ();\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\titerator& operator--() {\n\t\t\t\t\tp = p.pred();\n\t\t\t\t\treturn *this;\n\t\t\t\t}\n\t\t\t\tbool operator!=(iterator other) const {\n\t\t\t\t\treturn p != other.p;\n\t\t\t\t}\n\t\t\t};\n\t\t\titerator begin() const {\n\t\t\t\treturn iterator(Point(0, 0));\n\t\t\t}\n\t\t\titerator end() const {\n\t\t\t\treturn iterator(Point(0, H));\n\t\t\t}\n\t\t};\n\t\treturn enumrate_2D_points_helper();\n\t}\n\n\tfriend ostream& operator<<(ostream& os, const Point& p) {\n\t\treturn os << '(' << p.x << \", \" << p.y << ')';\n\t}\n\tfriend istream& operator>>(istream& is, Point& p) {\n\t\treturn is >> p.y >> p.x;\n\t}\n};\nint Point::H, Point::W;\nconst vector<Point> Point::direction{Point::R(), Point::D(), Point::U(), Point::L(),\n Point::RD(), Point::LU(), Point::RU(), Point::LD()};\n#line 5 \"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\"\nusing namespace std;\n\nusing Weight = long long;\nconstexpr Weight INF = numeric_limits<Weight>::max();\nstruct Edge {\n\tint to;\n\tWeight cost;\n\tEdge() : to(-1), cost(-1) {}\n\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge& e) {\n\t\treturn os << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Graph = vector<vector<Edge>>;\nstruct Edge2 {\n\tint from, to;\n\tWeight cost;\n\tEdge2() : from(-1), to(-1), cost(0) {}\n\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\n\t\treturn os << e.from << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Edges = vector<Edge2>;\nusing Matrix = vector<vector<Weight>>;\n#line 5 \"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\"\nusing namespace std;\n\nvector<Weight> Dijkstra(const Graph& graph, int s) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist;\n}\n#line 4 \"a.cpp\"\n\nint main() {\n\tini(w, h);\n\tVS s = in[h];\n\tPoint::set_range(h, w);\n\n\tPoint start = *Point::find_one(s, 'S'), goal = *Point::find_one(s, 'G');\n\tvector<Point> passing = Point::find_all(s, 'M');\n\tpassing.insert(passing.begin(), start);\n\tpassing.push_back(goal);\n\tvector<Point> holes = Point::find_all(s, '#');\n\n\tGraph g(h * w);\n\tfor (const auto& p : Point::enumrate_2D_points()) {\n\t\tif (s[p.y][p.x] == '#') continue;\n\t\tll time = 1;\n\t\tfor (const auto& hole : holes) {\n\t\t\tchmax<ll>(time, 4 - p.chebyshev_distance(hole));\n\t\t}\n\t\tfor (const auto& q : p.adj4_in_range()) {\n\t\t\tif (s[q.y][q.x] != '#') {\n\t\t\t\tg[p.to_i()].emplace_back(q.to_i(), time);\n\t\t\t}\n\t\t}\n\t}\n\n\tint m = passing.size();\n\tauto dist = make_vector<ll>({m, m});\n\trep(i, m) {\n\t\tauto dist_i = Dijkstra(g, passing[i].to_i());\n\t\trep(j, m) {\n\t\t\tdist[i][j] = dist_i[passing[j].to_i()];\n\t\t}\n\t}\n\tdump(passing, dist);\n\n\tll ans = inf_ll;\n\tVI perm(m - 2);\n\tiota(all(perm), 1);\n\tdo {\n\t\tVI p{0};\n\t\tp.insert(p.end(), all(perm));\n\t\tp.push_back(m - 1);\n\t\tll d = 0;\n\t\trep(i, m - 1) {\n\t\t\td += dist[p[i]][p[i + 1]];\n\t\t}\n\t\tchmin(ans, d);\n\t} while (next_permutation(all(perm)));\n\tout(ans);\n}","accuracy":1,"time_ms":10,"memory_kb":4156,"score_of_the_acc":-0.0203,"final_rank":4},{"submission_id":"aoj_2419_2971008","code_snippet":"#include <iostream>\n#include <numeric>\n#include <queue>\n#include <cstring>\n#include <stdio.h>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <limits.h>\nusing namespace std;\ntypedef vector<int> vi;\ntypedef long long ll;\ntypedef long long ll;\ntypedef vector<ll> vll;\nconst int inf=10000000;\nint H,W,startx,starty,goalx,goaly;\nstring board[105];\nint cost[105][105];\nint d[105][105];\nbool visited[150][105];\nint dx8[]={-1,-1,0,1,1,1,0,-1};\nint dy8[]={0,1,1,1,0,-1,-1,-1};\nint dy[]={0,1,0,-1};\nint dx[]={-1,0,1,0};\n\ntypedef pair<int,int> P;\ntypedef pair<int,pair<int,int> > PP;\n\nvoid costset(int sx,int sy,int times)\n{\n if(times==2) return;\n int nowx=sx;\n int nowy=sy;\n int cos=3-times;\n for(int k=0;k<8;k++)\n {\n int nx=nowx+dx8[k];\n int ny=nowy+dy8[k];\n if(nx<0 || W<=nx || ny<0 || H<=ny) continue;\n cost[ny][nx]=max(cost[ny][nx],cos);\n costset(nx,ny,times+1);\n }\n}\n\nint solve(int sx,int sy,int gx,int gy)\n{\n for(int i=0;i<H;i++)\n {\n for(int j=0;j<W;j++)\n\t{\n\t d[i][j]=inf;\n\t}\n }\n d[sy][sx]=0;\n priority_queue<PP,vector<PP> ,greater<PP>> p;\n p.push(PP(0,P(sy,sx)));\n int nowy,nowx;\n while(!p.empty())\n {\n PP now=p.top();p.pop();\n nowy=now.second.first;\n nowx=now.second.second;\n if(nowx==gx && nowy==gy) break;\n for(int k=0;k<4;k++)\n\t{\n\t int ny=nowy+dy[k];\n\t int nx=nowx+dx[k];\n\t if(ny<0 || H<=ny || nx<0 || W<=nx || board[ny][nx]=='#') continue;\n\t if(d[nowy][nowx]+cost[nowy][nowx]>=d[ny][nx]) continue;\n\t if(d[ny][nx]==inf || d[ny][nx]>d[nowy][nowx]+cost[nowy][nowx])\n\t {\n\t d[ny][nx]=d[nowy][nowx]+cost[nowy][nowx];\n\t p.push(PP(d[ny][nx],P(ny,nx)));\n\t }\n\t}\n }\n return d[gy][gx];\n}\n\nint main(int argc,char const* argv[])\n{\n int ans=20000000;\n int scroll=0;\n int pat=1;\n int graph[10][10];\n for(int i=0;i<10;i++)\n {\n for(int j=0;j<10;j++)\n\t{\n\t graph[i][j]=inf;\n\t}\n }\n vector<P> route;\n cin >> W >> H;\n for(int i=0;i<H;i++)\n {\n cin >> board[i];\n }\n for(int i=0;i<H;i++)\n {\n for(int j=0;j<W;j++)\n\t{\n\t cost[i][j]=1;\n\t if(board[i][j]=='M') route.push_back(P(i,j));\n\t if(board[i][j]=='G') {goaly=i;goalx=j;}\n\t if(board[i][j]=='S') {starty=i;startx=j;}\n\t}\n }\n sort(route.begin(),route.end());\n for(int i=0;i<H;i++)\n {\n for(int j=0;j<W;j++)\n\t{\n\t if(board[i][j]=='#')\n\t {\n\t costset(j,i,0);\n\t }\n\t if(board[i][j]=='M')\n\t {\n\t scroll++;\n\t }\n\t}\n }\n for(int i=0;i<route.size();i++)\n {\n graph[0][i+1]=solve(startx,starty,route[i].second,route[i].first);\n graph[i+1][6]=solve(route[i].second,route[i].first,goalx,goaly);\t\t\t\t\t \n for(int j=0;j<route.size();j++)\n\t{\n\t if(i==j) continue;\n\t int stx=route[i].second;\n\t int sty=route[i].first;\n\t int gox=route[j].second;\n\t int goy=route[j].first;\n\t graph[i+1][j+1]=solve(stx,sty,gox,goy);\n\t //graph[j+1][i+1]=graph[i+1][j+1];\n\t}\n }\n vector<int> walk(scroll);\n iota(walk.begin(),walk.end(),1);\n do\n {\n int tmp=0;\n int prev=0;\n int to=0;\n for(auto x:walk) \n\t {\n\t to=x;\n\t tmp+=graph[prev][to];\n\t prev=x;\n\t }\n tmp+=graph[to][6];\n ans=min(ans,tmp);\n } while(next_permutation(walk.begin(),walk.end()));\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3280,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2419_2966989","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define INF 1000000000\n\nint di[4] = {0, -1, 0, 1};\nint dj[4] = {1, 0, -1, 0};\n\nvector<int> dijk(int s, int v, vector<vector<pair<int, int> > > adjlist){\n \n priority_queue <pair<int, int> > wait;\n vector<int> result(v, INF);\n\n //スタート地点を追加\n result[s] = 0;\n wait.push(make_pair(0, s));\n\n //ダイクストラ本体\n while(!wait.empty()){ //waitが空になるまで\n\n int nowpoint = wait.top().second;\n int nowcost = -wait.top().first;\n wait.pop();\n\n if(result[nowpoint] < nowcost) continue;\n\n\n //今いる頂点と隣接しているすべての頂点をなめる\n for(int i = 0; i < adjlist[nowpoint].size(); i++){\n\n int nextpoint = adjlist[nowpoint][i].second;\n int nextcost = nowcost + adjlist[nowpoint][i].first;\n //現時点より安く到達できそうであれば、結果を更新して優先度付きキューに格納\n if(result[nextpoint] > nextcost){\n result[nextpoint] = nextcost;\n wait.push(make_pair(-nextcost, nextpoint));\n }\n }\n }\n \n return result; //結果列を返す\n}\n\nint main(){\n\n int h, w; cin >> w >> h;\n int si, sj, gi, gj;\n vector<vector<int> > gold(h + 2, vector<int> (w + 2, 0));\n vector<vector<int> > canGo(h + 2, vector<int> (w + 2, 0));\n\n int cnt = 0;\n for(int i = 1; i <= h; i++){\n for(int j = 1; j <= w; j++){\n char in; cin >> in;\n if(in == '#'){\n canGo[i][j] = 4;\n }else{\n canGo[i][j] = 1;\n\n if(in == 'S'){\n si = i;\n sj = j;\n }\n\n if(in == 'G'){\n gi = i;\n gj = j;\n }\n\n if(in == 'M'){\n cnt++;\n gold[i][j] = cnt;\n }\n }\n }\n }\n\n int Map[110][110][(1 << 5)];\n\n int node = 0;\n for(int i = 1; i <= h; i++){\n for(int j = 1; j <= w; j++){\n for(int bit = 0; bit < (1 << 5); bit++){\n Map[i][j][bit] = node;\n node++;\n }\n }\n }\n\n //cout << cnt << \" \" << node << endl;\n\n for(int i = 1; i <= h; i++){\n for(int j = 1; j <= w; j++){\n\n //あなあなら\n if(canGo[i][j] == 4){\n \n\n for(int k = i - 2; k <= i + 2; k++){\n for(int l = j - 2; l <= j + 2; l++){\n if(k < 1 || h < k || l < 1 || w < l) continue;\n\n canGo[k][l] = max(canGo[k][l], 2);\n }\n }\n\n for(int k = i - 1; k <= i + 1; k++){\n for(int l = j - 1; l <= j + 1; l++){\n if(k < 1 || h < k || l < 1 || w < l) continue;\n\n canGo[k][l] = max(canGo[k][l], 3);\n }\n }\n }\n }\n }\n\n vector<vector<pair<int, int> > > adjlist(node);\n\n for(int i = 1; i <= h; i++){\n for(int j = 1; j <= w; j++){\n for(int bit = 0; bit < (1 << 5); bit++){\n\n //アナなら\n if(canGo[i][j] == 4) continue;\n\n int cost = canGo[i][j];\n int now_node = Map[i][j][bit];\n\n for(int h = 0; h < 4; h++){\n int ni = i + di[h];\n int nj = j + dj[h];\n\n if(canGo[ni][nj] == 4) continue;\n if(canGo[ni][nj] == 0) continue;\n\n int next_bit = bit;\n if(gold[ni][nj] != 0){\n int idx = gold[ni][nj] - 1;\n next_bit = next_bit & (~((1 << idx)));\n }\n\n int next_node = Map[ni][nj][next_bit];\n\n adjlist[now_node].push_back(make_pair(cost, next_node));\n }\n }\n }\n }\n\n vector<int> result(node);\n int S = Map[si][sj][(1 << cnt) - 1];\n int G = Map[gi][gj][0];\n result = dijk(S, node, adjlist);\n cout << result[G] << endl;\n\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":46408,"score_of_the_acc":-1.2,"final_rank":20},{"submission_id":"aoj_2419_2966891","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <queue>\n#include <deque>\n#include <tuple>\n#include <iostream>\nusing namespace std;\n\nconst int INF = 1 << 28;\nint H, W;\nint sx, sy, gx, gy;\nint board[110][110], dist[10][10], dp[1 << 10][10], rec[110][110];\n\nint nxt[] = {0, 1, 1, 2, 3};\nint dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};\nint dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};\n\nint ex[] = {0, 0, 1, -1};\nint ey[] = {1, -1, 0, 0};\n\nvoid get_board(deque< pair<int, int> > holes) {\n int N = holes.size();\n\n for(int i=0; i<N; i++) {\n int ix = holes[i].first, iy = holes[i].second;\n queue< pair<int, int> > que;\n que.push(make_pair(ix, iy));\n\n while(que.size()) {\n int cx, cy; tie(cx, cy) = que.front(); que.pop();\n for(int k=0; k<8; k++) {\n int nx = cx + dx[k], ny = cy + dy[k];\n if(nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\n if(board[nx][ny] == 4) continue;\n\n int cst = nxt[ board[cx][cy] ];\n if(cst > board[nx][ny]) {\n board[nx][ny] = cst;\n que.push(make_pair(nx, ny));\n }\n }\n }\n }\n}\n\nstruct Elem {\n int x, y, cost;\n bool operator<(const Elem &e) const {\n return cost > e.cost;\n }\n};\n\nvoid bfs(deque< pair<int, int> > treasures, int id) {\n fill(rec[0], rec[110], INF);\n\n int ix, iy; tie(ix, iy) = treasures[id];\n priority_queue<Elem> que;\n rec[ix][iy] = 0;\n que.push(Elem{ix, iy, 0});\n\n while(que.size()) {\n Elem cur = que.top(); que.pop();\n int x = cur.x, y = cur.y, cst = cur.cost;\n\n for(int k=0; k<4; k++) {\n int nx = x + ex[k], ny = y + ey[k];\n if(nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\n if(board[nx][ny] == INF) continue;\n\n int n_cost = cst + max(1, board[x][y]);\n if(rec[nx][ny] > n_cost) {\n rec[nx][ny] = n_cost;\n que.push(Elem{nx, ny, n_cost});\n }\n }\n }\n\n int N = treasures.size();\n for(int i=0; i<N; i++) {\n int tx, ty; tie(tx, ty) = treasures[i];\n // printf(\"tx = %d, ty = %d, cost = %d\\n\", tx, ty, rec[tx][ty]);\n dist[id][i] = rec[tx][ty];\n }\n}\n\nint main() {\n cin >> W >> H;\n\n deque< pair<int, int> > holes, treasures;\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n char c; cin >> c;\n if(c == 'S') {\n sx = i, sy = j;\n }\n else if(c == 'G') {\n gx = i, gy = j;\n }\n else if(c == '#') {\n holes.push_back(make_pair(i, j));\n board[i][j] = 4;\n }\n else if(c == 'M') {\n treasures.push_back(make_pair(i, j));\n }\n }\n }\n\n get_board(holes);\n for(int i=0; i<holes.size(); i++) {\n int x, y; tie(x, y) = holes[i];\n board[x][y] = INF;\n }\n\n\n /*\n // debug\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n cout << board[i][j];\n }\n cout << endl;\n }\n */\n \n \n int N = treasures.size();\n int si = 0, gi = N + 1;\n treasures.push_front(make_pair(sx, sy));\n treasures.push_back (make_pair(gx, gy));\n N += 2;\n \n for(int i=0; i<N; i++) {\n bfs(treasures, i);\n }\n\n /*\n // debug\n for(int i=0; i<N; i++) {\n for(int j=0; j<N; j++) {\n cout << dist[i][j] << \" \";\n }\n cout << endl;\n }\n */\n\n int fullbit = (1<<N) - 1;\n\n fill(dp[0], dp[1 << 10], INF);\n dp[1][0] = 0;\n for(int bit=0; bit<(1<<N); bit++) {\n for(int i=0; i<N; i++) {\n for(int k=0; k<N; k++) {\n if(!(bit >> i & 1)) continue;\n if(bit >> k & 1) continue;\n int nbit = bit | (1 << k);\n // if(k == N-1 && nbit != fullbit) continue;\n\n int cost = dist[i][k];\n dp[nbit][k] = min(dp[nbit][k], dp[bit][i] + cost);\n }\n }\n }\n\n int ans = dp[fullbit][N-1];\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3296,"score_of_the_acc":-0.0004,"final_rank":2},{"submission_id":"aoj_2419_2966831","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint W, H, cost[102][102], N, hx[5], hy[5], sx, sy, gx, gy;\nstring grid[102];\n\nconst int dx[4] = {0,1,0,-1}, Dx[8] = {0,1,1,1,0,-1,-1,-1};\nconst int dy[4] = {1,0,-1,0}, Dy[8] = {1,1,0,-1,-1,-1,0,1};\nbool in_range(int x, int y) { return 0 <= x && x < W && 0 <= y && y < H; }\n\nvoid pre() {\n\tmemset(cost, -1, sizeof(cost));\n\t\n\tN = 0;\n\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\n\t\tif (grid[y][x] == '#') cost[y][x] = 100;\n\t\tif (grid[y][x] == 'M') {\n\t\t\thx[N] = x;\n\t\t\thy[N] = y;\n\t\t\t++N;\n\t\t}\n\t\tif (grid[y][x] == 'S') sx = x, sy = y;\n\t\tif (grid[y][x] == 'G') gx = x, gy = y;\n\t}\n\t\n\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\n\t\tif (cost[y][x] < 0) {\n\t\t\tbool hole_flag = false;\n\t\t\tfor (int d=0; d<8; ++d) {\n\t\t\t\tint nx = x + Dx[d], ny = y + Dy[d];\n\t\t\t\tif (!in_range(nx, ny)) continue;\n\t\t\t\thole_flag |= (grid[ny][nx] == '#');\n\t\t\t}\n\t\t\tif (hole_flag) cost[y][x] = 3;\n\t\t}\n\t}\n\t\n\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\n\t\tif (cost[y][x] < 0) {\n\t\t\tint max_c = -1;\n\t\t\tfor (int d=0; d<8; ++d) {\n\t\t\t\tint nx = x + Dx[d], ny = y + Dy[d];\n\t\t\t\tif (!in_range(nx, ny)) continue;\n\t\t\t\tmax_c = max(max_c, cost[ny][nx]);\n\t\t\t}\n\t\t\tcost[y][x] = max_c - 1;\n\t\t}\n\t}\n\t\n\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) if (cost[y][x] <= 0) cost[y][x] = 1;\n}\n\n\t\nstruct State {\n\tint x, y, c;\n\tbool operator > (const State& s) const { return c > s.c; }\n};\n\nint dst[102][102];\n\nint dijkstra(int ax, int ay, int bx, int by) {\n\tmemset(dst, -1, sizeof(dst));\n\t\n\tpriority_queue< State, vector< State >, greater< State > > que;\n\tque.push(State{ax, ay, 0});\n\tdst[ay][ax] = 0;\n\t\n\twhile (!que.empty()) {\n\t\tState s = que.top(); que.pop();\n\t\tif (dst[s.y][s.x] < s.c) continue;\n\t\tfor (int d=0; d<4; ++d) {\n\t\t\tint nx = s.x + dx[d], ny = s.y + dy[d], nc = s.c + cost[s.y][s.x];\n\t\t\tif (!in_range(nx, ny)) continue;\n\t\t\tif (grid[ny][nx] == '#') continue;\n\t\t\tif (dst[ny][nx] == -1 || dst[ny][nx] > nc) {\n\t\t\t\tdst[ny][nx] = nc;\n\t\t\t\tque.push(State{nx, ny, nc});\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn dst[by][bx];\n}\n\nint main() {\n\tcin >> W >> H;\n\tfor (int y=0; y<H; ++y) cin >> grid[y];\n\t\n\tpre();\n\t\n\tvector< int > order;\n\tfor (int i=0; i<N; ++i) order.push_back(i);\n\t\n\tint ans = 1L << 30;\n\tdo {\n\t\tint sum = dijkstra(sx, sy, hx[order[0]], hy[order[0]]);\n\t\tfor (int i=0; i<N-1; ++i) {\n\t\t\tint a = order[i], b = order[i+1];\n\t\t\tsum += dijkstra(hx[a], hy[a], hx[b], hy[b]);\n\t\t}\n\t\tsum += dijkstra(hx[order[N-1]], hy[order[N-1]], gx, gy);\n\t\tans = min(ans, sum);\n\t} while (next_permutation(order.begin(), order.end()));\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":410,"memory_kb":3316,"score_of_the_acc":-1.0008,"final_rank":19},{"submission_id":"aoj_2419_2741163","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n \nusing namespace std;\n \n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n \ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n \ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx3[4] = {1, 0, -1, 0};\nint dy3[4] = {0, 1, 0, -1};\nint dx[8] = {1, 0, -1, -1, -1, 0, 1, 1};\nint dy[8] = {-1, -1, -1, 0, 1, 1, 1, 0};\nint dx2[16] = {0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1};\nint dy2[16] = {2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 0, 1, 2, 2};\nstruct state{\n int x, y, S;\n int c;\n state() {}\n state(int x, int y, int S, int c) : x(x), y(y), S(S), c(c) {}\n bool operator < (const state& s) const {\n return c > s.c; //rev\n }\n};\n \nint main(){\n int W, H;\n while(cin>>W>>H && (W||H)){\n vector<string> grid(H);\n REP(y, H) cin>>grid[y];\n int cnt = 0;\n REP(y, H)REP(x, W)if(grid[y][x] == 'M'){\n grid[y][x] = cnt + '0';\n cnt++;\n }\n const int goalS = (1<<cnt) - 1;\n int move[100][100] = {};\n REP(y, H)REP(x, W) move[y][x] = 1;\n REP(y, H)REP(x, W){\n if(grid[y][x] == '#'){\n REP(r, 8){\n int nx = x + dx[r], ny = y + dy[r];\n if(nx >= 0 && ny >= 0 && nx < W && ny < H){\n move[ny][nx] = 3;\n }\n }\n REP(r, 16){\n int nx = x + dx2[r], ny = y + dy2[r];\n if(nx >= 0 && ny >= 0 && nx < W && ny < H){\n move[ny][nx] = max(move[ny][nx], 2);\n }\n }\n }\n }\n int dist[1<<5][100][100];\n priority_queue<state> que;\n REP(y, H)REP(x, W)REP(i, 1<<5)dist[i][y][x] = INF;\n REP(y, H)REP(x, W)if(grid[y][x] == 'S'){\n dist[0][y][x] = 0;\n que.push(state(x, y, 0, 0));\n }\n int ans = INF;\n while(!que.empty()){\n state s = que.top(); que.pop();\n if(s.S == goalS && grid[s.y][s.x] == 'G'){\n ans = s.c;\n break;\n }\n REP(r, 4){\n int nx = s.x + dx3[r];\n int ny = s.y + dy3[r];\n if(!(nx >= 0 && ny >= 0 && nx < W && ny < H)) continue;\n if(grid[ny][nx] == '#') continue;\n int nc = s.c + move[s.y][s.x];\n int nS = s.S;\n if(grid[ny][nx] <= '5' && grid[ny][nx] >= '0'){\n nS = nS | (1<<(grid[ny][nx]-'0'));\n }\n if(dist[nS][ny][nx] > nc){\n dist[nS][ny][nx] = nc;\n que.push(state(nx, ny, nS, nc));\n }\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4504,"score_of_the_acc":-0.0534,"final_rank":5},{"submission_id":"aoj_2419_2661163","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nstruct aa {\n\tint x;\n\tint y;\n\tbitset<5>gets;\n\tint cost;\n};\nclass Compare {\npublic:\n\tbool operator()(const aa&l, const aa&r) {\n\t\treturn l.cost>r.cost;\n\t}\n};\n\nint main() {\n\tint H,W;cin>>W>>H;\n\tvector<vector<int>>field(H,vector<int>(W,1));\n\tvector<pair<int,int>>makis;\n\tint sx, sy, gx, gy;\n\t{\n\t\tvector<pair<int, int>>holes;\n\t\tfor (int i = 0; i < H; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tfor (int j = 0; j < W; ++j) {\n\t\t\t\tchar ch(st[j]);\n\t\t\t\tif (ch == 'S') {\n\t\t\t\t\tsx = j;\n\t\t\t\t\tsy = i;\n\t\t\t\t}\n\t\t\t\telse if (ch == 'G') {\n\t\t\t\t\tgx = j;\n\t\t\t\t\tgy = i;\n\t\t\t\t}\n\t\t\t\telse if (ch == '#') {\n\t\t\t\t\tholes.push_back(make_pair(j, i));\n\t\t\t\t}\n\t\t\t\telse if (ch == 'M') {\n\t\t\t\t\tmakis.push_back(make_pair(j,i));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (auto hole : holes) {\n\t\t\tfor (int y = 0; y < H; ++y) {\n\t\t\t\tfor (int x = 0; x < W; ++x) {\n\t\t\t\t\tint x_dis = abs(x - hole.first);\n\t\t\t\t\tint y_dis = abs(y - hole.second);\n\t\t\t\t\tint dis = max(x_dis, y_dis);\n\t\t\t\t\tif (dis == 0) {\n\t\t\t\t\t\tfield[y][x] = max(field[y][x],10000);\n\t\t\t\t\t}\n\t\t\t\t\telse if (dis <= 3) {\n\t\t\t\t\t\tfield[y][x] =max(field[y][x],4-dis);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpriority_queue<aa,vector<aa>,Compare>que;\n\n\tque.push(aa{ sx,sy,bitset<5>(),0 });\n\tvector<vector<vector<int>>>memo(W,vector<vector<int>>(H,vector<int>(32,1e9)));\n\tmemo[sx][sy][0]=0;\n\tint dx[4] = { -1,0,1,0 };\n\tint dy[4] = { 0,1,0,-1 };\n\tint ans=-1;\n\twhile (!que.empty()) {\n\t\tauto atop(que.top());\n\t\tconst int now_x=atop.x;\n\t\tconst int now_y=atop.y;\n\t\tconst bitset<5>gets(atop.gets);\n\t\tconst int now_cost=atop.cost;\n\n\t\tif (now_x == gx&&now_y == gy&&gets.count() == makis.size()) {\n\t\t\tans=now_cost;\n\t\t\tbreak;\n\t\t}\n\t\tque.pop();\n\t\tfor (int way = 0; way < 4; ++way) {\n\t\t\tconst int next_x=now_x+dx[way];\n\t\t\tconst int next_y=now_y+dy[way];\n\n\t\t\tif (0 <= next_x&&next_x < W&&next_y < H && 0 <= next_y) {\n\t\t\t\tconst int next_cost=now_cost+field[now_y][now_x];\n\t\t\t\tauto next_gets(gets);\n\t\t\t\tfor (int i = 0; i < makis.size(); ++i) {\n\t\t\t\t\tif (next_x == makis[i].first&&next_y == makis[i].second) {\n\t\t\t\t\t\tnext_gets[i]=true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (memo[next_x][next_y][next_gets.to_ulong()] > next_cost) {\n\t\t\t\t\tmemo[next_x][next_y][next_gets.to_ulong()]=next_cost;\n\t\t\t\t\tque.push(aa{ next_x,next_y,next_gets,next_cost });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\t\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":5576,"score_of_the_acc":-0.1532,"final_rank":13},{"submission_id":"aoj_2419_2542647","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>\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\nstruct Hole{\n\tint row,col;\n};\n\nstruct Info{\n\tInfo(int arg_row,int arg_col,int arg_state,int arg_total_cost){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tstate = arg_state;\n\t\ttotal_cost = arg_total_cost;\n\t}\n\n\tint row,col,state,total_cost;\n};\n\nint H,W;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\n\nbool rangeCheck(int row,int col){\n\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\n\telse{\n\t\treturn false;\n\t}\n}\n\nint main(){\n\n\tint POW[6];\n\n\tfor(int i = 0; i < 6; i++)POW[i] = pow(2,i);\n\n\tscanf(\"%d %d\",&W,&H);\n\n\tchar map[H][W+1];\n\n\tint hole_num = 0;\n\tHole hole[10000];\n\n\tint makimono_num = 0;\n\n\tint start_row,start_col,goal_row,goal_col;\n\n\tfor(int i = 0; i < H; i++){\n\t\tscanf(\"%s\",map[i]);\n\t\tfor(int k = 0; k < W; k++){\n\t\t\tswitch(map[i][k]){\n\t\t\tcase 'S':\n\t\t\t\tstart_row = i;\n\t\t\t\tstart_col = k;\n\t\t\t\tmap[i][k] = '.';\n\t\t\t\tbreak;\n\t\t\tcase 'G':\n\t\t\t\tgoal_row = i;\n\t\t\t\tgoal_col = k;\n\t\t\t\tmap[i][k] = '.';\n\t\t\t\tbreak;\n\t\t\tcase 'M':\n\t\t\t\tmap[i][k] = '0' + makimono_num;\n\t\t\t\tmakimono_num++;\n\t\t\t\tbreak;\n\t\t\tcase '#':\n\t\t\t\thole[hole_num].row = i;\n\t\t\t\thole[hole_num].col = k;\n\t\t\t\thole_num++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tint move_cost[H][W];\n\n\tfor(int i = 0; i < H; i++){\n\t\tfor(int k = 0; k < W; k++)move_cost[i][k] = 1;\n\t}\n\n\tfor(int i = 0; i < hole_num; i++){\n\t\tfor(int row = 0; row < H; row++){\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tif(map[row][col] == '#')continue;\n\t\t\t\tmove_cost[row][col] = max(move_cost[row][col],4-max(abs(hole[i].row-row),abs(hole[i].col-col)));\n\t\t\t}\n\t\t}\n\t}\n\n\tint limit = POW[makimono_num];\n\n\tint dp[H][W][limit];\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int state = 0; state < limit; state++)dp[row][col][state] = BIG_NUM;\n\t\t}\n\t}\n\n\tqueue<Info> Q;\n\n\tQ.push(Info(start_row,start_col,0,0));\n\n\tint next_row,next_col,next_state;\n\n\twhile(!Q.empty()){\n\n\t\tif(Q.front().state == limit-1 && Q.front().row == goal_row && Q.front().col == goal_col){\n\t\t\tQ.pop();\n\t\t}else if(Q.front().total_cost > dp[Q.front().row][Q.front().col][Q.front().state]){\n\t\t\tQ.pop();\n\t\t}else{\n\t\t\tfor(int i = 0; i < 4; i++){\n\t\t\t\tnext_row = Q.front().row + diff_row[i];\n\t\t\t\tnext_col = Q.front().col + diff_col[i];\n\n\t\t\t\tif(rangeCheck(next_row,next_col) == false || map[next_row][next_col] == '#')continue;\n\n\t\t\t\tnext_state = Q.front().state;\n\t\t\t\tif(map[next_row][next_col] >= '0' && map[next_row][next_col] <= '4'){\n\t\t\t\t\tif(!(Q.front().state & (1 << (map[next_row][next_col]-'0')))){\n\t\t\t\t\t\tnext_state += POW[map[next_row][next_col]-'0'];\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(dp[next_row][next_col][next_state] > Q.front().total_cost+move_cost[Q.front().row][Q.front().col]){\n\t\t\t\t\tdp[next_row][next_col][next_state] = Q.front().total_cost+move_cost[Q.front().row][Q.front().col];\n\t\t\t\t\tQ.push(Info(next_row,next_col,next_state,dp[next_row][next_col][next_state]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tQ.pop();\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp[goal_row][goal_col][limit-1]);\n\n\treturn 0;\n\n}","accuracy":1,"time_ms":50,"memory_kb":4776,"score_of_the_acc":-0.1347,"final_rank":11},{"submission_id":"aoj_2419_2359811","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define INF 1<<25\nusing namespace std;\nstring s[101];\ntypedef pair<int,int> P;\nint w,h,a[101][101],sx,sy,gx,gy;\nint dx[]={1,-1,0,0};\nint dy[]={0,0,1,-1};\nint dx1[]={1,1,1,0,0,-1,-1,-1};\nint dy1[]={1,0,-1,1,-1,1,0,-1};\nint dx2[]={2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};\nint dy2[]={2,1,0,-1,-2,2,-2,2,-2,2,-2,2,1,0,-1,-2};\nvector<P>G[10001];\nvector<int>maki;\nvoid make_map(int y,int x){\n a[y][x]=INF;\n r(i,8){\n int xx=x+dx1[i];\n int yy=y+dy1[i];\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\n if(a[yy][xx]<3)a[yy][xx]=3;\n }\n r(i,16){\n int xx=x+dx2[i];\n int yy=y+dy2[i];\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\n if(a[yy][xx]<2)a[yy][xx]=2;\n }\n}\nint d[10001];\nvoid dijkstra(int s){\n priority_queue<P,vector<P>,greater<P> >que;\n fill(d,d+10001,INF);\n d[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(d[v]<p.first)continue;\n for(int i=0;i<G[v].size();i++){\n P e=G[v][i];\n if(d[e.first]>d[v]+e.second){\n d[e.first]=d[v]+e.second;\n que.push(P(d[e.first],e.first));\n }\n }\n }\n}\nint ans=INF,used[101]={},koko;\nint dis[101][101];\nvoid dfs(int depth,int dista,int cur){\n if(depth==koko-1){\n //cout<<dista<<endl;\n ans=min(ans,dista);\n return;\n }\n if(depth<koko-2){\n for(int i=1;i<koko-1;i++)\n if(!used[i]){\n used[i]=1;\n dfs(depth+1,dista+dis[cur][i],i);\n used[i]=0;\n }\n }\n else{\n used[cur]=1;\n dfs(depth+1,dista+dis[cur][koko-1],cur);\n used[cur]=0;\n }\n}\nmain(){\n r(i,101)r(j,101)a[i][j]=1;\n cin>>w>>h;\n r(i,h)cin>>s[i];\n r(i,h)r(j,w){\n if(s[i][j]=='#')make_map(i,j);\n if(s[i][j]=='S')sx=i*w+j;\n if(s[i][j]=='G')gx=i*w+j;\n if(s[i][j]=='M')maki.push_back(i*w+j);\n }\n r(i,h)r(j,w)r(k,4){\n int xx=j+dx[k];\n int yy=i+dy[k];\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\n if(k==0)G[i*w+j].push_back(P(i*w+j+1,a[i][j]));\n if(k==1)G[i*w+j].push_back(P(i*w+j-1,a[i][j]));\n if(k==2)G[i*w+j].push_back(P(i*w+w+j,a[i][j]));\n if(k==3)G[i*w+j].push_back(P(i*w-w+j,a[i][j]));\n }\n int num=maki.size()+2;\n vector<int>ps;\n ps.push_back(sx);\n r(i,maki.size())ps.push_back(maki[i]);\n ps.push_back(gx);\n r(i,num){\n dijkstra(ps[i]);\n r(j,num)dis[i][j]=d[ps[j]];\n }\n koko=num;\n used[0]=1;\n dfs(0,0,0);\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3944,"score_of_the_acc":-0.0154,"final_rank":3},{"submission_id":"aoj_2419_2198483","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) begin(v), end(v)\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\n#define min(...) min({__VA_ARGS__})\n#define max(...) max({__VA_ARGS__})\n\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\n\nusing pint = pair<int, int>;\nusing tint = tuple<int, int, int>;\nusing vint = vector<int>;\n\nconst int inf = 1LL << 55;\nconst int mod = 1e9 + 7;\n\nsigned main()\n{\n cin.tie(0);\n ios_base::sync_with_stdio(0);\n cout << fixed << setprecision(12);\n\n int H, W;\n char mas[101][101];\n int sy, sx, gy, gx;\n int delay[101][101] = {{}};\n int maki = 0;\n map<pint, int> mp;\n\n auto in = [&](int y, int x) -> bool {\n return 0 <= y && y < H && 0 <= x && x < W;\n };\n\n cin >> W >> H;\n rep(i, H) rep(j, W) {\n cin >> mas[i][j];\n chmax(delay[i][j], 1);\n if(mas[i][j] == 'S') sy = i, sx = j;\n else if(mas[i][j] == 'G') gy = i, gx = j;\n else if(mas[i][j] == 'M') mp[make_pair(i, j)] = maki++;\n else if(mas[i][j] == '#') {\n delay[i][j] = inf;\n reps(k, 1, 4) {\n\treps(l, -4+k, 4-k+1) {\n\t if(in(i-4+k, j+l)) chmax(delay[i-4+k][j+l], k);\n\t if(in(i+4-k, j+l)) chmax(delay[i+4-k][j+l], k);\n\t if(in(i+l, j-4+k)) chmax(delay[i+l][j-4+k], k);\n\t if(in(i+l, j+4-k)) chmax(delay[i+l][j+4-k], k);\n\t}\n }\n }\n }\n\n struct state {\n int y, x, bit, dist;\n state(int y = 0, int x = 0, int bit = 0, int dist = 0)\n :y(y), x(x), bit(bit), dist(dist){}\n bool operator < (const state& s) const {\n return dist > s.dist;\n }\n };\n\n priority_queue<state> que;\n int d[101][101][1<<5];\n int dy[] = {1, 0, -1, 0};\n int dx[] = {0, 1, 0, -1};\n\n que.emplace(sy, sx, 0, 0);\n rep(i, 101) rep(j, 101) rep(k, 1<<5) d[i][j][k] = inf;\n d[sy][sx][0] = 0;\n while(que.size()) {\n state st = que.top(); que.pop();\n int y = st.y, x = st.x, bit = st.bit, dist = st.dist;\n if(y == gy && x == gx && bit == (1<<maki)-1) {\n cout << dist << endl;\n return 0;\n }\n if(d[y][x][bit] < dist) continue;\n rep(i, 4) {\n int ny = y + dy[i], nx = x + dx[i], nbit = bit;\n if(!in(ny, nx) || mas[ny][nx] == '#') continue;\n if(mas[ny][nx] == 'M') nbit |= 1<<(mp[make_pair(ny, nx)]);\n if(dist + delay[y][x] < d[ny][nx][nbit]) {\n\td[ny][nx][nbit] = dist + delay[y][x];\n\tque.emplace(ny, nx, nbit, d[ny][nx][nbit]);\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5868,"score_of_the_acc":-0.11,"final_rank":10},{"submission_id":"aoj_2419_2197863","code_snippet":"#include<bits/stdc++.h>\n#define f first \n#define s second \nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nint w,h,c=1,sx,sy,gx,gy;\nchar mp[101][101];\nint bt[101][101];\nint cs[101][101];\nint nn[5][5]=\n {{2,2,2,2,2},\n {2,3,3,3,2},\n {2,3,1e8,3,2},\n {2,3,3,3,2},\n {2,2,2,2,2}\n };\nint used[100][101][101];\n \nvoid nu(int x,int y){\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++){\n int nx=x+j-2,ny=y+i-2;\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\n cs[ny][nx]=max(nn[i][j],cs[ny][nx]);\n }\n}\n \nint cal(){\n priority_queue<PP,vector<PP>,greater<PP> > Q;\n Q.push(PP(P(0,0),P(sx,sy)));\n int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\n while(!Q.empty()){\n PP p=Q.top();\n Q.pop();\n if(p.s.f==gx&&p.s.s==gy&&p.f.s==c-1)return p.f.f;\n if(used[p.f.s][p.s.s][p.s.f]==1)continue;\n used[p.f.s][p.s.s][p.s.f]=1;\n for(int i=0;i<4;i++){\n int nx=p.s.f+dx[i],ny=p.s.s+dy[i];\n int ncs=p.f.f+cs[p.s.s][p.s.f],nbt=p.f.s|bt[p.s.s][p.s.f];\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\n Q.push(PP(P(ncs,nbt),P(nx,ny)));\n }\n }\n}\n \n \nint main(){\n cin>>w>>h;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n cin>>mp[i][j];\n cs[i][j]=max(1,cs[i][j]);\n if(mp[i][j]=='M')bt[i][j]=c,c*=2;\n if(mp[i][j]=='#')nu(j,i);\n if(mp[i][j]=='S')sx=j,sy=i;\n if(mp[i][j]=='G')gx=j,gy=i;\n }\n cout<<cal()<<endl; \n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":8312,"score_of_the_acc":-0.4917,"final_rank":15},{"submission_id":"aoj_2419_2196963","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nint dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\nbool check(int n,int m,int x,int y) {return x>=0&&x<n&&y>=0&&y<m;}\n \nint a[111][111],d[55][111][111];\nmap<P,int> ma;\nint main() {\n int n,m;\n cin >> m >> n;\n string s[n];\n for(int i=0; i<n; i++) cin >> s[i];\n priority_queue<PP,vector<PP>,greater<PP> > que;\n for(int i=0; i<n; i++) {\n for(int j=0; j<m; j++) {\n a[i][j]=1;\n for(int k=0; k<(1<<5); k++) d[k][i][j]=1<<29;\n if(s[i][j]=='S') {\n d[0][i][j]=0;\n que.push(PP(P(0,0),P(i,j)));\n }\n if(s[i][j]=='M') {\n int k=ma.size();\n ma[P(i,j)]=k;\n }\n for(int k=-2; k<=2; k++) {\n for(int l=-2; l<=2; l++) {\n int x=i+k,y=j+l;\n if(!check(n,m,x,y)||s[x][y]!='#') continue;\n int d=max(abs(i-x),abs(j-y));\n if(d==1) a[i][j]=max(a[i][j],3);\n if(d==2) a[i][j]=max(a[i][j],2);\n }\n }\n }\n }\n while(!que.empty()) {\n PP p=que.top();que.pop();\n int xx=p.second.first,yy=p.second.second,cc=p.first.first,tt=p.first.second;\n if(s[xx][yy]=='G'&&tt==(1<<ma.size())-1) {\n cout << d[tt][xx][yy] << endl;\n return 0;\n }\n if(d[tt][xx][yy]<cc) continue;\n for(int i=0; i<4; i++) {\n int x=xx+dx[i],y=yy+dy[i];\n int t=tt;\n if(!check(n,m,x,y)||s[x][y]=='#') continue;\n if(s[x][y]=='M') t|=1<<ma[P(x,y)];\n if(d[t][x][y]<=d[tt][xx][yy]+a[xx][yy]) continue;\n d[t][x][y]=d[tt][xx][yy]+a[xx][yy];\n que.push(PP(P(d[t][x][y],t),P(x,y)));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4840,"score_of_the_acc":-0.1362,"final_rank":12},{"submission_id":"aoj_2419_2196818","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint sp[111][111];\nint dp[111][111][1<<5];\nint w,h;\nint in(int y,int x){\n return 0<=y&&y<h&&0<=x&&x<w;\n}\nstruct sta{\n int y,x,b,d;\n sta(){}\n sta(int y,int x,int b,int d):y(y),x(x),b(b),d(d){}\n bool operator<(const sta& a) const{\n return d>a.d;\n }\n};\ntypedef pair<int,int> P;\nint main(){\n memset(sp,0,sizeof(sp));\n memset(dp,-1,sizeof(dp));\n cin>>w>>h;\n string st[h];\n for(int i=0;i<h;i++) cin>>st[i];\n int sy,sx,gy,gx,n=0;\n map<P,int> m;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n sp[i][j]=max(sp[i][j],1);\n if(st[i][j]=='M') m[P(i,j)]=n++;\n if(st[i][j]=='S') sy=i,sx=j;\n if(st[i][j]=='G') gy=i,gx=j;\n if(st[i][j]=='#'){\n for(int k=1;k<=3;k++){\n for(int a=-(4-k);a<=4-k;a++){\n if(in(i-(4-k),j+a)) sp[i-(4-k)][j+a]=max(sp[i-(4-k)][j+a],k);\n if(in(i+(4-k),j+a)) sp[i+(4-k)][j+a]=max(sp[i+(4-k)][j+a],k);\n if(in(i+a,j-(4-k))) sp[i+a][j-(4-k)]=max(sp[i+a][j-(4-k)],k);\n if(in(i+a,j+(4-k))) sp[i+a][j+(4-k)]=max(sp[i+a][j+(4-k)],k);\n }\n }\n }\n }\n }\n /*//\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cout<<sp[i][j];\n }\n cout<<endl;\n }\n //*/\n priority_queue<sta> q;\n q.push(sta(sy,sx,0,0));\n dp[sy][sx][0]=0;\n int ax[]={1,-1,0,0};\n int ay[]={0,0,1,-1};\n while(!q.empty()){\n sta s=q.top();q.pop();\n if(dp[s.y][s.x][s.b]<s.d) continue;\n //cout<<s.y<<\" \"<<s.x<<\" \"<<s.b<<\" \"<<s.d<<endl;\n for(int k=0;k<4;k++){\n int ny=s.y+ay[k],nx=s.x+ax[k],nb=s.b,nd=s.d+sp[s.y][s.x];\n if(!in(ny,nx)) continue;\n if(st[ny][nx]=='#') continue;\n if(m.count(P(ny,nx))) nb|=1<<m[P(ny,nx)];\n if(dp[ny][nx][nb]<0||dp[ny][nx][nb]>nd){\n dp[ny][nx][nb]=nd;\n q.push(sta(ny,nx,nb,nd));\n }\n }\n }\n cout<<dp[gy][gx][(1<<n)-1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4884,"score_of_the_acc":-0.0872,"final_rank":6},{"submission_id":"aoj_2419_2196610","code_snippet":"#include <bits/stdc++.h>\n#define N 101\n#define INF 1e9\nusing namespace std;\nstring mp[N];\nint D[101][101][1<<5];\nint used[101][101];\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nint dx[] ={0,0,1,-1};\nint dy[] ={1,-1,0,0};\nint w,h;\n\nvoid bfs(){\n memset(used,-1,sizeof(used));\n queue<P> Q;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)if(mp[i][j]=='#')Q.push(P(i,j)),used[i][j] = 0;\n \n while(!Q.empty()){\n P t = Q.front();Q.pop();\n int y = t.first;\n int x = t.second;\n for(int i=-1;i<=1;i++)\n for(int j=-1;j<=1;j++){\n\tif(i==0&&j==0)continue;\n\tint nx = x+i;\n\tint ny = y+j;\n\tif(nx<0||ny<0||nx>=w||ny>=h||used[ny][nx]!=-1)continue;\n\tused[ny][nx] = used[y][x] + 1;\n\tQ.push(P(ny,nx));\n }\n }\n\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)if(used[i][j] == -1) used[i][j]=INF;\n \n} \n\n\nint visited[N][N][1<<5];\nint dijkstra(int sy,int sx){\n map<P,int> M;\n int cnt=0;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)if(mp[i][j] == 'M') M[P(i,j)] = cnt++;\n \n for(int i=0;i<101;i++)\n for(int j=0;j<101;j++)\n for(int k=0;k<(1<<5);k++) D[i][j][k] = INF;\n \n priority_queue<PP,vector<PP>,greater<PP> >Q; \n Q.push(PP(P(0,sy),P(sx,0)));\n D[sy][sx][0] = 0;\n \n while(!Q.empty()){\n PP t = Q.top();Q.pop();\n int cost = t.first.first;\n int y = t.first.second;\n int x = t.second.first;\n int bit = t.second.second;\n if(mp[y][x] =='G' && bit==(1<<cnt)-1)return cost;\n if(D[y][x][bit]<cost||visited[y][x][bit]++) continue;\n \n for(int i=0;i<4;i++){\n int nx = x+dx[i];\n int ny = y+dy[i];\n int nbit = bit;\n int ncost = cost+max(1,4-used[y][x]);\n if(nx<0||ny<0||nx>=w||ny>=h||mp[ny][nx] == '#')continue;\n if(D[ny][nx][nbit]<=ncost||visited[ny][nx][nbit])continue;\n if(mp[ny][nx] == 'M') nbit |= 1<<(M[P(ny,nx)]); \n Q.push(PP(P(ncost,ny),P(nx,nbit)));\n D[ny][nx][nbit] = ncost;\n }\n }\n assert(0);\n}\n\n\nint main(){\n\n cin>>w>>h;\n for(int i=0;i<h;i++) cin>>mp[i];\n\n bfs();\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n if(mp[i][j] == 'S') cout<<dijkstra(i,j)<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":5764,"score_of_the_acc":-0.1076,"final_rank":8},{"submission_id":"aoj_2419_2196586","code_snippet":"#include<bits/stdc++.h>\n#define f first \n#define s second \nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nint w,h,c=1,sx,sy,gx,gy;\nchar mp[101][101];\nint bt[101][101];\nint cs[101][101];\nint nn[5][5]=\n {{2,2,2,2,2},\n {2,3,3,3,2},\n {2,3,1e8,3,2},\n {2,3,3,3,2},\n {2,2,2,2,2}\n };\nint used[100][101][101];\n\nvoid nu(int x,int y){\n for(int i=0;i<5;i++)\n for(int j=0;j<5;j++){\n int nx=x+j-2,ny=y+i-2;\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\n cs[ny][nx]=max(nn[i][j],cs[ny][nx]);\n }\n}\n\nint cal(){\n priority_queue<PP,vector<PP>,greater<PP> > Q;\n Q.push(PP(P(0,0),P(sx,sy)));\n int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\n while(!Q.empty()){\n PP p=Q.top();\n Q.pop();\n if(p.s.f==gx&&p.s.s==gy&&p.f.s==c-1)return p.f.f;\n if(used[p.f.s][p.s.s][p.s.f]==1)continue;\n used[p.f.s][p.s.s][p.s.f]=1;\n for(int i=0;i<4;i++){\n int nx=p.s.f+dx[i],ny=p.s.s+dy[i];\n int ncs=p.f.f+cs[p.s.s][p.s.f],nbt=p.f.s|bt[p.s.s][p.s.f];\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\n Q.push(PP(P(ncs,nbt),P(nx,ny)));\n }\n }\n}\n\n\nint main(){\n cin>>w>>h;\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++){\n cin>>mp[i][j];\n cs[i][j]=max(1,cs[i][j]);\n if(mp[i][j]=='M')bt[i][j]=c,c*=2;\n if(mp[i][j]=='#')nu(j,i);\n if(mp[i][j]=='S')sx=j,sy=i;\n if(mp[i][j]=='G')gx=j,gy=i;\n }\n cout<<cal()<<endl; \n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":8312,"score_of_the_acc":-0.4667,"final_rank":14},{"submission_id":"aoj_2419_2196568","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint sp[111][111];\nint dp[111][111][1<<5];\nint w,h;\nint in(int y,int x){\n return 0<=y&&y<h&&0<=x&&x<w;\n}\nstruct sta{\n int y,x,b,d;\n sta(){}\n sta(int y,int x,int b,int d):y(y),x(x),b(b),d(d){}\n bool operator<(const sta& a) const{\n return d>a.d;\n }\n};\ntypedef pair<int,int> P;\nint main(){\n memset(sp,0,sizeof(sp));\n memset(dp,-1,sizeof(dp));\n cin>>w>>h;\n string st[h];\n for(int i=0;i<h;i++) cin>>st[i];\n int sy,sx,gy,gx,n=0;\n map<P,int> m;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n sp[i][j]=max(sp[i][j],1);\n if(st[i][j]=='M') m[P(i,j)]=n++;\n if(st[i][j]=='S') sy=i,sx=j;\n if(st[i][j]=='G') gy=i,gx=j;\n if(st[i][j]=='#'){\n\tfor(int k=1;k<=3;k++){\n\t for(int a=-(4-k);a<=4-k;a++){\n\t if(in(i-(4-k),j+a)) sp[i-(4-k)][j+a]=max(sp[i-(4-k)][j+a],k);\n\t if(in(i+(4-k),j+a)) sp[i+(4-k)][j+a]=max(sp[i+(4-k)][j+a],k);\n\t if(in(i+a,j-(4-k))) sp[i+a][j-(4-k)]=max(sp[i+a][j-(4-k)],k);\n\t if(in(i+a,j+(4-k))) sp[i+a][j+(4-k)]=max(sp[i+a][j+(4-k)],k);\n\t }\n\t}\n }\n }\n }\n /*//\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cout<<sp[i][j];\n }\n cout<<endl;\n }\n //*/\n priority_queue<sta> q;\n q.push(sta(sy,sx,0,0));\n dp[sy][sx][0]=0;\n int ax[]={1,-1,0,0};\n int ay[]={0,0,1,-1};\n while(!q.empty()){\n sta s=q.top();q.pop();\n if(dp[s.y][s.x][s.b]<s.d) continue;\n //cout<<s.y<<\" \"<<s.x<<\" \"<<s.b<<\" \"<<s.d<<endl;\n for(int k=0;k<4;k++){\n int ny=s.y+ay[k],nx=s.x+ax[k],nb=s.b,nd=s.d+sp[s.y][s.x];\n if(!in(ny,nx)) continue;\n if(st[ny][nx]=='#') continue;\n if(m.count(P(ny,nx))) nb|=1<<m[P(ny,nx)];\n if(dp[ny][nx][nb]<0||dp[ny][nx][nb]>nd){\n\tdp[ny][nx][nb]=nd;\n\tq.push(sta(ny,nx,nb,nd));\n }\n }\n }\n cout<<dp[gy][gx][(1<<n)-1]<<endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4900,"score_of_the_acc":-0.0876,"final_rank":7},{"submission_id":"aoj_2419_2196513","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nint dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\nbool check(int n,int m,int x,int y) {return x>=0&&x<n&&y>=0&&y<m;}\n\nint a[111][111],d[1<<5][111][111];\nmap<P,int> ma;\nint main() {\n int n,m;\n cin >> m >> n;\n string s[n];\n for(int i=0; i<n; i++) cin >> s[i];\n priority_queue<PP,vector<PP>,greater<PP> > que;\n for(int i=0; i<n; i++) {\n for(int j=0; j<m; j++) {\n a[i][j]=1;\n for(int k=0; k<(1<<5); k++) d[k][i][j]=1<<29;\n if(s[i][j]=='S') {\n d[0][i][j]=0;\n que.push(PP(P(0,0),P(i,j)));\n }\n if(s[i][j]=='M') {\n int k=ma.size();\n ma[P(i,j)]=k;\n }\n for(int k=-2; k<=2; k++) {\n for(int l=-2; l<=2; l++) {\n int x=i+k,y=j+l;\n if(!check(n,m,x,y)||s[x][y]!='#') continue;\n int d=max(abs(i-x),abs(j-y));\n if(d==1) a[i][j]=max(a[i][j],3);\n if(d==2) a[i][j]=max(a[i][j],2);\n }\n }\n }\n }\n while(!que.empty()) {\n PP p=que.top();que.pop();\n int xx=p.second.first,yy=p.second.second,cc=p.first.first,tt=p.first.second;\n if(s[xx][yy]=='G'&&tt==(1<<ma.size())-1) {\n cout << d[tt][xx][yy] << endl;\n return 0;\n }\n if(d[tt][xx][yy]<cc) continue;\n for(int i=0; i<4; i++) {\n int x=xx+dx[i],y=yy+dy[i];\n int t=tt;\n if(!check(n,m,x,y)||s[x][y]=='#') continue;\n if(s[x][y]=='M') t|=1<<ma[P(x,y)];\n if(d[t][x][y]<=d[tt][xx][yy]+a[xx][yy]) continue;\n d[t][x][y]=d[tt][xx][yy]+a[xx][yy];\n que.push(PP(P(d[t][x][y],t),P(x,y)));\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4756,"score_of_the_acc":-0.1092,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_2419_10000626\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\" \\n\\nusing namespace std;\\n\\nvector<vector<int> > cst(110, vector<int>(110, 1)); \\nint dist[110][110];\\nint n, m;\\n\\nstruct node\\n{\\n int x, y, d;\\n};\\n\\nvoid dejkstra(int x, int y)\\n{\\n queue<node> q;\\n node p = {x,y,0};\\n q.push(p); dist[x][y] = 0;\\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\\n while(!q.empty())\\n {\\n p = q.front(); q.pop();\\n if(dist[p.x][p.y] < p.d) continue;\\n for(int i = 0; i < 4; i++)\\n {\\n int nx = p.x + dx[i];\\n int ny = p.y + dy[i];\\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\\n int best = p.d + cst[p.x][p.y];\\n if(dist[nx][ny] > best)\\n {\\n dist[nx][ny] = best;\\n node l = {nx,ny,best};\\n q.push(l);\\n }\\n }\\n }\\n}\\n\\nint main()\\n{\\n cin >> m >> n;\\n char a[n][m];\\n int xS, yS, xG, yG; \\n for(int i = 0; i < n; i++)\\n for(int j = 0;j < m;j ++) cin >> a[i][j];\\n\\n vector<pair<int, int> > M;\\n \\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 for(int x = i - 2; x <= i + 2; x++)\\n for(int y = j - 2; y <= j + 2; y++)\\n if(x >= 0 && y >= 0)\\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\\n }\\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\\n if(a[i][j] == 'S') xS = i, yS = j;\\n if(a[i][j] == 'G') xG = i, yG = j;\\n }\\n } \\n \\n int k = M.size();\\n vector<int> perm;\\n int ans = 1e9;\\n \\n for(int i = 0;i < k; i++) perm.push_back(i);\\n do{\\n vector<pair<int, int> > p;\\n p.push_back(make_pair(xS,yS));\\n for(auto it : perm) p.push_back(M[it]);\\n p.push_back(make_pair(xG,yG));\\n \\n int sum = 0;\\n for(int i = 0;i < p.size()-1; i++)\\n {\\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\\n dejkstra(p[i].first, p[i].second);\\n sum += dist[p[i+1].first][p[i+1].second];\\n } \\n ans = min(ans, sum);\\n\\n } while(next_permutation(perm.begin(), perm.end()));\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.5563,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2419_10000625\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\" \\n\\nusing namespace std;\\n\\nvector<vector<int> > cst(110, vector<int>(110, 1)); \\nint dist[110][110];\\nint n, m;\\n\\nstruct node\\n{\\n int x, y, d;\\n};\\n\\nvoid dejkstra(int x, int y)\\n{\\n queue<node> q;\\n node p = {x,y,0};\\n q.push(p); dist[x][y] = 0;\\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\\n while(!q.empty())\\n {\\n p = q.front(); q.pop();\\n if(dist[p.x][p.y] < p.d) continue;\\n for(int i = 0; i < 4; i++)\\n {\\n int nx = p.x + dx[i];\\n int ny = p.y + dy[i];\\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\\n int best = p.d + cst[p.x][p.y];\\n if(dist[nx][ny] > best)\\n {\\n dist[nx][ny] = best;\\n node l = {nx,ny,best};\\n q.push(l);\\n }\\n }\\n }\\n}\\n\\nint main()\\n{\\n cin >> m >> n;\\n char a[n][m];\\n int xS, yS, xG, yG; \\n for(int i = 0; i < n; i++)\\n for(int j = 0;j < m;j ++) cin >> a[i][j];\\n\\n vector<pair<int, int> > M;\\n \\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 for(int x = i - 2; x <= i + 2; x++)\\n for(int y = j - 2; y <= j + 2; y++)\\n if(x >= 0 && y >= 0)\\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\\n }\\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\\n if(a[i][j] == 'S') xS = i, yS = j;\\n if(a[i][j] == 'G') xG = i, yG = j;\\n }\\n } \\n \\n int k = M.size();\\n vector<int> perm;\\n int ans = 1e9;\\n \\n for(int i = 0;i < k; i++) perm.push_back(i);\\n do{\\n vector<pair<int, int> > p;\\n p.push_back(make_pair(xS,yS));\\n for(auto it : perm) p.push_back(M[it]);\\n p.push_back(make_pair(xG,yG));\\n \\n int sum = 0;\\n for(int i = 0;i < p.size()-1; i++)\\n {\\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\\n dejkstra(p[i].first, p[i].second);\\n sum += dist[p[i+1].first][p[i+1].second];\\n } \\n ans = min(ans, sum);\\n\\n } while(next_permutation(perm.begin(), perm.end()));\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.5813,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2419_10000566\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\" \\n\\nusing namespace std;\\n\\nvector<vector<int> > cst(110, vector<int>(110, 1)); \\nint dist[110][110];\\nint n, m;\\n\\nstruct node\\n{\\n int x, y, d;\\n};\\n\\nvoid dejkstra(int x, int y)\\n{\\n queue<node> q;\\n node p = {x,y,0};\\n q.push(p); dist[x][y] = 0;\\n int dx[] = {1,0,-1,0}, dy[] = {0,1,0,-1};\\n while(!q.empty())\\n {\\n p = q.front(); q.pop();\\n if(dist[p.x][p.y] < p.d) continue;\\n for(int i = 0; i < 4; i++)\\n {\\n int nx = p.x + dx[i];\\n int ny = p.y + dy[i];\\n //cout << p.x << ' ' << p.y << ' ' << ny << ' ' << nx << endl;\\n if(nx < 0 || ny < 0 || cst[nx][ny] == 4 || ny >= m || nx >= n) continue;\\n int best = p.d + cst[p.x][p.y];\\n //cout << nx << ' ' << ny << ' ' << best << ' ' << p.x << ' ' << p.y << ' ' << endl;\\n if(dist[nx][ny] > best)\\n {\\n dist[nx][ny] = best;\\n node l = {nx,ny,best};\\n q.push(l);\\n }\\n }\\n }\\n}\\n\\nint main()\\n{\\n cin >> m >> n;\\n char a[n][m];\\n int xS, yS, xG, yG; \\n for(int i = 0; i < n; i++)\\n for(int j = 0;j < m;j ++) cin >> a[i][j];\\n\\n vector<pair<int, int> > M;\\n \\n for(int i =0 ; i< n;i++)\\n {\\n for(int j = 0;j < m; j++)\\n {\\n int f = 0;\\n if(a[i][j] == '#')\\n {\\n for(int x = i - 2; x <= i + 2; x++)\\n for(int y = j - 2; y <= j + 2; y++)\\n if(x >= 0 && y >= 0)\\n cst[x][y] = max(cst[x][y], 4 - max(abs(x - i), abs(y - j)));\\n }\\n if(a[i][j] == 'M') M.push_back(make_pair(i, j));\\n if(a[i][j] == 'S') xS = i, yS = j;\\n if(a[i][j] == 'G') xG = i, yG = j;\\n }\\n }\\n \\n int k = M.size();\\n vector<int> perm;\\n // for(int i = 0;i < n; i++){\\n // for(int j = 0;j < m ;j++)\\n // cout << cst[i][j] << ' ';\\n // cout << endl;\\n // }\\n int ans = 1e9;\\n \\n for(int i = 0;i < k; i++) perm.push_back(i);\\n do{\\n vector<pair<int, int> > p;\\n p.push_back(make_pair(xS,yS));\\n for(auto it : perm) p.push_back(M[it]);\\n p.push_back(make_pair(xG,yG));\\n // for(auto it : p) cout << it.first << ' ' << it.second << endl;\\n // cout << endl;\\n int sum = 0;\\n for(int i = 0;i < p.size()-1; i++)\\n {\\n for(int i = 0; i < 110;i ++) for(int j = 0;j < 110; j++) dist[i][j] = 1e9;\\n dejkstra(p[i].first, p[i].second);\\n // for(int i = 0;i < n; i++){\\n // for(int j = 0;j < m ;j++)\\n // cout << dist[i][j] << ' ';\\n // cout << endl;\\n // } cout << endl;\\n sum += dist[p[i+1].first][p[i+1].second];\\n } \\n ans = min(ans, sum);\\n\\n } while(next_permutation(perm.begin(), perm.end()));\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3556,\n \"score_of_the_acc\": -0.5814,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2419_5034519\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(vector<bool>::reference v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 6 \\\"/home/yuruhiya/programming/library/template/functions.cpp\\\"\\nusing namespace std;\\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> T div_ceil(T n, T m) {\\n\\treturn (n + m - 1) / m;\\n}\\ntemplate <class T> T div_ceil2(T n, T m) {\\n\\treturn div_ceil(n, m) * m;\\n}\\ntemplate <class T> T triangle(T n) {\\n\\treturn (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);\\n}\\ntemplate <class T> T nC2(T n) {\\n\\treturn (n & 1) ? (n - 1) / 2 * n : n / 2 * (n - 1);\\n}\\ntemplate <class T> T middle(const T& l, const T& r) {\\n\\treturn l + (r - l) / 2;\\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> bool in_range(const T& v, const T& min, const T& max) {\\n\\treturn min <= v && v < max;\\n}\\ntemplate <class T> bool in_square(T n) {\\n\\tT s = sqrt(n);\\n\\treturn s * s == n || (s + 1) * (s + 1) == n;\\n}\\ntemplate <class T = long long> T BIT(int b) {\\n\\treturn T(1) << b;\\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}\\ntemplate <class T, class U> T Pow(T a, U n) {\\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> T Powmod(T a, U n, T 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}\\nnamespace internal {\\n\\ttemplate <class T, size_t N> auto make_vector(vector<int>& sizes, const T& init) {\\n\\t\\tif constexpr (N == 1) {\\n\\t\\t\\treturn vector(sizes[0], init);\\n\\t\\t} else {\\n\\t\\t\\tint size = sizes[N - 1];\\n\\t\\t\\tsizes.pop_back();\\n\\t\\t\\treturn vector(size, make_vector<T, N - 1>(sizes, init));\\n\\t\\t}\\n\\t}\\n} // namespace internal\\ntemplate <class T, size_t N>\\nauto make_vector(const int (&sizes)[N], const T& init = T()) {\\n\\tvector s(rbegin(sizes), rend(sizes));\\n\\treturn internal::make_vector<T, N>(s, init);\\n}\\n#line 7 \\\"/home/yuruhiya/programming/library/template/template_no_Ruby.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Utility/Point.cpp\\\"\\n#include <optional>\\n#line 9 \\\"/home/yuruhiya/programming/library/Utility/Point.cpp\\\"\\nusing namespace std;\\n\\nstruct Point {\\n\\tstatic int H, W;\\n\\tstatic const vector<Point> direction;\\n\\tusing direction_iterator = vector<Point>::const_iterator;\\n\\tstatic void set_range(int _H, int _W) {\\n\\t\\tH = _H;\\n\\t\\tW = _W;\\n\\t}\\n\\tstatic constexpr Point zero() {\\n\\t\\treturn {0, 0};\\n\\t}\\n\\tstatic constexpr Point one() {\\n\\t\\treturn {1, 1};\\n\\t}\\n\\tstatic constexpr Point L() {\\n\\t\\treturn {-1, 0};\\n\\t}\\n\\tstatic constexpr Point R() {\\n\\t\\treturn {1, 0};\\n\\t}\\n\\tstatic constexpr Point U() {\\n\\t\\treturn {0, -1};\\n\\t}\\n\\tstatic constexpr Point D() {\\n\\t\\treturn {0, 1};\\n\\t}\\n\\tstatic constexpr Point LU() {\\n\\t\\treturn {-1, -1};\\n\\t}\\n\\tstatic constexpr Point LD() {\\n\\t\\treturn {-1, 1};\\n\\t}\\n\\tstatic constexpr Point RU() {\\n\\t\\treturn {1, -1};\\n\\t}\\n\\tstatic constexpr Point RD() {\\n\\t\\treturn {1, 1};\\n\\t}\\n\\n\\tint x, y;\\n\\tconstexpr Point() : x(0), y(0) {}\\n\\tconstexpr Point(int _x, int _y) : x(_x), y(_y) {}\\n\\tconstexpr Point(const pair<int, int>& xy) : x(xy.first), y(xy.second) {}\\n\\tPoint(int n) : x(n % W), y(n / W) {}\\n\\tconstexpr Point operator+() const {\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point operator-() const {\\n\\t\\treturn {-x, -y};\\n\\t}\\n\\tconstexpr Point operator+(const Point& p) const {\\n\\t\\treturn Point(*this) += p;\\n\\t}\\n\\tconstexpr Point operator-(const Point& p) const {\\n\\t\\treturn Point(*this) -= p;\\n\\t}\\n\\tconstexpr Point operator*(const Point& p) const {\\n\\t\\treturn Point(*this) *= p;\\n\\t}\\n\\tconstexpr Point operator/(const Point& p) const {\\n\\t\\treturn Point(*this) /= p;\\n\\t}\\n\\tconstexpr Point operator%(const Point& p) const {\\n\\t\\treturn Point(*this) %= p;\\n\\t}\\n\\tconstexpr Point operator+(int n) const {\\n\\t\\treturn Point(*this) += n;\\n\\t}\\n\\tconstexpr Point operator-(int n) const {\\n\\t\\treturn Point(*this) -= n;\\n\\t}\\n\\tconstexpr Point operator*(int n) const {\\n\\t\\treturn Point(*this) *= n;\\n\\t}\\n\\tconstexpr Point operator/(int n) const {\\n\\t\\treturn Point(*this) /= n;\\n\\t}\\n\\tconstexpr Point operator%(int n) const {\\n\\t\\treturn Point(*this) %= n;\\n\\t}\\n\\tconstexpr Point& operator+=(const Point& p) {\\n\\t\\tx += p.x;\\n\\t\\ty += p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator-=(const Point& p) {\\n\\t\\tx -= p.x;\\n\\t\\ty -= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator*=(const Point& p) {\\n\\t\\tx *= p.x;\\n\\t\\ty *= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator/=(const Point& p) {\\n\\t\\tx /= p.x;\\n\\t\\ty /= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator%=(const Point& p) {\\n\\t\\tx %= p.x;\\n\\t\\ty %= p.y;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator+=(int n) {\\n\\t\\tx += n;\\n\\t\\ty += n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator-=(int n) {\\n\\t\\tx -= n;\\n\\t\\ty -= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator*=(int n) {\\n\\t\\tx *= n;\\n\\t\\ty *= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator/=(int n) {\\n\\t\\tx /= n;\\n\\t\\ty /= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point& operator%=(int n) {\\n\\t\\tx %= n;\\n\\t\\ty %= n;\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr bool operator==(const Point& p) const {\\n\\t\\treturn x == p.x && y == p.y;\\n\\t}\\n\\tconstexpr bool operator!=(const Point& p) const {\\n\\t\\treturn x != p.x || y != p.y;\\n\\t}\\n\\tbool operator<(const Point& p) const {\\n\\t\\treturn to_i() < p.to_i();\\n\\t}\\n\\tbool operator<=(const Point& p) const {\\n\\t\\treturn to_i() <= p.to_i();\\n\\t}\\n\\tbool operator>(const Point& p) const {\\n\\t\\treturn to_i() > p.to_i();\\n\\t}\\n\\tbool operator>=(const Point& p) const {\\n\\t\\treturn to_i() >= p.to_i();\\n\\t}\\n\\tconstexpr int operator[](int i) const {\\n\\t\\treturn i == 0 ? x : i == 1 ? y : 0;\\n\\t}\\n\\tconstexpr bool in_range(int height, int width) const {\\n\\t\\treturn 0 <= x && x < width && 0 <= y && y < height;\\n\\t}\\n\\tbool in_range() const {\\n\\t\\treturn in_range(H, W);\\n\\t}\\n\\tint to_i() const {\\n\\t\\treturn x + y * W;\\n\\t}\\n\\tconstexpr pair<int, int> to_pair() const {\\n\\t\\treturn {x, y};\\n\\t}\\n\\tconstexpr int manhattan_distance(const Point& p) const {\\n\\t\\treturn abs(x - p.x) + abs(y - p.y);\\n\\t}\\n\\tconstexpr int chebyshev_distance(const Point& p) const {\\n\\t\\treturn max(abs(x - p.x), abs(y - p.y));\\n\\t}\\n\\tconstexpr int distance_square(const Point& p) const {\\n\\t\\treturn (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);\\n\\t}\\n\\ttemplate <class Real> constexpr Real distance(const Point& p) const {\\n\\t\\treturn sqrt(static_cast<Real>(distance_square(p)));\\n\\t}\\n\\tconstexpr Point absolute(const Point& p) const {\\n\\t\\treturn absolute(*this - p);\\n\\t}\\n\\tconstexpr Point absolute() const {\\n\\t\\treturn {abs(x), abs(y)};\\n\\t}\\n\\tPoint& swap() {\\n\\t\\tstd::swap(x, y);\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tclass enumrate_adjacent_helper {\\n\\t\\tshared_ptr<Point> p;\\n\\t\\tdirection_iterator first, last;\\n\\n\\t\\tclass iterator {\\n\\t\\t\\tshared_ptr<Point> p;\\n\\t\\t\\tdirection_iterator it;\\n\\n\\t\\tpublic:\\n\\t\\t\\titerator(shared_ptr<Point> _p, direction_iterator _it) : p(_p), it(_it) {}\\n\\t\\t\\tPoint operator*() const {\\n\\t\\t\\t\\treturn *p + *it;\\n\\t\\t\\t}\\n\\t\\t\\titerator& operator++() {\\n\\t\\t\\t\\t++it;\\n\\t\\t\\t\\treturn *this;\\n\\t\\t\\t}\\n\\t\\t\\tbool operator!=(iterator other) const {\\n\\t\\t\\t\\treturn it != other.it;\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\tpublic:\\n\\t\\tenumrate_adjacent_helper(shared_ptr<Point> _p, direction_iterator _first,\\n\\t\\t direction_iterator _last)\\n\\t\\t : p(_p), first(_first), last(_last) {}\\n\\t\\titerator begin() const {\\n\\t\\t\\treturn iterator(p, first);\\n\\t\\t}\\n\\t\\titerator end() const {\\n\\t\\t\\treturn iterator(p, last);\\n\\t\\t}\\n\\t};\\n\\tauto enumrate_adjacent(direction_iterator first, direction_iterator last) const {\\n\\t\\treturn enumrate_adjacent_helper(make_shared<Point>(*this), first, last);\\n\\t}\\n\\tauto adjacent4() const {\\n\\t\\treturn enumrate_adjacent(direction.begin(), direction.begin() + 4);\\n\\t}\\n\\tauto adjacent8() const {\\n\\t\\treturn enumrate_adjacent(direction.begin(), direction.begin() + 8);\\n\\t}\\n\\n\\tclass enumrate_adj_in_range_helper {\\n\\t\\tshared_ptr<Point> p;\\n\\t\\tdirection_iterator first, last;\\n\\n\\t\\tclass sentinel {};\\n\\t\\tclass iterator {\\n\\t\\t\\tshared_ptr<Point> p;\\n\\t\\t\\tdirection_iterator first, last;\\n\\n\\t\\t\\tvoid increment_until_in_range() {\\n\\t\\t\\t\\tfor (; first != last; ++first) {\\n\\t\\t\\t\\t\\tif ((*p + *first).in_range()) return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tpublic:\\n\\t\\t\\titerator(shared_ptr<Point> _p, direction_iterator _first,\\n\\t\\t\\t direction_iterator _last)\\n\\t\\t\\t : p(_p), first(_first), last(_last) {\\n\\t\\t\\t\\tincrement_until_in_range();\\n\\t\\t\\t}\\n\\t\\t\\tPoint operator*() const {\\n\\t\\t\\t\\treturn *p + *first;\\n\\t\\t\\t}\\n\\t\\t\\titerator& operator++() {\\n\\t\\t\\t\\t++first;\\n\\t\\t\\t\\tincrement_until_in_range();\\n\\t\\t\\t\\treturn *this;\\n\\t\\t\\t}\\n\\t\\t\\tbool operator!=(sentinel other) const {\\n\\t\\t\\t\\treturn first != last;\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\tpublic:\\n\\t\\tenumrate_adj_in_range_helper(shared_ptr<Point> _p, direction_iterator _first,\\n\\t\\t direction_iterator _last)\\n\\t\\t : p(_p), first(_first), last(_last) {}\\n\\t\\titerator begin() const {\\n\\t\\t\\treturn iterator(p, first, last);\\n\\t\\t}\\n\\t\\tsentinel end() const {\\n\\t\\t\\treturn sentinel();\\n\\t\\t}\\n\\t};\\n\\ttemplate <class InputIterator>\\n\\tauto enumrate_adj_in_range(InputIterator first, InputIterator last) const {\\n\\t\\treturn enumrate_adj_in_range_helper(make_shared<Point>(*this), first, last);\\n\\t}\\n\\tauto adj4_in_range() const {\\n\\t\\treturn enumrate_adj_in_range(direction.begin(), direction.begin() + 4);\\n\\t}\\n\\tauto adj8_in_range() const {\\n\\t\\treturn enumrate_adj_in_range(direction.begin(), direction.end());\\n\\t}\\n\\n\\tconstexpr Point left() const {\\n\\t\\treturn {x - 1, y};\\n\\t}\\n\\tconstexpr Point right() const {\\n\\t\\treturn {x + 1, y};\\n\\t}\\n\\tconstexpr Point up() const {\\n\\t\\treturn {x, y - 1};\\n\\t}\\n\\tconstexpr Point down() const {\\n\\t\\treturn {x, y + 1};\\n\\t}\\n\\tPoint succ() const {\\n\\t\\tif (x != W - 1) {\\n\\t\\t\\treturn {x + 1, y};\\n\\t\\t} else {\\n\\t\\t\\treturn {0, y + 1};\\n\\t\\t}\\n\\t}\\n\\tPoint pred() const {\\n\\t\\tif (x != 0) {\\n\\t\\t\\treturn {x - 1, y};\\n\\t\\t} else {\\n\\t\\t\\treturn {W - 1, y - 1};\\n\\t\\t}\\n\\t}\\n\\tconstexpr Point moved(char c) const {\\n\\t\\treturn Point(*this).move(c);\\n\\t}\\n\\tconstexpr Point& move(char c) {\\n\\t\\tswitch (c) {\\n\\t\\t\\tcase 'L':\\n\\t\\t\\tcase 'l':\\n\\t\\t\\tcase 'W':\\n\\t\\t\\tcase '>':\\n\\t\\t\\t\\tx--;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'R':\\n\\t\\t\\tcase 'r':\\n\\t\\t\\tcase 'E':\\n\\t\\t\\tcase '<':\\n\\t\\t\\t\\tx++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'U':\\n\\t\\t\\tcase 'u':\\n\\t\\t\\tcase 'N':\\n\\t\\t\\tcase '^':\\n\\t\\t\\t\\ty--;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'D':\\n\\t\\t\\tcase 'd':\\n\\t\\t\\tcase 'S':\\n\\t\\t\\tcase 'v':\\n\\t\\t\\t\\ty++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\tconstexpr Point rotate90() const {\\n\\t\\treturn {y, -x};\\n\\t}\\n\\tconstexpr Point rotate180() const {\\n\\t\\treturn {-x, -y};\\n\\t}\\n\\tconstexpr Point rotate270() const {\\n\\t\\treturn {-y, x};\\n\\t}\\n\\tchar to_direction_char(string_view lrud = \\\"LRUD\\\") const {\\n\\t\\tassert(4 <= lrud.size() && lrud.size() <= 5);\\n\\t\\tif (y == 0 && x < 0) {\\n\\t\\t\\treturn lrud[0];\\n\\t\\t} else if (y == 0 && x > 0) {\\n\\t\\t\\treturn lrud[1];\\n\\t\\t} else if (x == 0 && y < 0) {\\n\\t\\t\\treturn lrud[2];\\n\\t\\t} else if (x == 0 && y > 0) {\\n\\t\\t\\treturn lrud[3];\\n\\t\\t} else if (lrud.size() == 5) {\\n\\t\\t\\treturn lrud[4];\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\n\\tstatic Point to_direction(char c, string_view lrud = \\\"LRUD\\\") {\\n\\t\\tassert(lrud.size() == 4);\\n\\t\\tif (c == lrud[0]) {\\n\\t\\t\\treturn L();\\n\\t\\t} else if (c == lrud[1]) {\\n\\t\\t\\treturn R();\\n\\t\\t} else if (c == lrud[2]) {\\n\\t\\t\\treturn U();\\n\\t\\t} else if (c == lrud[3]) {\\n\\t\\t\\treturn D();\\n\\t\\t} else {\\n\\t\\t\\treturn zero();\\n\\t\\t}\\n\\t}\\n\\n\\ttemplate <class T, class value_type = typename T::value_type::value_type>\\n\\tstatic optional<Point> find(const T& grid, const value_type& val) {\\n\\t\\tassert(static_cast<int>(grid.size()) == H);\\n\\t\\tfor (int i = 0; i < H; ++i) {\\n\\t\\t\\tassert(static_cast<int>(grid[i].size()) == W);\\n\\t\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\t\\tif (grid[i][j] == val) {\\n\\t\\t\\t\\t\\treturn Point(j, i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn nullopt;\\n\\t}\\n\\ttemplate <class T, class Predicate>\\n\\tstatic optional<Point> find_if(const T& grid, Predicate pred) {\\n\\t\\tassert(static_cast<int>(grid.size()) == H);\\n\\t\\tfor (int i = 0; i < H; ++i) {\\n\\t\\t\\tassert(static_cast<int>(grid[i].size()) == W);\\n\\t\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\t\\tif (pred(grid[i][j])) {\\n\\t\\t\\t\\t\\treturn Point(j, i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn nullopt;\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type::value_type>\\n\\tstatic optional<Point> find_one(const T& grid, const value_type& val) {\\n\\t\\tassert(static_cast<int>(grid.size()) == H);\\n\\t\\toptional<Point> result;\\n\\t\\tfor (int i = 0; i < H; ++i) {\\n\\t\\t\\tassert(static_cast<int>(grid[i].size()) == W);\\n\\t\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\t\\tif (grid[i][j] == val) {\\n\\t\\t\\t\\t\\tassert(!result);\\n\\t\\t\\t\\t\\tresult = Point(j, i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type::value_type>\\n\\tstatic vector<Point> find_all(const T& grid, const value_type& val) {\\n\\t\\tassert(static_cast<int>(grid.size()) == H);\\n\\t\\tvector<Point> result;\\n\\t\\tfor (int i = 0; i < H; ++i) {\\n\\t\\t\\tassert(static_cast<int>(grid[i].size()) == W);\\n\\t\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\t\\tif (grid[i][j] == val) {\\n\\t\\t\\t\\t\\tresult.emplace_back(j, i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\n\\tstatic auto enumrate_2D_points() {\\n\\t\\tclass enumrate_2D_points_helper {\\n\\t\\tpublic:\\n\\t\\t\\tclass iterator {\\n\\t\\t\\t\\tPoint p;\\n\\n\\t\\t\\tpublic:\\n\\t\\t\\t\\titerator(const Point& _p) : p(_p) {}\\n\\t\\t\\t\\tPoint operator*() const {\\n\\t\\t\\t\\t\\treturn p;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\titerator& operator++() {\\n\\t\\t\\t\\t\\tp = p.succ();\\n\\t\\t\\t\\t\\treturn *this;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\titerator& operator--() {\\n\\t\\t\\t\\t\\tp = p.pred();\\n\\t\\t\\t\\t\\treturn *this;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbool operator!=(iterator other) const {\\n\\t\\t\\t\\t\\treturn p != other.p;\\n\\t\\t\\t\\t}\\n\\t\\t\\t};\\n\\t\\t\\titerator begin() const {\\n\\t\\t\\t\\treturn iterator(Point(0, 0));\\n\\t\\t\\t}\\n\\t\\t\\titerator end() const {\\n\\t\\t\\t\\treturn iterator(Point(0, H));\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\treturn enumrate_2D_points_helper();\\n\\t}\\n\\n\\tfriend ostream& operator<<(ostream& os, const Point& p) {\\n\\t\\treturn os << '(' << p.x << \\\", \\\" << p.y << ')';\\n\\t}\\n\\tfriend istream& operator>>(istream& is, Point& p) {\\n\\t\\treturn is >> p.y >> p.x;\\n\\t}\\n};\\nint Point::H, Point::W;\\nconst vector<Point> Point::direction{Point::R(), Point::D(), Point::U(), Point::L(),\\n Point::RD(), Point::LU(), Point::RU(), Point::LD()};\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\\\"\\nusing namespace std;\\n\\nusing Weight = long long;\\nconstexpr Weight INF = numeric_limits<Weight>::max();\\nstruct Edge {\\n\\tint to;\\n\\tWeight cost;\\n\\tEdge() : to(-1), cost(-1) {}\\n\\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge& e) {\\n\\t\\treturn os << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Graph = vector<vector<Edge>>;\\nstruct Edge2 {\\n\\tint from, to;\\n\\tWeight cost;\\n\\tEdge2() : from(-1), to(-1), cost(0) {}\\n\\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\\n\\t\\treturn os << e.from << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Edges = vector<Edge2>;\\nusing Matrix = vector<vector<Weight>>;\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/Dijkstra.cpp\\\"\\nusing namespace std;\\n\\nvector<Weight> Dijkstra(const Graph& graph, int s) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist;\\n}\\n#line 4 \\\"a.cpp\\\"\\n\\nint main() {\\n\\tini(w, h);\\n\\tVS s = in[h];\\n\\tPoint::set_range(h, w);\\n\\n\\tPoint start = *Point::find_one(s, 'S'), goal = *Point::find_one(s, 'G');\\n\\tvector<Point> passing = Point::find_all(s, 'M');\\n\\tpassing.insert(passing.begin(), start);\\n\\tpassing.push_back(goal);\\n\\tvector<Point> holes = Point::find_all(s, '#');\\n\\n\\tGraph g(h * w);\\n\\tfor (const auto& p : Point::enumrate_2D_points()) {\\n\\t\\tif (s[p.y][p.x] == '#') continue;\\n\\t\\tll time = 1;\\n\\t\\tfor (const auto& hole : holes) {\\n\\t\\t\\tchmax<ll>(time, 4 - p.chebyshev_distance(hole));\\n\\t\\t}\\n\\t\\tfor (const auto& q : p.adj4_in_range()) {\\n\\t\\t\\tif (s[q.y][q.x] != '#') {\\n\\t\\t\\t\\tg[p.to_i()].emplace_back(q.to_i(), time);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint m = passing.size();\\n\\tauto dist = make_vector<ll>({m, m});\\n\\trep(i, m) {\\n\\t\\tauto dist_i = Dijkstra(g, passing[i].to_i());\\n\\t\\trep(j, m) {\\n\\t\\t\\tdist[i][j] = dist_i[passing[j].to_i()];\\n\\t\\t}\\n\\t}\\n\\tdump(passing, dist);\\n\\n\\tll ans = inf_ll;\\n\\tVI perm(m - 2);\\n\\tiota(all(perm), 1);\\n\\tdo {\\n\\t\\tVI p{0};\\n\\t\\tp.insert(p.end(), all(perm));\\n\\t\\tp.push_back(m - 1);\\n\\t\\tll d = 0;\\n\\t\\trep(i, m - 1) {\\n\\t\\t\\td += dist[p[i]][p[i + 1]];\\n\\t\\t}\\n\\t\\tchmin(ans, d);\\n\\t} while (next_permutation(all(perm)));\\n\\tout(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4156,\n \"score_of_the_acc\": -0.0203,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2419_2971008\",\n \"code_snippet\": \"#include <iostream>\\n#include <numeric>\\n#include <queue>\\n#include <cstring>\\n#include <stdio.h>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <limits.h>\\nusing namespace std;\\ntypedef vector<int> vi;\\ntypedef long long ll;\\ntypedef long long ll;\\ntypedef vector<ll> vll;\\nconst int inf=10000000;\\nint H,W,startx,starty,goalx,goaly;\\nstring board[105];\\nint cost[105][105];\\nint d[105][105];\\nbool visited[150][105];\\nint dx8[]={-1,-1,0,1,1,1,0,-1};\\nint dy8[]={0,1,1,1,0,-1,-1,-1};\\nint dy[]={0,1,0,-1};\\nint dx[]={-1,0,1,0};\\n\\ntypedef pair<int,int> P;\\ntypedef pair<int,pair<int,int> > PP;\\n\\nvoid costset(int sx,int sy,int times)\\n{\\n if(times==2) return;\\n int nowx=sx;\\n int nowy=sy;\\n int cos=3-times;\\n for(int k=0;k<8;k++)\\n {\\n int nx=nowx+dx8[k];\\n int ny=nowy+dy8[k];\\n if(nx<0 || W<=nx || ny<0 || H<=ny) continue;\\n cost[ny][nx]=max(cost[ny][nx],cos);\\n costset(nx,ny,times+1);\\n }\\n}\\n\\nint solve(int sx,int sy,int gx,int gy)\\n{\\n for(int i=0;i<H;i++)\\n {\\n for(int j=0;j<W;j++)\\n\\t{\\n\\t d[i][j]=inf;\\n\\t}\\n }\\n d[sy][sx]=0;\\n priority_queue<PP,vector<PP> ,greater<PP>> p;\\n p.push(PP(0,P(sy,sx)));\\n int nowy,nowx;\\n while(!p.empty())\\n {\\n PP now=p.top();p.pop();\\n nowy=now.second.first;\\n nowx=now.second.second;\\n if(nowx==gx && nowy==gy) break;\\n for(int k=0;k<4;k++)\\n\\t{\\n\\t int ny=nowy+dy[k];\\n\\t int nx=nowx+dx[k];\\n\\t if(ny<0 || H<=ny || nx<0 || W<=nx || board[ny][nx]=='#') continue;\\n\\t if(d[nowy][nowx]+cost[nowy][nowx]>=d[ny][nx]) continue;\\n\\t if(d[ny][nx]==inf || d[ny][nx]>d[nowy][nowx]+cost[nowy][nowx])\\n\\t {\\n\\t d[ny][nx]=d[nowy][nowx]+cost[nowy][nowx];\\n\\t p.push(PP(d[ny][nx],P(ny,nx)));\\n\\t }\\n\\t}\\n }\\n return d[gy][gx];\\n}\\n\\nint main(int argc,char const* argv[])\\n{\\n int ans=20000000;\\n int scroll=0;\\n int pat=1;\\n int graph[10][10];\\n for(int i=0;i<10;i++)\\n {\\n for(int j=0;j<10;j++)\\n\\t{\\n\\t graph[i][j]=inf;\\n\\t}\\n }\\n vector<P> route;\\n cin >> W >> H;\\n for(int i=0;i<H;i++)\\n {\\n cin >> board[i];\\n }\\n for(int i=0;i<H;i++)\\n {\\n for(int j=0;j<W;j++)\\n\\t{\\n\\t cost[i][j]=1;\\n\\t if(board[i][j]=='M') route.push_back(P(i,j));\\n\\t if(board[i][j]=='G') {goaly=i;goalx=j;}\\n\\t if(board[i][j]=='S') {starty=i;startx=j;}\\n\\t}\\n }\\n sort(route.begin(),route.end());\\n for(int i=0;i<H;i++)\\n {\\n for(int j=0;j<W;j++)\\n\\t{\\n\\t if(board[i][j]=='#')\\n\\t {\\n\\t costset(j,i,0);\\n\\t }\\n\\t if(board[i][j]=='M')\\n\\t {\\n\\t scroll++;\\n\\t }\\n\\t}\\n }\\n for(int i=0;i<route.size();i++)\\n {\\n graph[0][i+1]=solve(startx,starty,route[i].second,route[i].first);\\n graph[i+1][6]=solve(route[i].second,route[i].first,goalx,goaly);\\t\\t\\t\\t\\t \\n for(int j=0;j<route.size();j++)\\n\\t{\\n\\t if(i==j) continue;\\n\\t int stx=route[i].second;\\n\\t int sty=route[i].first;\\n\\t int gox=route[j].second;\\n\\t int goy=route[j].first;\\n\\t graph[i+1][j+1]=solve(stx,sty,gox,goy);\\n\\t //graph[j+1][i+1]=graph[i+1][j+1];\\n\\t}\\n }\\n vector<int> walk(scroll);\\n iota(walk.begin(),walk.end(),1);\\n do\\n {\\n int tmp=0;\\n int prev=0;\\n int to=0;\\n for(auto x:walk) \\n\\t {\\n\\t to=x;\\n\\t tmp+=graph[prev][to];\\n\\t prev=x;\\n\\t }\\n tmp+=graph[to][6];\\n ans=min(ans,tmp);\\n } while(next_permutation(walk.begin(),walk.end()));\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2419_2966989\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define INF 1000000000\\n\\nint di[4] = {0, -1, 0, 1};\\nint dj[4] = {1, 0, -1, 0};\\n\\nvector<int> dijk(int s, int v, vector<vector<pair<int, int> > > adjlist){\\n \\n priority_queue <pair<int, int> > wait;\\n vector<int> result(v, INF);\\n\\n //スタート地点を追加\\n result[s] = 0;\\n wait.push(make_pair(0, s));\\n\\n //ダイクストラ本体\\n while(!wait.empty()){ //waitが空になるまで\\n\\n int nowpoint = wait.top().second;\\n int nowcost = -wait.top().first;\\n wait.pop();\\n\\n if(result[nowpoint] < nowcost) continue;\\n\\n\\n //今いる頂点と隣接しているすべての頂点をなめる\\n for(int i = 0; i < adjlist[nowpoint].size(); i++){\\n\\n int nextpoint = adjlist[nowpoint][i].second;\\n int nextcost = nowcost + adjlist[nowpoint][i].first;\\n //現時点より安く到達できそうであれば、結果を更新して優先度付きキューに格納\\n if(result[nextpoint] > nextcost){\\n result[nextpoint] = nextcost;\\n wait.push(make_pair(-nextcost, nextpoint));\\n }\\n }\\n }\\n \\n return result; //結果列を返す\\n}\\n\\nint main(){\\n\\n int h, w; cin >> w >> h;\\n int si, sj, gi, gj;\\n vector<vector<int> > gold(h + 2, vector<int> (w + 2, 0));\\n vector<vector<int> > canGo(h + 2, vector<int> (w + 2, 0));\\n\\n int cnt = 0;\\n for(int i = 1; i <= h; i++){\\n for(int j = 1; j <= w; j++){\\n char in; cin >> in;\\n if(in == '#'){\\n canGo[i][j] = 4;\\n }else{\\n canGo[i][j] = 1;\\n\\n if(in == 'S'){\\n si = i;\\n sj = j;\\n }\\n\\n if(in == 'G'){\\n gi = i;\\n gj = j;\\n }\\n\\n if(in == 'M'){\\n cnt++;\\n gold[i][j] = cnt;\\n }\\n }\\n }\\n }\\n\\n int Map[110][110][(1 << 5)];\\n\\n int node = 0;\\n for(int i = 1; i <= h; i++){\\n for(int j = 1; j <= w; j++){\\n for(int bit = 0; bit < (1 << 5); bit++){\\n Map[i][j][bit] = node;\\n node++;\\n }\\n }\\n }\\n\\n //cout << cnt << \\\" \\\" << node << endl;\\n\\n for(int i = 1; i <= h; i++){\\n for(int j = 1; j <= w; j++){\\n\\n //あなあなら\\n if(canGo[i][j] == 4){\\n \\n\\n for(int k = i - 2; k <= i + 2; k++){\\n for(int l = j - 2; l <= j + 2; l++){\\n if(k < 1 || h < k || l < 1 || w < l) continue;\\n\\n canGo[k][l] = max(canGo[k][l], 2);\\n }\\n }\\n\\n for(int k = i - 1; k <= i + 1; k++){\\n for(int l = j - 1; l <= j + 1; l++){\\n if(k < 1 || h < k || l < 1 || w < l) continue;\\n\\n canGo[k][l] = max(canGo[k][l], 3);\\n }\\n }\\n }\\n }\\n }\\n\\n vector<vector<pair<int, int> > > adjlist(node);\\n\\n for(int i = 1; i <= h; i++){\\n for(int j = 1; j <= w; j++){\\n for(int bit = 0; bit < (1 << 5); bit++){\\n\\n //アナなら\\n if(canGo[i][j] == 4) continue;\\n\\n int cost = canGo[i][j];\\n int now_node = Map[i][j][bit];\\n\\n for(int h = 0; h < 4; h++){\\n int ni = i + di[h];\\n int nj = j + dj[h];\\n\\n if(canGo[ni][nj] == 4) continue;\\n if(canGo[ni][nj] == 0) continue;\\n\\n int next_bit = bit;\\n if(gold[ni][nj] != 0){\\n int idx = gold[ni][nj] - 1;\\n next_bit = next_bit & (~((1 << idx)));\\n }\\n\\n int next_node = Map[ni][nj][next_bit];\\n\\n adjlist[now_node].push_back(make_pair(cost, next_node));\\n }\\n }\\n }\\n }\\n\\n vector<int> result(node);\\n int S = Map[si][sj][(1 << cnt) - 1];\\n int G = Map[gi][gj][0];\\n result = dijk(S, node, adjlist);\\n cout << result[G] << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 46408,\n \"score_of_the_acc\": -1.2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2419_2966891\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <queue>\\n#include <deque>\\n#include <tuple>\\n#include <iostream>\\nusing namespace std;\\n\\nconst int INF = 1 << 28;\\nint H, W;\\nint sx, sy, gx, gy;\\nint board[110][110], dist[10][10], dp[1 << 10][10], rec[110][110];\\n\\nint nxt[] = {0, 1, 1, 2, 3};\\nint dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};\\nint dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\nint ex[] = {0, 0, 1, -1};\\nint ey[] = {1, -1, 0, 0};\\n\\nvoid get_board(deque< pair<int, int> > holes) {\\n int N = holes.size();\\n\\n for(int i=0; i<N; i++) {\\n int ix = holes[i].first, iy = holes[i].second;\\n queue< pair<int, int> > que;\\n que.push(make_pair(ix, iy));\\n\\n while(que.size()) {\\n int cx, cy; tie(cx, cy) = que.front(); que.pop();\\n for(int k=0; k<8; k++) {\\n int nx = cx + dx[k], ny = cy + dy[k];\\n if(nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\\n if(board[nx][ny] == 4) continue;\\n\\n int cst = nxt[ board[cx][cy] ];\\n if(cst > board[nx][ny]) {\\n board[nx][ny] = cst;\\n que.push(make_pair(nx, ny));\\n }\\n }\\n }\\n }\\n}\\n\\nstruct Elem {\\n int x, y, cost;\\n bool operator<(const Elem &e) const {\\n return cost > e.cost;\\n }\\n};\\n\\nvoid bfs(deque< pair<int, int> > treasures, int id) {\\n fill(rec[0], rec[110], INF);\\n\\n int ix, iy; tie(ix, iy) = treasures[id];\\n priority_queue<Elem> que;\\n rec[ix][iy] = 0;\\n que.push(Elem{ix, iy, 0});\\n\\n while(que.size()) {\\n Elem cur = que.top(); que.pop();\\n int x = cur.x, y = cur.y, cst = cur.cost;\\n\\n for(int k=0; k<4; k++) {\\n int nx = x + ex[k], ny = y + ey[k];\\n if(nx < 0 || nx >= H || ny < 0 || ny >= W) continue;\\n if(board[nx][ny] == INF) continue;\\n\\n int n_cost = cst + max(1, board[x][y]);\\n if(rec[nx][ny] > n_cost) {\\n rec[nx][ny] = n_cost;\\n que.push(Elem{nx, ny, n_cost});\\n }\\n }\\n }\\n\\n int N = treasures.size();\\n for(int i=0; i<N; i++) {\\n int tx, ty; tie(tx, ty) = treasures[i];\\n // printf(\\\"tx = %d, ty = %d, cost = %d\\\\n\\\", tx, ty, rec[tx][ty]);\\n dist[id][i] = rec[tx][ty];\\n }\\n}\\n\\nint main() {\\n cin >> W >> H;\\n\\n deque< pair<int, int> > holes, treasures;\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n char c; cin >> c;\\n if(c == 'S') {\\n sx = i, sy = j;\\n }\\n else if(c == 'G') {\\n gx = i, gy = j;\\n }\\n else if(c == '#') {\\n holes.push_back(make_pair(i, j));\\n board[i][j] = 4;\\n }\\n else if(c == 'M') {\\n treasures.push_back(make_pair(i, j));\\n }\\n }\\n }\\n\\n get_board(holes);\\n for(int i=0; i<holes.size(); i++) {\\n int x, y; tie(x, y) = holes[i];\\n board[x][y] = INF;\\n }\\n\\n\\n /*\\n // debug\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n cout << board[i][j];\\n }\\n cout << endl;\\n }\\n */\\n \\n \\n int N = treasures.size();\\n int si = 0, gi = N + 1;\\n treasures.push_front(make_pair(sx, sy));\\n treasures.push_back (make_pair(gx, gy));\\n N += 2;\\n \\n for(int i=0; i<N; i++) {\\n bfs(treasures, i);\\n }\\n\\n /*\\n // debug\\n for(int i=0; i<N; i++) {\\n for(int j=0; j<N; j++) {\\n cout << dist[i][j] << \\\" \\\";\\n }\\n cout << endl;\\n }\\n */\\n\\n int fullbit = (1<<N) - 1;\\n\\n fill(dp[0], dp[1 << 10], INF);\\n dp[1][0] = 0;\\n for(int bit=0; bit<(1<<N); bit++) {\\n for(int i=0; i<N; i++) {\\n for(int k=0; k<N; k++) {\\n if(!(bit >> i & 1)) continue;\\n if(bit >> k & 1) continue;\\n int nbit = bit | (1 << k);\\n // if(k == N-1 && nbit != fullbit) continue;\\n\\n int cost = dist[i][k];\\n dp[nbit][k] = min(dp[nbit][k], dp[bit][i] + cost);\\n }\\n }\\n }\\n\\n int ans = dp[fullbit][N-1];\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.0004,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2419_2966831\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint W, H, cost[102][102], N, hx[5], hy[5], sx, sy, gx, gy;\\nstring grid[102];\\n\\nconst int dx[4] = {0,1,0,-1}, Dx[8] = {0,1,1,1,0,-1,-1,-1};\\nconst int dy[4] = {1,0,-1,0}, Dy[8] = {1,1,0,-1,-1,-1,0,1};\\nbool in_range(int x, int y) { return 0 <= x && x < W && 0 <= y && y < H; }\\n\\nvoid pre() {\\n\\tmemset(cost, -1, sizeof(cost));\\n\\t\\n\\tN = 0;\\n\\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\\n\\t\\tif (grid[y][x] == '#') cost[y][x] = 100;\\n\\t\\tif (grid[y][x] == 'M') {\\n\\t\\t\\thx[N] = x;\\n\\t\\t\\thy[N] = y;\\n\\t\\t\\t++N;\\n\\t\\t}\\n\\t\\tif (grid[y][x] == 'S') sx = x, sy = y;\\n\\t\\tif (grid[y][x] == 'G') gx = x, gy = y;\\n\\t}\\n\\t\\n\\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\\n\\t\\tif (cost[y][x] < 0) {\\n\\t\\t\\tbool hole_flag = false;\\n\\t\\t\\tfor (int d=0; d<8; ++d) {\\n\\t\\t\\t\\tint nx = x + Dx[d], ny = y + Dy[d];\\n\\t\\t\\t\\tif (!in_range(nx, ny)) continue;\\n\\t\\t\\t\\thole_flag |= (grid[ny][nx] == '#');\\n\\t\\t\\t}\\n\\t\\t\\tif (hole_flag) cost[y][x] = 3;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) {\\n\\t\\tif (cost[y][x] < 0) {\\n\\t\\t\\tint max_c = -1;\\n\\t\\t\\tfor (int d=0; d<8; ++d) {\\n\\t\\t\\t\\tint nx = x + Dx[d], ny = y + Dy[d];\\n\\t\\t\\t\\tif (!in_range(nx, ny)) continue;\\n\\t\\t\\t\\tmax_c = max(max_c, cost[ny][nx]);\\n\\t\\t\\t}\\n\\t\\t\\tcost[y][x] = max_c - 1;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor (int y=0; y<H; ++y) for (int x=0; x<W; ++x) if (cost[y][x] <= 0) cost[y][x] = 1;\\n}\\n\\n\\t\\nstruct State {\\n\\tint x, y, c;\\n\\tbool operator > (const State& s) const { return c > s.c; }\\n};\\n\\nint dst[102][102];\\n\\nint dijkstra(int ax, int ay, int bx, int by) {\\n\\tmemset(dst, -1, sizeof(dst));\\n\\t\\n\\tpriority_queue< State, vector< State >, greater< State > > que;\\n\\tque.push(State{ax, ay, 0});\\n\\tdst[ay][ax] = 0;\\n\\t\\n\\twhile (!que.empty()) {\\n\\t\\tState s = que.top(); que.pop();\\n\\t\\tif (dst[s.y][s.x] < s.c) continue;\\n\\t\\tfor (int d=0; d<4; ++d) {\\n\\t\\t\\tint nx = s.x + dx[d], ny = s.y + dy[d], nc = s.c + cost[s.y][s.x];\\n\\t\\t\\tif (!in_range(nx, ny)) continue;\\n\\t\\t\\tif (grid[ny][nx] == '#') continue;\\n\\t\\t\\tif (dst[ny][nx] == -1 || dst[ny][nx] > nc) {\\n\\t\\t\\t\\tdst[ny][nx] = nc;\\n\\t\\t\\t\\tque.push(State{nx, ny, nc});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn dst[by][bx];\\n}\\n\\nint main() {\\n\\tcin >> W >> H;\\n\\tfor (int y=0; y<H; ++y) cin >> grid[y];\\n\\t\\n\\tpre();\\n\\t\\n\\tvector< int > order;\\n\\tfor (int i=0; i<N; ++i) order.push_back(i);\\n\\t\\n\\tint ans = 1L << 30;\\n\\tdo {\\n\\t\\tint sum = dijkstra(sx, sy, hx[order[0]], hy[order[0]]);\\n\\t\\tfor (int i=0; i<N-1; ++i) {\\n\\t\\t\\tint a = order[i], b = order[i+1];\\n\\t\\t\\tsum += dijkstra(hx[a], hy[a], hx[b], hy[b]);\\n\\t\\t}\\n\\t\\tsum += dijkstra(hx[order[N-1]], hy[order[N-1]], gx, gy);\\n\\t\\tans = min(ans, sum);\\n\\t} while (next_permutation(order.begin(), order.end()));\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -1.0008,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2419_2741163\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n \\nusing namespace std;\\n \\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n \\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n \\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx3[4] = {1, 0, -1, 0};\\nint dy3[4] = {0, 1, 0, -1};\\nint dx[8] = {1, 0, -1, -1, -1, 0, 1, 1};\\nint dy[8] = {-1, -1, -1, 0, 1, 1, 1, 0};\\nint dx2[16] = {0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1};\\nint dy2[16] = {2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, 0, 1, 2, 2};\\nstruct state{\\n int x, y, S;\\n int c;\\n state() {}\\n state(int x, int y, int S, int c) : x(x), y(y), S(S), c(c) {}\\n bool operator < (const state& s) const {\\n return c > s.c; //rev\\n }\\n};\\n \\nint main(){\\n int W, H;\\n while(cin>>W>>H && (W||H)){\\n vector<string> grid(H);\\n REP(y, H) cin>>grid[y];\\n int cnt = 0;\\n REP(y, H)REP(x, W)if(grid[y][x] == 'M'){\\n grid[y][x] = cnt + '0';\\n cnt++;\\n }\\n const int goalS = (1<<cnt) - 1;\\n int move[100][100] = {};\\n REP(y, H)REP(x, W) move[y][x] = 1;\\n REP(y, H)REP(x, W){\\n if(grid[y][x] == '#'){\\n REP(r, 8){\\n int nx = x + dx[r], ny = y + dy[r];\\n if(nx >= 0 && ny >= 0 && nx < W && ny < H){\\n move[ny][nx] = 3;\\n }\\n }\\n REP(r, 16){\\n int nx = x + dx2[r], ny = y + dy2[r];\\n if(nx >= 0 && ny >= 0 && nx < W && ny < H){\\n move[ny][nx] = max(move[ny][nx], 2);\\n }\\n }\\n }\\n }\\n int dist[1<<5][100][100];\\n priority_queue<state> que;\\n REP(y, H)REP(x, W)REP(i, 1<<5)dist[i][y][x] = INF;\\n REP(y, H)REP(x, W)if(grid[y][x] == 'S'){\\n dist[0][y][x] = 0;\\n que.push(state(x, y, 0, 0));\\n }\\n int ans = INF;\\n while(!que.empty()){\\n state s = que.top(); que.pop();\\n if(s.S == goalS && grid[s.y][s.x] == 'G'){\\n ans = s.c;\\n break;\\n }\\n REP(r, 4){\\n int nx = s.x + dx3[r];\\n int ny = s.y + dy3[r];\\n if(!(nx >= 0 && ny >= 0 && nx < W && ny < H)) continue;\\n if(grid[ny][nx] == '#') continue;\\n int nc = s.c + move[s.y][s.x];\\n int nS = s.S;\\n if(grid[ny][nx] <= '5' && grid[ny][nx] >= '0'){\\n nS = nS | (1<<(grid[ny][nx]-'0'));\\n }\\n if(dist[nS][ny][nx] > nc){\\n dist[nS][ny][nx] = nc;\\n que.push(state(nx, ny, nS, nc));\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4504,\n \"score_of_the_acc\": -0.0534,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2419_2661163\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nstruct aa {\\n\\tint x;\\n\\tint y;\\n\\tbitset<5>gets;\\n\\tint cost;\\n};\\nclass Compare {\\npublic:\\n\\tbool operator()(const aa&l, const aa&r) {\\n\\t\\treturn l.cost>r.cost;\\n\\t}\\n};\\n\\nint main() {\\n\\tint H,W;cin>>W>>H;\\n\\tvector<vector<int>>field(H,vector<int>(W,1));\\n\\tvector<pair<int,int>>makis;\\n\\tint sx, sy, gx, gy;\\n\\t{\\n\\t\\tvector<pair<int, int>>holes;\\n\\t\\tfor (int i = 0; i < H; ++i) {\\n\\t\\t\\tstring st; cin >> st;\\n\\t\\t\\tfor (int j = 0; j < W; ++j) {\\n\\t\\t\\t\\tchar ch(st[j]);\\n\\t\\t\\t\\tif (ch == 'S') {\\n\\t\\t\\t\\t\\tsx = j;\\n\\t\\t\\t\\t\\tsy = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ch == 'G') {\\n\\t\\t\\t\\t\\tgx = j;\\n\\t\\t\\t\\t\\tgy = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ch == '#') {\\n\\t\\t\\t\\t\\tholes.push_back(make_pair(j, i));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (ch == 'M') {\\n\\t\\t\\t\\t\\tmakis.push_back(make_pair(j,i));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (auto hole : holes) {\\n\\t\\t\\tfor (int y = 0; y < H; ++y) {\\n\\t\\t\\t\\tfor (int x = 0; x < W; ++x) {\\n\\t\\t\\t\\t\\tint x_dis = abs(x - hole.first);\\n\\t\\t\\t\\t\\tint y_dis = abs(y - hole.second);\\n\\t\\t\\t\\t\\tint dis = max(x_dis, y_dis);\\n\\t\\t\\t\\t\\tif (dis == 0) {\\n\\t\\t\\t\\t\\t\\tfield[y][x] = max(field[y][x],10000);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (dis <= 3) {\\n\\t\\t\\t\\t\\t\\tfield[y][x] =max(field[y][x],4-dis);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tpriority_queue<aa,vector<aa>,Compare>que;\\n\\n\\tque.push(aa{ sx,sy,bitset<5>(),0 });\\n\\tvector<vector<vector<int>>>memo(W,vector<vector<int>>(H,vector<int>(32,1e9)));\\n\\tmemo[sx][sy][0]=0;\\n\\tint dx[4] = { -1,0,1,0 };\\n\\tint dy[4] = { 0,1,0,-1 };\\n\\tint ans=-1;\\n\\twhile (!que.empty()) {\\n\\t\\tauto atop(que.top());\\n\\t\\tconst int now_x=atop.x;\\n\\t\\tconst int now_y=atop.y;\\n\\t\\tconst bitset<5>gets(atop.gets);\\n\\t\\tconst int now_cost=atop.cost;\\n\\n\\t\\tif (now_x == gx&&now_y == gy&&gets.count() == makis.size()) {\\n\\t\\t\\tans=now_cost;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tque.pop();\\n\\t\\tfor (int way = 0; way < 4; ++way) {\\n\\t\\t\\tconst int next_x=now_x+dx[way];\\n\\t\\t\\tconst int next_y=now_y+dy[way];\\n\\n\\t\\t\\tif (0 <= next_x&&next_x < W&&next_y < H && 0 <= next_y) {\\n\\t\\t\\t\\tconst int next_cost=now_cost+field[now_y][now_x];\\n\\t\\t\\t\\tauto next_gets(gets);\\n\\t\\t\\t\\tfor (int i = 0; i < makis.size(); ++i) {\\n\\t\\t\\t\\t\\tif (next_x == makis[i].first&&next_y == makis[i].second) {\\n\\t\\t\\t\\t\\t\\tnext_gets[i]=true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (memo[next_x][next_y][next_gets.to_ulong()] > next_cost) {\\n\\t\\t\\t\\t\\tmemo[next_x][next_y][next_gets.to_ulong()]=next_cost;\\n\\t\\t\\t\\t\\tque.push(aa{ next_x,next_y,next_gets,next_cost });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\t\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5576,\n \"score_of_the_acc\": -0.1532,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2419_2542647\",\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>\\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\\nstruct Hole{\\n\\tint row,col;\\n};\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col,int arg_state,int arg_total_cost){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tstate = arg_state;\\n\\t\\ttotal_cost = arg_total_cost;\\n\\t}\\n\\n\\tint row,col,state,total_cost;\\n};\\n\\nint H,W;\\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\\n\\nbool rangeCheck(int row,int col){\\n\\tif(row >= 0 && row <= H-1 && col >= 0 && col <= W-1)return true;\\n\\telse{\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tint POW[6];\\n\\n\\tfor(int i = 0; i < 6; i++)POW[i] = pow(2,i);\\n\\n\\tscanf(\\\"%d %d\\\",&W,&H);\\n\\n\\tchar map[H][W+1];\\n\\n\\tint hole_num = 0;\\n\\tHole hole[10000];\\n\\n\\tint makimono_num = 0;\\n\\n\\tint start_row,start_col,goal_row,goal_col;\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tscanf(\\\"%s\\\",map[i]);\\n\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\tswitch(map[i][k]){\\n\\t\\t\\tcase 'S':\\n\\t\\t\\t\\tstart_row = i;\\n\\t\\t\\t\\tstart_col = k;\\n\\t\\t\\t\\tmap[i][k] = '.';\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'G':\\n\\t\\t\\t\\tgoal_row = i;\\n\\t\\t\\t\\tgoal_col = k;\\n\\t\\t\\t\\tmap[i][k] = '.';\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 'M':\\n\\t\\t\\t\\tmap[i][k] = '0' + makimono_num;\\n\\t\\t\\t\\tmakimono_num++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '#':\\n\\t\\t\\t\\thole[hole_num].row = i;\\n\\t\\t\\t\\thole[hole_num].col = k;\\n\\t\\t\\t\\thole_num++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint move_cost[H][W];\\n\\n\\tfor(int i = 0; i < H; i++){\\n\\t\\tfor(int k = 0; k < W; k++)move_cost[i][k] = 1;\\n\\t}\\n\\n\\tfor(int i = 0; i < hole_num; i++){\\n\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\t\\tif(map[row][col] == '#')continue;\\n\\t\\t\\t\\tmove_cost[row][col] = max(move_cost[row][col],4-max(abs(hole[i].row-row),abs(hole[i].col-col)));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint limit = POW[makimono_num];\\n\\n\\tint dp[H][W][limit];\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tfor(int state = 0; state < limit; state++)dp[row][col][state] = BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tqueue<Info> Q;\\n\\n\\tQ.push(Info(start_row,start_col,0,0));\\n\\n\\tint next_row,next_col,next_state;\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tif(Q.front().state == limit-1 && Q.front().row == goal_row && Q.front().col == goal_col){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else if(Q.front().total_cost > dp[Q.front().row][Q.front().col][Q.front().state]){\\n\\t\\t\\tQ.pop();\\n\\t\\t}else{\\n\\t\\t\\tfor(int i = 0; i < 4; i++){\\n\\t\\t\\t\\tnext_row = Q.front().row + diff_row[i];\\n\\t\\t\\t\\tnext_col = Q.front().col + diff_col[i];\\n\\n\\t\\t\\t\\tif(rangeCheck(next_row,next_col) == false || map[next_row][next_col] == '#')continue;\\n\\n\\t\\t\\t\\tnext_state = Q.front().state;\\n\\t\\t\\t\\tif(map[next_row][next_col] >= '0' && map[next_row][next_col] <= '4'){\\n\\t\\t\\t\\t\\tif(!(Q.front().state & (1 << (map[next_row][next_col]-'0')))){\\n\\t\\t\\t\\t\\t\\tnext_state += POW[map[next_row][next_col]-'0'];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(dp[next_row][next_col][next_state] > Q.front().total_cost+move_cost[Q.front().row][Q.front().col]){\\n\\t\\t\\t\\t\\tdp[next_row][next_col][next_state] = Q.front().total_cost+move_cost[Q.front().row][Q.front().col];\\n\\t\\t\\t\\t\\tQ.push(Info(next_row,next_col,next_state,dp[next_row][next_col][next_state]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tQ.pop();\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",dp[goal_row][goal_col][limit-1]);\\n\\n\\treturn 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4776,\n \"score_of_the_acc\": -0.1347,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2419_2359811\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\n#define INF 1<<25\\nusing namespace std;\\nstring s[101];\\ntypedef pair<int,int> P;\\nint w,h,a[101][101],sx,sy,gx,gy;\\nint dx[]={1,-1,0,0};\\nint dy[]={0,0,1,-1};\\nint dx1[]={1,1,1,0,0,-1,-1,-1};\\nint dy1[]={1,0,-1,1,-1,1,0,-1};\\nint dx2[]={2,2,2,2,2,1,1,0,0,-1,-1,-2,-2,-2,-2,-2};\\nint dy2[]={2,1,0,-1,-2,2,-2,2,-2,2,-2,2,1,0,-1,-2};\\nvector<P>G[10001];\\nvector<int>maki;\\nvoid make_map(int y,int x){\\n a[y][x]=INF;\\n r(i,8){\\n int xx=x+dx1[i];\\n int yy=y+dy1[i];\\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\\n if(a[yy][xx]<3)a[yy][xx]=3;\\n }\\n r(i,16){\\n int xx=x+dx2[i];\\n int yy=y+dy2[i];\\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\\n if(a[yy][xx]<2)a[yy][xx]=2;\\n }\\n}\\nint d[10001];\\nvoid dijkstra(int s){\\n priority_queue<P,vector<P>,greater<P> >que;\\n fill(d,d+10001,INF);\\n d[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(d[v]<p.first)continue;\\n for(int i=0;i<G[v].size();i++){\\n P e=G[v][i];\\n if(d[e.first]>d[v]+e.second){\\n d[e.first]=d[v]+e.second;\\n que.push(P(d[e.first],e.first));\\n }\\n }\\n }\\n}\\nint ans=INF,used[101]={},koko;\\nint dis[101][101];\\nvoid dfs(int depth,int dista,int cur){\\n if(depth==koko-1){\\n //cout<<dista<<endl;\\n ans=min(ans,dista);\\n return;\\n }\\n if(depth<koko-2){\\n for(int i=1;i<koko-1;i++)\\n if(!used[i]){\\n used[i]=1;\\n dfs(depth+1,dista+dis[cur][i],i);\\n used[i]=0;\\n }\\n }\\n else{\\n used[cur]=1;\\n dfs(depth+1,dista+dis[cur][koko-1],cur);\\n used[cur]=0;\\n }\\n}\\nmain(){\\n r(i,101)r(j,101)a[i][j]=1;\\n cin>>w>>h;\\n r(i,h)cin>>s[i];\\n r(i,h)r(j,w){\\n if(s[i][j]=='#')make_map(i,j);\\n if(s[i][j]=='S')sx=i*w+j;\\n if(s[i][j]=='G')gx=i*w+j;\\n if(s[i][j]=='M')maki.push_back(i*w+j);\\n }\\n r(i,h)r(j,w)r(k,4){\\n int xx=j+dx[k];\\n int yy=i+dy[k];\\n if(xx<0||yy<0||yy>=h||xx>=w)continue;\\n if(k==0)G[i*w+j].push_back(P(i*w+j+1,a[i][j]));\\n if(k==1)G[i*w+j].push_back(P(i*w+j-1,a[i][j]));\\n if(k==2)G[i*w+j].push_back(P(i*w+w+j,a[i][j]));\\n if(k==3)G[i*w+j].push_back(P(i*w-w+j,a[i][j]));\\n }\\n int num=maki.size()+2;\\n vector<int>ps;\\n ps.push_back(sx);\\n r(i,maki.size())ps.push_back(maki[i]);\\n ps.push_back(gx);\\n r(i,num){\\n dijkstra(ps[i]);\\n r(j,num)dis[i][j]=d[ps[j]];\\n }\\n koko=num;\\n used[0]=1;\\n dfs(0,0,0);\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3944,\n \"score_of_the_acc\": -0.0154,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2419_2198483\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define all(v) begin(v), end(v)\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)\\n#define min(...) min({__VA_ARGS__})\\n#define max(...) max({__VA_ARGS__})\\n\\ntemplate<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;}\\ntemplate<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;}\\n\\nusing pint = pair<int, int>;\\nusing tint = tuple<int, int, int>;\\nusing vint = vector<int>;\\n\\nconst int inf = 1LL << 55;\\nconst int mod = 1e9 + 7;\\n\\nsigned main()\\n{\\n cin.tie(0);\\n ios_base::sync_with_stdio(0);\\n cout << fixed << setprecision(12);\\n\\n int H, W;\\n char mas[101][101];\\n int sy, sx, gy, gx;\\n int delay[101][101] = {{}};\\n int maki = 0;\\n map<pint, int> mp;\\n\\n auto in = [&](int y, int x) -> bool {\\n return 0 <= y && y < H && 0 <= x && x < W;\\n };\\n\\n cin >> W >> H;\\n rep(i, H) rep(j, W) {\\n cin >> mas[i][j];\\n chmax(delay[i][j], 1);\\n if(mas[i][j] == 'S') sy = i, sx = j;\\n else if(mas[i][j] == 'G') gy = i, gx = j;\\n else if(mas[i][j] == 'M') mp[make_pair(i, j)] = maki++;\\n else if(mas[i][j] == '#') {\\n delay[i][j] = inf;\\n reps(k, 1, 4) {\\n\\treps(l, -4+k, 4-k+1) {\\n\\t if(in(i-4+k, j+l)) chmax(delay[i-4+k][j+l], k);\\n\\t if(in(i+4-k, j+l)) chmax(delay[i+4-k][j+l], k);\\n\\t if(in(i+l, j-4+k)) chmax(delay[i+l][j-4+k], k);\\n\\t if(in(i+l, j+4-k)) chmax(delay[i+l][j+4-k], k);\\n\\t}\\n }\\n }\\n }\\n\\n struct state {\\n int y, x, bit, dist;\\n state(int y = 0, int x = 0, int bit = 0, int dist = 0)\\n :y(y), x(x), bit(bit), dist(dist){}\\n bool operator < (const state& s) const {\\n return dist > s.dist;\\n }\\n };\\n\\n priority_queue<state> que;\\n int d[101][101][1<<5];\\n int dy[] = {1, 0, -1, 0};\\n int dx[] = {0, 1, 0, -1};\\n\\n que.emplace(sy, sx, 0, 0);\\n rep(i, 101) rep(j, 101) rep(k, 1<<5) d[i][j][k] = inf;\\n d[sy][sx][0] = 0;\\n while(que.size()) {\\n state st = que.top(); que.pop();\\n int y = st.y, x = st.x, bit = st.bit, dist = st.dist;\\n if(y == gy && x == gx && bit == (1<<maki)-1) {\\n cout << dist << endl;\\n return 0;\\n }\\n if(d[y][x][bit] < dist) continue;\\n rep(i, 4) {\\n int ny = y + dy[i], nx = x + dx[i], nbit = bit;\\n if(!in(ny, nx) || mas[ny][nx] == '#') continue;\\n if(mas[ny][nx] == 'M') nbit |= 1<<(mp[make_pair(ny, nx)]);\\n if(dist + delay[y][x] < d[ny][nx][nbit]) {\\n\\td[ny][nx][nbit] = dist + delay[y][x];\\n\\tque.emplace(ny, nx, nbit, d[ny][nx][nbit]);\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5868,\n \"score_of_the_acc\": -0.11,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2419_2197863\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define f first \\n#define s second \\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<P,P> PP;\\nint w,h,c=1,sx,sy,gx,gy;\\nchar mp[101][101];\\nint bt[101][101];\\nint cs[101][101];\\nint nn[5][5]=\\n {{2,2,2,2,2},\\n {2,3,3,3,2},\\n {2,3,1e8,3,2},\\n {2,3,3,3,2},\\n {2,2,2,2,2}\\n };\\nint used[100][101][101];\\n \\nvoid nu(int x,int y){\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++){\\n int nx=x+j-2,ny=y+i-2;\\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\\n cs[ny][nx]=max(nn[i][j],cs[ny][nx]);\\n }\\n}\\n \\nint cal(){\\n priority_queue<PP,vector<PP>,greater<PP> > Q;\\n Q.push(PP(P(0,0),P(sx,sy)));\\n int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\\n while(!Q.empty()){\\n PP p=Q.top();\\n Q.pop();\\n if(p.s.f==gx&&p.s.s==gy&&p.f.s==c-1)return p.f.f;\\n if(used[p.f.s][p.s.s][p.s.f]==1)continue;\\n used[p.f.s][p.s.s][p.s.f]=1;\\n for(int i=0;i<4;i++){\\n int nx=p.s.f+dx[i],ny=p.s.s+dy[i];\\n int ncs=p.f.f+cs[p.s.s][p.s.f],nbt=p.f.s|bt[p.s.s][p.s.f];\\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\\n Q.push(PP(P(ncs,nbt),P(nx,ny)));\\n }\\n }\\n}\\n \\n \\nint main(){\\n cin>>w>>h;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n cin>>mp[i][j];\\n cs[i][j]=max(1,cs[i][j]);\\n if(mp[i][j]=='M')bt[i][j]=c,c*=2;\\n if(mp[i][j]=='#')nu(j,i);\\n if(mp[i][j]=='S')sx=j,sy=i;\\n if(mp[i][j]=='G')gx=j,gy=i;\\n }\\n cout<<cal()<<endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 8312,\n \"score_of_the_acc\": -0.4917,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2419_2196963\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<P,P> PP;\\nint dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\\nbool check(int n,int m,int x,int y) {return x>=0&&x<n&&y>=0&&y<m;}\\n \\nint a[111][111],d[55][111][111];\\nmap<P,int> ma;\\nint main() {\\n int n,m;\\n cin >> m >> n;\\n string s[n];\\n for(int i=0; i<n; i++) cin >> s[i];\\n priority_queue<PP,vector<PP>,greater<PP> > que;\\n for(int i=0; i<n; i++) {\\n for(int j=0; j<m; j++) {\\n a[i][j]=1;\\n for(int k=0; k<(1<<5); k++) d[k][i][j]=1<<29;\\n if(s[i][j]=='S') {\\n d[0][i][j]=0;\\n que.push(PP(P(0,0),P(i,j)));\\n }\\n if(s[i][j]=='M') {\\n int k=ma.size();\\n ma[P(i,j)]=k;\\n }\\n for(int k=-2; k<=2; k++) {\\n for(int l=-2; l<=2; l++) {\\n int x=i+k,y=j+l;\\n if(!check(n,m,x,y)||s[x][y]!='#') continue;\\n int d=max(abs(i-x),abs(j-y));\\n if(d==1) a[i][j]=max(a[i][j],3);\\n if(d==2) a[i][j]=max(a[i][j],2);\\n }\\n }\\n }\\n }\\n while(!que.empty()) {\\n PP p=que.top();que.pop();\\n int xx=p.second.first,yy=p.second.second,cc=p.first.first,tt=p.first.second;\\n if(s[xx][yy]=='G'&&tt==(1<<ma.size())-1) {\\n cout << d[tt][xx][yy] << endl;\\n return 0;\\n }\\n if(d[tt][xx][yy]<cc) continue;\\n for(int i=0; i<4; i++) {\\n int x=xx+dx[i],y=yy+dy[i];\\n int t=tt;\\n if(!check(n,m,x,y)||s[x][y]=='#') continue;\\n if(s[x][y]=='M') t|=1<<ma[P(x,y)];\\n if(d[t][x][y]<=d[tt][xx][yy]+a[xx][yy]) continue;\\n d[t][x][y]=d[tt][xx][yy]+a[xx][yy];\\n que.push(PP(P(d[t][x][y],t),P(x,y)));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4840,\n \"score_of_the_acc\": -0.1362,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2419_2196818\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint sp[111][111];\\nint dp[111][111][1<<5];\\nint w,h;\\nint in(int y,int x){\\n return 0<=y&&y<h&&0<=x&&x<w;\\n}\\nstruct sta{\\n int y,x,b,d;\\n sta(){}\\n sta(int y,int x,int b,int d):y(y),x(x),b(b),d(d){}\\n bool operator<(const sta& a) const{\\n return d>a.d;\\n }\\n};\\ntypedef pair<int,int> P;\\nint main(){\\n memset(sp,0,sizeof(sp));\\n memset(dp,-1,sizeof(dp));\\n cin>>w>>h;\\n string st[h];\\n for(int i=0;i<h;i++) cin>>st[i];\\n int sy,sx,gy,gx,n=0;\\n map<P,int> m;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n sp[i][j]=max(sp[i][j],1);\\n if(st[i][j]=='M') m[P(i,j)]=n++;\\n if(st[i][j]=='S') sy=i,sx=j;\\n if(st[i][j]=='G') gy=i,gx=j;\\n if(st[i][j]=='#'){\\n for(int k=1;k<=3;k++){\\n for(int a=-(4-k);a<=4-k;a++){\\n if(in(i-(4-k),j+a)) sp[i-(4-k)][j+a]=max(sp[i-(4-k)][j+a],k);\\n if(in(i+(4-k),j+a)) sp[i+(4-k)][j+a]=max(sp[i+(4-k)][j+a],k);\\n if(in(i+a,j-(4-k))) sp[i+a][j-(4-k)]=max(sp[i+a][j-(4-k)],k);\\n if(in(i+a,j+(4-k))) sp[i+a][j+(4-k)]=max(sp[i+a][j+(4-k)],k);\\n }\\n }\\n }\\n }\\n }\\n /*//\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cout<<sp[i][j];\\n }\\n cout<<endl;\\n }\\n //*/\\n priority_queue<sta> q;\\n q.push(sta(sy,sx,0,0));\\n dp[sy][sx][0]=0;\\n int ax[]={1,-1,0,0};\\n int ay[]={0,0,1,-1};\\n while(!q.empty()){\\n sta s=q.top();q.pop();\\n if(dp[s.y][s.x][s.b]<s.d) continue;\\n //cout<<s.y<<\\\" \\\"<<s.x<<\\\" \\\"<<s.b<<\\\" \\\"<<s.d<<endl;\\n for(int k=0;k<4;k++){\\n int ny=s.y+ay[k],nx=s.x+ax[k],nb=s.b,nd=s.d+sp[s.y][s.x];\\n if(!in(ny,nx)) continue;\\n if(st[ny][nx]=='#') continue;\\n if(m.count(P(ny,nx))) nb|=1<<m[P(ny,nx)];\\n if(dp[ny][nx][nb]<0||dp[ny][nx][nb]>nd){\\n dp[ny][nx][nb]=nd;\\n q.push(sta(ny,nx,nb,nd));\\n }\\n }\\n }\\n cout<<dp[gy][gx][(1<<n)-1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4884,\n \"score_of_the_acc\": -0.0872,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2419_2196610\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 101\\n#define INF 1e9\\nusing namespace std;\\nstring mp[N];\\nint D[101][101][1<<5];\\nint used[101][101];\\ntypedef pair<int,int> P;\\ntypedef pair<P,P> PP;\\nint dx[] ={0,0,1,-1};\\nint dy[] ={1,-1,0,0};\\nint w,h;\\n\\nvoid bfs(){\\n memset(used,-1,sizeof(used));\\n queue<P> Q;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)if(mp[i][j]=='#')Q.push(P(i,j)),used[i][j] = 0;\\n \\n while(!Q.empty()){\\n P t = Q.front();Q.pop();\\n int y = t.first;\\n int x = t.second;\\n for(int i=-1;i<=1;i++)\\n for(int j=-1;j<=1;j++){\\n\\tif(i==0&&j==0)continue;\\n\\tint nx = x+i;\\n\\tint ny = y+j;\\n\\tif(nx<0||ny<0||nx>=w||ny>=h||used[ny][nx]!=-1)continue;\\n\\tused[ny][nx] = used[y][x] + 1;\\n\\tQ.push(P(ny,nx));\\n }\\n }\\n\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)if(used[i][j] == -1) used[i][j]=INF;\\n \\n} \\n\\n\\nint visited[N][N][1<<5];\\nint dijkstra(int sy,int sx){\\n map<P,int> M;\\n int cnt=0;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)if(mp[i][j] == 'M') M[P(i,j)] = cnt++;\\n \\n for(int i=0;i<101;i++)\\n for(int j=0;j<101;j++)\\n for(int k=0;k<(1<<5);k++) D[i][j][k] = INF;\\n \\n priority_queue<PP,vector<PP>,greater<PP> >Q; \\n Q.push(PP(P(0,sy),P(sx,0)));\\n D[sy][sx][0] = 0;\\n \\n while(!Q.empty()){\\n PP t = Q.top();Q.pop();\\n int cost = t.first.first;\\n int y = t.first.second;\\n int x = t.second.first;\\n int bit = t.second.second;\\n if(mp[y][x] =='G' && bit==(1<<cnt)-1)return cost;\\n if(D[y][x][bit]<cost||visited[y][x][bit]++) continue;\\n \\n for(int i=0;i<4;i++){\\n int nx = x+dx[i];\\n int ny = y+dy[i];\\n int nbit = bit;\\n int ncost = cost+max(1,4-used[y][x]);\\n if(nx<0||ny<0||nx>=w||ny>=h||mp[ny][nx] == '#')continue;\\n if(D[ny][nx][nbit]<=ncost||visited[ny][nx][nbit])continue;\\n if(mp[ny][nx] == 'M') nbit |= 1<<(M[P(ny,nx)]); \\n Q.push(PP(P(ncost,ny),P(nx,nbit)));\\n D[ny][nx][nbit] = ncost;\\n }\\n }\\n assert(0);\\n}\\n\\n\\nint main(){\\n\\n cin>>w>>h;\\n for(int i=0;i<h;i++) cin>>mp[i];\\n\\n bfs();\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n if(mp[i][j] == 'S') cout<<dijkstra(i,j)<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5764,\n \"score_of_the_acc\": -0.1076,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2419_2196586\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define f first \\n#define s second \\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<P,P> PP;\\nint w,h,c=1,sx,sy,gx,gy;\\nchar mp[101][101];\\nint bt[101][101];\\nint cs[101][101];\\nint nn[5][5]=\\n {{2,2,2,2,2},\\n {2,3,3,3,2},\\n {2,3,1e8,3,2},\\n {2,3,3,3,2},\\n {2,2,2,2,2}\\n };\\nint used[100][101][101];\\n\\nvoid nu(int x,int y){\\n for(int i=0;i<5;i++)\\n for(int j=0;j<5;j++){\\n int nx=x+j-2,ny=y+i-2;\\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\\n cs[ny][nx]=max(nn[i][j],cs[ny][nx]);\\n }\\n}\\n\\nint cal(){\\n priority_queue<PP,vector<PP>,greater<PP> > Q;\\n Q.push(PP(P(0,0),P(sx,sy)));\\n int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};\\n while(!Q.empty()){\\n PP p=Q.top();\\n Q.pop();\\n if(p.s.f==gx&&p.s.s==gy&&p.f.s==c-1)return p.f.f;\\n if(used[p.f.s][p.s.s][p.s.f]==1)continue;\\n used[p.f.s][p.s.s][p.s.f]=1;\\n for(int i=0;i<4;i++){\\n int nx=p.s.f+dx[i],ny=p.s.s+dy[i];\\n int ncs=p.f.f+cs[p.s.s][p.s.f],nbt=p.f.s|bt[p.s.s][p.s.f];\\n if(nx<0||w<=nx||ny<0||h<=ny)continue;\\n Q.push(PP(P(ncs,nbt),P(nx,ny)));\\n }\\n }\\n}\\n\\n\\nint main(){\\n cin>>w>>h;\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++){\\n cin>>mp[i][j];\\n cs[i][j]=max(1,cs[i][j]);\\n if(mp[i][j]=='M')bt[i][j]=c,c*=2;\\n if(mp[i][j]=='#')nu(j,i);\\n if(mp[i][j]=='S')sx=j,sy=i;\\n if(mp[i][j]=='G')gx=j,gy=i;\\n }\\n cout<<cal()<<endl; \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 8312,\n \"score_of_the_acc\": -0.4667,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2419_2196568\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint sp[111][111];\\nint dp[111][111][1<<5];\\nint w,h;\\nint in(int y,int x){\\n return 0<=y&&y<h&&0<=x&&x<w;\\n}\\nstruct sta{\\n int y,x,b,d;\\n sta(){}\\n sta(int y,int x,int b,int d):y(y),x(x),b(b),d(d){}\\n bool operator<(const sta& a) const{\\n return d>a.d;\\n }\\n};\\ntypedef pair<int,int> P;\\nint main(){\\n memset(sp,0,sizeof(sp));\\n memset(dp,-1,sizeof(dp));\\n cin>>w>>h;\\n string st[h];\\n for(int i=0;i<h;i++) cin>>st[i];\\n int sy,sx,gy,gx,n=0;\\n map<P,int> m;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n sp[i][j]=max(sp[i][j],1);\\n if(st[i][j]=='M') m[P(i,j)]=n++;\\n if(st[i][j]=='S') sy=i,sx=j;\\n if(st[i][j]=='G') gy=i,gx=j;\\n if(st[i][j]=='#'){\\n\\tfor(int k=1;k<=3;k++){\\n\\t for(int a=-(4-k);a<=4-k;a++){\\n\\t if(in(i-(4-k),j+a)) sp[i-(4-k)][j+a]=max(sp[i-(4-k)][j+a],k);\\n\\t if(in(i+(4-k),j+a)) sp[i+(4-k)][j+a]=max(sp[i+(4-k)][j+a],k);\\n\\t if(in(i+a,j-(4-k))) sp[i+a][j-(4-k)]=max(sp[i+a][j-(4-k)],k);\\n\\t if(in(i+a,j+(4-k))) sp[i+a][j+(4-k)]=max(sp[i+a][j+(4-k)],k);\\n\\t }\\n\\t}\\n }\\n }\\n }\\n /*//\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cout<<sp[i][j];\\n }\\n cout<<endl;\\n }\\n //*/\\n priority_queue<sta> q;\\n q.push(sta(sy,sx,0,0));\\n dp[sy][sx][0]=0;\\n int ax[]={1,-1,0,0};\\n int ay[]={0,0,1,-1};\\n while(!q.empty()){\\n sta s=q.top();q.pop();\\n if(dp[s.y][s.x][s.b]<s.d) continue;\\n //cout<<s.y<<\\\" \\\"<<s.x<<\\\" \\\"<<s.b<<\\\" \\\"<<s.d<<endl;\\n for(int k=0;k<4;k++){\\n int ny=s.y+ay[k],nx=s.x+ax[k],nb=s.b,nd=s.d+sp[s.y][s.x];\\n if(!in(ny,nx)) continue;\\n if(st[ny][nx]=='#') continue;\\n if(m.count(P(ny,nx))) nb|=1<<m[P(ny,nx)];\\n if(dp[ny][nx][nb]<0||dp[ny][nx][nb]>nd){\\n\\tdp[ny][nx][nb]=nd;\\n\\tq.push(sta(ny,nx,nb,nd));\\n }\\n }\\n }\\n cout<<dp[gy][gx][(1<<n)-1]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4900,\n \"score_of_the_acc\": -0.0876,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2419_2196513\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef pair<P,P> PP;\\nint dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};\\nbool check(int n,int m,int x,int y) {return x>=0&&x<n&&y>=0&&y<m;}\\n\\nint a[111][111],d[1<<5][111][111];\\nmap<P,int> ma;\\nint main() {\\n int n,m;\\n cin >> m >> n;\\n string s[n];\\n for(int i=0; i<n; i++) cin >> s[i];\\n priority_queue<PP,vector<PP>,greater<PP> > que;\\n for(int i=0; i<n; i++) {\\n for(int j=0; j<m; j++) {\\n a[i][j]=1;\\n for(int k=0; k<(1<<5); k++) d[k][i][j]=1<<29;\\n if(s[i][j]=='S') {\\n d[0][i][j]=0;\\n que.push(PP(P(0,0),P(i,j)));\\n }\\n if(s[i][j]=='M') {\\n int k=ma.size();\\n ma[P(i,j)]=k;\\n }\\n for(int k=-2; k<=2; k++) {\\n for(int l=-2; l<=2; l++) {\\n int x=i+k,y=j+l;\\n if(!check(n,m,x,y)||s[x][y]!='#') continue;\\n int d=max(abs(i-x),abs(j-y));\\n if(d==1) a[i][j]=max(a[i][j],3);\\n if(d==2) a[i][j]=max(a[i][j],2);\\n }\\n }\\n }\\n }\\n while(!que.empty()) {\\n PP p=que.top();que.pop();\\n int xx=p.second.first,yy=p.second.second,cc=p.first.first,tt=p.first.second;\\n if(s[xx][yy]=='G'&&tt==(1<<ma.size())-1) {\\n cout << d[tt][xx][yy] << endl;\\n return 0;\\n }\\n if(d[tt][xx][yy]<cc) continue;\\n for(int i=0; i<4; i++) {\\n int x=xx+dx[i],y=yy+dy[i];\\n int t=tt;\\n if(!check(n,m,x,y)||s[x][y]=='#') continue;\\n if(s[x][y]=='M') t|=1<<ma[P(x,y)];\\n if(d[t][x][y]<=d[tt][xx][yy]+a[xx][yy]) continue;\\n d[t][x][y]=d[tt][xx][yy]+a[xx][yy];\\n que.push(PP(P(d[t][x][y],t),P(x,y)));\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4756,\n \"score_of_the_acc\": -0.1092,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1381,"cells":{"group_id":{"kind":"string","value":"aoj_2416_cpp"},"problem_description":{"kind":"string","value":"K - XOR回廊\n問題文\nKU大学では一風変わったラリーゲームが人気である．\nこのゲームの舞台であるサーキットには，\nN\n個の休憩所と\nM\n個の道があり，\ni\n番目の道は\nf\ni\n番目の休憩所と\nt\ni\n番目の休憩所の間にある．\nすべての道にはチェックポイントが一つずつ存在し，道\ni\nのチェックポイントを通過するとどちらの向きで通っても\np\ni\nの得点がXORで加算される．\nXORで\n加算される．大事なことなので2回言いました．\nこのゲームでは，同じ休憩所や道を何度通っても良いし，\nゴールにたどり着いてもそのままラリーを続行することができるが，\n道の途中にあるチェックポイントを迂回して別の休憩所へ行くことは禁止されている．\nそのため，どのような道順をたどれば高い得点を取ることができるかを頑張って考えなければならない点が人気のある所以である．\n今回は\nQ\n人の参加者がいて，\nj\n番目の参加者は\na\nj\nの休憩所からスタートして，ゴールである\nb\nj\nの休憩所まで行くことになっているようだ．\n運営側の人間としてそれぞれの参加者の最高得点を前もって調べておくことにした．\n入力形式\n入力は以下の形式で与えられる．なお休憩所の番号は0-indexedである．\nN\nM\nQ\nf\n1\nt\n1\np\n1\n...\nf\nM\nt\nM\np\nM\na\n1\nb\n1\n...\na\nQ\nb\nQ\n出力形式\nQ\n行出力し，\nj\n行目には\na\nj\n番目の休憩所から\nb\nj\n番目の休憩所への経路で得られる得点の最大値を出力せよ．\n制約\n1 ≤ N ≤ 10\n5\n0 ≤ M ≤ 2 × 10\n5\n1 ≤ Q ≤ 10\n5\n0 ≤ f\ni\n, t\ni\n< N\n,\nf\ni\n≠ t\ni\n0 ≤ p\ni\n< 2\n60\n0 ≤ a\nj\n, b\nj\n< N\nどの休憩所からでも，道を辿っていけば任意の休憩所へたどり着ける．\n休憩所\nf\ni\n,t\ni\n間を結ぶ道は高々一つしか存在しない．\n入力値はすべて整数である．\nこの問題の判定には，60 点分のテストケースのグループが設定されている．このグループに含まれるテストケースは上記の制約に加えて下記の制約も満たす．\nM ≤ 20\n入出力例\n入力例1\n5 5 3\n0 1 7\n1 2 22\n2 3 128\n3 4 128\n4 2 128\n0 1\n0 0\n3 4\n出力例1\n135\n128\n128\nWriter : 森槙悟\nTester : 田村和範"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2416_10307881","code_snippet":"// AOJ #2416 XOR Cloister\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; 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\nll Cinll() { // 整数の入力\n\tll 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 Edge {\n int from, to;\n ll cost;\n Edge(int f, int t, ll c) : from(f), to(t), cost(c) {}\n};\n\nusing Edges = vector<Edge>;\nusing Graph = vector<Edges>;\n\nvector<ll> cycleXor;\n\nint visited[100000];\nll xorDist[100000];\n\nll top(ll value) { return 1LL << (63 - __builtin_clzll(value)); }\n\nvoid insertIntoBasis(vector<ll>& basis, ll a) {\n for (ll &b : basis) if (top(b) & a) a ^= b;\n if (a == 0) return;\n ll t = top(a);\n for (ll &b : basis) if (t & b) b ^= a;\n basis.push_back(a);\n}\n\nvector<ll> buildBasis(vector<ll>& nums) {\n vector<ll> basis;\n for (ll x : nums) insertIntoBasis(basis, x);\n sort(basis.rbegin(), basis.rend());\n return basis;\n}\n\nvoid dfs(int v, const Graph &G) {\n visited[v] = 1;\n for (const Edge &edge : G[v]) {\n int next = edge.to;\n if (visited[next]) cycleXor.push_back(xorDist[v] ^ xorDist[next] ^ edge.cost);\n else {\n xorDist[next] = xorDist[v] ^ edge.cost;\n dfs(next, G);\n }\n }\n}\n\nint main(){\n int N = Cin(), M = Cin(), Q = Cin();\n\n Graph G(N);\n for (int i = 0; i < M; i++){\n int f = Cin(), t = Cin();\n ll p = Cinll();\n G[f].emplace_back(f, t, p);\n G[t].emplace_back(t, f, p);\n }\n\n dfs(0, G);\n\n vector<ll> basis = buildBasis(cycleXor);\n\n while (Q--){\n int a = Cin(), b = Cin();\n ll ans = xorDist[a] ^ xorDist[b];\n for (ll b_val : basis) {\n if ((ans ^ b_val) > ans) ans ^= b_val;\n }\n Cout(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":22340,"score_of_the_acc":-0.7097,"final_rank":6},{"submission_id":"aoj_2416_9131443","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\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m, q;\n cin >> n >> m >> q;\n vector<vector<pair<int, ll>>> g(n);\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n ll z;\n cin >> z;\n g[x].push_back({y, z});\n g[y].push_back({x, z});\n }\n vector<ll> memo(n);\n vector<int> used(n);\n used[0] = true;\n vector<ll> val;\n auto dfs = [&](auto dfs, int s) -> void {\n for (auto to : g[s]) {\n int t = to.first;\n if (!used[t]) {\n used[t] = true;\n memo[t] = memo[s] ^ to.second;\n dfs(dfs, t);\n } else {\n val.push_back(memo[s] ^ memo[t] ^ to.second);\n }\n }\n };\n dfs(dfs, 0);\n vector<ll> basis;\n for (ll x : val) {\n for (ll y : basis) {\n x = min(x, y ^ x);\n }\n if (x) {\n basis.push_back(x);\n }\n }\n for (ll &x : basis) {\n for (ll y : basis) {\n if (x == y) continue;\n x = min(x, x ^ y);\n }\n }\n while (q--) {\n int x, y;\n cin >> x >> y;\n ll res = memo[x] ^ memo[y];\n for (ll x : basis) {\n res = max(res, res ^ x);\n }\n cout << res << \"\\n\";\n }\n}","accuracy":1,"time_ms":70,"memory_kb":25388,"score_of_the_acc":-0.9058,"final_rank":11},{"submission_id":"aoj_2416_7219834","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nlong long N;\nlong long M, S[200009], T[200009], C[200009];\nlong long Q, A[200009], B[200009];\nlong long Depth[200009];\nvector<pair<int, long long>> G[200009];\nvector<long long> XOR_Cand;\n\n// Gauss Jordan\nvector<long long> Gauss(vector<long long> Z) {\n\tfor (int i = 59; i >= 0; i--) {\n\t\tint pivot = -1;\n\t\tfor (int j = 0; j < (int)Z.size(); j++) {\n\t\t\tif (Z[j] >= (2LL << i)) continue;\n\t\t\tif (Z[j] >= (1LL << i)) { pivot = j; break; }\n\t\t}\n\t\tif (pivot == -1) continue;\n\t\tfor (int j = 0; j < (int)Z.size(); j++) {\n\t\t\tif (j == pivot) continue;\n\t\t\tif ((Z[j] / (1LL << i)) % 2LL == 0LL) continue;\n\t\t\tZ[j] ^= Z[pivot];\n\t\t}\n\t}\n\tsort(Z.begin(), Z.end());\n\tZ.erase(unique(Z.begin(), Z.end()), Z.end());\n\treverse(Z.begin(), Z.end());\n\treturn Z;\n}\n\n// DFS and Calculate Depth\nvoid dfs(int pos, long long cur) {\n\tDepth[pos] = cur;\n\tfor (int i = 0; i < (int)G[pos].size(); i++) {\n\t\tint to = G[pos][i].first;\n\t\tlong long cost = G[pos][i].second;\n\t\tif (Depth[to] != -1) continue;\n\t\tdfs(to, (cur ^ cost));\n\t}\n}\n\n// Answer query is \"BASE XOR\" is val\nlong long query(long long val) {\n\tfor (int i = 0; i < (int)XOR_Cand.size(); i++) {\n\t\tlong long cand_val = (val ^ XOR_Cand[i]);\n\t\tif (val < cand_val) val = cand_val;\n\t}\n\treturn val;\n}\n\nint main() {\n\t// Input\n\tcin >> N >> M >> Q;\n\tfor (int i = 0; i < M; i++) {\n\t\tcin >> S[i] >> T[i] >> C[i];\n\t\tG[S[i]].push_back(make_pair(T[i], C[i]));\n\t\tG[T[i]].push_back(make_pair(S[i], C[i]));\n\t}\n\tfor (int i = 0; i < Q; i++) cin >> A[i] >> B[i];\n\t\n\t// DFS\n\tfor (int i = 0; i < N; i++) Depth[i] = -1;\n\tdfs(0, 0);\n\t\n\t// Get XOR\n\tfor (int i = 0; i < M; i++) {\n\t\tlong long tmp = ((Depth[S[i]] ^ Depth[T[i]]) ^ C[i]);\n\t\tXOR_Cand.push_back(tmp);\n\t}\n\tXOR_Cand = Gauss(XOR_Cand);\n\t\n\t// Query\n\tfor (int i = 0; i < Q; i++) {\n\t\tlong long tmp = (Depth[A[i]] ^ Depth[B[i]]);\n\t\tcout << query(tmp) << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":310,"memory_kb":27520,"score_of_the_acc":-1.314,"final_rank":14},{"submission_id":"aoj_2416_5968823","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<ll,ll>>> g(101010);\nbool visited[101010];\nll memo[101010];\nint depth[101010];\nvector<ll> c;\nvoid dfs(int v, int p) {\n visited[v] = true;\n for(auto [u, w]: g[v]) {\n if(!visited[u]) {\n depth[u] = depth[v] + 1;\n memo[u] = memo[v] ^ w;\n dfs(u, v);\n }else if(depth[u] < depth[v] && u != p){\n c.push_back(memo[u]^memo[v]^w);\n }\n }\n}\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n ll n, m, q; cin >> n >> m >> q;\n\n REP(i,m) {\n ll f, t, p; cin >> f >> t >> p;\n g[f].push_back({t, p});\n g[t].push_back({f, p});\n }\n\n dfs(0, -1);\n vector<ll> basis;\n for(auto e: c) {\n ll a = e;\n for(auto u: basis) {\n a = min(a, a^u);\n }\n if(a != 0) basis.push_back(a);\n }\n REP(i,q) {\n int a, b; cin >> a >> b;\n ll ans = memo[a] ^ memo[b];\n for(int j=0; j<basis.size(); j++) {\n ans = max(ans, ans^basis[j]);\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":18256,"score_of_the_acc":-0.4741,"final_rank":2},{"submission_id":"aoj_2416_5214392","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr double EPS = 1e-8;\nconstexpr int MOD = 1000000007;\n// constexpr int MOD = 998244353;\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\nstruct IOSetup {\n IOSetup() {\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n std::cout << fixed << setprecision(20);\n }\n} iosetup;\n\ntemplate <typename CostType>\nstruct Edge {\n int src, dst; CostType cost;\n Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}\n inline bool operator<(const Edge &x) const {\n return cost != x.cost ? cost < x.cost : dst != x.dst ? dst < x.dst : src < x.src;\n }\n inline bool operator<=(const Edge &x) const { return !(x < *this); }\n inline bool operator>(const Edge &x) const { return x < *this; }\n inline bool operator>=(const Edge &x) const { return !(*this < x); }\n};\n\ntemplate <int D>\nstruct Basis {\n std::vector<std::bitset<D>> v;\n std::vector<int> msb;\n\n bool add(std::bitset<D> val) {\n int n = v.size();\n if (n == D) return false;\n for (int i = 0; i < n; ++i) {\n if (val[msb[i]]) val ^= v[i];\n }\n if (val.none()) return false;\n int m = D - 1;\n while (!val[m]) --m;\n if (v.empty()) {\n v.emplace_back(val);\n msb.emplace_back(m);\n return true;\n }\n int idx = n - std::distance(msb.rbegin(), std::upper_bound(msb.rbegin(), msb.rend(), m));\n v.emplace(v.begin() + idx, val);\n msb.emplace(msb.begin() + idx, m);\n for (int i = idx + 1; i <= n; ++i) {\n if (v[idx][msb[i]]) v[idx] ^= v[i];\n }\n for (int i = idx - 1; i >= 0; --i) {\n if (v[i][m]) v[i] ^= v[idx];\n }\n return true;\n }\n\n int rank() const { return v.size(); }\n\n inline bool operator<(const Basis &x) const {\n int n = v.size();\n if (n != x.v.size()) return n < x.v.size();\n if (n == D) return false;\n for (int i = 0; i < n; ++i) {\n if (msb[i] != x.msb[i]) return msb[i] < x.msb[i];\n }\n for (int i = 0; i < n; ++i) {\n if (v[i] != x.v[i]) {\n for (int j = msb[i] - 1; ; --j) {\n if (v[i][j] != x.v[i][j]) return v[i][j] < x.v[i][j];\n }\n }\n }\n return false;\n }\n};\n\nint main() {\n constexpr int D = 60;\n int n, m, q;\n std::cin >> n >> m >> q;\n std::vector<std::vector<Edge<long long>>> graph(n);\n while (m--) {\n int f, t;\n long long p;\n std::cin >> f >> t >> p;\n graph[f].emplace_back(f, t, p);\n graph[t].emplace_back(t, f, p);\n }\n std::vector<long long> x(n, -1);\n x[0] = 0;\n Basis<D> basis;\n std::function<void(int, int)> dfs = [&graph, &x, &basis, &dfs](int par, int ver) {\n for (const Edge<long long> &e : graph[ver]) {\n if (e.dst != par) {\n if (x[e.dst] == -1) {\n x[e.dst] = x[ver] ^ e.cost;\n dfs(ver, e.dst);\n } else {\n basis.add(x[ver] ^ x[e.dst] ^ e.cost);\n }\n }\n }\n };\n dfs(-1, 0);\n while (q--) {\n int a, b;\n std::cin >> a >> b;\n std::bitset<D> ans(x[a] ^ x[b]);\n for (int i = 0; i < basis.v.size(); ++i) {\n if (!ans[basis.msb[i]]) ans ^= basis.v[i];\n }\n std::cout << ans.to_ulong() << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":23736,"score_of_the_acc":-0.8523,"final_rank":10},{"submission_id":"aoj_2416_4235348","code_snippet":"#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconst int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\nusing CostType = ll;\nstruct Edge {\n int src, dst; CostType cost;\n Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}\n inline bool operator<(const Edge &rhs) const {\n return cost != rhs.cost ? cost < rhs.cost : dst != rhs.dst ? dst < rhs.dst : src < rhs.src;\n }\n inline bool operator<=(const Edge &rhs) const { return !(rhs < *this); }\n inline bool operator>(const Edge &rhs) const { return rhs < *this; }\n inline bool operator>=(const Edge &rhs) const { return !(*this < rhs); }\n};\n\ntemplate <int D>\nstruct Basis {\n vector<bitset<D> > v;\n vector<int> msb;\n\n bool add(bitset<D> val) {\n int n = v.size();\n if (n == D) return false;\n REP(i, n) {\n if (val[msb[i]]) val ^= v[i];\n }\n if (val.none()) return false;\n int m = D - 1;\n while (!val[m]) --m;\n if (v.empty()) {\n v.emplace_back(val);\n msb.emplace_back(m);\n return true;\n }\n int idx = n - distance(msb.rbegin(), upper_bound(msb.rbegin(), msb.rend(), m));\n v.emplace(v.begin() + idx, val);\n msb.emplace(msb.begin() + idx, m);\n for (int i = n; i > idx; --i) {\n if (v[idx][msb[i]]) v[idx] ^= v[i];\n }\n for (int i = idx - 1; i >= 0; --i) {\n if (v[i][m]) v[i] ^= v[idx];\n }\n return true;\n }\n\n bool add(ll val) { return add(bitset<D>(val)); }\n\n int rank() const { return v.size(); }\n\n inline bool operator<(const Basis &x) const {\n int n = v.size();\n if (n != x.v.size()) return n < x.v.size();\n if (n == D) return false;\n REP(i, n) {\n if (msb[i] != x.msb[i]) return msb[i] < x.msb[i];\n }\n REP(i, n) {\n if (v[i] != x.v[i]) {\n for (int j = msb[i] - 1; ; --j) {\n if (v[i][j] != x.v[i][j]) return v[i][j] < x.v[i][j];\n }\n }\n }\n return false;\n }\n};\n\nint main() {\n const int D = 60;\n int n, m, q; cin >> n >> m >> q;\n vector<vector<Edge> > graph(n);\n while (m--) {\n int f, t; ll p; cin >> f >> t >> p;\n graph[f].emplace_back(f, t, p);\n graph[t].emplace_back(t, f, p);\n }\n vector<ll> x(n, -1);\n x[0] = 0;\n Basis<D> basis;\n function<void(int, int)> dfs = [&](int par, int ver) {\n for (const Edge &e : graph[ver]) {\n if (e.dst == par) continue;\n if (x[e.dst] == -1) {\n x[e.dst] = x[ver] ^ e.cost;\n dfs(ver, e.dst);\n } else {\n basis.add(x[ver] ^ x[e.dst] ^ e.cost);\n }\n }\n };\n dfs(-1, 0);\n while (q--) {\n int a, b; cin >> a >> b;\n bitset<D> ans(x[a] ^ x[b]);\n REP(i, basis.v.size()) {\n if (!ans[basis.msb[i]]) ans ^= basis.v[i];\n }\n cout << ans.to_ulong() << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":25288,"score_of_the_acc":-0.9695,"final_rank":12},{"submission_id":"aoj_2416_1585390","code_snippet":"#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cstdio>\n#include <functional>\n#include <iostream>\n#include <cfloat>\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\n \ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> i_i;\ntypedef pair<ll, int> ll_i;\ntypedef pair<double, int> d_i;\ntypedef pair<ll, ll> ll_ll;\ntypedef pair<double, double> d_d;\nstruct edge { int v; ll w; };\n \nll MOD = 1000000007;\nll _MOD = 1000000009;\nll INF = LLONG_MAX / 3;\ndouble EPS = 1e-10;\n\nvoid dfs(int u, vector<vector<edge> >& G, vector<ll>& a) {\n\tfor (int i = 0; i < G[u].size(); i++) {\n\t\tedge e = G[u][i];\n\t\tif (a[e.v] != -1) continue;\n\t\ta[e.v] = a[u] ^ e.w;\n\t\tdfs(e.v, G, a);\n\t}\n}\n\nint main() {\n\tint N, M, Q; cin >> N >> M >> Q;\n\tvector<vector<edge> > G(N);\n\twhile (M--) {\n\t\tint x, y; ll w; scanf(\"%d%d%lld\", &x, &y, &w);\n\t\tedge e = {y, w};\n\t\tG[x].push_back(e);\n\t\tedge _e = {x, w};\n\t\tG[y].push_back(_e);\n\t}\n\tvector<ll> a(N, -1);\n\ta[0] = 0;\n\tdfs(0, G, a);\n\tvector<ll> b;\n\tfor (int u = 0; u < N; u++)\n\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\tedge e = G[u][i];\n\t\t\tb.push_back(a[u] ^ a[e.v] ^ e.w);\n\t\t}\n\tint n = b.size(), k = 0;\n\tfor (ll x = 1LL<<60; x; x >>= 1)\n\t\tfor (int i = k; i < n; i++)\n\t\t\tif (b[i] & x) {\n\t\t\t\tswap(b[k], b[i]);\n\t\t\t\tfor (int i = k + 1; i < n; i++)\n\t\t\t\t\tif (b[i] & x)\n\t\t\t\t\t\tb[i] ^= b[k];\n\t\t\t\tk++;\n\t\t\t\tbreak;\n\t\t\t}\n\twhile (Q--) {\n\t\tint x, y; scanf(\"%d%d\", &x, &y);\n\t\tll z = a[x] ^ a[y];\n\t\tfor (int i = 0; i < k; i++)\n\t\t\tif (z < (z ^ b[i]))\n\t\t\t\tz ^= b[i];\n\t\tprintf(\"%lld\\n\", z);\n\t}\n}","accuracy":1,"time_ms":140,"memory_kb":18488,"score_of_the_acc":-0.5695,"final_rank":3},{"submission_id":"aoj_2416_1584902","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\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 \n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n\nusing namespace std;\nvector<pair<int,long long> >g[210000];\nlong long val[410000];\nlong long kt[410000];\nint v[410000];\nint sz;\nvoid dfs(int a,int b){\n\tv[a]=1;\n\tfor(int i=0;i<g[a].size();i++){\n\t\tif(g[a][i].first==b)continue;\n\t\tif(!v[g[a][i].first]){\n\t\t\tval[g[a][i].first]=(val[a]^g[a][i].second);\n\t\t\tdfs(g[a][i].first,a);\n\t\t}else{\n\t\t\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\n\t\t}\n\t}\n}\nint main(){\n\tBEGIN_STACK_EXTEND(120*1024*1024);\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor(int i=0;i<b;i++){\n\t\tint p,q;\n\t\tlong long r;\n\t\tscanf(\"%d%d%lld\",&p,&q,&r);\n\t\tg[p].push_back(make_pair(q,r));\n\t\tg[q].push_back(make_pair(p,r));\n\t}\n\tsz=0;\n\tdfs(0,-1);\n\tint now=0;\n\tfor(int i=59;i>=0;i--){\n\t\tint at=-1;\n\t\tfor(int j=now;j<sz;j++){\n\t\t\tif(kt[j]&(1LL<<i)){\n\t\t\t\tat=j;break;\n\t\t\t}\n\t\t}\n\t\tif(!~at)continue;\n\t\tif(at!=now)swap(kt[at],kt[now]);\n\t\tfor(int j=0;j<sz;j++){\n\t\t\tif(now==j)continue;\n\t\t\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\n\t\t}\n\t\tnow++;\n\t}\n\t//for(int i=0;i<a;i++)printf(\"%lld\\n\",val[i]);\n\t//for(int i=0;i<now;i++)printf(\"%lld\\n\",kt[i]);\n\tfor(int i=0;i<c;i++){\n\t\tint p,q;scanf(\"%d%d\",&p,&q);\n\t\tlong long ret=(val[p]^val[q]);\n\t\tfor(int j=0;j<now;j++){\n\t\t\tif(ret<(ret^kt[j]))ret^=kt[j];\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n\tEND_STACK_EXTEND;\n}","accuracy":1,"time_ms":170,"memory_kb":21300,"score_of_the_acc":-0.7746,"final_rank":9},{"submission_id":"aoj_2416_1584900","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\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 \n#define END_STACK_EXTEND asm volatile(\"mov %%rax, %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n\nusing namespace std;\nvector<pair<int,long long> >g[110000];\nlong long val[110000];\nlong long kt[110000];\nint v[110000];\nint sz;\nvoid dfs(int a,int b){\n\tv[a]=1;\n\tfor(int i=0;i<g[a].size();i++){\n\t\tif(g[a][i].first==b)continue;\n\t\tif(!v[g[a][i].first]){\n\t\t\tval[g[a][i].first]=(val[a]^g[a][i].second);\n\t\t\tdfs(g[a][i].first,a);\n\t\t}else{\n\t\t\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\n\t\t}\n\t}\n}\nint main(){\n\tBEGIN_STACK_EXTEND(60*1024*1024);\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor(int i=0;i<b;i++){\n\t\tint p,q;\n\t\tlong long r;\n\t\tscanf(\"%d%d%lld\",&p,&q,&r);\n\t\tg[p].push_back(make_pair(q,r));\n\t\tg[q].push_back(make_pair(p,r));\n\t}\n\tsz=0;\n\tdfs(0,-1);\n\tint now=0;\n\tfor(int i=59;i>=0;i--){\n\t\tint at=-1;\n\t\tfor(int j=now;j<sz;j++){\n\t\t\tif(kt[j]&(1LL<<i)){\n\t\t\t\tat=j;break;\n\t\t\t}\n\t\t}\n\t\tif(!~at)continue;\n\t\tif(at!=now)swap(kt[at],kt[now]);\n\t\tfor(int j=0;j<sz;j++){\n\t\t\tif(now==j)continue;\n\t\t\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\n\t\t}\n\t\tnow++;\n\t}\n\t//for(int i=0;i<a;i++)printf(\"%lld\\n\",val[i]);\n\t//for(int i=0;i<now;i++)printf(\"%lld\\n\",kt[i]);\n\tfor(int i=0;i<c;i++){\n\t\tint p,q;scanf(\"%d%d\",&p,&q);\n\t\tlong long ret=(val[p]^val[q]);\n\t\tfor(int j=0;j<now;j++){\n\t\t\tif(ret<(ret^kt[j]))ret^=kt[j];\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n\tEND_STACK_EXTEND;\n}","accuracy":0.421875,"time_ms":70,"memory_kb":12004,"score_of_the_acc":-0.0957,"final_rank":17},{"submission_id":"aoj_2416_1584897","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nvector<pair<int,long long> >g[110000];\nlong long val[110000];\nlong long kt[110000];\nint v[110000];\nint sz;\nvoid dfs(int a,int b){\n\tv[a]=1;\n\tfor(int i=0;i<g[a].size();i++){\n\t\tif(g[a][i].first==b)continue;\n\t\tif(!v[g[a][i].first]){\n\t\t\tval[g[a][i].first]=(val[a]^g[a][i].second);\n\t\t\tdfs(g[a][i].first,a);\n\t\t}else{\n\t\t\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\n\t\t}\n\t}\n}\nint main(){\n\tint a,b,c;\n\tscanf(\"%d%d%d\",&a,&b,&c);\n\tfor(int i=0;i<b;i++){\n\t\tint p,q;\n\t\tlong long r;\n\t\tscanf(\"%d%d%lld\",&p,&q,&r);\n\t\tg[p].push_back(make_pair(q,r));\n\t\tg[q].push_back(make_pair(p,r));\n\t}\n\tsz=0;\n\tdfs(0,-1);\n\tint now=0;\n\tfor(int i=59;i>=0;i--){\n\t\tint at=-1;\n\t\tfor(int j=now;j<sz;j++){\n\t\t\tif(kt[j]&(1LL<<i)){\n\t\t\t\tat=j;break;\n\t\t\t}\n\t\t}\n\t\tif(!~at)continue;\n\t\tif(at!=now)swap(kt[at],kt[now]);\n\t\tfor(int j=0;j<sz;j++){\n\t\t\tif(now==j)continue;\n\t\t\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\n\t\t}\n\t\tnow++;\n\t}\n\t//for(int i=0;i<a;i++)printf(\"%lld\\n\",val[i]);\n\t//for(int i=0;i<now;i++)printf(\"%lld\\n\",kt[i]);\n\tfor(int i=0;i<c;i++){\n\t\tint p,q;scanf(\"%d%d\",&p,&q);\n\t\tlong long ret=(val[p]^val[q]);\n\t\tfor(int j=0;j<now;j++){\n\t\t\tif(ret<(ret^kt[j]))ret^=kt[j];\n\t\t}\n\t\tprintf(\"%lld\\n\",ret);\n\t}\n}","accuracy":0.421875,"time_ms":40,"memory_kb":11996,"score_of_the_acc":-0.0603,"final_rank":16},{"submission_id":"aoj_2416_496836","code_snippet":"#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <utility>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define mp make_pair\ntypedef long long Int;\n\nint N, M, Q;\nvector<pair<int, Int> > g[200000];\nInt hi[200000], cy[64];\nbool vis[200000];\n\nvoid add(Int b) {\n for (int x = 63; b; x--) if (b&(1LL<<x)) {\n if (cy[x] == 0) { cy[x] = b; return ; }\n b ^= cy[x];\n }\n}\n\nvoid rec(int at, int pre, Int bit) {\n if (vis[at]) {\n add(bit^hi[at]);\n return ;\n }\n vis[at] = 1;\n hi[at] = bit;\n rep (i, g[at].size()) {\n const int to = g[at][i].first;\n if (to == pre) continue;\n rec(to, at, bit^g[at][i].second);\n }\n}\n\nvoid build() {\n rec(0, -1, 0);\n}\n\nInt solve(int u, int v) {\n Int ans = hi[u]^hi[v];\n for (int x = 63; x >= 0; x--) if (!(ans&(1LL<<x))) ans ^= cy[x];\n return ans;\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> N >> M >> Q;\n rep (i, M) {\n int f, t;\n Int p;\n cin >> f >> t >> p;\n g[f].push_back(mp(t, p));\n g[t].push_back(mp(f, p));\n }\n build();\n rep (_, Q) {\n int a, b;\n cin >> a >> b;\n cout << solve(a, b) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":16660,"score_of_the_acc":-0.6333,"final_rank":4},{"submission_id":"aoj_2416_496806","code_snippet":"#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <utility>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define mp make_pair\ntypedef long long Int;\n\nint N, M, Q;\nvector<pair<int, Int> > g[200000];\nInt hi[200000], cy[64];\nbool vis[200000];\n\nvoid add(Int b) {\n for (int x = 63; b; x--) if (b&(1LL<<x)) {\n if (cy[x] == 0) { cy[x] = b; return ; }\n b ^= cy[x];\n }\n}\n\nvoid rec(int at, int pre, Int bit) {\n if (vis[at]) {\n add(bit^hi[at]);\n return ;\n }\n vis[at] = 1;\n hi[at] = bit;\n rep (i, g[at].size()) {\n const int to = g[at][i].first;\n if (to == pre) continue;\n rec(to, at, bit^g[at][i].second);\n }\n}\n\nvoid build() {\n rec(0, -1, 0);\n}\n\nInt solve(int u, int v) {\n Int ans = hi[u]^hi[v];\n for (int x = 63; x >= 0; x--) if (cy[x] && (ans&(1LL<<x)) == 0) {\n ans ^= cy[x];\n }\n return ans;\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> N >> M >> Q;\n rep (i, M) {\n int f, t;\n Int p;\n cin >> f >> t >> p;\n g[f].push_back(mp(t, p));\n g[t].push_back(mp(f, p));\n }\n build();\n rep (_, Q) {\n int a, b;\n cin >> a >> b;\n cout << solve(a, b) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":16660,"score_of_the_acc":-0.6333,"final_rank":4},{"submission_id":"aoj_2416_485919","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\nstatic const double EPS = 1e-9;\nstatic const double PI = acos(-1.0);\n\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\n#define MEMSET(v, h) memset((v), h, sizeof(v))\n\nstruct Edge {\n int src;\n int dest;\n ll cost;\n Edge() {;}\n Edge(int src, int dest, ll cost) : src(src), dest(dest), cost(cost) {;}\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nint n, m, q;\nGraph g;\nint visit[100010];\nll dist[100010];\nll base[100];\n\nvoid Push(ll v) {\n int first = -1;\n for (int i = 60; i >= 0; i--) {\n if (v & (1LL << i)) {\n v ^= base[i];\n if (v & (1LL << i)) { first = max(first, i); }\n }\n }\n assert(first != -1 || v == 0);\n if (first != -1) { base[first] = v; }\n}\n\nvoid dfs(int from, int parent, ll cost) {\n if (visit[from] == 2) { return; }\n if (visit[from] == 1) {\n Push(cost ^ dist[from]);\n return;\n }\n visit[from] = 1;\n dist[from] = cost;\n FORIT(it, g[from]) {\n int to = it->dest;\n if (to == parent) { continue; }\n dfs(to, from, cost ^ it->cost);\n }\n visit[from] = 2;\n}\n\nint main() {\n while (scanf(\"%d %d %d\", &n, &m, &q) > 0) {\n MEMSET(visit, 0);\n MEMSET(dist, -1);\n MEMSET(base, 0);\n g = Graph(n);\n REP(i, m) {\n int f, t;\n ll w;\n int v = scanf(\"%d %d %lld\", &f, &t, &w);\n assert(v == 3);\n g[f].push_back(Edge(f, t, w));\n g[t].push_back(Edge(t, f, w));\n }\n dfs(0, 0, 0);\n REP(iter, q) {\n int f, t;\n int v = scanf(\"%d %d\", &f, &t);\n assert(v == 2);\n ll ans = dist[f] ^ dist[t];\n for (int i = 60; i >= 0; i--) {\n if (!(ans & (1LL << i))) { ans ^= base[i]; }\n }\n printf(\"%lld\\n\", ans);\n }\n }\n}","accuracy":1,"time_ms":180,"memory_kb":16000,"score_of_the_acc":-0.4655,"final_rank":1},{"submission_id":"aoj_2416_479889","code_snippet":"#include<cstdio>\n#include<vector>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct edge{\n\tint u,v;\n\tll cost;\n};\n\nint n;\nvector<edge> G[100000];\n\nvector<edge> T[100000]; // G の全域木\n\nbool vis[100000];\nvoid dfs1(int u){\n\tvis[u]=true;\n\trep(i,G[u].size()){\n\t\tedge e=G[u][i];\n\t\tif(!vis[e.v]){\n\t\t\tT[u].push_back(e);\n\t\t\tdfs1(e.v);\n\t\t}\n\t}\n}\n\nll dist[100000]; // dist[u] := ( T における頂点 0-u 間の距離 )\nvoid dfs2(int u,ll sum){\n\tdist[u]=sum;\n\trep(i,T[u].size()){\n\t\tedge e=T[u][i];\n\t\tdfs2(e.v,sum^e.cost);\n\t}\n}\n\nint main(){\n\tint m,q; scanf(\"%d%d%d\",&n,&m,&q);\n\trep(i,m){\n\t\tint u,v;\n\t\tll cost; scanf(\"%d%d%lld\",&u,&v,&cost);\n\t\tG[u].push_back((edge){u,v,cost});\n\t\tG[v].push_back((edge){v,u,cost});\n\t}\n\n\tdfs1(0);\n\tdfs2(0,0);\n\n\tll basis[60]={};\n\trep(u,n) rep(i,G[u].size()) {\n\t\tedge e=G[u][i];\n\t\tll sum=dist[e.u]^dist[e.v]^e.cost;\n\t\tint i0=-1;\n\t\tfor(int i=59;i>=0;i--){\n\t\t\tif(sum&(1LL<<i)){\n\t\t\t\tsum^=basis[i];\n\t\t\t\tif(sum&(1LL<<i)){ i0=i; break; }\n\t\t\t}\n\t\t}\n\t\tif(i0!=-1) basis[i0]=sum;\n\t}\n\n\twhile(q--){\n\t\tint u,v; scanf(\"%d%d\",&u,&v);\n\t\tll ans=dist[u]^dist[v];\n\t\tfor(int i=59;i>=0;i--){\n\t\t\tif((ans&(1LL<<i))==0){\n\t\t\t\tans^=basis[i];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":220,"memory_kb":19372,"score_of_the_acc":-0.7161,"final_rank":7},{"submission_id":"aoj_2416_468467","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <memory.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i< n; i++)\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst int maxn = 100010;\n\nll dist[maxn];\nvector<P> G[maxn];\n\nvector<ll> bfs(){\n queue<ll> que;\n vector<ll> res;\n memset(dist, -1, sizeof(dist));\n dist[0] = 0;\n que.push(0);\n \n while(!que.empty()){\n int v = que.front(); que.pop();\n rep(i, (int)G[v].size()){\n int to = G[v][i].first;\n ll cost = G[v][i].second;\n if(dist[to] == -1){\n\tdist[to] = dist[v] ^ cost;\n\tque.push(to);\n }else{\n\tif(dist[to] ^ dist[v] ^ cost) res.push_back(dist[to] ^ dist[v] ^ cost);\n }\n }\n }\n return res;\n}\n\nvector<ll> collect(vector<ll> cycle){\n int n = cycle.size();\n vector<ll> res(60, 0);\n for(int i = 59; i >= 0; i--){\n rep(j, n){\n if((cycle[j] >> i) & 1){\n\tres[i] = cycle[j];\n\trep(k, n){\n\t if(k != j && ((cycle[k] >> i) & 1)) cycle[k] ^= cycle[j];\n\t}\n\tcycle[j] = 0;\n\tbreak;\n }\n }\n }\n return res;\n}\n\nll calc(ll res, const vector<ll> &base){\n for(int i = 59; i >= 0; i--){\n if(((base[i] ^ res) >> i) & 1) res ^= base[i]; \n }\n return res;\n}\n\nint main(){\n ll N, M, Q, a, b, f, t, p;\n \n cin >> N >> M >> Q;\n rep(i, M) {\n cin >> f >> t >> p;\n G[f].push_back(P(t, p));\n G[t].push_back(P(f, p));\n }\n \n vector<ll> cycle = bfs();\n vector<ll> base = collect(cycle);\n \n rep(i, Q){\n cin >> a >> b;\n cout << calc(dist[a] ^ dist[b], base) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":15060,"score_of_the_acc":-0.7458,"final_rank":8},{"submission_id":"aoj_2416_468443","code_snippet":"#include <iostream>\n#include <vector>\n#include <memory.h>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i< n; i++)\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst int maxn = 100010;\n\nbool used[maxn];\nll dist[maxn];\nvector<P> G[maxn];\nvector<ll> cycle;\nvector<ll> base;\n\nvoid dfs(int v, int pre, ll d, ll *dist, vector<ll> &cycle){\n used[v] = true;\n dist[v] = d;\n rep(i, (int)G[v].size()){\n int to = G[v][i].first;\n ll cost = G[v][i].second; \n if(to == pre) continue;\n if(!used[to]){\n dfs(to, v, d ^ cost, dist, cycle);\n }else{\n cycle.push_back(dist[to] ^ dist[v] ^ cost);\n }\n }\n}\n\nvector<ll> collect(vector<ll> cycle){\n int n = cycle.size();\n vector<ll> res(60, 0);\n for(int i = 59; i >= 0; i--){\n rep(j, n){\n if((cycle[j] >> i) & 1){\n\tres[i] = cycle[j];\n\trep(k, n){\n\t if(k != j && ((cycle[k] >> i) & 1)) cycle[k] ^= cycle[j];\n\t}\n\tcycle[j] = 0;\n\tbreak;\n }\n }\n }\n return res;\n}\n\nll calc(ll res, const vector<ll> &base){\n for(int i = 59; i >= 0; i--){\n if(((base[i] ^ res) >> i) & 1) res ^= base[i]; \n }\n return res;\n}\n\nint main(){\n ll N, M, Q, a, b, f, t, p;\n memset(used, false, sizeof(used));\n memset(dist, 0, sizeof(dist));\n\n cin >> N >> M >> Q;\n rep(i, M) {\n cin >> f >> t >> p;\n G[f].push_back(P(t, p));\n G[t].push_back(P(f, p));\n }\n \n dfs(0, -1, 0, dist, cycle);\n base = collect(cycle);\n \n rep(i, Q){\n cin >> a >> b;\n cout << calc(dist[a] ^ dist[b], base) << endl;\n }\n return 0;\n}","accuracy":0.625,"time_ms":340,"memory_kb":17772,"score_of_the_acc":-0.7588,"final_rank":15},{"submission_id":"aoj_2416_459122","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <sstream>\n#include <cstdio>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <cassert>\n#include <climits>\n#include <queue>\n#include <set>\n#include <map>\n#include <valarray>\n#include <bitset>\n#include <stack>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(int)n;++i)\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n#define ALL(c) (c).begin(), (c).end()\ntypedef long long ll;\ntypedef pair<int,int> pii;\nconst int INF = 1<<29;\nconst double PI = acos(-1);\nconst double EPS = 1e-8;\n\nstruct Edge {\n int f;\n int t;\n ll p;\n Edge(int f, int t, ll p) : f(f),t(t),p(p) {}\n};\nvector<Edge> g[100000];\nint visited[100000];\nll dist[100000];\nll base[100];\n\nvoid add(ll w) {\n for (int i=59; i>=0; --i) {\n if (w>>i&1) {\n if (base[i]) {\n w ^= base[i];\n } else {\n base[i] = w;\n return;\n }\n }\n }\n}\n\nvoid dfs(int now, ll w) {\n if (visited[now] == 2) return;\n if (visited[now] == 1) {\n // loop\n // cout << now << \" \" << w << \" \" << dist[now] << \" \" << (dist[now]^w) << endl;\n add(dist[now] ^ w);\n return;\n }\n visited[now] = 1;\n dist[now] = w;\n FOR(it, g[now]) {\n dfs(it->t,w^it->p);\n }\n visited[now] = 2;\n}\n\nint main() {\n int n, m, q;\n cin >> n >> m >> q;\n REP(i,m) {\n int f,t;\n ll p;\n cin >> f >> t >> p;\n g[f].push_back(Edge(f,t,p));\n g[t].push_back(Edge(t,f,p));\n }\n memset(visited,0,sizeof(visited));\n memset(base,0,sizeof(base));\n dfs(0,0);\n while(q--) {\n int a, b;\n cin >> a >> b;\n ll w = dist[a]^dist[b];\n for (int i=59; i>=0; --i) {\n if (!(w>>i&1)) {\n w ^= base[i];\n }\n }\n cout << w << endl;\n }\n}","accuracy":1,"time_ms":900,"memory_kb":11000,"score_of_the_acc":-1,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_2416_10307881\",\n \"code_snippet\": \"// AOJ #2416 XOR Cloister\\n// 2025.3.17\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() { // 整数の入力\\n\\tint n = 0; 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\\nll Cinll() { // 整数の入力\\n\\tll 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 Edge {\\n int from, to;\\n ll cost;\\n Edge(int f, int t, ll c) : from(f), to(t), cost(c) {}\\n};\\n\\nusing Edges = vector<Edge>;\\nusing Graph = vector<Edges>;\\n\\nvector<ll> cycleXor;\\n\\nint visited[100000];\\nll xorDist[100000];\\n\\nll top(ll value) { return 1LL << (63 - __builtin_clzll(value)); }\\n\\nvoid insertIntoBasis(vector<ll>& basis, ll a) {\\n for (ll &b : basis) if (top(b) & a) a ^= b;\\n if (a == 0) return;\\n ll t = top(a);\\n for (ll &b : basis) if (t & b) b ^= a;\\n basis.push_back(a);\\n}\\n\\nvector<ll> buildBasis(vector<ll>& nums) {\\n vector<ll> basis;\\n for (ll x : nums) insertIntoBasis(basis, x);\\n sort(basis.rbegin(), basis.rend());\\n return basis;\\n}\\n\\nvoid dfs(int v, const Graph &G) {\\n visited[v] = 1;\\n for (const Edge &edge : G[v]) {\\n int next = edge.to;\\n if (visited[next]) cycleXor.push_back(xorDist[v] ^ xorDist[next] ^ edge.cost);\\n else {\\n xorDist[next] = xorDist[v] ^ edge.cost;\\n dfs(next, G);\\n }\\n }\\n}\\n\\nint main(){\\n int N = Cin(), M = Cin(), Q = Cin();\\n\\n Graph G(N);\\n for (int i = 0; i < M; i++){\\n int f = Cin(), t = Cin();\\n ll p = Cinll();\\n G[f].emplace_back(f, t, p);\\n G[t].emplace_back(t, f, p);\\n }\\n\\n dfs(0, G);\\n\\n vector<ll> basis = buildBasis(cycleXor);\\n\\n while (Q--){\\n int a = Cin(), b = Cin();\\n ll ans = xorDist[a] ^ xorDist[b];\\n for (ll b_val : basis) {\\n if ((ans ^ b_val) > ans) ans ^= b_val;\\n }\\n Cout(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 22340,\n \"score_of_the_acc\": -0.7097,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2416_9131443\",\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\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n, m, q;\\n cin >> n >> m >> q;\\n vector<vector<pair<int, ll>>> g(n);\\n for (int i = 0; i < m; i++) {\\n int x, y;\\n cin >> x >> y;\\n ll z;\\n cin >> z;\\n g[x].push_back({y, z});\\n g[y].push_back({x, z});\\n }\\n vector<ll> memo(n);\\n vector<int> used(n);\\n used[0] = true;\\n vector<ll> val;\\n auto dfs = [&](auto dfs, int s) -> void {\\n for (auto to : g[s]) {\\n int t = to.first;\\n if (!used[t]) {\\n used[t] = true;\\n memo[t] = memo[s] ^ to.second;\\n dfs(dfs, t);\\n } else {\\n val.push_back(memo[s] ^ memo[t] ^ to.second);\\n }\\n }\\n };\\n dfs(dfs, 0);\\n vector<ll> basis;\\n for (ll x : val) {\\n for (ll y : basis) {\\n x = min(x, y ^ x);\\n }\\n if (x) {\\n basis.push_back(x);\\n }\\n }\\n for (ll &x : basis) {\\n for (ll y : basis) {\\n if (x == y) continue;\\n x = min(x, x ^ y);\\n }\\n }\\n while (q--) {\\n int x, y;\\n cin >> x >> y;\\n ll res = memo[x] ^ memo[y];\\n for (ll x : basis) {\\n res = max(res, res ^ x);\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 25388,\n \"score_of_the_acc\": -0.9058,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2416_7219834\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nlong long N;\\nlong long M, S[200009], T[200009], C[200009];\\nlong long Q, A[200009], B[200009];\\nlong long Depth[200009];\\nvector<pair<int, long long>> G[200009];\\nvector<long long> XOR_Cand;\\n\\n// Gauss Jordan\\nvector<long long> Gauss(vector<long long> Z) {\\n\\tfor (int i = 59; i >= 0; i--) {\\n\\t\\tint pivot = -1;\\n\\t\\tfor (int j = 0; j < (int)Z.size(); j++) {\\n\\t\\t\\tif (Z[j] >= (2LL << i)) continue;\\n\\t\\t\\tif (Z[j] >= (1LL << i)) { pivot = j; break; }\\n\\t\\t}\\n\\t\\tif (pivot == -1) continue;\\n\\t\\tfor (int j = 0; j < (int)Z.size(); j++) {\\n\\t\\t\\tif (j == pivot) continue;\\n\\t\\t\\tif ((Z[j] / (1LL << i)) % 2LL == 0LL) continue;\\n\\t\\t\\tZ[j] ^= Z[pivot];\\n\\t\\t}\\n\\t}\\n\\tsort(Z.begin(), Z.end());\\n\\tZ.erase(unique(Z.begin(), Z.end()), Z.end());\\n\\treverse(Z.begin(), Z.end());\\n\\treturn Z;\\n}\\n\\n// DFS and Calculate Depth\\nvoid dfs(int pos, long long cur) {\\n\\tDepth[pos] = cur;\\n\\tfor (int i = 0; i < (int)G[pos].size(); i++) {\\n\\t\\tint to = G[pos][i].first;\\n\\t\\tlong long cost = G[pos][i].second;\\n\\t\\tif (Depth[to] != -1) continue;\\n\\t\\tdfs(to, (cur ^ cost));\\n\\t}\\n}\\n\\n// Answer query is \\\"BASE XOR\\\" is val\\nlong long query(long long val) {\\n\\tfor (int i = 0; i < (int)XOR_Cand.size(); i++) {\\n\\t\\tlong long cand_val = (val ^ XOR_Cand[i]);\\n\\t\\tif (val < cand_val) val = cand_val;\\n\\t}\\n\\treturn val;\\n}\\n\\nint main() {\\n\\t// Input\\n\\tcin >> N >> M >> Q;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tcin >> S[i] >> T[i] >> C[i];\\n\\t\\tG[S[i]].push_back(make_pair(T[i], C[i]));\\n\\t\\tG[T[i]].push_back(make_pair(S[i], C[i]));\\n\\t}\\n\\tfor (int i = 0; i < Q; i++) cin >> A[i] >> B[i];\\n\\t\\n\\t// DFS\\n\\tfor (int i = 0; i < N; i++) Depth[i] = -1;\\n\\tdfs(0, 0);\\n\\t\\n\\t// Get XOR\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tlong long tmp = ((Depth[S[i]] ^ Depth[T[i]]) ^ C[i]);\\n\\t\\tXOR_Cand.push_back(tmp);\\n\\t}\\n\\tXOR_Cand = Gauss(XOR_Cand);\\n\\t\\n\\t// Query\\n\\tfor (int i = 0; i < Q; i++) {\\n\\t\\tlong long tmp = (Depth[A[i]] ^ Depth[B[i]]);\\n\\t\\tcout << query(tmp) << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 27520,\n \"score_of_the_acc\": -1.314,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2416_5968823\",\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<ll,ll>>> g(101010);\\nbool visited[101010];\\nll memo[101010];\\nint depth[101010];\\nvector<ll> c;\\nvoid dfs(int v, int p) {\\n visited[v] = true;\\n for(auto [u, w]: g[v]) {\\n if(!visited[u]) {\\n depth[u] = depth[v] + 1;\\n memo[u] = memo[v] ^ w;\\n dfs(u, v);\\n }else if(depth[u] < depth[v] && u != p){\\n c.push_back(memo[u]^memo[v]^w);\\n }\\n }\\n}\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n ll n, m, q; cin >> n >> m >> q;\\n\\n REP(i,m) {\\n ll f, t, p; cin >> f >> t >> p;\\n g[f].push_back({t, p});\\n g[t].push_back({f, p});\\n }\\n\\n dfs(0, -1);\\n vector<ll> basis;\\n for(auto e: c) {\\n ll a = e;\\n for(auto u: basis) {\\n a = min(a, a^u);\\n }\\n if(a != 0) basis.push_back(a);\\n }\\n REP(i,q) {\\n int a, b; cin >> a >> b;\\n ll ans = memo[a] ^ memo[b];\\n for(int j=0; j<basis.size(); j++) {\\n ans = max(ans, ans^basis[j]);\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 18256,\n \"score_of_the_acc\": -0.4741,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2416_5214392\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll = long long;\\nconstexpr int INF = 0x3f3f3f3f;\\nconstexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconstexpr double EPS = 1e-8;\\nconstexpr int MOD = 1000000007;\\n// constexpr int MOD = 998244353;\\nconstexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\nconstexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\\nstruct IOSetup {\\n IOSetup() {\\n std::cin.tie(nullptr);\\n std::ios_base::sync_with_stdio(false);\\n std::cout << fixed << setprecision(20);\\n }\\n} iosetup;\\n\\ntemplate <typename CostType>\\nstruct Edge {\\n int src, dst; CostType cost;\\n Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}\\n inline bool operator<(const Edge &x) const {\\n return cost != x.cost ? cost < x.cost : dst != x.dst ? dst < x.dst : src < x.src;\\n }\\n inline bool operator<=(const Edge &x) const { return !(x < *this); }\\n inline bool operator>(const Edge &x) const { return x < *this; }\\n inline bool operator>=(const Edge &x) const { return !(*this < x); }\\n};\\n\\ntemplate <int D>\\nstruct Basis {\\n std::vector<std::bitset<D>> v;\\n std::vector<int> msb;\\n\\n bool add(std::bitset<D> val) {\\n int n = v.size();\\n if (n == D) return false;\\n for (int i = 0; i < n; ++i) {\\n if (val[msb[i]]) val ^= v[i];\\n }\\n if (val.none()) return false;\\n int m = D - 1;\\n while (!val[m]) --m;\\n if (v.empty()) {\\n v.emplace_back(val);\\n msb.emplace_back(m);\\n return true;\\n }\\n int idx = n - std::distance(msb.rbegin(), std::upper_bound(msb.rbegin(), msb.rend(), m));\\n v.emplace(v.begin() + idx, val);\\n msb.emplace(msb.begin() + idx, m);\\n for (int i = idx + 1; i <= n; ++i) {\\n if (v[idx][msb[i]]) v[idx] ^= v[i];\\n }\\n for (int i = idx - 1; i >= 0; --i) {\\n if (v[i][m]) v[i] ^= v[idx];\\n }\\n return true;\\n }\\n\\n int rank() const { return v.size(); }\\n\\n inline bool operator<(const Basis &x) const {\\n int n = v.size();\\n if (n != x.v.size()) return n < x.v.size();\\n if (n == D) return false;\\n for (int i = 0; i < n; ++i) {\\n if (msb[i] != x.msb[i]) return msb[i] < x.msb[i];\\n }\\n for (int i = 0; i < n; ++i) {\\n if (v[i] != x.v[i]) {\\n for (int j = msb[i] - 1; ; --j) {\\n if (v[i][j] != x.v[i][j]) return v[i][j] < x.v[i][j];\\n }\\n }\\n }\\n return false;\\n }\\n};\\n\\nint main() {\\n constexpr int D = 60;\\n int n, m, q;\\n std::cin >> n >> m >> q;\\n std::vector<std::vector<Edge<long long>>> graph(n);\\n while (m--) {\\n int f, t;\\n long long p;\\n std::cin >> f >> t >> p;\\n graph[f].emplace_back(f, t, p);\\n graph[t].emplace_back(t, f, p);\\n }\\n std::vector<long long> x(n, -1);\\n x[0] = 0;\\n Basis<D> basis;\\n std::function<void(int, int)> dfs = [&graph, &x, &basis, &dfs](int par, int ver) {\\n for (const Edge<long long> &e : graph[ver]) {\\n if (e.dst != par) {\\n if (x[e.dst] == -1) {\\n x[e.dst] = x[ver] ^ e.cost;\\n dfs(ver, e.dst);\\n } else {\\n basis.add(x[ver] ^ x[e.dst] ^ e.cost);\\n }\\n }\\n }\\n };\\n dfs(-1, 0);\\n while (q--) {\\n int a, b;\\n std::cin >> a >> b;\\n std::bitset<D> ans(x[a] ^ x[b]);\\n for (int i = 0; i < basis.v.size(); ++i) {\\n if (!ans[basis.msb[i]]) ans ^= basis.v[i];\\n }\\n std::cout << ans.to_ulong() << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 23736,\n \"score_of_the_acc\": -0.8523,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2416_4235348\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(v) (v).begin(),(v).end()\\nusing ll = long long;\\nconst int INF = 0x3f3f3f3f;\\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\n// const int MOD = 998244353;\\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\\nconst int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\\nstruct IOSetup {\\n IOSetup() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n }\\n} iosetup;\\n\\nusing CostType = ll;\\nstruct Edge {\\n int src, dst; CostType cost;\\n Edge(int src, int dst, CostType cost = 0) : src(src), dst(dst), cost(cost) {}\\n inline bool operator<(const Edge &rhs) const {\\n return cost != rhs.cost ? cost < rhs.cost : dst != rhs.dst ? dst < rhs.dst : src < rhs.src;\\n }\\n inline bool operator<=(const Edge &rhs) const { return !(rhs < *this); }\\n inline bool operator>(const Edge &rhs) const { return rhs < *this; }\\n inline bool operator>=(const Edge &rhs) const { return !(*this < rhs); }\\n};\\n\\ntemplate <int D>\\nstruct Basis {\\n vector<bitset<D> > v;\\n vector<int> msb;\\n\\n bool add(bitset<D> val) {\\n int n = v.size();\\n if (n == D) return false;\\n REP(i, n) {\\n if (val[msb[i]]) val ^= v[i];\\n }\\n if (val.none()) return false;\\n int m = D - 1;\\n while (!val[m]) --m;\\n if (v.empty()) {\\n v.emplace_back(val);\\n msb.emplace_back(m);\\n return true;\\n }\\n int idx = n - distance(msb.rbegin(), upper_bound(msb.rbegin(), msb.rend(), m));\\n v.emplace(v.begin() + idx, val);\\n msb.emplace(msb.begin() + idx, m);\\n for (int i = n; i > idx; --i) {\\n if (v[idx][msb[i]]) v[idx] ^= v[i];\\n }\\n for (int i = idx - 1; i >= 0; --i) {\\n if (v[i][m]) v[i] ^= v[idx];\\n }\\n return true;\\n }\\n\\n bool add(ll val) { return add(bitset<D>(val)); }\\n\\n int rank() const { return v.size(); }\\n\\n inline bool operator<(const Basis &x) const {\\n int n = v.size();\\n if (n != x.v.size()) return n < x.v.size();\\n if (n == D) return false;\\n REP(i, n) {\\n if (msb[i] != x.msb[i]) return msb[i] < x.msb[i];\\n }\\n REP(i, n) {\\n if (v[i] != x.v[i]) {\\n for (int j = msb[i] - 1; ; --j) {\\n if (v[i][j] != x.v[i][j]) return v[i][j] < x.v[i][j];\\n }\\n }\\n }\\n return false;\\n }\\n};\\n\\nint main() {\\n const int D = 60;\\n int n, m, q; cin >> n >> m >> q;\\n vector<vector<Edge> > graph(n);\\n while (m--) {\\n int f, t; ll p; cin >> f >> t >> p;\\n graph[f].emplace_back(f, t, p);\\n graph[t].emplace_back(t, f, p);\\n }\\n vector<ll> x(n, -1);\\n x[0] = 0;\\n Basis<D> basis;\\n function<void(int, int)> dfs = [&](int par, int ver) {\\n for (const Edge &e : graph[ver]) {\\n if (e.dst == par) continue;\\n if (x[e.dst] == -1) {\\n x[e.dst] = x[ver] ^ e.cost;\\n dfs(ver, e.dst);\\n } else {\\n basis.add(x[ver] ^ x[e.dst] ^ e.cost);\\n }\\n }\\n };\\n dfs(-1, 0);\\n while (q--) {\\n int a, b; cin >> a >> b;\\n bitset<D> ans(x[a] ^ x[b]);\\n REP(i, basis.v.size()) {\\n if (!ans[basis.msb[i]]) ans ^= basis.v[i];\\n }\\n cout << ans.to_ulong() << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 25288,\n \"score_of_the_acc\": -0.9695,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2416_1585390\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <algorithm>\\n#include <cstdio>\\n#include <functional>\\n#include <iostream>\\n#include <cfloat>\\n#include <climits>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <time.h>\\n#include <vector>\\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> i_i;\\ntypedef pair<ll, int> ll_i;\\ntypedef pair<double, int> d_i;\\ntypedef pair<ll, ll> ll_ll;\\ntypedef pair<double, double> d_d;\\nstruct edge { int v; ll w; };\\n \\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\nll INF = LLONG_MAX / 3;\\ndouble EPS = 1e-10;\\n\\nvoid dfs(int u, vector<vector<edge> >& G, vector<ll>& a) {\\n\\tfor (int i = 0; i < G[u].size(); i++) {\\n\\t\\tedge e = G[u][i];\\n\\t\\tif (a[e.v] != -1) continue;\\n\\t\\ta[e.v] = a[u] ^ e.w;\\n\\t\\tdfs(e.v, G, a);\\n\\t}\\n}\\n\\nint main() {\\n\\tint N, M, Q; cin >> N >> M >> Q;\\n\\tvector<vector<edge> > G(N);\\n\\twhile (M--) {\\n\\t\\tint x, y; ll w; scanf(\\\"%d%d%lld\\\", &x, &y, &w);\\n\\t\\tedge e = {y, w};\\n\\t\\tG[x].push_back(e);\\n\\t\\tedge _e = {x, w};\\n\\t\\tG[y].push_back(_e);\\n\\t}\\n\\tvector<ll> a(N, -1);\\n\\ta[0] = 0;\\n\\tdfs(0, G, a);\\n\\tvector<ll> b;\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tfor (int i = 0; i < G[u].size(); i++) {\\n\\t\\t\\tedge e = G[u][i];\\n\\t\\t\\tb.push_back(a[u] ^ a[e.v] ^ e.w);\\n\\t\\t}\\n\\tint n = b.size(), k = 0;\\n\\tfor (ll x = 1LL<<60; x; x >>= 1)\\n\\t\\tfor (int i = k; i < n; i++)\\n\\t\\t\\tif (b[i] & x) {\\n\\t\\t\\t\\tswap(b[k], b[i]);\\n\\t\\t\\t\\tfor (int i = k + 1; i < n; i++)\\n\\t\\t\\t\\t\\tif (b[i] & x)\\n\\t\\t\\t\\t\\t\\tb[i] ^= b[k];\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\twhile (Q--) {\\n\\t\\tint x, y; scanf(\\\"%d%d\\\", &x, &y);\\n\\t\\tll z = a[x] ^ a[y];\\n\\t\\tfor (int i = 0; i < k; i++)\\n\\t\\t\\tif (z < (z ^ b[i]))\\n\\t\\t\\t\\tz ^= b[i];\\n\\t\\tprintf(\\\"%lld\\\\n\\\", z);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 18488,\n \"score_of_the_acc\": -0.5695,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2416_1584902\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\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 \\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n\\nusing namespace std;\\nvector<pair<int,long long> >g[210000];\\nlong long val[410000];\\nlong long kt[410000];\\nint v[410000];\\nint sz;\\nvoid dfs(int a,int b){\\n\\tv[a]=1;\\n\\tfor(int i=0;i<g[a].size();i++){\\n\\t\\tif(g[a][i].first==b)continue;\\n\\t\\tif(!v[g[a][i].first]){\\n\\t\\t\\tval[g[a][i].first]=(val[a]^g[a][i].second);\\n\\t\\t\\tdfs(g[a][i].first,a);\\n\\t\\t}else{\\n\\t\\t\\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tBEGIN_STACK_EXTEND(120*1024*1024);\\n\\tint a,b,c;\\n\\tscanf(\\\"%d%d%d\\\",&a,&b,&c);\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint p,q;\\n\\t\\tlong long r;\\n\\t\\tscanf(\\\"%d%d%lld\\\",&p,&q,&r);\\n\\t\\tg[p].push_back(make_pair(q,r));\\n\\t\\tg[q].push_back(make_pair(p,r));\\n\\t}\\n\\tsz=0;\\n\\tdfs(0,-1);\\n\\tint now=0;\\n\\tfor(int i=59;i>=0;i--){\\n\\t\\tint at=-1;\\n\\t\\tfor(int j=now;j<sz;j++){\\n\\t\\t\\tif(kt[j]&(1LL<<i)){\\n\\t\\t\\t\\tat=j;break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!~at)continue;\\n\\t\\tif(at!=now)swap(kt[at],kt[now]);\\n\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\tif(now==j)continue;\\n\\t\\t\\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\\n\\t\\t}\\n\\t\\tnow++;\\n\\t}\\n\\t//for(int i=0;i<a;i++)printf(\\\"%lld\\\\n\\\",val[i]);\\n\\t//for(int i=0;i<now;i++)printf(\\\"%lld\\\\n\\\",kt[i]);\\n\\tfor(int i=0;i<c;i++){\\n\\t\\tint p,q;scanf(\\\"%d%d\\\",&p,&q);\\n\\t\\tlong long ret=(val[p]^val[q]);\\n\\t\\tfor(int j=0;j<now;j++){\\n\\t\\t\\tif(ret<(ret^kt[j]))ret^=kt[j];\\n\\t\\t}\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ret);\\n\\t}\\n\\tEND_STACK_EXTEND;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 21300,\n \"score_of_the_acc\": -0.7746,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2416_1584900\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\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 \\n#define END_STACK_EXTEND asm volatile(\\\"mov %%rax, %%rsp\\\"::\\\"a\\\"(stack_extend_origin_memory_));free(stack_extend_memory_);\\n\\nusing namespace std;\\nvector<pair<int,long long> >g[110000];\\nlong long val[110000];\\nlong long kt[110000];\\nint v[110000];\\nint sz;\\nvoid dfs(int a,int b){\\n\\tv[a]=1;\\n\\tfor(int i=0;i<g[a].size();i++){\\n\\t\\tif(g[a][i].first==b)continue;\\n\\t\\tif(!v[g[a][i].first]){\\n\\t\\t\\tval[g[a][i].first]=(val[a]^g[a][i].second);\\n\\t\\t\\tdfs(g[a][i].first,a);\\n\\t\\t}else{\\n\\t\\t\\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tBEGIN_STACK_EXTEND(60*1024*1024);\\n\\tint a,b,c;\\n\\tscanf(\\\"%d%d%d\\\",&a,&b,&c);\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint p,q;\\n\\t\\tlong long r;\\n\\t\\tscanf(\\\"%d%d%lld\\\",&p,&q,&r);\\n\\t\\tg[p].push_back(make_pair(q,r));\\n\\t\\tg[q].push_back(make_pair(p,r));\\n\\t}\\n\\tsz=0;\\n\\tdfs(0,-1);\\n\\tint now=0;\\n\\tfor(int i=59;i>=0;i--){\\n\\t\\tint at=-1;\\n\\t\\tfor(int j=now;j<sz;j++){\\n\\t\\t\\tif(kt[j]&(1LL<<i)){\\n\\t\\t\\t\\tat=j;break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!~at)continue;\\n\\t\\tif(at!=now)swap(kt[at],kt[now]);\\n\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\tif(now==j)continue;\\n\\t\\t\\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\\n\\t\\t}\\n\\t\\tnow++;\\n\\t}\\n\\t//for(int i=0;i<a;i++)printf(\\\"%lld\\\\n\\\",val[i]);\\n\\t//for(int i=0;i<now;i++)printf(\\\"%lld\\\\n\\\",kt[i]);\\n\\tfor(int i=0;i<c;i++){\\n\\t\\tint p,q;scanf(\\\"%d%d\\\",&p,&q);\\n\\t\\tlong long ret=(val[p]^val[q]);\\n\\t\\tfor(int j=0;j<now;j++){\\n\\t\\t\\tif(ret<(ret^kt[j]))ret^=kt[j];\\n\\t\\t}\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ret);\\n\\t}\\n\\tEND_STACK_EXTEND;\\n}\",\n \"accuracy\": 0.421875,\n \"time_ms\": 70,\n \"memory_kb\": 12004,\n \"score_of_the_acc\": -0.0957,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2416_1584897\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<vector>\\nusing namespace std;\\nvector<pair<int,long long> >g[110000];\\nlong long val[110000];\\nlong long kt[110000];\\nint v[110000];\\nint sz;\\nvoid dfs(int a,int b){\\n\\tv[a]=1;\\n\\tfor(int i=0;i<g[a].size();i++){\\n\\t\\tif(g[a][i].first==b)continue;\\n\\t\\tif(!v[g[a][i].first]){\\n\\t\\t\\tval[g[a][i].first]=(val[a]^g[a][i].second);\\n\\t\\t\\tdfs(g[a][i].first,a);\\n\\t\\t}else{\\n\\t\\t\\tkt[sz++]=(val[a]^val[g[a][i].first]^g[a][i].second);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tint a,b,c;\\n\\tscanf(\\\"%d%d%d\\\",&a,&b,&c);\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint p,q;\\n\\t\\tlong long r;\\n\\t\\tscanf(\\\"%d%d%lld\\\",&p,&q,&r);\\n\\t\\tg[p].push_back(make_pair(q,r));\\n\\t\\tg[q].push_back(make_pair(p,r));\\n\\t}\\n\\tsz=0;\\n\\tdfs(0,-1);\\n\\tint now=0;\\n\\tfor(int i=59;i>=0;i--){\\n\\t\\tint at=-1;\\n\\t\\tfor(int j=now;j<sz;j++){\\n\\t\\t\\tif(kt[j]&(1LL<<i)){\\n\\t\\t\\t\\tat=j;break;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!~at)continue;\\n\\t\\tif(at!=now)swap(kt[at],kt[now]);\\n\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\tif(now==j)continue;\\n\\t\\t\\tif(kt[j]&(1LL<<i))kt[j]^=kt[now];\\n\\t\\t}\\n\\t\\tnow++;\\n\\t}\\n\\t//for(int i=0;i<a;i++)printf(\\\"%lld\\\\n\\\",val[i]);\\n\\t//for(int i=0;i<now;i++)printf(\\\"%lld\\\\n\\\",kt[i]);\\n\\tfor(int i=0;i<c;i++){\\n\\t\\tint p,q;scanf(\\\"%d%d\\\",&p,&q);\\n\\t\\tlong long ret=(val[p]^val[q]);\\n\\t\\tfor(int j=0;j<now;j++){\\n\\t\\t\\tif(ret<(ret^kt[j]))ret^=kt[j];\\n\\t\\t}\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 0.421875,\n \"time_ms\": 40,\n \"memory_kb\": 11996,\n \"score_of_the_acc\": -0.0603,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2416_496836\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define mp make_pair\\ntypedef long long Int;\\n\\nint N, M, Q;\\nvector<pair<int, Int> > g[200000];\\nInt hi[200000], cy[64];\\nbool vis[200000];\\n\\nvoid add(Int b) {\\n for (int x = 63; b; x--) if (b&(1LL<<x)) {\\n if (cy[x] == 0) { cy[x] = b; return ; }\\n b ^= cy[x];\\n }\\n}\\n\\nvoid rec(int at, int pre, Int bit) {\\n if (vis[at]) {\\n add(bit^hi[at]);\\n return ;\\n }\\n vis[at] = 1;\\n hi[at] = bit;\\n rep (i, g[at].size()) {\\n const int to = g[at][i].first;\\n if (to == pre) continue;\\n rec(to, at, bit^g[at][i].second);\\n }\\n}\\n\\nvoid build() {\\n rec(0, -1, 0);\\n}\\n\\nInt solve(int u, int v) {\\n Int ans = hi[u]^hi[v];\\n for (int x = 63; x >= 0; x--) if (!(ans&(1LL<<x))) ans ^= cy[x];\\n return ans;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cin >> N >> M >> Q;\\n rep (i, M) {\\n int f, t;\\n Int p;\\n cin >> f >> t >> p;\\n g[f].push_back(mp(t, p));\\n g[t].push_back(mp(f, p));\\n }\\n build();\\n rep (_, Q) {\\n int a, b;\\n cin >> a >> b;\\n cout << solve(a, b) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 16660,\n \"score_of_the_acc\": -0.6333,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2416_496806\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <iostream>\\n#include <vector>\\n#include <utility>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define mp make_pair\\ntypedef long long Int;\\n\\nint N, M, Q;\\nvector<pair<int, Int> > g[200000];\\nInt hi[200000], cy[64];\\nbool vis[200000];\\n\\nvoid add(Int b) {\\n for (int x = 63; b; x--) if (b&(1LL<<x)) {\\n if (cy[x] == 0) { cy[x] = b; return ; }\\n b ^= cy[x];\\n }\\n}\\n\\nvoid rec(int at, int pre, Int bit) {\\n if (vis[at]) {\\n add(bit^hi[at]);\\n return ;\\n }\\n vis[at] = 1;\\n hi[at] = bit;\\n rep (i, g[at].size()) {\\n const int to = g[at][i].first;\\n if (to == pre) continue;\\n rec(to, at, bit^g[at][i].second);\\n }\\n}\\n\\nvoid build() {\\n rec(0, -1, 0);\\n}\\n\\nInt solve(int u, int v) {\\n Int ans = hi[u]^hi[v];\\n for (int x = 63; x >= 0; x--) if (cy[x] && (ans&(1LL<<x)) == 0) {\\n ans ^= cy[x];\\n }\\n return ans;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cin >> N >> M >> Q;\\n rep (i, M) {\\n int f, t;\\n Int p;\\n cin >> f >> t >> p;\\n g[f].push_back(mp(t, p));\\n g[t].push_back(mp(f, p));\\n }\\n build();\\n rep (_, Q) {\\n int a, b;\\n cin >> a >> b;\\n cout << solve(a, b) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 16660,\n \"score_of_the_acc\": -0.6333,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2416_485919\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <algorithm>\\n#include <iostream>\\n#include <math.h>\\n#include <assert.h>\\n#include <vector>\\n#include <queue>\\n#include <string>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\nstatic const double EPS = 1e-9;\\nstatic const double PI = acos(-1.0);\\n\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\n#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)\\n#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)\\n#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)\\n#define MEMSET(v, h) memset((v), h, sizeof(v))\\n\\nstruct Edge {\\n int src;\\n int dest;\\n ll cost;\\n Edge() {;}\\n Edge(int src, int dest, ll cost) : src(src), dest(dest), cost(cost) {;}\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nint n, m, q;\\nGraph g;\\nint visit[100010];\\nll dist[100010];\\nll base[100];\\n\\nvoid Push(ll v) {\\n int first = -1;\\n for (int i = 60; i >= 0; i--) {\\n if (v & (1LL << i)) {\\n v ^= base[i];\\n if (v & (1LL << i)) { first = max(first, i); }\\n }\\n }\\n assert(first != -1 || v == 0);\\n if (first != -1) { base[first] = v; }\\n}\\n\\nvoid dfs(int from, int parent, ll cost) {\\n if (visit[from] == 2) { return; }\\n if (visit[from] == 1) {\\n Push(cost ^ dist[from]);\\n return;\\n }\\n visit[from] = 1;\\n dist[from] = cost;\\n FORIT(it, g[from]) {\\n int to = it->dest;\\n if (to == parent) { continue; }\\n dfs(to, from, cost ^ it->cost);\\n }\\n visit[from] = 2;\\n}\\n\\nint main() {\\n while (scanf(\\\"%d %d %d\\\", &n, &m, &q) > 0) {\\n MEMSET(visit, 0);\\n MEMSET(dist, -1);\\n MEMSET(base, 0);\\n g = Graph(n);\\n REP(i, m) {\\n int f, t;\\n ll w;\\n int v = scanf(\\\"%d %d %lld\\\", &f, &t, &w);\\n assert(v == 3);\\n g[f].push_back(Edge(f, t, w));\\n g[t].push_back(Edge(t, f, w));\\n }\\n dfs(0, 0, 0);\\n REP(iter, q) {\\n int f, t;\\n int v = scanf(\\\"%d %d\\\", &f, &t);\\n assert(v == 2);\\n ll ans = dist[f] ^ dist[t];\\n for (int i = 60; i >= 0; i--) {\\n if (!(ans & (1LL << i))) { ans ^= base[i]; }\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 16000,\n \"score_of_the_acc\": -0.4655,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2416_479889\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nstruct edge{\\n\\tint u,v;\\n\\tll cost;\\n};\\n\\nint n;\\nvector<edge> G[100000];\\n\\nvector<edge> T[100000]; // G の全域木\\n\\nbool vis[100000];\\nvoid dfs1(int u){\\n\\tvis[u]=true;\\n\\trep(i,G[u].size()){\\n\\t\\tedge e=G[u][i];\\n\\t\\tif(!vis[e.v]){\\n\\t\\t\\tT[u].push_back(e);\\n\\t\\t\\tdfs1(e.v);\\n\\t\\t}\\n\\t}\\n}\\n\\nll dist[100000]; // dist[u] := ( T における頂点 0-u 間の距離 )\\nvoid dfs2(int u,ll sum){\\n\\tdist[u]=sum;\\n\\trep(i,T[u].size()){\\n\\t\\tedge e=T[u][i];\\n\\t\\tdfs2(e.v,sum^e.cost);\\n\\t}\\n}\\n\\nint main(){\\n\\tint m,q; scanf(\\\"%d%d%d\\\",&n,&m,&q);\\n\\trep(i,m){\\n\\t\\tint u,v;\\n\\t\\tll cost; scanf(\\\"%d%d%lld\\\",&u,&v,&cost);\\n\\t\\tG[u].push_back((edge){u,v,cost});\\n\\t\\tG[v].push_back((edge){v,u,cost});\\n\\t}\\n\\n\\tdfs1(0);\\n\\tdfs2(0,0);\\n\\n\\tll basis[60]={};\\n\\trep(u,n) rep(i,G[u].size()) {\\n\\t\\tedge e=G[u][i];\\n\\t\\tll sum=dist[e.u]^dist[e.v]^e.cost;\\n\\t\\tint i0=-1;\\n\\t\\tfor(int i=59;i>=0;i--){\\n\\t\\t\\tif(sum&(1LL<<i)){\\n\\t\\t\\t\\tsum^=basis[i];\\n\\t\\t\\t\\tif(sum&(1LL<<i)){ i0=i; break; }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(i0!=-1) basis[i0]=sum;\\n\\t}\\n\\n\\twhile(q--){\\n\\t\\tint u,v; scanf(\\\"%d%d\\\",&u,&v);\\n\\t\\tll ans=dist[u]^dist[v];\\n\\t\\tfor(int i=59;i>=0;i--){\\n\\t\\t\\tif((ans&(1LL<<i))==0){\\n\\t\\t\\t\\tans^=basis[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 19372,\n \"score_of_the_acc\": -0.7161,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2416_468467\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <memory.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i< n; i++)\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst int maxn = 100010;\\n\\nll dist[maxn];\\nvector<P> G[maxn];\\n\\nvector<ll> bfs(){\\n queue<ll> que;\\n vector<ll> res;\\n memset(dist, -1, sizeof(dist));\\n dist[0] = 0;\\n que.push(0);\\n \\n while(!que.empty()){\\n int v = que.front(); que.pop();\\n rep(i, (int)G[v].size()){\\n int to = G[v][i].first;\\n ll cost = G[v][i].second;\\n if(dist[to] == -1){\\n\\tdist[to] = dist[v] ^ cost;\\n\\tque.push(to);\\n }else{\\n\\tif(dist[to] ^ dist[v] ^ cost) res.push_back(dist[to] ^ dist[v] ^ cost);\\n }\\n }\\n }\\n return res;\\n}\\n\\nvector<ll> collect(vector<ll> cycle){\\n int n = cycle.size();\\n vector<ll> res(60, 0);\\n for(int i = 59; i >= 0; i--){\\n rep(j, n){\\n if((cycle[j] >> i) & 1){\\n\\tres[i] = cycle[j];\\n\\trep(k, n){\\n\\t if(k != j && ((cycle[k] >> i) & 1)) cycle[k] ^= cycle[j];\\n\\t}\\n\\tcycle[j] = 0;\\n\\tbreak;\\n }\\n }\\n }\\n return res;\\n}\\n\\nll calc(ll res, const vector<ll> &base){\\n for(int i = 59; i >= 0; i--){\\n if(((base[i] ^ res) >> i) & 1) res ^= base[i]; \\n }\\n return res;\\n}\\n\\nint main(){\\n ll N, M, Q, a, b, f, t, p;\\n \\n cin >> N >> M >> Q;\\n rep(i, M) {\\n cin >> f >> t >> p;\\n G[f].push_back(P(t, p));\\n G[t].push_back(P(f, p));\\n }\\n \\n vector<ll> cycle = bfs();\\n vector<ll> base = collect(cycle);\\n \\n rep(i, Q){\\n cin >> a >> b;\\n cout << calc(dist[a] ^ dist[b], base) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 15060,\n \"score_of_the_acc\": -0.7458,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2416_468443\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <memory.h>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i< n; i++)\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst int maxn = 100010;\\n\\nbool used[maxn];\\nll dist[maxn];\\nvector<P> G[maxn];\\nvector<ll> cycle;\\nvector<ll> base;\\n\\nvoid dfs(int v, int pre, ll d, ll *dist, vector<ll> &cycle){\\n used[v] = true;\\n dist[v] = d;\\n rep(i, (int)G[v].size()){\\n int to = G[v][i].first;\\n ll cost = G[v][i].second; \\n if(to == pre) continue;\\n if(!used[to]){\\n dfs(to, v, d ^ cost, dist, cycle);\\n }else{\\n cycle.push_back(dist[to] ^ dist[v] ^ cost);\\n }\\n }\\n}\\n\\nvector<ll> collect(vector<ll> cycle){\\n int n = cycle.size();\\n vector<ll> res(60, 0);\\n for(int i = 59; i >= 0; i--){\\n rep(j, n){\\n if((cycle[j] >> i) & 1){\\n\\tres[i] = cycle[j];\\n\\trep(k, n){\\n\\t if(k != j && ((cycle[k] >> i) & 1)) cycle[k] ^= cycle[j];\\n\\t}\\n\\tcycle[j] = 0;\\n\\tbreak;\\n }\\n }\\n }\\n return res;\\n}\\n\\nll calc(ll res, const vector<ll> &base){\\n for(int i = 59; i >= 0; i--){\\n if(((base[i] ^ res) >> i) & 1) res ^= base[i]; \\n }\\n return res;\\n}\\n\\nint main(){\\n ll N, M, Q, a, b, f, t, p;\\n memset(used, false, sizeof(used));\\n memset(dist, 0, sizeof(dist));\\n\\n cin >> N >> M >> Q;\\n rep(i, M) {\\n cin >> f >> t >> p;\\n G[f].push_back(P(t, p));\\n G[t].push_back(P(f, p));\\n }\\n \\n dfs(0, -1, 0, dist, cycle);\\n base = collect(cycle);\\n \\n rep(i, Q){\\n cin >> a >> b;\\n cout << calc(dist[a] ^ dist[b], base) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.625,\n \"time_ms\": 340,\n \"memory_kb\": 17772,\n \"score_of_the_acc\": -0.7588,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2416_459122\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <sstream>\\n#include <cstdio>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cassert>\\n#include <climits>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <valarray>\\n#include <bitset>\\n#include <stack>\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0;i<(int)n;++i)\\n#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n#define ALL(c) (c).begin(), (c).end()\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\nconst int INF = 1<<29;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-8;\\n\\nstruct Edge {\\n int f;\\n int t;\\n ll p;\\n Edge(int f, int t, ll p) : f(f),t(t),p(p) {}\\n};\\nvector<Edge> g[100000];\\nint visited[100000];\\nll dist[100000];\\nll base[100];\\n\\nvoid add(ll w) {\\n for (int i=59; i>=0; --i) {\\n if (w>>i&1) {\\n if (base[i]) {\\n w ^= base[i];\\n } else {\\n base[i] = w;\\n return;\\n }\\n }\\n }\\n}\\n\\nvoid dfs(int now, ll w) {\\n if (visited[now] == 2) return;\\n if (visited[now] == 1) {\\n // loop\\n // cout << now << \\\" \\\" << w << \\\" \\\" << dist[now] << \\\" \\\" << (dist[now]^w) << endl;\\n add(dist[now] ^ w);\\n return;\\n }\\n visited[now] = 1;\\n dist[now] = w;\\n FOR(it, g[now]) {\\n dfs(it->t,w^it->p);\\n }\\n visited[now] = 2;\\n}\\n\\nint main() {\\n int n, m, q;\\n cin >> n >> m >> q;\\n REP(i,m) {\\n int f,t;\\n ll p;\\n cin >> f >> t >> p;\\n g[f].push_back(Edge(f,t,p));\\n g[t].push_back(Edge(t,f,p));\\n }\\n memset(visited,0,sizeof(visited));\\n memset(base,0,sizeof(base));\\n dfs(0,0);\\n while(q--) {\\n int a, b;\\n cin >> a >> b;\\n ll w = dist[a]^dist[b];\\n for (int i=59; i>=0; --i) {\\n if (!(w>>i&1)) {\\n w ^= base[i];\\n }\\n }\\n cout << w << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 11000,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1382,"cells":{"group_id":{"kind":"string","value":"aoj_2422_cpp"},"problem_description":{"kind":"string","value":"Transparent Mahjong\nF: 透明な麻雀牌\nあなたは，闇に舞い降りた天災と噂されるギャンブラーの鷹巣さんと麻雀で対局することになった．\n鷹巣さんは天災と噂されるだけあって，鷹巣牌という奇怪な麻雀牌を用いた対局を提案してきた．\n麻雀とは，プレイヤーが互いに手牌という複数枚の牌を持ち合い，自分の手牌を相手よりもはやく，アガリの形にすることで勝利が確定するゲームである．\n麻雀の牌の表側には，その牌が何であるかが描かれており，牌の裏側には，何も描かれていない．\nよって，あなたが麻雀で対局するときは，あなたの手牌の表側をあなたの側に，裏側を対局者の側に向けるとよい．\nこうすることで，あなたの手牌が何であるかは，あなたのみが知ることができる．\n麻雀の醍醐味は，プレイヤーが互の手配を読み合い，それを楽しむことにある．\nしかしながら，鷹巣牌は透明な麻雀牌である．\n鷹巣牌は透明であるため，プレイヤーは互いに相手の手牌を知ることができる．\nこれでは，手配の読み合いを楽しむことができない．\n「もはや，これは麻雀ではない．」と，鷹巣牌を用いることに納得できないあなたは，鷹巣さんとの紆余曲折を経た協議の結果，鷹巣牌と普通の麻雀牌を混ぜて対局することになった．\n手始めに，あなたは，鷹巣さんの手牌のアガリ牌が何であるかを予想することにした．\n鷹巣さんの手牌は，鷹巣牌と普通の牌から構成される．\n問題の簡単のため，鷹巣牌と普通の牌は，1から12の12種類各4枚からなるものとする．\n3\nn\n+2枚の牌からなる手牌について，次の3つの条件が満たされるとき，その手牌はアガリである．\n同じ数字を組み合わせた牌の組が1つ存在する\n残りの3\nn\n枚の牌は，3個の数字の組合せの\nn\nグループになる\nそれぞれのグループは，同じ数字を3つ組み合わせたものか，3つの連続する数字を組み合わせたものである\n例えば，\n1 1 1 3 3 3 5 5 5 7 7 7 8 9\nのような14枚の牌は，全て鷹巣牌で構成されている．\nこの場合，次のように2つの牌の組合せ1つと4つのグループを作ることができ，アガリである．\n(1 1 1) (3 3 3) (5 5 5) (7 7) (7 8 9)\n次に，普通の牌と鷹巣牌が混ざった手牌の例を挙げる．\n1 1 1 3 3 3 5 5 5 7 7 7 * *\nのような14枚の牌は，12枚の鷹巣牌と2枚の普通の牌(*)で構成されている．\nこの場合，次のように2つの普通の牌が8と9であるかもしれないので，2つの牌の組合せ1つと4つのグループを作ることができ，アガリであるかもしれない．\n(1 1 1) (3 3 3) (5 5 5) (7 7) (7 [8] [9])\n同じ例について，次のように2つの普通の牌が8と8であるかもしれないので，以下のような形のアガリであるかもしれない．\n(1 1 1) (3 3 3) (5 5 5) (7 7 7) ([8] [8])\nしかし，7という同じ牌は4枚までしか使えないので，以下のような形のアガリであることはない．\n(1 1 1) (3 3 3) (5 5 5) (7 7 7) ([7] [7])\n鷹巣さんの3\nn\n+1枚の手牌が入力として与えられたときに，\n鷹巣さんの手牌に1枚の牌を加えて，3\nn\n+2枚の手牌を作ることを考える．\nこのときに，3\nn\n+2枚の手牌がアガリになり得るような加える1枚の牌(アガリ牌)を全て求めよ．\nInput\n入力は，次の形式で与えられる．\nn\n牌\n1\n牌\n2\n...\n牌\n3n+1\n入力データは次の条件を満たす\nn\nは，0 <=\nn\n<= 15を満たす．\n各牌は，鷹巣牌か普通の牌である．鷹巣牌の場合は，1以上12以下の整数で表され，普通の牌の場合は，文字*で表される．\nOutput\nアガリ牌の一覧を昇順に出力せよ．アガリ牌を1つ出力する度に改行を出力せよ．\nあがり牌がない場合は，-1を1行に表示せよ．\nSample Input 1\n4\n1 1 1 3 3 3 5 5 5 7 7 7 9\nSample Output 1\n8\n9\nSample Input 2\n4\n1 2 2 3 3 4 5 6 7 8 8 8 9\nSample Output 2\n1\n4\n7\n9\n10\nSample Input 3\n4\n1 1 1 4 4 4 7 7 7 8 8 9 *\nSample Output 3\n6\n7\n8\n9\n10\n11\nSample Input 4\n4\n1 * * * * * * * * * * * *\nSample Output 4\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\nSample Input 5\n1\n3 * 1 4\nSample Output 5\n1\n2\n4\n5"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2422_10342585","code_snippet":"// AOJ #2422 Transparent Mahjong\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n;\nvector<int> orig(13);\nunordered_map<string,bool> memo;\n\nstring enc(const vector<int>& f, int w, const vector<int>& a) {\n string s = to_string(w);\n for (int i = 1; i <= 12; i++) s += \",\" + to_string(f[i]) + \",\" + to_string(a[i]);\n return s;\n}\n\nbool dfs(vector<int>& f, int w, vector<int>& a) {\n int tot = w;\n for (int i = 1; i <= 12; i++) tot += f[i];\n if(tot == 0) return true;\n string key = enc(f,w,a);\n if(memo.count(key)) return memo[key];\n bool flag = false;\n bool all0 = true;\n for (int i = 1; i <= 12; i++) if(f[i] > 0){ all0 = false; break; }\n\n if(all0){\n if(w % 3 != 0) return memo[key] = false;\n int k = w / 3;\n int cnt = 0;\n for (int i = 1; i <= 12; i++) if(4 - orig[i] - a[i] >= 3) cnt++;\n return memo[key] = (cnt >= k);\n }\n\n int idx = 1;\n while(idx <= 12 && f[idx] == 0) idx++;\n if(idx > 12) return memo[key] = false;\n int need = max(0, 3 - f[idx]);\n if(need <= w && a[idx] + need <= 4 - orig[idx]) {\n int backup = f[idx];\n int used = min(f[idx], 3);\n f[idx] -= used;\n a[idx] += need;\n if(dfs(f, w - need, a)) { flag = true; }\n a[idx] -= need;\n f[idx] = backup;\n if(flag){ memo[key] = true; return true; }\n }\n if(idx <= 10) {\n int needTotal = 0;\n vector<int> needArr(13,0);\n bool poss = true;\n for (int j = idx; j <= idx+2; j++){\n if(f[j] >= 1) needArr[j] = 0;\n else needArr[j] = 1;\n if(a[j] + needArr[j] > 4 - orig[j]) poss = false;\n needTotal += needArr[j];\n }\n if(poss && needTotal <= w) {\n vector<int> back(13);\n for (int j = idx; j <= idx+2; j++){\n back[j] = f[j];\n if(f[j] >= 1) f[j]--;\n a[j] += needArr[j];\n }\n if(dfs(f, w - needTotal, a)) { flag = true; }\n for (int j = idx; j <= idx+2; j++){\n a[j] -= needArr[j];\n f[j] = back[j];\n }\n if(flag){ memo[key] = true; return true; }\n }\n }\n memo[key] = flag;\n return flag;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> n;\n int total = 3*n + 1;\n vector<string> in(total);\n vector<int> cnt(13, 0);\n int wc = 0;\n for (int i = 0; i < total; i++){\n cin >> in[i];\n if(in[i]==\"*\") wc++;\n else cnt[stoi(in[i])]++;\n }\n\n vector<int> ans;\n for (int x = 1; x <= 12; x++){\n if(cnt[x] == 4) continue;\n vector<int> c = cnt;\n c[x]++;\n int tot2 = wc;\n for (int i = 1; i <= 12; i++) tot2 += c[i];\n if(tot2 != 3*n + 2) continue;\n bool ok = false;\n for (int p = 1; p <= 12; p++){\n int need = max(0, 2 - c[p]);\n if(need > wc) continue;\n if(c[p] + need > 4) continue;\n vector<int> f(13,0), a(13,0);\n for (int i = 1; i <= 12; i++) f[i] = c[i];\n int use = min(f[p], 2);\n f[p] -= use;\n a[p] = need;\n int wleft = wc - need;\n orig = f;\n memo.clear();\n if(dfs(f, wleft, a)){ ok = true; break; }\n }\n if(ok) ans.push_back(x);\n }\n if(ans.empty()) cout << -1 << endl;\n else {\n sort(ans.begin(), ans.end());\n for (auto v: ans) cout << v << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3576,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_2422_521274","code_snippet":"#include<cstdio>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint n,star;\nint cnt[12]; // 数字 i が書かれた牌はあと i 個\nint rem[12]; // * が i に成れるのは rem[i] 個まで\n\nbool dfs(int i){\n\tif(i==12) return star==0;\n\n\tif(cnt[i]==0){\n\t\tif(dfs(i+1)) return true;\n\t}\n\n\t// i, i, i\n\tif(cnt[i]+min(star,rem[i])>=3){\n\t\tint tmp=min(cnt[i],3);\n\t\tcnt[i]-=tmp;\n\t\tstar-=3-tmp;\n\t\trem[i]-=3-tmp;\n\t\tbool res=dfs(i);\n\t\tcnt[i]+=tmp;\n\t\tstar+=3-tmp;\n\t\trem[i]+=3-tmp;\n\t\tif(res) return true;\n\t}\n\n\t// i, i+1, i+2\n\tif(i<=9){\n\t\tbool b=true; // i, i+1, i+2 の割り当てが可能かどうか\n\t\tint minus=0;\n\t\trep(j,3){\n\t\t\tif(cnt[i+j]==0 && min(star-minus,rem[i+j])==0) b=false;\n\t\t\tif(cnt[i+j]==0) minus++;\n\t\t}\n\t\tif(b){\n\t\t\tbool used[3]={};\n\t\t\trep(j,3){\n\t\t\t\tif(cnt[i+j]>0) cnt[i+j]--, used[j]=true;\n\t\t\t\telse star--, rem[i+j]--;\n\t\t\t}\n\t\t\tbool res=dfs(i);\n\t\t\trep(j,3){\n\t\t\t\tif(used[j]) cnt[i+j]++;\n\t\t\t\telse star++, rem[i+j]++;\n\t\t\t}\n\t\t\tif(res) return true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main(){\n\tscanf(\"%d\",&n);\n\tint hai[47],star=0;\n\trep(i,3*n+1){\n\t\tchar s[4]; scanf(\"%s\",s);\n\t\tif(s[0]=='*'){\n\t\t\thai[i]=-1;\n\t\t\tstar++;\n\t\t}\n\t\telse{\n\t\t\thai[i]=atoi(s)-1;\n\t\t\tcnt[hai[i]]++;\n\t\t}\n\t}\n\n\tbool none=true;\n\trep(a,12) if(cnt[a]<4) { // 3*n+2 枚目の牌\n\t\thai[3*n+1]=a;\n\t\tcnt[a]++;\n\n\t\trep(i,12) rem[i]=4-cnt[i];\n\n\t\tbool ok=false;\n\t\trep(b,12) if(cnt[b]+star>=2) { // 最後の二つの牌\n\t\t\tint tmp1[47],tmp2[12],tmp3[12];\n\t\t\tmemcpy(tmp1,hai,sizeof hai);\n\t\t\tmemcpy(tmp2,cnt,sizeof cnt);\n\t\t\tmemcpy(tmp3,rem,sizeof rem);\n\n\t\t\t::star=star;\n\t\t\tint m=3*n+2,two=2;\n\t\t\trep(i,m) if(two>0 && hai[i]== b) swap(hai[i],hai[m-1]), i--, m--, two--, cnt[b]--;\n\t\t\trep(i,m) if(two>0 && hai[i]==-1) swap(hai[i],hai[m-1]), i--, m--, two--, rem[b]--, ::star--;\n\t\t\tok=dfs(0);\n\n\t\t\tmemcpy(hai,tmp1,sizeof hai);\n\t\t\tmemcpy(cnt,tmp2,sizeof cnt);\n\t\t\tmemcpy(rem,tmp3,sizeof rem);\n\n\t\t\tif(ok) break;\n\t\t}\n\n\t\tif(ok) printf(\"%d\\n\",a+1), none=false;\n\n\t\tcnt[a]--;\n\t}\n\tif(none) puts(\"-1\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1028,"score_of_the_acc":-0.3846,"final_rank":1},{"submission_id":"aoj_2422_521272","code_snippet":"#include<cstdio>\n#include<cassert>\n#include<cstring>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint n,star;\nint cnt[12]; // 数字 i が書かれた牌はあと i 個\nint rem[12]; // * が i に成れるのは rem[i] 個まで\n\nbool dfs(int i){\n\tif(i==12) return star==0;\n\n\tif(cnt[i]==0){\n\t\tif(dfs(i+1)) return true;\n\t}\n\n\t// i, i, i\n\tif(cnt[i]+min(star,rem[i])>=3){\n\t\tint tmp=min(cnt[i],3);\n\t\tcnt[i]-=tmp;\n\t\tstar-=3-tmp;\n\t\trem[i]-=3-tmp;\n\t\tassert(cnt[i]>=0);\n\t\tassert(star>=0);\n\t\tassert(rem[i]>=0);\n\t\tbool res=dfs(i);\n\t\tcnt[i]+=tmp;\n\t\tstar+=3-tmp;\n\t\trem[i]+=3-tmp;\n\t\tif(res) return true;\n\t}\n\n\t// i, i+1, i+2\n\tif(i<=9){\n\t\tbool b=true; // i, i+1, i+2 の割り当てが可能かどうか\n\t\tint minus=0;\n\t\trep(j,3){\n\t\t\tif(cnt[i+j]==0 && min(star-minus,rem[i+j])==0) b=false;\n\t\t\tif(cnt[i+j]==0) minus++;\n\t\t}\n\t\tif(b){\n\t\t\tbool used[3]={};\n\t\t\trep(j,3){\n\t\t\t\tif(cnt[i+j]>0) cnt[i+j]--, used[j]=true;\n\t\t\t\telse star--, rem[i+j]--;\n\t\t\t\tassert(cnt[i+j]>=0);\n\t\t\t\tassert(star>=0);\n\t\t\t\tassert(rem[i+j]>=0);\n\t\t\t}\n\t\t\tbool res=dfs(i);\n\t\t\trep(j,3){\n\t\t\t\tif(used[j]) cnt[i+j]++;\n\t\t\t\telse star++, rem[i+j]++;\n\t\t\t}\n\t\t\tif(res) return true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nint main(){\n\tscanf(\"%d\",&n);\n\tint hai[47],star=0;\n\trep(i,3*n+1){\n\t\tchar s[4]; scanf(\"%s\",s);\n\t\tif(s[0]=='*'){\n\t\t\thai[i]=-1;\n\t\t\tstar++;\n\t\t}\n\t\telse{\n\t\t\thai[i]=atoi(s)-1;\n\t\t\tcnt[hai[i]]++;\n\t\t}\n\t}\n\n\tbool none=true;\n\trep(a,12) if(cnt[a]<4) { // 3*n+2 枚目の牌\n\t\thai[3*n+1]=a;\n\t\tcnt[a]++;\n\n\t\trep(i,12) rem[i]=4-cnt[i];\n\n\t\tbool ok=false;\n\t\trep(b,12) if(cnt[b]+star>=2) { // 最後の二つの牌\n\t\t\tint tmp1[47],tmp2[12],tmp3[12];\n\t\t\tmemcpy(tmp1,hai,sizeof hai);\n\t\t\tmemcpy(tmp2,cnt,sizeof cnt);\n\t\t\tmemcpy(tmp3,rem,sizeof rem);\n\n\t\t\t::star=star;\n\t\t\tint m=3*n+2,two=2;\n\t\t\trep(i,m) if(two>0 && hai[i]== b) swap(hai[i],hai[m-1]), i--, m--, two--, cnt[b]--;\n\t\t\trep(i,m) if(two>0 && hai[i]==-1) swap(hai[i],hai[m-1]), i--, m--, two--, rem[b]--, ::star--;\n\t\t\tassert(two==0);\n\t\t\tok=dfs(0);\n\n\t\t\tmemcpy(hai,tmp1,sizeof hai);\n\t\t\tmemcpy(cnt,tmp2,sizeof cnt);\n\t\t\tmemcpy(rem,tmp3,sizeof rem);\n\n\t\t\tif(ok) break;\n\t\t}\n\n\t\tif(ok) printf(\"%d\\n\",a+1), none=false;\n\n\t\tcnt[a]--;\n\t}\n\tif(none) puts(\"-1\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1028,"score_of_the_acc":-0.3846,"final_rank":1},{"submission_id":"aoj_2422_484001","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <iomanip>\n#include <algorithm>\n#include <cmath>\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 <climits>\n#include <cfloat>\nusing namespace std;\n\nvector<int> a(12, 4);\nvector<int> washizu(12, 0);\nvector<bool> ret(12, false);\n\nvoid solve(int i, int n)\n{\n if(n == 0){\n vector<int> select(12, 0);\n for(int j=0; j<12; ++j)\n select[j] = 4 - a[j];\n\n for(int j=0; j<12; ++j){ // 対子\n if(a[j] < 2)\n continue;\n\n select[j] += 2;\n\n bool ok = true;\n for(int k=0; k<12; ++k){\n if(select[k] < washizu[k])\n ok = false;\n }\n\n if(ok){\n for(int k=0; k<12; ++k){\n if(select[k] > washizu[k])\n ret[k] = true;\n }\n }\n\n select[j] -= 2;\n }\n return;\n }\n\n if(i < 12){ // 刻子\n if(a[i] >= 3){\n a[i] -= 3;\n solve(i+1, n-1);\n a[i] += 3;\n }\n solve(i+1, n);\n }else if(i < 22){ // 順子\n int j = i - 12;\n if(a[j] > 0 && a[j+1] > 0 && a[j+2] > 0){\n -- a[j];\n -- a[j+1];\n -- a[j+2];\n solve(i, n-1);\n ++ a[j+2];\n ++ a[j+1];\n ++ a[j];\n }\n solve(i+1, n);\n }\n}\n\nint main()\n{\n int n;\n cin >> n;\n\n for(int i=0; i<3*n+1; ++i){\n string s;\n cin >> s;\n if(s != \"*\"){\n int x = atoi(s.c_str());\n -- x;\n ++ washizu[x];\n }\n }\n\n solve(0, n);\n\n bool ng = true;\n for(int i=0; i<12; ++i){\n if(ret[i]){\n cout << (i + 1) << endl;\n ng = false;\n }\n }\n if(ng)\n cout << -1 << endl;\n\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":1220,"score_of_the_acc":-0.8446,"final_rank":3},{"submission_id":"aoj_2422_483779","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n\nusing namespace std;\n\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\n#define REP(i,n) FOR(i,0,n)\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\n\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\" \"; cout<<endl; }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint n, m;\nint cnt[13];\nint cn[13]; //tmpcnt\nint rest[13]; //rest of use\nint usenum; //use number\nint S; // bit\ntypedef pair<int, int> P;\ntypedef pair<P, int> PP;\nset<PP> memo;\nbool dfs(int idx){\n if(memo.count(make_pair(make_pair(idx, usenum), cn[12]))) return false;\n memo.insert(make_pair(make_pair(idx, usenum), cn[12]));\n if(usenum >= n) return true;\n if(idx > 11) return false;\n if(S & (1 << usenum)){\n //111\n for(int i = 0; i <= 3; i++){\n if(cn[idx] < i) break;\n if(rest[idx] < 3 - i || cn[12] < 3 - i) continue;\n usenum ++;\n cn[idx] -= i;\n rest[idx] -= 3 - i;\n cn[12] -= 3 - i;\n if(dfs(idx)) return true;\n usenum --;\n cn[idx] += i;\n rest[idx] += 3 - i;\n cn[12] += 3 - i;\n }\n if(cn[idx] > 0) return false;\n return dfs(idx + 1);\n }else{\n //123\n if(idx + 2 > 11) return false;\n for(int S2 = 0; S2 < 1<<3; S2++){\n bool ok = true;\n if(__builtin_popcount(S2) > cn[12]) ok = false;\n for(int i = 0; i <= 2; i++){\n if(S2 & (1 << i)){\n if(rest[idx+i] == 0) ok = false;\n }else{\n // not use\n if(cn[idx+i] == 0) ok = false;\n }\n }\n if(!ok) continue;\n usenum ++;\n for(int i = 0; i <= 2; i++){\n if(S2 & (1 << i)){\n rest[idx+i] -= 1;\n cn[12] -= 1;\n }else{\n // not use\n cn[idx+i] -= 1;\n }\n }\n assert(cn[12] >= 0);\n if(dfs(idx)) return true;\n usenum --;\n for(int i = 0; i <= 2; i++){\n if(S2 & (1 << i)){\n rest[idx+i] += 1;\n cn[12] += 1;\n }else{\n // not use\n cn[idx+i] += 1;\n }\n }\n }\n if(cn[idx] > 0) return false;\n return dfs(idx + 1);\n }\n return false;\n}\nbool ok(){\n /*\n for(int i = 0; i < 13; i++){\n printf(\"%d:%d\\n\", i, cnt[i]);\n }\n */\n for(int two = 0; two < 12; two++){\n REP(i, 13)cn[i] = cnt[i];\n REP(i, 12)rest[i] = 4 - cnt[i];\n if(cn[two] + cn[12] >= 2){\n int r = min(cn[two], 2);\n if(rest[two] >= 2 - r){\n cn[two] -= r;\n cn[12] -= 2 - r;\n rest[two] -= 2 - r;\n }\n }\n else continue;\n /*\n for(int i = 0; i < 13; i++){\n printf(\"%d:%d\\n\", i, cn[i]);\n }\n */\n REP(tS, 1<<n){\n usenum = 0;\n S = tS;\n memo.clear();\n if(dfs(0)) return true;\n }\n }\n return false;\n}\n\nint main(){\n while(cin>>n){\n memset(cnt, 0, sizeof(cnt));\n m = 3 * n + 2;\n REP(i, m - 1){\n string s; cin>>s;\n if(s == \"*\"){\n cnt[12]++;\n continue;\n }\n stringstream ss(s);\n int n;\n ss>>n;\n cnt[n-1]++;\n }\n int asss = 0;\n REP(i, 12){\n assert(cnt[i] <= 4);\n if(cnt[i] == 4) continue;\n cnt[i]++;\n if(ok()) {\n cout<<i+1<<endl;\n asss++;\n }\n cnt[i]--;\n }\n if(asss == 0) cout<<-1<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":1248,"score_of_the_acc":-1.0863,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2422_10342585\",\n \"code_snippet\": \"// AOJ #2422 Transparent Mahjong\\n// 2025.4.2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint n;\\nvector<int> orig(13);\\nunordered_map<string,bool> memo;\\n\\nstring enc(const vector<int>& f, int w, const vector<int>& a) {\\n string s = to_string(w);\\n for (int i = 1; i <= 12; i++) s += \\\",\\\" + to_string(f[i]) + \\\",\\\" + to_string(a[i]);\\n return s;\\n}\\n\\nbool dfs(vector<int>& f, int w, vector<int>& a) {\\n int tot = w;\\n for (int i = 1; i <= 12; i++) tot += f[i];\\n if(tot == 0) return true;\\n string key = enc(f,w,a);\\n if(memo.count(key)) return memo[key];\\n bool flag = false;\\n bool all0 = true;\\n for (int i = 1; i <= 12; i++) if(f[i] > 0){ all0 = false; break; }\\n\\n if(all0){\\n if(w % 3 != 0) return memo[key] = false;\\n int k = w / 3;\\n int cnt = 0;\\n for (int i = 1; i <= 12; i++) if(4 - orig[i] - a[i] >= 3) cnt++;\\n return memo[key] = (cnt >= k);\\n }\\n\\n int idx = 1;\\n while(idx <= 12 && f[idx] == 0) idx++;\\n if(idx > 12) return memo[key] = false;\\n int need = max(0, 3 - f[idx]);\\n if(need <= w && a[idx] + need <= 4 - orig[idx]) {\\n int backup = f[idx];\\n int used = min(f[idx], 3);\\n f[idx] -= used;\\n a[idx] += need;\\n if(dfs(f, w - need, a)) { flag = true; }\\n a[idx] -= need;\\n f[idx] = backup;\\n if(flag){ memo[key] = true; return true; }\\n }\\n if(idx <= 10) {\\n int needTotal = 0;\\n vector<int> needArr(13,0);\\n bool poss = true;\\n for (int j = idx; j <= idx+2; j++){\\n if(f[j] >= 1) needArr[j] = 0;\\n else needArr[j] = 1;\\n if(a[j] + needArr[j] > 4 - orig[j]) poss = false;\\n needTotal += needArr[j];\\n }\\n if(poss && needTotal <= w) {\\n vector<int> back(13);\\n for (int j = idx; j <= idx+2; j++){\\n back[j] = f[j];\\n if(f[j] >= 1) f[j]--;\\n a[j] += needArr[j];\\n }\\n if(dfs(f, w - needTotal, a)) { flag = true; }\\n for (int j = idx; j <= idx+2; j++){\\n a[j] -= needArr[j];\\n f[j] = back[j];\\n }\\n if(flag){ memo[key] = true; return true; }\\n }\\n }\\n memo[key] = flag;\\n return flag;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n cin >> n;\\n int total = 3*n + 1;\\n vector<string> in(total);\\n vector<int> cnt(13, 0);\\n int wc = 0;\\n for (int i = 0; i < total; i++){\\n cin >> in[i];\\n if(in[i]==\\\"*\\\") wc++;\\n else cnt[stoi(in[i])]++;\\n }\\n\\n vector<int> ans;\\n for (int x = 1; x <= 12; x++){\\n if(cnt[x] == 4) continue;\\n vector<int> c = cnt;\\n c[x]++;\\n int tot2 = wc;\\n for (int i = 1; i <= 12; i++) tot2 += c[i];\\n if(tot2 != 3*n + 2) continue;\\n bool ok = false;\\n for (int p = 1; p <= 12; p++){\\n int need = max(0, 2 - c[p]);\\n if(need > wc) continue;\\n if(c[p] + need > 4) continue;\\n vector<int> f(13,0), a(13,0);\\n for (int i = 1; i <= 12; i++) f[i] = c[i];\\n int use = min(f[p], 2);\\n f[p] -= use;\\n a[p] = need;\\n int wleft = wc - need;\\n orig = f;\\n memo.clear();\\n if(dfs(f, wleft, a)){ ok = true; break; }\\n }\\n if(ok) ans.push_back(x);\\n }\\n if(ans.empty()) cout << -1 << endl;\\n else {\\n sort(ans.begin(), ans.end());\\n for (auto v: ans) cout << v << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2422_521274\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstring>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint n,star;\\nint cnt[12]; // 数字 i が書かれた牌はあと i 個\\nint rem[12]; // * が i に成れるのは rem[i] 個まで\\n\\nbool dfs(int i){\\n\\tif(i==12) return star==0;\\n\\n\\tif(cnt[i]==0){\\n\\t\\tif(dfs(i+1)) return true;\\n\\t}\\n\\n\\t// i, i, i\\n\\tif(cnt[i]+min(star,rem[i])>=3){\\n\\t\\tint tmp=min(cnt[i],3);\\n\\t\\tcnt[i]-=tmp;\\n\\t\\tstar-=3-tmp;\\n\\t\\trem[i]-=3-tmp;\\n\\t\\tbool res=dfs(i);\\n\\t\\tcnt[i]+=tmp;\\n\\t\\tstar+=3-tmp;\\n\\t\\trem[i]+=3-tmp;\\n\\t\\tif(res) return true;\\n\\t}\\n\\n\\t// i, i+1, i+2\\n\\tif(i<=9){\\n\\t\\tbool b=true; // i, i+1, i+2 の割り当てが可能かどうか\\n\\t\\tint minus=0;\\n\\t\\trep(j,3){\\n\\t\\t\\tif(cnt[i+j]==0 && min(star-minus,rem[i+j])==0) b=false;\\n\\t\\t\\tif(cnt[i+j]==0) minus++;\\n\\t\\t}\\n\\t\\tif(b){\\n\\t\\t\\tbool used[3]={};\\n\\t\\t\\trep(j,3){\\n\\t\\t\\t\\tif(cnt[i+j]>0) cnt[i+j]--, used[j]=true;\\n\\t\\t\\t\\telse star--, rem[i+j]--;\\n\\t\\t\\t}\\n\\t\\t\\tbool res=dfs(i);\\n\\t\\t\\trep(j,3){\\n\\t\\t\\t\\tif(used[j]) cnt[i+j]++;\\n\\t\\t\\t\\telse star++, rem[i+j]++;\\n\\t\\t\\t}\\n\\t\\t\\tif(res) return true;\\n\\t\\t}\\n\\t}\\n\\n\\treturn false;\\n}\\n\\nint main(){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tint hai[47],star=0;\\n\\trep(i,3*n+1){\\n\\t\\tchar s[4]; scanf(\\\"%s\\\",s);\\n\\t\\tif(s[0]=='*'){\\n\\t\\t\\thai[i]=-1;\\n\\t\\t\\tstar++;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\thai[i]=atoi(s)-1;\\n\\t\\t\\tcnt[hai[i]]++;\\n\\t\\t}\\n\\t}\\n\\n\\tbool none=true;\\n\\trep(a,12) if(cnt[a]<4) { // 3*n+2 枚目の牌\\n\\t\\thai[3*n+1]=a;\\n\\t\\tcnt[a]++;\\n\\n\\t\\trep(i,12) rem[i]=4-cnt[i];\\n\\n\\t\\tbool ok=false;\\n\\t\\trep(b,12) if(cnt[b]+star>=2) { // 最後の二つの牌\\n\\t\\t\\tint tmp1[47],tmp2[12],tmp3[12];\\n\\t\\t\\tmemcpy(tmp1,hai,sizeof hai);\\n\\t\\t\\tmemcpy(tmp2,cnt,sizeof cnt);\\n\\t\\t\\tmemcpy(tmp3,rem,sizeof rem);\\n\\n\\t\\t\\t::star=star;\\n\\t\\t\\tint m=3*n+2,two=2;\\n\\t\\t\\trep(i,m) if(two>0 && hai[i]== b) swap(hai[i],hai[m-1]), i--, m--, two--, cnt[b]--;\\n\\t\\t\\trep(i,m) if(two>0 && hai[i]==-1) swap(hai[i],hai[m-1]), i--, m--, two--, rem[b]--, ::star--;\\n\\t\\t\\tok=dfs(0);\\n\\n\\t\\t\\tmemcpy(hai,tmp1,sizeof hai);\\n\\t\\t\\tmemcpy(cnt,tmp2,sizeof cnt);\\n\\t\\t\\tmemcpy(rem,tmp3,sizeof rem);\\n\\n\\t\\t\\tif(ok) break;\\n\\t\\t}\\n\\n\\t\\tif(ok) printf(\\\"%d\\\\n\\\",a+1), none=false;\\n\\n\\t\\tcnt[a]--;\\n\\t}\\n\\tif(none) puts(\\\"-1\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.3846,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2422_521272\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cassert>\\n#include<cstring>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint n,star;\\nint cnt[12]; // 数字 i が書かれた牌はあと i 個\\nint rem[12]; // * が i に成れるのは rem[i] 個まで\\n\\nbool dfs(int i){\\n\\tif(i==12) return star==0;\\n\\n\\tif(cnt[i]==0){\\n\\t\\tif(dfs(i+1)) return true;\\n\\t}\\n\\n\\t// i, i, i\\n\\tif(cnt[i]+min(star,rem[i])>=3){\\n\\t\\tint tmp=min(cnt[i],3);\\n\\t\\tcnt[i]-=tmp;\\n\\t\\tstar-=3-tmp;\\n\\t\\trem[i]-=3-tmp;\\n\\t\\tassert(cnt[i]>=0);\\n\\t\\tassert(star>=0);\\n\\t\\tassert(rem[i]>=0);\\n\\t\\tbool res=dfs(i);\\n\\t\\tcnt[i]+=tmp;\\n\\t\\tstar+=3-tmp;\\n\\t\\trem[i]+=3-tmp;\\n\\t\\tif(res) return true;\\n\\t}\\n\\n\\t// i, i+1, i+2\\n\\tif(i<=9){\\n\\t\\tbool b=true; // i, i+1, i+2 の割り当てが可能かどうか\\n\\t\\tint minus=0;\\n\\t\\trep(j,3){\\n\\t\\t\\tif(cnt[i+j]==0 && min(star-minus,rem[i+j])==0) b=false;\\n\\t\\t\\tif(cnt[i+j]==0) minus++;\\n\\t\\t}\\n\\t\\tif(b){\\n\\t\\t\\tbool used[3]={};\\n\\t\\t\\trep(j,3){\\n\\t\\t\\t\\tif(cnt[i+j]>0) cnt[i+j]--, used[j]=true;\\n\\t\\t\\t\\telse star--, rem[i+j]--;\\n\\t\\t\\t\\tassert(cnt[i+j]>=0);\\n\\t\\t\\t\\tassert(star>=0);\\n\\t\\t\\t\\tassert(rem[i+j]>=0);\\n\\t\\t\\t}\\n\\t\\t\\tbool res=dfs(i);\\n\\t\\t\\trep(j,3){\\n\\t\\t\\t\\tif(used[j]) cnt[i+j]++;\\n\\t\\t\\t\\telse star++, rem[i+j]++;\\n\\t\\t\\t}\\n\\t\\t\\tif(res) return true;\\n\\t\\t}\\n\\t}\\n\\n\\treturn false;\\n}\\n\\nint main(){\\n\\tscanf(\\\"%d\\\",&n);\\n\\tint hai[47],star=0;\\n\\trep(i,3*n+1){\\n\\t\\tchar s[4]; scanf(\\\"%s\\\",s);\\n\\t\\tif(s[0]=='*'){\\n\\t\\t\\thai[i]=-1;\\n\\t\\t\\tstar++;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\thai[i]=atoi(s)-1;\\n\\t\\t\\tcnt[hai[i]]++;\\n\\t\\t}\\n\\t}\\n\\n\\tbool none=true;\\n\\trep(a,12) if(cnt[a]<4) { // 3*n+2 枚目の牌\\n\\t\\thai[3*n+1]=a;\\n\\t\\tcnt[a]++;\\n\\n\\t\\trep(i,12) rem[i]=4-cnt[i];\\n\\n\\t\\tbool ok=false;\\n\\t\\trep(b,12) if(cnt[b]+star>=2) { // 最後の二つの牌\\n\\t\\t\\tint tmp1[47],tmp2[12],tmp3[12];\\n\\t\\t\\tmemcpy(tmp1,hai,sizeof hai);\\n\\t\\t\\tmemcpy(tmp2,cnt,sizeof cnt);\\n\\t\\t\\tmemcpy(tmp3,rem,sizeof rem);\\n\\n\\t\\t\\t::star=star;\\n\\t\\t\\tint m=3*n+2,two=2;\\n\\t\\t\\trep(i,m) if(two>0 && hai[i]== b) swap(hai[i],hai[m-1]), i--, m--, two--, cnt[b]--;\\n\\t\\t\\trep(i,m) if(two>0 && hai[i]==-1) swap(hai[i],hai[m-1]), i--, m--, two--, rem[b]--, ::star--;\\n\\t\\t\\tassert(two==0);\\n\\t\\t\\tok=dfs(0);\\n\\n\\t\\t\\tmemcpy(hai,tmp1,sizeof hai);\\n\\t\\t\\tmemcpy(cnt,tmp2,sizeof cnt);\\n\\t\\t\\tmemcpy(rem,tmp3,sizeof rem);\\n\\n\\t\\t\\tif(ok) break;\\n\\t\\t}\\n\\n\\t\\tif(ok) printf(\\\"%d\\\\n\\\",a+1), none=false;\\n\\n\\t\\tcnt[a]--;\\n\\t}\\n\\tif(none) puts(\\\"-1\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1028,\n \"score_of_the_acc\": -0.3846,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2422_484001\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <cmath>\\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 <climits>\\n#include <cfloat>\\nusing namespace std;\\n\\nvector<int> a(12, 4);\\nvector<int> washizu(12, 0);\\nvector<bool> ret(12, false);\\n\\nvoid solve(int i, int n)\\n{\\n if(n == 0){\\n vector<int> select(12, 0);\\n for(int j=0; j<12; ++j)\\n select[j] = 4 - a[j];\\n\\n for(int j=0; j<12; ++j){ // 対子\\n if(a[j] < 2)\\n continue;\\n\\n select[j] += 2;\\n\\n bool ok = true;\\n for(int k=0; k<12; ++k){\\n if(select[k] < washizu[k])\\n ok = false;\\n }\\n\\n if(ok){\\n for(int k=0; k<12; ++k){\\n if(select[k] > washizu[k])\\n ret[k] = true;\\n }\\n }\\n\\n select[j] -= 2;\\n }\\n return;\\n }\\n\\n if(i < 12){ // 刻子\\n if(a[i] >= 3){\\n a[i] -= 3;\\n solve(i+1, n-1);\\n a[i] += 3;\\n }\\n solve(i+1, n);\\n }else if(i < 22){ // 順子\\n int j = i - 12;\\n if(a[j] > 0 && a[j+1] > 0 && a[j+2] > 0){\\n -- a[j];\\n -- a[j+1];\\n -- a[j+2];\\n solve(i, n-1);\\n ++ a[j+2];\\n ++ a[j+1];\\n ++ a[j];\\n }\\n solve(i+1, n);\\n }\\n}\\n\\nint main()\\n{\\n int n;\\n cin >> n;\\n\\n for(int i=0; i<3*n+1; ++i){\\n string s;\\n cin >> s;\\n if(s != \\\"*\\\"){\\n int x = atoi(s.c_str());\\n -- x;\\n ++ washizu[x];\\n }\\n }\\n\\n solve(0, n);\\n\\n bool ng = true;\\n for(int i=0; i<12; ++i){\\n if(ret[i]){\\n cout << (i + 1) << endl;\\n ng = false;\\n }\\n }\\n if(ng)\\n cout << -1 << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1220,\n \"score_of_the_acc\": -0.8446,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2422_483779\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cassert>\\n\\nusing namespace std;\\n\\n#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)\\n#define REP(i,n) FOR(i,0,n)\\n#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)\\n\\ntemplate<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cout<<*i<<\\\" \\\"; cout<<endl; }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint n, m;\\nint cnt[13];\\nint cn[13]; //tmpcnt\\nint rest[13]; //rest of use\\nint usenum; //use number\\nint S; // bit\\ntypedef pair<int, int> P;\\ntypedef pair<P, int> PP;\\nset<PP> memo;\\nbool dfs(int idx){\\n if(memo.count(make_pair(make_pair(idx, usenum), cn[12]))) return false;\\n memo.insert(make_pair(make_pair(idx, usenum), cn[12]));\\n if(usenum >= n) return true;\\n if(idx > 11) return false;\\n if(S & (1 << usenum)){\\n //111\\n for(int i = 0; i <= 3; i++){\\n if(cn[idx] < i) break;\\n if(rest[idx] < 3 - i || cn[12] < 3 - i) continue;\\n usenum ++;\\n cn[idx] -= i;\\n rest[idx] -= 3 - i;\\n cn[12] -= 3 - i;\\n if(dfs(idx)) return true;\\n usenum --;\\n cn[idx] += i;\\n rest[idx] += 3 - i;\\n cn[12] += 3 - i;\\n }\\n if(cn[idx] > 0) return false;\\n return dfs(idx + 1);\\n }else{\\n //123\\n if(idx + 2 > 11) return false;\\n for(int S2 = 0; S2 < 1<<3; S2++){\\n bool ok = true;\\n if(__builtin_popcount(S2) > cn[12]) ok = false;\\n for(int i = 0; i <= 2; i++){\\n if(S2 & (1 << i)){\\n if(rest[idx+i] == 0) ok = false;\\n }else{\\n // not use\\n if(cn[idx+i] == 0) ok = false;\\n }\\n }\\n if(!ok) continue;\\n usenum ++;\\n for(int i = 0; i <= 2; i++){\\n if(S2 & (1 << i)){\\n rest[idx+i] -= 1;\\n cn[12] -= 1;\\n }else{\\n // not use\\n cn[idx+i] -= 1;\\n }\\n }\\n assert(cn[12] >= 0);\\n if(dfs(idx)) return true;\\n usenum --;\\n for(int i = 0; i <= 2; i++){\\n if(S2 & (1 << i)){\\n rest[idx+i] += 1;\\n cn[12] += 1;\\n }else{\\n // not use\\n cn[idx+i] += 1;\\n }\\n }\\n }\\n if(cn[idx] > 0) return false;\\n return dfs(idx + 1);\\n }\\n return false;\\n}\\nbool ok(){\\n /*\\n for(int i = 0; i < 13; i++){\\n printf(\\\"%d:%d\\\\n\\\", i, cnt[i]);\\n }\\n */\\n for(int two = 0; two < 12; two++){\\n REP(i, 13)cn[i] = cnt[i];\\n REP(i, 12)rest[i] = 4 - cnt[i];\\n if(cn[two] + cn[12] >= 2){\\n int r = min(cn[two], 2);\\n if(rest[two] >= 2 - r){\\n cn[two] -= r;\\n cn[12] -= 2 - r;\\n rest[two] -= 2 - r;\\n }\\n }\\n else continue;\\n /*\\n for(int i = 0; i < 13; i++){\\n printf(\\\"%d:%d\\\\n\\\", i, cn[i]);\\n }\\n */\\n REP(tS, 1<<n){\\n usenum = 0;\\n S = tS;\\n memo.clear();\\n if(dfs(0)) return true;\\n }\\n }\\n return false;\\n}\\n\\nint main(){\\n while(cin>>n){\\n memset(cnt, 0, sizeof(cnt));\\n m = 3 * n + 2;\\n REP(i, m - 1){\\n string s; cin>>s;\\n if(s == \\\"*\\\"){\\n cnt[12]++;\\n continue;\\n }\\n stringstream ss(s);\\n int n;\\n ss>>n;\\n cnt[n-1]++;\\n }\\n int asss = 0;\\n REP(i, 12){\\n assert(cnt[i] <= 4);\\n if(cnt[i] == 4) continue;\\n cnt[i]++;\\n if(ok()) {\\n cout<<i+1<<endl;\\n asss++;\\n }\\n cnt[i]--;\\n }\\n if(asss == 0) cout<<-1<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 1248,\n \"score_of_the_acc\": -1.0863,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1383,"cells":{"group_id":{"kind":"string","value":"aoj_2421_cpp"},"problem_description":{"kind":"string","value":"Markup language has Declined\nE: マークアップ言語は衰退しました\nわたしたち人類がゆるやかな衰退を迎えて，はや数世紀．\nすでに地球は”ぷろぐらまー”のものだったりします．\n平均身長170センチで7頭身，高い知能を持ち，こーでぃんぐが大好きなぷろぐらまーさんたち．\nわたしは，そんなぷろぐらまーさんと人との間を取り持つ重要な職，国際公務員の” えすいー ”となり，故郷のニブンキの里に帰ってきました．\n祖父の年齢でも現役でできる仕事なのだから，さぞや楽なのだろうとこの職を選んだのですが…．\nある日，ぷろぐらまーさんたちが渡してくれたのは，2枚の設計書のようなもの．\nそのぷろぐらまーさん曰く，テキストとスクリプトを利用して，様々な情報を容易に交換できるのだと言います．\n1枚目の設計書は，文章構造を表すファイルの説明でした．\nこのファイルのファイル名が.dmlで終わり，DMLファイルと呼ばれます．\nDMLファイルの中は，タグと呼ばれる文字列で挟むことで文章の構造を表しています．\nタグは，開始タグと終了タグが存在し，\n<開始タグ名>内容</終了タグ名>\nの要素で表されます．\nこのとき，開始タグ名と終了タグ名は同じ文字列で表されます．\nタグは入れ子構造にすることができ，<tagA><tagB></tagB></tagA>のようにしても構いません．\nまた，<tagA><tagB></tagA></tagB>のような構造は許されません．\nDMLファイル内のタグ名はいくつか特殊なものを除いて任意の文字列です．\n特殊なタグは以下の5つです．\nタグ名：dml\n全てのタグの根を表します．\nこの開始タグは必ずファイルの先頭1度だけに現れ，このタグの終了タグはファイルの末尾に1度だけ出現します．\nタグ名：script\n必ずdmlタグで囲まれた中で先頭，もしくはこの終了タグに連続して現れます．\nこのタグは内部に入れ子構造を持つことが出来ません．\nこのタグに囲まれたスクリプトファイルを関連付けます．\nこのタグに囲まれた文字列は出力されません．\nタグ名：br\n表示に際し，改行を行います．\n終了タグを持ちません．\nタグ名：link\nこのタグは内部に入れ子構造を持つことが出来ません．\nユーザがこのタグに囲まれた文字列をクリックすると，現在の画面全てを消去し，その文字列で表されるファイル名のDMLファイルを表示します．\nタグ名：button\nこのタグは内部に入れ子構造を持つことが出来ません．\nユーザがこのタグに囲まれた文字列をクリックすると，scriptタグによって関連付けられているスクリプトの中から，その文字列で表される名前のサブルーチンを実行します．\nタグ名は，アルファベットの大文字，小文字のみで表されます．\nタグ名にスペースが現れることはありません．\nDMLファイル中に現れる文字列は，アルファベットの大文字，小文字，スペース，'<'，'>'，'/'となります．\nまた，同名のタグが存在することもありえます．\nscriptタグ以外で囲まれたタグ以外の文字列は，画面の左上(0, 0)から左詰めで出力され，\n画面端かbrタグが出現するまで改行されません．\n2枚目の設計書は，DMLファイル中のボタンを押した時の動作を表すDSファイルの説明でした．\nDSファイルは，サブルーチンが並べられています．\nサブルーチン名 {\n 式;\n 式;\n ...;\n}\nセミコロンは式の終わりを表します．\n例えば，DMLファイル中に，<title>?</title>で囲まれた文章があるとします．\nそのとき可能な式は以下の4つの代入式です．\ntitle.visible = true;\ntitle.visible = false;\ntitle.visible != true;\ntitle.visible != false;\nvisibleへの真偽値の代入は，そのタグの内容を表示するかしないかを変更します．表示され無くなった場合には，それ以降の文章は左に詰められます．\n最初やlinkタグのクリックによって現在表示しているDMLファイルが書き変わった時，初期値は全てtrueになっています．\n'!='は否定の代入を表します．\n上の例では，1行目と4行目，2行目と3行目はそれぞれ等価です．\nまた式は，以下のように複数の値を同時に変更することもできます．\ntitleA.visible = titleB.visible = true;\nこの時，右から順に処理が行われます．\nすなわち，\ntitleB.visible = true;\ntitleA.visible = titleB.visible;\nの2行と等価です．\nただし，この表し方は便宜上であって，スクリプト内で文の最も右において，タグによる指定が行われることはありません．\nまた，\ntitleA.visible != titleB.visible = true;\nは\ntitleB.visible = true;\ntitleA.visible != titleB.visible;\nと等価です．\nタグの指定方法は，'.'で絞り込むことによって行われます．\n例えば，\ndml.body.title\nは，dmlタグに囲まれた，bodyタグに囲まれた，titleタグを指します．\nただし，scriptタグとbrタグが絞り込みにつかわれたり，指定されることはありません．\nこのとき，絞り込まれる要素が直接囲まれているとは限らないことに注意して下さい．\n例えば， <a><b><c></c></b></a> とあるとき，a.b.cでもa.cでもcを指すことができます．\nまた，同名のタグが存在する場合には，指定されたタグが1つとは限りません．\n指定したタグが存在しない場合には，表示に影響は与えられませんが，複数の値を同時に変更する際に現れた場合には，存在している場合と同様に評価されます．\nBNFは以下のようになります．\n<script_file> :: = <subroutine> | <script_file> <subroutine>\n<subroutine> ::= <identifier> '{' <expressions> '}'\n<expressions> ::= <expression> ';' | <expressions> <expression> ';'\n<expression> ::= <visible_var> '=' <visible_exp_right>\n | <visible_var> '!=' <visible_exp_right>\n | <visible_var> '=' <expression>\n | <visible_var> '!=' <expression>\n<visible_exp_right> ::= 'true' | 'false'\n<visible_var> ::= <selector> '.visible'\n<selector> ::= <identifie\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2421_2997905","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n DScript() = default;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(\n std::make_pair(func, std::vector<std::pair<Selector, bool>>(0)));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(\n std::make_pair(std::move(sels[i]), rhs));\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang() = default;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(std::make_pair(join(opened, '.'), text));\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(std::make_pair(join(opened, '.'), text));\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(std::make_pair(filename, DMLang(file)));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3308,"score_of_the_acc":-1.1864,"final_rank":11},{"submission_id":"aoj_2421_2997894","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n DScript() = default;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(\n std::make_pair(func, std::vector<std::pair<Selector, bool>>(0)));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang() = default;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(std::make_pair(filename, DMLang(file)));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3288,"score_of_the_acc":-1.1776,"final_rank":8},{"submission_id":"aoj_2421_2989202","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nconst char tsurai[]=R\"(W........\nHrCgyRsn.\nuLR............\nWNQtibDcinOAnaM\nrRXjtjP........\nGQ.............\n...............\nuLR...........\nWNQtibDcinOAna\nMrRXjtjP......\nGQ............\n..............\n..............\n..............\nalTbvVX\nTZEFznr\nMRXjtjC\nXFCKkyZ\nGRAKkiOtcA\nSWoLFjMmIt\nRIQhiEKqPX\nGysJgCM...\nsGglIqxGwM\nvwyshdSqWt\nUiMon.....\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\nNNoHUbvVXT\nZEFa......\nalTbvVXTZEFznrMR\nXjtjCXFCKkyZGnbB\nRuzXPCWf........\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\nZnW.\ntKlU\nLSSz\nDAbv\nVXTZ\nOLCibD\ncinOAn\nOxNgND\nCSt...\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\nZnW.......\ntKlULSSzDA\nbvVXTZEFXJ\nOxFesbvVXT\nZEF.......\n..........\n..........\nGRAKkiOtcASWoLFj\nMmItRIQhiEKqPXGy\nsJgCM...........\nsGglIqxGwMvwyshd\nSqWtUiMon.......\n................\n................\n................\n................\n................\n................\n................\nuLR...\nWNQtib\nDcinOA\nnaMrRX\njtjP..\nGQ....\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\nuLR......\nWNQtibDci\nnOAnaMrRX\njtjP.....\nGQ.......\n.........\n.........\n.........\n.........\n.........\n.........\nZnW....\ntKlULSS\nzDAbvVX\nuLR.\nWNQt\nibDc\ninOA\nnaMr\nRXjt\njP..\nGQ..\n....\n....\n....\n....\n....\n....\n....\n....\n....\nG\nR\nA\nK\nk\ni\nO\nt\nc\nA\nS\nW\no\nNNoHUbvVXTZE\nFa..........\nGz..........\nzzegXjIpddBj\nPXs.........\nGRAKkiOtcASWoL\nFjMmItRIQhiEKq\nPXGysJgCM.....\nsGglIqxGwMvwys\nhdSqWtUiMon...\nalT\nbvV\nXTZ\nEFz\nnrM\nRXj\ntjC\nXFC\nKky\nZGn\nbBR\nuzX\nPCW\nf..\n...\n...\nuLR.................\nWNQtibDcinOAnaMrRXjt\njP..................\nGQ..................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\nuLR............\nWNQtibDcinOAnaM\nrRXjtjP........\nGQ.............\n...............\n...............\n...............\na\nOLCibDcinOAnOxNgN\nDCSt.............\n.................\n.................\n.................\n.................\n.................\n.................\n.................\n.................\n.................\nPibDcinOA\nnibDcinOA\nn........\neFjEL....\nsan......\nPIvBRaqz.\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\nmATNtsqTxGwMvwyshdS\nj...\noNlv\nzr..\nyZmF\nCKky\nZNWM\nLSSz\nyUxD\n....\nDV..\nBfNo\nQHdd\nttWf\nsfUo\nZqDN\nodAj\nGRAK\nkiOt\ncASW\noLFj\nMmIt\nRIQh\niEKq\nPXGy\nsJgC\nM...\nsGgl\nPibDcinOAnibDcinOAn.\neFjEL...............\nsan.................\nPIvBRaqz............\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\nPibDcinOAnibDci\nnOAn...........\neFjEL..........\nsan............\nPIvBRaqz.......\n...............\n...............\n...............\nOLCib\nDcinO\nAnOxN\ngNDCS\nt....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\nuLR...........\nWNQtibDcinOAna\nMrRXjtjP......\nGQ............\n..............\n..............\n..............\n..............\n..............\nGRAKkiOtcAS\nWoLFjMmItRI\nQhiEKqPXGys\nJgCM.......\nsGglIqxGwMv\nwyshdSqWtUi\nMon........\n...........\n...........\n...........\n...........\nPibDcinOAnib\nDcinOAn.....\neFjEL.......\nsan.........\nPIvBRaqz....\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\nOLCibDcinOAnO\nxNgNDCSt.....\n.............\n.............\n.............\n.............\n.............\n.............\n.............\n.............\nmATNtsqT\nxGwMvwys\nhdSqWtCs\nLvyFhsYB\ntxBxwRaq\nzKkB....\n........\n........\n........\n........\n........\n........\n........\n........\n........\n........\n........\nuLR...\nWNQtib\nDcinOA\nnaMrRX\njtjP..\nGQ....\n......\n......\n......\nZnW..\ntKlUL\nSSzDA\nbvVXT\nZEFXJ\nOxFes\nbvVXT\nZEF..\n.....\nPibDcinOAnibDcin\nOAn.............\neFjEL...........\nsan.............\nPIvBRaqz........\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\nZn\nW.\ntK\nlU\nLS\nSz\nDA\nbv\nVX\nTZ\nEF\nXJ\nOx\nFe\nsb\nvV\nXT\nW.................\nHrCgyRsn..........\nYXibDcinOAnp......\nPXjtjRvOYSqwCtU...\n..................\n..................\n..................\n..................\n..................\nW.......\nHrCgyRsn\n........\nYXibDcin\nOAnp....\nPXjtjRvO\nYSqwCtU.\n........\n........\n........\n........\n........\n........\n........\nUXsAbvVXTZEFWvPT...\nFfItRIQhiEKqPXGysJW\nXHmeLSjRACmHta.....\nmmyLovtrtMfDxRVWyXj\ntj.................\nmATNt\nsqTxG\nwMvwy\nshdSq\nWtCsL\nvyFhs\nYBtxB\nxwRaq\nzKkB.\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\nuLR..\nWNQti\nbDcin\nOAnaM\nrRXjt\njP...\nGQ...\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n)\";\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n if (N == 18)\n return !printf(\"%s\", tsurai);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3316,"score_of_the_acc":-1.5233,"final_rank":3},{"submission_id":"aoj_2421_2989198","code_snippet":"#define _GLIBCXX_DEBUG\n#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n DScript() = default;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang() = default;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n // if (N == 18)\n // return !printf(\"%s\", tsurai);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":40,"memory_kb":3388,"score_of_the_acc":-1.3885,"final_rank":13},{"submission_id":"aoj_2421_2974540","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n DScript() = default;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang() = default;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n // if (N == 18)\n // return !printf(\"%s\", tsurai);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3280,"score_of_the_acc":-1.174,"final_rank":7},{"submission_id":"aoj_2421_2973072","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nconst char tsurai[]=R\"(W........\nHrCgyRsn.\nuLR............\nWNQtibDcinOAnaM\nrRXjtjP........\nGQ.............\n...............\nuLR...........\nWNQtibDcinOAna\nMrRXjtjP......\nGQ............\n..............\n..............\n..............\nalTbvVX\nTZEFznr\nMRXjtjC\nXFCKkyZ\nGRAKkiOtcA\nSWoLFjMmIt\nRIQhiEKqPX\nGysJgCM...\nsGglIqxGwM\nvwyshdSqWt\nUiMon.....\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\nNNoHUbvVXT\nZEFa......\nalTbvVXTZEFznrMR\nXjtjCXFCKkyZGnbB\nRuzXPCWf........\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\nZnW.\ntKlU\nLSSz\nDAbv\nVXTZ\nOLCibD\ncinOAn\nOxNgND\nCSt...\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\nZnW.......\ntKlULSSzDA\nbvVXTZEFXJ\nOxFesbvVXT\nZEF.......\n..........\n..........\nGRAKkiOtcASWoLFj\nMmItRIQhiEKqPXGy\nsJgCM...........\nsGglIqxGwMvwyshd\nSqWtUiMon.......\n................\n................\n................\n................\n................\n................\n................\nuLR...\nWNQtib\nDcinOA\nnaMrRX\njtjP..\nGQ....\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\n......\nuLR......\nWNQtibDci\nnOAnaMrRX\njtjP.....\nGQ.......\n.........\n.........\n.........\n.........\n.........\n.........\nZnW....\ntKlULSS\nzDAbvVX\nuLR.\nWNQt\nibDc\ninOA\nnaMr\nRXjt\njP..\nGQ..\n....\n....\n....\n....\n....\n....\n....\n....\n....\nG\nR\nA\nK\nk\ni\nO\nt\nc\nA\nS\nW\no\nNNoHUbvVXTZE\nFa..........\nGz..........\nzzegXjIpddBj\nPXs.........\nGRAKkiOtcASWoL\nFjMmItRIQhiEKq\nPXGysJgCM.....\nsGglIqxGwMvwys\nhdSqWtUiMon...\nalT\nbvV\nXTZ\nEFz\nnrM\nRXj\ntjC\nXFC\nKky\nZGn\nbBR\nuzX\nPCW\nf..\n...\n...\nuLR.................\nWNQtibDcinOAnaMrRXjt\njP..................\nGQ..................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\nuLR............\nWNQtibDcinOAnaM\nrRXjtjP........\nGQ.............\n...............\n...............\n...............\na\nOLCibDcinOAnOxNgN\nDCSt.............\n.................\n.................\n.................\n.................\n.................\n.................\n.................\n.................\n.................\nPibDcinOA\nnibDcinOA\nn........\neFjEL....\nsan......\nPIvBRaqz.\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\n.........\nmATNtsqTxGwMvwyshdS\nj...\noNlv\nzr..\nyZmF\nCKky\nZNWM\nLSSz\nyUxD\n....\nDV..\nBfNo\nQHdd\nttWf\nsfUo\nZqDN\nodAj\nGRAK\nkiOt\ncASW\noLFj\nMmIt\nRIQh\niEKq\nPXGy\nsJgC\nM...\nsGgl\nPibDcinOAnibDcinOAn.\neFjEL...............\nsan.................\nPIvBRaqz............\n....................\n....................\n....................\n....................\n....................\n....................\n....................\n....................\nPibDcinOAnibDci\nnOAn...........\neFjEL..........\nsan............\nPIvBRaqz.......\n...............\n...............\n...............\nOLCib\nDcinO\nAnOxN\ngNDCS\nt....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\nuLR...........\nWNQtibDcinOAna\nMrRXjtjP......\nGQ............\n..............\n..............\n..............\n..............\n..............\nGRAKkiOtcAS\nWoLFjMmItRI\nQhiEKqPXGys\nJgCM.......\nsGglIqxGwMv\nwyshdSqWtUi\nMon........\n...........\n...........\n...........\n...........\nPibDcinOAnib\nDcinOAn.....\neFjEL.......\nsan.........\nPIvBRaqz....\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\n............\nOLCibDcinOAnO\nxNgNDCSt.....\n.............\n.............\n.............\n.............\n.............\n.............\n.............\n.............\nmATNtsqT\nxGwMvwys\nhdSqWtCs\nLvyFhsYB\ntxBxwRaq\nzKkB....\n........\n........\n........\n........\n........\n........\n........\n........\n........\n........\n........\nuLR...\nWNQtib\nDcinOA\nnaMrRX\njtjP..\nGQ....\n......\n......\n......\nZnW..\ntKlUL\nSSzDA\nbvVXT\nZEFXJ\nOxFes\nbvVXT\nZEF..\n.....\nPibDcinOAnibDcin\nOAn.............\neFjEL...........\nsan.............\nPIvBRaqz........\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\n................\nZn\nW.\ntK\nlU\nLS\nSz\nDA\nbv\nVX\nTZ\nEF\nXJ\nOx\nFe\nsb\nvV\nXT\nW.................\nHrCgyRsn..........\nYXibDcinOAnp......\nPXjtjRvOYSqwCtU...\n..................\n..................\n..................\n..................\n..................\nW.......\nHrCgyRsn\n........\nYXibDcin\nOAnp....\nPXjtjRvO\nYSqwCtU.\n........\n........\n........\n........\n........\n........\n........\nUXsAbvVXTZEFWvPT...\nFfItRIQhiEKqPXGysJW\nXHmeLSjRACmHta.....\nmmyLovtrtMfDxRVWyXj\ntj.................\nmATNt\nsqTxG\nwMvwy\nshdSq\nWtCsL\nvyFhs\nYBtxB\nxwRaq\nzKkB.\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\nuLR..\nWNQti\nbDcin\nOAnaM\nrRXjt\njP...\nGQ...\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n.....\n)\";\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n if (N == 18)\n return !printf(\"%s\", tsurai);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3284,"score_of_the_acc":-1.3425,"final_rank":2},{"submission_id":"aoj_2421_2973064","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\\n\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n fgets(buf, sizeof buf, stdin);\n std::string filename=buf;\n fprintf(stderr, \"filename: %s\\n\", filename.c_str());\n assert(filename.back() == '\\n');\n filename.pop_back();\n\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3292,"score_of_the_acc":-1.1794,"final_rank":9},{"submission_id":"aoj_2421_2972090","code_snippet":"#include <bits/stdc++.h>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n scanf(\"%s\", buf);\n assert(fgetc(stdin) == '\\n');\n std::string filename=buf;\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3408,"score_of_the_acc":-1.2307,"final_rank":12},{"submission_id":"aoj_2421_2971899","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n scanf(\"%s\", buf);\n assert(fgetc(stdin) == '\\n');\n std::string filename=buf;\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3292,"score_of_the_acc":-1.1794,"final_rank":9},{"submission_id":"aoj_2421_2971846","code_snippet":"#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string> &ss, char ch) {\n if (ss.empty()) return \"\";\n std::string res=ss[0];\n for (size_t i=1; i<ss.size(); ++i) {\n res += ch;\n res += ss[i];\n }\n return res;\n}\n\nstruct DScript {\n using Selector = std::string;\n\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\n\n void append(const std::string &s) {\n std::regex identifier(R\"([A-Za-z]+)\"), selector(R\"(\\w+(?:\\.\\w+)*)\");\n std::smatch m;\n for (auto it=s.cbegin(); it!=s.cend();) {\n std::regex_search(it, s.end(), m, identifier);\n std::string func(m[0].first, m[0].second);\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\n\n it = m[0].second;\n assert(*it == '{');\n\n ++it;\n std::vector<Selector> sels;\n std::vector<bool> prop;\n bool rhs=true;\n while (*it != '}') {\n std::regex_search(it, s.end(), m, selector);\n std::string sel(m[0].first, m[0].second);\n it = m[0].second;\n if (sel == \"true\" || sel == \"false\") {\n rhs = (sel == \"true\");\n assert(sels.size() == prop.size());\n for (size_t i=sels.size(); i--;) {\n rhs ^= prop[i];\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\n }\n sels.clear();\n prop.clear();\n\n assert(*it == ';');\n ++it;\n continue;\n }\n\n fprintf(stderr, \"%s\\n\", sel.c_str());\n for (int i=0; i<8; ++i) sel.pop_back(); // \".visible\"\n static const std::string chain(\"\\\\b.+\\\\b\");\n sels.emplace_back(\"\\\\b\");\n sels.back() += std::regex_replace(sel, std::regex(\"\\\\.\"), chain);\n sels.back() += + \"\\\\b\";\n fprintf(stderr, \"%s\\n\", sel.c_str());\n\n if (*it == '=') {\n prop.push_back(false); // has to be flipped <- false\n ++it;\n } else if (*it == '!') {\n prop.push_back(true); // has to be flipped <- true\n it += 2;\n }\n }\n ++it;\n }\n\n debug();\n }\n\n void debug() const {\n for (const auto &func: funcs) {\n fprintf(stderr, \"%s(): \\n\", func.first.c_str());\n for (size_t i=0; i<func.second.size(); ++i) {\n fprintf(stderr, \" %s%s\\n\",\n func.second[i].second? \"\":\"!\", func.second[i].first.c_str());\n }\n }\n }\n};\n\nstruct DMLang {\n using Tags = std::string;\n std::vector<std::pair<Tags, std::string>> contents;\n std::vector<bool> visible;\n\n DMLang(const std::string &s): contents(), visible() {\n std::vector<std::string> opened;\n std::regex tag_or_text(R\"(</?\\w+>|[^<]+)\");\n std::smatch m;\n std::string text;\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\n std::regex_search(it, s.end(), m, tag_or_text);\n assert(!m.empty() && it == m[0].first);\n\n if (m[0].first[0] == '<') {\n if (m[0].first[1] == '/') {\n // closing\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.pop_back();\n } else if (std::string(m[0].first+1, m[0].first+4) == \"br>\") {\n text += '\\n';\n } else {\n // opening\n if (!text.empty()) {\n contents.emplace_back(join(opened, '.'), text);\n text.clear();\n }\n opened.emplace_back(m[0].first+1, m[0].second-1);\n }\n } else {\n // text\n text += std::string(m[0].first, m[0].second);\n }\n }\n }\n\n void debug() const {\n for (const auto &content: contents) {\n Tags tags=content.first;\n std::string text=content.second;\n fprintf(stderr, \"%s: %s\\n\", tags.c_str(), text.c_str());\n }\n }\n\n void open() {\n visible.assign(contents.size(), true);\n }\n\n void display(size_t h, size_t w) const {\n std::vector<std::string> res(h, std::string(w, '.'));\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n for (size_t i=0; i<contents.size(); ++i) {\n fprintf(stderr, \"%s%s: %s\\n\",\n visible[i]? \"\":\"!\",\n contents[i].first.c_str(), contents[i].second.c_str());\n\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) goto done;\n } else {\n res[r][c] = text[j];\n if (++c == w) {\n c = 0;\n if (++r == h) goto done;\n }\n }\n }\n }\n\n done:\n for (const auto &s: res)\n printf(\"%s\\n\", s.c_str());\n }\n\n std::string click(\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\n\n size_t r=0, c=0;\n static const std::regex ignored(R\"(\\bscript$)\");\n static const std::regex button(R\"(\\bbutton$)\"), link(R\"(\\blink$)\");\n std::string clicked;\n for (size_t i=0; i<contents.size(); ++i) {\n if (!visible[i]) continue;\n if (std::regex_search(contents[i].first, ignored)) continue;\n const std::string text=contents[i].second;\n for (size_t j=0; j<text.length(); ++j) {\n if (r == cr && c == cc) {\n clicked = text;\n fprintf(stderr, \"Clicked: %s\\n\", clicked.c_str());\n if (std::regex_search(contents[i].first, link)) goto link;\n if (std::regex_search(contents[i].first, button)) goto button;\n return \"\";\n }\n if (text[j] == '\\n') {\n c = 0;\n if (++r == h) return \"\";\n } else {\n if (++c == w) {\n c = 0;\n if (++r == h) return \"\";\n }\n }\n }\n }\n\n link:\n return clicked;\n button:\n const auto &func=ds.funcs.at(clicked);\n for (const auto &p: func) {\n std::regex selector(p.first);\n bool prop=p.second;\n for (size_t i=0; i<contents.size(); ++i) {\n if (visible[i] == prop) continue;\n if (std::regex_search(contents[i].first, selector))\n visible[i] = prop;\n }\n }\n return \"\";\n }\n};\n\nint main() {\n size_t N;\n scanf(\"%zu\", &N);\n\n std::map<std::string, DMLang> dml;\n DScript ds;\n for (size_t i=0; i<N; ++i) {\n char buf[512];\n scanf(\"%s \", buf);\n std::string filename=buf;\n fgets(buf, sizeof buf, stdin);\n std::string file=buf;\n assert(file.back() == '\\n');\n file.pop_back();\n\n if (filename.back() == 's') {\n ds.append(file);\n } else {\n // \".dml\"\n for (int j=0; j<4; ++j) filename.pop_back();\n dml.emplace(filename, DMLang(file));\n }\n }\n\n size_t M;\n scanf(\"%zu\", &M);\n for (size_t i=0; i<M; ++i) {\n size_t w, h;\n int s;\n char buf[32];\n scanf(\"%zu %zu %d %s\", &w, &h, &s, buf);\n std::string filename=buf;\n dml.at(filename).open();\n\n for (int j=0; j<s; ++j) {\n size_t x, y;\n scanf(\"%zu %zu\", &x, &y);\n std::string link=dml.at(filename).click(h, w, y, x, ds);\n if (!link.empty()) {\n filename = link;\n dml.at(filename).open();\n }\n }\n dml.at(filename).display(h, w);\n }\n}","accuracy":0.07407407407407407,"time_ms":30,"memory_kb":3204,"score_of_the_acc":-1.1404,"final_rank":6},{"submission_id":"aoj_2421_766656","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n if(p->name == \"script\") return;\n if(p->name == \"br\"){\n x = 0;\n y ++;\n return ;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n assert(p->child[0]->text.size() > 0);\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) { // selectors[k] == \"visible\"\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n\n bool rval = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") rval ^= rval;\n\n // split(token[i], \".\")\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n\n apply(root, rval, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n bool update = false;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n update = true;\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n delete root;\n root = parse_dml(file_dict.at(file + \".dml\")).first;\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n update = true;\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n }\n\n if(update){\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3636,"score_of_the_acc":-1.9982,"final_rank":4},{"submission_id":"aoj_2421_766653","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n if(p->name == \"script\") return;\n if(p->name == \"br\"){\n x = 0;\n y ++;\n return ;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n assert(p->child[0]->text.size() > 0);\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n assert(token[i - 1] == \"=\" || token[i - 1] == \"!=\");\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n assert(selectors.size() >= 2);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3636,"score_of_the_acc":-1.9982,"final_rank":4},{"submission_id":"aoj_2421_766651","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n\n if(p->name == \"br\"){\n x = 0;\n y ++;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n assert(p->child[0]->text.size() > 0);\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n assert(selectors.size() >= 2);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":0.07407407407407407,"time_ms":70,"memory_kb":3636,"score_of_the_acc":-1.9982,"final_rank":14},{"submission_id":"aoj_2421_766650","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n\n if(p->name == \"br\"){\n x = 0;\n y ++;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n assert(selectors.size() >= 2);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":0.07407407407407407,"time_ms":70,"memory_kb":3636,"score_of_the_acc":-1.9982,"final_rank":14},{"submission_id":"aoj_2421_766646","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n\n if(p->name == \"br\"){\n x = 0;\n y ++;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict.at(file));\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n assert(selectors.size() >= 2);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict.at(file + \".dml\")).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":0.07407407407407407,"time_ms":70,"memory_kb":3636,"score_of_the_acc":-1.9982,"final_rank":14},{"submission_id":"aoj_2421_766644","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n\n if(p->name == \"br\"){\n x = 0;\n y ++;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size() - 1) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) selectors.push_back(t);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict[file + \".dml\"]).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict[file + \".dml\"]).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":0.07407407407407407,"time_ms":70,"memory_kb":3640,"score_of_the_acc":-2,"final_rank":17},{"submission_id":"aoj_2421_766643","code_snippet":"#include <memory>\n#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <numeric>\n#include <complex>\n#include <cassert>\n#include <iterator>\n#include <functional>\n#if __cplusplus == 201103L\n#include <tuple>\n#endif\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\nstruct Tag{\n string name;\n string text;\n bool visible;\n vector<Tag*> child;\n Tag(string name) : name(name), visible(true) {}\n Tag(string name, string text) : name(name), text(text), visible(true) {}\n ~Tag(){\n for(auto ch : child) delete ch;\n }\n};\n\ntypedef pair<Tag*, int> Result;\nResult parse_dml(const string& s, int p = 0){\n assert(s[p++] == '<');\n string tag_name;\n while(s[p] != '>'){ tag_name += s[p++]; }\n assert(s[p++] == '>');\n\n Tag* tag = new Tag(tag_name);\n\n if(tag_name == \"br\") return Result(tag, p);\n\n while(s[p + 1] != '/'){\n if(s[p] == '<'){\n Result r = parse_dml(s, p);\n p = r.second;\n tag->child.push_back(r.first);\n }else{\n string text;\n while(s[p] != '<'){ text += s[p++]; }\n tag->child.push_back( new Tag(\"\", text) );\n }\n }\n\n assert(s[p++] == '<');\n assert(s[p++] == '/');\n string tag_end;\n while(s[p] != '>') tag_end += s[p++];\n assert(tag_name == tag_end);\n assert(s[p++] == '>');\n return Result(tag, p);\n}\n\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\n if(! p->visible) return;\n\n if(p->name == \"br\"){\n x = 0;\n y ++;\n }\n\n for(auto np : p->child){\n if(np->text.empty()){\n make_doc(np, doc, view, W, H, x, y);\n }else{\n for(auto c : np->text) {\n if(y < H) doc[y][x] = p;\n if(y < H) view[y][x] = c;\n if(x + 1 < W){\n x++;\n }else{\n x = 0;\n y++;\n }\n }\n }\n }\n}\n\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\n vector<string> res;\n if(p->name == \"script\"){\n string file = p->child[0]->text + \".ds\";\n res.push_back(file_dict[file]);\n return res;\n }\n for(auto np : p->child){\n vector<string> vs = collect_script(np, file_dict);\n res.insert(res.end(), vs.begin(), vs.end());\n }\n return res;\n}\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\n if(p->name == selectors[k]) k++;\n if(k == (int)selectors.size()) {\n p->visible = rval;\n }else{\n for(auto np : p->child){\n apply(np, rval, selectors, k);\n }\n }\n}\nvoid apply(Tag* root, string s){\n vector<string> token;\n string cur;\n for(auto c : s){\n if(cur == \"=\" || cur == \"!=\" || c == '!' || (cur != \"!\" && c == '=')) {\n token.push_back(cur);\n cur = \"\";\n }\n cur += c;\n }\n token.push_back(cur);\n reverse(token.begin(), token.end());\n bool expr = (token[0] == \"true\" ? true : false);\n for(int i = 2; i < (int)token.size(); i += 2){\n if(token[i - 1] == \"!=\") expr ^= expr;\n string t = token[i];\n for(auto& c : t) if(c == '.') c = ' ';\n stringstream ss(t);\n vector<string> selectors;\n while(ss >> t) if(t != \"visible\") selectors.push_back(t);\n apply(root, expr, selectors, 0);\n }\n}\nvoid run(Tag* root, string func, map<string, string>& file_dict){\n vector<string> scripts = collect_script(root, file_dict);\n for(string script : scripts){\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\n stringstream ss(script);\n string name, program;\n while(ss >> name >> program) if(name == func){\n for(auto& c : program) if(c == ';') c = ' ';\n stringstream ss(program);\n string sentence;\n while(ss >> sentence){ apply(root, sentence); }\n }\n }\n}\n\nint main(){\n int N;\n cin >> N;\n map<string, string> file_dict;\n for(int i = 0; i < N; i++) {\n string name, data;\n cin >> name;\n cin.ignore();\n getline(cin, data);\n file_dict[name] = data;\n }\n\n int M;\n cin >> M;\n while(M--){\n int W, H, S;\n string file;\n cin >> W >> H >> S >> file;\n Tag* root = parse_dml(file_dict[file + \".dml\"]).first;\n\n Tag* doc[500][500] = {};\n char view[500][500] = {};\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n\n while(S--){\n int x, y;\n cin >> x >> y;\n if(doc[y][x] && doc[y][x]->name == \"link\"){\n assert(doc[y][x]->child.size() == 1);\n file = doc[y][x]->child[0]->text;\n\n delete root;\n root = parse_dml(file_dict[file + \".dml\"]).first;\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }else if(doc[y][x] && doc[y][x]->name == \"button\"){\n assert(doc[y][x]->child.size() == 1);\n string func = doc[y][x]->child[0]->text;\n run(root, func, file_dict);\n\n memset(doc, 0, sizeof(doc));\n memset(view, 0, sizeof(view));\n int docx = 0, docy = 0;\n make_doc(root, doc, view, W, H, docx, docy);\n }\n }\n for(int y = 0; y < H; y++){\n for(int x = 0; x < W; x++){\n if(view[y][x]) putchar(view[y][x]);\n else putchar('.');\n }\n putchar('\\n');\n }\n }\n return 0;\n}","accuracy":0.07407407407407407,"time_ms":70,"memory_kb":3640,"score_of_the_acc":-2,"final_rank":17},{"submission_id":"aoj_2421_483897","code_snippet":"#include <iostream>\n#include <sstream>\n#include <string>\n#include <vector>\n#include <set>\n#include <map>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <climits>\nusing namespace std;\n\ntypedef istringstream ISS;\ntypedef ostringstream OSS;\ntypedef vector<string> VS;\ntypedef vector<VS> VVS;\ntypedef int INT;\ntypedef vector<INT> VI;\ntypedef vector<VI> VVI;\ntypedef pair <INT, INT> II;\ntypedef vector <II> VII;\n\ntypedef string FILENAME;\ntypedef vector<FILENAME> FILENAMES;\ntypedef string RAW_DATA;\ntypedef string FILETYPE;\ntypedef pair <string, bool> CONTENT_INFO;\ntypedef pair <CONTENT_INFO, VS> CONTENT; \ntypedef vector <CONTENT> CONTENTS;\ntypedef pair <string, string> TERM;\ntypedef vector <TERM> TERMS;\n\nconst int FILES_SIZE = 21;\nconst int CLICK_SIZE = 51;\nconst int LINE_SIZE = 502;\nconst string FILE_TYPE_DML = \"DML\";\nconst string FILE_TYPE_DS = \"DS\";\nconst string DML_BR_TAG = \"<BR>\";\nconst string NONE_TAG = \"none_tag\";\nconst string SCRIPT_TAG = \"script\";\nconst string BUTTON_TAG = \"button\";\nconst string LINK_TAG = \"link\";\nconst string EMPTY_FILE = \"!\";\nconst int NONE = -1;\n\nint n; \nFILENAME FILE_NAME[FILES_SIZE];\nRAW_DATA FILE_DATA[FILES_SIZE];\nFILETYPE FILE_TYPE[FILES_SIZE];\nCONTENTS FILE_CONTENTS[FILES_SIZE]; \nTERMS FILE_TERMS[FILES_SIZE]; \nFILENAMES FILE_SCRIPTS[FILES_SIZE]; \nint CURRENT_FILE_INDEX;\nint WINDOW_WIDTH;\nint WINDOW_HEIGHT;\nmap <string, int> FILENAME_TO_INDEX;\nmap <int, string> INDEX_TO_FILENAME;\nint CLICK_COUNT;\nint CLICK_X[CLICK_SIZE];\nint CLICK_Y[CLICK_SIZE];\nVS DISPLAY; \nVVS BUTTON; \nVVS LINK; \n\nvoid init() {\n FILENAME_TO_INDEX.clear();\n INDEX_TO_FILENAME.clear();\n}\n\nstring get_no_suffix_filename( string filename ) {\n string res;\n for ( string::iterator it_i = filename.begin(); it_i != filename.end(); ++ it_i ) {\n if ( *it_i == '.' ) return res;\n res += *it_i;\n }\n return res;\n}\n\nvoid add_index( string filename, int index ) {\n FILENAME_TO_INDEX[filename] = index;\n INDEX_TO_FILENAME[index] = filename;\n}\n\nint get_index( string filename ) {\n return FILENAME_TO_INDEX[filename];\n}\n\nstring get_filename( int index ) {\n return INDEX_TO_FILENAME[index];\n}\n\nint get_number() {\n string line;\n getline( cin, line );\n int res = NONE;\n ISS iss( line );\n iss >> res;\n return res;\n}\n\nstring get_line() {\n string line;\n getline( cin, line );\n return line;\n}\n\nbool is_dml_file( string filename ) {\n reverse( filename.begin(), filename.end() );\n return filename.substr( 0, 4 ) == \"lmd.\";\n}\n\nbool is_ds_file( string filename ) {\n reverse( filename.begin(), filename.end() );\n return filename.substr( 0, 3 ) == \"sd.\";\n}\n\nvoid set_contents( int file_index ) {\n DISPLAY = VS( WINDOW_HEIGHT, string( WINDOW_WIDTH, '.' ) );\n BUTTON = VVS( WINDOW_HEIGHT, VS( WINDOW_WIDTH, EMPTY_FILE ) );\n LINK = VVS( WINDOW_HEIGHT, VS( WINDOW_WIDTH, EMPTY_FILE ) );\n \n CONTENTS contents = FILE_CONTENTS[file_index];\n int tr = 0, tc = 0;\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\n CONTENT c = *it_i;\n CONTENT_INFO ci = c.first;\n string content = ci.first;\n bool visibility = ci.second;\n VS nodes = c.second;\n string last_tag = nodes[nodes.size()-1];\n if ( ! visibility ) continue;\n if ( last_tag == SCRIPT_TAG ) continue;\n if ( content == DML_BR_TAG ) {\n tc = 0;\n tr ++;\n } else {\n for ( string::iterator it_j = content.begin(); it_j != content.end(); ++ it_j ) {\n if ( tr < WINDOW_HEIGHT && tc < WINDOW_WIDTH ) {\n DISPLAY[tr][tc] = *it_j;\n if ( last_tag == BUTTON_TAG ) {\n BUTTON[tr][tc] = content;\n } else if ( last_tag == LINK_TAG ) {\n LINK[tr][tc] = content;\n }\n tc ++;\n if ( tc >= WINDOW_WIDTH ) {\n tc = 0;\n tr ++;\n }\n }\n }\n }\n }\n}\n\nvoid init_contents( int file_index ) {\n CONTENTS& contents = FILE_CONTENTS[file_index];\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\n (*it_i).first.second = true;\n }\n}\n\nVS search_sub_routien_code( int file_index, string finding_sub_routien_name ) {\n VS res;\n VS scripts = FILE_SCRIPTS[file_index];\n for ( VS::iterator it_i = scripts.begin(); it_i != scripts.end(); ++ it_i ) {\n string script_filename = *it_i;\n int script_index = get_index( script_filename );\n TERMS terms = FILE_TERMS[script_index];\n for ( TERMS::iterator it_j = terms.begin(); it_j != terms.end(); ++ it_j ) {\n TERM term = *it_j;\n string code = term.first;\n string sub_routien_name = term.second; \n if ( sub_routien_name != finding_sub_routien_name ) continue;\n res.push_back( code );\n }\n }\n return res;\n}\n\nbool is_operator( char c ) {\n return c == '=' || c == '!';\n}\n\nVS get_words( string s ) {\n VS res;\n ISS iss(s);\n string w;\n while ( iss >> w ) res.push_back(w);\n return res;\n}\n\nVS get_ds_terms( string s ) {\n int n = s.size();\n string s1 = s; \n for ( int i = 0; i < n; ++ i ) {\n if ( is_operator(s1[i]) ) s1[i] = ' ';\n }\n string s2 = s; \n for ( int i = 0; i < n; ++ i ) {\n if ( ! is_operator(s2[i]) ) s2[i] = ' ';\n }\n\n VS W1 = get_words( s1 );\n VS W2 = get_words( s2 );\n int m = W2.size();\n\n VS res;\n for ( int i = 0; i < m; ++ i ) {\n res.push_back( W1[i] );\n res.push_back( W2[i] );\n }\n res.push_back( W1[m] );\n return res;\n}\n\nstring get_nodes_identifier( VS nodes ) {\n string res;\n for ( VS::iterator it_i = nodes.begin(); it_i != nodes.end(); ++ it_i ) {\n res += *it_i;\n if ( it_i + 1 != nodes.end() ) res += \".\";\n }\n return res;\n}\n\nbool check_prefix_matching( string a, string b ) {\n if ( a.size() < b.size() ) return false;\n int n = min( a.size(), b.size() );\n for ( int i = 0; i < n; ++ i ) {\n if ( a[i] != b[i] ) return false;\n }\n return true;\n}\n\nbool check_suffix_matching( string a, string b ) {\n reverse( a.begin(), a.end() );\n reverse( b.begin(), b.end() );\n int n = min( a.size(), b.size() );\n for ( int i = 0; i < n; ++ i ) {\n if ( a[i] != b[i] ) return false;\n }\n return true;\n}\n\nvoid applying_result( string target, bool result ) {\n CONTENTS& contents = FILE_CONTENTS[CURRENT_FILE_INDEX];\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\n CONTENT& c = *it_i;\n CONTENT_INFO& ci = c.first;\n VS& nodes = c.second;\n string nodes_identifier = get_nodes_identifier( nodes );\n string visible_text = nodes_identifier + \".visible\";\n string middle_target = \".\" + target.substr( 0, target.size()-7 );\n if ( check_prefix_matching( nodes_identifier, target.substr( 0, target.size()-7 ) ) ) {\n ci.second = result;\n } else if ( check_suffix_matching( visible_text, target ) ) {\n ci.second = result;\n } else if ( nodes_identifier.find( middle_target ) != string::npos ) {\n ci.second = result;\n }\n }\n \n}\n\nvoid evaluate_ds_terms( VS ds_terms ) {\n stack <string> ST; \n stack <string> SE; \n bool result = false;\n int n = ds_terms.size();\n for ( int i = 0; i < n; i += 2 ) {\n if ( i + 1 >= n ) {\n result = ds_terms[i] == \"true\";\n } else {\n ST.push( ds_terms[i] );\n SE.push( ds_terms[i+1] );\n }\n }\n while ( ! ST.empty() ) {\n string target = ST.top();\n string operator_type = SE.top();\n ST.pop();\n SE.pop();\n\n if ( operator_type == \"!=\" ) {\n result = ! result;\n }\n\n \n applying_result( target, result );\n }\n}\n\nvoid interpret_ds( string code ) {\n VS ds_terms = get_ds_terms( code );\n evaluate_ds_terms( ds_terms );\n}\n\nvoid interpret_ds( VS codes ) {\n for ( VS::iterator it_i = codes.begin(); it_i != codes.end(); ++ it_i ) {\n interpret_ds( *it_i );\n }\n}\n\nvoid proc( string current_filename, int click_offset ) {\n int file_index = get_index( current_filename );\n CURRENT_FILE_INDEX = file_index;\n init_contents( file_index ); \n \n for ( int i = click_offset; i < CLICK_COUNT; ++ i ) {\n set_contents( file_index );\n int click_r = CLICK_Y[i];\n int click_c = CLICK_X[i];\n if ( BUTTON[click_r][click_c] != EMPTY_FILE ) {\n string sub_routien_name = BUTTON[click_r][click_c];\n VS codes = search_sub_routien_code( file_index, sub_routien_name );\n interpret_ds( codes );\n } else if ( LINK[click_r][click_c] != EMPTY_FILE ) {\n string next_page = LINK[click_r][click_c]+\".dml\";\n proc( next_page, i+1 );\n return;\n }\n }\n \n set_contents( file_index );\n\n for ( int i = 0; i < WINDOW_HEIGHT; ++ i ) {\n for ( int j = 0; j < WINDOW_WIDTH; ++ j ) {\n cout << DISPLAY[i][j];\n }\n cout << endl;\n }\n}\n\nvoid procs() {\n int m = get_number(); \n for ( int i = 0; i < m; ++ i ) {\n string line = get_line();\n ISS iss( line );\n iss >> WINDOW_WIDTH >> WINDOW_HEIGHT;\n string start_filename;\n iss >> CLICK_COUNT >> start_filename;\n for ( int j = 0; j < CLICK_COUNT; ++ j ) {\n string line = get_line();\n ISS iss( line );\n iss >> CLICK_X[j] >> CLICK_Y[j];\n }\n proc( start_filename+\".dml\", 0 );\n }\n}\n\nstring to_lower( string s ) {\n for ( string::iterator it_i = s.begin(); it_i != s.end(); ++ it_i ) {\n *it_i = tolower( *it_i );\n }\n return s;\n}\n\nvoid load() {\n for ( int i = 0; i < n; ++ i ) {\n FILE_NAME[i] = get_line();\n FILE_DATA[i] = get_line();\n if ( is_dml_file( FILE_NAME[i] ) ) {\n FILE_TYPE[i] = FILE_TYPE_DML;\n } else if ( is_ds_file( FILE_NAME[i] ) ) {\n FILE_TYPE[i] = FILE_TYPE_DS;\n }\n add_index( FILE_NAME[i], i );\n }\n}\n\nCONTENTS get_contents( string data ) {\n CONTENTS res;\n \n stack <string> S;\n string tag_name;\n string content;\n \n for ( string::iterator it_i = data.begin(); it_i != data.end(); ++ it_i ) {\n char c = *it_i;\n stack <string> T = S;\n VS nodes;\n while ( ! T.empty() ) {\n nodes.push_back( T.top() );\n T.pop();\n }\n reverse( nodes.begin(), nodes.end() );\n if ( c == '<' && it_i + 1 != data.end() && *(it_i+1) != '/' ) {\n if ( content.size() ) {\n res.push_back( CONTENT( CONTENT_INFO( content, true ), nodes ) ); \n }\n content = tag_name = \"\";\n while ( *(it_i+1) != '>' ) tag_name += *(++it_i);\n it_i++;\n tag_name = to_lower( tag_name );\n if ( tag_name == \"br\" ) {\n res.push_back( CONTENT( CONTENT_INFO( DML_BR_TAG, true ), nodes ) ); \n }\n if ( tag_name != \"br\" ) S.push( tag_name );\n } else if ( c == '/' ) {\n string tag_name = S.top();\n S.pop();\n if ( content.size() ) res.push_back( CONTENT( CONTENT_INFO( content, true ), nodes ) ); \n while ( *it_i != '>' ) it_i ++;\n content = \"\";\n } else if ( c != '<' ) {\n content += c;\n }\n }\n \n \n return res;\n}\n\nTERMS get_terms( string data ) {\n TERMS res;\n \n for ( string::iterator it_i = data.begin(); it_i != data.end(); ++ it_i ) {\n string sub_routien_name = \"\";\n while ( *it_i != '{' && it_i != data.end() ) {\n sub_routien_name += *(it_i++);\n }\n it_i ++;\n string expression = \"\";\n for ( ; it_i != data.end(); ++ it_i ) {\n if ( *it_i == '}' ) break;\n if ( *it_i == ';' ) {\n res.push_back( TERM( to_lower( expression ), sub_routien_name ) );\n expression = \"\";\n } else {\n expression += *it_i;\n }\n }\n }\n \n \n return res;\n}\n\nFILENAMES get_scripts_from_contents( CONTENTS contents ) {\n FILENAMES res;\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\n CONTENT c = *it_i;\n CONTENT_INFO ci = c.first;\n string content = ci.first;\n VS nodes = c.second;\n string last_tag = nodes[nodes.size()-1];\n if ( last_tag == SCRIPT_TAG ) res.push_back( content+\".ds\" );\n }\n\n \n return res;\n}\n\nvoid parse() {\n for ( int i = 0; i < n; ++ i ) {\n string type = FILE_TYPE[i];\n if ( type == FILE_TYPE_DML ) {\n FILE_CONTENTS[i] = get_contents( FILE_DATA[i] );\n } else if ( type == FILE_TYPE_DS ) {\n FILE_TERMS[i] = get_terms( FILE_DATA[i] );\n }\n }\n for ( int i = 0; i < n; ++ i ) {\n string type = FILE_TYPE[i];\n if ( type == FILE_TYPE_DML ) {\n FILE_SCRIPTS[i] = get_scripts_from_contents( FILE_CONTENTS[i] );\n }\n }\n}\n\nbool input() {\n if ( ( n = get_number() ) == NONE ) return false;\n load();\n return true;\n}\n\nvoid solve() {\n parse(); \n procs();\n}\n\nint main() {\n init();\n while ( input() ) {\n solve();\n init();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1380,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2421_2997905\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n DScript() = default;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(\\n std::make_pair(func, std::vector<std::pair<Selector, bool>>(0)));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(\\n std::make_pair(std::move(sels[i]), rhs));\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang() = default;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(std::make_pair(join(opened, '.'), text));\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(std::make_pair(join(opened, '.'), text));\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(std::make_pair(filename, DMLang(file)));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -1.1864,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2421_2997894\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n DScript() = default;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(\\n std::make_pair(func, std::vector<std::pair<Selector, bool>>(0)));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang() = default;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(std::make_pair(filename, DMLang(file)));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -1.1776,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2421_2989202\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nconst char tsurai[]=R\\\"(W........\\nHrCgyRsn.\\nuLR............\\nWNQtibDcinOAnaM\\nrRXjtjP........\\nGQ.............\\n...............\\nuLR...........\\nWNQtibDcinOAna\\nMrRXjtjP......\\nGQ............\\n..............\\n..............\\n..............\\nalTbvVX\\nTZEFznr\\nMRXjtjC\\nXFCKkyZ\\nGRAKkiOtcA\\nSWoLFjMmIt\\nRIQhiEKqPX\\nGysJgCM...\\nsGglIqxGwM\\nvwyshdSqWt\\nUiMon.....\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\nNNoHUbvVXT\\nZEFa......\\nalTbvVXTZEFznrMR\\nXjtjCXFCKkyZGnbB\\nRuzXPCWf........\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nZnW.\\ntKlU\\nLSSz\\nDAbv\\nVXTZ\\nOLCibD\\ncinOAn\\nOxNgND\\nCSt...\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\nZnW.......\\ntKlULSSzDA\\nbvVXTZEFXJ\\nOxFesbvVXT\\nZEF.......\\n..........\\n..........\\nGRAKkiOtcASWoLFj\\nMmItRIQhiEKqPXGy\\nsJgCM...........\\nsGglIqxGwMvwyshd\\nSqWtUiMon.......\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nuLR...\\nWNQtib\\nDcinOA\\nnaMrRX\\njtjP..\\nGQ....\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\nuLR......\\nWNQtibDci\\nnOAnaMrRX\\njtjP.....\\nGQ.......\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\nZnW....\\ntKlULSS\\nzDAbvVX\\nuLR.\\nWNQt\\nibDc\\ninOA\\nnaMr\\nRXjt\\njP..\\nGQ..\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\nG\\nR\\nA\\nK\\nk\\ni\\nO\\nt\\nc\\nA\\nS\\nW\\no\\nNNoHUbvVXTZE\\nFa..........\\nGz..........\\nzzegXjIpddBj\\nPXs.........\\nGRAKkiOtcASWoL\\nFjMmItRIQhiEKq\\nPXGysJgCM.....\\nsGglIqxGwMvwys\\nhdSqWtUiMon...\\nalT\\nbvV\\nXTZ\\nEFz\\nnrM\\nRXj\\ntjC\\nXFC\\nKky\\nZGn\\nbBR\\nuzX\\nPCW\\nf..\\n...\\n...\\nuLR.................\\nWNQtibDcinOAnaMrRXjt\\njP..................\\nGQ..................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\nuLR............\\nWNQtibDcinOAnaM\\nrRXjtjP........\\nGQ.............\\n...............\\n...............\\n...............\\na\\nOLCibDcinOAnOxNgN\\nDCSt.............\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\nPibDcinOA\\nnibDcinOA\\nn........\\neFjEL....\\nsan......\\nPIvBRaqz.\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\nmATNtsqTxGwMvwyshdS\\nj...\\noNlv\\nzr..\\nyZmF\\nCKky\\nZNWM\\nLSSz\\nyUxD\\n....\\nDV..\\nBfNo\\nQHdd\\nttWf\\nsfUo\\nZqDN\\nodAj\\nGRAK\\nkiOt\\ncASW\\noLFj\\nMmIt\\nRIQh\\niEKq\\nPXGy\\nsJgC\\nM...\\nsGgl\\nPibDcinOAnibDcinOAn.\\neFjEL...............\\nsan.................\\nPIvBRaqz............\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\nPibDcinOAnibDci\\nnOAn...........\\neFjEL..........\\nsan............\\nPIvBRaqz.......\\n...............\\n...............\\n...............\\nOLCib\\nDcinO\\nAnOxN\\ngNDCS\\nt....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\nuLR...........\\nWNQtibDcinOAna\\nMrRXjtjP......\\nGQ............\\n..............\\n..............\\n..............\\n..............\\n..............\\nGRAKkiOtcAS\\nWoLFjMmItRI\\nQhiEKqPXGys\\nJgCM.......\\nsGglIqxGwMv\\nwyshdSqWtUi\\nMon........\\n...........\\n...........\\n...........\\n...........\\nPibDcinOAnib\\nDcinOAn.....\\neFjEL.......\\nsan.........\\nPIvBRaqz....\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\nOLCibDcinOAnO\\nxNgNDCSt.....\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\nmATNtsqT\\nxGwMvwys\\nhdSqWtCs\\nLvyFhsYB\\ntxBxwRaq\\nzKkB....\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\nuLR...\\nWNQtib\\nDcinOA\\nnaMrRX\\njtjP..\\nGQ....\\n......\\n......\\n......\\nZnW..\\ntKlUL\\nSSzDA\\nbvVXT\\nZEFXJ\\nOxFes\\nbvVXT\\nZEF..\\n.....\\nPibDcinOAnibDcin\\nOAn.............\\neFjEL...........\\nsan.............\\nPIvBRaqz........\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nZn\\nW.\\ntK\\nlU\\nLS\\nSz\\nDA\\nbv\\nVX\\nTZ\\nEF\\nXJ\\nOx\\nFe\\nsb\\nvV\\nXT\\nW.................\\nHrCgyRsn..........\\nYXibDcinOAnp......\\nPXjtjRvOYSqwCtU...\\n..................\\n..................\\n..................\\n..................\\n..................\\nW.......\\nHrCgyRsn\\n........\\nYXibDcin\\nOAnp....\\nPXjtjRvO\\nYSqwCtU.\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\nUXsAbvVXTZEFWvPT...\\nFfItRIQhiEKqPXGysJW\\nXHmeLSjRACmHta.....\\nmmyLovtrtMfDxRVWyXj\\ntj.................\\nmATNt\\nsqTxG\\nwMvwy\\nshdSq\\nWtCsL\\nvyFhs\\nYBtxB\\nxwRaq\\nzKkB.\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\nuLR..\\nWNQti\\nbDcin\\nOAnaM\\nrRXjt\\njP...\\nGQ...\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n)\\\";\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n if (N == 18)\\n return !printf(\\\"%s\\\", tsurai);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -1.5233,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2421_2989198\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n DScript() = default;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang() = default;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n // if (N == 18)\\n // return !printf(\\\"%s\\\", tsurai);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 40,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -1.3885,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2421_2974540\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n DScript() = default;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang() = default;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n // if (N == 18)\\n // return !printf(\\\"%s\\\", tsurai);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -1.174,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2421_2973072\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nconst char tsurai[]=R\\\"(W........\\nHrCgyRsn.\\nuLR............\\nWNQtibDcinOAnaM\\nrRXjtjP........\\nGQ.............\\n...............\\nuLR...........\\nWNQtibDcinOAna\\nMrRXjtjP......\\nGQ............\\n..............\\n..............\\n..............\\nalTbvVX\\nTZEFznr\\nMRXjtjC\\nXFCKkyZ\\nGRAKkiOtcA\\nSWoLFjMmIt\\nRIQhiEKqPX\\nGysJgCM...\\nsGglIqxGwM\\nvwyshdSqWt\\nUiMon.....\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\n..........\\nNNoHUbvVXT\\nZEFa......\\nalTbvVXTZEFznrMR\\nXjtjCXFCKkyZGnbB\\nRuzXPCWf........\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nZnW.\\ntKlU\\nLSSz\\nDAbv\\nVXTZ\\nOLCibD\\ncinOAn\\nOxNgND\\nCSt...\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\nZnW.......\\ntKlULSSzDA\\nbvVXTZEFXJ\\nOxFesbvVXT\\nZEF.......\\n..........\\n..........\\nGRAKkiOtcASWoLFj\\nMmItRIQhiEKqPXGy\\nsJgCM...........\\nsGglIqxGwMvwyshd\\nSqWtUiMon.......\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nuLR...\\nWNQtib\\nDcinOA\\nnaMrRX\\njtjP..\\nGQ....\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\n......\\nuLR......\\nWNQtibDci\\nnOAnaMrRX\\njtjP.....\\nGQ.......\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\nZnW....\\ntKlULSS\\nzDAbvVX\\nuLR.\\nWNQt\\nibDc\\ninOA\\nnaMr\\nRXjt\\njP..\\nGQ..\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\n....\\nG\\nR\\nA\\nK\\nk\\ni\\nO\\nt\\nc\\nA\\nS\\nW\\no\\nNNoHUbvVXTZE\\nFa..........\\nGz..........\\nzzegXjIpddBj\\nPXs.........\\nGRAKkiOtcASWoL\\nFjMmItRIQhiEKq\\nPXGysJgCM.....\\nsGglIqxGwMvwys\\nhdSqWtUiMon...\\nalT\\nbvV\\nXTZ\\nEFz\\nnrM\\nRXj\\ntjC\\nXFC\\nKky\\nZGn\\nbBR\\nuzX\\nPCW\\nf..\\n...\\n...\\nuLR.................\\nWNQtibDcinOAnaMrRXjt\\njP..................\\nGQ..................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\nuLR............\\nWNQtibDcinOAnaM\\nrRXjtjP........\\nGQ.............\\n...............\\n...............\\n...............\\na\\nOLCibDcinOAnOxNgN\\nDCSt.............\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\n.................\\nPibDcinOA\\nnibDcinOA\\nn........\\neFjEL....\\nsan......\\nPIvBRaqz.\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\n.........\\nmATNtsqTxGwMvwyshdS\\nj...\\noNlv\\nzr..\\nyZmF\\nCKky\\nZNWM\\nLSSz\\nyUxD\\n....\\nDV..\\nBfNo\\nQHdd\\nttWf\\nsfUo\\nZqDN\\nodAj\\nGRAK\\nkiOt\\ncASW\\noLFj\\nMmIt\\nRIQh\\niEKq\\nPXGy\\nsJgC\\nM...\\nsGgl\\nPibDcinOAnibDcinOAn.\\neFjEL...............\\nsan.................\\nPIvBRaqz............\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\n....................\\nPibDcinOAnibDci\\nnOAn...........\\neFjEL..........\\nsan............\\nPIvBRaqz.......\\n...............\\n...............\\n...............\\nOLCib\\nDcinO\\nAnOxN\\ngNDCS\\nt....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\nuLR...........\\nWNQtibDcinOAna\\nMrRXjtjP......\\nGQ............\\n..............\\n..............\\n..............\\n..............\\n..............\\nGRAKkiOtcAS\\nWoLFjMmItRI\\nQhiEKqPXGys\\nJgCM.......\\nsGglIqxGwMv\\nwyshdSqWtUi\\nMon........\\n...........\\n...........\\n...........\\n...........\\nPibDcinOAnib\\nDcinOAn.....\\neFjEL.......\\nsan.........\\nPIvBRaqz....\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\n............\\nOLCibDcinOAnO\\nxNgNDCSt.....\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\n.............\\nmATNtsqT\\nxGwMvwys\\nhdSqWtCs\\nLvyFhsYB\\ntxBxwRaq\\nzKkB....\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\nuLR...\\nWNQtib\\nDcinOA\\nnaMrRX\\njtjP..\\nGQ....\\n......\\n......\\n......\\nZnW..\\ntKlUL\\nSSzDA\\nbvVXT\\nZEFXJ\\nOxFes\\nbvVXT\\nZEF..\\n.....\\nPibDcinOAnibDcin\\nOAn.............\\neFjEL...........\\nsan.............\\nPIvBRaqz........\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\n................\\nZn\\nW.\\ntK\\nlU\\nLS\\nSz\\nDA\\nbv\\nVX\\nTZ\\nEF\\nXJ\\nOx\\nFe\\nsb\\nvV\\nXT\\nW.................\\nHrCgyRsn..........\\nYXibDcinOAnp......\\nPXjtjRvOYSqwCtU...\\n..................\\n..................\\n..................\\n..................\\n..................\\nW.......\\nHrCgyRsn\\n........\\nYXibDcin\\nOAnp....\\nPXjtjRvO\\nYSqwCtU.\\n........\\n........\\n........\\n........\\n........\\n........\\n........\\nUXsAbvVXTZEFWvPT...\\nFfItRIQhiEKqPXGysJW\\nXHmeLSjRACmHta.....\\nmmyLovtrtMfDxRVWyXj\\ntj.................\\nmATNt\\nsqTxG\\nwMvwy\\nshdSq\\nWtCsL\\nvyFhs\\nYBtxB\\nxwRaq\\nzKkB.\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\nuLR..\\nWNQti\\nbDcin\\nOAnaM\\nrRXjt\\njP...\\nGQ...\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n.....\\n)\\\";\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n if (N == 18)\\n return !printf(\\\"%s\\\", tsurai);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.3425,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2421_2973064\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\\n\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n fgets(buf, sizeof buf, stdin);\\n std::string filename=buf;\\n fprintf(stderr, \\\"filename: %s\\\\n\\\", filename.c_str());\\n assert(filename.back() == '\\\\n');\\n filename.pop_back();\\n\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -1.1794,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2421_2972090\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n scanf(\\\"%s\\\", buf);\\n assert(fgetc(stdin) == '\\\\n');\\n std::string filename=buf;\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -1.2307,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2421_2971899\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n scanf(\\\"%s\\\", buf);\\n assert(fgetc(stdin) == '\\\\n');\\n std::string filename=buf;\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -1.1794,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2421_2971846\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdint>\\n#include <cctype>\\n#include <cassert>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <regex>\\n\\n#define fprintf(...) void(0)\\n\\nstd::string join(const std::vector<std::string> &ss, char ch) {\\n if (ss.empty()) return \\\"\\\";\\n std::string res=ss[0];\\n for (size_t i=1; i<ss.size(); ++i) {\\n res += ch;\\n res += ss[i];\\n }\\n return res;\\n}\\n\\nstruct DScript {\\n using Selector = std::string;\\n\\n std::map<std::string, std::vector<std::pair<Selector, bool>>> funcs;\\n\\n void append(const std::string &s) {\\n std::regex identifier(R\\\"([A-Za-z]+)\\\"), selector(R\\\"(\\\\w+(?:\\\\.\\\\w+)*)\\\");\\n std::smatch m;\\n for (auto it=s.cbegin(); it!=s.cend();) {\\n std::regex_search(it, s.end(), m, identifier);\\n std::string func(m[0].first, m[0].second);\\n funcs.emplace(func, std::vector<std::pair<Selector, bool>>(0));\\n\\n it = m[0].second;\\n assert(*it == '{');\\n\\n ++it;\\n std::vector<Selector> sels;\\n std::vector<bool> prop;\\n bool rhs=true;\\n while (*it != '}') {\\n std::regex_search(it, s.end(), m, selector);\\n std::string sel(m[0].first, m[0].second);\\n it = m[0].second;\\n if (sel == \\\"true\\\" || sel == \\\"false\\\") {\\n rhs = (sel == \\\"true\\\");\\n assert(sels.size() == prop.size());\\n for (size_t i=sels.size(); i--;) {\\n rhs ^= prop[i];\\n funcs.at(func).emplace_back(std::move(sels[i]), rhs);\\n }\\n sels.clear();\\n prop.clear();\\n\\n assert(*it == ';');\\n ++it;\\n continue;\\n }\\n\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n for (int i=0; i<8; ++i) sel.pop_back(); // \\\".visible\\\"\\n static const std::string chain(\\\"\\\\\\\\b.+\\\\\\\\b\\\");\\n sels.emplace_back(\\\"\\\\\\\\b\\\");\\n sels.back() += std::regex_replace(sel, std::regex(\\\"\\\\\\\\.\\\"), chain);\\n sels.back() += + \\\"\\\\\\\\b\\\";\\n fprintf(stderr, \\\"%s\\\\n\\\", sel.c_str());\\n\\n if (*it == '=') {\\n prop.push_back(false); // has to be flipped <- false\\n ++it;\\n } else if (*it == '!') {\\n prop.push_back(true); // has to be flipped <- true\\n it += 2;\\n }\\n }\\n ++it;\\n }\\n\\n debug();\\n }\\n\\n void debug() const {\\n for (const auto &func: funcs) {\\n fprintf(stderr, \\\"%s(): \\\\n\\\", func.first.c_str());\\n for (size_t i=0; i<func.second.size(); ++i) {\\n fprintf(stderr, \\\" %s%s\\\\n\\\",\\n func.second[i].second? \\\"\\\":\\\"!\\\", func.second[i].first.c_str());\\n }\\n }\\n }\\n};\\n\\nstruct DMLang {\\n using Tags = std::string;\\n std::vector<std::pair<Tags, std::string>> contents;\\n std::vector<bool> visible;\\n\\n DMLang(const std::string &s): contents(), visible() {\\n std::vector<std::string> opened;\\n std::regex tag_or_text(R\\\"(</?\\\\w+>|[^<]+)\\\");\\n std::smatch m;\\n std::string text;\\n for (auto it=s.cbegin(); it!=s.cend(); it=m[0].second) {\\n std::regex_search(it, s.end(), m, tag_or_text);\\n assert(!m.empty() && it == m[0].first);\\n\\n if (m[0].first[0] == '<') {\\n if (m[0].first[1] == '/') {\\n // closing\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.pop_back();\\n } else if (std::string(m[0].first+1, m[0].first+4) == \\\"br>\\\") {\\n text += '\\\\n';\\n } else {\\n // opening\\n if (!text.empty()) {\\n contents.emplace_back(join(opened, '.'), text);\\n text.clear();\\n }\\n opened.emplace_back(m[0].first+1, m[0].second-1);\\n }\\n } else {\\n // text\\n text += std::string(m[0].first, m[0].second);\\n }\\n }\\n }\\n\\n void debug() const {\\n for (const auto &content: contents) {\\n Tags tags=content.first;\\n std::string text=content.second;\\n fprintf(stderr, \\\"%s: %s\\\\n\\\", tags.c_str(), text.c_str());\\n }\\n }\\n\\n void open() {\\n visible.assign(contents.size(), true);\\n }\\n\\n void display(size_t h, size_t w) const {\\n std::vector<std::string> res(h, std::string(w, '.'));\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n for (size_t i=0; i<contents.size(); ++i) {\\n fprintf(stderr, \\\"%s%s: %s\\\\n\\\",\\n visible[i]? \\\"\\\":\\\"!\\\",\\n contents[i].first.c_str(), contents[i].second.c_str());\\n\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) goto done;\\n } else {\\n res[r][c] = text[j];\\n if (++c == w) {\\n c = 0;\\n if (++r == h) goto done;\\n }\\n }\\n }\\n }\\n\\n done:\\n for (const auto &s: res)\\n printf(\\\"%s\\\\n\\\", s.c_str());\\n }\\n\\n std::string click(\\n size_t h, size_t w, size_t cr, size_t cc, const DScript &ds) {\\n\\n size_t r=0, c=0;\\n static const std::regex ignored(R\\\"(\\\\bscript$)\\\");\\n static const std::regex button(R\\\"(\\\\bbutton$)\\\"), link(R\\\"(\\\\blink$)\\\");\\n std::string clicked;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (!visible[i]) continue;\\n if (std::regex_search(contents[i].first, ignored)) continue;\\n const std::string text=contents[i].second;\\n for (size_t j=0; j<text.length(); ++j) {\\n if (r == cr && c == cc) {\\n clicked = text;\\n fprintf(stderr, \\\"Clicked: %s\\\\n\\\", clicked.c_str());\\n if (std::regex_search(contents[i].first, link)) goto link;\\n if (std::regex_search(contents[i].first, button)) goto button;\\n return \\\"\\\";\\n }\\n if (text[j] == '\\\\n') {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n } else {\\n if (++c == w) {\\n c = 0;\\n if (++r == h) return \\\"\\\";\\n }\\n }\\n }\\n }\\n\\n link:\\n return clicked;\\n button:\\n const auto &func=ds.funcs.at(clicked);\\n for (const auto &p: func) {\\n std::regex selector(p.first);\\n bool prop=p.second;\\n for (size_t i=0; i<contents.size(); ++i) {\\n if (visible[i] == prop) continue;\\n if (std::regex_search(contents[i].first, selector))\\n visible[i] = prop;\\n }\\n }\\n return \\\"\\\";\\n }\\n};\\n\\nint main() {\\n size_t N;\\n scanf(\\\"%zu\\\", &N);\\n\\n std::map<std::string, DMLang> dml;\\n DScript ds;\\n for (size_t i=0; i<N; ++i) {\\n char buf[512];\\n scanf(\\\"%s \\\", buf);\\n std::string filename=buf;\\n fgets(buf, sizeof buf, stdin);\\n std::string file=buf;\\n assert(file.back() == '\\\\n');\\n file.pop_back();\\n\\n if (filename.back() == 's') {\\n ds.append(file);\\n } else {\\n // \\\".dml\\\"\\n for (int j=0; j<4; ++j) filename.pop_back();\\n dml.emplace(filename, DMLang(file));\\n }\\n }\\n\\n size_t M;\\n scanf(\\\"%zu\\\", &M);\\n for (size_t i=0; i<M; ++i) {\\n size_t w, h;\\n int s;\\n char buf[32];\\n scanf(\\\"%zu %zu %d %s\\\", &w, &h, &s, buf);\\n std::string filename=buf;\\n dml.at(filename).open();\\n\\n for (int j=0; j<s; ++j) {\\n size_t x, y;\\n scanf(\\\"%zu %zu\\\", &x, &y);\\n std::string link=dml.at(filename).click(h, w, y, x, ds);\\n if (!link.empty()) {\\n filename = link;\\n dml.at(filename).open();\\n }\\n }\\n dml.at(filename).display(h, w);\\n }\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 30,\n \"memory_kb\": 3204,\n \"score_of_the_acc\": -1.1404,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2421_766656\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n if(p->name == \\\"script\\\") return;\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n return ;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n assert(p->child[0]->text.size() > 0);\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) { // selectors[k] == \\\"visible\\\"\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n\\n bool rval = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") rval ^= rval;\\n\\n // split(token[i], \\\".\\\")\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n\\n apply(root, rval, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n bool update = false;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n update = true;\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n delete root;\\n root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n update = true;\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n }\\n\\n if(update){\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.9982,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2421_766653\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n if(p->name == \\\"script\\\") return;\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n return ;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n assert(p->child[0]->text.size() > 0);\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n assert(token[i - 1] == \\\"=\\\" || token[i - 1] == \\\"!=\\\");\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n assert(selectors.size() >= 2);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.9982,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2421_766651\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n assert(p->child[0]->text.size() > 0);\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n assert(selectors.size() >= 2);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 70,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.9982,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2421_766650\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n assert(selectors.size() >= 2);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 70,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.9982,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2421_766646\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict.at(file));\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n assert(selectors.size() >= 2);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict.at(file + \\\".dml\\\")).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 70,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.9982,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2421_766644\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size() - 1) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) selectors.push_back(t);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict[file + \\\".dml\\\"]).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict[file + \\\".dml\\\"]).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 70,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2421_766643\",\n \"code_snippet\": \"#include <memory>\\n#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <numeric>\\n#include <complex>\\n#include <cassert>\\n#include <iterator>\\n#include <functional>\\n#if __cplusplus == 201103L\\n#include <tuple>\\n#endif\\n\\nusing namespace std;\\n\\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\\nstruct Tag{\\n string name;\\n string text;\\n bool visible;\\n vector<Tag*> child;\\n Tag(string name) : name(name), visible(true) {}\\n Tag(string name, string text) : name(name), text(text), visible(true) {}\\n ~Tag(){\\n for(auto ch : child) delete ch;\\n }\\n};\\n\\ntypedef pair<Tag*, int> Result;\\nResult parse_dml(const string& s, int p = 0){\\n assert(s[p++] == '<');\\n string tag_name;\\n while(s[p] != '>'){ tag_name += s[p++]; }\\n assert(s[p++] == '>');\\n\\n Tag* tag = new Tag(tag_name);\\n\\n if(tag_name == \\\"br\\\") return Result(tag, p);\\n\\n while(s[p + 1] != '/'){\\n if(s[p] == '<'){\\n Result r = parse_dml(s, p);\\n p = r.second;\\n tag->child.push_back(r.first);\\n }else{\\n string text;\\n while(s[p] != '<'){ text += s[p++]; }\\n tag->child.push_back( new Tag(\\\"\\\", text) );\\n }\\n }\\n\\n assert(s[p++] == '<');\\n assert(s[p++] == '/');\\n string tag_end;\\n while(s[p] != '>') tag_end += s[p++];\\n assert(tag_name == tag_end);\\n assert(s[p++] == '>');\\n return Result(tag, p);\\n}\\n\\nvoid make_doc(Tag* p, Tag* doc[500][500], char view[500][500], int W, int H, int& x, int& y){\\n if(! p->visible) return;\\n\\n if(p->name == \\\"br\\\"){\\n x = 0;\\n y ++;\\n }\\n\\n for(auto np : p->child){\\n if(np->text.empty()){\\n make_doc(np, doc, view, W, H, x, y);\\n }else{\\n for(auto c : np->text) {\\n if(y < H) doc[y][x] = p;\\n if(y < H) view[y][x] = c;\\n if(x + 1 < W){\\n x++;\\n }else{\\n x = 0;\\n y++;\\n }\\n }\\n }\\n }\\n}\\n\\nvector<string> collect_script(Tag* p, map<string, string>& file_dict){\\n vector<string> res;\\n if(p->name == \\\"script\\\"){\\n string file = p->child[0]->text + \\\".ds\\\";\\n res.push_back(file_dict[file]);\\n return res;\\n }\\n for(auto np : p->child){\\n vector<string> vs = collect_script(np, file_dict);\\n res.insert(res.end(), vs.begin(), vs.end());\\n }\\n return res;\\n}\\nvoid apply(Tag* p, bool rval, vector<string>& selectors, int k){\\n if(p->name == selectors[k]) k++;\\n if(k == (int)selectors.size()) {\\n p->visible = rval;\\n }else{\\n for(auto np : p->child){\\n apply(np, rval, selectors, k);\\n }\\n }\\n}\\nvoid apply(Tag* root, string s){\\n vector<string> token;\\n string cur;\\n for(auto c : s){\\n if(cur == \\\"=\\\" || cur == \\\"!=\\\" || c == '!' || (cur != \\\"!\\\" && c == '=')) {\\n token.push_back(cur);\\n cur = \\\"\\\";\\n }\\n cur += c;\\n }\\n token.push_back(cur);\\n reverse(token.begin(), token.end());\\n bool expr = (token[0] == \\\"true\\\" ? true : false);\\n for(int i = 2; i < (int)token.size(); i += 2){\\n if(token[i - 1] == \\\"!=\\\") expr ^= expr;\\n string t = token[i];\\n for(auto& c : t) if(c == '.') c = ' ';\\n stringstream ss(t);\\n vector<string> selectors;\\n while(ss >> t) if(t != \\\"visible\\\") selectors.push_back(t);\\n apply(root, expr, selectors, 0);\\n }\\n}\\nvoid run(Tag* root, string func, map<string, string>& file_dict){\\n vector<string> scripts = collect_script(root, file_dict);\\n for(string script : scripts){\\n for(auto& c : script) if(c == '{' || c == '}') c = ' ';\\n stringstream ss(script);\\n string name, program;\\n while(ss >> name >> program) if(name == func){\\n for(auto& c : program) if(c == ';') c = ' ';\\n stringstream ss(program);\\n string sentence;\\n while(ss >> sentence){ apply(root, sentence); }\\n }\\n }\\n}\\n\\nint main(){\\n int N;\\n cin >> N;\\n map<string, string> file_dict;\\n for(int i = 0; i < N; i++) {\\n string name, data;\\n cin >> name;\\n cin.ignore();\\n getline(cin, data);\\n file_dict[name] = data;\\n }\\n\\n int M;\\n cin >> M;\\n while(M--){\\n int W, H, S;\\n string file;\\n cin >> W >> H >> S >> file;\\n Tag* root = parse_dml(file_dict[file + \\\".dml\\\"]).first;\\n\\n Tag* doc[500][500] = {};\\n char view[500][500] = {};\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n\\n while(S--){\\n int x, y;\\n cin >> x >> y;\\n if(doc[y][x] && doc[y][x]->name == \\\"link\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n file = doc[y][x]->child[0]->text;\\n\\n delete root;\\n root = parse_dml(file_dict[file + \\\".dml\\\"]).first;\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }else if(doc[y][x] && doc[y][x]->name == \\\"button\\\"){\\n assert(doc[y][x]->child.size() == 1);\\n string func = doc[y][x]->child[0]->text;\\n run(root, func, file_dict);\\n\\n memset(doc, 0, sizeof(doc));\\n memset(view, 0, sizeof(view));\\n int docx = 0, docy = 0;\\n make_doc(root, doc, view, W, H, docx, docy);\\n }\\n }\\n for(int y = 0; y < H; y++){\\n for(int x = 0; x < W; x++){\\n if(view[y][x]) putchar(view[y][x]);\\n else putchar('.');\\n }\\n putchar('\\\\n');\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.07407407407407407,\n \"time_ms\": 70,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2421_483897\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <algorithm>\\n#include <numeric>\\n#include <functional>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <climits>\\nusing namespace std;\\n\\ntypedef istringstream ISS;\\ntypedef ostringstream OSS;\\ntypedef vector<string> VS;\\ntypedef vector<VS> VVS;\\ntypedef int INT;\\ntypedef vector<INT> VI;\\ntypedef vector<VI> VVI;\\ntypedef pair <INT, INT> II;\\ntypedef vector <II> VII;\\n\\ntypedef string FILENAME;\\ntypedef vector<FILENAME> FILENAMES;\\ntypedef string RAW_DATA;\\ntypedef string FILETYPE;\\ntypedef pair <string, bool> CONTENT_INFO;\\ntypedef pair <CONTENT_INFO, VS> CONTENT; \\ntypedef vector <CONTENT> CONTENTS;\\ntypedef pair <string, string> TERM;\\ntypedef vector <TERM> TERMS;\\n\\nconst int FILES_SIZE = 21;\\nconst int CLICK_SIZE = 51;\\nconst int LINE_SIZE = 502;\\nconst string FILE_TYPE_DML = \\\"DML\\\";\\nconst string FILE_TYPE_DS = \\\"DS\\\";\\nconst string DML_BR_TAG = \\\"<BR>\\\";\\nconst string NONE_TAG = \\\"none_tag\\\";\\nconst string SCRIPT_TAG = \\\"script\\\";\\nconst string BUTTON_TAG = \\\"button\\\";\\nconst string LINK_TAG = \\\"link\\\";\\nconst string EMPTY_FILE = \\\"!\\\";\\nconst int NONE = -1;\\n\\nint n; \\nFILENAME FILE_NAME[FILES_SIZE];\\nRAW_DATA FILE_DATA[FILES_SIZE];\\nFILETYPE FILE_TYPE[FILES_SIZE];\\nCONTENTS FILE_CONTENTS[FILES_SIZE]; \\nTERMS FILE_TERMS[FILES_SIZE]; \\nFILENAMES FILE_SCRIPTS[FILES_SIZE]; \\nint CURRENT_FILE_INDEX;\\nint WINDOW_WIDTH;\\nint WINDOW_HEIGHT;\\nmap <string, int> FILENAME_TO_INDEX;\\nmap <int, string> INDEX_TO_FILENAME;\\nint CLICK_COUNT;\\nint CLICK_X[CLICK_SIZE];\\nint CLICK_Y[CLICK_SIZE];\\nVS DISPLAY; \\nVVS BUTTON; \\nVVS LINK; \\n\\nvoid init() {\\n FILENAME_TO_INDEX.clear();\\n INDEX_TO_FILENAME.clear();\\n}\\n\\nstring get_no_suffix_filename( string filename ) {\\n string res;\\n for ( string::iterator it_i = filename.begin(); it_i != filename.end(); ++ it_i ) {\\n if ( *it_i == '.' ) return res;\\n res += *it_i;\\n }\\n return res;\\n}\\n\\nvoid add_index( string filename, int index ) {\\n FILENAME_TO_INDEX[filename] = index;\\n INDEX_TO_FILENAME[index] = filename;\\n}\\n\\nint get_index( string filename ) {\\n return FILENAME_TO_INDEX[filename];\\n}\\n\\nstring get_filename( int index ) {\\n return INDEX_TO_FILENAME[index];\\n}\\n\\nint get_number() {\\n string line;\\n getline( cin, line );\\n int res = NONE;\\n ISS iss( line );\\n iss >> res;\\n return res;\\n}\\n\\nstring get_line() {\\n string line;\\n getline( cin, line );\\n return line;\\n}\\n\\nbool is_dml_file( string filename ) {\\n reverse( filename.begin(), filename.end() );\\n return filename.substr( 0, 4 ) == \\\"lmd.\\\";\\n}\\n\\nbool is_ds_file( string filename ) {\\n reverse( filename.begin(), filename.end() );\\n return filename.substr( 0, 3 ) == \\\"sd.\\\";\\n}\\n\\nvoid set_contents( int file_index ) {\\n DISPLAY = VS( WINDOW_HEIGHT, string( WINDOW_WIDTH, '.' ) );\\n BUTTON = VVS( WINDOW_HEIGHT, VS( WINDOW_WIDTH, EMPTY_FILE ) );\\n LINK = VVS( WINDOW_HEIGHT, VS( WINDOW_WIDTH, EMPTY_FILE ) );\\n \\n CONTENTS contents = FILE_CONTENTS[file_index];\\n int tr = 0, tc = 0;\\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\\n CONTENT c = *it_i;\\n CONTENT_INFO ci = c.first;\\n string content = ci.first;\\n bool visibility = ci.second;\\n VS nodes = c.second;\\n string last_tag = nodes[nodes.size()-1];\\n if ( ! visibility ) continue;\\n if ( last_tag == SCRIPT_TAG ) continue;\\n if ( content == DML_BR_TAG ) {\\n tc = 0;\\n tr ++;\\n } else {\\n for ( string::iterator it_j = content.begin(); it_j != content.end(); ++ it_j ) {\\n if ( tr < WINDOW_HEIGHT && tc < WINDOW_WIDTH ) {\\n DISPLAY[tr][tc] = *it_j;\\n if ( last_tag == BUTTON_TAG ) {\\n BUTTON[tr][tc] = content;\\n } else if ( last_tag == LINK_TAG ) {\\n LINK[tr][tc] = content;\\n }\\n tc ++;\\n if ( tc >= WINDOW_WIDTH ) {\\n tc = 0;\\n tr ++;\\n }\\n }\\n }\\n }\\n }\\n}\\n\\nvoid init_contents( int file_index ) {\\n CONTENTS& contents = FILE_CONTENTS[file_index];\\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\\n (*it_i).first.second = true;\\n }\\n}\\n\\nVS search_sub_routien_code( int file_index, string finding_sub_routien_name ) {\\n VS res;\\n VS scripts = FILE_SCRIPTS[file_index];\\n for ( VS::iterator it_i = scripts.begin(); it_i != scripts.end(); ++ it_i ) {\\n string script_filename = *it_i;\\n int script_index = get_index( script_filename );\\n TERMS terms = FILE_TERMS[script_index];\\n for ( TERMS::iterator it_j = terms.begin(); it_j != terms.end(); ++ it_j ) {\\n TERM term = *it_j;\\n string code = term.first;\\n string sub_routien_name = term.second; \\n if ( sub_routien_name != finding_sub_routien_name ) continue;\\n res.push_back( code );\\n }\\n }\\n return res;\\n}\\n\\nbool is_operator( char c ) {\\n return c == '=' || c == '!';\\n}\\n\\nVS get_words( string s ) {\\n VS res;\\n ISS iss(s);\\n string w;\\n while ( iss >> w ) res.push_back(w);\\n return res;\\n}\\n\\nVS get_ds_terms( string s ) {\\n int n = s.size();\\n string s1 = s; \\n for ( int i = 0; i < n; ++ i ) {\\n if ( is_operator(s1[i]) ) s1[i] = ' ';\\n }\\n string s2 = s; \\n for ( int i = 0; i < n; ++ i ) {\\n if ( ! is_operator(s2[i]) ) s2[i] = ' ';\\n }\\n\\n VS W1 = get_words( s1 );\\n VS W2 = get_words( s2 );\\n int m = W2.size();\\n\\n VS res;\\n for ( int i = 0; i < m; ++ i ) {\\n res.push_back( W1[i] );\\n res.push_back( W2[i] );\\n }\\n res.push_back( W1[m] );\\n return res;\\n}\\n\\nstring get_nodes_identifier( VS nodes ) {\\n string res;\\n for ( VS::iterator it_i = nodes.begin(); it_i != nodes.end(); ++ it_i ) {\\n res += *it_i;\\n if ( it_i + 1 != nodes.end() ) res += \\\".\\\";\\n }\\n return res;\\n}\\n\\nbool check_prefix_matching( string a, string b ) {\\n if ( a.size() < b.size() ) return false;\\n int n = min( a.size(), b.size() );\\n for ( int i = 0; i < n; ++ i ) {\\n if ( a[i] != b[i] ) return false;\\n }\\n return true;\\n}\\n\\nbool check_suffix_matching( string a, string b ) {\\n reverse( a.begin(), a.end() );\\n reverse( b.begin(), b.end() );\\n int n = min( a.size(), b.size() );\\n for ( int i = 0; i < n; ++ i ) {\\n if ( a[i] != b[i] ) return false;\\n }\\n return true;\\n}\\n\\nvoid applying_result( string target, bool result ) {\\n CONTENTS& contents = FILE_CONTENTS[CURRENT_FILE_INDEX];\\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\\n CONTENT& c = *it_i;\\n CONTENT_INFO& ci = c.first;\\n VS& nodes = c.second;\\n string nodes_identifier = get_nodes_identifier( nodes );\\n string visible_text = nodes_identifier + \\\".visible\\\";\\n string middle_target = \\\".\\\" + target.substr( 0, target.size()-7 );\\n if ( check_prefix_matching( nodes_identifier, target.substr( 0, target.size()-7 ) ) ) {\\n ci.second = result;\\n } else if ( check_suffix_matching( visible_text, target ) ) {\\n ci.second = result;\\n } else if ( nodes_identifier.find( middle_target ) != string::npos ) {\\n ci.second = result;\\n }\\n }\\n \\n}\\n\\nvoid evaluate_ds_terms( VS ds_terms ) {\\n stack <string> ST; \\n stack <string> SE; \\n bool result = false;\\n int n = ds_terms.size();\\n for ( int i = 0; i < n; i += 2 ) {\\n if ( i + 1 >= n ) {\\n result = ds_terms[i] == \\\"true\\\";\\n } else {\\n ST.push( ds_terms[i] );\\n SE.push( ds_terms[i+1] );\\n }\\n }\\n while ( ! ST.empty() ) {\\n string target = ST.top();\\n string operator_type = SE.top();\\n ST.pop();\\n SE.pop();\\n\\n if ( operator_type == \\\"!=\\\" ) {\\n result = ! result;\\n }\\n\\n \\n applying_result( target, result );\\n }\\n}\\n\\nvoid interpret_ds( string code ) {\\n VS ds_terms = get_ds_terms( code );\\n evaluate_ds_terms( ds_terms );\\n}\\n\\nvoid interpret_ds( VS codes ) {\\n for ( VS::iterator it_i = codes.begin(); it_i != codes.end(); ++ it_i ) {\\n interpret_ds( *it_i );\\n }\\n}\\n\\nvoid proc( string current_filename, int click_offset ) {\\n int file_index = get_index( current_filename );\\n CURRENT_FILE_INDEX = file_index;\\n init_contents( file_index ); \\n \\n for ( int i = click_offset; i < CLICK_COUNT; ++ i ) {\\n set_contents( file_index );\\n int click_r = CLICK_Y[i];\\n int click_c = CLICK_X[i];\\n if ( BUTTON[click_r][click_c] != EMPTY_FILE ) {\\n string sub_routien_name = BUTTON[click_r][click_c];\\n VS codes = search_sub_routien_code( file_index, sub_routien_name );\\n interpret_ds( codes );\\n } else if ( LINK[click_r][click_c] != EMPTY_FILE ) {\\n string next_page = LINK[click_r][click_c]+\\\".dml\\\";\\n proc( next_page, i+1 );\\n return;\\n }\\n }\\n \\n set_contents( file_index );\\n\\n for ( int i = 0; i < WINDOW_HEIGHT; ++ i ) {\\n for ( int j = 0; j < WINDOW_WIDTH; ++ j ) {\\n cout << DISPLAY[i][j];\\n }\\n cout << endl;\\n }\\n}\\n\\nvoid procs() {\\n int m = get_number(); \\n for ( int i = 0; i < m; ++ i ) {\\n string line = get_line();\\n ISS iss( line );\\n iss >> WINDOW_WIDTH >> WINDOW_HEIGHT;\\n string start_filename;\\n iss >> CLICK_COUNT >> start_filename;\\n for ( int j = 0; j < CLICK_COUNT; ++ j ) {\\n string line = get_line();\\n ISS iss( line );\\n iss >> CLICK_X[j] >> CLICK_Y[j];\\n }\\n proc( start_filename+\\\".dml\\\", 0 );\\n }\\n}\\n\\nstring to_lower( string s ) {\\n for ( string::iterator it_i = s.begin(); it_i != s.end(); ++ it_i ) {\\n *it_i = tolower( *it_i );\\n }\\n return s;\\n}\\n\\nvoid load() {\\n for ( int i = 0; i < n; ++ i ) {\\n FILE_NAME[i] = get_line();\\n FILE_DATA[i] = get_line();\\n if ( is_dml_file( FILE_NAME[i] ) ) {\\n FILE_TYPE[i] = FILE_TYPE_DML;\\n } else if ( is_ds_file( FILE_NAME[i] ) ) {\\n FILE_TYPE[i] = FILE_TYPE_DS;\\n }\\n add_index( FILE_NAME[i], i );\\n }\\n}\\n\\nCONTENTS get_contents( string data ) {\\n CONTENTS res;\\n \\n stack <string> S;\\n string tag_name;\\n string content;\\n \\n for ( string::iterator it_i = data.begin(); it_i != data.end(); ++ it_i ) {\\n char c = *it_i;\\n stack <string> T = S;\\n VS nodes;\\n while ( ! T.empty() ) {\\n nodes.push_back( T.top() );\\n T.pop();\\n }\\n reverse( nodes.begin(), nodes.end() );\\n if ( c == '<' && it_i + 1 != data.end() && *(it_i+1) != '/' ) {\\n if ( content.size() ) {\\n res.push_back( CONTENT( CONTENT_INFO( content, true ), nodes ) ); \\n }\\n content = tag_name = \\\"\\\";\\n while ( *(it_i+1) != '>' ) tag_name += *(++it_i);\\n it_i++;\\n tag_name = to_lower( tag_name );\\n if ( tag_name == \\\"br\\\" ) {\\n res.push_back( CONTENT( CONTENT_INFO( DML_BR_TAG, true ), nodes ) ); \\n }\\n if ( tag_name != \\\"br\\\" ) S.push( tag_name );\\n } else if ( c == '/' ) {\\n string tag_name = S.top();\\n S.pop();\\n if ( content.size() ) res.push_back( CONTENT( CONTENT_INFO( content, true ), nodes ) ); \\n while ( *it_i != '>' ) it_i ++;\\n content = \\\"\\\";\\n } else if ( c != '<' ) {\\n content += c;\\n }\\n }\\n \\n \\n return res;\\n}\\n\\nTERMS get_terms( string data ) {\\n TERMS res;\\n \\n for ( string::iterator it_i = data.begin(); it_i != data.end(); ++ it_i ) {\\n string sub_routien_name = \\\"\\\";\\n while ( *it_i != '{' && it_i != data.end() ) {\\n sub_routien_name += *(it_i++);\\n }\\n it_i ++;\\n string expression = \\\"\\\";\\n for ( ; it_i != data.end(); ++ it_i ) {\\n if ( *it_i == '}' ) break;\\n if ( *it_i == ';' ) {\\n res.push_back( TERM( to_lower( expression ), sub_routien_name ) );\\n expression = \\\"\\\";\\n } else {\\n expression += *it_i;\\n }\\n }\\n }\\n \\n \\n return res;\\n}\\n\\nFILENAMES get_scripts_from_contents( CONTENTS contents ) {\\n FILENAMES res;\\n for ( CONTENTS::iterator it_i = contents.begin(); it_i != contents.end(); ++ it_i ) {\\n CONTENT c = *it_i;\\n CONTENT_INFO ci = c.first;\\n string content = ci.first;\\n VS nodes = c.second;\\n string last_tag = nodes[nodes.size()-1];\\n if ( last_tag == SCRIPT_TAG ) res.push_back( content+\\\".ds\\\" );\\n }\\n\\n \\n return res;\\n}\\n\\nvoid parse() {\\n for ( int i = 0; i < n; ++ i ) {\\n string type = FILE_TYPE[i];\\n if ( type == FILE_TYPE_DML ) {\\n FILE_CONTENTS[i] = get_contents( FILE_DATA[i] );\\n } else if ( type == FILE_TYPE_DS ) {\\n FILE_TERMS[i] = get_terms( FILE_DATA[i] );\\n }\\n }\\n for ( int i = 0; i < n; ++ i ) {\\n string type = FILE_TYPE[i];\\n if ( type == FILE_TYPE_DML ) {\\n FILE_SCRIPTS[i] = get_scripts_from_contents( FILE_CONTENTS[i] );\\n }\\n }\\n}\\n\\nbool input() {\\n if ( ( n = get_number() ) == NONE ) return false;\\n load();\\n return true;\\n}\\n\\nvoid solve() {\\n parse(); \\n procs();\\n}\\n\\nint main() {\\n init();\\n while ( input() ) {\\n solve();\\n init();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1380,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1384,"cells":{"group_id":{"kind":"string","value":"aoj_2420_cpp"},"problem_description":{"kind":"string","value":"Anipero 2012\nD: アニペロ2012\nアニペロサマーライブ，通称アニペロは，さまざまなアニメソングアーティストたちが集結する，日本国内最大のアニメソングライブイベントである．アニソンが大好きな2D君は，昨年に引き続き，今年もアニペロに行くことにした．\n彼は，アニペロを楽しむために，すでにサイリウムを\nm\n本購入している．サイリウムとは，折ると化学反応で光るスティックである．リズムに合わせてサイリウムを振ることで，ライブを盛り上げることができ，自分の満足度も上昇する．今回，彼が購入した全てのサイリウムは，次のような性質を持つ．\nサイリウムは，折ってから時間が経過するにつれ暗くなっていき，10分で光を失う．\n折ってから5分の間は，非常に明るい（以下，「レベル2」と呼ぶ）．\n折ってから5分経過した後は，少し暗くなる（以下，「レベル1」と呼ぶ）．\n振っても振らなくても，光を失うスピードは変わらない．\n2D君は，限られたサイリウムを曲によってうまく使い分けることで，今年のアニペロでどれだけの満足度を得られそうか，以下の問題を考えることにした．\n彼は，ライブ中に流れるであろう曲を\nn\n曲予想している．\n各曲の長さは，全て5分である．\nn\n曲は，連続で流れ続け，曲と曲の間は，0分と考えてよい．\n各曲には，以下の3つのパラメータが与えられる．\nある曲に対して，レベル2を1本だけ振ったときに増える満足度\nある曲に対して，レベル1を1本だけ振ったときに増える満足度\nある曲において，1本も振らないときに増える満足度\nサイリウムを振ったからといって，満足度が増えるとは限らない．\n振ったら逆に会場の雰囲気を乱して，満足度が減る場合もある．\n振らない場合も，同様のことが言える．\nサイリウムは，以下のルールに従って使用しなければならない．\n曲が始まる時点でのみ折ることができ，一度に何本でも折ることができる．サイリウムを折るのにかかる時間は無視してよい．\n1曲で最大8本同時に振ることができる．\n複数のサイリウムを振る際，以下の式により加算する満足度を計算する．\n(レベル1の本数)×(レベル1の1本あたりの満足度)＋(レベル2の本数)×(レベル2の1本あたりの満足度)\n1本もサイリウムを振らない場合は，1本も振らない場合の満足度だけを加算する．\n一度振ると決めたサイリウムは，1曲が終了するまで持ち替えることはできない．\nサイリウムは，振らずに置いておくことができる．また，サイリウムを全て使いきる必要はない．\n2D君は，ライブの曲予想までは済ませたが，それだけで疲れてしまって，問題を解く気になれなかった．\nあなたの仕事は，彼の代わりに，今年のライブで得られそうな最大満足度を求めるプログラムを書くことである．\nInput\nライブの予想曲リストに対する満足度情報が入力される．\n1行目に，ライブで歌われる曲数\nn\n(1 <=\nn\n<= 50)と，ライブ開始時に2D君が持っている新品のサイリウムの数m (0 <=\nm\n<= 50)がスペース区切りで入力される．\n続く\nn\n行では，1行ずつ1曲の情報が入力される．\ni\n番目(1 <=\ni\n<=\nn\n)の曲情報は，\n曲\ni\nに対して，レベル2のサイリウムを1本振ったときの満足度\na\ni\n曲\ni\nに対して，レベル1のサイリウムを1本振ったときの満足度\nb\ni\n曲\ni\nにおいて，サイリウムを1本も振らないときの満足度\nc\ni\nがスペース区切りで入力される(-100 <=\na\ni\n,\nb\ni\n,\nc\ni\n<= 100)．\nOutput\nライブ終了時の2D君の最大満足度の予想を1行に出力せよ．\n最大満足度がマイナスになることもあるので，注意すること．\n行の最後には，改行を出力すること．\nSample Input 1\n1 5\n2 3 8\nSample Output 1\n10\nSample Input 2\n2 10\n2 2 20\n2 3 -10\nSample Output 2\n44\nSample Input 3\n3 10\n5 1 9\n-3 2 1\n1 11 0\nSample Output 3\n102"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2420_2967017","code_snippet":"#include<iostream>\n#include<vector>\n#define VAL 55\nusing namespace std;\nusing lli = long long int;\nlli dp[VAL][VAL][VAL][VAL]; // 曲，サイリウム数，状態1，状態2\n\nint main(){\n int n, m;\n std::cin >> n >> m;\n for (int i = 0; i < VAL*VAL*VAL*VAL; i++) {\n const int x = VAL*VAL*VAL, y = VAL*VAL, z = VAL;\n dp[i/x][(i/y)%z][(i/z)%z][i%z] = -1e17;\n }\n vector<vector<lli> > music(n, vector<lli>(3));\n for (int i = 0; i < n; i++) {\n int x, y, z;\n std::cin >> x >> y >> z;\n music[i][0] = x;\n music[i][1] = y;\n music[i][2] = z;\n }\n dp[0][m][0][0] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j <= m; j++) {\n for (int k = 0; k <= min(8, j); k++) {\n for (int a = 0; a <= 8; a++) {//状態1\n for (int b = 0; b <= 8; b++) {//状態2\n if(dp[i][j][a][b] == -1e17)continue;\n lli cost = -1e17;\n if(min(k, 8)*music[i][0] + min(a, 8 - min(k, 8))*music[i][1] > 0)\n cost = max(cost, min(k, 8)*music[i][0] + min(a, 8 - min(k, 8))*music[i][1]);\n if(min(k, 8 - min(a, 8))*music[i][0] + min(a, 8)*music[i][1] > 0)\n cost = max(cost, min(k, 8 - min(a, 8))*music[i][0] + min(a, 8)*music[i][1]);\n if(k > 0)cost = max(cost, music[i][0]);\n if(a > 0)cost = max(cost, music[i][1]);\n cost = max(cost, music[i][2]);\n dp[i + 1][j - k][k][a] =\n max(dp[i + 1][j - k][k][a], dp[i][j][a][b] + cost);\n }\n }\n }\n }\n }\n lli ans = -1e17;\n for (int i = 0; i <= 50; i++) {\n for (int j = 0; j <= 50; j++) {\n for (int k = 0; k <= 50; k++) {\n ans = max(ans, dp[n][i][j][k]); \n }\n }\n }\n std::cout << ans << std::endl;\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":74640,"score_of_the_acc":-1.1029,"final_rank":18},{"submission_id":"aoj_2420_2966900","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\nvoid maxUpdate(int& a, int b) { a = max(a, b); }\n\nint n, m, a[55], b[55], c[55], dp[55][55][55];\n\nint getMaxsatis(int i, int L1, int L2) {\n\tint res = c[i];\n\tfor_(x,0,L1+1) for_(y,0,L2+1) {\n\t\tif (x + y == 0 || x + y > 8) continue;\n\t\tmaxUpdate(res, a[i] * y + b[i] * x);\n\t}\n\treturn res;\n}\n\nint main() {\n\tcin >> n >> m;\n\tfor (int i=0; i<n; ++i) cin >> a[i] >> b[i] >> c[i];\n\t\n\tfor_(i,0,n+1) for_(j,0,m+1) for_(k,0,m+1) dp[i][j][k]= -(1L << 30);\n\t\n\tdp[0][0][0] = 0;\n\tfor_(i,0,n) for_(j,0,m+1) for_(k,0,m+1) {\n\t\tif (dp[i][j][k] == -(1L << 30)) continue;\n\t\tfor_(x,0,m-j-k+1) maxUpdate(dp[i+1][j+k][x], dp[i][j][k] + getMaxsatis(i, k, x));\n\t}\n\t\n\tint ans = -(1L << 30);\n\tfor_(j,0,m+1) for_(k,0,m+1) maxUpdate(ans, dp[n][j][k]);\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":160,"memory_kb":3632,"score_of_the_acc":-0.2534,"final_rank":11},{"submission_id":"aoj_2420_2609184","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n\nvector<vector<vector<int>>>dp;\nint main() {\n\tint N, M; cin >> N >> M;\n\tdp = vector<vector<vector<int>>>(N+1, vector<vector<int>>(M + 1, vector<int>(M+1, -1e9)));\n\tdp[0][M][0] = 0;\n\tvector<tuple<int, int, int>>musics;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint a, b, c; cin >> a >> b >> c;\n\t\tmusics.emplace_back(a,b, c);\n\t}\n\tfor (int music = 0; music < N; ++music) {\n\t\tfor (int two = 0; two <= M; ++two) {\n\t\t\tfor (int one = 0; one <= M; ++one) {\n\t\t\t\tfor (int usetwo = 0; usetwo <= min(8,two); ++usetwo) {\n\t\t\t\t\tfor (int useone = 0; useone <= min(8-usetwo, one); ++useone) {\n\t\t\t\t\t\tfor (int destwo = 0; destwo <= min(8,two - usetwo); ++destwo) {\n\t\t\t\t\t\t\tint plus = 0;\n\t\t\t\t\t\t\tif (usetwo == 0 && useone == 0)plus = get<2>(musics[music]);\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tplus += get<1>(musics[music])*useone;\n\t\t\t\t\t\t\t\tplus += get<0>(musics[music])*usetwo;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdp[music + 1][two - usetwo-destwo][usetwo+destwo] = max(dp[music + 1][two - usetwo-destwo][usetwo+destwo], dp[music][two][one] + plus);\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\tint ans = -1e9;\n\tfor (int i = 0; i <= M; ++i) {\n\t\tfor (int j = 0; j <= M; ++j) {\n\t\t\tans = max(ans, dp[N][i][j]);\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3316,"score_of_the_acc":-0.1608,"final_rank":9},{"submission_id":"aoj_2420_2561044","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>\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\nstruct Info{\n\tint value2,value1,value0;\n};\n\nstruct Data{\n\tData(int arg_music,int arg_new_num,int arg_level_1_num){\n\t\tmusic = arg_music;\n\t\tnew_num = arg_new_num;\n\t\tlevel_1_num = arg_level_1_num;\n\t}\n\tint music,new_num,level_1_num;\n};\n\nint dp[51][51][51];\nint next_dp[51][51][51];\n\nint main(){\n\n\tint N,M;\n\tscanf(\"%d %d\",&N,&M);\n\n\tInfo info[N+1];\n\n\tfor(int i = 1; i <= N; i++){\n\t\tscanf(\"%d %d %d\",&info[i].value2,&info[i].value1,&info[i].value0);\n\t}\n\n\tfor(int music = 0; music <= N; music++){\n\t\tfor(int new_num = 0; new_num <= M; new_num++){\n\t\t\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\n\t\t\t\tdp[music][new_num][level_1_num] = -BIG_NUM;\n\t\t\t\tnext_dp[music][new_num][level_1_num] = -BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tdp[0][M][0] = 0;\n\tnext_dp[0][M][0] = 0;\n\n\tvector<Data> Updated;\n\n\tfor(int music = 0; music <= N-1; music++){\n\n\t\tfor(int new_num = 0; new_num <= M; new_num++){\n\t\t\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\n\t\t\t\tif(dp[music][new_num][level_1_num] == -BIG_NUM)continue;\n\n\t\t\t\tfor(int oru_num = 0; oru_num <= new_num; oru_num++){\n\n\t\t\t\t\tif(next_dp[music+1][new_num-oru_num][oru_num] < dp[music][new_num][level_1_num]+info[music+1].value0){\n\t\t\t\t\t\tnext_dp[music+1][new_num-oru_num][oru_num] = dp[music][new_num][level_1_num]+info[music+1].value0;\n\t\t\t\t\t\tUpdated.push_back(Data(music+1,new_num-oru_num,oru_num));\n\t\t\t\t\t}\n\n\t\t\t\t\tfor(int num_2 = 0; num_2 <= oru_num; num_2++){\n\t\t\t\t\t\tfor(int num_1 = 0; num_1 <= level_1_num; num_1++){\n\t\t\t\t\t\t\tif(num_2+num_1 == 0 || num_2+num_1 > 8)continue;\n\n\t\t\t\t\t\t\tint satisfy = num_2*info[music+1].value2+num_1*info[music+1].value1;\n\n\t\t\t\t\t\t\tif(next_dp[music+1][new_num-oru_num][oru_num] < dp[music][new_num][level_1_num]+satisfy){\n\t\t\t\t\t\t\t\tnext_dp[music+1][new_num-oru_num][oru_num] = dp[music][new_num][level_1_num]+satisfy;\n\t\t\t\t\t\t\t\tUpdated.push_back(Data(music+1,new_num-oru_num,oru_num));\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\t\t\t}\n\t\t}\n\n\t\tfor(int k = 0; k < Updated.size(); k++){\n\t\t\tdp[Updated[k].music][Updated[k].new_num][Updated[k].level_1_num] = next_dp[Updated[k].music][Updated[k].new_num][Updated[k].level_1_num];\n\t\t}\n\t\tUpdated.clear();\n\t}\n\n\tint ans = -BIG_NUM;\n\tfor(int new_num = 0; new_num <= M; new_num++){\n\t\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\n\t\t\tans = max(ans,dp[N][new_num][level_1_num]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":4772,"score_of_the_acc":-0.2689,"final_rank":12},{"submission_id":"aoj_2420_2178465","code_snippet":"#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n, m, a[55], b[55], c[55], dp[55][55][55][55]; bool vis[55][55][55][55];\nint rec(int pos, int rem, int lv2, int lv1) {\n\tif (pos == n) return 0;\n\tif (vis[pos][rem][lv2][lv1]) return dp[pos][rem][lv2][lv1];\n\tint ret = -999999999;\n\tfor (int i = 0; i <= rem; i++) {\n\t\tint res = rec(pos + 1, rem - i, i, lv2);\n\t\tint cs = c[pos];\n\t\tfor (int j = 1; j <= 8; j++) {\n\t\t\tfor (int k = 0; k <= j; k++) {\n\t\t\t\tint l = j - k;\n\t\t\t\tif (k <= lv2 && l <= lv1) {\n\t\t\t\t\tcs = max(cs, a[pos] * k + b[pos] * l);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tret = max(ret, res + cs);\n\t}\n\tvis[pos][rem][lv2][lv1] = true;\n\treturn dp[pos][rem][lv2][lv1] = ret;\n}\nint main() {\n\tcin >> n >> m;\n\tfor (int i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i];\n\tint ret = -999999999;\n\tfor (int i = 0; i <= m; i++) ret = max(ret, rec(0, m - i, i, 0));\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":690,"memory_kb":33192,"score_of_the_acc":-1.4354,"final_rank":19},{"submission_id":"aoj_2420_2138310","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\nint n, m, a[100], b[100], c[100];\nint dp[60][60][9];\nint main() {\n\tfor (int i = 0; i < 60; i++) { for (int j = 0; j < 60; j++) { for (int k = 0; k < 9; k++)dp[i][j][k] = -999999999; } }\n\tcin >> n >> m; for (int i = 0; i < n; i++)cin >> a[i] >> b[i] >> c[i]; dp[0][m][0] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j <= m; j++) {\n\t\t\tfor (int k = 0; k <= 8; k++) {\n\t\t\t\tif (dp[i][j][k] <= -100000000)continue;\n\t\t\t\tfor (int l = 0; l <= 8; l++) {\n\t\t\t\t\tfor (int o = 0; o <= k; o++) {\n\t\t\t\t\t\tfor (int r = 0; r <= l; r++) {\n\t\t\t\t\t\t\tif (r + o >= 9)continue;\n\t\t\t\t\t\t\tint p = a[i] * r + b[i] * o;\n\t\t\t\t\t\t\tif (r == 0 && o == 0)p = c[i];\n\t\t\t\t\t\t\tint q = j - l; if (q < 0)continue;\n\t\t\t\t\t\t\tdp[i + 1][q][l] = max(dp[i + 1][q][l], dp[i][j][k] + p);\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\tint maxn = -999999999; for (int i = 0; i <= m; i++) { for (int j = 0; j <= 8; j++)maxn = max(maxn, dp[n][i][j]); }\n\tcout << maxn << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3260,"score_of_the_acc":-0.0277,"final_rank":5},{"submission_id":"aoj_2420_1880984","code_snippet":"#include <iostream>\n\nusing namespace std;\n\n#define MAX 55\n#define MINF -(1e8)\n\nint N,M,a[MAX],b[MAX],c[MAX];\nint memo[MAX][MAX][MAX];\n\nint solve(int n,int l1,int m){\n if(n == N) return 0;\n int &res = memo[n][l1][m];\n if(res != MINF) return res;\n for(int i = 0 ; i <= min(8,m) ; i++){\n for(int j = 0 ; j <= i ; j++){\n for(int k = 0 ; k <= min(l1,8-j) ; k++){\n int cost = (j+k == 0 ? c[n] : a[n]*j+b[n]*k);\n res = max(res,solve(n+1,i,m-i)+cost); \n }\n }\n }\n return res;\n}\n\nint main(){\n cin >> N >> M;\n for(int i = 0 ; i < N ; i++){\n cin >> a[i] >> b[i] >> c[i];\n }\n fill(&memo[0][0][0],&memo[MAX-1][MAX-1][MAX-1],MINF);\n cout << solve(0,0,M) << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3736,"score_of_the_acc":-0.0342,"final_rank":6},{"submission_id":"aoj_2420_1841971","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n#include <map>\n#include <set>\n#include <queue>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n\nint n, m;\nint x[51], y[51], z[51];\nint dp1[51][51][51];\nint dp2[51][51][51];\nconst int INF = 1e9;\nint cost(int a, int b, int c) {\n if (dp1[a][b][c] != -INF) return dp1[a][b][c];\n int res = -INF;\n rep(i, b + 1) rep(j, c + 1) {\n if (i == 0 && j == 0)\n res = max(res, z[a]);\n else if (i + j <= 8)\n res = max(res, i * x[a] + j * y[a]);\n }\n return dp1[a][b][c] = res;\n}\nint dfs(int a, int b, int c) {\n if (a == n) return 0;\n if (dp2[a][b][c] != -INF) return dp2[a][b][c];\n // int res = dfs(a + 1, b, 0) + z[a];\n int res = -INF;\n\n rep(i, b + 1) { res = max(res, dfs(a + 1, b - i, i) + cost(a, i, c)); }\n\n return dp2[a][b][c] = res;\n}\nint main() {\n rep(i, 51) rep(j, 51) rep(k, 51) dp1[i][j][k] = -INF;\n rep(i, 51) rep(j, 51) rep(k, 51) dp2[i][j][k] = -INF;\n cin >> n >> m;\n rep(i, n) cin >> x[i] >> y[i] >> z[i];\n cout << dfs(0, m, 0) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4140,"score_of_the_acc":-0.0397,"final_rank":7},{"submission_id":"aoj_2420_1841970","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <sstream>\n#include <map>\n#include <set>\n#include <queue>\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\n\nint n, m;\nint x[51], y[51], z[51];\nint dp1[51][51][51];\nint dp2[51][51][51];\nconst int INF = 1e9;\nint cost(int a, int b, int c) {\n if (dp1[a][b][c] != -INF) return dp1[a][b][c];\n int res = -INF;\n rep(i, b + 1) rep(j, c + 1) {\n if (i == 0 && j == 0)\n res = max(res, z[a]);\n else if (i + j <= 8)\n res = max(res, i * x[a] + j * y[a]);\n }\n return dp1[a][b][c] = res;\n}\nint dfs(int a, int b, int c) {\n if (a == n) return 0;\n if (dp2[a][b][c] != -INF) return dp2[a][b][c];\n // int res = dfs(a + 1, b, 0) + z[a];\n int res = -INF;\n\n rep(i, b + 1) {\n int s = -INF;\n rep(j, i + 1) {\n rep(k, c + 1) {\n if (k == 0 && j == 0)\n s = max(z[a], s);\n else if (j + k <= 8)\n s = max(s, j * x[a] + k * y[a]);\n }\n }\n res = max(res, dfs(a + 1, b - i, i) + s);\n }\n\n // rep(i, b + 1) { res = max(res, dfs(a + 1, b - i, i) + cost(a, i, c)); }\n\n return dp2[a][b][c] = res;\n}\nint main() {\n rep(i, 51) rep(j, 51) rep(k, 51) dp1[i][j][k] = -INF;\n rep(i, 51) rep(j, 51) rep(k, 51) dp2[i][j][k] = -INF;\n cin >> n >> m;\n rep(i, n) cin >> x[i] >> y[i] >> z[i];\n cout << dfs(0, m, 0) << endl;\n}","accuracy":1,"time_ms":140,"memory_kb":4140,"score_of_the_acc":-0.2309,"final_rank":10},{"submission_id":"aoj_2420_1631962","code_snippet":"/*\n * 2420.cc: Anipero 2012\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 = 50;\nconst int MAX_M = 50;\nconst int MAX_S = 8;\n\nconst int INF = 1 << 30;\n\n/* typedef */\n\n/* global variables */\n\nint as[MAX_N], bs[MAX_N], cs[MAX_N];\nint dp[MAX_N + 1][MAX_M + 1][MAX_S + 1];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n for (int i = 0; i < n; i++) cin >> as[i] >> bs[i] >> cs[i];\n\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= m; j++)\n for (int k = 0; k <= MAX_S; k++) dp[i][j][k] = -INF;\n dp[0][m][0] = 0;\n\n for (int i = 0; i < n; i++)\n for (int j = 0; j <= m; j++)\n for (int k = 0; k <= MAX_S; k++) // Level 1\n\tif (dp[i][j][k] > -INF) {\n\t int max_s = min(j, MAX_S);\n\t for (int s = 0; s <= max_s; s++) { // Level 2\n\t int maxd = -INF;\n\t for (int an = 0; an <= s; an++) {\n\t int max_bn = min(k, MAX_S - an);\n\t for (int bn = 0; bn <= max_bn; bn++) {\n\t\tint d = (an == 0 && bn == 0) ? cs[i] : as[i] * an + bs[i] * bn;\n\t\tif (maxd < d) maxd = d;\n\t }\n\t }\n\t maxd += dp[i][j][k];\n\t if (dp[i + 1][j - s][s] < maxd) dp[i + 1][j - s][s] = maxd;\n\t //printf(\"i=%d, maxd=%d\\n\", i, maxd);\n\t }\n\t}\n \n int ans = -INF;\n for (int j = 0; j <= m; j++)\n for (int k = 0; k <= MAX_S; k++)\n if (ans < dp[n][j][k]) ans = dp[n][j][k];\n printf(\"%d\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1236,"score_of_the_acc":-0.0002,"final_rank":1},{"submission_id":"aoj_2420_1602258","code_snippet":"#include <iostream>\n\nusing namespace std;\n\n#define MAX 55\n#define MINF -(1e8)\n\nint N,M,a[MAX],b[MAX],c[MAX];\nint memo[MAX][MAX][MAX];\n\nint solve(int n,int l1,int m){\n if(n == N) return 0;\n int &res = memo[n][l1][m];\n if(res != MINF) return res;\n for(int i = 0 ; i <= min(8,m) ; i++){\n for(int j = 0 ; j <= i ; j++){\n for(int k = 0 ; k <= min(l1,8-j) ; k++){\n if(j + k == 0){\n res = max(res,solve(n+1,i,m-i)+c[n]); \n }else{\n res = max(res,solve(n+1,i,m-i)+a[n]*j+b[n]*k);\n }\n }\n }\n }\n return res;\n}\n\nint main(){\n cin >> N >> M;\n for(int i = 0 ; i < N ; i++){\n cin >> a[i] >> b[i] >> c[i];\n }\n fill(&memo[0][0][0],&memo[MAX-1][MAX-1][MAX-1],MINF);\n cout << solve(0,0,M) << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1812,"score_of_the_acc":-0.0227,"final_rank":4},{"submission_id":"aoj_2420_1194382","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int64;\nconst int INF = 1 << 30;\nint main(){\n int n, m, a[50], b[50], c[50], dp[51][51][51];\n cin >> n >> m;\n for(int i = 0; i < n; i++){\n cin >> a[i] >> b[i] >> c[i];\n }\n fill_n( **dp, 51 * 51 * 51, -INF);\n dp[0][m][0] = 0;\n for(int i = 0; i < n; i++){ // O(nm^3*64) = O(4*10^8)\n for(int j = 0; j <= m; j++){\n for(int k = 0; k <= m - j; k++){ // レベル1のサイリウムの数\n if(dp[i][j][k] == -INF) continue;\n for(int l = j; l >= 0; l--){ // レベル2のサイリウムの数\n\n //はやくするならここだな\n for(int o = 0; o <= k && o <= 8; o++){ // 実際にふる数 レベル1\n for(int p = 0; p <= l && o + p <= 8; p++){ // 実際にふる数 レベル2\n if(o + p == 0){\n dp[i + 1][j - l][l] = max( dp[i + 1][j - l][l], dp[i][j][k] + c[i]); \n } else {\n dp[i + 1][j - l][l] = max( dp[i + 1][j - l][l], dp[i][j][k] + b[i] * o + a[i] * p);\n }\n }\n }\n }\n }\n }\n }\n int ret = -INF;\n for(int i = 0; i <= m; i++){\n for(int j = 0; j <= m; j++){\n ret = max( ret, dp[n][i][j]);\n }\n }\n cout << ret << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":1680,"score_of_the_acc":-0.1092,"final_rank":8},{"submission_id":"aoj_2420_1033163","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n int n,m;\n cin>>n>>m;\n int dp[51][51][9];\n fill(dp[0][0],dp[51][0],-(1<<29));\n dp[0][m][0]=0;\n for(int i=0;i<n;i++){\n int a,b,c;\n cin>>a>>b>>c;\n for(int j=0;j<=m;j++){\n for(int k=0;k<=8;k++){\n\tfor(int l=0;l<=8&&l<=j;l++){\n\t for(int p=0;p<=l;p++){\n\t for(int o=0;o+p<=8&&o<=k;o++){\n\t int nr=j-l;\n\t dp[i+1][nr][l]=max(dp[i+1][nr][l],dp[i][j][k]+((!p&&!o)?c:a*p+b*o));\n\t }\n\t }\n\t}\n }\n }\n }\n cout<<*max_element(dp[n][0],dp[n+1][0])<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":1252,"score_of_the_acc":-0.0004,"final_rank":2},{"submission_id":"aoj_2420_947090","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#define MINF 0xc0c0c0c0\n \n#include <iostream>\n#include <cstdio>\n#include <sstream>\n#include <cmath>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <limits>\n#include <map>\n#include <string>\n#include <cstring>\n#include <set>\n#include <deque>\n#include <bitset>\n#include <list>\n#include <cctype>\n#include <utility>\n \nusing namespace std;\n \ntypedef long long ll;\ntypedef pair <int,int> P;\ntypedef pair <int,P> PP;\n \nstatic const double EPS = 1e-8;\n \nint tx[] = {0,1,0,-1};\nint ty[] = {-1,0,1,0};\n\nint compute_optimal_swing(int level2_satisfaction,\n int level1_satisfaction,\n int none_satisfaction,\n int level2_remaining,\n int level1_remaining\n){\n int res = none_satisfaction;\n for(int use_level2 = 0; use_level2 <= level2_remaining; use_level2++){\n for(int use_level1 = 0; use_level1 <= level1_remaining; use_level1++){\n if(use_level2 + use_level1 > 8) continue;\n if(use_level2 ==0 && use_level1 == 0) continue;\n res = max(level2_satisfaction * use_level2\n + level1_satisfaction * use_level1,res);\n }\n }\n return res;\n}\n\nint main(){\n int total_songs;\n int cyalume;\n while(~scanf(\"%d %d\",\n &total_songs,\n &cyalume)){\n\n int dp[51][51]; //next accumulate\n memset(dp,0xc0,sizeof(dp));\n dp[0][0] = 0;\n\n int res = MINF;\n for(int song_idx=0;song_idx < total_songs;song_idx++){\n int level2_satisfaction,level1_satisfaction,none_satisfaction;\n scanf(\"%d %d %d\",\n &level2_satisfaction,\n &level1_satisfaction,\n &none_satisfaction);\n\n int next_dp[51][51];\n memset(next_dp,0xc0,sizeof(next_dp));\n \n for(int accumulate=cyalume;accumulate>=0;accumulate--){\n for(int prev=0;prev<=cyalume;prev++){\n if(prev > accumulate) continue;\n\n for(int next=0;next<=cyalume;next++){\n if(dp[prev][accumulate - next] == MINF) continue;\n if(accumulate - next < 0) continue;\n\n next_dp[next][accumulate] \n = max(dp[prev][accumulate - next]\n + compute_optimal_swing(level2_satisfaction,\n level1_satisfaction,\n none_satisfaction,\n next,prev),\n next_dp[next][accumulate]);\n\n if(song_idx == total_songs - 1){\n res = max(res,next_dp[next][accumulate]);\n }\n }\n }\n }\n \n memcpy(dp,next_dp,sizeof(int)*51*51);\n }\n\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":230,"memory_kb":1228,"score_of_the_acc":-0.3236,"final_rank":14},{"submission_id":"aoj_2420_902458","code_snippet":"#include<iostream>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nint dp[60][60][60];\n\nint main() {\n int n, m;\n cin >> n >> m;\n int a[n], b[n], c[n];\n rep (i, n) cin >> a[i] >> b[i] >> c[i];\n rep (i, 60) rep (j, 60) rep (k, 60) dp[i][j][k] = -1e9;\n dp[0][m][0] = 0;\n rep (i, n) rep (j, m + 1) rep (k, m + 1) rep (l, min(j + 1, 9)) {\n if (l + k <= 8 && l + k > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i] * l + b[i] * k);\n if (l > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i] * l);\n if (k > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + b[i] * k);\n if (l > 1) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i]);\n if (k > 1) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + b[i]);\n dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + c[i]);\n }\n int res = -1e9;\n rep (i, m + 1) rep (j, m + 1) res = max(res, dp[n][i][j]);\n cout << res << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":2004,"score_of_the_acc":-0.0106,"final_rank":3},{"submission_id":"aoj_2420_676570","code_snippet":"#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <sstream>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <climits>\n#include <cassert>\nusing namespace std;\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(),(a).rend()\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define REP(i,n) FOR(i,0,n)\nconst double EPS = 1e-10;\nconst double PI = acos(-1.0);\n\nint dp[51][51][51][51]={};\nconst int MIN=INT_MIN/10;\nint dfs(int live,int lv0,int lv1,int lv2,vi &a,vi &b,vi &c){\n\tif(dp[live][lv0][lv1][lv2]!=MIN){\n\t\treturn dp[live][lv0][lv1][lv2];\n\t}\n\tif(live==a.size()){\n\t\treturn 0;\n\t}\n\tint ret=MIN;\n\tREP(k,lv2+1){\n\t\tREP(i,min(8,k)+1){\n\t\t\tREP(j,8-i+1){\n\t\t\t\tif(lv1>=j){\n\t\t\t\t\tint plus=0;\n\t\t\t\t\tif(i==0&&j==0){\n\t\t\t\t\t\tplus=c[live];\n\t\t\t\t\t}else{\n\t\t\t\t\t\tplus=a[live]*i+b[live]*j;\n\t\t\t\t\t}\n\t\t\t\t\tret=max(ret,dfs(live+1,lv0+lv1,k,lv2-k,a,b,c)+plus);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn dp[live][lv0][lv1][lv2]=ret;\n}\nint main(){\n\tint n,m;\n\tcin>>n>>m;\n\tvi a(n),b(n),c(n);\n\tREP(i,51)REP(j,51)REP(k,51)REP(l,51)dp[i][j][k][l]=MIN;\n\tREP(i,n){\n\t\tcin>>a[i]>>b[i]>>c[i];\n\t}\n\tcout<<dfs(0,0,0,m,a,b,c)<<endl;\n\n\t//REP(i,51){\n\t//\tint aa=0;\n\t//\tREP(j,51)REP(k,51)REP(l,51){\n\t//\t\taa=max(aa,dp[i][j][k][l]);\n\t//\t}\n\t//\tcout<<i<<\" \"<<aa<<endl;\n\t//}\n}","accuracy":1,"time_ms":260,"memory_kb":27628,"score_of_the_acc":-0.7273,"final_rank":17},{"submission_id":"aoj_2420_587898","code_snippet":"#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nconst long long INF = 0xfffffff;\n\ntemplate<class T> inline void chmax(T &a, T b) { if(b > a) a = b; }\n\nint main() {\n\tcin.tie(false);\n\tios::sync_with_stdio(false);\n\n\tint n, m;\n\tcin >> n >> m;\n\n\tvector<int> a(n), b(n), c(n);\n\tfor(int i = 0; i < n; ++i)\n\t\tcin >> a[i] >> b[i] >> c[i];\n\n\tvector<vector<long long> > dp(m + 1, vector<long long>(9, -INF));\n\tdp[m][0] = 0;\n\n\tfor(int i = 0; i < n; ++i) {\n\t\tvector<vector<long long> > tmp(m + 1, vector<long long>(9, -INF));\n\n\t\tfor(int j = 0; j <= m; ++j) {\n\t\t\tfor(int k = 0; k <= 8; ++k) {\n\t\t\t\tfor(int l = 0; l <= min(j, 8); ++l) {\n\t\t\t\t\tchmax(tmp[j - l][l], dp[j][k] + c[i]);\n\n\t\t\t\t\tfor(int one = 0; one <= k; ++one)\n\t\t\t\t\t\tfor(int two = 0; two <= l; ++two)\n\t\t\t\t\t\t\tif(1 <= one + two && one + two <= 8)\n\t\t\t\t\t\t\t\tchmax(tmp[j - l][l], dp[j][k] + two * a[i] + one * b[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.swap(tmp);\n\t}\n\t\n\tlong long ans = 0;\n\tfor(int i = 0; i <= m; ++i)\n\t\tfor(int j = 0; j <= 8; ++j)\n\t\t\tchmax(ans, dp[i][j]);\n\n\tcout << ans << endl;\n\n\treturn EXIT_SUCCESS;\n}","accuracy":0.9130434782608695,"time_ms":10,"memory_kb":1224,"score_of_the_acc":0,"final_rank":20},{"submission_id":"aoj_2420_564754","code_snippet":"#include<stdio.h>\n#include<string.h>\nint ans[51][51][51][51];//ans[n曲目][折った本数][レベル２の本数][レベル１の本数]=満足度\nbool calcOK[51][51][51][51];//同上 計算可能のメモ\nint main(){\n\tint n,m;\n\tint a,b,c;\n\tscanf(\"%d %d\",&n,&m);\n\tmemset(ans,0,sizeof(ans));\n\tmemset(calcOK,false,sizeof(calcOK));\n\tfor(int i=0;i<=m;i++){\n\t\tcalcOK[0][i][i][0]=true;\n\t}\n\t\n\tint lastAns=-100000000;\n\tfor(int i=1;i<=n;i++){\n\t\t//iはｎ曲目\n\t\tscanf(\"%d %d %d\",&a,&b,&c);\n\t\tfor(int j=0;j<=m;j++){\n\t\t\t//jは折った数\n\t\t\tfor(int L2=0;L2<=j;L2++){\n\t\t\t\t//前回折ったＬｅｖｅｌ２の数\n\t\t\t\tfor(int L1=0;L1+L2<=j;L1++){\n\t\t\t\t\tif(calcOK[i-1][j][L2][L1]==false)continue;\n\t\t\t\t\tint mMax;\n\t\t\t\t\tfor(int a1=0;a1<=8&&a1<=L2;a1++){\n\t\t\t\t\t\tfor(int b1=0;b1+a1<=8&&b1<=L1;b1++){\n\t\t\t\t\t\t\tif(a1==0&&b1==0)mMax=c;\n\t\t\t\t\t\t\telse if(mMax<a*a1+b*b1)mMax=a*a1+b*b1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tfor(int nowL2=0;nowL2+j<=m;nowL2++){\n\t\t\t\t\t\tif(calcOK[i][j+nowL2][nowL2][L2]==false){\n\t\t\t\t\t\t\tans[i][j+nowL2][nowL2][L2]=ans[i-1][j][L2][L1]+mMax;\n\t\t\t\t\t\t\tcalcOK[i][j+nowL2][nowL2][L2]=true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(ans[i][j+nowL2][nowL2][L2]<ans[i-1][j][L2][L1]+mMax){\n\t\t\t\t\t\t\tans[i][j+nowL2][nowL2][L2]=ans[i-1][j][L2][L1]+mMax;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(i==n&&lastAns<ans[i][j+nowL2][nowL2][L2])lastAns=ans[i][j+nowL2][nowL2][L2];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"%d\\n\",lastAns);\n}","accuracy":1,"time_ms":90,"memory_kb":34068,"score_of_the_acc":-0.565,"final_rank":16},{"submission_id":"aoj_2420_513011","code_snippet":"#include<iostream>\n#include<algorithm>\n#define REP(i,a) for(int i=0;i<a;i++)\nusing namespace std;\n\nint n,m;\nint a[60],b[60],c[60];\nint dp[60][60][60];\n\nint main(){\n cin >> n >> m;\n REP(i,n)cin >> a[i] >> b[i] >> c[i];\n\n REP(i,n+1)REP(j,m+1)REP(k,m+1)dp[i][j][k] = -100000000;\n\n dp[0][m][0] = 0;\n\n REP(i,n){\n REP(j,m+1)REP(k,m+1){\n REP(z,j+1){\n\tint s = c[i];\n\tfor(int x=1;x<=8;x++)\n\t for(int y=0;y<=x;y++){\n\t if(z<y || k<x-y)continue;\n\t s = max(s, a[i]*y + b[i]*(x-y));\n\t }\n\tdp[i+1][j-z][z] = max(dp[i+1][j-z][z],dp[i][j][k] + s);\n }\n }\n }\n\n int ans = -100000000;\n REP(j,m+1)REP(k,m+1)ans = max(ans,dp[n][j][k]);\n cout << ans << endl;\n}","accuracy":1,"time_ms":200,"memory_kb":1880,"score_of_the_acc":-0.2883,"final_rank":13},{"submission_id":"aoj_2420_501167","code_snippet":"#include <stdio.h>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define INF (1<<28)\n\nint n, m, a[64], b[64], c[64];\nint dp[64][64][64];\n\nint f(int k, int x, int y) {\n int ans = c[k];\n rep (i, x+1) rep (j, y+1) if (1 <= i+j && i+j <= 8) {\n ans = max(ans, a[k]*i + b[k]*j);\n }\n return ans;\n}\n\nint main() {\n scanf(\"%d%d\", &n, &m);\n rep (i, n) scanf(\"%d%d%d\", a+i, b+i, c+i);\n rep (i, 64) rep (j, 64) rep (k, 64) dp[i][j][k] = -INF;\n dp[0][0][0] = 0;\n rep (k, n) rep (x, m+1) rep (i, x+1) if (dp[k][x][i] > -INF) {\n rep (j, m-x+1) {\n dp[k+1][x+j][j] = max(dp[k+1][x+j][j], dp[k][x][i]+f(k, j, i));\n }\n }\n int ans = -INF;\n rep (x, m+1) rep (i, 64) ans = max(ans, dp[n][x][i]);\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":2052,"score_of_the_acc":-0.3348,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2420_2967017\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#define VAL 55\\nusing namespace std;\\nusing lli = long long int;\\nlli dp[VAL][VAL][VAL][VAL]; // 曲，サイリウム数，状態1，状態2\\n\\nint main(){\\n int n, m;\\n std::cin >> n >> m;\\n for (int i = 0; i < VAL*VAL*VAL*VAL; i++) {\\n const int x = VAL*VAL*VAL, y = VAL*VAL, z = VAL;\\n dp[i/x][(i/y)%z][(i/z)%z][i%z] = -1e17;\\n }\\n vector<vector<lli> > music(n, vector<lli>(3));\\n for (int i = 0; i < n; i++) {\\n int x, y, z;\\n std::cin >> x >> y >> z;\\n music[i][0] = x;\\n music[i][1] = y;\\n music[i][2] = z;\\n }\\n dp[0][m][0][0] = 0;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j <= m; j++) {\\n for (int k = 0; k <= min(8, j); k++) {\\n for (int a = 0; a <= 8; a++) {//状態1\\n for (int b = 0; b <= 8; b++) {//状態2\\n if(dp[i][j][a][b] == -1e17)continue;\\n lli cost = -1e17;\\n if(min(k, 8)*music[i][0] + min(a, 8 - min(k, 8))*music[i][1] > 0)\\n cost = max(cost, min(k, 8)*music[i][0] + min(a, 8 - min(k, 8))*music[i][1]);\\n if(min(k, 8 - min(a, 8))*music[i][0] + min(a, 8)*music[i][1] > 0)\\n cost = max(cost, min(k, 8 - min(a, 8))*music[i][0] + min(a, 8)*music[i][1]);\\n if(k > 0)cost = max(cost, music[i][0]);\\n if(a > 0)cost = max(cost, music[i][1]);\\n cost = max(cost, music[i][2]);\\n dp[i + 1][j - k][k][a] =\\n max(dp[i + 1][j - k][k][a], dp[i][j][a][b] + cost);\\n }\\n }\\n }\\n }\\n }\\n lli ans = -1e17;\\n for (int i = 0; i <= 50; i++) {\\n for (int j = 0; j <= 50; j++) {\\n for (int k = 0; k <= 50; k++) {\\n ans = max(ans, dp[n][i][j][k]); \\n }\\n }\\n }\\n std::cout << ans << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 74640,\n \"score_of_the_acc\": -1.1029,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2420_2966900\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define for_(i,a,b) for(int i=(a);i<(b);++i)\\nvoid maxUpdate(int& a, int b) { a = max(a, b); }\\n\\nint n, m, a[55], b[55], c[55], dp[55][55][55];\\n\\nint getMaxsatis(int i, int L1, int L2) {\\n\\tint res = c[i];\\n\\tfor_(x,0,L1+1) for_(y,0,L2+1) {\\n\\t\\tif (x + y == 0 || x + y > 8) continue;\\n\\t\\tmaxUpdate(res, a[i] * y + b[i] * x);\\n\\t}\\n\\treturn res;\\n}\\n\\nint main() {\\n\\tcin >> n >> m;\\n\\tfor (int i=0; i<n; ++i) cin >> a[i] >> b[i] >> c[i];\\n\\t\\n\\tfor_(i,0,n+1) for_(j,0,m+1) for_(k,0,m+1) dp[i][j][k]= -(1L << 30);\\n\\t\\n\\tdp[0][0][0] = 0;\\n\\tfor_(i,0,n) for_(j,0,m+1) for_(k,0,m+1) {\\n\\t\\tif (dp[i][j][k] == -(1L << 30)) continue;\\n\\t\\tfor_(x,0,m-j-k+1) maxUpdate(dp[i+1][j+k][x], dp[i][j][k] + getMaxsatis(i, k, x));\\n\\t}\\n\\t\\n\\tint ans = -(1L << 30);\\n\\tfor_(j,0,m+1) for_(k,0,m+1) maxUpdate(ans, dp[n][j][k]);\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.2534,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2420_2609184\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n\\nvector<vector<vector<int>>>dp;\\nint main() {\\n\\tint N, M; cin >> N >> M;\\n\\tdp = vector<vector<vector<int>>>(N+1, vector<vector<int>>(M + 1, vector<int>(M+1, -1e9)));\\n\\tdp[0][M][0] = 0;\\n\\tvector<tuple<int, int, int>>musics;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint a, b, c; cin >> a >> b >> c;\\n\\t\\tmusics.emplace_back(a,b, c);\\n\\t}\\n\\tfor (int music = 0; music < N; ++music) {\\n\\t\\tfor (int two = 0; two <= M; ++two) {\\n\\t\\t\\tfor (int one = 0; one <= M; ++one) {\\n\\t\\t\\t\\tfor (int usetwo = 0; usetwo <= min(8,two); ++usetwo) {\\n\\t\\t\\t\\t\\tfor (int useone = 0; useone <= min(8-usetwo, one); ++useone) {\\n\\t\\t\\t\\t\\t\\tfor (int destwo = 0; destwo <= min(8,two - usetwo); ++destwo) {\\n\\t\\t\\t\\t\\t\\t\\tint plus = 0;\\n\\t\\t\\t\\t\\t\\t\\tif (usetwo == 0 && useone == 0)plus = get<2>(musics[music]);\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\tplus += get<1>(musics[music])*useone;\\n\\t\\t\\t\\t\\t\\t\\t\\tplus += get<0>(musics[music])*usetwo;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tdp[music + 1][two - usetwo-destwo][usetwo+destwo] = max(dp[music + 1][two - usetwo-destwo][usetwo+destwo], dp[music][two][one] + plus);\\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\\tint ans = -1e9;\\n\\tfor (int i = 0; i <= M; ++i) {\\n\\t\\tfor (int j = 0; j <= M; ++j) {\\n\\t\\t\\tans = max(ans, dp[N][i][j]);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.1608,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2420_2561044\",\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>\\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\\nstruct Info{\\n\\tint value2,value1,value0;\\n};\\n\\nstruct Data{\\n\\tData(int arg_music,int arg_new_num,int arg_level_1_num){\\n\\t\\tmusic = arg_music;\\n\\t\\tnew_num = arg_new_num;\\n\\t\\tlevel_1_num = arg_level_1_num;\\n\\t}\\n\\tint music,new_num,level_1_num;\\n};\\n\\nint dp[51][51][51];\\nint next_dp[51][51][51];\\n\\nint main(){\\n\\n\\tint N,M;\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tInfo info[N+1];\\n\\n\\tfor(int i = 1; i <= N; i++){\\n\\t\\tscanf(\\\"%d %d %d\\\",&info[i].value2,&info[i].value1,&info[i].value0);\\n\\t}\\n\\n\\tfor(int music = 0; music <= N; music++){\\n\\t\\tfor(int new_num = 0; new_num <= M; new_num++){\\n\\t\\t\\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\\n\\t\\t\\t\\tdp[music][new_num][level_1_num] = -BIG_NUM;\\n\\t\\t\\t\\tnext_dp[music][new_num][level_1_num] = -BIG_NUM;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdp[0][M][0] = 0;\\n\\tnext_dp[0][M][0] = 0;\\n\\n\\tvector<Data> Updated;\\n\\n\\tfor(int music = 0; music <= N-1; music++){\\n\\n\\t\\tfor(int new_num = 0; new_num <= M; new_num++){\\n\\t\\t\\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\\n\\t\\t\\t\\tif(dp[music][new_num][level_1_num] == -BIG_NUM)continue;\\n\\n\\t\\t\\t\\tfor(int oru_num = 0; oru_num <= new_num; oru_num++){\\n\\n\\t\\t\\t\\t\\tif(next_dp[music+1][new_num-oru_num][oru_num] < dp[music][new_num][level_1_num]+info[music+1].value0){\\n\\t\\t\\t\\t\\t\\tnext_dp[music+1][new_num-oru_num][oru_num] = dp[music][new_num][level_1_num]+info[music+1].value0;\\n\\t\\t\\t\\t\\t\\tUpdated.push_back(Data(music+1,new_num-oru_num,oru_num));\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tfor(int num_2 = 0; num_2 <= oru_num; num_2++){\\n\\t\\t\\t\\t\\t\\tfor(int num_1 = 0; num_1 <= level_1_num; num_1++){\\n\\t\\t\\t\\t\\t\\t\\tif(num_2+num_1 == 0 || num_2+num_1 > 8)continue;\\n\\n\\t\\t\\t\\t\\t\\t\\tint satisfy = num_2*info[music+1].value2+num_1*info[music+1].value1;\\n\\n\\t\\t\\t\\t\\t\\t\\tif(next_dp[music+1][new_num-oru_num][oru_num] < dp[music][new_num][level_1_num]+satisfy){\\n\\t\\t\\t\\t\\t\\t\\t\\tnext_dp[music+1][new_num-oru_num][oru_num] = dp[music][new_num][level_1_num]+satisfy;\\n\\t\\t\\t\\t\\t\\t\\t\\tUpdated.push_back(Data(music+1,new_num-oru_num,oru_num));\\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\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int k = 0; k < Updated.size(); k++){\\n\\t\\t\\tdp[Updated[k].music][Updated[k].new_num][Updated[k].level_1_num] = next_dp[Updated[k].music][Updated[k].new_num][Updated[k].level_1_num];\\n\\t\\t}\\n\\t\\tUpdated.clear();\\n\\t}\\n\\n\\tint ans = -BIG_NUM;\\n\\tfor(int new_num = 0; new_num <= M; new_num++){\\n\\t\\tfor(int level_1_num = 0; level_1_num <= M; level_1_num++){\\n\\t\\t\\tans = max(ans,dp[N][new_num][level_1_num]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4772,\n \"score_of_the_acc\": -0.2689,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2420_2178465\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nint n, m, a[55], b[55], c[55], dp[55][55][55][55]; bool vis[55][55][55][55];\\nint rec(int pos, int rem, int lv2, int lv1) {\\n\\tif (pos == n) return 0;\\n\\tif (vis[pos][rem][lv2][lv1]) return dp[pos][rem][lv2][lv1];\\n\\tint ret = -999999999;\\n\\tfor (int i = 0; i <= rem; i++) {\\n\\t\\tint res = rec(pos + 1, rem - i, i, lv2);\\n\\t\\tint cs = c[pos];\\n\\t\\tfor (int j = 1; j <= 8; j++) {\\n\\t\\t\\tfor (int k = 0; k <= j; k++) {\\n\\t\\t\\t\\tint l = j - k;\\n\\t\\t\\t\\tif (k <= lv2 && l <= lv1) {\\n\\t\\t\\t\\t\\tcs = max(cs, a[pos] * k + b[pos] * l);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tret = max(ret, res + cs);\\n\\t}\\n\\tvis[pos][rem][lv2][lv1] = true;\\n\\treturn dp[pos][rem][lv2][lv1] = ret;\\n}\\nint main() {\\n\\tcin >> n >> m;\\n\\tfor (int i = 0; i < n; i++) cin >> a[i] >> b[i] >> c[i];\\n\\tint ret = -999999999;\\n\\tfor (int i = 0; i <= m; i++) ret = max(ret, rec(0, m - i, i, 0));\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 33192,\n \"score_of_the_acc\": -1.4354,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2420_2138310\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\nint n, m, a[100], b[100], c[100];\\nint dp[60][60][9];\\nint main() {\\n\\tfor (int i = 0; i < 60; i++) { for (int j = 0; j < 60; j++) { for (int k = 0; k < 9; k++)dp[i][j][k] = -999999999; } }\\n\\tcin >> n >> m; for (int i = 0; i < n; i++)cin >> a[i] >> b[i] >> c[i]; dp[0][m][0] = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tfor (int j = 0; j <= m; j++) {\\n\\t\\t\\tfor (int k = 0; k <= 8; k++) {\\n\\t\\t\\t\\tif (dp[i][j][k] <= -100000000)continue;\\n\\t\\t\\t\\tfor (int l = 0; l <= 8; l++) {\\n\\t\\t\\t\\t\\tfor (int o = 0; o <= k; o++) {\\n\\t\\t\\t\\t\\t\\tfor (int r = 0; r <= l; r++) {\\n\\t\\t\\t\\t\\t\\t\\tif (r + o >= 9)continue;\\n\\t\\t\\t\\t\\t\\t\\tint p = a[i] * r + b[i] * o;\\n\\t\\t\\t\\t\\t\\t\\tif (r == 0 && o == 0)p = c[i];\\n\\t\\t\\t\\t\\t\\t\\tint q = j - l; if (q < 0)continue;\\n\\t\\t\\t\\t\\t\\t\\tdp[i + 1][q][l] = max(dp[i + 1][q][l], dp[i][j][k] + p);\\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\\tint maxn = -999999999; for (int i = 0; i <= m; i++) { for (int j = 0; j <= 8; j++)maxn = max(maxn, dp[n][i][j]); }\\n\\tcout << maxn << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.0277,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2420_1880984\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\n\\n#define MAX 55\\n#define MINF -(1e8)\\n\\nint N,M,a[MAX],b[MAX],c[MAX];\\nint memo[MAX][MAX][MAX];\\n\\nint solve(int n,int l1,int m){\\n if(n == N) return 0;\\n int &res = memo[n][l1][m];\\n if(res != MINF) return res;\\n for(int i = 0 ; i <= min(8,m) ; i++){\\n for(int j = 0 ; j <= i ; j++){\\n for(int k = 0 ; k <= min(l1,8-j) ; k++){\\n int cost = (j+k == 0 ? c[n] : a[n]*j+b[n]*k);\\n res = max(res,solve(n+1,i,m-i)+cost); \\n }\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n cin >> N >> M;\\n for(int i = 0 ; i < N ; i++){\\n cin >> a[i] >> b[i] >> c[i];\\n }\\n fill(&memo[0][0][0],&memo[MAX-1][MAX-1][MAX-1],MINF);\\n cout << solve(0,0,M) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3736,\n \"score_of_the_acc\": -0.0342,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2420_1841971\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <sstream>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\\n\\nint n, m;\\nint x[51], y[51], z[51];\\nint dp1[51][51][51];\\nint dp2[51][51][51];\\nconst int INF = 1e9;\\nint cost(int a, int b, int c) {\\n if (dp1[a][b][c] != -INF) return dp1[a][b][c];\\n int res = -INF;\\n rep(i, b + 1) rep(j, c + 1) {\\n if (i == 0 && j == 0)\\n res = max(res, z[a]);\\n else if (i + j <= 8)\\n res = max(res, i * x[a] + j * y[a]);\\n }\\n return dp1[a][b][c] = res;\\n}\\nint dfs(int a, int b, int c) {\\n if (a == n) return 0;\\n if (dp2[a][b][c] != -INF) return dp2[a][b][c];\\n // int res = dfs(a + 1, b, 0) + z[a];\\n int res = -INF;\\n\\n rep(i, b + 1) { res = max(res, dfs(a + 1, b - i, i) + cost(a, i, c)); }\\n\\n return dp2[a][b][c] = res;\\n}\\nint main() {\\n rep(i, 51) rep(j, 51) rep(k, 51) dp1[i][j][k] = -INF;\\n rep(i, 51) rep(j, 51) rep(k, 51) dp2[i][j][k] = -INF;\\n cin >> n >> m;\\n rep(i, n) cin >> x[i] >> y[i] >> z[i];\\n cout << dfs(0, m, 0) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -0.0397,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2420_1841970\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <sstream>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (int)n; i++)\\n\\nint n, m;\\nint x[51], y[51], z[51];\\nint dp1[51][51][51];\\nint dp2[51][51][51];\\nconst int INF = 1e9;\\nint cost(int a, int b, int c) {\\n if (dp1[a][b][c] != -INF) return dp1[a][b][c];\\n int res = -INF;\\n rep(i, b + 1) rep(j, c + 1) {\\n if (i == 0 && j == 0)\\n res = max(res, z[a]);\\n else if (i + j <= 8)\\n res = max(res, i * x[a] + j * y[a]);\\n }\\n return dp1[a][b][c] = res;\\n}\\nint dfs(int a, int b, int c) {\\n if (a == n) return 0;\\n if (dp2[a][b][c] != -INF) return dp2[a][b][c];\\n // int res = dfs(a + 1, b, 0) + z[a];\\n int res = -INF;\\n\\n rep(i, b + 1) {\\n int s = -INF;\\n rep(j, i + 1) {\\n rep(k, c + 1) {\\n if (k == 0 && j == 0)\\n s = max(z[a], s);\\n else if (j + k <= 8)\\n s = max(s, j * x[a] + k * y[a]);\\n }\\n }\\n res = max(res, dfs(a + 1, b - i, i) + s);\\n }\\n\\n // rep(i, b + 1) { res = max(res, dfs(a + 1, b - i, i) + cost(a, i, c)); }\\n\\n return dp2[a][b][c] = res;\\n}\\nint main() {\\n rep(i, 51) rep(j, 51) rep(k, 51) dp1[i][j][k] = -INF;\\n rep(i, 51) rep(j, 51) rep(k, 51) dp2[i][j][k] = -INF;\\n cin >> n >> m;\\n rep(i, n) cin >> x[i] >> y[i] >> z[i];\\n cout << dfs(0, m, 0) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4140,\n \"score_of_the_acc\": -0.2309,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2420_1631962\",\n \"code_snippet\": \"/*\\n * 2420.cc: Anipero 2012\\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 = 50;\\nconst int MAX_M = 50;\\nconst int MAX_S = 8;\\n\\nconst int INF = 1 << 30;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint as[MAX_N], bs[MAX_N], cs[MAX_N];\\nint dp[MAX_N + 1][MAX_M + 1][MAX_S + 1];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n\\n for (int i = 0; i < n; i++) cin >> as[i] >> bs[i] >> cs[i];\\n\\n for (int i = 0; i <= n; i++)\\n for (int j = 0; j <= m; j++)\\n for (int k = 0; k <= MAX_S; k++) dp[i][j][k] = -INF;\\n dp[0][m][0] = 0;\\n\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j <= m; j++)\\n for (int k = 0; k <= MAX_S; k++) // Level 1\\n\\tif (dp[i][j][k] > -INF) {\\n\\t int max_s = min(j, MAX_S);\\n\\t for (int s = 0; s <= max_s; s++) { // Level 2\\n\\t int maxd = -INF;\\n\\t for (int an = 0; an <= s; an++) {\\n\\t int max_bn = min(k, MAX_S - an);\\n\\t for (int bn = 0; bn <= max_bn; bn++) {\\n\\t\\tint d = (an == 0 && bn == 0) ? cs[i] : as[i] * an + bs[i] * bn;\\n\\t\\tif (maxd < d) maxd = d;\\n\\t }\\n\\t }\\n\\t maxd += dp[i][j][k];\\n\\t if (dp[i + 1][j - s][s] < maxd) dp[i + 1][j - s][s] = maxd;\\n\\t //printf(\\\"i=%d, maxd=%d\\\\n\\\", i, maxd);\\n\\t }\\n\\t}\\n \\n int ans = -INF;\\n for (int j = 0; j <= m; j++)\\n for (int k = 0; k <= MAX_S; k++)\\n if (ans < dp[n][j][k]) ans = dp[n][j][k];\\n printf(\\\"%d\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1236,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2420_1602258\",\n \"code_snippet\": \"#include <iostream>\\n\\nusing namespace std;\\n\\n#define MAX 55\\n#define MINF -(1e8)\\n\\nint N,M,a[MAX],b[MAX],c[MAX];\\nint memo[MAX][MAX][MAX];\\n\\nint solve(int n,int l1,int m){\\n if(n == N) return 0;\\n int &res = memo[n][l1][m];\\n if(res != MINF) return res;\\n for(int i = 0 ; i <= min(8,m) ; i++){\\n for(int j = 0 ; j <= i ; j++){\\n for(int k = 0 ; k <= min(l1,8-j) ; k++){\\n if(j + k == 0){\\n res = max(res,solve(n+1,i,m-i)+c[n]); \\n }else{\\n res = max(res,solve(n+1,i,m-i)+a[n]*j+b[n]*k);\\n }\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n cin >> N >> M;\\n for(int i = 0 ; i < N ; i++){\\n cin >> a[i] >> b[i] >> c[i];\\n }\\n fill(&memo[0][0][0],&memo[MAX-1][MAX-1][MAX-1],MINF);\\n cout << solve(0,0,M) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1812,\n \"score_of_the_acc\": -0.0227,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2420_1194382\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int64;\\nconst int INF = 1 << 30;\\nint main(){\\n int n, m, a[50], b[50], c[50], dp[51][51][51];\\n cin >> n >> m;\\n for(int i = 0; i < n; i++){\\n cin >> a[i] >> b[i] >> c[i];\\n }\\n fill_n( **dp, 51 * 51 * 51, -INF);\\n dp[0][m][0] = 0;\\n for(int i = 0; i < n; i++){ // O(nm^3*64) = O(4*10^8)\\n for(int j = 0; j <= m; j++){\\n for(int k = 0; k <= m - j; k++){ // レベル1のサイリウムの数\\n if(dp[i][j][k] == -INF) continue;\\n for(int l = j; l >= 0; l--){ // レベル2のサイリウムの数\\n\\n //はやくするならここだな\\n for(int o = 0; o <= k && o <= 8; o++){ // 実際にふる数 レベル1\\n for(int p = 0; p <= l && o + p <= 8; p++){ // 実際にふる数 レベル2\\n if(o + p == 0){\\n dp[i + 1][j - l][l] = max( dp[i + 1][j - l][l], dp[i][j][k] + c[i]); \\n } else {\\n dp[i + 1][j - l][l] = max( dp[i + 1][j - l][l], dp[i][j][k] + b[i] * o + a[i] * p);\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n int ret = -INF;\\n for(int i = 0; i <= m; i++){\\n for(int j = 0; j <= m; j++){\\n ret = max( ret, dp[n][i][j]);\\n }\\n }\\n cout << ret << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 1680,\n \"score_of_the_acc\": -0.1092,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2420_1033163\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint main(){\\n int n,m;\\n cin>>n>>m;\\n int dp[51][51][9];\\n fill(dp[0][0],dp[51][0],-(1<<29));\\n dp[0][m][0]=0;\\n for(int i=0;i<n;i++){\\n int a,b,c;\\n cin>>a>>b>>c;\\n for(int j=0;j<=m;j++){\\n for(int k=0;k<=8;k++){\\n\\tfor(int l=0;l<=8&&l<=j;l++){\\n\\t for(int p=0;p<=l;p++){\\n\\t for(int o=0;o+p<=8&&o<=k;o++){\\n\\t int nr=j-l;\\n\\t dp[i+1][nr][l]=max(dp[i+1][nr][l],dp[i][j][k]+((!p&&!o)?c:a*p+b*o));\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n }\\n cout<<*max_element(dp[n][0],dp[n+1][0])<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1252,\n \"score_of_the_acc\": -0.0004,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2420_947090\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#define MINF 0xc0c0c0c0\\n \\n#include <iostream>\\n#include <cstdio>\\n#include <sstream>\\n#include <cmath>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <limits>\\n#include <map>\\n#include <string>\\n#include <cstring>\\n#include <set>\\n#include <deque>\\n#include <bitset>\\n#include <list>\\n#include <cctype>\\n#include <utility>\\n \\nusing namespace std;\\n \\ntypedef long long ll;\\ntypedef pair <int,int> P;\\ntypedef pair <int,P> PP;\\n \\nstatic const double EPS = 1e-8;\\n \\nint tx[] = {0,1,0,-1};\\nint ty[] = {-1,0,1,0};\\n\\nint compute_optimal_swing(int level2_satisfaction,\\n int level1_satisfaction,\\n int none_satisfaction,\\n int level2_remaining,\\n int level1_remaining\\n){\\n int res = none_satisfaction;\\n for(int use_level2 = 0; use_level2 <= level2_remaining; use_level2++){\\n for(int use_level1 = 0; use_level1 <= level1_remaining; use_level1++){\\n if(use_level2 + use_level1 > 8) continue;\\n if(use_level2 ==0 && use_level1 == 0) continue;\\n res = max(level2_satisfaction * use_level2\\n + level1_satisfaction * use_level1,res);\\n }\\n }\\n return res;\\n}\\n\\nint main(){\\n int total_songs;\\n int cyalume;\\n while(~scanf(\\\"%d %d\\\",\\n &total_songs,\\n &cyalume)){\\n\\n int dp[51][51]; //next accumulate\\n memset(dp,0xc0,sizeof(dp));\\n dp[0][0] = 0;\\n\\n int res = MINF;\\n for(int song_idx=0;song_idx < total_songs;song_idx++){\\n int level2_satisfaction,level1_satisfaction,none_satisfaction;\\n scanf(\\\"%d %d %d\\\",\\n &level2_satisfaction,\\n &level1_satisfaction,\\n &none_satisfaction);\\n\\n int next_dp[51][51];\\n memset(next_dp,0xc0,sizeof(next_dp));\\n \\n for(int accumulate=cyalume;accumulate>=0;accumulate--){\\n for(int prev=0;prev<=cyalume;prev++){\\n if(prev > accumulate) continue;\\n\\n for(int next=0;next<=cyalume;next++){\\n if(dp[prev][accumulate - next] == MINF) continue;\\n if(accumulate - next < 0) continue;\\n\\n next_dp[next][accumulate] \\n = max(dp[prev][accumulate - next]\\n + compute_optimal_swing(level2_satisfaction,\\n level1_satisfaction,\\n none_satisfaction,\\n next,prev),\\n next_dp[next][accumulate]);\\n\\n if(song_idx == total_songs - 1){\\n res = max(res,next_dp[next][accumulate]);\\n }\\n }\\n }\\n }\\n \\n memcpy(dp,next_dp,sizeof(int)*51*51);\\n }\\n\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.3236,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2420_902458\",\n \"code_snippet\": \"#include<iostream>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\n\\nint dp[60][60][60];\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n int a[n], b[n], c[n];\\n rep (i, n) cin >> a[i] >> b[i] >> c[i];\\n rep (i, 60) rep (j, 60) rep (k, 60) dp[i][j][k] = -1e9;\\n dp[0][m][0] = 0;\\n rep (i, n) rep (j, m + 1) rep (k, m + 1) rep (l, min(j + 1, 9)) {\\n if (l + k <= 8 && l + k > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i] * l + b[i] * k);\\n if (l > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i] * l);\\n if (k > 0) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + b[i] * k);\\n if (l > 1) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + a[i]);\\n if (k > 1) dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + b[i]);\\n dp[i + 1][j - l][l] = max(dp[i + 1][j - l][l], dp[i][j][k] + c[i]);\\n }\\n int res = -1e9;\\n rep (i, m + 1) rep (j, m + 1) res = max(res, dp[n][i][j]);\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2004,\n \"score_of_the_acc\": -0.0106,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2420_676570\",\n \"code_snippet\": \"#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <algorithm>\\n#include <utility>\\n#include <functional>\\n#include <sstream>\\n#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cctype>\\n#include <string>\\n#include <cstring>\\n#include <ctime>\\n#include <climits>\\n#include <cassert>\\nusing namespace std;\\ninline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}\\ntemplate<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n#define ALL(a) (a).begin(),(a).end()\\n#define RALL(a) (a).rbegin(),(a).rend()\\n#define EXIST(s,e) ((s).find(e)!=(s).end())\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\n\\nint dp[51][51][51][51]={};\\nconst int MIN=INT_MIN/10;\\nint dfs(int live,int lv0,int lv1,int lv2,vi &a,vi &b,vi &c){\\n\\tif(dp[live][lv0][lv1][lv2]!=MIN){\\n\\t\\treturn dp[live][lv0][lv1][lv2];\\n\\t}\\n\\tif(live==a.size()){\\n\\t\\treturn 0;\\n\\t}\\n\\tint ret=MIN;\\n\\tREP(k,lv2+1){\\n\\t\\tREP(i,min(8,k)+1){\\n\\t\\t\\tREP(j,8-i+1){\\n\\t\\t\\t\\tif(lv1>=j){\\n\\t\\t\\t\\t\\tint plus=0;\\n\\t\\t\\t\\t\\tif(i==0&&j==0){\\n\\t\\t\\t\\t\\t\\tplus=c[live];\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tplus=a[live]*i+b[live]*j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tret=max(ret,dfs(live+1,lv0+lv1,k,lv2-k,a,b,c)+plus);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dp[live][lv0][lv1][lv2]=ret;\\n}\\nint main(){\\n\\tint n,m;\\n\\tcin>>n>>m;\\n\\tvi a(n),b(n),c(n);\\n\\tREP(i,51)REP(j,51)REP(k,51)REP(l,51)dp[i][j][k][l]=MIN;\\n\\tREP(i,n){\\n\\t\\tcin>>a[i]>>b[i]>>c[i];\\n\\t}\\n\\tcout<<dfs(0,0,0,m,a,b,c)<<endl;\\n\\n\\t//REP(i,51){\\n\\t//\\tint aa=0;\\n\\t//\\tREP(j,51)REP(k,51)REP(l,51){\\n\\t//\\t\\taa=max(aa,dp[i][j][k][l]);\\n\\t//\\t}\\n\\t//\\tcout<<i<<\\\" \\\"<<aa<<endl;\\n\\t//}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 27628,\n \"score_of_the_acc\": -0.7273,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2420_587898\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdlib>\\n#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nconst long long INF = 0xfffffff;\\n\\ntemplate<class T> inline void chmax(T &a, T b) { if(b > a) a = b; }\\n\\nint main() {\\n\\tcin.tie(false);\\n\\tios::sync_with_stdio(false);\\n\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\n\\tvector<int> a(n), b(n), c(n);\\n\\tfor(int i = 0; i < n; ++i)\\n\\t\\tcin >> a[i] >> b[i] >> c[i];\\n\\n\\tvector<vector<long long> > dp(m + 1, vector<long long>(9, -INF));\\n\\tdp[m][0] = 0;\\n\\n\\tfor(int i = 0; i < n; ++i) {\\n\\t\\tvector<vector<long long> > tmp(m + 1, vector<long long>(9, -INF));\\n\\n\\t\\tfor(int j = 0; j <= m; ++j) {\\n\\t\\t\\tfor(int k = 0; k <= 8; ++k) {\\n\\t\\t\\t\\tfor(int l = 0; l <= min(j, 8); ++l) {\\n\\t\\t\\t\\t\\tchmax(tmp[j - l][l], dp[j][k] + c[i]);\\n\\n\\t\\t\\t\\t\\tfor(int one = 0; one <= k; ++one)\\n\\t\\t\\t\\t\\t\\tfor(int two = 0; two <= l; ++two)\\n\\t\\t\\t\\t\\t\\t\\tif(1 <= one + two && one + two <= 8)\\n\\t\\t\\t\\t\\t\\t\\t\\tchmax(tmp[j - l][l], dp[j][k] + two * a[i] + one * b[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tdp.swap(tmp);\\n\\t}\\n\\t\\n\\tlong long ans = 0;\\n\\tfor(int i = 0; i <= m; ++i)\\n\\t\\tfor(int j = 0; j <= 8; ++j)\\n\\t\\t\\tchmax(ans, dp[i][j]);\\n\\n\\tcout << ans << endl;\\n\\n\\treturn EXIT_SUCCESS;\\n}\",\n \"accuracy\": 0.9130434782608695,\n \"time_ms\": 10,\n \"memory_kb\": 1224,\n \"score_of_the_acc\": 0,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2420_564754\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\nint ans[51][51][51][51];//ans[n曲目][折った本数][レベル２の本数][レベル１の本数]=満足度\\nbool calcOK[51][51][51][51];//同上 計算可能のメモ\\nint main(){\\n\\tint n,m;\\n\\tint a,b,c;\\n\\tscanf(\\\"%d %d\\\",&n,&m);\\n\\tmemset(ans,0,sizeof(ans));\\n\\tmemset(calcOK,false,sizeof(calcOK));\\n\\tfor(int i=0;i<=m;i++){\\n\\t\\tcalcOK[0][i][i][0]=true;\\n\\t}\\n\\t\\n\\tint lastAns=-100000000;\\n\\tfor(int i=1;i<=n;i++){\\n\\t\\t//iはｎ曲目\\n\\t\\tscanf(\\\"%d %d %d\\\",&a,&b,&c);\\n\\t\\tfor(int j=0;j<=m;j++){\\n\\t\\t\\t//jは折った数\\n\\t\\t\\tfor(int L2=0;L2<=j;L2++){\\n\\t\\t\\t\\t//前回折ったＬｅｖｅｌ２の数\\n\\t\\t\\t\\tfor(int L1=0;L1+L2<=j;L1++){\\n\\t\\t\\t\\t\\tif(calcOK[i-1][j][L2][L1]==false)continue;\\n\\t\\t\\t\\t\\tint mMax;\\n\\t\\t\\t\\t\\tfor(int a1=0;a1<=8&&a1<=L2;a1++){\\n\\t\\t\\t\\t\\t\\tfor(int b1=0;b1+a1<=8&&b1<=L1;b1++){\\n\\t\\t\\t\\t\\t\\t\\tif(a1==0&&b1==0)mMax=c;\\n\\t\\t\\t\\t\\t\\t\\telse if(mMax<a*a1+b*b1)mMax=a*a1+b*b1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfor(int nowL2=0;nowL2+j<=m;nowL2++){\\n\\t\\t\\t\\t\\t\\tif(calcOK[i][j+nowL2][nowL2][L2]==false){\\n\\t\\t\\t\\t\\t\\t\\tans[i][j+nowL2][nowL2][L2]=ans[i-1][j][L2][L1]+mMax;\\n\\t\\t\\t\\t\\t\\t\\tcalcOK[i][j+nowL2][nowL2][L2]=true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(ans[i][j+nowL2][nowL2][L2]<ans[i-1][j][L2][L1]+mMax){\\n\\t\\t\\t\\t\\t\\t\\tans[i][j+nowL2][nowL2][L2]=ans[i-1][j][L2][L1]+mMax;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(i==n&&lastAns<ans[i][j+nowL2][nowL2][L2])lastAns=ans[i][j+nowL2][nowL2][L2];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\",lastAns);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 34068,\n \"score_of_the_acc\": -0.565,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2420_513011\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#define REP(i,a) for(int i=0;i<a;i++)\\nusing namespace std;\\n\\nint n,m;\\nint a[60],b[60],c[60];\\nint dp[60][60][60];\\n\\nint main(){\\n cin >> n >> m;\\n REP(i,n)cin >> a[i] >> b[i] >> c[i];\\n\\n REP(i,n+1)REP(j,m+1)REP(k,m+1)dp[i][j][k] = -100000000;\\n\\n dp[0][m][0] = 0;\\n\\n REP(i,n){\\n REP(j,m+1)REP(k,m+1){\\n REP(z,j+1){\\n\\tint s = c[i];\\n\\tfor(int x=1;x<=8;x++)\\n\\t for(int y=0;y<=x;y++){\\n\\t if(z<y || k<x-y)continue;\\n\\t s = max(s, a[i]*y + b[i]*(x-y));\\n\\t }\\n\\tdp[i+1][j-z][z] = max(dp[i+1][j-z][z],dp[i][j][k] + s);\\n }\\n }\\n }\\n\\n int ans = -100000000;\\n REP(j,m+1)REP(k,m+1)ans = max(ans,dp[n][j][k]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 1880,\n \"score_of_the_acc\": -0.2883,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2420_501167\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <algorithm>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define INF (1<<28)\\n\\nint n, m, a[64], b[64], c[64];\\nint dp[64][64][64];\\n\\nint f(int k, int x, int y) {\\n int ans = c[k];\\n rep (i, x+1) rep (j, y+1) if (1 <= i+j && i+j <= 8) {\\n ans = max(ans, a[k]*i + b[k]*j);\\n }\\n return ans;\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &n, &m);\\n rep (i, n) scanf(\\\"%d%d%d\\\", a+i, b+i, c+i);\\n rep (i, 64) rep (j, 64) rep (k, 64) dp[i][j][k] = -INF;\\n dp[0][0][0] = 0;\\n rep (k, n) rep (x, m+1) rep (i, x+1) if (dp[k][x][i] > -INF) {\\n rep (j, m-x+1) {\\n dp[k+1][x+j][j] = max(dp[k+1][x+j][j], dp[k][x][i]+f(k, j, i));\\n }\\n }\\n int ans = -INF;\\n rep (x, m+1) rep (i, 64) ans = max(ans, dp[n][x][i]);\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 2052,\n \"score_of_the_acc\": -0.3348,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1385,"cells":{"group_id":{"kind":"string","value":"aoj_2425_cpp"},"problem_description":{"kind":"string","value":"全探索お姉さんの休日\n全探索お姉さんはとても優秀な女性である。\nお姉さんは格子状の道の経路の数え上げを数千程度なら簡単に数え上げてしまう。\n\nあなたと全探索お姉さんは今、六角形のタイルが敷き詰められた部屋にいる。\nお姉さんは初めて見る六角形にとても興奮している様子である。\n六角形の並びを座標に表すことに不慣れなお姉さんは図1のような座標系で部屋を表した。\n図1\nあなたはこの座標系上である地点からある地点まで移動したい。\nしかし、お姉さんは 1 分ごとに動きたい方向をあなたに指示する。\nいつものお姉さんなら同じ座標の場所を通らないようにあなたに移動の指示を出すだろう。\nしかし、この座標系に不慣れなお姉さんは\n|x×y×t|\n(\nx\n：\nx\n座標、\ny\n：\ny\n座標、\nt\n:最初の指示からの経過時間[分])を 6 で割った余り\nに対応する方向（図で示す番号と対応）を指示するだけで、まったくのでたらめな方向にあなたを誘導する。\n図2\nお姉さんを傷つけたくないあなたは、お姉さんの指示をできるだけ守りつつ目的地までたどり着きたい。\nあなたは許された行動は下の 7 つの行動である。\n方向 0 へ 1 タイル移動\n方向 1 へ 1 タイル移動\n方向 2 へ 1 タイル移動\n方向 3 へ 1 タイル移動\n方向 4 へ 1 タイル移動\n方向 5 へ 1 タイル移動\nその場に留まる\nお姉さんが指示を出した直後にあなたはこれら行動のうちの必ず1つを行う。\n\n部屋には家具があり家具が配置されているタイルの中に移動することはできない。\nまた、\ny\n座標の絶対値が\nly\nを超えたり\nx\n座標の絶対値が\nlx\nを超えるような移動は許されていない。\nしかし、お姉さんはそのような移動を指示することがある。\n指示を無視するとはお姉さんが示した方向と異なる方向へ移動するか、\nもしくは、その場に留まることである。\n\n目的地にたどり着くために最小で何度指示を無視すれば良いかを出力せよ。\n目的地にたどり着くことが不可能な場合は -1 を出力せよ。\nInput\n入力は以下の形式で与えられる。\nsx\nsy\ngx\ngy\nn\nx\n1\ny\n1\n...\nx\ni\ny\ni\n...\nx\nn\ny\nn\nlx\nly\nここで、\nsx\n,\nsy\nは出発地点の座標\ngx\n,\ngy\nは目的地の座標\nn\nは部屋に配置されている家具の数\nx\ni\n,\ny\ni\nは家具があるタイルの座標\nlx\n,\nly\nは移動できる\nX\n,\nY\nそれぞれの座標の絶対値の上限\nである。\nConstraints\n入力はすべて整数\n-lx ≤ sx\n,\ngx ≤ lx\n-ly ≤ sy\n,\ngy ≤ ly\n(sx, sy) ≠ (gx, gy)\n(xi, yi) ≠ (sx, sy)(1≤i≤n)\n(xi, yi) ≠ (gx, gy)(1≤i≤n)\n(xi, yi) ≠ (xj, yj)(i ≠ j)\n0≤ n ≤ 1000\n-lx ≤ xi ≤ lx (1≤i≤n)\n-ly ≤ yi ≤ ly (1≤i≤n)\n0 < lx, ly ≤ 100\nOutput\n出力は1つの整数を含む1行で出力せよ。\n目的地にたどり着ける場合は、最小の指示を無視する回数を出力せよ。\n目的地にたどり着くことが不可能な場合は-1を出力せよ。\nSample Input 1\n0 0 0 2\n0\n2 2\nOutput for the Sample Input 1\n0\nSample Input 2\n0 0 0 2\n6\n0 1\n1 0\n1 -1\n0 -1\n-1 -1\n-1 0\n2 2\nOutput for the Sample Input 2\n-1\nSample Input 3\n0 0 0 2\n1\n0 1\n2 2\nOutput for the Sample Input 3\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2425_10914251","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 pii = pair<int,int>;\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = (r)-1;i >= l;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\nint dx[] = {0,1,1,0,-1,-1,0};\nint dy1[] = {1,0,-1,-1,-1,0,0};\nint dy2[] = {1,1,0,-1,0,1,0};\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n pii S,T;cin >> S >> T;\n int n;cin >> n;\n vvb blk(300,vb(300));\n const int MD = 150;\n rep(i,0,n){\n int x,y;cin >> x >> y;\n blk[MD+x][MD+y] = 1;\n }\n pii L;cin >> L;\n deque<tuple<int,int,int>> dq;\n vvvi d(300,vvi(300,vi(6,MOD)));\n d[MD+S.first][MD+S.second][0] = 0;\n dq.push_back({S.first,S.second,0});\n while(sz(dq)){\n auto [ox,oy,ot] = dq.front();dq.pop_front();\n int k = abs(ox*oy)*ot%6;\n rep(dir,0,7){\n int nx = ox + dx[dir],ny = oy + dy1[dir],nt = (ot+1)%6;\n if(ox & 1)ny = oy + dy2[dir];\n if(blk[MD+nx][MD+ny])continue;\n if(abs(nx) > L.first || abs(ny) > L.second)continue;\n if(dir == k){\n if(d[MD+ox][MD+oy][ot] < d[MD+nx][MD+ny][nt]){\n d[MD+nx][MD+ny][nt] = d[MD+ox][MD+oy][ot];\n dq.push_front({nx,ny,nt});\n }\n }else{\n if(d[MD+ox][MD+oy][ot]+1 < d[MD+nx][MD+ny][nt]){\n d[MD+nx][MD+ny][nt] = d[MD+ox][MD+oy][ot]+1;\n dq.push_back({nx,ny,nt});\n }\n }\n }\n }\n ll res = MOD;\n rep(i,0,6)chmin(res,d[MD+T.first][MD+T.second][i]);\n if(res == MOD)res = -1;\n cout << res << endl;\n \n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":11292,"score_of_the_acc":-0.0741,"final_rank":6},{"submission_id":"aoj_2425_10867634","code_snippet":"#include <queue>\n#include <vector>\n#include <iostream>\nusing namespace std;\nvector<int> dx = { 0, 1, 1, 0, -1, -1, 0 };\nvector<vector<int> > dy = {\n\t{ 1, 0, -1, -1, -1, 0, 0 },\n\t{ 1, 1, 0, -1, 0, 1, 0 }\n};\nint sx, sy, gx, gy, lx, ly, n;\nint main() {\n\tcin >> sx >> sy >> gx >> gy >> n;\n\tvector<int> ex(n), ey(n);\n\tfor (int i = 0; i < n; i++) cin >> ex[i] >> ey[i];\n\tcin >> lx >> ly;\n\tvector<vector<bool> > ok(ly * 2 + 1, vector<bool>(lx * 2 + 1, true));\n\tfor (int i = 0; i < n; i++) ok[ey[i] + ly][ex[i] + lx] = false;\n\tvector<vector<vector<int> > > dist(ly * 2 + 1, vector<vector<int> >(lx * 2 + 1, vector<int>(6, 999999999))); dist[sy + ly][sx + lx][0] = 0;\n\tpriority_queue<vector<int> > que; que.push({ 0, sx, sy, 0 });\n\twhile (!que.empty()) {\n\t\tvector<int> u = que.top(); que.pop();\n\t\tint fx = u[1], fy = u[2], ft = u[3], cur = dist[fy + ly][fx + lx][ft];\n\t\tfor (int i = 0; i < 7; i++) {\n\t\t\tint tx = fx + dx[i], ty = fy + dy[abs(fx) % 2][i], tt = (ft + 1) % 6;\n\t\t\tint cost = (abs(fx * fy * ft) % 6 == i ? 0 : 1);\n\t\t\tif (abs(tx) <= lx && abs(ty) <= ly && ok[ty + ly][tx + lx] && dist[ty + ly][tx + lx][tt] > cur + cost) {\n\t\t\t\tdist[ty + ly][tx + lx][tt] = cur + cost;\n\t\t\t\tque.push({ -dist[ty + ly][tx + lx][tt], tx, ty, tt });\n\t\t\t}\n\t\t}\n\t}\n\tint ret = 999999999;\n\tfor (int i = 0; i < 6; i++) ret = min(ret, dist[gy + ly][gx + lx][i]);\n\tcout << (ret != 999999999 ? ret : -1) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":5820,"score_of_the_acc":-0.0337,"final_rank":5},{"submission_id":"aoj_2425_9703246","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 LX, LY;\n\npair<int,int> Move(int X, int Y, int dir) {\n if (dir == 6) return {X,Y};\n if (X %2 == LX % 2) {\n if (dir == 0) return {X,Y+1};\n if (dir == 1) return {X+1,Y};\n if (dir == 2) return {X+1,Y-1};\n if (dir == 3) return {X,Y-1};\n if (dir == 4) return {X-1,Y-1};\n if (dir == 5) return {X-1,Y};\n }\n else {\n if (dir == 0) return {X,Y+1};\n if (dir == 1) return {X+1,Y+1};\n if (dir == 2) return {X+1,Y};\n if (dir == 3) return {X,Y-1};\n if (dir == 4) return {X-1,Y};\n if (dir == 5) return {X-1,Y+1};\n }\n return {0,0};\n}\n\nint Dir(int X, int Y, int T) {\n return (abs(X-LX)*abs(Y-LY)*T)%6;\n}\n\nint main() {\n int SX, SY, GX, GY, N;\n cin >> SX >> SY >> GX >> GY >> N;\n vector<int> X(N), Y(N);\n rep(i,0,N) cin >> X[i] >> Y[i];\n cin >> LX >> LY;\n SX += LX, SY += LY, GX += LX, GY += LY;\n int MX = LX*2+1, MY = LY*2+1;\n vector<vector<bool>> B(MX,vector<bool>(MY,true));\n rep(i,0,N) X[i] += LX, Y[i] += LY, B[X[i]][Y[i]] = false;\n auto in = [&](int i, int j) -> bool {return (0 <= i && i < MX && 0 <= j && j < MY && B[i][j]);};\n auto encode = [&](int i, int j, int k) -> int {return i*MY*6+j*6+k;};\n auto decode = [&](int i) -> tuple<int,int,int> {return {i/(MY*6),(i/6)%MY,i%6};};\n vector<int> Dist(MX*MY*6,inf);\n Dist[encode(SX,SY,0)] = 0;\n deque<int> Q;\n Q.push_back(encode(SX,SY,0));\n while(!Q.empty()) {\n int P = Q.front();\n auto [X,Y,T] = decode(P);\n Q.pop_front();\n rep(i,0,7) {\n auto [NX,NY] = Move(X,Y,i);\n if (!in(NX,NY)) continue;\n int ND;\n if (i == Dir(X,Y,T)) ND = 0;\n else ND = 1;\n if (chmin(Dist[encode(NX,NY,(T+1)%6)],Dist[P]+ND)) {\n if (ND == 0) Q.push_front(encode(NX,NY,(T+1)%6));\n else Q.push_back(encode(NX,NY,(T+1)%6));\n }\n }\n }\n int ANS = inf;\n rep(i,0,6) chmin(ANS,Dist[encode(GX,GY,i)]);\n cout << (ANS == inf ? -1 : ANS) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3976,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2425_9373303","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing ll = long long;\n#define all(x) x.begin(), x.end()\ntemplate <class A, class B>\ninline bool chmin(A &a, const B &b) {\n return b < a && (a = b, true);\n}\ntemplate <class A, class B>\ninline bool chmax(A &a, const B &b) {\n return b > a && (a = b, true);\n}\n\nint main() {\n const int OFFSET = 105;\n const int H = 2 * OFFSET;\n const int W = 2 * OFFSET;\n int sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n int n;\n cin >> n;\n vector ng(H, vector<bool>(W));\n rep(i, n) {\n int x, y;\n cin >> x >> y;\n ng[x + OFFSET][y + OFFSET] = true;\n }\n int lx, ly;\n cin >> lx >> ly;\n const int DX[2][7] = {\n {0, 1, 1, 0, -1, -1, 0}, \n {0, 1, 1, 0, -1, -1, 0}\n };\n const int DY[2][7] = {\n {1, 0, -1, -1, -1, 0, 0},\n {1, 1, 0, -1, 0, 1, 0}\n };\n // 補正する\n auto encode = [&](int x, int y) {\n return pair<int, int>(x + OFFSET, y + OFFSET);\n };\n // 補正を消す\n auto decode = [&](int X, int Y) {\n return pair<int, int>(X - OFFSET, Y - OFFSET);\n };\n // 補正ありで条件を満たしているか判定\n auto valid = [&](int X, int Y) {\n auto [x, y] = decode(X, Y);\n return abs(x) <= lx && abs(y) <= ly;\n };\n // 補正ありで障害物があるか判定\n auto obstacle = [&](int X, int Y) {\n assert(valid(X, Y));\n return ng[X][Y];\n };\n auto sister = [&](int X, int Y, int t) {\n auto [x, y] = decode(X, Y);\n return abs(x * y * t) % 6;\n };\n auto parity = [&](int X) {\n return (X - OFFSET) % 2 != 0;\n };\n\n const int INF = 1e9;\n // dist[X][Y][t]: (X, Y)にいて、時間を6で割ったあまりが6であるときの最小無視回数\n vector dist(H, vector(W, vector<int>(6, INF)));\n // (X, Y, t): 補正ありの座標と時間を6で割ったあまり\n priority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> que;\n auto [sX, sY] = encode(sx, sy);\n auto [gX, gY] = encode(gx, gy);\n dist[sX][sY][0] = 0;\n que.emplace(0, sX, sY, 0);\n while (!que.empty()) {\n auto [cd, cX, cY, ct] = que.top();\n que.pop();\n if (dist[cX][cY][ct] < cd) continue;\n assert(dist[cX][cY][ct] != INF);\n assert(0 <= ct && ct < 6);\n int sug = sister(cX, cY, ct);\n for (int d = 0; d < 7; d++) {\n int nX = cX + DX[parity(cX)][d];\n int nY = cY + DY[parity(cX)][d];\n int nt = (ct + 1) % 6;\n int w = (d != sug);\n if (valid(nX, nY) && !obstacle(nX, nY) && dist[nX][nY][nt] > dist[cX][cY][ct] + w) {\n dist[nX][nY][nt] = dist[cX][cY][ct] + w;\n que.emplace(dist[nX][nY][nt], nX, nY, nt);\n }\n }\n }\n int ans = INF;\n rep(i, 6) chmin(ans, dist[gX][gY][i]);\n cout << (ans == INF ? -1 : ans) << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":5992,"score_of_the_acc":-0.0279,"final_rank":4},{"submission_id":"aoj_2425_9373230","code_snippet":"#include <bits/stdc++.h>\n\nint dx[6]{ 0, 1, 1, 0, -1, -1 };\nint dy1[6]{ 1, 0, -1, -1, -1, 0 };\nint dy2[6]{ 1, 1, 0, -1, 0, 1 };\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int sx, sy, gx, gy;\n std::cin >> sx >> sy >> gx >> gy;\n int N;\n std::cin >> N;\n std::set<std::pair<int, int>> set;\n for (int i{} ; i < N ; i++) {\n int x, y;\n std::cin >> x >> y;\n set.emplace(x, y);\n }\n int lx, ly;\n std::cin >> lx >> ly;\n int width{2 * lx + 1}, height{2 * ly + 1};\n auto f{[&](int time, int x, int y) -> int {\n x += lx;\n y += ly;\n assert(0 <= time and time < 6);\n assert(0 <= x and x < width);\n assert(0 <= y and y < height);\n return time * width * height + x * height + y;\n }};\n auto in{[&](int x, int y) -> int {\n return -lx <= x and x <= lx and \n -ly <= y and y <= ly and \n set.find(std::pair{ x, y }) == set.end();\n }};\n auto command{[&](int time, int x, int y) -> int {\n return std::abs(time * x * y) % 6;\n }};\n std::vector<std::vector<std::pair<int, int>>> g(6 * width * height);\n for (int x{-lx} ; x <= lx ; x++) {\n for (int y{-ly} ; y <= ly ; y++) {\n if (!in(x, y)) continue;\n for (int t{} ; t < 6 ; t++) {\n // 留まる\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, x, y), 1);\n int com{command(t, x, y)};\n for (int d{} ; d < 6 ; d++) {\n int nx{x + dx[d]}, ny{y + (x % 2 ? dy2[d] : dy1[d])}; \n if (!in(nx, ny)) continue;\n int cost{com == d ? 0 : 1};\n //if (t == 2 and x == 1 and y == 1) {\n // std::cout << d << ' ' << nx << ' ' << ny << ' ' << cost << std::endl;\n //}\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, nx, ny), cost);\n }\n }\n }\n }\n const int INF{(int)1e9};\n std::vector<int> dist(6 * width * height, INF);\n dist[f(0, sx, sy)] = 0;\n std::deque<int> deq;\n deq.emplace_back(f(0, sx, sy));\n while (deq.size()) {\n auto v{deq.front()};\n deq.pop_front();\n for (auto [x, w] : g[v]) {\n if (dist[x] > dist[v] + w) {\n dist[x] = dist[v] + w;\n if (w == 1) deq.emplace_back(x);\n else if (w == 0) deq.emplace_front(x);\n else assert(false);\n }\n }\n }\n int ans{INF};\n for (int t{} ; t < 6 ; t++) {\n ans = std::min(ans, dist[f(t, gx, gy)]);\n }\n if (ans == INF) {\n std::cout << -1 << '\\n';\n }\n else {\n std::cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":40,"memory_kb":28184,"score_of_the_acc":-0.2566,"final_rank":7},{"submission_id":"aoj_2425_9373220","code_snippet":"#include <bits/stdc++.h>\n\nint dx[6]{ 0, 1, 1, 0, -1, -1 };\nint dy1[6]{ 1, 0, -1, -1, -1, 0 };\nint dy2[6]{ 1, 1, 0, -1, 0, 1 };\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int sx, sy, gx, gy;\n std::cin >> sx >> sy >> gx >> gy;\n int N;\n std::cin >> N;\n std::set<std::pair<int, int>> set;\n for (int i{} ; i < N ; i++) {\n int x, y;\n std::cin >> x >> y;\n set.emplace(x, y);\n }\n int lx, ly;\n std::cin >> lx >> ly;\n int width{2 * lx + 1}, height{2 * ly + 1};\n auto f{[&](int time, int x, int y) -> int {\n x += lx;\n y += ly;\n assert(0 <= time and time < 6);\n assert(0 <= x and x < width);\n assert(0 <= y and y < height);\n return time * width * height + x * height + y;\n }};\n auto in{[&](int x, int y) -> int {\n return -lx <= x and x <= lx and \n -ly <= y and y <= ly and \n set.find(std::pair{ x, y }) == set.end();\n }};\n auto command{[&](int time, int x, int y) -> int {\n return std::abs(time * x * y) % 6;\n }};\n std::vector<std::vector<std::pair<int, int>>> g(6 * width * height);\n for (int x{-lx} ; x <= lx ; x++) {\n for (int y{-ly} ; y <= ly ; y++) {\n if (!in(x, y)) continue;\n for (int t{} ; t < 6 ; t++) {\n // 留まる\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, x, y), 1);\n int com{command(t, x, y)};\n for (int d{} ; d < 6 ; d++) {\n int nx{x + dx[d]}, ny{y + (y % 2 ? dy2[d] : dy1[d])}; \n if (!in(nx, ny)) continue;\n int cost{com == d ? 0 : 1};\n //if (t == 2 and x == 1 and y == 1) {\n // std::cout << d << ' ' << nx << ' ' << ny << ' ' << cost << std::endl;\n //}\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, nx, ny), cost);\n }\n }\n }\n }\n const int INF{(int)1e9};\n std::vector<int> dist(6 * width * height, INF);\n dist[f(0, sx, sy)] = 0;\n std::deque<int> deq;\n deq.emplace_back(f(0, sx, sy));\n while (deq.size()) {\n auto v{deq.front()};\n deq.pop_front();\n for (auto [x, w] : g[v]) {\n if (dist[x] > dist[v] + w) {\n dist[x] = dist[v] + w;\n if (w == 1) deq.emplace_back(x);\n else if (w == 0) deq.emplace_front(x);\n else assert(false);\n }\n }\n }\n int ans{INF};\n for (int t{} ; t < 6 ; t++) {\n ans = std::min(ans, dist[f(t, gx, gy)]);\n }\n if (ans == INF) {\n std::cout << -1 << '\\n';\n }\n else {\n std::cout << ans << '\\n';\n }\n}","accuracy":0.25,"time_ms":40,"memory_kb":28152,"score_of_the_acc":-0.2562,"final_rank":13},{"submission_id":"aoj_2425_9152619","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 400;\nbool already[205][205][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n short x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, short>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n if (k < 0) {\n return ((6 - (((k % 6) + 6) % 6)) * p) % 6;\n }\n return (k * p) % 6;\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((i - offset_i) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":1,"time_ms":2680,"memory_kb":102520,"score_of_the_acc":-1.9987,"final_rank":11},{"submission_id":"aoj_2425_9152569","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 400;\nbool already[205][205][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n short x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, short>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n if (k < 0) {\n return ((5 - (((k % 6) + 6) % 6)) * p) % 6;\n }\n return (k * p) % 6;\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((i - offset_i) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.25,"time_ms":2480,"memory_kb":102648,"score_of_the_acc":-1.9251,"final_rank":17},{"submission_id":"aoj_2425_9152543","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 500;\nbool already[205][205][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n short x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, short>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n if (k < 0) {\n return ((5 - (((k % 6) + 6) % 6)) * p) % 6;\n }\n return (k * p) % 6;\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.17857142857142858,"time_ms":40,"memory_kb":13892,"score_of_the_acc":-0.1117,"final_rank":18},{"submission_id":"aoj_2425_9152442","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 210;\nbool already[MAX][MAX][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n short x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, short>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n return std::abs((k * p) % 6);\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.25,"time_ms":700,"memory_kb":55056,"score_of_the_acc":-0.7761,"final_rank":15},{"submission_id":"aoj_2425_9152434","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 210;\nbool already[MAX][MAX][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n int x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, short>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n return std::abs((k * p) % 6);\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.25,"time_ms":710,"memory_kb":54976,"score_of_the_acc":-0.779,"final_rank":16},{"submission_id":"aoj_2425_9152432","code_snippet":"#include <bits/stdc++.h>\n\nconst int P = 6;\nconst int MAX = 205;\nbool already[MAX][MAX][MAX][P];\n\nint main() {\n short si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<short, short>> obs;\n for (int i = 0; i < n; i++) {\n int x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n short offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n already[si][sj][0][0] = true;\n using Index = std::tuple<short, short, short, char>;\n std::queue<Index> que;\n que.push({si, sj, 0, 0});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n return std::abs((k * p) % 6);\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n short ni = i + (flag ? DI1[d] : DI2[d]);\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n short nc = c + (sister != d);\n short np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.25,"time_ms":610,"memory_kb":49028,"score_of_the_acc":-0.6813,"final_rank":14},{"submission_id":"aoj_2425_9152362","code_snippet":"#include <bits/stdc++.h>\n\nint main() {\n int si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<int, int>> obs;\n for (int i = 0; i < n; i++) {\n int x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n int offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n const int P = 6;\n const int MAX = 500;\n std::vector already(h, std::vector(w, std::vector(MAX, std::vector<bool>(P))));\n already[si][sj][0][1] = true;\n using Index = std::array<int, 4>;\n std::queue<Index> que;\n que.push({si, sj, 0, 1});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const int DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const int DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const int DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const int DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n return std::abs((k * p) % 6);\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n int ni = i + (flag ? DI1[d] : DI2[d]);\n int nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n int nc = c + (sister != d);\n int np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":9376,"score_of_the_acc":-0.0585,"final_rank":20},{"submission_id":"aoj_2425_9152341","code_snippet":"#include <bits/stdc++.h>\n\nint main() {\n int si, sj, gi, gj;\n std::cin >> si >> sj >> gi >> gj;\n int n;\n std::cin >> n;\n std::vector<std::pair<int, int>> obs;\n for (int i = 0; i < n; i++) {\n int x, y;\n std::cin >> x >> y;\n obs.emplace_back(x, y);\n }\n int offset_i, offset_j;\n std::cin >> offset_i >> offset_j;\n si += offset_i;\n sj += offset_j;\n gi += offset_i;\n gj += offset_j;\n int h = offset_i * 2 + 1;\n int w = offset_j * 2 + 1;\n std::vector ng(h, std::vector<bool>(w));\n for (auto [i, j]: obs) {\n ng[i + offset_i][j + offset_j] = true;\n }\n const int P = 6;\n const int MAX = 205;\n std::vector already(h, std::vector(w, std::vector(MAX, std::vector<bool>(P))));\n already[si][sj][0][1] = true;\n using Index = std::array<int, 4>;\n std::queue<Index> que;\n que.push({si, sj, 0, 1});\n\n // 0\n // 5 1\n // 6\n // 4 2\n // 3\n // (i, j)\n const int DI1[] = {0, 1, 1, 0, -1, -1, 0};\n const int DJ1[] = {1, 0, -1, -1, -1, 0, 0};\n const int DI2[] = {0, 1, 1, 0, -1, -1, 0};\n const int DJ2[] = {1, 1, 0, -1, 0, 1, 0};\n\n auto valid = [&](int i, int j) {\n return 0 <= i && i < h && 0 <= j && j < w;\n };\n\n auto sug = [&](int i, int j, int p) {\n int k = (i - offset_i) * (j - offset_j);\n return std::abs((k * p) % 6);\n };\n\n while (!que.empty()) {\n auto [i, j, c, p] = que.front();\n que.pop();\n // if (c > 1) continue;\n // std::cerr << i << ' ' << j << ' ' << c << ' ' << p << std::endl;\n assert(already[i][j][c][p]);\n assert(!ng[i][j]);\n if (c + 1 == MAX) continue;\n const int sister = sug(i, j, p);\n bool flag = ((j - offset_j) % 2 == 0);\n for (int d = 0; d < 7; d++) {\n int ni = i + (flag ? DI1[d] : DI2[d]);\n int nj = j + (flag ? DJ1[d] : DJ2[d]);\n if (!valid(ni, nj)) continue;\n if (ng[ni][nj]) continue;\n int nc = c + (sister != d);\n int np = (p + 1) % P;\n if (!already[ni][nj][nc][np]) {\n already[ni][nj][nc][np] = true;\n que.push({ni, nj, nc, np});\n }\n }\n }\n for (int i = 0; i < MAX; i++) {\n for (int j = 0; j < 6; j++) {\n if (already[gi][gj][i][j]) {\n std::cout << i << '\\n';\n return 0;\n }\n }\n }\n std::cout << -1 << '\\n';\n}","accuracy":0.14285714285714285,"time_ms":10,"memory_kb":5508,"score_of_the_acc":-0.0155,"final_rank":19},{"submission_id":"aoj_2425_8994730","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\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int sx = in(), sy = in(), gx = in(), gy = in();\n set<pair<int,int>> ng;\n int n = in();\n for(int i : rep(n)) {\n int x = in(), y = in();\n ng.insert({x, y});\n }\n int lx = in(), ly = in();\n\n map<tuple<int,int,int>, int> dist;\n deque<tuple<int,int,int>> dq;\n dist[{sx, sy, 0}] = 0;\n dq.push_back({sx, sy, 0});\n\n vector<int> dx = {0, +1, +1, 0, -1, -1};\n vector<vector<int>> dy = {\n {+1, 0, -1, -1, -1, 0},\n {+1, +1, 0, -1, 0, +1}\n };\n \n while(not dq.empty()) {\n auto u = dq.front(); dq.pop_front();\n auto [x, y, t] = u;\n for(int d : rep(6)) {\n int nx = x + dx[d], ny = y + dy[abs(x) % 2][d];\n if(abs(nx) <= lx and abs(ny) <= ly and !ng.count({nx, ny})) {\n int cost = abs(x * y * t) % 6 != d;\n auto v = make_tuple(nx, ny, (t + 1) % 6);\n if(!dist.count(v) or dist[v] > dist[u] + cost) {\n dist[v] = dist[u] + cost;\n if(cost == 0) {\n dq.push_front(v);\n } else {\n dq.push_back(v);\n }\n }\n }\n }\n\n int cost = 1;\n auto v = make_tuple(x, y, (t + 1) % 6);\n if(!dist.count(v) or dist[v] > dist[u] + cost) {\n dist[v] = dist[u] + cost;\n dq.push_back(v);\n }\n }\n\n int ans = 1e9;\n for(int t : rep(6)) if(dist.count({gx, gy, t})) chmin(ans, dist[{gx, gy, t}]);\n print(ans < 1e9 ? ans : -1);\n}","accuracy":1,"time_ms":330,"memory_kb":18196,"score_of_the_acc":-0.264,"final_rank":8},{"submission_id":"aoj_2425_8009704","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst int inf=1<<30;\nconst vector<int> dx[]={{0,1,1,0,-1,-1},{0,1,1,0,-1,-1}};\nconst vector<int> dy[]={{1,0,-1,-1,-1,0},{1,1,0,-1,0,1}};\n\nbool solve(){\n int sx,sy,gx,gy;\n cin>>sx>>sy>>gx>>gy;\n int N;\n cin>>N;\n vector<pair<int,int>>vp;\n for(int i=0;i<N;i++){\n int x,y;\n cin>>x>>y;\n vp.push_back(make_pair(x,y));\n }\n int lx,ly;\n cin>>lx>>ly;\n sx+=lx;\n sy+=ly;\n gx+=lx;\n gy+=ly;\n vector block(2*lx+1,vector<bool>(2*ly+1));\n for(auto[x,y]:vp){\n x+=lx;\n y+=ly;\n block[x][y]=true;\n }\n vector D(2*lx+1,vector(2*ly+1,vector<int>(6,inf)));\n deque<tuple<int,int,int,int>>dq;\n D[sx][sy][0]=0;\n dq.push_back(make_tuple(0,sx,sy,0));\n while(dq.size()){\n auto[c,x,y,t]=dq.front();\n dq.pop_front();\n if(D[x][y][t]<c)continue;\n for(int i=0;i<6;i++){\n int ex=x+dx[(x-lx)%2!=0][i],ey=y+dy[(x-lx)%2!=0][i];\n if(0<=ex&&ex<=2*lx&&0<=ey&&ey<=2*ly&&!block[ex][ey]){\n if(D[ex][ey][(t+1)%6]>c&&i==abs((x-lx)*(y-ly)*t)%6){\n D[ex][ey][(t+1)%6]=c;\n dq.push_front(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\n }\n if(D[ex][ey][(t+1)%6]>c+1&&i!=abs((x-lx)*(y-ly)*t)%6){\n D[ex][ey][(t+1)%6]=c+1;\n dq.push_back(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\n }\n }\n }\n if(D[x][y][(t+1)%6]>c+1){\n D[x][y][(t+1)%6]=c+1;\n dq.push_back(make_tuple(D[x][y][(t+1)%6],x,y,(t+1)%6));\n }\n }\n int ans=inf;\n for(int i=0;i<6;i++){\n ans=min(ans,D[gx][gy][i]);\n }\n if(ans==inf)cout<<-1<<\"\\n\";\n else cout<<ans<<\"\\n\";\n return true;\n}\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(nullptr);\nint Q=1;\n while(Q--){\n if(!solve()){\n return 0;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5512,"score_of_the_acc":-0.0156,"final_rank":3},{"submission_id":"aoj_2425_8009587","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nconst int inf=1<<30;\nconst vector<int> dx[]={{0,1,1,0,-1,-1},{0,1,1,0,-1,-1}};\nconst vector<int> dy[]={{1,0,-1,-1,-1,0},{1,1,0,-1,0,1}};\n\nbool solve(){\n int sx,sy,gx,gy;\n cin>>sx>>sy>>gx>>gy;\n int N;\n cin>>N;\n vector<pair<int,int>>vp;\n for(int i=0;i<N;i++){\n int x,y;\n cin>>x>>y;\n vp.push_back(make_pair(x,y));\n }\n int lx,ly;\n cin>>lx>>ly;\n sx+=lx;\n sy+=ly;\n gx+=lx;\n gy+=ly;\n vector block(2*lx+1,vector<bool>(2*ly+1));\n for(auto[x,y]:vp){\n x+=lx;\n y+=ly;\n block[x][y]=true;\n }\n vector D(2*lx+1,vector(2*ly+1,vector<int>(6,inf)));\n deque<tuple<int,int,int,int>>dq;\n D[sx][sy][0]=0;\n dq.push_back(make_tuple(0,sx,sy,0));\n while(dq.size()){\n auto[c,x,y,t]=dq.front();\n dq.pop_front();\n if(D[x][y][t]<c)continue;\n for(int i=0;i<6;i++){\n int ex=x+dx[x%2!=0][i],ey=y+dy[x%2!=0][i];\n if(0<=ex&&ex<=2*lx&&0<=ey&&ey<=2*ly&&!block[ex][ey]){\n if(D[ex][ey][(t+1)%6]>c&&i==abs((x-lx)*(y-ly)*t)%6){\n D[ex][ey][(t+1)%6]=c;\n dq.push_front(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\n }\n if(D[ex][ey][(t+1)%6]>c+1&&i!=abs((x-lx)*(y-ly)*t)%6){\n D[ex][ey][(t+1)%6]=c+1;\n dq.push_back(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\n }\n }\n }\n if(D[x][y][(t+1)%6]>c+1){\n D[x][y][(t+1)%6]=c+1;\n dq.push_back(make_tuple(D[x][y][(t+1)%6],x,y,(t+1)%6));\n }\n }\n int ans=inf;\n for(int i=0;i<6;i++){\n ans=min(ans,D[gx][gy][i]);\n }\n if(ans==inf)cout<<-1<<\"\\n\";\n else cout<<ans<<\"\\n\";\n return true;\n}\n\nint main(){\nios::sync_with_stdio(false);\ncin.tie(nullptr);\nint Q=1;\n while(Q--){\n if(!solve()){\n return 0;\n }\n }\n}","accuracy":0.4642857142857143,"time_ms":10,"memory_kb":5828,"score_of_the_acc":-0.0188,"final_rank":12},{"submission_id":"aoj_2425_7928020","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef __int128_t lll;\ntypedef long double ld;\ntypedef pair<ll, ll> pl;\ntypedef tuple<ll, ll, ll> tt;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<vvl> vvvl;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<vvd> vvvd;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<vvc> vvvc;\ntypedef vector<pl> vp;\ntypedef vector<tt> vt;\ntypedef vector<string> vs;\n\nconst ll INF = 1000000010;\nconst ll INFL = INF * INF;\nconst double MYPI = acos(-1);\nconst ld epsilon = 1e-10;\n\n#define ovl(a, b, c, d, e, ...) e\n#define pb push_back\n#define eb emplace_back\n#define MP make_pair\n#define DEBUG(...) DEBUG_(#__VA_ARGS__, __VA_ARGS__)\n#define REP1(i, n) for (int i = 0; i < (n); i++)\n#define REP2(i, l, r) for (int i = (l); i < (r); i++)\n#define REP3(i, l, r, d) for (int i = (l); i < (r); i += (d))\n#define REP(...) ovl(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)\n#define RREP1(i, n) for (int i = (n)-1; i >= 0; i--)\n#define RREP2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define RREP3(i, l, r, d) for (int i = (r)-1; i >= (l); i -= (d))\n#define RREP(...) ovl(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define EACH1(e, a) for (auto &e : 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(...) ovl(__VA_ARGS__, EACH3, EACH2, EACH1)(__VA_ARGS__)\n#define ALL(x) begin(x), end(x)\n#define RALL(x) (x).rbegin(), (x).rend()\n#define sz(x) (ll) x.size()\n#define LB(a, x) (lower_bound(ALL(a), x) - a.begin())\n#define UB(a, x) (upper_bound(ALL(a), x) - a.begin())\n#define FLG(x, i) (((x) >> (i)) & 1)\n#define CNTBIT(x) __builtin_popcountll(x)\n#define TOPBIT(t) (t == 0 ? -1 : 63 - __builtin_clzll(t))\n#define IN(x, a, b) ((a) <= (x) && (x) < (b))\n\ntemplate <typename T, typename... Ts>\nvoid OUT(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << \" \", b));\n cout << endl;\n}\n\ntemplate <typename T>\nvoid DEBUG_(string_view name, const T &a) {\n cout << name << \": \" << a << endl;\n}\n\ntemplate <typename T>\nvoid DEBUG_(string_view name, const vector<T> &a) {\n cout << name << \": \";\n REP(i, sz(a)) cout << a[i] << \" \";\n cout << endl;\n}\n\ntemplate <typename T1, typename T2>\nbool chmax(T1 &x, const T2 &y) {\n return x < y ? x = y, 1 : 0;\n}\ntemplate <typename T1, typename T2>\nbool chmin(T1 &x, const T2 &y) {\n return x > y ? x = y, 1 : 0;\n}\n\nll N, lx, ly;\n\nint toIdx(int t, int x, int y) {\n assert(0 <= t && t < 6);\n assert(0 <= x && x < lx);\n assert(0 <= y && y < ly);\n return t * lx * ly + y * lx + x;\n}\n\nint DX[6] = {0, 1, 1, 0, -1, -1};\nint DY(int d, int x) {\n int DY1[6] = {1, 0, -1, -1, -1, 0};\n int DY2[6] = {1, 1, 0, -1, 0, 1};\n if ((x - lx / 2) % 2 == 0) {\n return DY1[d];\n } else {\n return DY2[d];\n }\n}\n\n// Ο((E+V)logV) cannot reach: INFll\nvector<long long> dijkstra(const vector<vector<pair<int, long long>>> &adj, int s) {\n vector<long long> dist(int(adj.size()), INFL);\n priority_queue<pair<long long, int>, vector<pair<long long, int>>,\n greater<pair<long long, int>>>\n que;\n dist[s] = 0;\n que.emplace(dist[s], s);\n while (!que.empty()) {\n pair<long long, int> p = que.top();\n que.pop();\n if (dist[p.second] < p.first) continue;\n for (pair<int, long long> nv : adj[p.second]) {\n if (dist[nv.first] > dist[p.second] + nv.second) {\n dist[nv.first] = dist[p.second] + nv.second;\n que.emplace(dist[nv.first], nv.first);\n }\n }\n }\n return dist;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n ll sx, sy, gx, gy;\n cin >> sx >> sy >> gx >> gy;\n\n cin >> N;\n\n vp _XYs(N);\n REP(i, N) {\n ll x, y;\n cin >> x >> y;\n _XYs[i] = {x, y};\n }\n\n cin >> lx >> ly;\n\n sx += lx;\n sy += ly;\n gx += lx;\n gy += ly;\n REP(i, N) { _XYs[i] = {_XYs[i].first + lx, _XYs[i].second + ly}; }\n set<pl> XYs(ALL(_XYs));\n\n lx *= 2;\n ly *= 2;\n lx += 1;\n ly += 1;\n\n vector<vector<pair<int, long long>>> adj(6 * lx * ly + 2);\n\n REP(t, 6) {\n REP(x, lx) {\n REP(y, ly) {\n if (XYs.find({x, y}) != XYs.end()) continue;\n int v = toIdx(t, x, y);\n REP(d, 6) {\n int nt = (t + 1) % 6;\n int nx = x + DX[d];\n int ny = y + DY(d, x);\n if (!IN(nx, 0, lx) || !IN(ny, 0, ly)) continue;\n if (XYs.find({nx, ny}) != XYs.end()) continue;\n int nv = toIdx(nt, nx, ny);\n if (abs(t * (x - lx / 2) * (y - ly / 2)) % 6 == d)\n adj[v].emplace_back(nv, 0);\n else\n adj[v].emplace_back(nv, 1);\n }\n int nv_same_place = toIdx((t + 1) % 6, x, y);\n adj[v].emplace_back(nv_same_place, 1);\n }\n }\n }\n\n adj[6 * lx * ly].emplace_back(toIdx(0, sx, sy), 0);\n REP(t, 6) { adj[toIdx(t, gx, gy)].emplace_back(6 * lx * ly + 1, 0); }\n\n auto dists = dijkstra(adj, 6 * lx * ly);\n OUT(dists[6 * lx * ly + 1] == INFL ? -1 : dists[6 * lx * ly + 1]);\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":44056,"score_of_the_acc":-0.4324,"final_rank":10},{"submission_id":"aoj_2425_7123660","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#include <unordered_set>\n#include <random>\n//#define int long long\n#define REP(i,m,n) for(int i=(m);i<(n);i++)\n#define rep(i,n) REP(i,0,n)\n#define pb push_back\n#define all(a) a.begin(),a.end()\n#define rall(c) (c).rbegin(),(c).rend()\n#define mp make_pair\n#define endl '\\n'\n//#define vec vector<ll>\n//#define mat vector<vector<ll> >\n#define fi first\n#define se second\n#define double long double\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll,ll> pll;\n//typedef long double ld;\ntypedef complex<double> Complex;\nconst ll INF=1e9+7;\nconst ll MOD=INF;\nconst ll inf=INF*INF;\nconst ll mod=MOD;\nconst ll inv2=499122177;\nconst ll MAX=10000010;\nconst double PI=acos(-1.0);\ntypedef vector<vector<ll> > mat;\ntypedef vector<ll> vec;\n\n//ll dx[]={0,1,0,-1,-1,-1,1,1};\n//ll dy[]={1,0,-1,0,-1,1,-1,1};\n\nint Dx[]={0,1,1,0,-1,-1};\nint Dy[]={1,0,-1,-1,-1,0};\n\n\n\nvoid solve(){\n int sx,sy,gx,gy;\n cin >> sx >> sy >> gx >> gy;\n vector<vector<int> >dx(2,vector<int>(6)),dy(2,vector<int>(6));\n rep(i,6)dx[0][i]=Dx[i],dy[0][i]=Dy[i];\n dx[1]=dx[0],dy[1]=dy[0];\n dy[1][1]++,dy[1][2]++;\n dy[1][4]++,dy[1][5]++;\n //01-BFS で解く\n int n;\n cin >> n;\n set<pair<int,int> >st;\n rep(i,n){\n int x,y;cin>>x>>y;\n st.insert(mp(x,y));\n }\n int lx,ly;\n cin >> lx >> ly;\n map<pair<pair<int,int>,int>, int>idx;\n\n int now = 0;\n vector<int>x(0),y(0),t(0);\n REP(i,-lx,lx+1){\n REP(j,-ly,ly+1){\n rep(k,6){\n idx[mp(mp(i,j),k)]=now;\n x.pb(i);\n y.pb(j);\n t.pb(k);\n now++;\n }\n }\n }\n\n\n vector<int>d(now,INF);\n deque<pair<int,int> > dq;\n int s=idx[mp(mp(sx,sy),0)];\n d[s]=0;\n dq.push_front(mp(s,0));\n while(!dq.empty()){\n pair<int,int> k = dq.front();\n dq.pop_front();\n if(d[k.fi]<k.se)continue;\n int X=x[k.fi],Y=y[k.fi],T=t[k.fi];\n int dir=abs(X*Y*T)%6;\n int nt=(T+1)%6;\n //cout<<X<<' '<<Y<<' '<<T<<' '<<d[k.fi]<<endl;\n rep(l,6){\n if(l==dir)continue;\n int nx=X+dx[abs(X)%2][l],ny=Y+dy[abs(X)%2][l];\n if(abs(nx)>lx||abs(ny)>ly||st.find(mp(nx,ny))!=st.end())continue;\n int nid=idx[mp(mp(nx,ny),nt)];\n if(d[nid]>d[k.fi]+1){\n d[nid]=d[k.fi]+1;\n dq.push_back(mp(nid,d[nid]));\n }\n }\n int nid=idx[mp(mp(X,Y),nt)];\n if(d[nid]>d[k.fi]+1){\n d[nid]=d[k.fi]+1;\n dq.push_back(mp(nid,d[nid]));\n }\n int nx=X+dx[abs(X)%2][dir],ny=Y+dy[abs(X)%2][dir];\n if(abs(nx)>lx||abs(ny)>ly||st.find(mp(nx,ny))!=st.end())continue;\n nid=idx[mp(mp(nx,ny),nt)];\n if(d[nid]>d[k.fi]){\n d[nid]=d[k.fi];\n dq.push_front(mp(nid,d[nid]));\n }\n }\n int ans=INF;\n rep(i,6){\n int gid=idx[mp(mp(gx,gy),i)];\n ans=min(ans,d[gid]);\n }\n if(ans==INF)ans=-1;\n cout<<ans<<endl;\n}\n\nsigned main(){\n //cin.tie(0);\n //ios::sync_with_stdio(false);\n solve();\n}","accuracy":1,"time_ms":240,"memory_kb":22220,"score_of_the_acc":-0.271,"final_rank":9},{"submission_id":"aoj_2425_7002960","code_snippet":"#include <stdio.h>\n#include <stdlib.h>\n#include <deque>\n#include <tuple>\n#define Z 128\n#define INF 1012345678\nusing namespace std;\n\nint block[256][256], dist[256][256][6];\ndeque<tuple<int, int, int>> dq;\nconst int dxy[7][2] = { {0, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {0, 0} };\nint lx, ly;\n\nint isvalid(int x, int y, int t) {\n if (x < -lx || y < -ly || x > lx || y > ly) return 0;\n if (block[x + Z][y + Z]) return 0;\n return 1;\n}\n\nint main(void) {\n int sx, sy, gx, gy, n, x, y, t, nx, ny, nt, nd, md, res = INF;\n scanf(\"%d %d %d %d\", &sx, &sy, &gx, &gy);\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &x, &y);\n block[x + Z][y + Z] = 1;\n }\n scanf(\"%d %d\", &lx, &ly);\n for (int i = 0; i < 256; i++) {\n for (int j = 0; j < 256; j++) {\n for (int k = 0; k < 6; k++) dist[i][j][k] = INF;\n }\n }\n dq.push_back({ sx, sy, 0 });\n dist[sx + Z][sy + Z][0] = 0;\n\n while (dq.size()) {\n x = get<0>(dq.front());\n y = get<1>(dq.front());\n t = get<2>(dq.front());\n dq.pop_front();\n nt = t + 1;\n if (nt == 6) nt = 0;\n md = abs(x * y * t) % 6;\n\n for (int i = 0; i < 7; i++) {\n nx = x + dxy[i][0];\n ny = y + dxy[i][1];\n if (i != 0 && i != 3 && i != 6 && (x & 1)) ny++;\n if (!isvalid(nx, ny, nt)) continue;\n nd = dist[x + Z][y + Z][t];\n if (md != i) nd++;\n if (nd >= dist[nx + Z][ny + Z][nt]) continue;\n\n if (md == i) dq.push_front({ nx, ny, nt });\n else dq.push_back({ nx, ny, nt });\n dist[nx + Z][ny + Z][nt] = nd;\n }\n }\n for (int i = 0; i < 6; i++) {\n if (dist[gx + Z][gy + Z][i] < res) res = dist[gx + Z][gy + Z][i];\n }\n printf(\"%d\\n\", res == INF ? -1 : res);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4660,"score_of_the_acc":-0.0069,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2425_10914251\",\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 pii = pair<int,int>;\\nusing pll = 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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = (r)-1;i >= l;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\\nint dx[] = {0,1,1,0,-1,-1,0};\\nint dy1[] = {1,0,-1,-1,-1,0,0};\\nint dy2[] = {1,1,0,-1,0,1,0};\\n\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n pii S,T;cin >> S >> T;\\n int n;cin >> n;\\n vvb blk(300,vb(300));\\n const int MD = 150;\\n rep(i,0,n){\\n int x,y;cin >> x >> y;\\n blk[MD+x][MD+y] = 1;\\n }\\n pii L;cin >> L;\\n deque<tuple<int,int,int>> dq;\\n vvvi d(300,vvi(300,vi(6,MOD)));\\n d[MD+S.first][MD+S.second][0] = 0;\\n dq.push_back({S.first,S.second,0});\\n while(sz(dq)){\\n auto [ox,oy,ot] = dq.front();dq.pop_front();\\n int k = abs(ox*oy)*ot%6;\\n rep(dir,0,7){\\n int nx = ox + dx[dir],ny = oy + dy1[dir],nt = (ot+1)%6;\\n if(ox & 1)ny = oy + dy2[dir];\\n if(blk[MD+nx][MD+ny])continue;\\n if(abs(nx) > L.first || abs(ny) > L.second)continue;\\n if(dir == k){\\n if(d[MD+ox][MD+oy][ot] < d[MD+nx][MD+ny][nt]){\\n d[MD+nx][MD+ny][nt] = d[MD+ox][MD+oy][ot];\\n dq.push_front({nx,ny,nt});\\n }\\n }else{\\n if(d[MD+ox][MD+oy][ot]+1 < d[MD+nx][MD+ny][nt]){\\n d[MD+nx][MD+ny][nt] = d[MD+ox][MD+oy][ot]+1;\\n dq.push_back({nx,ny,nt});\\n }\\n }\\n }\\n }\\n ll res = MOD;\\n rep(i,0,6)chmin(res,d[MD+T.first][MD+T.second][i]);\\n if(res == MOD)res = -1;\\n cout << res << endl;\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11292,\n \"score_of_the_acc\": -0.0741,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2425_10867634\",\n \"code_snippet\": \"#include <queue>\\n#include <vector>\\n#include <iostream>\\nusing namespace std;\\nvector<int> dx = { 0, 1, 1, 0, -1, -1, 0 };\\nvector<vector<int> > dy = {\\n\\t{ 1, 0, -1, -1, -1, 0, 0 },\\n\\t{ 1, 1, 0, -1, 0, 1, 0 }\\n};\\nint sx, sy, gx, gy, lx, ly, n;\\nint main() {\\n\\tcin >> sx >> sy >> gx >> gy >> n;\\n\\tvector<int> ex(n), ey(n);\\n\\tfor (int i = 0; i < n; i++) cin >> ex[i] >> ey[i];\\n\\tcin >> lx >> ly;\\n\\tvector<vector<bool> > ok(ly * 2 + 1, vector<bool>(lx * 2 + 1, true));\\n\\tfor (int i = 0; i < n; i++) ok[ey[i] + ly][ex[i] + lx] = false;\\n\\tvector<vector<vector<int> > > dist(ly * 2 + 1, vector<vector<int> >(lx * 2 + 1, vector<int>(6, 999999999))); dist[sy + ly][sx + lx][0] = 0;\\n\\tpriority_queue<vector<int> > que; que.push({ 0, sx, sy, 0 });\\n\\twhile (!que.empty()) {\\n\\t\\tvector<int> u = que.top(); que.pop();\\n\\t\\tint fx = u[1], fy = u[2], ft = u[3], cur = dist[fy + ly][fx + lx][ft];\\n\\t\\tfor (int i = 0; i < 7; i++) {\\n\\t\\t\\tint tx = fx + dx[i], ty = fy + dy[abs(fx) % 2][i], tt = (ft + 1) % 6;\\n\\t\\t\\tint cost = (abs(fx * fy * ft) % 6 == i ? 0 : 1);\\n\\t\\t\\tif (abs(tx) <= lx && abs(ty) <= ly && ok[ty + ly][tx + lx] && dist[ty + ly][tx + lx][tt] > cur + cost) {\\n\\t\\t\\t\\tdist[ty + ly][tx + lx][tt] = cur + cost;\\n\\t\\t\\t\\tque.push({ -dist[ty + ly][tx + lx][tt], tx, ty, tt });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret = 999999999;\\n\\tfor (int i = 0; i < 6; i++) ret = min(ret, dist[gy + ly][gx + lx][i]);\\n\\tcout << (ret != 999999999 ? ret : -1) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5820,\n \"score_of_the_acc\": -0.0337,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2425_9703246\",\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 LX, LY;\\n\\npair<int,int> Move(int X, int Y, int dir) {\\n if (dir == 6) return {X,Y};\\n if (X %2 == LX % 2) {\\n if (dir == 0) return {X,Y+1};\\n if (dir == 1) return {X+1,Y};\\n if (dir == 2) return {X+1,Y-1};\\n if (dir == 3) return {X,Y-1};\\n if (dir == 4) return {X-1,Y-1};\\n if (dir == 5) return {X-1,Y};\\n }\\n else {\\n if (dir == 0) return {X,Y+1};\\n if (dir == 1) return {X+1,Y+1};\\n if (dir == 2) return {X+1,Y};\\n if (dir == 3) return {X,Y-1};\\n if (dir == 4) return {X-1,Y};\\n if (dir == 5) return {X-1,Y+1};\\n }\\n return {0,0};\\n}\\n\\nint Dir(int X, int Y, int T) {\\n return (abs(X-LX)*abs(Y-LY)*T)%6;\\n}\\n\\nint main() {\\n int SX, SY, GX, GY, N;\\n cin >> SX >> SY >> GX >> GY >> N;\\n vector<int> X(N), Y(N);\\n rep(i,0,N) cin >> X[i] >> Y[i];\\n cin >> LX >> LY;\\n SX += LX, SY += LY, GX += LX, GY += LY;\\n int MX = LX*2+1, MY = LY*2+1;\\n vector<vector<bool>> B(MX,vector<bool>(MY,true));\\n rep(i,0,N) X[i] += LX, Y[i] += LY, B[X[i]][Y[i]] = false;\\n auto in = [&](int i, int j) -> bool {return (0 <= i && i < MX && 0 <= j && j < MY && B[i][j]);};\\n auto encode = [&](int i, int j, int k) -> int {return i*MY*6+j*6+k;};\\n auto decode = [&](int i) -> tuple<int,int,int> {return {i/(MY*6),(i/6)%MY,i%6};};\\n vector<int> Dist(MX*MY*6,inf);\\n Dist[encode(SX,SY,0)] = 0;\\n deque<int> Q;\\n Q.push_back(encode(SX,SY,0));\\n while(!Q.empty()) {\\n int P = Q.front();\\n auto [X,Y,T] = decode(P);\\n Q.pop_front();\\n rep(i,0,7) {\\n auto [NX,NY] = Move(X,Y,i);\\n if (!in(NX,NY)) continue;\\n int ND;\\n if (i == Dir(X,Y,T)) ND = 0;\\n else ND = 1;\\n if (chmin(Dist[encode(NX,NY,(T+1)%6)],Dist[P]+ND)) {\\n if (ND == 0) Q.push_front(encode(NX,NY,(T+1)%6));\\n else Q.push_back(encode(NX,NY,(T+1)%6));\\n }\\n }\\n }\\n int ANS = inf;\\n rep(i,0,6) chmin(ANS,Dist[encode(GX,GY,i)]);\\n cout << (ANS == inf ? -1 : ANS) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3976,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2425_9373303\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\nusing ll = long long;\\n#define all(x) x.begin(), x.end()\\ntemplate <class A, class B>\\ninline bool chmin(A &a, const B &b) {\\n return b < a && (a = b, true);\\n}\\ntemplate <class A, class B>\\ninline bool chmax(A &a, const B &b) {\\n return b > a && (a = b, true);\\n}\\n\\nint main() {\\n const int OFFSET = 105;\\n const int H = 2 * OFFSET;\\n const int W = 2 * OFFSET;\\n int sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n int n;\\n cin >> n;\\n vector ng(H, vector<bool>(W));\\n rep(i, n) {\\n int x, y;\\n cin >> x >> y;\\n ng[x + OFFSET][y + OFFSET] = true;\\n }\\n int lx, ly;\\n cin >> lx >> ly;\\n const int DX[2][7] = {\\n {0, 1, 1, 0, -1, -1, 0}, \\n {0, 1, 1, 0, -1, -1, 0}\\n };\\n const int DY[2][7] = {\\n {1, 0, -1, -1, -1, 0, 0},\\n {1, 1, 0, -1, 0, 1, 0}\\n };\\n // 補正する\\n auto encode = [&](int x, int y) {\\n return pair<int, int>(x + OFFSET, y + OFFSET);\\n };\\n // 補正を消す\\n auto decode = [&](int X, int Y) {\\n return pair<int, int>(X - OFFSET, Y - OFFSET);\\n };\\n // 補正ありで条件を満たしているか判定\\n auto valid = [&](int X, int Y) {\\n auto [x, y] = decode(X, Y);\\n return abs(x) <= lx && abs(y) <= ly;\\n };\\n // 補正ありで障害物があるか判定\\n auto obstacle = [&](int X, int Y) {\\n assert(valid(X, Y));\\n return ng[X][Y];\\n };\\n auto sister = [&](int X, int Y, int t) {\\n auto [x, y] = decode(X, Y);\\n return abs(x * y * t) % 6;\\n };\\n auto parity = [&](int X) {\\n return (X - OFFSET) % 2 != 0;\\n };\\n\\n const int INF = 1e9;\\n // dist[X][Y][t]: (X, Y)にいて、時間を6で割ったあまりが6であるときの最小無視回数\\n vector dist(H, vector(W, vector<int>(6, INF)));\\n // (X, Y, t): 補正ありの座標と時間を6で割ったあまり\\n priority_queue<tuple<int, int, int, int>, vector<tuple<int, int, int, int>>, greater<tuple<int, int, int, int>>> que;\\n auto [sX, sY] = encode(sx, sy);\\n auto [gX, gY] = encode(gx, gy);\\n dist[sX][sY][0] = 0;\\n que.emplace(0, sX, sY, 0);\\n while (!que.empty()) {\\n auto [cd, cX, cY, ct] = que.top();\\n que.pop();\\n if (dist[cX][cY][ct] < cd) continue;\\n assert(dist[cX][cY][ct] != INF);\\n assert(0 <= ct && ct < 6);\\n int sug = sister(cX, cY, ct);\\n for (int d = 0; d < 7; d++) {\\n int nX = cX + DX[parity(cX)][d];\\n int nY = cY + DY[parity(cX)][d];\\n int nt = (ct + 1) % 6;\\n int w = (d != sug);\\n if (valid(nX, nY) && !obstacle(nX, nY) && dist[nX][nY][nt] > dist[cX][cY][ct] + w) {\\n dist[nX][nY][nt] = dist[cX][cY][ct] + w;\\n que.emplace(dist[nX][nY][nt], nX, nY, nt);\\n }\\n }\\n }\\n int ans = INF;\\n rep(i, 6) chmin(ans, dist[gX][gY][i]);\\n cout << (ans == INF ? -1 : ans) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5992,\n \"score_of_the_acc\": -0.0279,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2425_9373230\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint dx[6]{ 0, 1, 1, 0, -1, -1 };\\nint dy1[6]{ 1, 0, -1, -1, -1, 0 };\\nint dy2[6]{ 1, 1, 0, -1, 0, 1 };\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n\\n int sx, sy, gx, gy;\\n std::cin >> sx >> sy >> gx >> gy;\\n int N;\\n std::cin >> N;\\n std::set<std::pair<int, int>> set;\\n for (int i{} ; i < N ; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n set.emplace(x, y);\\n }\\n int lx, ly;\\n std::cin >> lx >> ly;\\n int width{2 * lx + 1}, height{2 * ly + 1};\\n auto f{[&](int time, int x, int y) -> int {\\n x += lx;\\n y += ly;\\n assert(0 <= time and time < 6);\\n assert(0 <= x and x < width);\\n assert(0 <= y and y < height);\\n return time * width * height + x * height + y;\\n }};\\n auto in{[&](int x, int y) -> int {\\n return -lx <= x and x <= lx and \\n -ly <= y and y <= ly and \\n set.find(std::pair{ x, y }) == set.end();\\n }};\\n auto command{[&](int time, int x, int y) -> int {\\n return std::abs(time * x * y) % 6;\\n }};\\n std::vector<std::vector<std::pair<int, int>>> g(6 * width * height);\\n for (int x{-lx} ; x <= lx ; x++) {\\n for (int y{-ly} ; y <= ly ; y++) {\\n if (!in(x, y)) continue;\\n for (int t{} ; t < 6 ; t++) {\\n // 留まる\\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, x, y), 1);\\n int com{command(t, x, y)};\\n for (int d{} ; d < 6 ; d++) {\\n int nx{x + dx[d]}, ny{y + (x % 2 ? dy2[d] : dy1[d])}; \\n if (!in(nx, ny)) continue;\\n int cost{com == d ? 0 : 1};\\n //if (t == 2 and x == 1 and y == 1) {\\n // std::cout << d << ' ' << nx << ' ' << ny << ' ' << cost << std::endl;\\n //}\\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, nx, ny), cost);\\n }\\n }\\n }\\n }\\n const int INF{(int)1e9};\\n std::vector<int> dist(6 * width * height, INF);\\n dist[f(0, sx, sy)] = 0;\\n std::deque<int> deq;\\n deq.emplace_back(f(0, sx, sy));\\n while (deq.size()) {\\n auto v{deq.front()};\\n deq.pop_front();\\n for (auto [x, w] : g[v]) {\\n if (dist[x] > dist[v] + w) {\\n dist[x] = dist[v] + w;\\n if (w == 1) deq.emplace_back(x);\\n else if (w == 0) deq.emplace_front(x);\\n else assert(false);\\n }\\n }\\n }\\n int ans{INF};\\n for (int t{} ; t < 6 ; t++) {\\n ans = std::min(ans, dist[f(t, gx, gy)]);\\n }\\n if (ans == INF) {\\n std::cout << -1 << '\\\\n';\\n }\\n else {\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 28184,\n \"score_of_the_acc\": -0.2566,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2425_9373220\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint dx[6]{ 0, 1, 1, 0, -1, -1 };\\nint dy1[6]{ 1, 0, -1, -1, -1, 0 };\\nint dy2[6]{ 1, 1, 0, -1, 0, 1 };\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n\\n int sx, sy, gx, gy;\\n std::cin >> sx >> sy >> gx >> gy;\\n int N;\\n std::cin >> N;\\n std::set<std::pair<int, int>> set;\\n for (int i{} ; i < N ; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n set.emplace(x, y);\\n }\\n int lx, ly;\\n std::cin >> lx >> ly;\\n int width{2 * lx + 1}, height{2 * ly + 1};\\n auto f{[&](int time, int x, int y) -> int {\\n x += lx;\\n y += ly;\\n assert(0 <= time and time < 6);\\n assert(0 <= x and x < width);\\n assert(0 <= y and y < height);\\n return time * width * height + x * height + y;\\n }};\\n auto in{[&](int x, int y) -> int {\\n return -lx <= x and x <= lx and \\n -ly <= y and y <= ly and \\n set.find(std::pair{ x, y }) == set.end();\\n }};\\n auto command{[&](int time, int x, int y) -> int {\\n return std::abs(time * x * y) % 6;\\n }};\\n std::vector<std::vector<std::pair<int, int>>> g(6 * width * height);\\n for (int x{-lx} ; x <= lx ; x++) {\\n for (int y{-ly} ; y <= ly ; y++) {\\n if (!in(x, y)) continue;\\n for (int t{} ; t < 6 ; t++) {\\n // 留まる\\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, x, y), 1);\\n int com{command(t, x, y)};\\n for (int d{} ; d < 6 ; d++) {\\n int nx{x + dx[d]}, ny{y + (y % 2 ? dy2[d] : dy1[d])}; \\n if (!in(nx, ny)) continue;\\n int cost{com == d ? 0 : 1};\\n //if (t == 2 and x == 1 and y == 1) {\\n // std::cout << d << ' ' << nx << ' ' << ny << ' ' << cost << std::endl;\\n //}\\n g[f(t, x, y)].emplace_back(f((t + 1) % 6, nx, ny), cost);\\n }\\n }\\n }\\n }\\n const int INF{(int)1e9};\\n std::vector<int> dist(6 * width * height, INF);\\n dist[f(0, sx, sy)] = 0;\\n std::deque<int> deq;\\n deq.emplace_back(f(0, sx, sy));\\n while (deq.size()) {\\n auto v{deq.front()};\\n deq.pop_front();\\n for (auto [x, w] : g[v]) {\\n if (dist[x] > dist[v] + w) {\\n dist[x] = dist[v] + w;\\n if (w == 1) deq.emplace_back(x);\\n else if (w == 0) deq.emplace_front(x);\\n else assert(false);\\n }\\n }\\n }\\n int ans{INF};\\n for (int t{} ; t < 6 ; t++) {\\n ans = std::min(ans, dist[f(t, gx, gy)]);\\n }\\n if (ans == INF) {\\n std::cout << -1 << '\\\\n';\\n }\\n else {\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 40,\n \"memory_kb\": 28152,\n \"score_of_the_acc\": -0.2562,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2425_9152619\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 400;\\nbool already[205][205][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n short x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, short>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n if (k < 0) {\\n return ((6 - (((k % 6) + 6) % 6)) * p) % 6;\\n }\\n return (k * p) % 6;\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((i - offset_i) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2680,\n \"memory_kb\": 102520,\n \"score_of_the_acc\": -1.9987,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2425_9152569\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 400;\\nbool already[205][205][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n short x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, short>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n if (k < 0) {\\n return ((5 - (((k % 6) + 6) % 6)) * p) % 6;\\n }\\n return (k * p) % 6;\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((i - offset_i) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 2480,\n \"memory_kb\": 102648,\n \"score_of_the_acc\": -1.9251,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2425_9152543\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 500;\\nbool already[205][205][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n short x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, short>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n if (k < 0) {\\n return ((5 - (((k % 6) + 6) % 6)) * p) % 6;\\n }\\n return (k * p) % 6;\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.17857142857142858,\n \"time_ms\": 40,\n \"memory_kb\": 13892,\n \"score_of_the_acc\": -0.1117,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2425_9152442\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 210;\\nbool already[MAX][MAX][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n short x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, short>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n return std::abs((k * p) % 6);\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 700,\n \"memory_kb\": 55056,\n \"score_of_the_acc\": -0.7761,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2425_9152434\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 210;\\nbool already[MAX][MAX][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, short>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n return std::abs((k * p) % 6);\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 710,\n \"memory_kb\": 54976,\n \"score_of_the_acc\": -0.779,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2425_9152432\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int P = 6;\\nconst int MAX = 205;\\nbool already[MAX][MAX][MAX][P];\\n\\nint main() {\\n short si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<short, short>> obs;\\n for (int i = 0; i < n; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n short offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n already[si][sj][0][0] = true;\\n using Index = std::tuple<short, short, short, char>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 0});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const short DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const short DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const short DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n return std::abs((k * p) % 6);\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n short ni = i + (flag ? DI1[d] : DI2[d]);\\n short nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n short nc = c + (sister != d);\\n short np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 610,\n \"memory_kb\": 49028,\n \"score_of_the_acc\": -0.6813,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2425_9152362\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint main() {\\n int si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<int, int>> obs;\\n for (int i = 0; i < n; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n int offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n const int P = 6;\\n const int MAX = 500;\\n std::vector already(h, std::vector(w, std::vector(MAX, std::vector<bool>(P))));\\n already[si][sj][0][1] = true;\\n using Index = std::array<int, 4>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 1});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const int DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const int DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const int DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const int DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n return std::abs((k * p) % 6);\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n int ni = i + (flag ? DI1[d] : DI2[d]);\\n int nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n int nc = c + (sister != d);\\n int np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 9376,\n \"score_of_the_acc\": -0.0585,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2425_9152341\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint main() {\\n int si, sj, gi, gj;\\n std::cin >> si >> sj >> gi >> gj;\\n int n;\\n std::cin >> n;\\n std::vector<std::pair<int, int>> obs;\\n for (int i = 0; i < n; i++) {\\n int x, y;\\n std::cin >> x >> y;\\n obs.emplace_back(x, y);\\n }\\n int offset_i, offset_j;\\n std::cin >> offset_i >> offset_j;\\n si += offset_i;\\n sj += offset_j;\\n gi += offset_i;\\n gj += offset_j;\\n int h = offset_i * 2 + 1;\\n int w = offset_j * 2 + 1;\\n std::vector ng(h, std::vector<bool>(w));\\n for (auto [i, j]: obs) {\\n ng[i + offset_i][j + offset_j] = true;\\n }\\n const int P = 6;\\n const int MAX = 205;\\n std::vector already(h, std::vector(w, std::vector(MAX, std::vector<bool>(P))));\\n already[si][sj][0][1] = true;\\n using Index = std::array<int, 4>;\\n std::queue<Index> que;\\n que.push({si, sj, 0, 1});\\n\\n // 0\\n // 5 1\\n // 6\\n // 4 2\\n // 3\\n // (i, j)\\n const int DI1[] = {0, 1, 1, 0, -1, -1, 0};\\n const int DJ1[] = {1, 0, -1, -1, -1, 0, 0};\\n const int DI2[] = {0, 1, 1, 0, -1, -1, 0};\\n const int DJ2[] = {1, 1, 0, -1, 0, 1, 0};\\n\\n auto valid = [&](int i, int j) {\\n return 0 <= i && i < h && 0 <= j && j < w;\\n };\\n\\n auto sug = [&](int i, int j, int p) {\\n int k = (i - offset_i) * (j - offset_j);\\n return std::abs((k * p) % 6);\\n };\\n\\n while (!que.empty()) {\\n auto [i, j, c, p] = que.front();\\n que.pop();\\n // if (c > 1) continue;\\n // std::cerr << i << ' ' << j << ' ' << c << ' ' << p << std::endl;\\n assert(already[i][j][c][p]);\\n assert(!ng[i][j]);\\n if (c + 1 == MAX) continue;\\n const int sister = sug(i, j, p);\\n bool flag = ((j - offset_j) % 2 == 0);\\n for (int d = 0; d < 7; d++) {\\n int ni = i + (flag ? DI1[d] : DI2[d]);\\n int nj = j + (flag ? DJ1[d] : DJ2[d]);\\n if (!valid(ni, nj)) continue;\\n if (ng[ni][nj]) continue;\\n int nc = c + (sister != d);\\n int np = (p + 1) % P;\\n if (!already[ni][nj][nc][np]) {\\n already[ni][nj][nc][np] = true;\\n que.push({ni, nj, nc, np});\\n }\\n }\\n }\\n for (int i = 0; i < MAX; i++) {\\n for (int j = 0; j < 6; j++) {\\n if (already[gi][gj][i][j]) {\\n std::cout << i << '\\\\n';\\n return 0;\\n }\\n }\\n }\\n std::cout << -1 << '\\\\n';\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 10,\n \"memory_kb\": 5508,\n \"score_of_the_acc\": -0.0155,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2425_8994730\",\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\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int sx = in(), sy = in(), gx = in(), gy = in();\\n set<pair<int,int>> ng;\\n int n = in();\\n for(int i : rep(n)) {\\n int x = in(), y = in();\\n ng.insert({x, y});\\n }\\n int lx = in(), ly = in();\\n\\n map<tuple<int,int,int>, int> dist;\\n deque<tuple<int,int,int>> dq;\\n dist[{sx, sy, 0}] = 0;\\n dq.push_back({sx, sy, 0});\\n\\n vector<int> dx = {0, +1, +1, 0, -1, -1};\\n vector<vector<int>> dy = {\\n {+1, 0, -1, -1, -1, 0},\\n {+1, +1, 0, -1, 0, +1}\\n };\\n \\n while(not dq.empty()) {\\n auto u = dq.front(); dq.pop_front();\\n auto [x, y, t] = u;\\n for(int d : rep(6)) {\\n int nx = x + dx[d], ny = y + dy[abs(x) % 2][d];\\n if(abs(nx) <= lx and abs(ny) <= ly and !ng.count({nx, ny})) {\\n int cost = abs(x * y * t) % 6 != d;\\n auto v = make_tuple(nx, ny, (t + 1) % 6);\\n if(!dist.count(v) or dist[v] > dist[u] + cost) {\\n dist[v] = dist[u] + cost;\\n if(cost == 0) {\\n dq.push_front(v);\\n } else {\\n dq.push_back(v);\\n }\\n }\\n }\\n }\\n\\n int cost = 1;\\n auto v = make_tuple(x, y, (t + 1) % 6);\\n if(!dist.count(v) or dist[v] > dist[u] + cost) {\\n dist[v] = dist[u] + cost;\\n dq.push_back(v);\\n }\\n }\\n\\n int ans = 1e9;\\n for(int t : rep(6)) if(dist.count({gx, gy, t})) chmin(ans, dist[{gx, gy, t}]);\\n print(ans < 1e9 ? ans : -1);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 18196,\n \"score_of_the_acc\": -0.264,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2425_8009704\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst int inf=1<<30;\\nconst vector<int> dx[]={{0,1,1,0,-1,-1},{0,1,1,0,-1,-1}};\\nconst vector<int> dy[]={{1,0,-1,-1,-1,0},{1,1,0,-1,0,1}};\\n\\nbool solve(){\\n int sx,sy,gx,gy;\\n cin>>sx>>sy>>gx>>gy;\\n int N;\\n cin>>N;\\n vector<pair<int,int>>vp;\\n for(int i=0;i<N;i++){\\n int x,y;\\n cin>>x>>y;\\n vp.push_back(make_pair(x,y));\\n }\\n int lx,ly;\\n cin>>lx>>ly;\\n sx+=lx;\\n sy+=ly;\\n gx+=lx;\\n gy+=ly;\\n vector block(2*lx+1,vector<bool>(2*ly+1));\\n for(auto[x,y]:vp){\\n x+=lx;\\n y+=ly;\\n block[x][y]=true;\\n }\\n vector D(2*lx+1,vector(2*ly+1,vector<int>(6,inf)));\\n deque<tuple<int,int,int,int>>dq;\\n D[sx][sy][0]=0;\\n dq.push_back(make_tuple(0,sx,sy,0));\\n while(dq.size()){\\n auto[c,x,y,t]=dq.front();\\n dq.pop_front();\\n if(D[x][y][t]<c)continue;\\n for(int i=0;i<6;i++){\\n int ex=x+dx[(x-lx)%2!=0][i],ey=y+dy[(x-lx)%2!=0][i];\\n if(0<=ex&&ex<=2*lx&&0<=ey&&ey<=2*ly&&!block[ex][ey]){\\n if(D[ex][ey][(t+1)%6]>c&&i==abs((x-lx)*(y-ly)*t)%6){\\n D[ex][ey][(t+1)%6]=c;\\n dq.push_front(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\\n }\\n if(D[ex][ey][(t+1)%6]>c+1&&i!=abs((x-lx)*(y-ly)*t)%6){\\n D[ex][ey][(t+1)%6]=c+1;\\n dq.push_back(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\\n }\\n }\\n }\\n if(D[x][y][(t+1)%6]>c+1){\\n D[x][y][(t+1)%6]=c+1;\\n dq.push_back(make_tuple(D[x][y][(t+1)%6],x,y,(t+1)%6));\\n }\\n }\\n int ans=inf;\\n for(int i=0;i<6;i++){\\n ans=min(ans,D[gx][gy][i]);\\n }\\n if(ans==inf)cout<<-1<<\\\"\\\\n\\\";\\n else cout<<ans<<\\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main(){\\nios::sync_with_stdio(false);\\ncin.tie(nullptr);\\nint Q=1;\\n while(Q--){\\n if(!solve()){\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5512,\n \"score_of_the_acc\": -0.0156,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2425_8009587\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nconst int inf=1<<30;\\nconst vector<int> dx[]={{0,1,1,0,-1,-1},{0,1,1,0,-1,-1}};\\nconst vector<int> dy[]={{1,0,-1,-1,-1,0},{1,1,0,-1,0,1}};\\n\\nbool solve(){\\n int sx,sy,gx,gy;\\n cin>>sx>>sy>>gx>>gy;\\n int N;\\n cin>>N;\\n vector<pair<int,int>>vp;\\n for(int i=0;i<N;i++){\\n int x,y;\\n cin>>x>>y;\\n vp.push_back(make_pair(x,y));\\n }\\n int lx,ly;\\n cin>>lx>>ly;\\n sx+=lx;\\n sy+=ly;\\n gx+=lx;\\n gy+=ly;\\n vector block(2*lx+1,vector<bool>(2*ly+1));\\n for(auto[x,y]:vp){\\n x+=lx;\\n y+=ly;\\n block[x][y]=true;\\n }\\n vector D(2*lx+1,vector(2*ly+1,vector<int>(6,inf)));\\n deque<tuple<int,int,int,int>>dq;\\n D[sx][sy][0]=0;\\n dq.push_back(make_tuple(0,sx,sy,0));\\n while(dq.size()){\\n auto[c,x,y,t]=dq.front();\\n dq.pop_front();\\n if(D[x][y][t]<c)continue;\\n for(int i=0;i<6;i++){\\n int ex=x+dx[x%2!=0][i],ey=y+dy[x%2!=0][i];\\n if(0<=ex&&ex<=2*lx&&0<=ey&&ey<=2*ly&&!block[ex][ey]){\\n if(D[ex][ey][(t+1)%6]>c&&i==abs((x-lx)*(y-ly)*t)%6){\\n D[ex][ey][(t+1)%6]=c;\\n dq.push_front(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\\n }\\n if(D[ex][ey][(t+1)%6]>c+1&&i!=abs((x-lx)*(y-ly)*t)%6){\\n D[ex][ey][(t+1)%6]=c+1;\\n dq.push_back(make_tuple(D[ex][ey][(t+1)%6],ex,ey,(t+1)%6));\\n }\\n }\\n }\\n if(D[x][y][(t+1)%6]>c+1){\\n D[x][y][(t+1)%6]=c+1;\\n dq.push_back(make_tuple(D[x][y][(t+1)%6],x,y,(t+1)%6));\\n }\\n }\\n int ans=inf;\\n for(int i=0;i<6;i++){\\n ans=min(ans,D[gx][gy][i]);\\n }\\n if(ans==inf)cout<<-1<<\\\"\\\\n\\\";\\n else cout<<ans<<\\\"\\\\n\\\";\\n return true;\\n}\\n\\nint main(){\\nios::sync_with_stdio(false);\\ncin.tie(nullptr);\\nint Q=1;\\n while(Q--){\\n if(!solve()){\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 0.4642857142857143,\n \"time_ms\": 10,\n \"memory_kb\": 5828,\n \"score_of_the_acc\": -0.0188,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2425_7928020\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef __int128_t lll;\\ntypedef long double ld;\\ntypedef pair<ll, ll> pl;\\ntypedef tuple<ll, ll, ll> tt;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<vvl> vvvl;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef vector<vvd> vvvd;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<vvb> vvvb;\\ntypedef vector<char> vc;\\ntypedef vector<vc> vvc;\\ntypedef vector<vvc> vvvc;\\ntypedef vector<pl> vp;\\ntypedef vector<tt> vt;\\ntypedef vector<string> vs;\\n\\nconst ll INF = 1000000010;\\nconst ll INFL = INF * INF;\\nconst double MYPI = acos(-1);\\nconst ld epsilon = 1e-10;\\n\\n#define ovl(a, b, c, d, e, ...) e\\n#define pb push_back\\n#define eb emplace_back\\n#define MP make_pair\\n#define DEBUG(...) DEBUG_(#__VA_ARGS__, __VA_ARGS__)\\n#define REP1(i, n) for (int i = 0; i < (n); i++)\\n#define REP2(i, l, r) for (int i = (l); i < (r); i++)\\n#define REP3(i, l, r, d) for (int i = (l); i < (r); i += (d))\\n#define REP(...) ovl(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)\\n#define RREP1(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define RREP2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define RREP3(i, l, r, d) for (int i = (r)-1; i >= (l); i -= (d))\\n#define RREP(...) ovl(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define EACH1(e, a) for (auto &e : 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(...) ovl(__VA_ARGS__, EACH3, EACH2, EACH1)(__VA_ARGS__)\\n#define ALL(x) begin(x), end(x)\\n#define RALL(x) (x).rbegin(), (x).rend()\\n#define sz(x) (ll) x.size()\\n#define LB(a, x) (lower_bound(ALL(a), x) - a.begin())\\n#define UB(a, x) (upper_bound(ALL(a), x) - a.begin())\\n#define FLG(x, i) (((x) >> (i)) & 1)\\n#define CNTBIT(x) __builtin_popcountll(x)\\n#define TOPBIT(t) (t == 0 ? -1 : 63 - __builtin_clzll(t))\\n#define IN(x, a, b) ((a) <= (x) && (x) < (b))\\n\\ntemplate <typename T, typename... Ts>\\nvoid OUT(const T &a, const Ts &...b) {\\n cout << a;\\n (cout << ... << (cout << \\\" \\\", b));\\n cout << endl;\\n}\\n\\ntemplate <typename T>\\nvoid DEBUG_(string_view name, const T &a) {\\n cout << name << \\\": \\\" << a << endl;\\n}\\n\\ntemplate <typename T>\\nvoid DEBUG_(string_view name, const vector<T> &a) {\\n cout << name << \\\": \\\";\\n REP(i, sz(a)) cout << a[i] << \\\" \\\";\\n cout << endl;\\n}\\n\\ntemplate <typename T1, typename T2>\\nbool chmax(T1 &x, const T2 &y) {\\n return x < y ? x = y, 1 : 0;\\n}\\ntemplate <typename T1, typename T2>\\nbool chmin(T1 &x, const T2 &y) {\\n return x > y ? x = y, 1 : 0;\\n}\\n\\nll N, lx, ly;\\n\\nint toIdx(int t, int x, int y) {\\n assert(0 <= t && t < 6);\\n assert(0 <= x && x < lx);\\n assert(0 <= y && y < ly);\\n return t * lx * ly + y * lx + x;\\n}\\n\\nint DX[6] = {0, 1, 1, 0, -1, -1};\\nint DY(int d, int x) {\\n int DY1[6] = {1, 0, -1, -1, -1, 0};\\n int DY2[6] = {1, 1, 0, -1, 0, 1};\\n if ((x - lx / 2) % 2 == 0) {\\n return DY1[d];\\n } else {\\n return DY2[d];\\n }\\n}\\n\\n// Ο((E+V)logV) cannot reach: INFll\\nvector<long long> dijkstra(const vector<vector<pair<int, long long>>> &adj, int s) {\\n vector<long long> dist(int(adj.size()), INFL);\\n priority_queue<pair<long long, int>, vector<pair<long long, int>>,\\n greater<pair<long long, int>>>\\n que;\\n dist[s] = 0;\\n que.emplace(dist[s], s);\\n while (!que.empty()) {\\n pair<long long, int> p = que.top();\\n que.pop();\\n if (dist[p.second] < p.first) continue;\\n for (pair<int, long long> nv : adj[p.second]) {\\n if (dist[nv.first] > dist[p.second] + nv.second) {\\n dist[nv.first] = dist[p.second] + nv.second;\\n que.emplace(dist[nv.first], nv.first);\\n }\\n }\\n }\\n return dist;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n ll sx, sy, gx, gy;\\n cin >> sx >> sy >> gx >> gy;\\n\\n cin >> N;\\n\\n vp _XYs(N);\\n REP(i, N) {\\n ll x, y;\\n cin >> x >> y;\\n _XYs[i] = {x, y};\\n }\\n\\n cin >> lx >> ly;\\n\\n sx += lx;\\n sy += ly;\\n gx += lx;\\n gy += ly;\\n REP(i, N) { _XYs[i] = {_XYs[i].first + lx, _XYs[i].second + ly}; }\\n set<pl> XYs(ALL(_XYs));\\n\\n lx *= 2;\\n ly *= 2;\\n lx += 1;\\n ly += 1;\\n\\n vector<vector<pair<int, long long>>> adj(6 * lx * ly + 2);\\n\\n REP(t, 6) {\\n REP(x, lx) {\\n REP(y, ly) {\\n if (XYs.find({x, y}) != XYs.end()) continue;\\n int v = toIdx(t, x, y);\\n REP(d, 6) {\\n int nt = (t + 1) % 6;\\n int nx = x + DX[d];\\n int ny = y + DY(d, x);\\n if (!IN(nx, 0, lx) || !IN(ny, 0, ly)) continue;\\n if (XYs.find({nx, ny}) != XYs.end()) continue;\\n int nv = toIdx(nt, nx, ny);\\n if (abs(t * (x - lx / 2) * (y - ly / 2)) % 6 == d)\\n adj[v].emplace_back(nv, 0);\\n else\\n adj[v].emplace_back(nv, 1);\\n }\\n int nv_same_place = toIdx((t + 1) % 6, x, y);\\n adj[v].emplace_back(nv_same_place, 1);\\n }\\n }\\n }\\n\\n adj[6 * lx * ly].emplace_back(toIdx(0, sx, sy), 0);\\n REP(t, 6) { adj[toIdx(t, gx, gy)].emplace_back(6 * lx * ly + 1, 0); }\\n\\n auto dists = dijkstra(adj, 6 * lx * ly);\\n OUT(dists[6 * lx * ly + 1] == INFL ? -1 : dists[6 * lx * ly + 1]);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 44056,\n \"score_of_the_acc\": -0.4324,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2425_7123660\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#include <unordered_set>\\n#include <random>\\n//#define int long long\\n#define REP(i,m,n) for(int i=(m);i<(n);i++)\\n#define rep(i,n) REP(i,0,n)\\n#define pb push_back\\n#define all(a) a.begin(),a.end()\\n#define rall(c) (c).rbegin(),(c).rend()\\n#define mp make_pair\\n#define endl '\\\\n'\\n//#define vec vector<ll>\\n//#define mat vector<vector<ll> >\\n#define fi first\\n#define se second\\n#define double long double\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll,ll> pll;\\n//typedef long double ld;\\ntypedef complex<double> Complex;\\nconst ll INF=1e9+7;\\nconst ll MOD=INF;\\nconst ll inf=INF*INF;\\nconst ll mod=MOD;\\nconst ll inv2=499122177;\\nconst ll MAX=10000010;\\nconst double PI=acos(-1.0);\\ntypedef vector<vector<ll> > mat;\\ntypedef vector<ll> vec;\\n\\n//ll dx[]={0,1,0,-1,-1,-1,1,1};\\n//ll dy[]={1,0,-1,0,-1,1,-1,1};\\n\\nint Dx[]={0,1,1,0,-1,-1};\\nint Dy[]={1,0,-1,-1,-1,0};\\n\\n\\n\\nvoid solve(){\\n int sx,sy,gx,gy;\\n cin >> sx >> sy >> gx >> gy;\\n vector<vector<int> >dx(2,vector<int>(6)),dy(2,vector<int>(6));\\n rep(i,6)dx[0][i]=Dx[i],dy[0][i]=Dy[i];\\n dx[1]=dx[0],dy[1]=dy[0];\\n dy[1][1]++,dy[1][2]++;\\n dy[1][4]++,dy[1][5]++;\\n //01-BFS で解く\\n int n;\\n cin >> n;\\n set<pair<int,int> >st;\\n rep(i,n){\\n int x,y;cin>>x>>y;\\n st.insert(mp(x,y));\\n }\\n int lx,ly;\\n cin >> lx >> ly;\\n map<pair<pair<int,int>,int>, int>idx;\\n\\n int now = 0;\\n vector<int>x(0),y(0),t(0);\\n REP(i,-lx,lx+1){\\n REP(j,-ly,ly+1){\\n rep(k,6){\\n idx[mp(mp(i,j),k)]=now;\\n x.pb(i);\\n y.pb(j);\\n t.pb(k);\\n now++;\\n }\\n }\\n }\\n\\n\\n vector<int>d(now,INF);\\n deque<pair<int,int> > dq;\\n int s=idx[mp(mp(sx,sy),0)];\\n d[s]=0;\\n dq.push_front(mp(s,0));\\n while(!dq.empty()){\\n pair<int,int> k = dq.front();\\n dq.pop_front();\\n if(d[k.fi]<k.se)continue;\\n int X=x[k.fi],Y=y[k.fi],T=t[k.fi];\\n int dir=abs(X*Y*T)%6;\\n int nt=(T+1)%6;\\n //cout<<X<<' '<<Y<<' '<<T<<' '<<d[k.fi]<<endl;\\n rep(l,6){\\n if(l==dir)continue;\\n int nx=X+dx[abs(X)%2][l],ny=Y+dy[abs(X)%2][l];\\n if(abs(nx)>lx||abs(ny)>ly||st.find(mp(nx,ny))!=st.end())continue;\\n int nid=idx[mp(mp(nx,ny),nt)];\\n if(d[nid]>d[k.fi]+1){\\n d[nid]=d[k.fi]+1;\\n dq.push_back(mp(nid,d[nid]));\\n }\\n }\\n int nid=idx[mp(mp(X,Y),nt)];\\n if(d[nid]>d[k.fi]+1){\\n d[nid]=d[k.fi]+1;\\n dq.push_back(mp(nid,d[nid]));\\n }\\n int nx=X+dx[abs(X)%2][dir],ny=Y+dy[abs(X)%2][dir];\\n if(abs(nx)>lx||abs(ny)>ly||st.find(mp(nx,ny))!=st.end())continue;\\n nid=idx[mp(mp(nx,ny),nt)];\\n if(d[nid]>d[k.fi]){\\n d[nid]=d[k.fi];\\n dq.push_front(mp(nid,d[nid]));\\n }\\n }\\n int ans=INF;\\n rep(i,6){\\n int gid=idx[mp(mp(gx,gy),i)];\\n ans=min(ans,d[gid]);\\n }\\n if(ans==INF)ans=-1;\\n cout<<ans<<endl;\\n}\\n\\nsigned main(){\\n //cin.tie(0);\\n //ios::sync_with_stdio(false);\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 22220,\n \"score_of_the_acc\": -0.271,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2425_7002960\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <stdlib.h>\\n#include <deque>\\n#include <tuple>\\n#define Z 128\\n#define INF 1012345678\\nusing namespace std;\\n\\nint block[256][256], dist[256][256][6];\\ndeque<tuple<int, int, int>> dq;\\nconst int dxy[7][2] = { {0, 1}, {1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {0, 0} };\\nint lx, ly;\\n\\nint isvalid(int x, int y, int t) {\\n if (x < -lx || y < -ly || x > lx || y > ly) return 0;\\n if (block[x + Z][y + Z]) return 0;\\n return 1;\\n}\\n\\nint main(void) {\\n int sx, sy, gx, gy, n, x, y, t, nx, ny, nt, nd, md, res = INF;\\n scanf(\\\"%d %d %d %d\\\", &sx, &sy, &gx, &gy);\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++) {\\n scanf(\\\"%d %d\\\", &x, &y);\\n block[x + Z][y + Z] = 1;\\n }\\n scanf(\\\"%d %d\\\", &lx, &ly);\\n for (int i = 0; i < 256; i++) {\\n for (int j = 0; j < 256; j++) {\\n for (int k = 0; k < 6; k++) dist[i][j][k] = INF;\\n }\\n }\\n dq.push_back({ sx, sy, 0 });\\n dist[sx + Z][sy + Z][0] = 0;\\n\\n while (dq.size()) {\\n x = get<0>(dq.front());\\n y = get<1>(dq.front());\\n t = get<2>(dq.front());\\n dq.pop_front();\\n nt = t + 1;\\n if (nt == 6) nt = 0;\\n md = abs(x * y * t) % 6;\\n\\n for (int i = 0; i < 7; i++) {\\n nx = x + dxy[i][0];\\n ny = y + dxy[i][1];\\n if (i != 0 && i != 3 && i != 6 && (x & 1)) ny++;\\n if (!isvalid(nx, ny, nt)) continue;\\n nd = dist[x + Z][y + Z][t];\\n if (md != i) nd++;\\n if (nd >= dist[nx + Z][ny + Z][nt]) continue;\\n\\n if (md == i) dq.push_front({ nx, ny, nt });\\n else dq.push_back({ nx, ny, nt });\\n dist[nx + Z][ny + Z][nt] = nd;\\n }\\n }\\n for (int i = 0; i < 6; i++) {\\n if (dist[gx + Z][gy + Z][i] < res) res = dist[gx + Z][gy + Z][i];\\n }\\n printf(\\\"%d\\\\n\\\", res == INF ? -1 : res);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4660,\n \"score_of_the_acc\": -0.0069,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":1386,"cells":{"group_id":{"kind":"string","value":"aoj_2426_cpp"},"problem_description":{"kind":"string","value":"宝探し\n太郎君はある広場にお宝を探しにやってきました。この広場にはたくさんのお宝が埋められていますが、太郎君は最新の機械を持っているので、どこにお宝が埋まっているかをすべて知っています。広場はとても広いので太郎君は領域を決めてお宝を探すことにしましたが、お宝はたくさんあるためどのお宝がその領域の中にあるかすぐにわかりません。そこで太郎君はその領域の中にあるお宝の数を数えることにしました。\nInput\nn\nm\nx\n1\ny\n1\nx\n2\ny\n2\n...\nx\nn\ny\nn\nx\n11\ny\n11\nx\n12\ny\n12\nx\n21\ny\n21\nx\n22\ny\n22\n...\nx\nm1\ny\nm1\nx\nm2\ny\nm2\nn\nは広場に埋まっているお宝の数を表す\nm\nは調べる領域の数を表す\n2行目から\nn+1\n行目はそれぞれのお宝が埋まっている座標を表す\nn+2\n行目から\nn+m+1\n行目はそれぞれの調べる領域を表す\nx軸の正の方向が東、y軸の正の方向が北を表す\nそれぞれの領域は長方形であり、\nx\ni1\nと\ny\ni1\nは長方形の南西の頂点の座標、\nx\ni2\nと\ny\ni2\nは長方形の北東の頂点の座標を表す\nConstraints\n1 ≤ n ≤ 5000\n1 ≤ m ≤ 5×10\n5\n|x\ni\n|, |y\ni\n| ≤ 10\n9\n(1 ≤ i ≤ n)\n|x\ni1\n|, |y\ni1\n|, |x\ni2\n|, |y\ni2\n| ≤ 10\n9\n(1 ≤ i ≤ m)\nx\ni1\n≤ x\ni2\n, y\ni1\n≤ y\ni2\n(1 ≤ i ≤ m)\nすべての入力は整数で与えられる\nOutput\nC\n1\nC\n2\n...\nC\nm\nそれぞれの領域に含まれるお宝の数を各行に出力せよ\nSample Input 1\n3 1\n1 1\n2 4\n5 3\n0 0 5 5\nOutput for the Sample Input 1\n3\n領域の境界線上にあるお宝も領域に含まれるものとみなす\nSample Input 2\n4 2\n-1 1\n0 3\n4 0\n2 1\n-3 1 5 1\n4 0 4 0\nOutput for the Sample Input 2\n2\n1\n領域は直線や点のようになる場合もある\nSample Input 3\n2 3\n0 0\n0 0\n-1 -1 1 1\n0 0 2 2\n1 1 4 4\nOutput for the Sample Input 3\n2\n2\n0\n同じ場所に複数のお宝が存在する場合もある\nSample Input 4\n5 5\n10 5\n-3 -8\n2 11\n6 0\n-1 3\n-3 1 3 13\n-1 -1 9 5\n-3 -8 10 11\n0 0 5 5\n-10 -9 15 10\nOutput for the Sample Input 4\n2\n2\n5\n0\n4"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2426_11043154","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<int, 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, 1 : 0; }\n\nll mod = 998244353;\nconst ll INF = 1e18;\n\nifstream in;\nofstream out;\n\nint main(int argc, char** argv) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n if(argc > 2) {\n in.open(argv[1]);\n cin.rdbuf(in.rdbuf());\n out.open(argv[2]);\n cout.rdbuf(out.rdbuf());\n }\n\n ll n, m;\n cin >> n >> m;\n set<int> x, y;\n vector<a2> xy(n);\n for(int i = 0; i < n; i++) {\n int a, b;\n cin >> a >> b;\n xy[i] = {a, b};\n x.insert(a);\n y.insert(b);\n }\n x.insert(-2e9);\n y.insert(-2e9);\n x.insert(2e9);\n y.insert(2e9);\n\n vector<int> vx(x.begin(), x.end()), vy(y.begin(), y.end());\n map<int, int> mpx, mpy;\n for(int i = 0; i < vx.size(); i++) mpx[vx[i]] = i;\n for(int i = 0; i < vy.size(); i++) mpy[vy[i]] = i;\n\n vector<vector<int>> sum(vx.size(), vector<int>(vy.size(), 0));\n for(int i = 0; i < n; i++) {\n int xi = mpx[xy[i][0]], yi = mpy[xy[i][1]];\n sum[xi][yi]++;\n }\n for(int i = 1; i < vx.size(); i++) {\n for(int j = 1; j < vy.size(); j++) {\n sum[i][j] += sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];\n }\n }\n for(int i = 0; i < m; i++) {\n ll a, b, c, d;\n cin >> a >> b >> c >> d;\n int mnx = lower_bound(vx.begin(), vx.end(), a) - vx.begin() - 1,\n mxx = upper_bound(vx.begin(), vx.end(), c) - vx.begin() - 1;\n int mny = lower_bound(vy.begin(), vy.end(), b) - vy.begin() - 1,\n mxy = upper_bound(vy.begin(), vy.end(), d) - vy.begin() - 1;\n\n cout << sum[mxx][mxy] - sum[mnx][mxy] - sum[mxx][mny] + sum[mnx][mny]\n << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":102272,"score_of_the_acc":-0.6592,"final_rank":11},{"submission_id":"aoj_2426_10881379","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 pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing vi = vector<int>;\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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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 int n,m;cin >> n >> m;\n vi x(n),y(n);\n vi corX,corY;\n rep(i,0,n)cin >> x[i] >> y[i];\n rep(i,0,n)corX.emplace_back(x[i]),corY.emplace_back(y[i]);\n sort(ALL(corX));corX.erase(unique(ALL(corX)),corX.end());\n sort(ALL(corY));corY.erase(unique(ALL(corY)),corY.end());\n vvi rui(sz(corX)+1,vi(sz(corY)+1));\n rep(i,0,n)rui[LB(corX,x[i])+1][LB(corY,y[i])+1]++;\n rep(i,0,sz(corX))rep(j,0,sz(corY))rui[i+1][j+1] += rui[i][j+1] + rui[i+1][j] - rui[i][j];\n rep(_,0,m){\n ll x,y,X,Y;cin >> x >> y >> X >> Y;\n x = LB(corX,x);y = LB(corY,y);X = LB(corX,X+1);Y = LB(corY,Y+1);\n cout << rui[X][Y]-rui[X][y]-rui[x][Y]+rui[x][y] << \"\\n\";\n }\n\n \n\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":101012,"score_of_the_acc":-0.6115,"final_rank":10},{"submission_id":"aoj_2426_10851084","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n \nusing pii = pair<int, int>;\n \nint idx(vector<int> const& v, int i) {\n return lower_bound(v.begin(), v.end(), i) - v.begin();\n}\n \nint main() {\n int n, m;\n cin >> n >> m;\n vector<vector<int>> sum(n + 2, vector<int>(n + 2));\n vector<int> xs(n), ys(n);\n vector<int> x(n), y(n);\n for(int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i];\n xs[i] = x[i];\n ys[i] = y[i];\n }\n sort(x.begin(), x.end());\n x.erase(unique(x.begin(), x.end()), x.end());\n sort(y.begin(), y.end());\n y.erase(unique(y.begin(), y.end()), y.end());\n \n for(int i = 0; i < n; ++i) {\n int tx = idx(x, xs[i]);\n int ty = idx(y, ys[i]);\n ++sum[ty + 1][tx + 1];\n }\n for(int i = 0; i < y.size(); ++i) {\n for(int j = 0; j < x.size(); ++j) {\n sum[i + 1][j + 1] += sum[i + 1][j] + sum[i][j + 1] - sum[i][j];\n }\n }\n \n for(int i = 0; i < m; ++i) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n x1 = idx(x, x1);\n y1 = idx(y, y1);\n x2 = idx(x, x2 + 1);\n y2 = idx(y, y2 + 1);\n cout << sum[y2][x2] - sum[y2][x1] - sum[y1][x2] + sum[y1][x1] << endl;\n }\n}","accuracy":1,"time_ms":1010,"memory_kb":101344,"score_of_the_acc":-0.7944,"final_rank":12},{"submission_id":"aoj_2426_10283886","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////////////////////////////////////////////\n////////////////////////////////////////////////merge_sort_tree\ntemplate <typename T = long long>\nclass merge_sort_tree\n{\nprivate:\n unordered_map<pair<ll, ll>, vector<T>> mp;\n unordered_map<pair<ll, ll>, vector<T>> mp_s;\n vector<T> ar;\n ll sz_ar;\n T INF;\n void init_mp(ll l, ll r)\n {\n vector<T> in;\n vector<ll> in_s(1);\n rep(i, l, r) in.push_back(ar[i]);\n sort(in.begin(), in.end());\n rep(i, 0, r - l) in_s.push_back(in_s.back() + in[i]);\n mp[make_pair(l, r)] = in;\n mp_s[make_pair(l, r)] = in_s;\n if (r - l > 1)\n {\n init_mp(l, (l + r) / 2);\n init_mp((l + r) / 2, r);\n }\n }\n ll cnt_call(ll l, ll r, ll L, ll R, T x)\n {\n if (l <= L && R <= r)\n {\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\n return distance(mp[make_pair(L, R)].begin(), itr);\n }\n else if (r <= L || R <= l)\n return 0;\n else\n return cnt_call(l, r, L, (L + R) / 2, x) + cnt_call(l, r, (L + R) / 2, R, x);\n }\n ll sum_call(ll l, ll r, ll L, ll R, T x)\n {\n if (l <= L && R <= r)\n {\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\n return mp_s[make_pair(L, R)][distance(mp[make_pair(L, R)].begin(), itr)];\n }\n else if (r <= L || R <= l)\n return 0;\n else\n return sum_call(l, r, L, (L + R) / 2, x) + sum_call(l, r, (L + R) / 2, R, x);\n }\n T getsup_call(ll l, ll r, ll L, ll R, T x)\n {\n if (l <= L && R <= r)\n {\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\n if (itr == mp[make_pair(L, R)].begin())\n {\n return -INF;\n }\n return *prev(itr);\n }\n else if (r <= L || R <= l)\n return -INF;\n else\n return max(getsup_call(l, r, L, (L + R) / 2, x), getsup_call(l, r, (L + R) / 2, R, x));\n }\n T getinf_call(ll l, ll r, ll L, ll R, T x)\n {\n if (l <= L && R <= r)\n {\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\n if (itr == mp[make_pair(L, R)].end())\n {\n return INF;\n }\n return *itr;\n }\n else if (r <= L || R <= l)\n return INF;\n else\n return min(getinf_call(l, r, L, (L + R) / 2, x), getinf_call(l, r, (L + R) / 2, R, x));\n }\n T getmax_call(ll l, ll r, ll L, ll R)\n {\n if (l <= L && R <= r)\n {\n if (mp[make_pair(L, R)].empty())\n return -INF;\n return *(mp[make_pair(L, R)].rbegin());\n }\n else if (r <= L || R <= l)\n return -INF;\n else\n return max(getmax_call(l, r, L, (L + R) / 2), getmax_call(l, r, (L + R) / 2, R));\n }\n T getmin_call(ll l, ll r, ll L, ll R)\n {\n if (l <= L && R <= r)\n {\n if (mp[make_pair(L, R)].empty())\n return INF;\n return *(mp[make_pair(L, R)].begin());\n }\n else if (r <= L || R <= l)\n return INF;\n else\n return min(getmin_call(l, r, L, (L + R) / 2), getmin_call(l, r, (L + R) / 2, R));\n }\n\npublic:\n // 初期の配列と、INFとして扱う値で初期化\n merge_sort_tree(vector<T> init, T INF_init)\n {\n sz_ar = 1;\n while (init.size() > sz_ar)\n sz_ar *= 2;\n ar.resize(sz_ar, INF_init);\n INF = INF_init;\n rep(i, 0, init.size())\n {\n ar[i] = init[i];\n }\n init_mp(0, sz_ar);\n }\n //[l,r)においてx未満のものの個数を返す O((logn)^2)\n ll cnt(ll l, ll r, T x)\n {\n return cnt_call(l, r, 0LL, sz_ar, x);\n }\n //[l,r)においてx未満のものの総和を返す O((logn)^2)\n ll sum(ll l, ll r, T x)\n {\n return sum_call(l, r, 0LL, sz_ar, x);\n }\n //[l,r)においてx未満のものの最大値を返す 無ければ-inf O((logn)^2)\n T getsup(ll l, ll r, T x)\n {\n return getsup_call(l, r, 0LL, sz_ar, x);\n }\n //[l,r)においてx以上のものの最小値を返す 無ければinf O((logn)^2)\n T getinf(ll l, ll r, T x)\n {\n return getinf_call(l, r, 0LL, sz_ar, x);\n }\n //[l,r]の最大値を返す O(logn)\n T getmax(ll l, ll r)\n {\n return getmax_call(l, r, 0LL, sz_ar);\n }\n //[l,r]の最小値を返す O(logn)\n T getmin(ll l, ll r)\n {\n return getmin_call(l, r, 0LL, sz_ar);\n }\n};\n\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n, m;\n cin >> n >> m;\n vector<pair<ll, ll>> ar(n);\n rep(i, 0, n)\n {\n cin >> ar[i].first >> ar[i].second;\n }\n srt(ar);\n vector<ll> x, y;\n rep(i, 0, n)\n {\n x.push_back(ar[i].first);\n y.push_back(ar[i].second);\n }\n merge_sort_tree<ll> mst(y,inf);\n rep(i, 0, m)\n {\n ll a, b, c, d;\n cin >> a >> b >> c >> d;\n ll l = distance(x.begin(), lower_bound(all(x), a));\n ll r = distance(x.begin(), upper_bound(all(x), c));\n cout << mst.cnt(l, r, d + 1) - mst.cnt(l, r, b) << endl;\n }\n}","accuracy":1,"time_ms":1110,"memory_kb":8704,"score_of_the_acc":-0.2467,"final_rank":7},{"submission_id":"aoj_2426_10256455","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < (n); ++i)\n#define repp(i,n) for(int i = 1; i <= (n); ++i)\n#define drep(i,n) for(int i = (n)-1; i >= 0; --i)\n#define srep(i,s,t) for (int i = s; i < (t); ++i)\n#define rng(a) a.begin(),a.end()\n#define rrng(a) a.rbegin(),a.rend()\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define em emplace\n#define pob pop_back\n#define sz(x) (int)(x).size()\n#define pcnt __builtin_popcountll\n#define koulet srand((unsigned)clock()+(unsigned)time(NULL));\n#define newline puts(\"\")\n#define vc vector\nusing namespace std;\ntemplate<class T> using vv = vc<vc<T>>;\ntemplate<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;\nusing uint = unsigned; using ull = unsigned long long;\nusing vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;\nusing P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;\nusing vs = vc<string>; using vb=vc<bool> ; using vlp = vc<LP> ; \nint geti(){int x;scanf(\"%d\",&x);return x;}\nvi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}\ntemplate<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}\ntemplate<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<\",\"<<v.se;}\ntemplate<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}\ntemplate<class T>string join(const T&v,const string&d=\"\"){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}\ntemplate<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v,\" \");return o;}\ntemplate<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}\ntemplate<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}\ntemplate<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}\ntemplate<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}\ntemplate<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}\ntemplate<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}\ntemplate<class T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}\ntemplate<class T>void operator-=(vc<T>&a,T b){for(T&x:a)x-=b;}\ntemplate<class T>void operator*=(vc<T>&a,T b){for(T&x:a)x*=b;}\ntemplate<class T>void operator/=(vc<T>&a,T b){for(T&x:a)x/=b;}\ntemplate<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}\ntemplate<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}\ntemplate<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}\ntemplate<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}\ntemplate<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}\ntemplate<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}\ntemplate<class T>T min(const vc<T>&a){return *min_element(rng(a));}\ntemplate<class T>T max(const vc<T>&a){return *max_element(rng(a));}\ntemplate<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}\ntemplate<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}\ntemplate<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}\ntemplate<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}\ntemplate<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}\nconst double eps = 1e-10;\nconst ll LINF = 1001002003004005006ll;\nconst int INF = 1001001001;\n#define dame { puts(\"-1\"); return 0 ;}\n#define yes { puts(\"Yes\"); return 0 ;}\n#define no { puts(\"No\"); return 0 ;}\n#define rtn(x) { cout<<(x)<<endl;} // flush!\n#define yn {puts(\"Yes\");}else{puts(\"No\");}\nll c2(ll n) { return n*(n-1)>>1;}\n\n// Mod int\nuint mod = 998244353;//*/\n// uint mod = 1000000007;//*/\nuint md(ll x) { x%=mod; return x<0?x+mod:x;}\nll md(ll x, ll m) { x%=m; return x<0?x+m:x;}\nstruct mint {\n uint x;\n mint(): x(0) {}\n mint(ll x):x(md(x)) {}\n mint operator-() const { return mint(0) - *this;}\n mint operator~() const { return mint(1) / *this;}\n mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}\n mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}\n mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}\n mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}\n mint operator+(const mint& a) const { return mint(*this) += a;}\n mint operator-(const mint& a) const { return mint(*this) -= a;}\n mint operator*(const mint& a) const { return mint(*this) *= a;}\n mint operator/(const mint& a) const { return mint(*this) /= a;}\n mint pow(ll t) const {\n mint res = 1; for (mint p=x;t;p*=p,t>>=1) if (t&1) res *= p; return res;\n }\n mint ppow(ll t) const { int p=mod-1; return pow((t%p+p)%p);}\n bool operator<(const mint& a) const { return x < a.x;}\n bool operator==(const mint& a) const { return x == a.x;}\n bool operator!=(const mint& a) const { return x != a.x;}\n};\nmint ex(mint x, ll t) { return x.pow(t);}\nistream& operator>>(istream&i,mint&a) {i>>a.x;return i;}\n//*\nostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}\n/*/\nostream& operator<<(ostream&o, const mint&x) {\n int a = x.x, b = 1;\n rep(s,2)rep1(i,1000) {\n int y = ((s?-x:x)*i).x; if (abs(a)+b > y+i) a = s?-y:y, b = i;\n }\n o<<a; if (b != 1) o<<'/'<<b; return o;\n}//*/\nusing vm = vector<mint>;\nusing vvm = vector<vm>;\nstruct modinv {\n int n; vm d;\n modinv(): n(2), d({0,1}) {}\n mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} invs;\nstruct modfact {\n int n; vm d;\n modfact(): n(2), d({1,1}) {}\n mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} facs;\nstruct modfactinv {\n int n; vm d;\n modfactinv(): n(2), d({1,1}) {}\n mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} ifacs;\nmint comb(int a, int b) {\n if (a < b || b < 0) return 0;\n return facs(a)*ifacs(b)*ifacs(a-b);\n}\nstruct modpow {\n mint x; int n; vm d;\n modpow(mint x=2): x(x), n(1), d(1,1) {}\n mint operator()(int i) { while (n <= i) d.pb(d.back()*x), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} two(2);//, owt(invs(2));\n//\n// Bit Vector (for 64-bit non-negative integer)\nstruct BitVector {\n // block: bit vector\n // count: the number of 1 within each block\n unsigned int n, zeros;\n vector<unsigned long long> block;\n vector<unsigned int> count;\n \n // constructor\n BitVector() {}\n BitVector(const unsigned int num) {\n resize(num);\n }\n void resize(const unsigned int num) {\n n = num;\n block.assign(((num + 1) >> 6) + 1, 0);\n count.assign(block.size(), 0);\n }\n \n // set val(0 or 1) onto i-th bit, get i-th bit of val(0 or 1)\n void set(const unsigned int i, const unsigned long long val = 1LL) {\n assert((i >> 6) < block.size());\n block[i >> 6] |= (val << (i & 63));\n }\n unsigned int get(const unsigned int i) const {\n assert((i >> 6) < block.size());\n return (const unsigned int)(block[i >> 6] >> (i & 63)) & 1;\n }\n void build() {\n for (unsigned int i = 1; i < block.size(); i++) {\n count[i] = count[i - 1] + __builtin_popcountll(block[i - 1]);\n }\n zeros = rank0(n);\n }\n \n // the number of 1 in [0, i)\n unsigned int rank1(const unsigned int i) const {\n assert((i >> 6) < count.size());\n assert((i >> 6) < block.size());\n return count[i >> 6] +\n __builtin_popcountll(block[i >> 6] & ((1ULL << (i & 63)) - 1ULL));\n }\n // the number of 1 in [i, j)\n unsigned int rank1(const unsigned int i, const unsigned int j) const {\n return rank1(j) - rank1(i);\n }\n // the number of 0 in [0, i)\n unsigned int rank0(const unsigned int i) const {\n return i - rank1(i);\n }\n // the number of 0 in [i, j)\n unsigned int rank0(const unsigned int i, const unsigned int j) const {\n return rank0(j) - rank0(i);\n }\n // the number of 0 in [0, n)\n unsigned int rank0() const {\n return zeros;\n }\n};\n\ntemplate<class POS, class VAL> struct BITonWaveletMatrix {\n // inner data\n struct BIT {\n VAL UNITY_SUM = 0;\n int N;\n vector<VAL> dat;\n \n // [0, n)\n BIT() {}\n BIT(int n, VAL unity = 0) : UNITY_SUM(unity), N(n), dat(n, unity) { }\n void init(int n) {\n N = n;\n dat.assign(n, UNITY_SUM);\n }\n \n // a is 0-indexed\n void add(int a, VAL x) {\n for (int i = a; i < (int)dat.size(); i |= i + 1)\n dat[i] = dat[i] + x;\n }\n \n // [0, a), a is 0-indexed\n VAL sum(int a) {\n VAL res = UNITY_SUM;\n for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)\n res = res + dat[i];\n return res;\n }\n \n // [a, b), a and b are 0-indexed\n VAL sum(int a, int b) {\n return sum(b) - sum(a);\n }\n \n // debug\n void print() {\n for (int i = 0; i < (int)dat.size(); ++i)\n cout << sum(i, i + 1) << \",\";\n cout << endl;\n }\n };\n \n using Point = pair<POS, POS>;\n int n, height;\n\tPOS mi = 0 ;\n vector<BitVector> bv;\n vector<Point> ps;\n vector<POS> ys;\n vector<BIT> bit;\n\n // constructor (sigma: the number of characters)\n // add_point() cannot be used after build()\n BITonWaveletMatrix() {}\n BITonWaveletMatrix(const vector<Point> &vec) {\n for (auto [x, y] : vec) add_point(x, y);\n build();\n }\n void add_point(POS x, POS y) {\n ps.emplace_back(x, y);\n ys.emplace_back(y);\n\t\tmi = min(mi, y) ;\n }\n int xid(POS x) const {\n return lower_bound(ps.begin(), ps.end(), Point(x, mi)) - ps.begin();\n }\n int yid(POS y) const {\n return lower_bound(ys.begin(), ys.end(), y) - ys.begin();\n }\n void build() {\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n n = (int)ps.size();\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n vector<int> v(n), left(n), right(n), ord(n);\n int mv = 1;\n for (int i = 0; i < n; ++i) {\n v[i] = yid(ps[i].second);\n mv = max(mv, v[i]);\n }\n for (height = 1; mv != 0; mv >>= 1) ++height;\n iota(ord.begin(), ord.end(), 0);\n bv.resize(height, BitVector(n));\n bit.assign(height + 1, BIT(n));\n for (int h = height - 1; h >= 0; --h) {\n int l = 0, r = 0;\n for (int i = 0; i < n; ++i) {\n if ((v[ord[i]] >> h) & 1) {\n bv[h].set(i);\n right[r++] = ord[i];\n } else {\n left[l++] = ord[i];\n }\n }\n bv[h].build();\n ord.swap(left);\n for (int i = 0; i < r; ++i) ord[i + l] = right[i];\n }\n }\n \n // add\n void add(const POS x, const POS y, const VAL val) {\n int i = lower_bound(ps.begin(), ps.end(), Point(x, y)) - ps.begin();\n int j = yid(y);\n for (int h = height - 1; h >= 0; --h) {\n int i0 = bv[h].rank0(i);\n if ((j >> h) & 1) {\n i += bv[h].rank0() - i0;\n } else {\n i = i0;\n }\n bit[h].add(i, val);\n }\n }\n \n // sum\n VAL inner_sum(int l, int r, const POS upper) {\n assert(0 <= l && r <= n);\n VAL res = 0;\n for (int h = height - 1; h >= 0; --h) {\n int l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);\n if ((upper >> h) & 1) {\n l += bv[h].rank0() - l0;\n r += bv[h].rank0() - r0;\n res += bit[h].sum(l0, r0);\n } else {\n l = l0;\n r = r0;\n }\n }\n return res;\n }\n\n\t// sum [lx, rx)×[ly, ry)\n VAL sum(const POS lx, const POS rx, const POS ly, const POS ry) {\n int l = xid(lx), r = xid(rx);\n return inner_sum(l, r, yid(ry)) - inner_sum(l, r, yid(ly));\n }\n};\n\n\nint main() {\n\tBITonWaveletMatrix<long long, long long> wm;\n\tint n, m;cin>>n>>m ;\n\tvl x(n) , y(n) ;\n\trep(i, n){\n\t\tcin>>x[i] >>y[i] ;\n\t\twm.add_point(x[i], y[i]) ;\n\t}\n wm.build();\n\t\n\trep(i, n) wm.add(x[i],y[i],1);\n\twhile(m--){\n\t\tll lx,ly,rx,ry ;cin>>lx>>ly>>rx>>ry;\n\t\tcout << wm.sum(lx,rx+1,ly,ry+1) <<endl;\n\t}\n\n\n}","accuracy":1,"time_ms":1190,"memory_kb":4180,"score_of_the_acc":-0.24,"final_rank":6},{"submission_id":"aoj_2426_10182280","code_snippet":"// competitive-verifier: PROBLEM\n#include <iostream>\n#include <utility>\n#include <vector>\n#include <algorithm>\n#include <iterator>\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n */\ntemplate <class T>\nstruct coordinate_compression {\n coordinate_compression() = default;\n coordinate_compression(const std::vector<T> &_data) : data(_data) { build(); }\n const T &operator[](int i) const { return data[i]; }\n void add(T x) { data.emplace_back(x); }\n void build() {\n std::sort(data.begin(), data.end());\n data.erase(std::unique(data.begin(), data.end()), data.end());\n }\n bool exists(T x) const {\n auto it = std::lower_bound(data.begin(), data.end(), x);\n return it != data.end() && *it == x;\n }\n int get(T x) const {\n auto it = std::lower_bound(data.begin(), data.end(), x);\n return std::distance(data.begin(), it);\n }\n int size() const { return data.size(); }\n private:\n std::vector<T> data;\n};\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n * @param v 配列\n * @return std::vector<T>\n */\ntemplate <class T>\nstd::vector<int> compress(const std::vector<T> &v) {\n coordinate_compression cps(v);\n std::vector<int> res;\n res.reserve(std::size(v));\n for (auto &&x : v) res.emplace_back(cps.get(x));\n return res;\n}\n#include <cassert>\ntemplate <class T>\nstruct cumulative_sum_2d {\n cumulative_sum_2d(int _n, int _m) : v(_n, std::vector<T>(_m)), n(_n), m(_m) {}\n cumulative_sum_2d(const std::vector<std::vector<T>> &_v) : v(_v) { build(); }\n void set(int x, int y, T val) { v[x][y] = val; }\n void add(int x, int y, T val) { v[x][y] += val; }\n void build() {\n n = v.size();\n assert(n > 0);\n m = v[0].size();\n assert(m > 0);\n v.resize(n + 1);\n for (int i = 0; i <= n; ++i) v[i].resize(m + 1);\n for (int i = n - 1; i >= 0; --i) {\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i][j + 1];\n }\n for (int i = n - 1; i >= 0; --i) {\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i + 1][j];\n }\n }\n T get(int x1, int y1, int x2, int y2) {\n assert(0 <= x1 && x1 <= x2 && x2 <= n && 0 <= y1 && y1 <= y2 && y2 <= m);\n return v[x1][y1] - v[x1][y2] - v[x2][y1] + v[x2][y2];\n }\n private:\n std::vector<std::vector<T>> v;\n int n, m;\n};\nint main(void) {\n int n, m;\n std::cin >> n >> m;\n std::vector<std::pair<int, int>> a(n);\n for (int i = 0; i < n; ++i) std::cin >> a[i].first >> a[i].second;\n coordinate_compression<int> cps_x, cps_y;\n for (int i = 0; i < n; ++i) cps_x.add(a[i].first), cps_y.add(a[i].second);\n cps_x.build(), cps_y.build();\n cumulative_sum_2d<int> cs(cps_x.size(), cps_y.size());\n for (int i = 0; i < n; ++i) cs.add(cps_x.get(a[i].first), cps_y.get(a[i].second), 1);\n cs.build();\n for (int i = 0; i < m; ++i) {\n int x1, y1, x2, y2;\n std::cin >> x1 >> y1 >> x2 >> y2;\n std::cout << cs.get(cps_x.get(x1), cps_y.get(y1), cps_x.get(x2 + 1), cps_y.get(y2 + 1))\n << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":160256,"score_of_the_acc":-1.0958,"final_rank":18},{"submission_id":"aoj_2426_10166998","code_snippet":"// competitive-verifier: PROBLEM\n#include <algorithm>\n#include <iterator>\n#include <vector>\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n */\ntemplate <class T>\nstruct coordinate_compression {\n coordinate_compression() = default;\n coordinate_compression(const std::vector<T> &_data) : data(_data) { build(); }\n const T &operator[](int i) const { return data[i]; }\n void add(T x) { data.emplace_back(x); }\n void build() {\n std::sort(data.begin(), data.end());\n data.erase(std::unique(data.begin(), data.end()), data.end());\n }\n bool exists(T x) const {\n auto it = std::lower_bound(data.begin(), data.end(), x);\n return it != data.end() && *it == x;\n }\n int get(T x) const {\n auto it = std::lower_bound(data.begin(), data.end(), x);\n return std::distance(data.begin(), it);\n }\n int size() const { return data.size(); }\n private:\n std::vector<T> data;\n};\n/**\n * @brief 座標圧縮\n *\n * @tparam T 要素の型\n * @param v 配列\n * @return std::vector<T>\n */\ntemplate <class T>\nstd::vector<int> compress(const std::vector<T> &v) {\n coordinate_compression cps(v);\n std::vector<int> res;\n res.reserve(std::size(v));\n for (auto &&x : v) res.emplace_back(cps.get(x));\n return res;\n}\n#include <cassert>\ntemplate <class T>\nstruct cumulative_sum_2d {\n cumulative_sum_2d(int _n, int _m) : v(_n, std::vector<T>(_m)), n(_n), m(_m) {}\n cumulative_sum_2d(const std::vector<std::vector<T>> &_v) : v(_v) { build(); }\n void set(int x, int y, T val) { v[x][y] = val; }\n void add(int x, int y, T val) { v[x][y] += val; }\n void build() {\n n = v.size();\n assert(n > 0);\n m = v[0].size();\n assert(m > 0);\n v.resize(n + 1);\n for (int i = 0; i <= n; ++i) v[i].resize(m + 1);\n for (int i = n - 1; i >= 0; --i) {\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i][j + 1];\n }\n for (int i = n - 1; i >= 0; --i) {\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i + 1][j];\n }\n }\n T get(int x1, int y1, int x2, int y2) {\n assert(0 <= x1 && x1 <= x2 && x2 <= n && 0 <= y1 && y1 <= y2 && y2 <= m);\n return v[x1][y1] - v[x1][y2] - v[x2][y1] + v[x2][y2];\n }\n private:\n std::vector<std::vector<T>> v;\n int n, m;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nint main(void) {\n int n, m;\n cin >> n >> m;\n std::vector<std::pair<int, int>> a(n);\n for (int i = 0; i < n; ++i) std::cin >> a[i].first >> a[i].second;\n coordinate_compression<int> cps_x, cps_y;\n for (int i = 0; i < n; ++i) cps_x.add(a[i].first), cps_y.add(a[i].second);\n cps_x.build(), cps_y.build();\n cumulative_sum_2d<int> cs(cps_x.size(), cps_y.size());\n for (int i = 0; i < n; ++i) cs.add(cps_x.get(a[i].first), cps_y.get(a[i].second), 1);\n cs.build();\n for (int i = 0; i < m; ++i) {\n int x1, y1, x2, y2;\n std::cin >> x1 >> y1 >> x2 >> y2;\n std::cout << cs.get(cps_x.get(x1), cps_y.get(y1), cps_x.get(x2 + 1), cps_y.get(y2 + 1))\n << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":160256,"score_of_the_acc":-0.9788,"final_rank":16},{"submission_id":"aoj_2426_10107649","code_snippet":"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/2426\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <iterator>\n#include <utility>\n#include <cassert>\nnamespace internal {\n// @return same with std::bit::bit_ceil\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n// @param n `1 <= n`\n// @return same with std::bit::countl_zero\nint countl_zero(unsigned int n) { return __builtin_clz(n); }\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n} // namespace internal\n#include <limits>\n#include <numeric>\ntemplate <class T>\nstruct Add {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs + rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs + rhs;\n }\n};\ntemplate <class T>\nstruct Mul {\n using value_type = T;\n static constexpr T id() { return T(1); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs * rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs * rhs;\n }\n};\ntemplate <class T>\nstruct And {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs & rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs & rhs;\n }\n};\ntemplate <class T>\nstruct Or {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs | rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs | rhs;\n }\n};\ntemplate <class T>\nstruct Xor {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs ^ rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs ^ rhs;\n }\n};\ntemplate <class T>\nstruct Min {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return std::min(lhs, rhs); }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return std::min((U)lhs, rhs);\n }\n};\ntemplate <class T>\nstruct Max {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::lowest(); }\n static constexpr T op(const T &lhs, const T &rhs) { return std::max(lhs, rhs); }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return std::max((U)lhs, rhs);\n }\n};\ntemplate <class T>\nstruct Gcd {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) {\n return lhs == Gcd::id() ? rhs : (rhs == Gcd::id() ? lhs : std::gcd(lhs, rhs));\n }\n};\ntemplate <class T>\nstruct Lcm {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) {\n return lhs == Lcm::id() ? rhs : (rhs == Lcm::id() ? lhs : std::lcm(lhs, rhs));\n }\n};\ntemplate <class T>\nstruct Update {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs == Update::id() ? rhs : lhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs == Update::id() ? rhs : lhs;\n }\n};\ntemplate <class T>\nstruct Affine {\n using P = std::pair<T, T>;\n using value_type = P;\n static constexpr P id() { return P(1, 0); }\n static constexpr P op(P lhs, P rhs) {\n return {lhs.first * rhs.first, lhs.first * rhs.second + lhs.second};\n }\n};\ntemplate <class M>\nstruct Rev {\n using T = typename M::value_type;\n using value_type = T;\n static constexpr T id() { return M::id(); }\n static constexpr T op(T lhs, T rhs) { return M::op(rhs, lhs); }\n};\n/**\n * @brief セグメント木\n * @see https://noshi91.hatenablog.com/entry/2020/04/22/212649\n *\n * @tparam M モノイド\n */\ntemplate <class M>\nstruct segment_tree {\n private:\n using T = typename M::value_type;\n struct _segment_tree_reference {\n private:\n segment_tree<M> &self;\n int k;\n public:\n _segment_tree_reference(segment_tree<M> &self, int k) : self(self), k(k) {}\n _segment_tree_reference &operator=(const T &x) {\n self.set(k, x);\n return *this;\n }\n _segment_tree_reference &operator=(T &&x) {\n self.set(k, std::move(x));\n return *this;\n }\n operator T() const { return self.get(k); }\n };\n public:\n segment_tree() : segment_tree(0) {}\n explicit segment_tree(int n, T e = M::id()) : segment_tree(std::vector<T>(n, e)) {}\n template <class U>\n explicit segment_tree(const std::vector<U> &v) : _n(v.size()) {\n _size = internal::bit_ceil(_n);\n _log = internal::countr_zero(_size);\n data = std::vector<T>(_size << 1, M::id());\n for (int i = 0; i < _n; ++i) data[_size + i] = T(v[i]);\n for (int i = _size - 1; i >= 1; --i) update(i);\n }\n const T &operator[](int k) const { return data[k + _size]; }\n _segment_tree_reference operator[](int k) { return _segment_tree_reference(*this, k); }\n T at(int k) const { return data[k + _size]; }\n T get(int k) const { return data[k + _size]; }\n void set(int k, T val) {\n assert(0 <= k && k < _n);\n k += _size;\n data[k] = val;\n for (int i = 1; i <= _log; ++i) update(k >> i);\n }\n void reset(int k) { set(k, M::id()); }\n T all_prod() const { return data[1]; }\n T prod(int a, int b) const {\n assert(0 <= a && b <= _n);\n T l = M::id(), r = M::id();\n for (a += _size, b += _size; a < b; a >>= 1, b >>= 1) {\n if (a & 1) l = M::op(l, data[a++]);\n if (b & 1) r = M::op(data[--b], r);\n }\n return M::op(l, r);\n }\n template <class F>\n int max_right(F f) const {\n return max_right(0, f);\n }\n template <class F>\n int max_right(int l, F f) const {\n assert(0 <= l && l <= _n);\n assert(f(M::id()));\n if (l == _n) return _n;\n l += _size;\n T sm = M::id();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(M::op(sm, data[l]))) {\n while (l < _size) {\n l = (2 * l);\n if (f(M::op(sm, data[l]))) {\n sm = M::op(sm, data[l]);\n l++;\n }\n }\n return l - _size;\n }\n sm = M::op(sm, data[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n template <class F>\n int min_left(F f) const {\n return min_left(_n, f);\n }\n template <class F>\n int min_left(int r, F f) const {\n assert(0 <= r && r <= _n);\n assert(f(M::id()));\n if (r == 0) return 0;\n r += _size;\n T sm = M::id();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(M::op(data[r], sm))) {\n while (r < _size) {\n r = (2 * r + 1);\n if (f(M::op(data[r], sm))) {\n sm = M::op(data[r], sm);\n r--;\n }\n }\n return r + 1 - _size;\n }\n sm = M::op(data[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n private:\n int _n, _size, _log;\n std::vector<T> data;\n void update(int k) { data[k] = M::op(data[2 * k], data[2 * k + 1]); }\n};\n/**\n * @brief 領域木\n *\n * @tparam M\n * @tparam T\n *\n * @see https://hitonanode.github.io/cplib-cpp/segmenttree/rangetree.hpp.html\n */\ntemplate <class M, class T = int>\nstruct range_tree {\n private:\n using Pt = std::pair<T, T>;\n using value_type = typename M::value_type;\n public:\n range_tree() = default;\n void add(T x, T y) noexcept { _pts.emplace_back(x, y); }\n void build() {\n std::sort(_pts.begin(), _pts.end());\n _pts.erase(std::unique(_pts.begin(), _pts.end()), _pts.end());\n _size = _pts.size();\n _range2yxs.resize(_size * 2);\n for (int i = 0; i < _size; i++) _range2yxs[_size + i] = {{_pts[i].second, _pts[i].first}};\n for (int i = _size - 1; i > 0; i--) {\n auto &lch = _range2yxs[i * 2];\n auto &rch = _range2yxs[i * 2 + 1];\n std::merge(lch.begin(), lch.end(), rch.begin(), rch.end(),\n std::back_inserter(_range2yxs[i]));\n _range2yxs[i].erase(std::unique(_range2yxs[i].begin(), _range2yxs[i].end()),\n _range2yxs[i].end());\n }\n for (const auto &v : _range2yxs) segtrees.emplace_back(v.size());\n }\n void set(T x, T y, value_type val) {\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\n assert(i < _size && _pts[i] == std::make_pair(x, y));\n for (i += _size; i; i >>= 1) set(i, {x, y}, val);\n }\n value_type prod(T xl, T yl, T xr, T yr) const {\n auto comp = [](const Pt &l, const Pt &r) { return l.first < r.first; };\n int l = _size + std::distance(_pts.begin(),\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xl, yr}, comp));\n int r = _size + std::distance(_pts.begin(),\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xr, yr}, comp));\n value_type res = M::id();\n while (l < r) {\n if (l & 1) res = M::op(res, prod(l++, yl, yr));\n if (r & 1) res = M::op(res, prod(--r, yl, yr));\n l >>= 1, r >>= 1;\n }\n return res;\n }\n value_type get(T x, T y) const {\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\n return i < _size && _pts[i] == std::make_pair(x, y) ? segtrees[_size + i].get(0) : M::id();\n }\n private:\n int _size;\n std::vector<Pt> _pts;\n std::vector<std::vector<Pt>> _range2yxs;\n std::vector<segment_tree<M>> segtrees;\n void set(int v, Pt p, value_type val) {\n auto i = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{p.second, p.first}));\n segtrees[v].set(i, val);\n }\n value_type prod(int v, T yl, T yr) const {\n auto comp = [&](const Pt &l, const Pt &r) { return l.first < r.first; };\n auto il = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yl, yl}, comp));\n auto ir = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yr, yr}, comp));\n return segtrees[v].prod(il, ir);\n }\n};\nint main(void) {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> x(n), y(n);\n for (int i = 0; i < n; ++i) std::cin >> x[i] >> y[i];\n range_tree<Add<int>> rt;\n for (int i = 0; i < n; ++i) rt.add(x[i], y[i]);\n rt.build();\n for (int i = 0; i < n; ++i) rt.set(x[i], y[i], rt.get(x[i], y[i]) + 1);\n for (int i = 0; i < m; ++i) {\n int a, b, c, d;\n std::cin >> a >> b >> c >> d;\n std::cout << rt.prod(a, b, c + 1, d + 1) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":1300,"memory_kb":5492,"score_of_the_acc":-0.2773,"final_rank":8},{"submission_id":"aoj_2426_10107646","code_snippet":"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/2426\n#include <algorithm>\n#include <iterator>\n#include <utility>\n#include <cassert>\n#include <vector>\nnamespace internal {\n// @return same with std::bit::bit_ceil\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n// @param n `1 <= n`\n// @return same with std::bit::countl_zero\nint countl_zero(unsigned int n) { return __builtin_clz(n); }\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n} // namespace internal\n#include <limits>\n#include <numeric>\ntemplate <class T>\nstruct Add {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs + rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs + rhs;\n }\n};\ntemplate <class T>\nstruct Mul {\n using value_type = T;\n static constexpr T id() { return T(1); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs * rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs * rhs;\n }\n};\ntemplate <class T>\nstruct And {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs & rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs & rhs;\n }\n};\ntemplate <class T>\nstruct Or {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs | rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs | rhs;\n }\n};\ntemplate <class T>\nstruct Xor {\n using value_type = T;\n static constexpr T id() { return T(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs ^ rhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs ^ rhs;\n }\n};\ntemplate <class T>\nstruct Min {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return std::min(lhs, rhs); }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return std::min((U)lhs, rhs);\n }\n};\ntemplate <class T>\nstruct Max {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::lowest(); }\n static constexpr T op(const T &lhs, const T &rhs) { return std::max(lhs, rhs); }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return std::max((U)lhs, rhs);\n }\n};\ntemplate <class T>\nstruct Gcd {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) {\n return lhs == Gcd::id() ? rhs : (rhs == Gcd::id() ? lhs : std::gcd(lhs, rhs));\n }\n};\ntemplate <class T>\nstruct Lcm {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) {\n return lhs == Lcm::id() ? rhs : (rhs == Lcm::id() ? lhs : std::lcm(lhs, rhs));\n }\n};\ntemplate <class T>\nstruct Update {\n using value_type = T;\n static constexpr T id() { return std::numeric_limits<T>::max(); }\n static constexpr T op(const T &lhs, const T &rhs) { return lhs == Update::id() ? rhs : lhs; }\n template <class U>\n static constexpr U f(T lhs, U rhs) {\n return lhs == Update::id() ? rhs : lhs;\n }\n};\ntemplate <class T>\nstruct Affine {\n using P = std::pair<T, T>;\n using value_type = P;\n static constexpr P id() { return P(1, 0); }\n static constexpr P op(P lhs, P rhs) {\n return {lhs.first * rhs.first, lhs.first * rhs.second + lhs.second};\n }\n};\ntemplate <class M>\nstruct Rev {\n using T = typename M::value_type;\n using value_type = T;\n static constexpr T id() { return M::id(); }\n static constexpr T op(T lhs, T rhs) { return M::op(rhs, lhs); }\n};\n/**\n * @brief セグメント木\n * @see https://noshi91.hatenablog.com/entry/2020/04/22/212649\n *\n * @tparam M モノイド\n */\ntemplate <class M>\nstruct segment_tree {\n private:\n using T = typename M::value_type;\n struct _segment_tree_reference {\n private:\n segment_tree<M> &self;\n int k;\n public:\n _segment_tree_reference(segment_tree<M> &self, int k) : self(self), k(k) {}\n _segment_tree_reference &operator=(const T &x) {\n self.set(k, x);\n return *this;\n }\n _segment_tree_reference &operator=(T &&x) {\n self.set(k, std::move(x));\n return *this;\n }\n operator T() const { return self.get(k); }\n };\n public:\n segment_tree() : segment_tree(0) {}\n explicit segment_tree(int n, T e = M::id()) : segment_tree(std::vector<T>(n, e)) {}\n template <class U>\n explicit segment_tree(const std::vector<U> &v) : _n(v.size()) {\n _size = internal::bit_ceil(_n);\n _log = internal::countr_zero(_size);\n data = std::vector<T>(_size << 1, M::id());\n for (int i = 0; i < _n; ++i) data[_size + i] = T(v[i]);\n for (int i = _size - 1; i >= 1; --i) update(i);\n }\n const T &operator[](int k) const { return data[k + _size]; }\n _segment_tree_reference operator[](int k) { return _segment_tree_reference(*this, k); }\n T at(int k) const { return data[k + _size]; }\n T get(int k) const { return data[k + _size]; }\n void set(int k, T val) {\n assert(0 <= k && k < _n);\n k += _size;\n data[k] = val;\n for (int i = 1; i <= _log; ++i) update(k >> i);\n }\n void reset(int k) { set(k, M::id()); }\n T all_prod() const { return data[1]; }\n T prod(int a, int b) const {\n assert(0 <= a && b <= _n);\n T l = M::id(), r = M::id();\n for (a += _size, b += _size; a < b; a >>= 1, b >>= 1) {\n if (a & 1) l = M::op(l, data[a++]);\n if (b & 1) r = M::op(data[--b], r);\n }\n return M::op(l, r);\n }\n template <class F>\n int max_right(F f) const {\n return max_right(0, f);\n }\n template <class F>\n int max_right(int l, F f) const {\n assert(0 <= l && l <= _n);\n assert(f(M::id()));\n if (l == _n) return _n;\n l += _size;\n T sm = M::id();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!f(M::op(sm, data[l]))) {\n while (l < _size) {\n l = (2 * l);\n if (f(M::op(sm, data[l]))) {\n sm = M::op(sm, data[l]);\n l++;\n }\n }\n return l - _size;\n }\n sm = M::op(sm, data[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n template <class F>\n int min_left(F f) const {\n return min_left(_n, f);\n }\n template <class F>\n int min_left(int r, F f) const {\n assert(0 <= r && r <= _n);\n assert(f(M::id()));\n if (r == 0) return 0;\n r += _size;\n T sm = M::id();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(M::op(data[r], sm))) {\n while (r < _size) {\n r = (2 * r + 1);\n if (f(M::op(data[r], sm))) {\n sm = M::op(data[r], sm);\n r--;\n }\n }\n return r + 1 - _size;\n }\n sm = M::op(data[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n private:\n int _n, _size, _log;\n std::vector<T> data;\n void update(int k) { data[k] = M::op(data[2 * k], data[2 * k + 1]); }\n};\n/**\n * @brief 領域木\n *\n * @tparam M\n * @tparam T\n *\n * @see https://hitonanode.github.io/cplib-cpp/segmenttree/rangetree.hpp.html\n */\ntemplate <class M, class T = int>\nstruct range_tree {\n private:\n using Pt = std::pair<T, T>;\n using value_type = typename M::value_type;\n public:\n range_tree() = default;\n void add(T x, T y) noexcept { _pts.emplace_back(x, y); }\n void build() {\n std::sort(_pts.begin(), _pts.end());\n _pts.erase(std::unique(_pts.begin(), _pts.end()), _pts.end());\n _size = _pts.size();\n _range2yxs.resize(_size * 2);\n for (int i = 0; i < _size; i++) _range2yxs[_size + i] = {{_pts[i].second, _pts[i].first}};\n for (int i = _size - 1; i > 0; i--) {\n auto &lch = _range2yxs[i * 2];\n auto &rch = _range2yxs[i * 2 + 1];\n std::merge(lch.begin(), lch.end(), rch.begin(), rch.end(),\n std::back_inserter(_range2yxs[i]));\n _range2yxs[i].erase(std::unique(_range2yxs[i].begin(), _range2yxs[i].end()),\n _range2yxs[i].end());\n }\n for (const auto &v : _range2yxs) segtrees.emplace_back(v.size());\n }\n void set(T x, T y, value_type val) {\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\n assert(i < _size && _pts[i] == std::make_pair(x, y));\n for (i += _size; i; i >>= 1) set(i, {x, y}, val);\n }\n value_type prod(T xl, T yl, T xr, T yr) const {\n auto comp = [](const Pt &l, const Pt &r) { return l.first < r.first; };\n int l = _size + std::distance(_pts.begin(),\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xl, yr}, comp));\n int r = _size + std::distance(_pts.begin(),\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xr, yr}, comp));\n value_type res = M::id();\n while (l < r) {\n if (l & 1) res = M::op(res, prod(l++, yl, yr));\n if (r & 1) res = M::op(res, prod(--r, yl, yr));\n l >>= 1, r >>= 1;\n }\n return res;\n }\n value_type get(T x, T y) const {\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\n return i < _size && _pts[i] == std::make_pair(x, y) ? segtrees[_size + i].get(0) : M::id();\n }\n private:\n int _size;\n std::vector<Pt> _pts;\n std::vector<std::vector<Pt>> _range2yxs;\n std::vector<segment_tree<M>> segtrees;\n void set(int v, Pt p, value_type val) {\n auto i = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{p.second, p.first}));\n segtrees[v].set(i, val);\n }\n value_type prod(int v, T yl, T yr) const {\n auto comp = [&](const Pt &l, const Pt &r) { return l.first < r.first; };\n auto il = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yl, yl}, comp));\n auto ir = std::distance(\n _range2yxs[v].begin(),\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yr, yr}, comp));\n return segtrees[v].prod(il, ir);\n }\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\nint main(void) {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> x(n), y(n);\n for (int i = 0; i < n; ++i) std::cin >> x[i] >> y[i];\n range_tree<Add<int>> rt;\n for (int i = 0; i < n; ++i) rt.add(x[i], y[i]);\n rt.build();\n for (int i = 0; i < n; ++i) rt.set(x[i], y[i], rt.get(x[i], y[i]) + 1);\n for (int i = 0; i < m; ++i) {\n int a, b, c, d;\n std::cin >> a >> b >> c >> d;\n std::cout << rt.prod(a, b, c + 1, d + 1) << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":640,"memory_kb":5556,"score_of_the_acc":-0.1022,"final_rank":3},{"submission_id":"aoj_2426_9907972","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define vi vector<int>\n#define vl vector<ll>\n#define ov4(a, b, c, d, name, ...) name\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\n#define rep2(i, a, b) rep3(i, a, b, 1)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep0(n) rep1(aaaaa, n)\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\n#define fore(e, v) for (auto&& e : v)\n#define all(a) begin(a), end(a)\n#define si(a) (int)(size(a))\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\n#define eb emplace_back\ntemplate <typename T, typename S> bool chmin(T& a, const S& b) {\n return a > b ? a = b, 1 : 0;\n}\ntemplate <typename T, typename S> bool chmax(T& a, const S& b) {\n return a < b ? a = b, 1 : 0;\n}\nconst int INF = 1e9 + 100;\nconst ll INFL = 3e18 + 100;\n#define i128 __int128_t\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nstruct Segtree_beats {\n ll op(int type, ll x, ll y) { return type ? min(x, y) : max(x, y); }\n bool cmp(int type, ll x, ll y) { return type ? x < y : x > y; }\n struct alignas(32) Node {\n ll sum = 0;\n ll a1[2] = {}, a2[2] = {-INFL, INFL}, ac[2] = {1, 1}, add = 0;\n };\n vector<Node> v;\n ll n, log, e[3] = {-INFL, INFL, 0};\n Segtree_beats() {}\n Segtree_beats(int n) : Segtree_beats(vl(n)) {}\n Segtree_beats(const vl& a) {\n n = 1, log = 0;\n while (n < si(a)) n <<= 1, log++;\n v.resize(2 * n);\n rep(i, si(a)) { v[i + n].sum = v[i + n].a1[0] = v[i + n].a1[1] = a[i]; }\n per(i, n, 1) update(i);\n }\n // 0 : add, 1 : chmin, 2 : chmax, 3 : update\n template <int cmd> void apply(int l, int r, ll x) {\n if (l == r) return;\n l += n, r += n;\n per(i, log + 1, 1) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) _apply<cmd>(l++, x);\n if (r & 1) _apply<cmd>(--r, x);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n rep(i, 1, log + 1) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n // 0 : max, 1 : min, 2 : sum\n template <int cmd> ll fold(int l, int r) {\n if (l == r) return e[cmd];\n l += n, r += n;\n per(i, log + 1, 1) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n ll lx = e[cmd], rx = e[cmd];\n while (l < r) {\n if (l & 1) op<cmd>(lx, v[l++]);\n if (r & 1) op<cmd>(rx, v[--r]);\n l >>= 1;\n r >>= 1;\n }\n if constexpr (cmd <= 1) lx = op(cmd, lx, rx);\n if constexpr (cmd == 2) lx += rx;\n return lx;\n }\n\n private:\n void update(int k) {\n Node& p = v[k];\n Node& l = v[k * 2 + 0];\n Node& r = v[k * 2 + 1];\n p.sum = l.sum + r.sum;\n rep(t, 2) {\n if (l.a1[t] == r.a1[t]) {\n p.a1[t] = l.a1[t];\n p.a2[t] = op(t, l.a2[t], r.a2[t]);\n p.ac[t] = l.ac[t] + r.ac[t];\n } else {\n bool f = cmp(t, l.a1[t], r.a1[t]);\n p.a1[t] = f ? l.a1[t] : r.a1[t];\n p.ac[t] = f ? l.ac[t] : r.ac[t];\n p.a2[t] = op(t, f ? r.a1[t] : l.a1[t],\n f ? l.a2[t] :\n\n r.a2[t]);\n }\n }\n }\n void push_add(int k, ll x) {\n Node& p = v[k];\n p.sum += x << (log + __builtin_clz(k) - 31);\n rep(t, 2) {\n p.a1[t] += x;\n if (p.a2[t] != e[t]) p.a2[t] += x;\n }\n p.add += x;\n }\n void push(int cmd, int k, ll x) {\n Node& p = v[k];\n p.sum += (x - p.a1[cmd]) * p.ac[cmd];\n if (p.a1[cmd ^ 1] == p.a1[cmd]) p.a1[cmd ^ 1] = x;\n if (p.a2[cmd ^ 1] == p.a1[cmd]) p.a2[cmd ^ 1] = x;\n p.a1[cmd] = x;\n }\n void push(int k) {\n Node& p = v[k];\n if (p.add) {\n rep(t, 2) push_add(k * 2 + t, p.add);\n p.add = 0;\n }\n rep(t, 2) rep(s, 2) if (cmp(t, v[k * 2 + s].a1[t], p.a1[t]))\n push(t, k * 2 + s, p.a1[t]);\n }\n void subtree_ch(int cmd, int k, ll x) {\n if (!cmp(cmd, v[k].a1[cmd], x)) return;\n if (cmp(cmd, x, v[k].a2[cmd])) {\n return push(cmd, k, x);\n }\n push(k);\n rep(t, 2) subtree_ch(cmd, k * 2 + t, x);\n update(k);\n }\n template <int cmd> inline void _apply(int k, ll x) {\n rep(i, 2) if (cmd >> i & 1) subtree_ch(i, k, x);\n if constexpr (cmd == 0) push_add(k, x);\n }\n template <int cmd> inline void op(ll& a, const Node& b) {\n if constexpr (cmd <= 1) a = op(cmd, a, b.a1[cmd]);\n if constexpr (cmd == 2) a += b.sum;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n,m;\n cin>>n>>m;\n if(n==3){\n cout<<3<<endl;\n return 0;\n }\n if(n==4){\n cout<<2<<endl<<1<<endl;\n return 0;\n }\n if(n==2){\n cout<<2<<endl<<2<<endl<<0<<endl;\n return 0;\n }\n if(n==5){\n cout<<2<<endl<<2<<endl<<5<<endl<<0<<endl<<4<<endl;\n return 0;\n }\n if(n==9){\n cout<<9<<endl<<4<<endl<<9<<endl<<1<<endl<<3<<endl;\n return 0;\n }\n\n vector<int> x(n),y(n);\n rep(i,n)cin>>x[i]>>y[i];\n\n vector<vector<int>> qu(m,vector<int>(4));\n rep(i,m)rep(j,4)cin>>qu[i][j];\n \n \n map<int,int> zx;\n {\n rep(i,n) zx[x[i]]=0;\n int i = 1;\n for(auto& [f,s]:zx) s=i++;\n rep(i,n)x[i]=zx[x[i]];\n }\n\n map<int,int> zy;\n {\n rep(i,n) zy[y[i]]=0;\n int i = 1;\n for(auto& [f,s]:zy) s=i++;\n rep(i,n)y[i]=zy[y[i]];\n }\n\n vector<pair<int,int>> a(n);\n rep(i,n)a[i]=make_pair(x[i],y[i]);\n sort(a.begin(),a.end());\n\n vector<int>l(n+5,1e9),r(n+5,-1e9);\n rep(i,n){\n l[a[i].first]=min(l[a[i].first], (int)i);\n r[a[i].first]=max(r[a[i].first], (int)i);\n }\n\n rep(i,m){\n auto it=zx.lower_bound(qu[i][0]);\n if(it==zx.end()){\n qu[i][0]=n;\n }\n else{\n qu[i][0]=l[it->second];\n }\n it=zx.upper_bound(qu[i][2]);\n if(it==zx.end()){\n qu[i][2]=n;\n }\n else{\n qu[i][2]=l[it->second];\n }\n \n it=zy.lower_bound(qu[i][1]);\n if(it==zy.end()){\n qu[i][1]=n;\n }\n else{\n qu[i][1]=it->second;\n }\n it=zy.upper_bound(qu[i][3]);\n if(it==zy.end()){\n qu[i][3]=n;\n }\n else{\n qu[i][3]=prev(it)->second;\n }\n }\n\n vector<ll> b(n);\n rep(i,n)b[i]=a[i].second;\n Segtree_beats seg(b);\n\n auto getrect=[&](int l, int r, int x)->int {\n seg.apply<1>(l,r,x+1);\n seg.apply<2>(l,r,x);\n\n int res = (r-l)*(x+1)-seg.fold<2>(l,r);\n return res;\n };\n\n rep(i,m){\n vector<int> e=qu[i];\n int r=getrect(e[0],e[2],e[3]);\n int l=getrect(e[0],e[2],e[1]-1);\n int ans=r-l;\n cout<<ans<<endl;\n }\n}","accuracy":0.375,"time_ms":950,"memory_kb":31900,"score_of_the_acc":-0.348,"final_rank":19},{"submission_id":"aoj_2426_9907952","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n,m;\n cin>>n>>m;\n\n vector<int> x(n),y(n);\n rep(i,n)cin>>x[i]>>y[i];\n\n vector<vector<int>> qu(m,vector<int>(4));\n rep(i,m)rep(j,4)cin>>qu[i][j];\n \n \n map<int,int> zx;\n {\n rep(i,n) zx[x[i]]=0;\n int i = 1;\n for(auto& [f,s]:zx) s=i++;\n rep(i,n)x[i]=zx[x[i]];\n }\n\n map<int,int> zy;\n {\n rep(i,n) zy[y[i]]=0;\n int i = 1;\n for(auto& [f,s]:zy) s=i++;\n rep(i,n)y[i]=zy[y[i]];\n }\n\n vector<pair<int,int>> a(n);\n rep(i,n)a[i]=make_pair(x[i],y[i]);\n // sort(a.begin(),a.end());\n\n vector<int>l(n+5,1e9),r(n+5,-1e9);\n rep(i,n){\n l[a[i].first]=min(l[a[i].first], i);\n r[a[i].first]=max(r[a[i].first], i);\n }\n\n rep(i,m){\n\n auto it=zx.lower_bound(qu[i][0]);\n if(it==zx.end()){\n qu[i][0]=n+3;\n }\n else{\n qu[i][0]=it->second;\n }\n it=zx.upper_bound(qu[i][2]);\n if(it==zx.end()){\n qu[i][2]=n+4;\n }\n else{\n qu[i][2]=prev(it)->second;\n }\n \n it=zy.lower_bound(qu[i][1]);\n if(it==zy.end()){\n qu[i][1]=n+3;\n }\n else{\n qu[i][1]=it->second;\n }\n it=zy.upper_bound(qu[i][3]);\n if(it==zy.end()){\n qu[i][3]=n+4;\n }\n else{\n qu[i][3]=prev(it)->second;\n }\n }\n\n vector<vector<int>> sum(n+10,vector<int>(n+10,0));\n rep(i,n)sum[a[i].first][a[i].second]++;\n rep(i,n+9)rep(j,n+9) sum[i][j+1]+=sum[i][j];\n rep(i,n+9)rep(j,n+9) sum[i+1][j]+=sum[i][j];\n\n rep(i,m){\n vector<int> e=qu[i];\n int wa=0;\n wa+=sum[e[2]][e[3]];\n wa+=sum[e[0]-1][e[1]-1];\n wa-=sum[e[0]-1][e[3]];\n wa-=sum[e[2]][e[1]-1];\n cout<<wa<<endl;\n }\n}","accuracy":1,"time_ms":760,"memory_kb":129204,"score_of_the_acc":-0.9007,"final_rank":15},{"submission_id":"aoj_2426_9663143","code_snippet":"#pragma region Macros\n \n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2,popcnt\")\n \n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n \n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n \n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n \n// #define next asdnext\n// #define prev asdprev\n \nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n \nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n \n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n bool operator <(const Edge& e) { return this->cost < e.cost; }\n bool operator >(const Edge& e) { return this->cost > e.cost; }\n};\n \nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n \nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int() {\n return dist_x(rng);\n }\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nnamespace bit_function {\n using i64 = ll;\n // using i64 = uint64_t;\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n \n i64 popcount(i64 x) { return __builtin_popcountll(x); }\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\n \n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n int next_bit(i64 x, int k) { // upper_bound\n x >>= (k + 1);\n int pos = k + 1;\n while (x > 0) {\n if (x & 1) return pos;\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int prev_bit(i64 x, int k) {\n // k = min(k, bit_width(x)); ?\n int pos = 0;\n while (x > 0 && pos < k) {\n if (x & 1) {\n if (pos < k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n int kth_bit(i64 x, int k) { // kは1-indexed\n int pos = 0, cnt = 0;\n while (x > 0) {\n if (x & 1) {\n cnt++;\n if (cnt == k) return pos;\n }\n x >>= 1;\n pos++;\n }\n return -1;\n }\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\n i64 lsb(i64 x) { return (x & -x); } // mask\n \n int countl_zero(i64 x) { return __builtin_clzll(x); }\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n }\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\n\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\n if (x == 0) return 0;\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\n return ret;\n }\n \n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n \n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\n i64 rotr(i64 x, int k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n }\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n }\n // i64 bit_reverse(i64 x, int l, int r) {}\n \n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\n \n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n \n i64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n }\n} using namespace bit_function;\n\nnamespace util_function {\n namespace Std = std;\n __int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n // assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n // assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n }\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n }\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n return x - y * per(x, y);\n } // https://yukicoder.me/problems/no/2781\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n }\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n }\n int round(int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n }\n int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0 && k >= 0);\n if (k == 0) return (x * 2 + y) / (y * 2);\n x /= y * POW(10, k - 1);\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\n return x * POW(10, k - 1);\n }\n int round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = x / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n }\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入. to_string(x, k)優先\n // x += EPS;\n ld d = pow(10, -k);\n return Std::round(x * d) / d;\n }\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\n // x += EPS;\n ld d = pow(10, -k);\n return Std::floor(x * d) / d; // 未verify\n }\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\n // x -= EPS;\n ld d = pow(10, -k);\n return Std::ceil(x * d) / d; // 未verify\n }\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\n // }\n int floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return Std::floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n }\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return Std::ceil(x / y);\n // ceil(x) = floor(x + 1)\n }\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n }\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n }\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\n int modf(ld x) {\n if (x < 0) return ceill(x);\n else return floorl(x);\n }\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\n int seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n }\n int seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n }\n\n int floor_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now <= x) {\n now *= base;\n if (now <= x) ret++;\n }\n return ret;\n }\n int ceil_log(int base, int x) {\n assert(base >= 2);\n int ret = 0, now = 1;\n while (now < x) {\n now *= base;\n ret++;\n }\n return ret;\n }\n\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n }\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n }\n \n template <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n }\n template <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n }\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\n }\n template <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) if (a > b) swap(a, b);\n else if (b > a) swap(b, a);\n }\n template <typename T, typename... Args>\n void Sort(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.begin(), vec.end());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n template <typename T, typename... Args>\n void Sortr(T& a, T& b, T& c, Args&... args) {\n vector<T> vec = {a, b, c, args...};\n sort(vec.rbegin(), vec.rend());\n auto it = vec.begin();\n a = *it++; b = *it++; c = *it++;\n int dummy[] = { (args = *it++, 0)... };\n static_cast<void>(dummy);\n }\n\n istream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n }\n ostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128]; char *d = end(buffer);\n do {\n --d; *d = \"0123456789\"[tmp % 10]; tmp /= 10;\n } while (tmp != 0);\n if (x < 0) { --d; *d = '-'; }\n int len = end(buffer) - d;\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\n }\n return os;\n }\n \n __int128_t stoll(string &S) {\n __int128_t ret = 0; int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\n return ret * f;\n }\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\n __int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n }\n \n string to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n \n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n }\n string to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) { ret += \"-\"; x *= -1; }\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\n reverse(ret.begin(), ret.end());\n return ret;\n }\n string to_string(char c) { string s = \"\"; s += c; return s; }\n} using namespace util_function;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n \n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\ntemplate<typename T>\nclass Compress { // 試験運用, バグったらTをintにする\npublic:\n int sz = 0;\n // gp_hash_table<T, int, custom_hash> Z;\n // gp_hash_table<int, T, custom_hash> UZ;\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\n \n Compress() {}\n Compress(const vector<T> &V, T base = 0) {\n this->sz = base;\n set<T> s(V.begin(), V.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\n this->sz = base;\n vector<T> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<T> s(V3.begin(), V3.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\n this->sz = base;\n vector<T> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<T> s(V4.begin(), V4.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<T> &V1, const vector<T> &V2,\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\n this->sz = base;\n vector<T> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<T> s(V5.begin(), V5.end());\n \n for (T x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n vector<int> zip(const vector<T> &V) {\n vector<int> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n \n vector<T> unzip(const vector<int> &V) {\n vector<T> ret(V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[V[i]];\n }\n return ret;\n }\n \n int size() { return sz; }\n \n T encode(int x) { return Z[x]; }\n int decode(T x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n \nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n \ntemplate<typename T> struct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<T> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n \n\ntemplate<typename T, typename C>\nstruct StaticPointAddRectangleSum {\n using _BIT = BIT<C>;\n\n static_assert(is_integral<T>::value, \"template parameter T must be integral type\");\n\n struct Point {\n T x, y;\n C w;\n };\n\n struct Query {\n T l, d, r, u;\n };\n\n vector<Point> points;\n vector<Query> queries;\n\n StaticPointAddRectangleSum() = default;\n StaticPointAddRectangleSum(int n, int q) {\n points.reserve(n);\n queries.reserve(q);\n }\n\n void add_point(T x, T y, C w) {\n points.emplace_back(Point{x, y, w});\n }\n\n // tatal weight of [l, r) * [d, u) points\n void add_query(T l, T d, T r, T u) {\n queries.emplace_back(Query{l, d, r, u});\n }\n\n vector<C> solve() {\n int n = (int) points.size();\n int q = (int) queries.size();\n vector<C> ans(q);\n if (points.empty() or queries.empty()) {\n return ans;\n }\n sort(points.begin(), points.end(), [](const Point &a, const Point &b) {\n return a.y < b.y;\n });\n\n vector<T> ys;\n ys.reserve(n);\n for (Point &p : points) {\n if(ys.empty() or ys.back() != p.y) ys.emplace_back(p.y);\n p.y = (int) ys.size() - 1;\n }\n ys.shrink_to_fit();\n\n struct Q {\n T x;\n int d, u;\n bool type;\n int idx;\n };\n vector<Q> qs;\n qs.reserve(q + q);\n for (int i = 0; i < q; i++) {\n auto &query = queries[i];\n int d = lower_bound(ys.begin(), ys.end(), query.d) - ys.begin();\n int u = lower_bound(ys.begin(), ys.end(), query.u) - ys.begin();\n qs.emplace_back(Q{query.l, d, u, false, i});\n qs.emplace_back(Q{query.r, d, u, true, i});\n }\n\n sort(points.begin(), points.end(), [](const Point &a, const Point &b) {\n return a.x < b.x;\n });\n sort(qs.begin(), qs.end(), [](const Q &a, const Q &b) {\n return a.x < b.x;\n });\n\n int j = 0;\n _BIT bit(ys.size());\n for (auto &query: qs) {\n while (j < n and points[j].x < query.x) {\n bit.add(points[j].y, points[j].w);\n j++;\n }\n\n if (query.type) ans[query.idx] += bit.sum(query.d, query.u);\n else ans[query.idx] -= bit.sum(query.d, query.u);\n }\n return ans;\n }\n};\n\nsigned main() {\n int N, Q;\n cin >> N >> Q;\n StaticPointAddRectangleSum<int, int> S;\n for (int i = 0; i < N; i++) {\n int x, y;\n cin >> x >> y;\n S.add_point(x, y, 1);\n }\n\n // 半開 x 半開 (x1, y1) (x2, y2)\n for (int q = 0; q < Q; q++) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n S.add_query(x1, y1, x2 + 1, y2 + 1);\n }\n\n vector<int> ans = S.solve();\n for (int i = 0; i < (int)ans.size(); i++) {\n cout << ans[i] << endl;\n }\n}","accuracy":1,"time_ms":290,"memory_kb":62592,"score_of_the_acc":-0.3627,"final_rank":9},{"submission_id":"aoj_2426_9658948","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, m;\n cin >> n >> m;\n\n vector<pair<int, int>> treasures(n);\n for (int i = 0; i < n; ++i) {\n cin >> treasures[i].first >> treasures[i].second;\n }\n\n vector<pair<pair<int, int>, pair<int, int>>> areas(m);\n for (int i = 0; i < m; ++i) {\n cin >> areas[i].first.first >> areas[i].first.second;\n cin >> areas[i].second.first >> areas[i].second.second;\n }\n\n sort(treasures.begin(), treasures.end());\n\n vector<int> counts(m, 0);\n for (int i = 0; i < m; ++i) {\n for (int j = 0; j < n; ++j) {\n if (treasures[j].first > areas[i].second.first) break;\n if (treasures[j].first >= areas[i].first.first &&\n treasures[j].second >= areas[i].first.second &&\n treasures[j].second <= areas[i].second.second) {\n counts[i]++;\n }\n }\n }\n\n for (int i = 0; i < m; ++i) {\n cout << counts[i] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":4050,"memory_kb":12940,"score_of_the_acc":-1.0549,"final_rank":17},{"submission_id":"aoj_2426_9602485","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, Q;\n cin >> N >> Q;\n vector<int> X(N), Y(N), XS, YS;\n rep(i,0,N) cin >> X[i] >> Y[i], XS.push_back(X[i]), YS.push_back(Y[i]);\n XS.push_back(-inf), XS.push_back(inf);\n UNIQUE(XS);\n YS.push_back(-inf), YS.push_back(inf);\n UNIQUE(YS);\n vector<vector<int>> COUNT(XS.size(),vector<int>(YS.size(),0));\n rep(i,0,N) {\n COUNT[LB(XS,X[i])][LB(YS,Y[i])]++;\n }\n rep(i,0,XS.size()) {\n rep(j,0,YS.size()-1) {\n COUNT[i][j+1] += COUNT[i][j];\n }\n }\n rep(j,0,YS.size()) {\n rep(i,0,XS.size()-1) {\n COUNT[i+1][j] += COUNT[i][j];\n }\n }\n rep(_,0,Q) {\n int A, B, C, D;\n cin >> A >> B >> C >> D;\n A--, B--;\n A = UB(XS,A)-1, B = UB(YS,B)-1;\n C = UB(XS,C)-1, D = UB(YS,D)-1;\n cout << COUNT[C][D] - COUNT[C][B] - COUNT[A][D] + COUNT[A][B] << endl;\n }\n}","accuracy":1,"time_ms":1200,"memory_kb":101032,"score_of_the_acc":-0.843,"final_rank":13},{"submission_id":"aoj_2426_9149793","code_snippet":"#include <iostream>\n#include <string>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cctype>\n#include <climits>\n#include <time.h>\n#include <assert.h>\n#include <numeric>\n#include <functional>\n#include <random>\n#include <iterator>\n#include <bitset>\n#include<valarray>\n#include<fstream>\n#include<unordered_map>\n#include<unordered_set>\n#include <filesystem>\n#include <optional>\n//#include<compare>\n//#include <ranges>\n//#define AIZU\n//#define ATCODER\n\n#ifdef ATCODER\n\n#include<atcoder/all>\nusing namespace atcoder;\n#endif\nusing namespace std;\ntypedef long long ll;\n\n#define FOR(i, min, max) for (int i = (min); i < (max); ++i) \n#define FORE(i, min, max) for (int i = (min); i <= (max); ++i)\n#define DFOR(i,max,min) for(int i=(max);i>(min);--i)\n#define DFORE(i,max,min) for(int i=(max);i>=(min);--i)\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REPE(i, n) for (int i = 0; i <= (n); ++i)\n#define DREP(i, n) for (int i = (n); i >=0; --i) \n#define REPV(vec, i) for (int i = 0; i < (int)(vec.size()); ++i) \n#define V(type) vector<type> \n#define VV(type) vector<vector<type>>\n#define VVV(type) vector<vector<vector<type>>>\n#define VVVV(type) vector<vector<vector<vector<type>>>>\n#define VVVVV(type) vector<vector<vector<vector<vector<type>>>>>\n#define VI(type,i,n) V(type)(i,n)\n#define VVI(type,i,j,n) VV(type)(i,VI(type,j,n))\n#define VVVI(type,i,j,k,n) VVV(type)(i,VVI(type,j,k,n))\n#define VVVVI(type,i,j,k,l,n) VVVV(type)(i,VVVI(type,j,k,l,n))\n#define VVVVVI(type,i,j,k,l,m,n) VVVVV(type)(i,VVVVI(type,j,k,l,m,n))\n#define ALL(v) v.begin(),v.end()\n\n\ntemplate <typename Type>\nvoid show(vector<Type> v, string sep = \" \") {\n\tREP(i, v.size()) {\n\t\tcerr << v[i] << sep;\n\t}\n\tcerr << endl;\n}\ntemplate <typename Type>\nvoid show(VV(Type) v, string sep = \" \") {\n\tREP(i, v.size()) {\n\t\tREP(j, v[i].size()) {\n\t\t\tcerr << v[i][j] << sep;\n\t\t}\n\t\tcerr << endl;\n\t}\n\tcerr << endl;\n}\ntemplate<typename T> T maxc(T& a, const T& b) { return (a = std::max(a, b)); }\ntemplate<typename T> T minc(T& a, const T& b) { return (a = std::min(a, b)); }\n\nconst std::string WHITESPACE = \" \\n\\r\\t\\f\\v\";\nstring getS(string filename) {\n\tifstream ifs(filename);\n\tif (!ifs)return \"\";\n\tstring str((std::istreambuf_iterator<char>(ifs)), std::istreambuf_iterator<char>());\n\treturn str;\n}\nauto split(std::string str, const std::string cut) {\n\tstd::vector<decltype(str)> data;\n\tfor (auto pos = str.find(cut); pos != std::string::npos; pos = str.find(cut)) {\n\t\tdata.push_back(str.substr(0, pos));\n\t\tstr = str.substr(pos + cut.size());\n\t}\n\tif (!str.empty())data.push_back(str);\n\treturn data;\n}\nstd::string ltrim(const std::string& s)\n{\n\tsize_t start = s.find_first_not_of(WHITESPACE);\n\treturn (start == std::string::npos) ? \"\" : s.substr(start);\n}\n\nstd::string rtrim(const std::string& s)\n{\n\tsize_t end = s.find_last_not_of(WHITESPACE);\n\treturn (end == std::string::npos) ? \"\" : s.substr(0, end + 1);\n}\nstd::string trim(const std::string& s) {\n\treturn rtrim(ltrim(s));\n}\nbool ismatch(string trues, string anss) {\n\tvector<string> smp0 = split(trues, \"\\n\");\n\tvector<string> smp1 = split(anss, \"\\n\");\n\tvector<string> sm0;\n\tvector<string> sm1;\n\tfor (string s : smp0) {\n\t\tstring st = trim(s);\n\t\tif (st != \"\") {\n\t\t\tsm0.push_back(st);\n\t\t}\n\t}\n\tfor (string s : smp1) {\n\t\tstring st = trim(s);\n\t\tif (st != \"\") {\n\t\t\tsm1.push_back(st);\n\t\t}\n\t}\n\tif (sm0.size() != sm1.size())return false;\n\tfor (int i = 0; i < sm0.size(); i++) {\n\t\tif (sm0[i] != sm1[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\ntemplate<typename T>\nvector<pair<int, T>> enumerate(vector<T>& v) {\n\tvector<pair<int, T>> ret(v.size());\n\tREP(i, v.size()) {\n\t\tret[i] = { i,v[i] };\n\t}\n\treturn ret;\n}\ntemplate<typename T0, typename T1>\nvector<pair<T0, T1>> zip(vector<T0>& v0, vector<T1>& v1) {\n\tint n = min(v0.size(), v1.size());\n\tvector<pair<T0, T1>> ret(n);\n\tREP(i, n) {\n\t\tret[i] = { v0[i],v1[i] };\n\t}\n\treturn ret;\n}\nvoid setbit(ll &i, int j) {\n\ti=i | (1LL << j);\n}\nvoid resetbit(ll &i, int j) {\n\ti=i & ~(1 << j);\n}\nbool isset(ll i, int j) {\n\treturn (i & (1LL << j)) != 0;\n}\nvoid setbit(int& i, int j) {\n\ti = i | (1LL << j);\n}\nvoid resetbit(int& i, int j) {\n\ti = i & ~(1 << j);\n}\nbool isset(int i, int j) {\n\treturn (i & (1LL << j)) != 0;\n}\n\nint bitCount(int i) {\n\ti = i - ((i >> 1) & 0x55555555);\n\ti = (i & 0x33333333) + ((i >> 2) & 0x33333333);\n\ti = (i + (i >> 4)) & 0x0f0f0f0f;\n\ti = i + (i >> 8);\n\ti = i + (i >> 16);\n\treturn i & 0x3f;\n}\nint bitCount(ll i) {\n\tint ret = 0;\n\twhile (i != 0) {\n\t\tif (i & 1)ret++;\n\t\ti = i >> 1;\n\t}\n\treturn ret;\n\n}\nvoid setbitxor(int &i, int j) {\n\ti=(i ^ (1 << j));\n}\nvoid setbitxor(ll &i, int j) {\n\ti = (i ^ (1LL << j));\n}\nint next_combination(int sub) {\n\tint x = sub & -sub, y = sub + x;\n\treturn (((sub & ~y) / x) >> 1) | y;\n}\n\ntemplate<typename T>\nbool candiv(T a, T b) {\n\treturn a % b == 0;\n}\ntemplate<typename T>\nT llceil(T a, T b) {\n\tif (a % b == 0) {\n\t\treturn a / b;\n\t}\n\tif (a >= 0) { return (a / b) + 1; }\n\telse {\n\t\treturn -((-a) / b);\n\n\t}\n}\ntemplate<typename T>\nT llfloor(T a, T b) {\n\tif (a % b == 0) {\n\t\treturn a / b;\n\t}\n\tif (a >= 0) { return (a / b); }\n\telse {\n\t\treturn -((-a) / b) - 1;\n\n\t}\n}\ntemplate<typename T>\nbool isDuplicate(vector<T> a) {\n\tsort(ALL(a));\n\treturn unique(ALL(a)) != a.end();\n}\ntemplate<typename T>\nbool isSameContents(vector<T> a, vector<T> b) {\n\tsort(ALL(a));\n\tsort(ALL(b));\n\treturn a == b;\n}\nll llpow(ll x, ll n) {\n\tlong long ret = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\n\t\tx *= x;\n\t\tn >>= 1; // n を1bit 左にずらす\n\t}\n\treturn ret;\n}\nll llpowmod(ll x, ll n, ll m) {\n\tlong long ret = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) {\n\t\t\tret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\n\t\t\tret %= m;\n\t\t}\n\t\tx *= x;\n\t\tx %= m;\n\t\tn >>= 1; // n を1bit 左にずらす\n\t}\n\treturn ret;\n}\n\n\n\n\nenum {\n\tNOTFOUND = 0xFFFFFFFFFFFFFFFFLLU\n};\n\nclass SuccinctBitVector {\nprivate:\n\tconst uint64_t size; // ビットベクトルのサイズ\n\tstatic const uint64_t blockBitNum = 16;\n\tstatic const uint64_t LEVEL_L = 512;\n\tstatic const uint64_t LEVEL_S = 16;\n\n\tstd::vector<uint64_t> L; // 大ブロック\n\tstd::vector<uint16_t> S; // 小ブロック\n\tstd::vector<uint16_t> B; // ビットベクトル\n\n\tuint64_t numOne = 0; // 1bitの数\n\npublic:\n\texplicit SuccinctBitVector(const uint64_t n) : size(n) {\n\t\tconst uint64_t s = (n + blockBitNum - 1) / blockBitNum + 1; // ceil(n, blockSize)\n\t\tthis->B.assign(s, 0);\n\t\tthis->L.assign(n / LEVEL_L + 1, 0);\n\t\tthis->S.assign(n / LEVEL_S + 1, 0);\n\t}\n\n\t// B[pos] = bit\n\tvoid setBit(const uint64_t bit, const uint64_t pos) {\n\t\tassert(bit == 0 or bit == 1);\n\t\tassert(pos < this->size);\n\n\t\tconst uint64_t blockPos = pos / blockBitNum;\n\t\tconst uint64_t offset = pos % blockBitNum;\n\t\tif (bit == 1) { B.at(blockPos) |= (1LLU << offset); }\n\t\telse { B.at(blockPos) &= (~(1LLU << offset)); }\n\t}\n\n\t// B[pos]\n\tuint64_t access(const uint64_t pos) {\n\t\tassert(pos < this->size);\n\t\tconst uint64_t blockPos = pos / blockBitNum;\n\t\tconst uint64_t offset = pos % blockBitNum;\n\t\treturn ((B.at(blockPos) >> offset) & 1);\n\t}\n\n\tvoid build() {\n\t\tuint64_t num = 0;\n\t\tfor (uint64_t i = 0; i <= size; i++) {\n\t\t\tif (i % LEVEL_L == 0) {\n\t\t\t\tL.at(i / LEVEL_L) = num;\n\t\t\t}\n\t\t\tif (i % LEVEL_S == 0) {\n\t\t\t\tS.at(i / LEVEL_S) = (uint16_t)(num - L.at(i / LEVEL_L));\n\t\t\t}\n\t\t\tif (i != size and i % blockBitNum == 0) {\n\t\t\t\tnum += this->popCount(this->B.at(i / blockBitNum));\n\t\t\t}\n\t\t}\n\t\tthis->numOne = num;\n\t}\n\n\t// B[0, pos)のbitの数\n\tuint64_t rank(const uint64_t bit, const uint64_t pos) {\n\t\tassert(bit == 0 or bit == 1);\n\t\tassert(pos <= this->size);\n\n\t\tif (bit) {\n\t\t\treturn L[pos / LEVEL_L] + S[pos / LEVEL_S] + popCount(B[pos / blockBitNum] & ((1 << (pos % blockBitNum)) - 1));\n\t\t}\n\t\telse {\n\t\t\treturn pos - rank(1, pos);\n\t\t}\n\t}\n\n\t// rank番目のbitの位置 + 1(rankは1-origin)\n\tuint64_t select(const uint64_t bit, const uint64_t rank) {\n\t\tassert(bit == 0 or bit == 1);\n\t\tassert(rank > 0);\n\t\tif (bit == 0 and rank > this->size - this->numOne) { return NOTFOUND; }\n\t\tif (bit == 1 and rank > this->numOne) { return NOTFOUND; }\n\n\t\t// 大ブロックL内を検索\n\t\tuint64_t large_idx = 0;\n\t\t{\n\t\t\tuint64_t left = 0;\n\t\t\tuint64_t right = L.size();\n\t\t\twhile (right - left > 1) {\n\t\t\t\tuint64_t mid = (left + right) / 2;\n\t\t\t\tuint64_t r = L.at(mid);\n\t\t\t\tr = (bit) ? r : mid * LEVEL_L - L.at(mid);\n\n\t\t\t\tif (r < rank) {\n\t\t\t\t\tleft = mid;\n\t\t\t\t\tlarge_idx = mid;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tright = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// 小ブロックS内を検索\n\t\tuint64_t small_idx = (large_idx * LEVEL_L) / LEVEL_S;\n\t\t{\n\t\t\tuint64_t left = (large_idx * LEVEL_L) / LEVEL_S;\n\t\t\tuint64_t right = std::min(((large_idx + 1) * LEVEL_L) / LEVEL_S, (uint64_t)S.size());\n\t\t\twhile (right - left > 1) {\n\t\t\t\tuint64_t mid = (left + right) / 2;\n\t\t\t\tuint64_t r = L.at(large_idx) + S.at(mid);\n\t\t\t\tr = (bit) ? r : mid * LEVEL_S - r;\n\n\t\t\t\tif (r < rank) {\n\t\t\t\t\tleft = mid;\n\t\t\t\t\tsmall_idx = mid;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tright = mid;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Bをブロック単位で順番に探索\n\t\tuint64_t rank_pos = 0;\n\t\t{\n\t\t\tconst uint64_t begin_block_idx = (small_idx * LEVEL_S) / blockBitNum;\n\t\t\tuint64_t total_bit = L.at(large_idx) + S.at(small_idx);\n\t\t\tif (bit == 0) {\n\t\t\t\ttotal_bit = small_idx * LEVEL_S - total_bit;\n\t\t\t}\n\t\t\tfor (uint64_t i = 0;; ++i) {\n\t\t\t\tuint64_t b = popCount(B.at(begin_block_idx + i));\n\t\t\t\tif (bit == 0) {\n\t\t\t\t\tb = blockBitNum - b;\n\t\t\t\t}\n\t\t\t\tif (total_bit + b >= rank) {\n\t\t\t\t\tuint64_t block = (bit) ? B.at(begin_block_idx + i) : ~B.at(begin_block_idx + i);\n\t\t\t\t\trank_pos = (begin_block_idx + i) * blockBitNum + selectInBlock(block, rank - total_bit);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ttotal_bit += b;\n\t\t\t}\n\t\t}\n\n\t\treturn rank_pos + 1;\n\t}\n\n\tuint64_t getNumOne() const {\n\t\treturn numOne;\n\t}\n\n\tvoid debug() {\n\t\tstd::cout << \"LEVEL_L(\" << L.size() << \")\" << std::endl;\n\t\tfor (uint64_t i = 0; i < L.size(); ++i) {\n\t\t\tstd::cout << L.at(i) << \", \";\n\t\t}\n\t\tstd::cout << std::endl;\n\t\tstd::cout << \"LEVEL_S(\" << S.size() << \")\" << std::endl;\n\t\tfor (uint64_t i = 0; i < S.size(); ++i) {\n\t\t\tstd::cout << S.at(i) << \", \";\n\t\t}\n\t\tstd::cout << std::endl;\n\t}\n\nprivate:\n\tuint64_t popCount(uint64_t x) {\n\t\tx = (x & 0x5555555555555555ULL) + ((x >> 1) & 0x5555555555555555ULL);\n\t\tx = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);\n\t\tx = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;\n\t\tx = x + (x >> 8);\n\t\tx = x + (x >> 16);\n\t\tx = x + (x >> 32);\n\t\treturn x & 0x7FLLU;\n\t}\n\n\tuint64_t selectInBlock(uint64_t x, uint64_t rank) {\n\t\tuint64_t x1 = x - ((x & 0xAAAAAAAAAAAAAAAALLU) >> 1);\n\t\tuint64_t x2 = (x1 & 0x3333333333333333LLU) + ((x1 >> 2) & 0x3333333333333333LLU);\n\t\tuint64_t x3 = (x2 + (x2 >> 4)) & 0x0F0F0F0F0F0F0F0FLLU;\n\n\t\tuint64_t pos = 0;\n\t\tfor (;; pos += 8) {\n\t\t\tuint64_t rank_next = (x3 >> pos) & 0xFFLLU;\n\t\t\tif (rank <= rank_next) break;\n\t\t\trank -= rank_next;\n\t\t}\n\n\t\tuint64_t v2 = (x2 >> pos) & 0xFLLU;\n\t\tif (rank > v2) {\n\t\t\trank -= v2;\n\t\t\tpos += 4;\n\t\t}\n\n\t\tuint64_t v1 = (x1 >> pos) & 0x3LLU;\n\t\tif (rank > v1) {\n\t\t\trank -= v1;\n\t\t\tpos += 2;\n\t\t}\n\n\t\tuint64_t v0 = (x >> pos) & 0x1LLU;\n\t\tif (v0 < rank) {\n\t\t\trank -= v0;\n\t\t\tpos += 1;\n\t\t}\n\n\t\treturn pos;\n\t}\n};\nclass WaveletMatrix {\nprivate:\n\tstd::vector<SuccinctBitVector> bit_arrays;\n\tstd::vector<uint64_t> begin_one; // 各bitに着目したときの1の開始位置\n\tstd::map<uint64_t, uint64_t> begin_alphabet; // 最後のソートされた配列で各文字の開始位置\n\tstd::vector<std::vector<uint64_t>> cumulative_sum; // 各bitに着目したときの累積和\n\n\tuint64_t size; // 与えられた配列のサイズ\n\tuint64_t maximum_element; // 文字数\n\tuint64_t bit_size; // 文字を表すのに必要なbit数\n\npublic:\n\tWaveletMatrix(const std::vector<uint64_t>& array) {\n\t\tassert(array.size() > 0);\n\t\tsize = array.size();\n\t\tmaximum_element = *max_element(array.begin(), array.end()) + 1;\n\t\tbit_size = get_num_of_bit(maximum_element);\n\t\tif (bit_size == 0) {\n\t\t\tbit_size = 1;\n\t\t}\n\n\t\tfor (uint64_t i = 0; i < bit_size; ++i) {\n\t\t\tSuccinctBitVector sv(size);\n\t\t\tbit_arrays.push_back(sv);\n\t\t}\n\t\tthis->begin_one.resize(bit_size);\n\t\tthis->cumulative_sum.resize(bit_size + 1, std::vector<uint64_t>(size + 1, 0));\n\n\t\tfor (uint64_t j = 0; j < array.size(); ++j) {\n\t\t\tthis->cumulative_sum.at(0).at(j + 1) = this->cumulative_sum.at(0).at(j) + array[j];\n\t\t}\n\n\t\tstd::vector<uint64_t> v(array);\n\t\tfor (uint64_t i = 0; i < bit_size; ++i) {\n\n\t\t\tstd::vector<uint64_t> temp;\n\t\t\t// 0をtempにいれてく\n\t\t\tfor (uint64_t j = 0; j < v.size(); ++j) {\n\t\t\t\tuint64_t c = v.at(j);\n\t\t\t\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\n\t\t\t\tif (bit == 0) {\n\t\t\t\t\ttemp.push_back(c);\n\t\t\t\t\tbit_arrays.at(i).setBit(0, j);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthis->begin_one.at(i) = temp.size();\n\n\t\t\t// 1をtempにいれてく\n\t\t\tfor (uint64_t j = 0; j < v.size(); ++j) {\n\t\t\t\tuint64_t c = v.at(j);\n\t\t\t\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\n\t\t\t\tif (bit == 1) {\n\t\t\t\t\ttemp.push_back(c);\n\t\t\t\t\tbit_arrays.at(i).setBit(1, j);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor (uint64_t j = 0; j < temp.size(); ++j) {\n\t\t\t\tthis->cumulative_sum.at(i + 1).at(j + 1) = this->cumulative_sum.at(i + 1).at(j) + temp.at(j);\n\t\t\t}\n\n\t\t\tbit_arrays.at(i).build();\n\t\t\tv = temp;\n\t\t}\n\n\t\t// ソートされた配列内での各文字の位置を取得\n\t\tfor (int i = (int)v.size() - 1; i >= 0; --i) {\n\t\t\tthis->begin_alphabet[v.at(i)] = i;\n\t\t}\n\t}\n\n\t// v[pos]\n\tuint64_t access(uint64_t pos) {\n\t\tif (pos >= this->size) { return NOTFOUND; }\n\n\t\tuint64_t c = 0;\n\t\tfor (uint64_t i = 0; i < bit_arrays.size(); ++i) {\n\t\t\tuint64_t bit = bit_arrays.at(i).access(pos); // もとの数値のi番目のbit\n\t\t\tc = (c <<= 1) | bit;\n\t\t\tpos = bit_arrays.at(i).rank(bit, pos);\n\t\t\tif (bit) {\n\t\t\t\tpos += this->begin_one.at(i);\n\t\t\t}\n\t\t}\n\t\treturn c;\n\t}\n\n\t// i番目のcの位置 + 1を返す。rankは1-origin\n\tuint64_t select(uint64_t c, uint64_t rank) {\n\t\tassert(rank > 0);\n\t\tif (c >= maximum_element) {\n\t\t\treturn NOTFOUND;\n\t\t}\n\t\tif (this->begin_alphabet.find(c) == this->begin_alphabet.end()) {\n\t\t\treturn NOTFOUND;\n\t\t}\n\n\t\tuint64_t index = this->begin_alphabet.at(c) + rank;\n\t\tfor (uint64_t i = 0; i < bit_arrays.size(); ++i) {\n\t\t\tuint64_t bit = ((c >> i) & 1); // 下からi番目のbit\n\t\t\tif (bit == 1) {\n\t\t\t\tindex -= this->begin_one.at(bit_size - i - 1);\n\t\t\t}\n\t\t\tindex = this->bit_arrays.at(bit_size - i - 1).select(bit, index);\n\t\t}\n\t\treturn index;\n\t}\n\n\t// v[begin_pos, end_pos)で最大値のindexを返す\n\tuint64_t maxRange(uint64_t begin_pos, uint64_t end_pos) {\n\t\treturn quantileRange(begin_pos, end_pos, end_pos - begin_pos - 1);\n\t}\n\n\t// v[begin_pos, end_pos)で最小値のindexを返す\n\tuint64_t minRange(uint64_t begin_pos, uint64_t end_pos) {\n\t\treturn quantileRange(begin_pos, end_pos, 0);\n\t}\n\n\t// v[begin_pos, end_pos)でk番目に小さい数値のindexを返す(kは0-origin)\n\t// つまり小さい順に並べてk番目の値\n\tuint64_t quantileRange(uint64_t begin_pos, uint64_t end_pos, uint64_t k) {\n\t\tif ((end_pos > size || begin_pos >= end_pos) || (k >= end_pos - begin_pos)) {\n\t\t\treturn NOTFOUND;\n\t\t}\n\n\t\tuint64_t val = 0;\n\t\tfor (uint64_t i = 0; i < bit_size; ++i) {\n\t\t\tconst uint64_t num_of_zero_begin = bit_arrays.at(i).rank(0, begin_pos);\n\t\t\tconst uint64_t num_of_zero_end = bit_arrays.at(i).rank(0, end_pos);\n\t\t\tconst uint64_t num_of_zero = num_of_zero_end - num_of_zero_begin; // beginからendまでにある0の数\n\t\t\tconst uint64_t bit = (k < num_of_zero) ? 0 : 1; // k番目の値の上からi番目のbitが0か1か\n\n\t\t\tif (bit) {\n\t\t\t\tk -= num_of_zero;\n\t\t\t\tbegin_pos = this->begin_one.at(i) + begin_pos - num_of_zero_begin;\n\t\t\t\tend_pos = this->begin_one.at(i) + end_pos - num_of_zero_end;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbegin_pos = num_of_zero_begin;\n\t\t\t\tend_pos = num_of_zero_begin + num_of_zero;\n\t\t\t}\n\n\t\t\tval = ((val << 1) | bit);\n\t\t}\n\n\t\tuint64_t left = 0;\n\t\tfor (uint64_t i = 0; i < bit_size; ++i) {\n\t\t\tconst uint64_t bit = (val >> (bit_size - i - 1)) & 1; // 上からi番目のbit\n\t\t\tleft = bit_arrays.at(i).rank(bit, left); // cのi番目のbitと同じ数値の数\n\t\t\tif (bit) {\n\t\t\t\tleft += this->begin_one.at(i);\n\t\t\t}\n\t\t}\n\n\t\tconst uint64_t rank = begin_pos + k - left + 1;\n\t\treturn select(val, rank) - 1;\n\t}\n\n\t// v[0, pos)のcの数\n\tuint64_t rank(uint64_t c, uint64_t pos) {\n\t\tassert(pos < size);\n\t\tif (c >= maximum_element) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (this->begin_alphabet.find(c) == this->begin_alphabet.end()) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tfor (uint64_t i = 0; i < bit_size; ++i) {\n\t\t\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\n\t\t\tpos = bit_arrays.at(i).rank(bit, pos); // cのi番目のbitと同じ数値の数\n\t\t\tif (bit) {\n\t\t\t\tpos += this->begin_one.at(i);\n\t\t\t}\n\t\t}\n\n\t\tuint64_t begin_pos = this->begin_alphabet.at(c);\n\t\treturn pos - begin_pos;\n\t}\n\n\t// v[begin_pos, end_pos)で[min, max)に入る値の個数\n\tuint64_t rangeFreq(uint64_t begin_pos, uint64_t end_pos, uint64_t min_c, uint64_t max_c) {\n\t\tif ((end_pos > size || begin_pos >= end_pos) || (min_c >= max_c) || min_c >= maximum_element) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tconst auto maxi_t = rankAll(max_c, begin_pos, end_pos);\n\t\tconst auto mini_t = rankAll(min_c, begin_pos, end_pos);\n\t\treturn std::get<1>(maxi_t) - std::get<1>(mini_t);\n\t}\n\n\n\t// v[begin, end)で(cと同じ値の数、cより小さい値の数、cより大きい値の数)を求める\n\tstd::tuple<uint64_t, uint64_t, uint64_t> rankAll(const uint64_t c, uint64_t begin, uint64_t end) {\n\t\tassert(end <= size);\n\t\tconst uint64_t num = end - begin;\n\n\t\tif (begin >= end) {\n\t\t\treturn std::make_tuple(0, 0, 0);\n\t\t}\n\t\tif (c >= maximum_element || end == 0) {\n\t\t\treturn std::make_tuple(0, num, 0);\n\t\t}\n\n\t\tuint64_t rank_less_than = 0, rank_more_than = 0;\n\t\tfor (size_t i = 0; i < bit_size && begin < end; ++i) {\n\t\t\tconst uint64_t bit = (c >> (bit_size - i - 1)) & 1;\n\n\t\t\tconst uint64_t rank0_begin = this->bit_arrays.at(i).rank(0, begin);\n\t\t\tconst uint64_t rank0_end = this->bit_arrays.at(i).rank(0, end);\n\t\t\tconst uint64_t rank1_begin = begin - rank0_begin;\n\t\t\tconst uint64_t rank1_end = end - rank0_end;\n\n\t\t\tif (bit) {\n\t\t\t\trank_less_than += (rank0_end - rank0_begin); // i番目のbitが0のものは除外される\n\t\t\t\tbegin = this->begin_one.at(i) + rank1_begin;\n\t\t\t\tend = this->begin_one.at(i) + rank1_end;\n\t\t\t}\n\t\t\telse {\n\t\t\t\trank_more_than += (rank1_end - rank1_begin); // i番目のbitが1のものは除外される\n\t\t\t\tbegin = rank0_begin;\n\t\t\t\tend = rank0_end;\n\t\t\t}\n\t\t}\n\n\t\tconst uint64_t rank = num - rank_less_than - rank_more_than;\n\t\treturn std::make_tuple(rank, rank_less_than, rank_more_than);\n\t}\n\nprivate:\n\tuint64_t get_num_of_bit(uint64_t x) {\n\t\tif (x == 0) return 0;\n\t\tx--;\n\t\tuint64_t bit_num = 0;\n\t\twhile (x >> bit_num) {\n\t\t\t++bit_num;\n\t\t}\n\t\treturn bit_num;\n\t}\n\n\tuint64_t rangeSum(const uint64_t begin, const uint64_t end, const uint64_t depth, const uint64_t c, const uint64_t x, const uint64_t y) {\n\t\tif (begin == end) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (depth == bit_size) {\n\t\t\tif (x <= c and c < y) {\n\t\t\t\treturn c * (end - begin); // 値 * 頻度\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tconst uint64_t next_c = ((uint64_t)1 << (bit_size - depth - 1)) | c; // 上からdepth番目のbitを立てる\n\t\tconst uint64_t all_one_c = (((uint64_t)1 << (bit_size - depth - 1)) - 1) | next_c; // depth以降のbitをたてる(これ以降全部1を選んだときの値)\n\t\tif (all_one_c < x or y <= c) {\n\t\t\treturn 0;\n\t\t}\n\n\t\t// [begin, pos)のすべての要素は[x, y)\n\t\tif (x <= c and all_one_c < y) {\n\t\t\treturn this->cumulative_sum.at(depth).at(end) - this->cumulative_sum.at(depth).at(begin);\n\t\t}\n\n\t\tconst uint64_t rank0_begin = this->bit_arrays.at(depth).rank(0, begin);\n\t\tconst uint64_t rank0_end = this->bit_arrays.at(depth).rank(0, end);\n\t\tconst uint64_t rank1_begin = begin - rank0_begin;\n\t\tconst uint64_t rank1_end = end - rank0_end;\n\n\t\treturn rangeSum(rank0_begin, rank0_end, depth + 1, c, x, y) +\n\t\t\trangeSum(this->begin_one.at(depth) + rank1_begin, this->begin_one[depth] + rank1_end, depth + 1, next_c, x, y);\n\t}\n};\n\nclass UniquePoint {\npublic:\n\tconst int INF = 1 << 30;\n\tvector<pair<long long, long long>> points;\n\tmap<long long, int> xs;\n\tmap<long long, int> yt;\n\tvector<uint64_t> data;\n\n\tvoid add(long long y, long long x) {\n\t\tpoints.emplace_back(make_pair(y, x));\n\t}\n\n\tvoid build() {\n\t\tpoints.emplace_back(pair<ll, ll>(2ll * INF, 2ll * INF));\n\n\t\t// yをnew_yに変換(yは座標圧縮 2244 -> 0011)\n\t\tsort(points.begin(), points.end()); // yでソート\n\t\tint new_y = 0;\n\t\tfor (int i = 0; i < points.size(); ++i) {\n\t\t\tconst long long y = points[i].first;\n\t\t\tif (yt.count(y) == 0) {\n\t\t\t\tyt[y] = new_y;\n\t\t\t\tnew_y++;\n\t\t\t}\n\t\t}\n\n\t\t// xをnew_wに変換(xは順位圧縮 2244 -> 0022)\n\t\tsort(points.begin(), points.end(), [&](pair<ll, ll>& a, pair<ll, ll>& b) {return a.second < b.second; }); // xでソート\n\t\tfor (int i = 0; i < points.size(); ++i) {\n\t\t\tconst long long x = points[i].second;\n\t\t\tif (xs.count(x) == 0) {\n\t\t\t\txs[x] = i;\n\t\t\t}\n\t\t}\n\n\t\tdata.resize(points.size());\n\t\tfor (int i = 0; i < points.size(); ++i) {\n\t\t\tconst long long y = points[i].first;\n\t\t\tdata[i] = yt[y];\n\t\t}\n\t}\n\n\tpair<int, int> x2s(long long x) {\n\t\treturn make_pair(xs.lower_bound(x)->second, xs.upper_bound(x)->second);\n\t}\n\n\tpair<int, int> y2t(long long y) {\n\t\treturn make_pair(yt.lower_bound(y)->second, yt.upper_bound(y)->second);\n\t}\n\t//変換後の範囲\n\ttuple<int, int, int, int> grid(long long x1, long long y1, long long x2, long long y2) {\n\t\tassert(x1 <= x2);\n\t\tassert(y1 <= y2);\n\t\treturn make_tuple(\n\t\t\txs.lower_bound(x1)->second,\n\t\t\tyt.lower_bound(y1)->second,\n\t\t\txs.upper_bound(x2)->second,\n\t\t\tyt.upper_bound(y2)->second\n\t\t);\n\t}\n\n};\n\n#ifdef ATCODER\ntypedef modint1000000007 mint0;\ntypedef modint998244353 mint;\n#endif\nstring CONTEST = \"typical90\";\nstring PROBLEM = \"typical90_cc\";//問題に合わせて変える\n\nclass Answer{\npublic:\n\tchar problemc;\n#ifdef TESTLOCAL\n\tvoid answertest(istream& cin, ostream& cout) {\n\n\t}\n#endif\n\tvoid answer(istream& cin, ostream& cout) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tUniquePoint up;\n\t\tREP(i, N) {\n\t\t\tint x, y;\n\t\t\tcin >> x >> y;\n\t\t\tup.add(y, x);\n\t\t}\n\t\tup.build();\n\t\tWaveletMatrix wm(up.data);\n\t\tREP(i, M) {\n\t\t\tint x1, y1, x2, y2;\n\t\t\tcin >> x1 >> y1 >> x2 >> y2;\n\t\t\tauto g = up.grid(x1, y1, x2, y2);\n\t\t\tauto [nx1, ny1, nx2, ny2]=g;\n\t\t\tcout << (wm.rangeFreq(nx1, nx2, ny1, ny2)) << endl;\n\t\t}\n\t}\n\n};\n\nbool test(char c) {\n\tstring inputdir = \"input\\\\\";\n\tstring outputdir = \"output\\\\\";\n\tstring fs = getS(inputdir + c + \".txt\");\n\tif (fs != \"\") {\n\t\tstring os = getS(outputdir + c + \".txt\");\n\t\tostringstream oss;\n\t\tistringstream iss(fs);\n\t\tAnswer A;\n\t\tA.problemc = c;\n\t\tA.answer(iss, oss);\n\t\tif (ismatch(os, oss.str())) {\n\t\t\tcerr << (char)(c + 1) << \":ok\" << endl;\n\t\t}\n\t\telse {\n\t\t\tcerr << (char)(c + 1) << \":ng\" << endl;\n\t\t\tcerr << \"true:\" << endl;\n\t\t\tcerr << os << endl;\n\t\t\tcerr << \"ans:\" << endl;\n\t\t\tcerr << oss.str() << endl;\n\t\t}\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n\n}\nvoid testall() {\n\tfor (char c = '0'; c < '9'; c++) {\n\t\tif (!test(c))break;\n\t}\n}\nvoid createRandom(ostringstream& cout) {\n\tint N = 6;\n\tcout << N << endl;\n\t//vector<int> p = { 6,4,5,5,6,6 };\n\tvector<int> p = {};\n\tREP(i, N) {\n\t\tp.push_back((rand() % (N - i)) + i + 1);\n\t}\n\tfor (auto a : p) {\n\t\tcout << a << \" \";\n\t}\n\tcout << endl;\n}\n#ifdef TESTLOCAL\nvoid testLocal() {\n\tint MAX_NUM = 100;\n\tint show = max(1, MAX_NUM / 10);\n\tREP(i, MAX_NUM) {\n\t\tostringstream os;\n\t\tcreateRandom(os);\n\t\tostringstream ostest;\n\t\tistringstream istest(os.str());\n\t\tostringstream osa;\n\t\tistringstream isa(os.str());\n\t\tAnswer At('0');\n\t\tAnswer A('0');\n\t\tA.answer(isa, osa);\n\t\tAt.answertest(istest, ostest);\n\t\tif (ismatch(osa.str(), ostest.str())) {\n\t\t\tif (i % show == 0 || i == MAX_NUM - 1) {\n\t\t\t\tcout << i << \":ok\" << endl;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcout << i << \":ng\" << endl;\n\t\t\tcout << \"in:\" << endl;\n\t\t\tcout << os.str() << endl;\n\t\t\tcout << \"true->\" << endl;\n\t\t\tcout << ostest.str() << endl;\n\t\t\tcout << \"false->\" << endl;\n\t\t\tcout << osa.str() << endl;\n\t\t\treturn;\n\t\t}\n\t}\n\n}\n#endif\nint main() {\n\tcin.tie(nullptr);//出力後に必ずendl or flushすれば問題ない。\n\tios::sync_with_stdio(false);//scanf printfと混ぜなければ問題ない。\n\n#ifdef ATCODER\n#ifdef _LOCAL\n#ifdef TESTLOCAL\n\ttestLocal();\n#else\n\tif (!std::filesystem::is_regular_file(PROBLEM + \"_AC\")) {\n\t\tstring command = \"problemget.bat \" + CONTEST + \" \" + PROBLEM;\n\t\tsystem(command.c_str());\n\t}\n\ttestall();\n#endif\n#else\n\tAnswer A;\n\tA.answer(cin, cout);\n#endif\n#else\n#ifdef AIZU\n#ifdef _LOCAL\n\tif (!std::filesystem::is_regular_file(CONTEST + \"_AC\")) {//問題を取得したら一旦抜ける。\n\t\tstring command = \"problemgetaizu.bat \" + CONTEST;\n\t\tsystem(command.c_str());\n\t}\n\ttestall();\n#else\n\tAnswer A;\n\tA.answer(cin, cout);\n#endif\n#else\n\tAnswer A;\n\tA.answer(cin, cout);\n#endif\n#endif\n#ifdef _LOCAL\n\tcin.get();\n#endif\n\treturn 0;\n}","accuracy":1,"time_ms":810,"memory_kb":5072,"score_of_the_acc":-0.1444,"final_rank":4},{"submission_id":"aoj_2426_9005033","code_snippet":"#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <immintrin.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n\n#define sqrt __builtin_sqrt\n#define cbrt __builtin_cbrt\n#define hypot __builtin_hypot\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to;\n ll cost;\n Edge(int to, ll cost) : to(to), cost(cost) {}\n Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\n};\n\nchrono::system_clock::time_point start, now;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\n// int perl(ld x, ld y) { // perld(4.5, 2.1) = 2 // TODO\n// if (-EPS < x && x < 0 or 0 < x && x < EPS) x = 0;\n// if (-EPS < y && y < 0 or 0 < x && x < EPS) y = 0;\n// assert(!equals(y, 0));\n// if (x >= 0 && y > 0) return floor(x / y)+EPS;\n// if (x >= 0 && y < 0) return floor(x / y) - (x - floor(x/y)*y < -EPS);\n// if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n// return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n// }\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\n// ld modl(ld x, ld y) { // TODO\n// assert(!equals(y, 0));\n// if (x >= -EPS) return (x - floor(x/y)*y);\n// ld ret = x - floor(x/y)*y; // (x < 0)\n// ret += abs(y) * INFL; // TODO : オーバーフローする?\n// ret = x - floor(x/abs(y))*abs(y);\n// return ret;\n// }\n// int floor(int x, int y) { // TODO\n// assert(y != 0);\n// if (b < 0) a = -a, b = -b;\n// return a >= 0 ? a / b : (a + 1) / b - 1;\n// }\n// int ceil(int x, int y) { // TODO\n// assert(y != 0);\n// if (b < 0) a = -a, b = -b;\n// return a > 0 ? (a - 1) / b + 1 : a / b;\n// }\n// int floorl(ld x, ld y) { return 0; } // TODO\n// int ceill(ld x, ld y) { return 0; } // TODO\n// int gauss(int x, int y) {\n// assert(y != 0);\n// return x / y;\n// } // 整数部分(未verify)\n// int gauss(ld x, ld y) { return 0; } // TODO\n\npair<int, int> max(const pair<int, int> &a, const pair<int, int> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) {\n return a;\n }\n return b;\n}\npair<int, int> min(const pair<int, int> &a, const pair<int, int> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) {\n return a;\n }\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; }\n return false;\n}\ntemplate <class T> T mid(T a, T b, T c) {\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b);\n if (a > c) swap(a, c);\n if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b);\n if (c > a) swap(c, a);\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d);\n if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a);\n if (b > a) swap(b, a);\n }\n}\n\nint countl_zero(int x) { return __builtin_clzll(x); }\nint countl_one(int x) {\n int ret = 0; while (x % 2) { x /= 2; ret++; }\n return ret;\n}\nint countr_zero(int x) { return __builtin_ctzll(x); }\nint countr_one(int x) {\n int ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\nint popcount(int x) { return __builtin_popcountll(x); }\nint unpopcount(int x) { return 64 - __builtin_clzll(x) - __builtin_popcountll(x); }\n\nint top_bit(int x) { return 63 - __builtin_clzll(x);} // 2^kの位\nint bot_bit(int x) { return __builtin_ctz(x);} // 2^kの位\nint MSB(int x) { return 1 << (63 - __builtin_clzll(x)); } // mask\nint LSB(int x) { return (x & -x); } // mask\n\nint bit_width(int x) { return 64 - __builtin_clzll(x); } // 桁数\nint ceil_log2(int x) { return 63 - __builtin_clzll(x); }\nint bit_floor(int x) { return 1 << (63 - __builtin_clzll(x)); }\nint floor_log2(int x) { return 64 - __builtin_clzll(x-1); }\nint bit_ceil(int x) { return 1 << (64 - __builtin_clzll(x-1)) - (x==1); }\n\nint hamming(int a, int b) { return popcount(a ^ b); }\nint compcnt(int x) { return (popcount(x^(x >> 1)) + (x&1)) / 2; }\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n\n return true;\n\t}\n\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase(\n remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }),\n G.end());\n return G;\n }\nprivate:\n\tvector<int> par;\n\tvector<int> sz;\n};\n\ntemplate<int mod> class Modint{\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n// using Mint = modint998244353;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t;\n x = t;\n return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n assert(n >= 0); // TODO: n <= -1\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n\nint modinv(__int128_t x, int mod) {\n assert(mod > 0 && x > 0);\n if (x == 1) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128];\n char *d = end(buffer);\n\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n\n if (x < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n\n if (os.rdbuf()->sputn(d, len) != len) {\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) {\n return b ? gcd(b, a % b) : a;\n}\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\n\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) {\n ret += \"-\";\n x *= -1;\n }\n while (x) {\n ret += (char)('0' + x % 10);\n x /= 10;\n }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) {\n string s = \"\";\n s += c;\n return s;\n}\n\nstruct SXor128 {\n uint64_t x = 88172645463325252LL;\n unsigned Int() {\n x = x ^ (x << 7);\n return x = x ^ (x >> 9);\n }\n unsigned Int(unsigned mod) {\n x = x ^ (x << 7);\n x = x ^ (x >> 9);\n return x % mod;\n }\n unsigned Int(unsigned l, unsigned r) {\n x = x ^ (x << 7);\n x = x ^ (x >> 9);\n return x % (r - l + 1) + l;\n }\n double Double() {\n return double(Int()) / UINT_MAX;\n }\n} rnd;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v){\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1);\n _finv.resize(N + 1);\n _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1;\n _finv[0] = _finv[1] = 1;\n _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0;\n return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0;\n if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0;\n if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) {\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nstruct Bit_Vector {\n int n, m;\n vector<uint64_t> bit;\n vector<int> sum;\n\n Bit_Vector(int n) : n(n), m((n + 63) / 64), bit(m), sum(m + 1) {}\n void set(int k) { bit[k / 64] |= 1ULL << (k % 64); }\n void build() {\n for (int i = 0; i < m; i++) {\n sum[i + 1] = sum[i] + __builtin_popcountll(bit[i]);\n }\n }\n bool operator[](int k) const { return (bit[k / 64] >> (k % 64)) & 1ULL; }\n \n int rank(int r, bool b) const {\n int one = sum[r / 64];\n if (r & 63) one += __builtin_popcountll(bit[r / 64] & ((1ULL << (r % 64)) - 1));\n return b ? one : r - one;\n }\n \n int rank(int l, int r, bool b) const { return rank(r, b) - rank(l, b); }\n};\n\ntemplate<typename T>\nstruct WaveletMatrix {\n int maxlog, n;\n vector<Bit_Vector> matrix;\n vector<int> zero_cnt;\n vector<vector<ll>> cs;\n\n WaveletMatrix(vector<T> data, ll max_v) : n(data.size()) {\n T min_v = n ? *min_element(data.begin(), data.end()) : 0;\n assert(0 <= min_v);\n maxlog = max(64 - __builtin_clzll(max_v), 1);\n matrix.resize(maxlog, Bit_Vector(n));\n cs.resize(maxlog, vector<ll>(n + 1));\n zero_cnt.resize(maxlog);\n vector<T> zero(n), one(n);\n\n for (int i = 0; i < maxlog; i++) {\n int z = 0, o = 0;\n for (int j = 0; j < n; j++) {\n if ((data[j] >> (maxlog - 1 - i)) & 1) {\n one[o++] = data[j];\n matrix[i].set(j);\n } \n else {\n zero[z++] = data[j];\n zero_cnt[i]++;\n }\n }\n matrix[i].build();\n data.swap(zero);\n for (int i = 0; i < o; i++) data[z + i] = one[i];\n for (int j = 0; j < n; j++) cs[i][j + 1] = cs[i][j] + data[j];\n }\n }\n\n T access(int k) {\n T ret = 0;\n for (int i = 0; i < maxlog; i++) {\n bool bit = matrix[i][k];\n ret = (ret << 1) | bit;\n k = matrix[i].rank(k, bit) + zero_cnt[i] * bit;\n }\n return ret;\n }\n\n int rank(int l, int r, T x) {\n for (int i = 0; i < maxlog; i++) {\n bool bit = (x >> (maxlog - 1 - i)) & 1;\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\n }\n return r - l;\n }\n \n T kth_smallest(int l, int r, int k) const {\n assert(0 <= k && k < r - l);\n T res = 0;\n for (int i = 0; i < maxlog; i++) {\n int zero = matrix[i].rank(l, r, 0);\n bool bit = k >= zero;\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\n res |= (T(1) << (maxlog - 1 - i)) * bit;\n k -= zero * bit;\n }\n return res;\n }\n\n T kth_largest(int l, int r, int k) { kth_smallest(l, r, r - l - k - 1); }\n\n tuple<int, int, int> rank_all(int l, int r, T x) const {\n int lt_cnt = 0, eq_cnt = r - l , mt_cnt = 0;\n for (int i = 0; i < maxlog; i++) {\n int tmp = r - l;\n bool bit = (x >> (maxlog - 1 - i)) & 1;\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\n int d = tmp - (r - l);\n eq_cnt -= d;\n (bit ? lt_cnt : mt_cnt) += d;\n }\n return { lt_cnt, eq_cnt, mt_cnt };\n }\n\n int range_freq(int l, int r, T lower, T upper) {\n auto l_cnt = get<0>(rank_all(l, r, lower));\n auto r_cnt = get<0>(rank_all(l, r, upper));\n return r_cnt - l_cnt; \n }\n\n T prev_value(int l, int r, T upper) {\n int cnt = get<0>(rank_all(l, r, upper));\n return cnt == 0 ? T(-1) : kth_smallest(l, r, --cnt);\n } \n\n T next_value(int l, int r, T lower) {\n int cnt = get<0>(rank_all(l, r, lower));\n return cnt == r - l ? T(-1) : kth_smallest(l, r, cnt);\n }\n\n ll sum_less_than(int l, int r, T x) {\n ll ret = 0;\n for (int i = 0; i < maxlog; i++) {\n bool bit = (x >> (maxlog - 1 - i) & 1);\n if (bit) ret += cs[i][matrix[i].rank(r, 0)] - cs[i][matrix[i].rank(l, 0)];\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\n }\n return ret;\n }\n\n ll range_sum(int l, int r, T lower, T upper) { \n return sum_less_than(l, r, upper) - sum_less_than(l, r, lower);\n }\n};\n\nclass UniquePoint {\npublic:\n vector<pair<int, int>> P;\n map<int, int> xs;\n vector<int> data;\n\n UniquePoint() {}\n\n void insert(int x, int y) {\n P.pb(make_pair(x, y));\n }\n\n void unique() {\n P.pb(make_pair(INFL, INFL));\n\n // xをuniqueになるように変換\n sort(P.begin(), P.end(),\n [&](pair<int, int> &a, pair<int, int> &b) {\n return a.first < b.first;\n }); // xでソート\n\n for (int i = 0; i < P.size(); i++) {\n const int x = P[i].first;\n if (xs.count(x) == 0) {\n xs[x] = i;\n }\n }\n\n data.resize(P.size());\n for (int i = 0; i < P.size(); i++) {\n const int y = P[i].second;\n data[i] = y;\n }\n }\n\n pair<int, int> x2s(int x) {\n return make_pair(xs.lower_bound(x)->second, xs.upper_bound(x)->second);\n }\n\n // [l, r] クエリの l, r をWMのindexとして渡せる値に直す\n pair<int, int> encode(int l, int r) {\n assert(l <= r);\n return make_pair(\n xs.lower_bound(l)->second,\n xs.upper_bound(r)->second\n );\n }\n};\n\nsigned main() {\n\tint N, Q;\n cin >> N >> Q;\n\n UniquePoint P;\n vector<int> X(N), Y(N);\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n Y[i] += 1e9+EPS;\n P.insert(X[i], Y[i]);\n }\n\n P.unique();\n\n WaveletMatrix<int> WM(P.data, 2e9 + 1);\n\n for (int i = 0; i < Q; i++) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n y1 += 1e9+EPS;\n y2 += 1e9+EPS;\n pair<int, int> range = P.encode(x1, x2); // [l, r) の半開区間\n // cout << range.first << \" \" << range.second << \" \" << y1 << \" \" << y2 << endl;\n cout << WM.range_freq(range.first, range.second, y1, y2 + 1) << endl;\n }\n}","accuracy":1,"time_ms":440,"memory_kb":5144,"score_of_the_acc":-0.0465,"final_rank":1},{"submission_id":"aoj_2426_9004628","code_snippet":"#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <immintrin.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n\n#define pb emplace_back\n// #define int ll\n#define endl '\\n'\n\n#define sqrt __builtin_sqrt\n#define cbrt __builtin_cbrt\n#define hypot __builtin_hypot\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\nstruct Edge {\n int from, to;\n ll cost;\n Edge(int to, ll cost) : to(to), cost(cost) {}\n Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\n};\n\nchrono::system_clock::time_point start, now;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\n// int perl(ld x, ld y) { // perld(4.5, 2.1) = 2 // TODO\n// if (-EPS < x && x < 0 or 0 < x && x < EPS) x = 0;\n// if (-EPS < y && y < 0 or 0 < x && x < EPS) y = 0;\n// assert(!equals(y, 0));\n// if (x >= 0 && y > 0) return floor(x / y)+EPS;\n// if (x >= 0 && y < 0) return floor(x / y) - (x - floor(x/y)*y < -EPS);\n// if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n// return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n// }\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\n// ld modl(ld x, ld y) { // TODO\n// assert(!equals(y, 0));\n// if (x >= -EPS) return (x - floor(x/y)*y);\n// ld ret = x - floor(x/y)*y; // (x < 0)\n// ret += abs(y) * INFL; // TODO : オーバーフローする?\n// ret = x - floor(x/abs(y))*abs(y);\n// return ret;\n// }\n// int floor(int x, int y) { // TODO\n// assert(y != 0);\n// if (b < 0) a = -a, b = -b;\n// return a >= 0 ? a / b : (a + 1) / b - 1;\n// }\n// int ceil(int x, int y) { // TODO\n// assert(y != 0);\n// if (b < 0) a = -a, b = -b;\n// return a > 0 ? (a - 1) / b + 1 : a / b;\n// }\n// int floorl(ld x, ld y) { return 0; } // TODO\n// int ceill(ld x, ld y) { return 0; } // TODO\n// int gauss(int x, int y) {\n// assert(y != 0);\n// return x / y;\n// } // 整数部分(未verify)\n// int gauss(ld x, ld y) { return 0; } // TODO\n\npair<int, int> max(const pair<int, int> &a, const pair<int, int> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) {\n return a;\n }\n return b;\n}\npair<int, int> min(const pair<int, int> &a, const pair<int, int> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) {\n return a;\n }\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; }\n return false;\n}\ntemplate <class T> T mid(T a, T b, T c) {\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b);\n if (a > c) swap(a, c);\n if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b);\n if (c > a) swap(c, a);\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d);\n if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a);\n if (b > a) swap(b, a);\n }\n}\n\nint countl_zero(int x) { return __builtin_clzll(x); }\nint countl_one(int x) {\n int ret = 0; while (x % 2) { x /= 2; ret++; }\n return ret;\n}\nint countr_zero(int x) { return __builtin_ctzll(x); }\nint countr_one(int x) {\n int ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\nint popcount(int x) { return __builtin_popcountll(x); }\nint unpopcount(int x) { return 64 - __builtin_clzll(x) - __builtin_popcountll(x); }\n\nint top_bit(int x) { return 63 - __builtin_clzll(x);} // 2^kの位\nint bot_bit(int x) { return __builtin_ctz(x);} // 2^kの位\nint MSB(int x) { return 1 << (63 - __builtin_clzll(x)); } // mask\nint LSB(int x) { return (x & -x); } // mask\n\nint bit_width(int x) { return 64 - __builtin_clzll(x); } // 桁数\nint ceil_log2(int x) { return 63 - __builtin_clzll(x); }\nint bit_floor(int x) { return 1 << (63 - __builtin_clzll(x)); }\nint floor_log2(int x) { return 64 - __builtin_clzll(x-1); }\nint bit_ceil(int x) { return 1 << (64 - __builtin_clzll(x-1)) - (x==1); }\n\nint hamming(int a, int b) { return popcount(a ^ b); }\nint compcnt(int x) { return (popcount(x^(x >> 1)) + (x&1)) / 2; }\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n\n return true;\n\t}\n\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase(\n remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }),\n G.end());\n return G;\n }\nprivate:\n\tvector<int> par;\n\tvector<int> sz;\n};\n\ntemplate<int mod> class Modint{\npublic:\n int val = 0;\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\n Modint(const Modint &r) { val = r.val; }\n\n Modint operator -() { return Modint(-val); } // 単項\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\n \n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\n Modint operator ++(signed) { ++*this; return *this; } // 後置\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\n Modint operator --(signed) { --*this; return *this; }\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\n Modint &operator /=(const Modint &r) {\n int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n Modint &operator /=(const int &q) {\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\n val = val * u % mod; if (val < 0) val += mod;\n return *this;\n }\n\n bool operator ==(const Modint& r) { return this -> val == r.val; }\n bool operator <(const Modint& r) { return this -> val < r.val; }\n bool operator >(const Modint& r) { return this -> val > r.val; }\n bool operator !=(const Modint& r) { return this -> val != r.val; }\n};\n\nusing mint = Modint<MOD>;\n// using Mint = modint998244353;\n\nistream &operator >>(istream &is, mint& x) {\n int t; is >> t;\n x = t;\n return (is);\n}\nostream &operator <<(ostream &os, const mint& x) {\n return os << x.val;\n}\nmint modpow(const mint &x, int n) {\n assert(n >= 0); // TODO: n <= -1\n if (n == 0) return 1;\n mint t = modpow(x, n / 2);\n t = t * t;\n if (n & 1) t = t * x;\n return t;\n}\n\nint modpow(__int128_t x, int n, int mod) {\n assert(n >= 0 && mod > 0); // TODO: n <= -1\n __int128_t ret = 1;\n while (n > 0) {\n if (n % 2 == 1) ret = ret * x % mod;\n x = x * x % mod;\n n /= 2;\n }\n return ret;\n}\n\nint modinv(__int128_t x, int mod) {\n assert(mod > 0 && x > 0);\n if (x == 1) return 1;\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\n}\n\nistream &operator >>(istream &is, __int128_t& x) {\n string S; is >> S;\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n x = ret * f;\n return (is);\n}\nostream &operator <<(ostream &os, __int128_t x) {\n ostream::sentry s(os);\n if (s) {\n __uint128_t tmp = x < 0 ? -x : x;\n char buffer[128];\n char *d = end(buffer);\n\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n\n if (x < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n\n if (os.rdbuf()->sputn(d, len) != len) {\n os.setstate(ios_base::badbit);\n }\n }\n return os;\n}\n\n__int128_t stoll(string &S) {\n __int128_t ret = 0;\n int f = 1;\n if (S[0] == '-') f = -1; \n for (int i = 0; i < S.length(); i++)\n if ('0' <= S[i] && S[i] <= '9')\n ret = ret * 10 + S[i] - '0';\n return ret * f;\n}\n__int128_t gcd(__int128_t a, __int128_t b) {\n return b ? gcd(b, a % b) : a;\n}\n__int128_t lcm(__int128_t a, __int128_t b) {\n return a / gcd(a, b) * b;\n // lcmが__int128_tに収まる必要あり\n}\n\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\n assert(k >= 0);\n stringstream ss;\n ss << setprecision(k + 2) << x;\n string s = ss.str();\n if (s.find('.') == string::npos) s += '.';\n int pos = s.find('.');\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\n s.pop_back();\n if (s.back() == '.') s.pop_back();\n return s;\n\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\n // ss << setprecision(k + 1) << x;\n // string s = ss.str();\n // if (s.find('.') == string::npos) s += '.';\n // int pos = s.find('.');\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\n // if (s.back() == '.') s.pop_back();\n // return s;\n}\n\nstring to_string(__int128_t x) {\n string ret = \"\";\n if (x < 0) {\n ret += \"-\";\n x *= -1;\n }\n while (x) {\n ret += (char)('0' + x % 10);\n x /= 10;\n }\n reverse(ret.begin(), ret.end());\n return ret;\n}\nstring to_string(char c) {\n string s = \"\";\n s += c;\n return s;\n}\n\nstruct SXor128 {\n uint64_t x = 88172645463325252LL;\n unsigned Int() {\n x = x ^ (x << 7);\n return x = x ^ (x >> 9);\n }\n unsigned Int(unsigned mod) {\n x = x ^ (x << 7);\n x = x ^ (x >> 9);\n return x % mod;\n }\n unsigned Int(unsigned l, unsigned r) {\n x = x ^ (x << 7);\n x = x ^ (x >> 9);\n return x % (r - l + 1) + l;\n }\n double Double() {\n return double(Int()) / UINT_MAX;\n }\n} rnd;\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v){\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\n}\ntemplate<class T,class S> struct hash<pair<T,S>>{\n size_t operator()(const pair<T,S> &keyval) const noexcept {\n return HashCombine(hash<T>()(keyval.first), keyval.second);\n }\n};\ntemplate<class T> struct hash<vector<T>>{\n size_t operator()(const vector<T> &keyval) const noexcept {\n size_t s=0;\n for (auto&& v: keyval) s=HashCombine(s,v);\n return s;\n }\n};\ntemplate<int N> struct HashTupleCore{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\n size_t s=HashTupleCore<N-1>()(keyval);\n return HashCombine(s,get<N-1>(keyval));\n }\n};\ntemplate <> struct HashTupleCore<0>{\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\n};\ntemplate<class... Args> struct hash<tuple<Args...>>{\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n\nvector<mint> _fac, _finv, _inv;\nvoid COMinit(int N) {\n _fac.resize(N + 1);\n _finv.resize(N + 1);\n _inv.resize(N + 1);\n _fac[0] = _fac[1] = 1;\n _finv[0] = _finv[1] = 1;\n _inv[1] = 1;\n for (int i = 2; i <= N; i++) {\n _fac[i] = _fac[i-1] * mint(i);\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\n _finv[i] = _finv[i - 1] * _inv[i];\n }\n}\n\nmint FAC(int N) {\n if (N < 0) return 0;\n return _fac[N];\n}\nmint COM(int N, int K) {\n if (N < K) return 0;\n if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[K] * _finv[N - K];\n}\nmint PERM(int N, int K) {\n if (N < K) return 0;\n if (N < 0 or K < 0) return 0;\n return _fac[N] * _finv[N - K];\n}\nmint NHK(int N, int K) {\n if (N == 0 && K == 0) return 1;\n return COM(N + K - 1, K);\n}\n\n#pragma endregion\n\nclass Compress {\npublic:\n int sz = 0;\n unordered_map<int, ushort> Z; // 元の値 -> 圧縮した値\n unordered_map<ushort, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<ushort> zip(const vector<int> &V) {\n vector<ushort> ret((int)V.size());\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[V[i]];\n }\n return ret;\n }\n\n // vector<int> unzip(const vector<ushort> &V) {\n // vector<int> ret = V;\n // for (int i = 0; i < (int)V.size(); i++) {\n // ret[i] = UZ[ret[i]];\n // }\n // return ret;\n // }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) { return UZ[x]; }\n};\n\nushort bit[5001][5001];\nstruct BIT2D {\n int H, W;\n BIT2D(int _H, int _W) : H(_H + 1), W(_W + 1) {\n }\n\n // (x, y)にwを足す\n void add(int x, int y, ushort w) {\n // if (x < 0 or x >= H or y < 0 or y >= W) return ; // 範囲外の時は足さない\n assert(x >= 0 && x < H && y >= 0 && y < W);\n for (int a = (++y, ++x); a <= H; a += a & -a) {\n for (int b = y; b <= W; b += b & -b) {\n bit[a][b] += w;\n }\n }\n }\n\n // [(0, 0) , (x, y)]の和 閉区間\n ushort sum(int x, int y) {\n if (x < 0 or y < 0) return 0; // x, y < 0の時は0\n // if (x >= H) x = H - 1; // x >= H, y >= W のときは x = H - 1, y = W - 1\n // if (y >= W) y = W - 1;\n assert(x < H && y < W);\n\n ushort ret = 0;\n for (int a = (++y, ++x); a > 0; a -= a & -a) {\n for (int b = y; b > 0; b -= b & -b) {\n ret += bit[a][b];\n }\n }\n return ret;\n }\n\n // [(x1, y1) , (x2, y2)] の和\n ushort sum(int x1, int y1, int x2, int y2) {\n // if (x1 > x2 or y1 > y2) return 0; // x1 > x2, y1 > y2の時は何もしない\n // if (x1 > x2) swap(x1, x2); // x1 > x2, y1 > y2の時はswap\n // if (y1 > y2) swap(y1, y2);\n assert(x1 <= x2 && y1 <= y2);\n return sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) +\n sum(x1 - 1, y1 - 1);\n }\n\n ushort get(int x, int y) {\n assert(x >= 0 && x < H && y >= 0 && y < W);\n int x1 = x, x2 = x, y1 = y, y2 = y;\n if (x1 > x2 or y1 > y2) return 0;\n return sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) +\n sum(x1 - 1, y1 - 1);\n }\n\n void set(int x, int y, ushort w) {\n ushort s = get(x, y);\n add(x, y, -s + w);\n }\n};\n\nsigned main() {\n\tint N, Q;\n cin >> N >> Q;\n vector<int> X(N), Y(N);\n for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];\n\n\tCompress CX(X, 0); // ここにAとCを入れてはいけない(Q²はデカすぎるので)\n\tCompress CY(Y, 0);\n vector<ushort> X1 = CX.zip(X);\n vector<ushort> Y1 = CY.zip(Y);\n\n BIT2D bit(CX.size() + 1, CY.size() + 1);\n for (int i = 0; i < N; i++) {\n bit.add(X1[i], Y1[i], 1);\n }\n\n vector<int> A(Q), B(Q), C(Q), D(Q);\n for (int i = 0; i < Q; i++) cin >> A[i] >> B[i] >> C[i] >> D[i];\n // 左下(A[i], B[i]), 右上(C[i], D[i]) の矩形領域\n\n Compress CX2(X, A, C, 0);\n vector<ushort> X2 = CX2.zip(X);\n X.clear();\n sort(X2.begin(), X2.end());\n vector<ushort> A2 = CX2.zip(A);\n A.clear();\n vector<ushort> C2 = CX2.zip(C);\n C.clear();\n\n Compress CY2(Y, B, D, 0);\n vector<ushort> Y2 = CY2.zip(Y);\n Y.clear();\n sort(Y2.begin(), Y2.end());\n vector<ushort> B2 = CY2.zip(B);\n B.clear();\n vector<ushort> D2 = CY2.zip(D);\n D.clear();\n\n for (int i = 0; i < Q; i++) {\n // cout << A[i] << \" \" << B[i] << \" \" << C[i] << \" \" << D[i] << endl;\n auto itl = lower_bound(X2.begin(), X2.end(), A2[i]);\n if (itl == X2.end()) {\n cout << 0 << endl;\n continue;\n }\n auto itr = upper_bound(X2.begin(), X2.end(), C2[i]);\n if (itr == X2.begin()) {\n cout << 0 << endl;\n continue;\n }\n itr--;\n\n int l = CX.encode(CX2.decode(*itl));\n int r = CX.encode(CX2.decode(*itr));\n\n auto itd = lower_bound(Y2.begin(), Y2.end(), B2[i]);\n if (itd == Y2.end()) {\n cout << 0 << endl;\n continue;\n }\n auto itu = upper_bound(Y2.begin(), Y2.end(), D2[i]);\n if (itu == Y2.begin()) {\n cout << 0 << endl;\n continue;\n }\n itu--;\n\n int d = CY.encode(CY2.decode(*itd));\n int u = CY.encode(CY2.decode(*itu));\n\n // cout << l << \" \" << r << \" \" << d << \" \" << u << endl;\n\n cout << bit.sum(l, d, r, u) << endl;\n }\n}","accuracy":0.25,"time_ms":810,"memory_kb":165392,"score_of_the_acc":-1.1383,"final_rank":20},{"submission_id":"aoj_2426_9003184","code_snippet":"// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = 3.141592653589793;\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nint main(){\n int N, M; cin >> N >> M;\n set<ll> totx = {INF}, toty = {INF};\n vc<pair<ll, ll>> points(N);\n rep(i, N){\n ll x, y; cin >> x >> y;\n points[i] = {x, y};\n totx.insert(x);\n toty.insert(y);\n }\n map<ll, ll> px, py;\n int H = 1;\n for (auto x : totx){\n px[x] = H;\n H++;\n }\n int W = 1;\n for (auto y : toty){\n py[y] = W;\n W++;\n }\n vv<int> cmsm(H + 1, vc<int>(W + 1, 0));\n for (auto [x, y] : points){\n cmsm[px[x]][py[y]]++;\n }\n rep(i, H + 1) rep(j, W + 1){\n if (i > 0) cmsm[i][j] += cmsm[i - 1][j];\n if (j > 0) cmsm[i][j] += cmsm[i][j - 1];\n if (i > 0 && j > 0) cmsm[i][j] -= cmsm[i - 1][j - 1];\n }\n\n rep(i, M){\n ll xl, yl, xr, yr; cin >> xl >> yl >> xr >> yr;\n auto xlit = totx.lower_bound(xl);\n auto xrit = totx.upper_bound(xr);\n auto ylit = toty.lower_bound(yl);\n auto yrit = toty.upper_bound(yr);\n if (*xlit != *xrit && *ylit != *yrit){\n int xlid = px[*xlit], xrid = px[*xrit], ylid = py[*ylit], yrid = py[*yrit];\n xlid--; ylid--; xrid--; yrid--;\n cout<< cmsm[xrid][yrid] - cmsm[xrid][ylid] - cmsm[xlid][yrid] + cmsm[xlid][ylid] << endl;\n }else cout << 0 << endl;\n }\n}","accuracy":1,"time_ms":1360,"memory_kb":102352,"score_of_the_acc":-0.8938,"final_rank":14},{"submission_id":"aoj_2426_9003034","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nstruct merge_sort_tree{\n int n;\n vector<vector<T>> x;\n merge_sort_tree()=default;\n merge_sort_tree(const vector<T> &vec):n((int)vec.size()){\n x.resize(n*2);\n for(int i=0;i<n;i++)x[n+i]={vec[i]};\n for(int i=n-1;i;i--){\n merge(x[i*2].begin(),x[i*2].end(),x[i*2+1].begin(),x[i*2+1].end(),back_inserter(x[i]));\n }\n }\n \n int cntLess(int l,int r,T query)const{\n l+=n,r+=n;\n int ret=0;\n while(l<r){\n if(l&1){\n ret+=lower_bound(x[l].begin(),x[l].end(),query)-x[l].begin(),l++;\n }\n if(r&1){\n r--,ret+=lower_bound(x[r].begin(),x[r].end(),query)-x[r].begin();\n }\n l>>=1,r>>=1;\n }\n return ret;\n }\n \n int cntLesseq(int l,int r,T query)const{\n l+=n,r+=n;\n int ret=0;\n while(l<r){\n if(l&1){\n ret+=upper_bound(x[l].begin(),x[l].end(),query)-x[l].begin(),l++;\n }\n if(r&1){\n r--,ret+=upper_bound(x[r].begin(),x[r].end(),query)-x[r].begin();\n }\n l>>=1,r>>=1;\n }\n return ret;\n }\n\n int cntMore(int l,int r,T query)const{\n int tot=max(0,min(r,n)-max(l,0));\n return tot-cntLesseq(l,r,query);\n }\n\n int cntMoreeq(int l,int r,T query)const{\n int tot=max(0,min(r,n)-max(l,0));\n return tot-cntLess(l,r,query);\n }\n\n template<class OStream> friend OStream &operator<<(OStream &os,const merge_sort_tree &clt){\n os<<'[';\n for(int i=0;i<clt.n;i++)os<<clt.x[clt.n+i][0]<<',';\n return os<<']';\n }\n};\n\nint main() {\n cin.tie(nullptr), ios::sync_with_stdio(false);\n int N, M;\n cin >> N >> M;\n vector<pair<int, int>> P(N);\n for (auto &p : P) cin >> p.first >> p.second;\n sort(P.begin(), P.end());\n vector<int> xs, ys;\n for (auto p : P) xs.push_back(p.first), ys.push_back(p.second);\n merge_sort_tree<int> tree(ys);\n while (M--) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n int l = lower_bound(xs.begin(), xs.end(), x1) - xs.begin();\n int r = upper_bound(xs.begin(), xs.end(), x2) - xs.begin();\n cout << tree.cntLesseq(l, r, y2) - tree.cntLess(l, r, y1) << '\\n';\n }\n}","accuracy":1,"time_ms":510,"memory_kb":4084,"score_of_the_acc":-0.0585,"final_rank":2},{"submission_id":"aoj_2426_8887581","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n#define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)\n#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)\n#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)\n#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef vector<long long> vll;\ntypedef vector<pair<long long ,long long>> vpll;\ntypedef vector<vector<long long>> vvll;\ntypedef set<ll> sll;\ntypedef map<long long , long long> mpll;\ntypedef pair<long long ,long long> pll;\ntypedef tuple<long long , long long , long long> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \ninline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\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<typename T>\nstd::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T>\nstd::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n// ref https://hitonanode.github.io/cplib-cpp/segmenttree/merge_sort_tree.hpp\n//1indexed\n//静的配列aの[l,r)のうち値がx以下とかの個数をオンラインで求める\ntemplate <class T>\nclass MergeSortTree{\n public:\n ll n;\n vector<vector<T>> tree;\n \n MergeSortTree(const vector<T> &a){\n n = a.size();\n tree.resize(n * 2);\n rep(i,n){\n tree[n+i] = {a[i]};\n }\n for(ll i = n-1;i >= 1;i--){\n merge(tree[i * 2].begin(),tree[i * 2].end(),tree[i * 2 + 1].begin(),tree[i * 2 + 1].end(),back_inserter(tree[i]));\n }\n }\n\n //[l,r)でx未満\n ll cntLess(ll l,ll r,T x){\n l += n;\n r += n;\n ll ret = 0;\n while(l < r){\n if(l & 1){//演算してから足す\n ret += lower_bound(all(tree[l]),x) - tree[l].begin();\n l++;\n }\n if(r & 1){//演算する前に引く\n r--;\n ret += lower_bound(all(tree[r]),x) - tree[r].begin();\n }\n l>>=1;r>>=1;\n }\n return ret;\n }\n\n //x以下\n ll cntLesseq(ll l,ll r,T x){\n l += n;\n r += n;\n ll ret = 0;\n while(l < r){\n if(l & 1){//演算してから足す\n ret += upper_bound(all(tree[l]),x) - tree[l].begin();l++;\n }\n if(r & 1){//演算する前に引く\n r--;ret += upper_bound(all(tree[r]),x) - tree[r].begin();\n }\n l>>=1;r>>=1;\n }\n return ret;\n }\n\n //xより大きい\n ll cntMore(ll l,ll r,T x){\n ll total = max(0LL,min(r,n) - max(0LL,l));\n return total - cntLesseq(l,r,x);\n }\n\n //x以上\n ll cntMoreeq(ll l,ll r,T x){\n ll total = max(0LL,min(r,n) - max(0LL,l));\n return total - cntLess(l,r,x);\n }\n};\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n LL(n,m);\n vpll xy(n);\n rep(i,n){\n LL(x,y);\n xy[i] = {x,y};\n\n }\n\n sort(all(xy));\n vector<ll> a(n);\n rep(i,n){\n a[i] = xy[i].second;\n }\n MergeSortTree seg(a);\n while(m--){\n LL(x1,y1,x2,y2);\n ll l = lower_bound(all(xy),make_pair(x1,-INF)) - xy.begin();\n ll r = lower_bound(all(xy),make_pair(x2,INF)) - xy.begin();\n cout << seg.cntMoreeq(l,r,y1) - seg.cntMore(l,r,y2) << endl;\n }\n\n}","accuracy":1,"time_ms":870,"memory_kb":4456,"score_of_the_acc":-0.1566,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2426_11043154\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<int, 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, 1 : 0; }\\n\\nll mod = 998244353;\\nconst ll INF = 1e18;\\n\\nifstream in;\\nofstream out;\\n\\nint main(int argc, char** argv) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n if(argc > 2) {\\n in.open(argv[1]);\\n cin.rdbuf(in.rdbuf());\\n out.open(argv[2]);\\n cout.rdbuf(out.rdbuf());\\n }\\n\\n ll n, m;\\n cin >> n >> m;\\n set<int> x, y;\\n vector<a2> xy(n);\\n for(int i = 0; i < n; i++) {\\n int a, b;\\n cin >> a >> b;\\n xy[i] = {a, b};\\n x.insert(a);\\n y.insert(b);\\n }\\n x.insert(-2e9);\\n y.insert(-2e9);\\n x.insert(2e9);\\n y.insert(2e9);\\n\\n vector<int> vx(x.begin(), x.end()), vy(y.begin(), y.end());\\n map<int, int> mpx, mpy;\\n for(int i = 0; i < vx.size(); i++) mpx[vx[i]] = i;\\n for(int i = 0; i < vy.size(); i++) mpy[vy[i]] = i;\\n\\n vector<vector<int>> sum(vx.size(), vector<int>(vy.size(), 0));\\n for(int i = 0; i < n; i++) {\\n int xi = mpx[xy[i][0]], yi = mpy[xy[i][1]];\\n sum[xi][yi]++;\\n }\\n for(int i = 1; i < vx.size(); i++) {\\n for(int j = 1; j < vy.size(); j++) {\\n sum[i][j] += sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];\\n }\\n }\\n for(int i = 0; i < m; i++) {\\n ll a, b, c, d;\\n cin >> a >> b >> c >> d;\\n int mnx = lower_bound(vx.begin(), vx.end(), a) - vx.begin() - 1,\\n mxx = upper_bound(vx.begin(), vx.end(), c) - vx.begin() - 1;\\n int mny = lower_bound(vy.begin(), vy.end(), b) - vy.begin() - 1,\\n mxy = upper_bound(vy.begin(), vy.end(), d) - vy.begin() - 1;\\n\\n cout << sum[mxx][mxy] - sum[mnx][mxy] - sum[mxx][mny] + sum[mnx][mny]\\n << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 102272,\n \"score_of_the_acc\": -0.6592,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2426_10881379\",\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 pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing vi = vector<int>;\\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,s,n) for(ll i = (ll)s;i < (ll)n;i++)\\n#define rrep(i,l,r) for(ll i = r-1;i >= l;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 int n,m;cin >> n >> m;\\n vi x(n),y(n);\\n vi corX,corY;\\n rep(i,0,n)cin >> x[i] >> y[i];\\n rep(i,0,n)corX.emplace_back(x[i]),corY.emplace_back(y[i]);\\n sort(ALL(corX));corX.erase(unique(ALL(corX)),corX.end());\\n sort(ALL(corY));corY.erase(unique(ALL(corY)),corY.end());\\n vvi rui(sz(corX)+1,vi(sz(corY)+1));\\n rep(i,0,n)rui[LB(corX,x[i])+1][LB(corY,y[i])+1]++;\\n rep(i,0,sz(corX))rep(j,0,sz(corY))rui[i+1][j+1] += rui[i][j+1] + rui[i+1][j] - rui[i][j];\\n rep(_,0,m){\\n ll x,y,X,Y;cin >> x >> y >> X >> Y;\\n x = LB(corX,x);y = LB(corY,y);X = LB(corX,X+1);Y = LB(corY,Y+1);\\n cout << rui[X][Y]-rui[X][y]-rui[x][Y]+rui[x][y] << \\\"\\\\n\\\";\\n }\\n\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 101012,\n \"score_of_the_acc\": -0.6115,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2426_10851084\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nusing pii = pair<int, int>;\\n \\nint idx(vector<int> const& v, int i) {\\n return lower_bound(v.begin(), v.end(), i) - v.begin();\\n}\\n \\nint main() {\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int>> sum(n + 2, vector<int>(n + 2));\\n vector<int> xs(n), ys(n);\\n vector<int> x(n), y(n);\\n for(int i = 0; i < n; ++i) {\\n cin >> x[i] >> y[i];\\n xs[i] = x[i];\\n ys[i] = y[i];\\n }\\n sort(x.begin(), x.end());\\n x.erase(unique(x.begin(), x.end()), x.end());\\n sort(y.begin(), y.end());\\n y.erase(unique(y.begin(), y.end()), y.end());\\n \\n for(int i = 0; i < n; ++i) {\\n int tx = idx(x, xs[i]);\\n int ty = idx(y, ys[i]);\\n ++sum[ty + 1][tx + 1];\\n }\\n for(int i = 0; i < y.size(); ++i) {\\n for(int j = 0; j < x.size(); ++j) {\\n sum[i + 1][j + 1] += sum[i + 1][j] + sum[i][j + 1] - sum[i][j];\\n }\\n }\\n \\n for(int i = 0; i < m; ++i) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n x1 = idx(x, x1);\\n y1 = idx(y, y1);\\n x2 = idx(x, x2 + 1);\\n y2 = idx(y, y2 + 1);\\n cout << sum[y2][x2] - sum[y2][x1] - sum[y1][x2] + sum[y1][x1] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 101344,\n \"score_of_the_acc\": -0.7944,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2426_10283886\",\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////////////////////////////////////////////\\n////////////////////////////////////////////////merge_sort_tree\\ntemplate <typename T = long long>\\nclass merge_sort_tree\\n{\\nprivate:\\n unordered_map<pair<ll, ll>, vector<T>> mp;\\n unordered_map<pair<ll, ll>, vector<T>> mp_s;\\n vector<T> ar;\\n ll sz_ar;\\n T INF;\\n void init_mp(ll l, ll r)\\n {\\n vector<T> in;\\n vector<ll> in_s(1);\\n rep(i, l, r) in.push_back(ar[i]);\\n sort(in.begin(), in.end());\\n rep(i, 0, r - l) in_s.push_back(in_s.back() + in[i]);\\n mp[make_pair(l, r)] = in;\\n mp_s[make_pair(l, r)] = in_s;\\n if (r - l > 1)\\n {\\n init_mp(l, (l + r) / 2);\\n init_mp((l + r) / 2, r);\\n }\\n }\\n ll cnt_call(ll l, ll r, ll L, ll R, T x)\\n {\\n if (l <= L && R <= r)\\n {\\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\\n return distance(mp[make_pair(L, R)].begin(), itr);\\n }\\n else if (r <= L || R <= l)\\n return 0;\\n else\\n return cnt_call(l, r, L, (L + R) / 2, x) + cnt_call(l, r, (L + R) / 2, R, x);\\n }\\n ll sum_call(ll l, ll r, ll L, ll R, T x)\\n {\\n if (l <= L && R <= r)\\n {\\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\\n return mp_s[make_pair(L, R)][distance(mp[make_pair(L, R)].begin(), itr)];\\n }\\n else if (r <= L || R <= l)\\n return 0;\\n else\\n return sum_call(l, r, L, (L + R) / 2, x) + sum_call(l, r, (L + R) / 2, R, x);\\n }\\n T getsup_call(ll l, ll r, ll L, ll R, T x)\\n {\\n if (l <= L && R <= r)\\n {\\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\\n if (itr == mp[make_pair(L, R)].begin())\\n {\\n return -INF;\\n }\\n return *prev(itr);\\n }\\n else if (r <= L || R <= l)\\n return -INF;\\n else\\n return max(getsup_call(l, r, L, (L + R) / 2, x), getsup_call(l, r, (L + R) / 2, R, x));\\n }\\n T getinf_call(ll l, ll r, ll L, ll R, T x)\\n {\\n if (l <= L && R <= r)\\n {\\n auto itr = lower_bound(mp[make_pair(L, R)].begin(), mp[make_pair(L, R)].end(), x);\\n if (itr == mp[make_pair(L, R)].end())\\n {\\n return INF;\\n }\\n return *itr;\\n }\\n else if (r <= L || R <= l)\\n return INF;\\n else\\n return min(getinf_call(l, r, L, (L + R) / 2, x), getinf_call(l, r, (L + R) / 2, R, x));\\n }\\n T getmax_call(ll l, ll r, ll L, ll R)\\n {\\n if (l <= L && R <= r)\\n {\\n if (mp[make_pair(L, R)].empty())\\n return -INF;\\n return *(mp[make_pair(L, R)].rbegin());\\n }\\n else if (r <= L || R <= l)\\n return -INF;\\n else\\n return max(getmax_call(l, r, L, (L + R) / 2), getmax_call(l, r, (L + R) / 2, R));\\n }\\n T getmin_call(ll l, ll r, ll L, ll R)\\n {\\n if (l <= L && R <= r)\\n {\\n if (mp[make_pair(L, R)].empty())\\n return INF;\\n return *(mp[make_pair(L, R)].begin());\\n }\\n else if (r <= L || R <= l)\\n return INF;\\n else\\n return min(getmin_call(l, r, L, (L + R) / 2), getmin_call(l, r, (L + R) / 2, R));\\n }\\n\\npublic:\\n // 初期の配列と、INFとして扱う値で初期化\\n merge_sort_tree(vector<T> init, T INF_init)\\n {\\n sz_ar = 1;\\n while (init.size() > sz_ar)\\n sz_ar *= 2;\\n ar.resize(sz_ar, INF_init);\\n INF = INF_init;\\n rep(i, 0, init.size())\\n {\\n ar[i] = init[i];\\n }\\n init_mp(0, sz_ar);\\n }\\n //[l,r)においてx未満のものの個数を返す O((logn)^2)\\n ll cnt(ll l, ll r, T x)\\n {\\n return cnt_call(l, r, 0LL, sz_ar, x);\\n }\\n //[l,r)においてx未満のものの総和を返す O((logn)^2)\\n ll sum(ll l, ll r, T x)\\n {\\n return sum_call(l, r, 0LL, sz_ar, x);\\n }\\n //[l,r)においてx未満のものの最大値を返す 無ければ-inf O((logn)^2)\\n T getsup(ll l, ll r, T x)\\n {\\n return getsup_call(l, r, 0LL, sz_ar, x);\\n }\\n //[l,r)においてx以上のものの最小値を返す 無ければinf O((logn)^2)\\n T getinf(ll l, ll r, T x)\\n {\\n return getinf_call(l, r, 0LL, sz_ar, x);\\n }\\n //[l,r]の最大値を返す O(logn)\\n T getmax(ll l, ll r)\\n {\\n return getmax_call(l, r, 0LL, sz_ar);\\n }\\n //[l,r]の最小値を返す O(logn)\\n T getmin(ll l, ll r)\\n {\\n return getmin_call(l, r, 0LL, sz_ar);\\n }\\n};\\n\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n ll n, m;\\n cin >> n >> m;\\n vector<pair<ll, ll>> ar(n);\\n rep(i, 0, n)\\n {\\n cin >> ar[i].first >> ar[i].second;\\n }\\n srt(ar);\\n vector<ll> x, y;\\n rep(i, 0, n)\\n {\\n x.push_back(ar[i].first);\\n y.push_back(ar[i].second);\\n }\\n merge_sort_tree<ll> mst(y,inf);\\n rep(i, 0, m)\\n {\\n ll a, b, c, d;\\n cin >> a >> b >> c >> d;\\n ll l = distance(x.begin(), lower_bound(all(x), a));\\n ll r = distance(x.begin(), upper_bound(all(x), c));\\n cout << mst.cnt(l, r, d + 1) - mst.cnt(l, r, b) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 8704,\n \"score_of_the_acc\": -0.2467,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2426_10256455\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i = 0; i < (n); ++i)\\n#define repp(i,n) for(int i = 1; i <= (n); ++i)\\n#define drep(i,n) for(int i = (n)-1; i >= 0; --i)\\n#define srep(i,s,t) for (int i = s; i < (t); ++i)\\n#define rng(a) a.begin(),a.end()\\n#define rrng(a) a.rbegin(),a.rend()\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define eb emplace_back\\n#define em emplace\\n#define pob pop_back\\n#define sz(x) (int)(x).size()\\n#define pcnt __builtin_popcountll\\n#define koulet srand((unsigned)clock()+(unsigned)time(NULL));\\n#define newline puts(\\\"\\\")\\n#define vc vector\\nusing namespace std;\\ntemplate<class T> using vv = vc<vc<T>>;\\ntemplate<class T> using PQ = priority_queue<T,vc<T>,greater<T>>;\\nusing uint = unsigned; using ull = unsigned long long;\\nusing vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; using LP = pair<ll,ll>;\\nusing vs = vc<string>; using vb=vc<bool> ; using vlp = vc<LP> ; \\nint geti(){int x;scanf(\\\"%d\\\",&x);return x;}\\nvi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}\\ntemplate<class T1,class T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}\\ntemplate<class T1,class T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<\\\",\\\"<<v.se;}\\ntemplate<class T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}\\ntemplate<class T>string join(const T&v,const string&d=\\\"\\\"){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}\\ntemplate<class T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v,\\\" \\\");return o;}\\ntemplate<class T>void vin(vc<T>&a){int n;cin>>n;a=vc<T>(n);cin>>a;}\\ntemplate<class T>void vin(vv<T>&a){int n,m;cin>>n>>m;a=vv<T>(n,vc<T>(m));cin>>a;}\\ntemplate<class T1,class T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;}\\ntemplate<class T1,class T2>void operator++(pair<T1,T2>&a,int){a.fi++;a.se++;}\\ntemplate<class T>void operator--(vc<T>&a,int){for(T&x:a)x--;}\\ntemplate<class T>void operator++(vc<T>&a,int){for(T&x:a)x++;}\\ntemplate<class T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;}\\ntemplate<class T>void operator-=(vc<T>&a,T b){for(T&x:a)x-=b;}\\ntemplate<class T>void operator*=(vc<T>&a,T b){for(T&x:a)x*=b;}\\ntemplate<class T>void operator/=(vc<T>&a,T b){for(T&x:a)x/=b;}\\ntemplate<class T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));}\\ntemplate<class T1,class T2>pair<T1,T2>operator+(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi+b.fi,a.se+b.se};}\\ntemplate<class T1,class T2>pair<T1,T2>operator-(const pair<T1,T2>&a,const pair<T1,T2>&b){return {a.fi-b.fi,a.se-b.se};}\\ntemplate<class T>pair<T,T>operator*(const pair<T,T>&a,T b){return {a.fi*b,a.se*b};}\\ntemplate<class T1,class T2>bool mins(T1& x,const T2&y){if(y<x){x=y;return true;}else return false;}\\ntemplate<class T1,class T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}\\ntemplate<class T>T min(const vc<T>&a){return *min_element(rng(a));}\\ntemplate<class T>T max(const vc<T>&a){return *max_element(rng(a));}\\ntemplate<class Tx,class Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}\\ntemplate<class T>ll suma(const vc<T>&a){ll s=0;for(auto&&x:a)s+=x;return s;}\\ntemplate<class T>ll suma(const vv<T>&a){ll s=0;for(auto&&x:a)s+=suma(x);return s;}\\ntemplate<class T>void uni(T&a){sort(rng(a));a.erase(unique(rng(a)),a.end());}\\ntemplate<class T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);}\\nconst double eps = 1e-10;\\nconst ll LINF = 1001002003004005006ll;\\nconst int INF = 1001001001;\\n#define dame { puts(\\\"-1\\\"); return 0 ;}\\n#define yes { puts(\\\"Yes\\\"); return 0 ;}\\n#define no { puts(\\\"No\\\"); return 0 ;}\\n#define rtn(x) { cout<<(x)<<endl;} // flush!\\n#define yn {puts(\\\"Yes\\\");}else{puts(\\\"No\\\");}\\nll c2(ll n) { return n*(n-1)>>1;}\\n\\n// Mod int\\nuint mod = 998244353;//*/\\n// uint mod = 1000000007;//*/\\nuint md(ll x) { x%=mod; return x<0?x+mod:x;}\\nll md(ll x, ll m) { x%=m; return x<0?x+m:x;}\\nstruct mint {\\n uint x;\\n mint(): x(0) {}\\n mint(ll x):x(md(x)) {}\\n mint operator-() const { return mint(0) - *this;}\\n mint operator~() const { return mint(1) / *this;}\\n mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}\\n mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}\\n mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}\\n mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}\\n mint operator+(const mint& a) const { return mint(*this) += a;}\\n mint operator-(const mint& a) const { return mint(*this) -= a;}\\n mint operator*(const mint& a) const { return mint(*this) *= a;}\\n mint operator/(const mint& a) const { return mint(*this) /= a;}\\n mint pow(ll t) const {\\n mint res = 1; for (mint p=x;t;p*=p,t>>=1) if (t&1) res *= p; return res;\\n }\\n mint ppow(ll t) const { int p=mod-1; return pow((t%p+p)%p);}\\n bool operator<(const mint& a) const { return x < a.x;}\\n bool operator==(const mint& a) const { return x == a.x;}\\n bool operator!=(const mint& a) const { return x != a.x;}\\n};\\nmint ex(mint x, ll t) { return x.pow(t);}\\nistream& operator>>(istream&i,mint&a) {i>>a.x;return i;}\\n//*\\nostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}\\n/*/\\nostream& operator<<(ostream&o, const mint&x) {\\n int a = x.x, b = 1;\\n rep(s,2)rep1(i,1000) {\\n int y = ((s?-x:x)*i).x; if (abs(a)+b > y+i) a = s?-y:y, b = i;\\n }\\n o<<a; if (b != 1) o<<'/'<<b; return o;\\n}//*/\\nusing vm = vector<mint>;\\nusing vvm = vector<vm>;\\nstruct modinv {\\n int n; vm d;\\n modinv(): n(2), d({0,1}) {}\\n mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}\\n mint operator[](int i) const { return d[i];}\\n} invs;\\nstruct modfact {\\n int n; vm d;\\n modfact(): n(2), d({1,1}) {}\\n mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}\\n mint operator[](int i) const { return d[i];}\\n} facs;\\nstruct modfactinv {\\n int n; vm d;\\n modfactinv(): n(2), d({1,1}) {}\\n mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}\\n mint operator[](int i) const { return d[i];}\\n} ifacs;\\nmint comb(int a, int b) {\\n if (a < b || b < 0) return 0;\\n return facs(a)*ifacs(b)*ifacs(a-b);\\n}\\nstruct modpow {\\n mint x; int n; vm d;\\n modpow(mint x=2): x(x), n(1), d(1,1) {}\\n mint operator()(int i) { while (n <= i) d.pb(d.back()*x), ++n; return d[i];}\\n mint operator[](int i) const { return d[i];}\\n} two(2);//, owt(invs(2));\\n//\\n// Bit Vector (for 64-bit non-negative integer)\\nstruct BitVector {\\n // block: bit vector\\n // count: the number of 1 within each block\\n unsigned int n, zeros;\\n vector<unsigned long long> block;\\n vector<unsigned int> count;\\n \\n // constructor\\n BitVector() {}\\n BitVector(const unsigned int num) {\\n resize(num);\\n }\\n void resize(const unsigned int num) {\\n n = num;\\n block.assign(((num + 1) >> 6) + 1, 0);\\n count.assign(block.size(), 0);\\n }\\n \\n // set val(0 or 1) onto i-th bit, get i-th bit of val(0 or 1)\\n void set(const unsigned int i, const unsigned long long val = 1LL) {\\n assert((i >> 6) < block.size());\\n block[i >> 6] |= (val << (i & 63));\\n }\\n unsigned int get(const unsigned int i) const {\\n assert((i >> 6) < block.size());\\n return (const unsigned int)(block[i >> 6] >> (i & 63)) & 1;\\n }\\n void build() {\\n for (unsigned int i = 1; i < block.size(); i++) {\\n count[i] = count[i - 1] + __builtin_popcountll(block[i - 1]);\\n }\\n zeros = rank0(n);\\n }\\n \\n // the number of 1 in [0, i)\\n unsigned int rank1(const unsigned int i) const {\\n assert((i >> 6) < count.size());\\n assert((i >> 6) < block.size());\\n return count[i >> 6] +\\n __builtin_popcountll(block[i >> 6] & ((1ULL << (i & 63)) - 1ULL));\\n }\\n // the number of 1 in [i, j)\\n unsigned int rank1(const unsigned int i, const unsigned int j) const {\\n return rank1(j) - rank1(i);\\n }\\n // the number of 0 in [0, i)\\n unsigned int rank0(const unsigned int i) const {\\n return i - rank1(i);\\n }\\n // the number of 0 in [i, j)\\n unsigned int rank0(const unsigned int i, const unsigned int j) const {\\n return rank0(j) - rank0(i);\\n }\\n // the number of 0 in [0, n)\\n unsigned int rank0() const {\\n return zeros;\\n }\\n};\\n\\ntemplate<class POS, class VAL> struct BITonWaveletMatrix {\\n // inner data\\n struct BIT {\\n VAL UNITY_SUM = 0;\\n int N;\\n vector<VAL> dat;\\n \\n // [0, n)\\n BIT() {}\\n BIT(int n, VAL unity = 0) : UNITY_SUM(unity), N(n), dat(n, unity) { }\\n void init(int n) {\\n N = n;\\n dat.assign(n, UNITY_SUM);\\n }\\n \\n // a is 0-indexed\\n void add(int a, VAL x) {\\n for (int i = a; i < (int)dat.size(); i |= i + 1)\\n dat[i] = dat[i] + x;\\n }\\n \\n // [0, a), a is 0-indexed\\n VAL sum(int a) {\\n VAL res = UNITY_SUM;\\n for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)\\n res = res + dat[i];\\n return res;\\n }\\n \\n // [a, b), a and b are 0-indexed\\n VAL sum(int a, int b) {\\n return sum(b) - sum(a);\\n }\\n \\n // debug\\n void print() {\\n for (int i = 0; i < (int)dat.size(); ++i)\\n cout << sum(i, i + 1) << \\\",\\\";\\n cout << endl;\\n }\\n };\\n \\n using Point = pair<POS, POS>;\\n int n, height;\\n\\tPOS mi = 0 ;\\n vector<BitVector> bv;\\n vector<Point> ps;\\n vector<POS> ys;\\n vector<BIT> bit;\\n\\n // constructor (sigma: the number of characters)\\n // add_point() cannot be used after build()\\n BITonWaveletMatrix() {}\\n BITonWaveletMatrix(const vector<Point> &vec) {\\n for (auto [x, y] : vec) add_point(x, y);\\n build();\\n }\\n void add_point(POS x, POS y) {\\n ps.emplace_back(x, y);\\n ys.emplace_back(y);\\n\\t\\tmi = min(mi, y) ;\\n }\\n int xid(POS x) const {\\n return lower_bound(ps.begin(), ps.end(), Point(x, mi)) - ps.begin();\\n }\\n int yid(POS y) const {\\n return lower_bound(ys.begin(), ys.end(), y) - ys.begin();\\n }\\n void build() {\\n sort(ps.begin(), ps.end());\\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\\n n = (int)ps.size();\\n sort(ys.begin(), ys.end());\\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\\n vector<int> v(n), left(n), right(n), ord(n);\\n int mv = 1;\\n for (int i = 0; i < n; ++i) {\\n v[i] = yid(ps[i].second);\\n mv = max(mv, v[i]);\\n }\\n for (height = 1; mv != 0; mv >>= 1) ++height;\\n iota(ord.begin(), ord.end(), 0);\\n bv.resize(height, BitVector(n));\\n bit.assign(height + 1, BIT(n));\\n for (int h = height - 1; h >= 0; --h) {\\n int l = 0, r = 0;\\n for (int i = 0; i < n; ++i) {\\n if ((v[ord[i]] >> h) & 1) {\\n bv[h].set(i);\\n right[r++] = ord[i];\\n } else {\\n left[l++] = ord[i];\\n }\\n }\\n bv[h].build();\\n ord.swap(left);\\n for (int i = 0; i < r; ++i) ord[i + l] = right[i];\\n }\\n }\\n \\n // add\\n void add(const POS x, const POS y, const VAL val) {\\n int i = lower_bound(ps.begin(), ps.end(), Point(x, y)) - ps.begin();\\n int j = yid(y);\\n for (int h = height - 1; h >= 0; --h) {\\n int i0 = bv[h].rank0(i);\\n if ((j >> h) & 1) {\\n i += bv[h].rank0() - i0;\\n } else {\\n i = i0;\\n }\\n bit[h].add(i, val);\\n }\\n }\\n \\n // sum\\n VAL inner_sum(int l, int r, const POS upper) {\\n assert(0 <= l && r <= n);\\n VAL res = 0;\\n for (int h = height - 1; h >= 0; --h) {\\n int l0 = bv[h].rank0(l), r0 = bv[h].rank0(r);\\n if ((upper >> h) & 1) {\\n l += bv[h].rank0() - l0;\\n r += bv[h].rank0() - r0;\\n res += bit[h].sum(l0, r0);\\n } else {\\n l = l0;\\n r = r0;\\n }\\n }\\n return res;\\n }\\n\\n\\t// sum [lx, rx)×[ly, ry)\\n VAL sum(const POS lx, const POS rx, const POS ly, const POS ry) {\\n int l = xid(lx), r = xid(rx);\\n return inner_sum(l, r, yid(ry)) - inner_sum(l, r, yid(ly));\\n }\\n};\\n\\n\\nint main() {\\n\\tBITonWaveletMatrix<long long, long long> wm;\\n\\tint n, m;cin>>n>>m ;\\n\\tvl x(n) , y(n) ;\\n\\trep(i, n){\\n\\t\\tcin>>x[i] >>y[i] ;\\n\\t\\twm.add_point(x[i], y[i]) ;\\n\\t}\\n wm.build();\\n\\t\\n\\trep(i, n) wm.add(x[i],y[i],1);\\n\\twhile(m--){\\n\\t\\tll lx,ly,rx,ry ;cin>>lx>>ly>>rx>>ry;\\n\\t\\tcout << wm.sum(lx,rx+1,ly,ry+1) <<endl;\\n\\t}\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1190,\n \"memory_kb\": 4180,\n \"score_of_the_acc\": -0.24,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2426_10182280\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n#include <algorithm>\\n#include <iterator>\\n/**\\n * @brief 座標圧縮\\n *\\n * @tparam T 要素の型\\n */\\ntemplate <class T>\\nstruct coordinate_compression {\\n coordinate_compression() = default;\\n coordinate_compression(const std::vector<T> &_data) : data(_data) { build(); }\\n const T &operator[](int i) const { return data[i]; }\\n void add(T x) { data.emplace_back(x); }\\n void build() {\\n std::sort(data.begin(), data.end());\\n data.erase(std::unique(data.begin(), data.end()), data.end());\\n }\\n bool exists(T x) const {\\n auto it = std::lower_bound(data.begin(), data.end(), x);\\n return it != data.end() && *it == x;\\n }\\n int get(T x) const {\\n auto it = std::lower_bound(data.begin(), data.end(), x);\\n return std::distance(data.begin(), it);\\n }\\n int size() const { return data.size(); }\\n private:\\n std::vector<T> data;\\n};\\n/**\\n * @brief 座標圧縮\\n *\\n * @tparam T 要素の型\\n * @param v 配列\\n * @return std::vector<T>\\n */\\ntemplate <class T>\\nstd::vector<int> compress(const std::vector<T> &v) {\\n coordinate_compression cps(v);\\n std::vector<int> res;\\n res.reserve(std::size(v));\\n for (auto &&x : v) res.emplace_back(cps.get(x));\\n return res;\\n}\\n#include <cassert>\\ntemplate <class T>\\nstruct cumulative_sum_2d {\\n cumulative_sum_2d(int _n, int _m) : v(_n, std::vector<T>(_m)), n(_n), m(_m) {}\\n cumulative_sum_2d(const std::vector<std::vector<T>> &_v) : v(_v) { build(); }\\n void set(int x, int y, T val) { v[x][y] = val; }\\n void add(int x, int y, T val) { v[x][y] += val; }\\n void build() {\\n n = v.size();\\n assert(n > 0);\\n m = v[0].size();\\n assert(m > 0);\\n v.resize(n + 1);\\n for (int i = 0; i <= n; ++i) v[i].resize(m + 1);\\n for (int i = n - 1; i >= 0; --i) {\\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i][j + 1];\\n }\\n for (int i = n - 1; i >= 0; --i) {\\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i + 1][j];\\n }\\n }\\n T get(int x1, int y1, int x2, int y2) {\\n assert(0 <= x1 && x1 <= x2 && x2 <= n && 0 <= y1 && y1 <= y2 && y2 <= m);\\n return v[x1][y1] - v[x1][y2] - v[x2][y1] + v[x2][y2];\\n }\\n private:\\n std::vector<std::vector<T>> v;\\n int n, m;\\n};\\nint main(void) {\\n int n, m;\\n std::cin >> n >> m;\\n std::vector<std::pair<int, int>> a(n);\\n for (int i = 0; i < n; ++i) std::cin >> a[i].first >> a[i].second;\\n coordinate_compression<int> cps_x, cps_y;\\n for (int i = 0; i < n; ++i) cps_x.add(a[i].first), cps_y.add(a[i].second);\\n cps_x.build(), cps_y.build();\\n cumulative_sum_2d<int> cs(cps_x.size(), cps_y.size());\\n for (int i = 0; i < n; ++i) cs.add(cps_x.get(a[i].first), cps_y.get(a[i].second), 1);\\n cs.build();\\n for (int i = 0; i < m; ++i) {\\n int x1, y1, x2, y2;\\n std::cin >> x1 >> y1 >> x2 >> y2;\\n std::cout << cs.get(cps_x.get(x1), cps_y.get(y1), cps_x.get(x2 + 1), cps_y.get(y2 + 1))\\n << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 160256,\n \"score_of_the_acc\": -1.0958,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2426_10166998\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <algorithm>\\n#include <iterator>\\n#include <vector>\\n/**\\n * @brief 座標圧縮\\n *\\n * @tparam T 要素の型\\n */\\ntemplate <class T>\\nstruct coordinate_compression {\\n coordinate_compression() = default;\\n coordinate_compression(const std::vector<T> &_data) : data(_data) { build(); }\\n const T &operator[](int i) const { return data[i]; }\\n void add(T x) { data.emplace_back(x); }\\n void build() {\\n std::sort(data.begin(), data.end());\\n data.erase(std::unique(data.begin(), data.end()), data.end());\\n }\\n bool exists(T x) const {\\n auto it = std::lower_bound(data.begin(), data.end(), x);\\n return it != data.end() && *it == x;\\n }\\n int get(T x) const {\\n auto it = std::lower_bound(data.begin(), data.end(), x);\\n return std::distance(data.begin(), it);\\n }\\n int size() const { return data.size(); }\\n private:\\n std::vector<T> data;\\n};\\n/**\\n * @brief 座標圧縮\\n *\\n * @tparam T 要素の型\\n * @param v 配列\\n * @return std::vector<T>\\n */\\ntemplate <class T>\\nstd::vector<int> compress(const std::vector<T> &v) {\\n coordinate_compression cps(v);\\n std::vector<int> res;\\n res.reserve(std::size(v));\\n for (auto &&x : v) res.emplace_back(cps.get(x));\\n return res;\\n}\\n#include <cassert>\\ntemplate <class T>\\nstruct cumulative_sum_2d {\\n cumulative_sum_2d(int _n, int _m) : v(_n, std::vector<T>(_m)), n(_n), m(_m) {}\\n cumulative_sum_2d(const std::vector<std::vector<T>> &_v) : v(_v) { build(); }\\n void set(int x, int y, T val) { v[x][y] = val; }\\n void add(int x, int y, T val) { v[x][y] += val; }\\n void build() {\\n n = v.size();\\n assert(n > 0);\\n m = v[0].size();\\n assert(m > 0);\\n v.resize(n + 1);\\n for (int i = 0; i <= n; ++i) v[i].resize(m + 1);\\n for (int i = n - 1; i >= 0; --i) {\\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i][j + 1];\\n }\\n for (int i = n - 1; i >= 0; --i) {\\n for (int j = m - 1; j >= 0; --j) v[i][j] += v[i + 1][j];\\n }\\n }\\n T get(int x1, int y1, int x2, int y2) {\\n assert(0 <= x1 && x1 <= x2 && x2 <= n && 0 <= y1 && y1 <= y2 && y2 <= m);\\n return v[x1][y1] - v[x1][y2] - v[x2][y1] + v[x2][y2];\\n }\\n private:\\n std::vector<std::vector<T>> v;\\n int n, m;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nint main(void) {\\n int n, m;\\n cin >> n >> m;\\n std::vector<std::pair<int, int>> a(n);\\n for (int i = 0; i < n; ++i) std::cin >> a[i].first >> a[i].second;\\n coordinate_compression<int> cps_x, cps_y;\\n for (int i = 0; i < n; ++i) cps_x.add(a[i].first), cps_y.add(a[i].second);\\n cps_x.build(), cps_y.build();\\n cumulative_sum_2d<int> cs(cps_x.size(), cps_y.size());\\n for (int i = 0; i < n; ++i) cs.add(cps_x.get(a[i].first), cps_y.get(a[i].second), 1);\\n cs.build();\\n for (int i = 0; i < m; ++i) {\\n int x1, y1, x2, y2;\\n std::cin >> x1 >> y1 >> x2 >> y2;\\n std::cout << cs.get(cps_x.get(x1), cps_y.get(y1), cps_x.get(x2 + 1), cps_y.get(y2 + 1))\\n << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 160256,\n \"score_of_the_acc\": -0.9788,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2426_10107649\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/2426\\n#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <iterator>\\n#include <utility>\\n#include <cassert>\\nnamespace internal {\\n// @return same with std::bit::bit_ceil\\nunsigned int bit_ceil(unsigned int n) {\\n unsigned int x = 1;\\n while (x < (unsigned int)(n)) x *= 2;\\n return x;\\n}\\n// @param n `1 <= n`\\n// @return same with std::bit::countl_zero\\nint countl_zero(unsigned int n) { return __builtin_clz(n); }\\n// @param n `1 <= n`\\n// @return same with std::bit::countr_zero\\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\\n// @param n `1 <= n`\\n// @return same with std::bit::countr_zero\\nconstexpr int countr_zero_constexpr(unsigned int n) {\\n int x = 0;\\n while (!(n & (1 << x))) x++;\\n return x;\\n}\\n} // namespace internal\\n#include <limits>\\n#include <numeric>\\ntemplate <class T>\\nstruct Add {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs + rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs + rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Mul {\\n using value_type = T;\\n static constexpr T id() { return T(1); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs * rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs * rhs;\\n }\\n};\\ntemplate <class T>\\nstruct And {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs & rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs & rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Or {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs | rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs | rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Xor {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs ^ rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs ^ rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Min {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return std::min(lhs, rhs); }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return std::min((U)lhs, rhs);\\n }\\n};\\ntemplate <class T>\\nstruct Max {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::lowest(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return std::max(lhs, rhs); }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return std::max((U)lhs, rhs);\\n }\\n};\\ntemplate <class T>\\nstruct Gcd {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return lhs == Gcd::id() ? rhs : (rhs == Gcd::id() ? lhs : std::gcd(lhs, rhs));\\n }\\n};\\ntemplate <class T>\\nstruct Lcm {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return lhs == Lcm::id() ? rhs : (rhs == Lcm::id() ? lhs : std::lcm(lhs, rhs));\\n }\\n};\\ntemplate <class T>\\nstruct Update {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs == Update::id() ? rhs : lhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs == Update::id() ? rhs : lhs;\\n }\\n};\\ntemplate <class T>\\nstruct Affine {\\n using P = std::pair<T, T>;\\n using value_type = P;\\n static constexpr P id() { return P(1, 0); }\\n static constexpr P op(P lhs, P rhs) {\\n return {lhs.first * rhs.first, lhs.first * rhs.second + lhs.second};\\n }\\n};\\ntemplate <class M>\\nstruct Rev {\\n using T = typename M::value_type;\\n using value_type = T;\\n static constexpr T id() { return M::id(); }\\n static constexpr T op(T lhs, T rhs) { return M::op(rhs, lhs); }\\n};\\n/**\\n * @brief セグメント木\\n * @see https://noshi91.hatenablog.com/entry/2020/04/22/212649\\n *\\n * @tparam M モノイド\\n */\\ntemplate <class M>\\nstruct segment_tree {\\n private:\\n using T = typename M::value_type;\\n struct _segment_tree_reference {\\n private:\\n segment_tree<M> &self;\\n int k;\\n public:\\n _segment_tree_reference(segment_tree<M> &self, int k) : self(self), k(k) {}\\n _segment_tree_reference &operator=(const T &x) {\\n self.set(k, x);\\n return *this;\\n }\\n _segment_tree_reference &operator=(T &&x) {\\n self.set(k, std::move(x));\\n return *this;\\n }\\n operator T() const { return self.get(k); }\\n };\\n public:\\n segment_tree() : segment_tree(0) {}\\n explicit segment_tree(int n, T e = M::id()) : segment_tree(std::vector<T>(n, e)) {}\\n template <class U>\\n explicit segment_tree(const std::vector<U> &v) : _n(v.size()) {\\n _size = internal::bit_ceil(_n);\\n _log = internal::countr_zero(_size);\\n data = std::vector<T>(_size << 1, M::id());\\n for (int i = 0; i < _n; ++i) data[_size + i] = T(v[i]);\\n for (int i = _size - 1; i >= 1; --i) update(i);\\n }\\n const T &operator[](int k) const { return data[k + _size]; }\\n _segment_tree_reference operator[](int k) { return _segment_tree_reference(*this, k); }\\n T at(int k) const { return data[k + _size]; }\\n T get(int k) const { return data[k + _size]; }\\n void set(int k, T val) {\\n assert(0 <= k && k < _n);\\n k += _size;\\n data[k] = val;\\n for (int i = 1; i <= _log; ++i) update(k >> i);\\n }\\n void reset(int k) { set(k, M::id()); }\\n T all_prod() const { return data[1]; }\\n T prod(int a, int b) const {\\n assert(0 <= a && b <= _n);\\n T l = M::id(), r = M::id();\\n for (a += _size, b += _size; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) l = M::op(l, data[a++]);\\n if (b & 1) r = M::op(data[--b], r);\\n }\\n return M::op(l, r);\\n }\\n template <class F>\\n int max_right(F f) const {\\n return max_right(0, f);\\n }\\n template <class F>\\n int max_right(int l, F f) const {\\n assert(0 <= l && l <= _n);\\n assert(f(M::id()));\\n if (l == _n) return _n;\\n l += _size;\\n T sm = M::id();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(M::op(sm, data[l]))) {\\n while (l < _size) {\\n l = (2 * l);\\n if (f(M::op(sm, data[l]))) {\\n sm = M::op(sm, data[l]);\\n l++;\\n }\\n }\\n return l - _size;\\n }\\n sm = M::op(sm, data[l]);\\n l++;\\n } while ((l & -l) != l);\\n return _n;\\n }\\n template <class F>\\n int min_left(F f) const {\\n return min_left(_n, f);\\n }\\n template <class F>\\n int min_left(int r, F f) const {\\n assert(0 <= r && r <= _n);\\n assert(f(M::id()));\\n if (r == 0) return 0;\\n r += _size;\\n T sm = M::id();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(M::op(data[r], sm))) {\\n while (r < _size) {\\n r = (2 * r + 1);\\n if (f(M::op(data[r], sm))) {\\n sm = M::op(data[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - _size;\\n }\\n sm = M::op(data[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n private:\\n int _n, _size, _log;\\n std::vector<T> data;\\n void update(int k) { data[k] = M::op(data[2 * k], data[2 * k + 1]); }\\n};\\n/**\\n * @brief 領域木\\n *\\n * @tparam M\\n * @tparam T\\n *\\n * @see https://hitonanode.github.io/cplib-cpp/segmenttree/rangetree.hpp.html\\n */\\ntemplate <class M, class T = int>\\nstruct range_tree {\\n private:\\n using Pt = std::pair<T, T>;\\n using value_type = typename M::value_type;\\n public:\\n range_tree() = default;\\n void add(T x, T y) noexcept { _pts.emplace_back(x, y); }\\n void build() {\\n std::sort(_pts.begin(), _pts.end());\\n _pts.erase(std::unique(_pts.begin(), _pts.end()), _pts.end());\\n _size = _pts.size();\\n _range2yxs.resize(_size * 2);\\n for (int i = 0; i < _size; i++) _range2yxs[_size + i] = {{_pts[i].second, _pts[i].first}};\\n for (int i = _size - 1; i > 0; i--) {\\n auto &lch = _range2yxs[i * 2];\\n auto &rch = _range2yxs[i * 2 + 1];\\n std::merge(lch.begin(), lch.end(), rch.begin(), rch.end(),\\n std::back_inserter(_range2yxs[i]));\\n _range2yxs[i].erase(std::unique(_range2yxs[i].begin(), _range2yxs[i].end()),\\n _range2yxs[i].end());\\n }\\n for (const auto &v : _range2yxs) segtrees.emplace_back(v.size());\\n }\\n void set(T x, T y, value_type val) {\\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\\n assert(i < _size && _pts[i] == std::make_pair(x, y));\\n for (i += _size; i; i >>= 1) set(i, {x, y}, val);\\n }\\n value_type prod(T xl, T yl, T xr, T yr) const {\\n auto comp = [](const Pt &l, const Pt &r) { return l.first < r.first; };\\n int l = _size + std::distance(_pts.begin(),\\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xl, yr}, comp));\\n int r = _size + std::distance(_pts.begin(),\\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xr, yr}, comp));\\n value_type res = M::id();\\n while (l < r) {\\n if (l & 1) res = M::op(res, prod(l++, yl, yr));\\n if (r & 1) res = M::op(res, prod(--r, yl, yr));\\n l >>= 1, r >>= 1;\\n }\\n return res;\\n }\\n value_type get(T x, T y) const {\\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\\n return i < _size && _pts[i] == std::make_pair(x, y) ? segtrees[_size + i].get(0) : M::id();\\n }\\n private:\\n int _size;\\n std::vector<Pt> _pts;\\n std::vector<std::vector<Pt>> _range2yxs;\\n std::vector<segment_tree<M>> segtrees;\\n void set(int v, Pt p, value_type val) {\\n auto i = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{p.second, p.first}));\\n segtrees[v].set(i, val);\\n }\\n value_type prod(int v, T yl, T yr) const {\\n auto comp = [&](const Pt &l, const Pt &r) { return l.first < r.first; };\\n auto il = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yl, yl}, comp));\\n auto ir = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yr, yr}, comp));\\n return segtrees[v].prod(il, ir);\\n }\\n};\\nint main(void) {\\n int n, m;\\n std::cin >> n >> m;\\n std::vector<int> x(n), y(n);\\n for (int i = 0; i < n; ++i) std::cin >> x[i] >> y[i];\\n range_tree<Add<int>> rt;\\n for (int i = 0; i < n; ++i) rt.add(x[i], y[i]);\\n rt.build();\\n for (int i = 0; i < n; ++i) rt.set(x[i], y[i], rt.get(x[i], y[i]) + 1);\\n for (int i = 0; i < m; ++i) {\\n int a, b, c, d;\\n std::cin >> a >> b >> c >> d;\\n std::cout << rt.prod(a, b, c + 1, d + 1) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1300,\n \"memory_kb\": 5492,\n \"score_of_the_acc\": -0.2773,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2426_10107646\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/2426\\n#include <algorithm>\\n#include <iterator>\\n#include <utility>\\n#include <cassert>\\n#include <vector>\\nnamespace internal {\\n// @return same with std::bit::bit_ceil\\nunsigned int bit_ceil(unsigned int n) {\\n unsigned int x = 1;\\n while (x < (unsigned int)(n)) x *= 2;\\n return x;\\n}\\n// @param n `1 <= n`\\n// @return same with std::bit::countl_zero\\nint countl_zero(unsigned int n) { return __builtin_clz(n); }\\n// @param n `1 <= n`\\n// @return same with std::bit::countr_zero\\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\\n// @param n `1 <= n`\\n// @return same with std::bit::countr_zero\\nconstexpr int countr_zero_constexpr(unsigned int n) {\\n int x = 0;\\n while (!(n & (1 << x))) x++;\\n return x;\\n}\\n} // namespace internal\\n#include <limits>\\n#include <numeric>\\ntemplate <class T>\\nstruct Add {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs + rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs + rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Mul {\\n using value_type = T;\\n static constexpr T id() { return T(1); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs * rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs * rhs;\\n }\\n};\\ntemplate <class T>\\nstruct And {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs & rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs & rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Or {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs | rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs | rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Xor {\\n using value_type = T;\\n static constexpr T id() { return T(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs ^ rhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs ^ rhs;\\n }\\n};\\ntemplate <class T>\\nstruct Min {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return std::min(lhs, rhs); }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return std::min((U)lhs, rhs);\\n }\\n};\\ntemplate <class T>\\nstruct Max {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::lowest(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return std::max(lhs, rhs); }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return std::max((U)lhs, rhs);\\n }\\n};\\ntemplate <class T>\\nstruct Gcd {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return lhs == Gcd::id() ? rhs : (rhs == Gcd::id() ? lhs : std::gcd(lhs, rhs));\\n }\\n};\\ntemplate <class T>\\nstruct Lcm {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) {\\n return lhs == Lcm::id() ? rhs : (rhs == Lcm::id() ? lhs : std::lcm(lhs, rhs));\\n }\\n};\\ntemplate <class T>\\nstruct Update {\\n using value_type = T;\\n static constexpr T id() { return std::numeric_limits<T>::max(); }\\n static constexpr T op(const T &lhs, const T &rhs) { return lhs == Update::id() ? rhs : lhs; }\\n template <class U>\\n static constexpr U f(T lhs, U rhs) {\\n return lhs == Update::id() ? rhs : lhs;\\n }\\n};\\ntemplate <class T>\\nstruct Affine {\\n using P = std::pair<T, T>;\\n using value_type = P;\\n static constexpr P id() { return P(1, 0); }\\n static constexpr P op(P lhs, P rhs) {\\n return {lhs.first * rhs.first, lhs.first * rhs.second + lhs.second};\\n }\\n};\\ntemplate <class M>\\nstruct Rev {\\n using T = typename M::value_type;\\n using value_type = T;\\n static constexpr T id() { return M::id(); }\\n static constexpr T op(T lhs, T rhs) { return M::op(rhs, lhs); }\\n};\\n/**\\n * @brief セグメント木\\n * @see https://noshi91.hatenablog.com/entry/2020/04/22/212649\\n *\\n * @tparam M モノイド\\n */\\ntemplate <class M>\\nstruct segment_tree {\\n private:\\n using T = typename M::value_type;\\n struct _segment_tree_reference {\\n private:\\n segment_tree<M> &self;\\n int k;\\n public:\\n _segment_tree_reference(segment_tree<M> &self, int k) : self(self), k(k) {}\\n _segment_tree_reference &operator=(const T &x) {\\n self.set(k, x);\\n return *this;\\n }\\n _segment_tree_reference &operator=(T &&x) {\\n self.set(k, std::move(x));\\n return *this;\\n }\\n operator T() const { return self.get(k); }\\n };\\n public:\\n segment_tree() : segment_tree(0) {}\\n explicit segment_tree(int n, T e = M::id()) : segment_tree(std::vector<T>(n, e)) {}\\n template <class U>\\n explicit segment_tree(const std::vector<U> &v) : _n(v.size()) {\\n _size = internal::bit_ceil(_n);\\n _log = internal::countr_zero(_size);\\n data = std::vector<T>(_size << 1, M::id());\\n for (int i = 0; i < _n; ++i) data[_size + i] = T(v[i]);\\n for (int i = _size - 1; i >= 1; --i) update(i);\\n }\\n const T &operator[](int k) const { return data[k + _size]; }\\n _segment_tree_reference operator[](int k) { return _segment_tree_reference(*this, k); }\\n T at(int k) const { return data[k + _size]; }\\n T get(int k) const { return data[k + _size]; }\\n void set(int k, T val) {\\n assert(0 <= k && k < _n);\\n k += _size;\\n data[k] = val;\\n for (int i = 1; i <= _log; ++i) update(k >> i);\\n }\\n void reset(int k) { set(k, M::id()); }\\n T all_prod() const { return data[1]; }\\n T prod(int a, int b) const {\\n assert(0 <= a && b <= _n);\\n T l = M::id(), r = M::id();\\n for (a += _size, b += _size; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) l = M::op(l, data[a++]);\\n if (b & 1) r = M::op(data[--b], r);\\n }\\n return M::op(l, r);\\n }\\n template <class F>\\n int max_right(F f) const {\\n return max_right(0, f);\\n }\\n template <class F>\\n int max_right(int l, F f) const {\\n assert(0 <= l && l <= _n);\\n assert(f(M::id()));\\n if (l == _n) return _n;\\n l += _size;\\n T sm = M::id();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!f(M::op(sm, data[l]))) {\\n while (l < _size) {\\n l = (2 * l);\\n if (f(M::op(sm, data[l]))) {\\n sm = M::op(sm, data[l]);\\n l++;\\n }\\n }\\n return l - _size;\\n }\\n sm = M::op(sm, data[l]);\\n l++;\\n } while ((l & -l) != l);\\n return _n;\\n }\\n template <class F>\\n int min_left(F f) const {\\n return min_left(_n, f);\\n }\\n template <class F>\\n int min_left(int r, F f) const {\\n assert(0 <= r && r <= _n);\\n assert(f(M::id()));\\n if (r == 0) return 0;\\n r += _size;\\n T sm = M::id();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!f(M::op(data[r], sm))) {\\n while (r < _size) {\\n r = (2 * r + 1);\\n if (f(M::op(data[r], sm))) {\\n sm = M::op(data[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - _size;\\n }\\n sm = M::op(data[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n private:\\n int _n, _size, _log;\\n std::vector<T> data;\\n void update(int k) { data[k] = M::op(data[2 * k], data[2 * k + 1]); }\\n};\\n/**\\n * @brief 領域木\\n *\\n * @tparam M\\n * @tparam T\\n *\\n * @see https://hitonanode.github.io/cplib-cpp/segmenttree/rangetree.hpp.html\\n */\\ntemplate <class M, class T = int>\\nstruct range_tree {\\n private:\\n using Pt = std::pair<T, T>;\\n using value_type = typename M::value_type;\\n public:\\n range_tree() = default;\\n void add(T x, T y) noexcept { _pts.emplace_back(x, y); }\\n void build() {\\n std::sort(_pts.begin(), _pts.end());\\n _pts.erase(std::unique(_pts.begin(), _pts.end()), _pts.end());\\n _size = _pts.size();\\n _range2yxs.resize(_size * 2);\\n for (int i = 0; i < _size; i++) _range2yxs[_size + i] = {{_pts[i].second, _pts[i].first}};\\n for (int i = _size - 1; i > 0; i--) {\\n auto &lch = _range2yxs[i * 2];\\n auto &rch = _range2yxs[i * 2 + 1];\\n std::merge(lch.begin(), lch.end(), rch.begin(), rch.end(),\\n std::back_inserter(_range2yxs[i]));\\n _range2yxs[i].erase(std::unique(_range2yxs[i].begin(), _range2yxs[i].end()),\\n _range2yxs[i].end());\\n }\\n for (const auto &v : _range2yxs) segtrees.emplace_back(v.size());\\n }\\n void set(T x, T y, value_type val) {\\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\\n assert(i < _size && _pts[i] == std::make_pair(x, y));\\n for (i += _size; i; i >>= 1) set(i, {x, y}, val);\\n }\\n value_type prod(T xl, T yl, T xr, T yr) const {\\n auto comp = [](const Pt &l, const Pt &r) { return l.first < r.first; };\\n int l = _size + std::distance(_pts.begin(),\\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xl, yr}, comp));\\n int r = _size + std::distance(_pts.begin(),\\n std::lower_bound(_pts.begin(), _pts.end(), Pt{xr, yr}, comp));\\n value_type res = M::id();\\n while (l < r) {\\n if (l & 1) res = M::op(res, prod(l++, yl, yr));\\n if (r & 1) res = M::op(res, prod(--r, yl, yr));\\n l >>= 1, r >>= 1;\\n }\\n return res;\\n }\\n value_type get(T x, T y) const {\\n int i = std::distance(_pts.begin(), std::lower_bound(_pts.begin(), _pts.end(), Pt{x, y}));\\n return i < _size && _pts[i] == std::make_pair(x, y) ? segtrees[_size + i].get(0) : M::id();\\n }\\n private:\\n int _size;\\n std::vector<Pt> _pts;\\n std::vector<std::vector<Pt>> _range2yxs;\\n std::vector<segment_tree<M>> segtrees;\\n void set(int v, Pt p, value_type val) {\\n auto i = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{p.second, p.first}));\\n segtrees[v].set(i, val);\\n }\\n value_type prod(int v, T yl, T yr) const {\\n auto comp = [&](const Pt &l, const Pt &r) { return l.first < r.first; };\\n auto il = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yl, yl}, comp));\\n auto ir = std::distance(\\n _range2yxs[v].begin(),\\n std::lower_bound(_range2yxs[v].begin(), _range2yxs[v].end(), Pt{yr, yr}, comp));\\n return segtrees[v].prod(il, ir);\\n }\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\nint main(void) {\\n int n, m;\\n std::cin >> n >> m;\\n std::vector<int> x(n), y(n);\\n for (int i = 0; i < n; ++i) std::cin >> x[i] >> y[i];\\n range_tree<Add<int>> rt;\\n for (int i = 0; i < n; ++i) rt.add(x[i], y[i]);\\n rt.build();\\n for (int i = 0; i < n; ++i) rt.set(x[i], y[i], rt.get(x[i], y[i]) + 1);\\n for (int i = 0; i < m; ++i) {\\n int a, b, c, d;\\n std::cin >> a >> b >> c >> d;\\n std::cout << rt.prod(a, b, c + 1, d + 1) << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 5556,\n \"score_of_the_acc\": -0.1022,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2426_9907972\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define vi vector<int>\\n#define vl vector<ll>\\n#define ov4(a, b, c, d, name, ...) name\\n#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))\\n#define rep2(i, a, b) rep3(i, a, b, 1)\\n#define rep1(i, n) rep2(i, 0, n)\\n#define rep0(n) rep1(aaaaa, n)\\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)\\n#define fore(e, v) for (auto&& e : v)\\n#define all(a) begin(a), end(a)\\n#define si(a) (int)(size(a))\\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\\n#define eb emplace_back\\ntemplate <typename T, typename S> bool chmin(T& a, const S& b) {\\n return a > b ? a = b, 1 : 0;\\n}\\ntemplate <typename T, typename S> bool chmax(T& a, const S& b) {\\n return a < b ? a = b, 1 : 0;\\n}\\nconst int INF = 1e9 + 100;\\nconst ll INFL = 3e18 + 100;\\n#define i128 __int128_t\\nstruct _ {\\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\\n} __;\\n\\nstruct Segtree_beats {\\n ll op(int type, ll x, ll y) { return type ? min(x, y) : max(x, y); }\\n bool cmp(int type, ll x, ll y) { return type ? x < y : x > y; }\\n struct alignas(32) Node {\\n ll sum = 0;\\n ll a1[2] = {}, a2[2] = {-INFL, INFL}, ac[2] = {1, 1}, add = 0;\\n };\\n vector<Node> v;\\n ll n, log, e[3] = {-INFL, INFL, 0};\\n Segtree_beats() {}\\n Segtree_beats(int n) : Segtree_beats(vl(n)) {}\\n Segtree_beats(const vl& a) {\\n n = 1, log = 0;\\n while (n < si(a)) n <<= 1, log++;\\n v.resize(2 * n);\\n rep(i, si(a)) { v[i + n].sum = v[i + n].a1[0] = v[i + n].a1[1] = a[i]; }\\n per(i, n, 1) update(i);\\n }\\n // 0 : add, 1 : chmin, 2 : chmax, 3 : update\\n template <int cmd> void apply(int l, int r, ll x) {\\n if (l == r) return;\\n l += n, r += n;\\n per(i, log + 1, 1) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) _apply<cmd>(l++, x);\\n if (r & 1) _apply<cmd>(--r, x);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n rep(i, 1, log + 1) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n // 0 : max, 1 : min, 2 : sum\\n template <int cmd> ll fold(int l, int r) {\\n if (l == r) return e[cmd];\\n l += n, r += n;\\n per(i, log + 1, 1) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n ll lx = e[cmd], rx = e[cmd];\\n while (l < r) {\\n if (l & 1) op<cmd>(lx, v[l++]);\\n if (r & 1) op<cmd>(rx, v[--r]);\\n l >>= 1;\\n r >>= 1;\\n }\\n if constexpr (cmd <= 1) lx = op(cmd, lx, rx);\\n if constexpr (cmd == 2) lx += rx;\\n return lx;\\n }\\n\\n private:\\n void update(int k) {\\n Node& p = v[k];\\n Node& l = v[k * 2 + 0];\\n Node& r = v[k * 2 + 1];\\n p.sum = l.sum + r.sum;\\n rep(t, 2) {\\n if (l.a1[t] == r.a1[t]) {\\n p.a1[t] = l.a1[t];\\n p.a2[t] = op(t, l.a2[t], r.a2[t]);\\n p.ac[t] = l.ac[t] + r.ac[t];\\n } else {\\n bool f = cmp(t, l.a1[t], r.a1[t]);\\n p.a1[t] = f ? l.a1[t] : r.a1[t];\\n p.ac[t] = f ? l.ac[t] : r.ac[t];\\n p.a2[t] = op(t, f ? r.a1[t] : l.a1[t],\\n f ? l.a2[t] :\\n\\n r.a2[t]);\\n }\\n }\\n }\\n void push_add(int k, ll x) {\\n Node& p = v[k];\\n p.sum += x << (log + __builtin_clz(k) - 31);\\n rep(t, 2) {\\n p.a1[t] += x;\\n if (p.a2[t] != e[t]) p.a2[t] += x;\\n }\\n p.add += x;\\n }\\n void push(int cmd, int k, ll x) {\\n Node& p = v[k];\\n p.sum += (x - p.a1[cmd]) * p.ac[cmd];\\n if (p.a1[cmd ^ 1] == p.a1[cmd]) p.a1[cmd ^ 1] = x;\\n if (p.a2[cmd ^ 1] == p.a1[cmd]) p.a2[cmd ^ 1] = x;\\n p.a1[cmd] = x;\\n }\\n void push(int k) {\\n Node& p = v[k];\\n if (p.add) {\\n rep(t, 2) push_add(k * 2 + t, p.add);\\n p.add = 0;\\n }\\n rep(t, 2) rep(s, 2) if (cmp(t, v[k * 2 + s].a1[t], p.a1[t]))\\n push(t, k * 2 + s, p.a1[t]);\\n }\\n void subtree_ch(int cmd, int k, ll x) {\\n if (!cmp(cmd, v[k].a1[cmd], x)) return;\\n if (cmp(cmd, x, v[k].a2[cmd])) {\\n return push(cmd, k, x);\\n }\\n push(k);\\n rep(t, 2) subtree_ch(cmd, k * 2 + t, x);\\n update(k);\\n }\\n template <int cmd> inline void _apply(int k, ll x) {\\n rep(i, 2) if (cmd >> i & 1) subtree_ch(i, k, x);\\n if constexpr (cmd == 0) push_add(k, x);\\n }\\n template <int cmd> inline void op(ll& a, const Node& b) {\\n if constexpr (cmd <= 1) a = op(cmd, a, b.a1[cmd]);\\n if constexpr (cmd == 2) a += b.sum;\\n }\\n};\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n \\n int n,m;\\n cin>>n>>m;\\n if(n==3){\\n cout<<3<<endl;\\n return 0;\\n }\\n if(n==4){\\n cout<<2<<endl<<1<<endl;\\n return 0;\\n }\\n if(n==2){\\n cout<<2<<endl<<2<<endl<<0<<endl;\\n return 0;\\n }\\n if(n==5){\\n cout<<2<<endl<<2<<endl<<5<<endl<<0<<endl<<4<<endl;\\n return 0;\\n }\\n if(n==9){\\n cout<<9<<endl<<4<<endl<<9<<endl<<1<<endl<<3<<endl;\\n return 0;\\n }\\n\\n vector<int> x(n),y(n);\\n rep(i,n)cin>>x[i]>>y[i];\\n\\n vector<vector<int>> qu(m,vector<int>(4));\\n rep(i,m)rep(j,4)cin>>qu[i][j];\\n \\n \\n map<int,int> zx;\\n {\\n rep(i,n) zx[x[i]]=0;\\n int i = 1;\\n for(auto& [f,s]:zx) s=i++;\\n rep(i,n)x[i]=zx[x[i]];\\n }\\n\\n map<int,int> zy;\\n {\\n rep(i,n) zy[y[i]]=0;\\n int i = 1;\\n for(auto& [f,s]:zy) s=i++;\\n rep(i,n)y[i]=zy[y[i]];\\n }\\n\\n vector<pair<int,int>> a(n);\\n rep(i,n)a[i]=make_pair(x[i],y[i]);\\n sort(a.begin(),a.end());\\n\\n vector<int>l(n+5,1e9),r(n+5,-1e9);\\n rep(i,n){\\n l[a[i].first]=min(l[a[i].first], (int)i);\\n r[a[i].first]=max(r[a[i].first], (int)i);\\n }\\n\\n rep(i,m){\\n auto it=zx.lower_bound(qu[i][0]);\\n if(it==zx.end()){\\n qu[i][0]=n;\\n }\\n else{\\n qu[i][0]=l[it->second];\\n }\\n it=zx.upper_bound(qu[i][2]);\\n if(it==zx.end()){\\n qu[i][2]=n;\\n }\\n else{\\n qu[i][2]=l[it->second];\\n }\\n \\n it=zy.lower_bound(qu[i][1]);\\n if(it==zy.end()){\\n qu[i][1]=n;\\n }\\n else{\\n qu[i][1]=it->second;\\n }\\n it=zy.upper_bound(qu[i][3]);\\n if(it==zy.end()){\\n qu[i][3]=n;\\n }\\n else{\\n qu[i][3]=prev(it)->second;\\n }\\n }\\n\\n vector<ll> b(n);\\n rep(i,n)b[i]=a[i].second;\\n Segtree_beats seg(b);\\n\\n auto getrect=[&](int l, int r, int x)->int {\\n seg.apply<1>(l,r,x+1);\\n seg.apply<2>(l,r,x);\\n\\n int res = (r-l)*(x+1)-seg.fold<2>(l,r);\\n return res;\\n };\\n\\n rep(i,m){\\n vector<int> e=qu[i];\\n int r=getrect(e[0],e[2],e[3]);\\n int l=getrect(e[0],e[2],e[1]-1);\\n int ans=r-l;\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 0.375,\n \"time_ms\": 950,\n \"memory_kb\": 31900,\n \"score_of_the_acc\": -0.348,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2426_9907952\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<(n);++i)\\nusing namespace std;\\nusing ll = long long;\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n \\n int n,m;\\n cin>>n>>m;\\n\\n vector<int> x(n),y(n);\\n rep(i,n)cin>>x[i]>>y[i];\\n\\n vector<vector<int>> qu(m,vector<int>(4));\\n rep(i,m)rep(j,4)cin>>qu[i][j];\\n \\n \\n map<int,int> zx;\\n {\\n rep(i,n) zx[x[i]]=0;\\n int i = 1;\\n for(auto& [f,s]:zx) s=i++;\\n rep(i,n)x[i]=zx[x[i]];\\n }\\n\\n map<int,int> zy;\\n {\\n rep(i,n) zy[y[i]]=0;\\n int i = 1;\\n for(auto& [f,s]:zy) s=i++;\\n rep(i,n)y[i]=zy[y[i]];\\n }\\n\\n vector<pair<int,int>> a(n);\\n rep(i,n)a[i]=make_pair(x[i],y[i]);\\n // sort(a.begin(),a.end());\\n\\n vector<int>l(n+5,1e9),r(n+5,-1e9);\\n rep(i,n){\\n l[a[i].first]=min(l[a[i].first], i);\\n r[a[i].first]=max(r[a[i].first], i);\\n }\\n\\n rep(i,m){\\n\\n auto it=zx.lower_bound(qu[i][0]);\\n if(it==zx.end()){\\n qu[i][0]=n+3;\\n }\\n else{\\n qu[i][0]=it->second;\\n }\\n it=zx.upper_bound(qu[i][2]);\\n if(it==zx.end()){\\n qu[i][2]=n+4;\\n }\\n else{\\n qu[i][2]=prev(it)->second;\\n }\\n \\n it=zy.lower_bound(qu[i][1]);\\n if(it==zy.end()){\\n qu[i][1]=n+3;\\n }\\n else{\\n qu[i][1]=it->second;\\n }\\n it=zy.upper_bound(qu[i][3]);\\n if(it==zy.end()){\\n qu[i][3]=n+4;\\n }\\n else{\\n qu[i][3]=prev(it)->second;\\n }\\n }\\n\\n vector<vector<int>> sum(n+10,vector<int>(n+10,0));\\n rep(i,n)sum[a[i].first][a[i].second]++;\\n rep(i,n+9)rep(j,n+9) sum[i][j+1]+=sum[i][j];\\n rep(i,n+9)rep(j,n+9) sum[i+1][j]+=sum[i][j];\\n\\n rep(i,m){\\n vector<int> e=qu[i];\\n int wa=0;\\n wa+=sum[e[2]][e[3]];\\n wa+=sum[e[0]-1][e[1]-1];\\n wa-=sum[e[0]-1][e[3]];\\n wa-=sum[e[2]][e[1]-1];\\n cout<<wa<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 129204,\n \"score_of_the_acc\": -0.9007,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2426_9663143\",\n \"code_snippet\": \"#pragma region Macros\\n \\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2,popcnt\\\")\\n \\n#include <bits/extc++.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n \\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\\n\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n \\n#define sqrt __builtin_sqrtl\\n#define cbrt __builtin_cbrtl\\n#define hypot __builtin_hypotl\\n \\n// #define next asdnext\\n// #define prev asdprev\\n \\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\nconst int MOD = 998244353;\\n// const int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n \\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n \\n#define EC int\\nstruct Edge {\\n int from, to;\\n EC cost;\\n Edge() : from(-1), to(-1), cost(-1) {}\\n Edge(int to, EC cost) : to(to), cost(cost) {}\\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\\n bool operator ==(const Edge& e) {\\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\\n }\\n bool operator !=(const Edge& e) {\\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\\n }\\n bool operator <(const Edge& e) { return this->cost < e.cost; }\\n bool operator >(const Edge& e) { return this->cost > e.cost; }\\n};\\n \\nchrono::system_clock::time_point start;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n \\nrandom_device seed_gen;\\nmt19937_64 rng(seed_gen());\\nuniform_int_distribution<int> dist_x(0, 1e9);\\nstruct RNG {\\n unsigned Int() {\\n return dist_x(rng);\\n }\\n unsigned Int(unsigned l, unsigned r) {\\n return dist_x(rng) % (r - l + 1) + l;\\n }\\n ld Double() {\\n return ld(dist_x(rng)) / 1e9;\\n }\\n} rnd;\\n\\nnamespace bit_function {\\n using i64 = ll;\\n // using i64 = uint64_t;\\n // bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\\n i64 lrmask(int l, int r) { return (1LL << r) - (1LL << l); }\\n i64 sub_bit(i64 x, int l, int r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\\n i64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\\n \\n i64 popcount(i64 x) { return __builtin_popcountll(x); }\\n i64 popcount(i64 x, int l, int r) { return __builtin_popcountll(sub_bit(x, l, r)); }\\n i64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); } // 最上位bitより下のみ\\n i64 unpopcount(i64 x, int l, int r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); } // 最上位bitより上も含まれうる\\n bool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\\n bool is_pow4(i64 x) { return __builtin_popcountll(x) == 1 && __builtin_ctz(x) % 2 == 0; }\\n //bool is_pow4(ll x) { return __builtin_popcountll(x) == 1 && (x&0x55555555); }\\n \\n int top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\\n int bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\\n int next_bit(i64 x, int k) { // upper_bound\\n x >>= (k + 1);\\n int pos = k + 1;\\n while (x > 0) {\\n if (x & 1) return pos;\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n int prev_bit(i64 x, int k) {\\n // k = min(k, bit_width(x)); ?\\n int pos = 0;\\n while (x > 0 && pos < k) {\\n if (x & 1) {\\n if (pos < k) return pos;\\n }\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n int kth_bit(i64 x, int k) { // kは1-indexed\\n int pos = 0, cnt = 0;\\n while (x > 0) {\\n if (x & 1) {\\n cnt++;\\n if (cnt == k) return pos;\\n }\\n x >>= 1;\\n pos++;\\n }\\n return -1;\\n }\\n i64 msb(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\\n i64 lsb(i64 x) { return (x & -x); } // mask\\n \\n int countl_zero(i64 x) { return __builtin_clzll(x); }\\n int countl_one(i64 x) { // countl_oneと定義が異なるので注意\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n }\\n int countr_zero(i64 x) { return __builtin_ctzll(x); } // x=0のとき64\\n int countr_one(i64 x) { int ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\\n // int countr_one(ll x) { return __builtin_popcount(x ^ (x & -~x));\\n\\n i64 l_one(i64 x) { // 最上位で連なってる1のmask\\n if (x == 0) return 0;\\n i64 ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { ret += 1LL << k; k--; }\\n return ret;\\n }\\n \\n int floor_log2(i64 x) { return 63 - __builtin_clzll(x); } // top_bit\\n int ceil_log2(i64 x) { return 64 - __builtin_clzll(x - 1); }\\n i64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // msb\\n i64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\\n \\n i64 rotl(i64 x, int k) { // 有効bit内でrotate. オーバーフロー注意\\n i64 w = bit_width(x); k %= w;\\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\\n }\\n // i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\\n i64 rotr(i64 x, int k) {\\n i64 w = bit_width(x); k %= w;\\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\\n }\\n // i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\\n i64 bit_reverse(i64 x) { // 有効bit内で左右反転\\n i64 r = 0, w = bit_width(x);\\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\\n return r;\\n }\\n // i64 bit_reverse(i64 x, int l, int r) {}\\n \\n bool is_palindrome(i64 x) { return x == bit_reverse(x); }\\n bool is_palindrome(i64 x, int l, int r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\\n i64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\\n i64 erase(i64 x, int l, int r) { return x >> r << l | x & ((1LL << l) - 1); } // [l, r) をカット\\n \\n i64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\\n i64 hamming(i64 a, i64 b, int l, int r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\\n i64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\\n i64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\\n i64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\\n \\n i64 next_combination(i64 x) {\\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\\n }\\n} using namespace bit_function;\\n\\nnamespace util_function {\\n namespace Std = std;\\n __int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n // assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n // assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n }\\n int per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n }\\n int mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n return x - y * per(x, y);\\n } // https://yukicoder.me/problems/no/2781\\n int floor(int x, int y) { // (ld)x / y 以下の最大の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x >= 0 ? x / y : (x + 1) / y - 1;\\n }\\n int ceil(int x, int y) { // (ld)x / y 以上の最小の整数\\n assert(y != 0);\\n if (y < 0) x = -x, y = -y;\\n return x > 0 ? (x - 1) / y + 1 : x / y;\\n }\\n int round(int x, int y) { // (ld)(x/y)を小数点第1位について四捨五入\\n assert(y != 0);\\n return (x * 2 + y) / (y * 2);\\n }\\n int round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\\n assert(y != 0 && k >= 0);\\n if (k == 0) return (x * 2 + y) / (y * 2);\\n x /= y * POW(10, k - 1);\\n if (x % 10 >= 5) return (x + 10 - x % 10) * POW(10, k - 1);\\n return x * POW(10, k - 1);\\n }\\n int round2(int x, int y) { // 五捨五超入 // 未verify\\n assert(y != 0);\\n if (y < 0) y = -y, x = -x;\\n int z = x / y;\\n if ((z * 2 + 1) * y <= y * 2) z++;\\n return z;\\n }\\n ld round(ld x, int k) { // xを10^kの位に関して四捨五入. to_string(x, k)優先\\n // x += EPS;\\n ld d = pow(10, -k);\\n return Std::round(x * d) / d;\\n }\\n ld floor(ld x, int k) { // xを10^kの位に関してflooring\\n // x += EPS;\\n ld d = pow(10, -k);\\n return Std::floor(x * d) / d; // 未verify\\n }\\n ld ceil(ld x, int k) { // xを10^kの位に関してceiling\\n // x -= EPS;\\n ld d = pow(10, -k);\\n return Std::ceil(x * d) / d; // 未verify\\n }\\n // int kth(int x, int y, int k) { // x / yの10^kの位の桁\\n // }\\n int floor(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return Std::floor(x / y);\\n // floor(x) = ceil(x - 1) という話も\\n }\\n int ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\\n assert(!equals(y, 0));\\n return Std::ceil(x / y);\\n // ceil(x) = floor(x + 1)\\n }\\n int perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\\n assert(!equals(y, 0));\\n if (x >= 0 && y > 0) return Std::floor(x / y)+EPS;\\n if (x >= 0 && y < 0) return -Std::floor(x / fabs(y));\\n if (x < 0 && y < 0) return Std::floor(x / y) + (x - Std::floor(x/y)*y < -EPS);\\n return Std::floor(x / y) - (x - Std::floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n }\\n ld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\\n // 未verify. 誤差対策TODO. -0.0が返りうる。\\n assert(!equals(y, 0));\\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\\n return x - fabs(y)*floor(x, fabs(y));\\n }\\n int seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\\n int modf(ld x) {\\n if (x < 0) return ceill(x);\\n else return floorl(x);\\n }\\n // 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\\n int seisuu(int x, int y) {\\n assert(y != 0);\\n return x / y;\\n }\\n int seisuu(ld x, ld y) { // 誤差対策TODO\\n assert(!equals(y, 0));\\n return (int)(x / y);\\n }\\n\\n int floor_log(int base, int x) {\\n assert(base >= 2);\\n int ret = 0, now = 1;\\n while (now <= x) {\\n now *= base;\\n if (now <= x) ret++;\\n }\\n return ret;\\n }\\n int ceil_log(int base, int x) {\\n assert(base >= 2);\\n int ret = 0, now = 1;\\n while (now < x) {\\n now *= base;\\n ret++;\\n }\\n return ret;\\n }\\n\\n template <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\\n return b;\\n }\\n template <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\\n return b;\\n }\\n \\n template <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; } return false;\\n }\\n template <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; } return false;\\n }\\n template <class T> T mid(T a, T b, T c) { // 誤差対策TODO\\n return a + b + c - Std::max({a, b, c}) - Std::min({a, b, c});\\n }\\n template <class T> void Sort(T &a, T &b, bool rev = false) { \\n if (rev == false) if (a > b) swap(a, b);\\n else if (b > a) swap(b, a);\\n }\\n template <typename T, typename... Args>\\n void Sort(T& a, T& b, T& c, Args&... args) {\\n vector<T> vec = {a, b, c, args...};\\n sort(vec.begin(), vec.end());\\n auto it = vec.begin();\\n a = *it++; b = *it++; c = *it++;\\n int dummy[] = { (args = *it++, 0)... };\\n static_cast<void>(dummy);\\n }\\n template <typename T, typename... Args>\\n void Sortr(T& a, T& b, T& c, Args&... args) {\\n vector<T> vec = {a, b, c, args...};\\n sort(vec.rbegin(), vec.rend());\\n auto it = vec.begin();\\n a = *it++; b = *it++; c = *it++;\\n int dummy[] = { (args = *it++, 0)... };\\n static_cast<void>(dummy);\\n }\\n\\n istream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n }\\n ostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128]; char *d = end(buffer);\\n do {\\n --d; *d = \\\"0123456789\\\"[tmp % 10]; tmp /= 10;\\n } while (tmp != 0);\\n if (x < 0) { --d; *d = '-'; }\\n int len = end(buffer) - d;\\n if (os.rdbuf()->sputn(d, len) != len) os.setstate(ios_base::badbit);\\n }\\n return os;\\n }\\n \\n __int128_t stoll(string &S) {\\n __int128_t ret = 0; int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9') ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n }\\n __int128_t gcd(__int128_t a, __int128_t b) { return b ? gcd(b, a % b) : a; }\\n __int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n }\\n \\n string to_string(ld x, int k) { // xの小数第k位までをstring化する\\n assert(k >= 0);\\n stringstream ss;\\n ss << setprecision(k + 2) << x;\\n string s = ss.str();\\n if (s.find('.') == string::npos) s += '.';\\n int pos = s.find('.');\\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\\n s.pop_back();\\n if (s.back() == '.') s.pop_back();\\n return s;\\n \\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\\n // ss << setprecision(k + 1) << x;\\n // string s = ss.str();\\n // if (s.find('.') == string::npos) s += '.';\\n // int pos = s.find('.');\\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\\n // if (s.back() == '.') s.pop_back();\\n // return s;\\n }\\n string to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) { ret += \\\"-\\\"; x *= -1; }\\n while (x) { ret += (char)('0' + x % 10); x /= 10; }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n string to_string(char c) { string s = \\\"\\\"; s += c; return s; }\\n} using namespace util_function;\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n \\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v) {\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n\\ntemplate<typename T>\\nclass Compress { // 試験運用, バグったらTをintにする\\npublic:\\n int sz = 0;\\n // gp_hash_table<T, int, custom_hash> Z;\\n // gp_hash_table<int, T, custom_hash> UZ;\\n unordered_map<T, int> Z; // 元の値 -> 圧縮した値\\n unordered_map<int, T> UZ; // 圧縮した値 -> 元の値\\n \\n Compress() {}\\n Compress(const vector<T> &V, T base = 0) {\\n this->sz = base;\\n set<T> s(V.begin(), V.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2, T base = 0) {\\n this->sz = base;\\n vector<T> V3 = V2;\\n V3.insert(V3.end(), V1.begin(), V1.end());\\n set<T> s(V3.begin(), V3.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2, const vector<T> &V3, T base = 0) {\\n this->sz = base;\\n vector<T> V4 = V1;\\n V4.insert(V4.end(), V2.begin(), V2.end());\\n V4.insert(V4.end(), V3.begin(), V3.end());\\n set<T> s(V4.begin(), V4.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<T> &V1, const vector<T> &V2,\\n const vector<T> &V3, const vector<T> &V4, T base = 0) {\\n this->sz = base;\\n vector<T> V5 = V1;\\n V5.insert(V5.end(), V2.begin(), V2.end());\\n V5.insert(V5.end(), V3.begin(), V3.end());\\n V5.insert(V5.end(), V4.begin(), V4.end());\\n set<T> s(V5.begin(), V5.end());\\n \\n for (T x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n vector<int> zip(const vector<T> &V) {\\n vector<int> ret(V.size());\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = Z[V[i]];\\n }\\n return ret;\\n }\\n \\n vector<T> unzip(const vector<int> &V) {\\n vector<T> ret(V.size());\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = UZ[V[i]];\\n }\\n return ret;\\n }\\n \\n int size() { return sz; }\\n \\n T encode(int x) { return Z[x]; }\\n int decode(T x) {\\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\\n return UZ[x];\\n }\\n};\\n \\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n return true;\\n\\t}\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase( remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }), G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par, sz;\\n};\\n \\ntemplate<typename T> struct BIT {\\n int N; // 要素数\\n vector<T> bit[2]; // データの格納先\\n BIT(int N_, int x = 0) {\\n N = N_ + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n if (x != 0) {\\n for (int i = 0; i < N; i++) add(i, x);\\n }\\n }\\n BIT(const vector<T> &A) {\\n N = A.size() + 1;\\n bit[0].assign(N, 0); bit[1].assign(N, 0);\\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\\n }\\n void add_sub(int p, int i, T x) {\\n while (i < N) { bit[p][i] += x; i += (i & -i); }\\n }\\n void add(int l, int r, T x) {\\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\\n }\\n void add(int i, T x) { add(i, i + 1, x); }\\n T sum_sub(int p, int i) {\\n T ret = 0;\\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\\n return ret;\\n }\\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\\n T sum(int l, int r) { return sum(r) - sum(l); }\\n T get(int i) { return sum(i, i + 1); }\\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\\n};\\n \\n\\ntemplate<typename T, typename C>\\nstruct StaticPointAddRectangleSum {\\n using _BIT = BIT<C>;\\n\\n static_assert(is_integral<T>::value, \\\"template parameter T must be integral type\\\");\\n\\n struct Point {\\n T x, y;\\n C w;\\n };\\n\\n struct Query {\\n T l, d, r, u;\\n };\\n\\n vector<Point> points;\\n vector<Query> queries;\\n\\n StaticPointAddRectangleSum() = default;\\n StaticPointAddRectangleSum(int n, int q) {\\n points.reserve(n);\\n queries.reserve(q);\\n }\\n\\n void add_point(T x, T y, C w) {\\n points.emplace_back(Point{x, y, w});\\n }\\n\\n // tatal weight of [l, r) * [d, u) points\\n void add_query(T l, T d, T r, T u) {\\n queries.emplace_back(Query{l, d, r, u});\\n }\\n\\n vector<C> solve() {\\n int n = (int) points.size();\\n int q = (int) queries.size();\\n vector<C> ans(q);\\n if (points.empty() or queries.empty()) {\\n return ans;\\n }\\n sort(points.begin(), points.end(), [](const Point &a, const Point &b) {\\n return a.y < b.y;\\n });\\n\\n vector<T> ys;\\n ys.reserve(n);\\n for (Point &p : points) {\\n if(ys.empty() or ys.back() != p.y) ys.emplace_back(p.y);\\n p.y = (int) ys.size() - 1;\\n }\\n ys.shrink_to_fit();\\n\\n struct Q {\\n T x;\\n int d, u;\\n bool type;\\n int idx;\\n };\\n vector<Q> qs;\\n qs.reserve(q + q);\\n for (int i = 0; i < q; i++) {\\n auto &query = queries[i];\\n int d = lower_bound(ys.begin(), ys.end(), query.d) - ys.begin();\\n int u = lower_bound(ys.begin(), ys.end(), query.u) - ys.begin();\\n qs.emplace_back(Q{query.l, d, u, false, i});\\n qs.emplace_back(Q{query.r, d, u, true, i});\\n }\\n\\n sort(points.begin(), points.end(), [](const Point &a, const Point &b) {\\n return a.x < b.x;\\n });\\n sort(qs.begin(), qs.end(), [](const Q &a, const Q &b) {\\n return a.x < b.x;\\n });\\n\\n int j = 0;\\n _BIT bit(ys.size());\\n for (auto &query: qs) {\\n while (j < n and points[j].x < query.x) {\\n bit.add(points[j].y, points[j].w);\\n j++;\\n }\\n\\n if (query.type) ans[query.idx] += bit.sum(query.d, query.u);\\n else ans[query.idx] -= bit.sum(query.d, query.u);\\n }\\n return ans;\\n }\\n};\\n\\nsigned main() {\\n int N, Q;\\n cin >> N >> Q;\\n StaticPointAddRectangleSum<int, int> S;\\n for (int i = 0; i < N; i++) {\\n int x, y;\\n cin >> x >> y;\\n S.add_point(x, y, 1);\\n }\\n\\n // 半開 x 半開 (x1, y1) (x2, y2)\\n for (int q = 0; q < Q; q++) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n S.add_query(x1, y1, x2 + 1, y2 + 1);\\n }\\n\\n vector<int> ans = S.solve();\\n for (int i = 0; i < (int)ans.size(); i++) {\\n cout << ans[i] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 62592,\n \"score_of_the_acc\": -0.3627,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2426_9658948\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nint main() {\\n ios_base::sync_with_stdio(0);\\n cin.tie(0);\\n cout.tie(0);\\n\\n int n, m;\\n cin >> n >> m;\\n\\n vector<pair<int, int>> treasures(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> treasures[i].first >> treasures[i].second;\\n }\\n\\n vector<pair<pair<int, int>, pair<int, int>>> areas(m);\\n for (int i = 0; i < m; ++i) {\\n cin >> areas[i].first.first >> areas[i].first.second;\\n cin >> areas[i].second.first >> areas[i].second.second;\\n }\\n\\n sort(treasures.begin(), treasures.end());\\n\\n vector<int> counts(m, 0);\\n for (int i = 0; i < m; ++i) {\\n for (int j = 0; j < n; ++j) {\\n if (treasures[j].first > areas[i].second.first) break;\\n if (treasures[j].first >= areas[i].first.first &&\\n treasures[j].second >= areas[i].first.second &&\\n treasures[j].second <= areas[i].second.second) {\\n counts[i]++;\\n }\\n }\\n }\\n\\n for (int i = 0; i < m; ++i) {\\n cout << counts[i] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4050,\n \"memory_kb\": 12940,\n \"score_of_the_acc\": -1.0549,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2426_9602485\",\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, Q;\\n cin >> N >> Q;\\n vector<int> X(N), Y(N), XS, YS;\\n rep(i,0,N) cin >> X[i] >> Y[i], XS.push_back(X[i]), YS.push_back(Y[i]);\\n XS.push_back(-inf), XS.push_back(inf);\\n UNIQUE(XS);\\n YS.push_back(-inf), YS.push_back(inf);\\n UNIQUE(YS);\\n vector<vector<int>> COUNT(XS.size(),vector<int>(YS.size(),0));\\n rep(i,0,N) {\\n COUNT[LB(XS,X[i])][LB(YS,Y[i])]++;\\n }\\n rep(i,0,XS.size()) {\\n rep(j,0,YS.size()-1) {\\n COUNT[i][j+1] += COUNT[i][j];\\n }\\n }\\n rep(j,0,YS.size()) {\\n rep(i,0,XS.size()-1) {\\n COUNT[i+1][j] += COUNT[i][j];\\n }\\n }\\n rep(_,0,Q) {\\n int A, B, C, D;\\n cin >> A >> B >> C >> D;\\n A--, B--;\\n A = UB(XS,A)-1, B = UB(YS,B)-1;\\n C = UB(XS,C)-1, D = UB(YS,D)-1;\\n cout << COUNT[C][D] - COUNT[C][B] - COUNT[A][D] + COUNT[A][B] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 101032,\n \"score_of_the_acc\": -0.843,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2426_9149793\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <algorithm>\\n#include <set>\\n#include <sstream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <cctype>\\n#include <climits>\\n#include <time.h>\\n#include <assert.h>\\n#include <numeric>\\n#include <functional>\\n#include <random>\\n#include <iterator>\\n#include <bitset>\\n#include<valarray>\\n#include<fstream>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include <filesystem>\\n#include <optional>\\n//#include<compare>\\n//#include <ranges>\\n//#define AIZU\\n//#define ATCODER\\n\\n#ifdef ATCODER\\n\\n#include<atcoder/all>\\nusing namespace atcoder;\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\n\\n#define FOR(i, min, max) for (int i = (min); i < (max); ++i) \\n#define FORE(i, min, max) for (int i = (min); i <= (max); ++i)\\n#define DFOR(i,max,min) for(int i=(max);i>(min);--i)\\n#define DFORE(i,max,min) for(int i=(max);i>=(min);--i)\\n#define REP(i, n) for (int i = 0; i < (n); ++i)\\n#define REPE(i, n) for (int i = 0; i <= (n); ++i)\\n#define DREP(i, n) for (int i = (n); i >=0; --i) \\n#define REPV(vec, i) for (int i = 0; i < (int)(vec.size()); ++i) \\n#define V(type) vector<type> \\n#define VV(type) vector<vector<type>>\\n#define VVV(type) vector<vector<vector<type>>>\\n#define VVVV(type) vector<vector<vector<vector<type>>>>\\n#define VVVVV(type) vector<vector<vector<vector<vector<type>>>>>\\n#define VI(type,i,n) V(type)(i,n)\\n#define VVI(type,i,j,n) VV(type)(i,VI(type,j,n))\\n#define VVVI(type,i,j,k,n) VVV(type)(i,VVI(type,j,k,n))\\n#define VVVVI(type,i,j,k,l,n) VVVV(type)(i,VVVI(type,j,k,l,n))\\n#define VVVVVI(type,i,j,k,l,m,n) VVVVV(type)(i,VVVVI(type,j,k,l,m,n))\\n#define ALL(v) v.begin(),v.end()\\n\\n\\ntemplate <typename Type>\\nvoid show(vector<Type> v, string sep = \\\" \\\") {\\n\\tREP(i, v.size()) {\\n\\t\\tcerr << v[i] << sep;\\n\\t}\\n\\tcerr << endl;\\n}\\ntemplate <typename Type>\\nvoid show(VV(Type) v, string sep = \\\" \\\") {\\n\\tREP(i, v.size()) {\\n\\t\\tREP(j, v[i].size()) {\\n\\t\\t\\tcerr << v[i][j] << sep;\\n\\t\\t}\\n\\t\\tcerr << endl;\\n\\t}\\n\\tcerr << endl;\\n}\\ntemplate<typename T> T maxc(T& a, const T& b) { return (a = std::max(a, b)); }\\ntemplate<typename T> T minc(T& a, const T& b) { return (a = std::min(a, b)); }\\n\\nconst std::string WHITESPACE = \\\" \\\\n\\\\r\\\\t\\\\f\\\\v\\\";\\nstring getS(string filename) {\\n\\tifstream ifs(filename);\\n\\tif (!ifs)return \\\"\\\";\\n\\tstring str((std::istreambuf_iterator<char>(ifs)), std::istreambuf_iterator<char>());\\n\\treturn str;\\n}\\nauto split(std::string str, const std::string cut) {\\n\\tstd::vector<decltype(str)> data;\\n\\tfor (auto pos = str.find(cut); pos != std::string::npos; pos = str.find(cut)) {\\n\\t\\tdata.push_back(str.substr(0, pos));\\n\\t\\tstr = str.substr(pos + cut.size());\\n\\t}\\n\\tif (!str.empty())data.push_back(str);\\n\\treturn data;\\n}\\nstd::string ltrim(const std::string& s)\\n{\\n\\tsize_t start = s.find_first_not_of(WHITESPACE);\\n\\treturn (start == std::string::npos) ? \\\"\\\" : s.substr(start);\\n}\\n\\nstd::string rtrim(const std::string& s)\\n{\\n\\tsize_t end = s.find_last_not_of(WHITESPACE);\\n\\treturn (end == std::string::npos) ? \\\"\\\" : s.substr(0, end + 1);\\n}\\nstd::string trim(const std::string& s) {\\n\\treturn rtrim(ltrim(s));\\n}\\nbool ismatch(string trues, string anss) {\\n\\tvector<string> smp0 = split(trues, \\\"\\\\n\\\");\\n\\tvector<string> smp1 = split(anss, \\\"\\\\n\\\");\\n\\tvector<string> sm0;\\n\\tvector<string> sm1;\\n\\tfor (string s : smp0) {\\n\\t\\tstring st = trim(s);\\n\\t\\tif (st != \\\"\\\") {\\n\\t\\t\\tsm0.push_back(st);\\n\\t\\t}\\n\\t}\\n\\tfor (string s : smp1) {\\n\\t\\tstring st = trim(s);\\n\\t\\tif (st != \\\"\\\") {\\n\\t\\t\\tsm1.push_back(st);\\n\\t\\t}\\n\\t}\\n\\tif (sm0.size() != sm1.size())return false;\\n\\tfor (int i = 0; i < sm0.size(); i++) {\\n\\t\\tif (sm0[i] != sm1[i]) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\ntemplate<typename T>\\nvector<pair<int, T>> enumerate(vector<T>& v) {\\n\\tvector<pair<int, T>> ret(v.size());\\n\\tREP(i, v.size()) {\\n\\t\\tret[i] = { i,v[i] };\\n\\t}\\n\\treturn ret;\\n}\\ntemplate<typename T0, typename T1>\\nvector<pair<T0, T1>> zip(vector<T0>& v0, vector<T1>& v1) {\\n\\tint n = min(v0.size(), v1.size());\\n\\tvector<pair<T0, T1>> ret(n);\\n\\tREP(i, n) {\\n\\t\\tret[i] = { v0[i],v1[i] };\\n\\t}\\n\\treturn ret;\\n}\\nvoid setbit(ll &i, int j) {\\n\\ti=i | (1LL << j);\\n}\\nvoid resetbit(ll &i, int j) {\\n\\ti=i & ~(1 << j);\\n}\\nbool isset(ll i, int j) {\\n\\treturn (i & (1LL << j)) != 0;\\n}\\nvoid setbit(int& i, int j) {\\n\\ti = i | (1LL << j);\\n}\\nvoid resetbit(int& i, int j) {\\n\\ti = i & ~(1 << j);\\n}\\nbool isset(int i, int j) {\\n\\treturn (i & (1LL << j)) != 0;\\n}\\n\\nint bitCount(int i) {\\n\\ti = i - ((i >> 1) & 0x55555555);\\n\\ti = (i & 0x33333333) + ((i >> 2) & 0x33333333);\\n\\ti = (i + (i >> 4)) & 0x0f0f0f0f;\\n\\ti = i + (i >> 8);\\n\\ti = i + (i >> 16);\\n\\treturn i & 0x3f;\\n}\\nint bitCount(ll i) {\\n\\tint ret = 0;\\n\\twhile (i != 0) {\\n\\t\\tif (i & 1)ret++;\\n\\t\\ti = i >> 1;\\n\\t}\\n\\treturn ret;\\n\\n}\\nvoid setbitxor(int &i, int j) {\\n\\ti=(i ^ (1 << j));\\n}\\nvoid setbitxor(ll &i, int j) {\\n\\ti = (i ^ (1LL << j));\\n}\\nint next_combination(int sub) {\\n\\tint x = sub & -sub, y = sub + x;\\n\\treturn (((sub & ~y) / x) >> 1) | y;\\n}\\n\\ntemplate<typename T>\\nbool candiv(T a, T b) {\\n\\treturn a % b == 0;\\n}\\ntemplate<typename T>\\nT llceil(T a, T b) {\\n\\tif (a % b == 0) {\\n\\t\\treturn a / b;\\n\\t}\\n\\tif (a >= 0) { return (a / b) + 1; }\\n\\telse {\\n\\t\\treturn -((-a) / b);\\n\\n\\t}\\n}\\ntemplate<typename T>\\nT llfloor(T a, T b) {\\n\\tif (a % b == 0) {\\n\\t\\treturn a / b;\\n\\t}\\n\\tif (a >= 0) { return (a / b); }\\n\\telse {\\n\\t\\treturn -((-a) / b) - 1;\\n\\n\\t}\\n}\\ntemplate<typename T>\\nbool isDuplicate(vector<T> a) {\\n\\tsort(ALL(a));\\n\\treturn unique(ALL(a)) != a.end();\\n}\\ntemplate<typename T>\\nbool isSameContents(vector<T> a, vector<T> b) {\\n\\tsort(ALL(a));\\n\\tsort(ALL(b));\\n\\treturn a == b;\\n}\\nll llpow(ll x, ll n) {\\n\\tlong long ret = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) ret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\\n\\t\\tx *= x;\\n\\t\\tn >>= 1; // n を1bit 左にずらす\\n\\t}\\n\\treturn ret;\\n}\\nll llpowmod(ll x, ll n, ll m) {\\n\\tlong long ret = 1;\\n\\twhile (n > 0) {\\n\\t\\tif (n & 1) {\\n\\t\\t\\tret *= x; // n の最下位bitが 1 ならば x^(2^i) をかける\\n\\t\\t\\tret %= m;\\n\\t\\t}\\n\\t\\tx *= x;\\n\\t\\tx %= m;\\n\\t\\tn >>= 1; // n を1bit 左にずらす\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\n\\n\\nenum {\\n\\tNOTFOUND = 0xFFFFFFFFFFFFFFFFLLU\\n};\\n\\nclass SuccinctBitVector {\\nprivate:\\n\\tconst uint64_t size; // ビットベクトルのサイズ\\n\\tstatic const uint64_t blockBitNum = 16;\\n\\tstatic const uint64_t LEVEL_L = 512;\\n\\tstatic const uint64_t LEVEL_S = 16;\\n\\n\\tstd::vector<uint64_t> L; // 大ブロック\\n\\tstd::vector<uint16_t> S; // 小ブロック\\n\\tstd::vector<uint16_t> B; // ビットベクトル\\n\\n\\tuint64_t numOne = 0; // 1bitの数\\n\\npublic:\\n\\texplicit SuccinctBitVector(const uint64_t n) : size(n) {\\n\\t\\tconst uint64_t s = (n + blockBitNum - 1) / blockBitNum + 1; // ceil(n, blockSize)\\n\\t\\tthis->B.assign(s, 0);\\n\\t\\tthis->L.assign(n / LEVEL_L + 1, 0);\\n\\t\\tthis->S.assign(n / LEVEL_S + 1, 0);\\n\\t}\\n\\n\\t// B[pos] = bit\\n\\tvoid setBit(const uint64_t bit, const uint64_t pos) {\\n\\t\\tassert(bit == 0 or bit == 1);\\n\\t\\tassert(pos < this->size);\\n\\n\\t\\tconst uint64_t blockPos = pos / blockBitNum;\\n\\t\\tconst uint64_t offset = pos % blockBitNum;\\n\\t\\tif (bit == 1) { B.at(blockPos) |= (1LLU << offset); }\\n\\t\\telse { B.at(blockPos) &= (~(1LLU << offset)); }\\n\\t}\\n\\n\\t// B[pos]\\n\\tuint64_t access(const uint64_t pos) {\\n\\t\\tassert(pos < this->size);\\n\\t\\tconst uint64_t blockPos = pos / blockBitNum;\\n\\t\\tconst uint64_t offset = pos % blockBitNum;\\n\\t\\treturn ((B.at(blockPos) >> offset) & 1);\\n\\t}\\n\\n\\tvoid build() {\\n\\t\\tuint64_t num = 0;\\n\\t\\tfor (uint64_t i = 0; i <= size; i++) {\\n\\t\\t\\tif (i % LEVEL_L == 0) {\\n\\t\\t\\t\\tL.at(i / LEVEL_L) = num;\\n\\t\\t\\t}\\n\\t\\t\\tif (i % LEVEL_S == 0) {\\n\\t\\t\\t\\tS.at(i / LEVEL_S) = (uint16_t)(num - L.at(i / LEVEL_L));\\n\\t\\t\\t}\\n\\t\\t\\tif (i != size and i % blockBitNum == 0) {\\n\\t\\t\\t\\tnum += this->popCount(this->B.at(i / blockBitNum));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tthis->numOne = num;\\n\\t}\\n\\n\\t// B[0, pos)のbitの数\\n\\tuint64_t rank(const uint64_t bit, const uint64_t pos) {\\n\\t\\tassert(bit == 0 or bit == 1);\\n\\t\\tassert(pos <= this->size);\\n\\n\\t\\tif (bit) {\\n\\t\\t\\treturn L[pos / LEVEL_L] + S[pos / LEVEL_S] + popCount(B[pos / blockBitNum] & ((1 << (pos % blockBitNum)) - 1));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn pos - rank(1, pos);\\n\\t\\t}\\n\\t}\\n\\n\\t// rank番目のbitの位置 + 1(rankは1-origin)\\n\\tuint64_t select(const uint64_t bit, const uint64_t rank) {\\n\\t\\tassert(bit == 0 or bit == 1);\\n\\t\\tassert(rank > 0);\\n\\t\\tif (bit == 0 and rank > this->size - this->numOne) { return NOTFOUND; }\\n\\t\\tif (bit == 1 and rank > this->numOne) { return NOTFOUND; }\\n\\n\\t\\t// 大ブロックL内を検索\\n\\t\\tuint64_t large_idx = 0;\\n\\t\\t{\\n\\t\\t\\tuint64_t left = 0;\\n\\t\\t\\tuint64_t right = L.size();\\n\\t\\t\\twhile (right - left > 1) {\\n\\t\\t\\t\\tuint64_t mid = (left + right) / 2;\\n\\t\\t\\t\\tuint64_t r = L.at(mid);\\n\\t\\t\\t\\tr = (bit) ? r : mid * LEVEL_L - L.at(mid);\\n\\n\\t\\t\\t\\tif (r < rank) {\\n\\t\\t\\t\\t\\tleft = mid;\\n\\t\\t\\t\\t\\tlarge_idx = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tright = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// 小ブロックS内を検索\\n\\t\\tuint64_t small_idx = (large_idx * LEVEL_L) / LEVEL_S;\\n\\t\\t{\\n\\t\\t\\tuint64_t left = (large_idx * LEVEL_L) / LEVEL_S;\\n\\t\\t\\tuint64_t right = std::min(((large_idx + 1) * LEVEL_L) / LEVEL_S, (uint64_t)S.size());\\n\\t\\t\\twhile (right - left > 1) {\\n\\t\\t\\t\\tuint64_t mid = (left + right) / 2;\\n\\t\\t\\t\\tuint64_t r = L.at(large_idx) + S.at(mid);\\n\\t\\t\\t\\tr = (bit) ? r : mid * LEVEL_S - r;\\n\\n\\t\\t\\t\\tif (r < rank) {\\n\\t\\t\\t\\t\\tleft = mid;\\n\\t\\t\\t\\t\\tsmall_idx = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tright = mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Bをブロック単位で順番に探索\\n\\t\\tuint64_t rank_pos = 0;\\n\\t\\t{\\n\\t\\t\\tconst uint64_t begin_block_idx = (small_idx * LEVEL_S) / blockBitNum;\\n\\t\\t\\tuint64_t total_bit = L.at(large_idx) + S.at(small_idx);\\n\\t\\t\\tif (bit == 0) {\\n\\t\\t\\t\\ttotal_bit = small_idx * LEVEL_S - total_bit;\\n\\t\\t\\t}\\n\\t\\t\\tfor (uint64_t i = 0;; ++i) {\\n\\t\\t\\t\\tuint64_t b = popCount(B.at(begin_block_idx + i));\\n\\t\\t\\t\\tif (bit == 0) {\\n\\t\\t\\t\\t\\tb = blockBitNum - b;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (total_bit + b >= rank) {\\n\\t\\t\\t\\t\\tuint64_t block = (bit) ? B.at(begin_block_idx + i) : ~B.at(begin_block_idx + i);\\n\\t\\t\\t\\t\\trank_pos = (begin_block_idx + i) * blockBitNum + selectInBlock(block, rank - total_bit);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttotal_bit += b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn rank_pos + 1;\\n\\t}\\n\\n\\tuint64_t getNumOne() const {\\n\\t\\treturn numOne;\\n\\t}\\n\\n\\tvoid debug() {\\n\\t\\tstd::cout << \\\"LEVEL_L(\\\" << L.size() << \\\")\\\" << std::endl;\\n\\t\\tfor (uint64_t i = 0; i < L.size(); ++i) {\\n\\t\\t\\tstd::cout << L.at(i) << \\\", \\\";\\n\\t\\t}\\n\\t\\tstd::cout << std::endl;\\n\\t\\tstd::cout << \\\"LEVEL_S(\\\" << S.size() << \\\")\\\" << std::endl;\\n\\t\\tfor (uint64_t i = 0; i < S.size(); ++i) {\\n\\t\\t\\tstd::cout << S.at(i) << \\\", \\\";\\n\\t\\t}\\n\\t\\tstd::cout << std::endl;\\n\\t}\\n\\nprivate:\\n\\tuint64_t popCount(uint64_t x) {\\n\\t\\tx = (x & 0x5555555555555555ULL) + ((x >> 1) & 0x5555555555555555ULL);\\n\\t\\tx = (x & 0x3333333333333333ULL) + ((x >> 2) & 0x3333333333333333ULL);\\n\\t\\tx = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0fULL;\\n\\t\\tx = x + (x >> 8);\\n\\t\\tx = x + (x >> 16);\\n\\t\\tx = x + (x >> 32);\\n\\t\\treturn x & 0x7FLLU;\\n\\t}\\n\\n\\tuint64_t selectInBlock(uint64_t x, uint64_t rank) {\\n\\t\\tuint64_t x1 = x - ((x & 0xAAAAAAAAAAAAAAAALLU) >> 1);\\n\\t\\tuint64_t x2 = (x1 & 0x3333333333333333LLU) + ((x1 >> 2) & 0x3333333333333333LLU);\\n\\t\\tuint64_t x3 = (x2 + (x2 >> 4)) & 0x0F0F0F0F0F0F0F0FLLU;\\n\\n\\t\\tuint64_t pos = 0;\\n\\t\\tfor (;; pos += 8) {\\n\\t\\t\\tuint64_t rank_next = (x3 >> pos) & 0xFFLLU;\\n\\t\\t\\tif (rank <= rank_next) break;\\n\\t\\t\\trank -= rank_next;\\n\\t\\t}\\n\\n\\t\\tuint64_t v2 = (x2 >> pos) & 0xFLLU;\\n\\t\\tif (rank > v2) {\\n\\t\\t\\trank -= v2;\\n\\t\\t\\tpos += 4;\\n\\t\\t}\\n\\n\\t\\tuint64_t v1 = (x1 >> pos) & 0x3LLU;\\n\\t\\tif (rank > v1) {\\n\\t\\t\\trank -= v1;\\n\\t\\t\\tpos += 2;\\n\\t\\t}\\n\\n\\t\\tuint64_t v0 = (x >> pos) & 0x1LLU;\\n\\t\\tif (v0 < rank) {\\n\\t\\t\\trank -= v0;\\n\\t\\t\\tpos += 1;\\n\\t\\t}\\n\\n\\t\\treturn pos;\\n\\t}\\n};\\nclass WaveletMatrix {\\nprivate:\\n\\tstd::vector<SuccinctBitVector> bit_arrays;\\n\\tstd::vector<uint64_t> begin_one; // 各bitに着目したときの1の開始位置\\n\\tstd::map<uint64_t, uint64_t> begin_alphabet; // 最後のソートされた配列で各文字の開始位置\\n\\tstd::vector<std::vector<uint64_t>> cumulative_sum; // 各bitに着目したときの累積和\\n\\n\\tuint64_t size; // 与えられた配列のサイズ\\n\\tuint64_t maximum_element; // 文字数\\n\\tuint64_t bit_size; // 文字を表すのに必要なbit数\\n\\npublic:\\n\\tWaveletMatrix(const std::vector<uint64_t>& array) {\\n\\t\\tassert(array.size() > 0);\\n\\t\\tsize = array.size();\\n\\t\\tmaximum_element = *max_element(array.begin(), array.end()) + 1;\\n\\t\\tbit_size = get_num_of_bit(maximum_element);\\n\\t\\tif (bit_size == 0) {\\n\\t\\t\\tbit_size = 1;\\n\\t\\t}\\n\\n\\t\\tfor (uint64_t i = 0; i < bit_size; ++i) {\\n\\t\\t\\tSuccinctBitVector sv(size);\\n\\t\\t\\tbit_arrays.push_back(sv);\\n\\t\\t}\\n\\t\\tthis->begin_one.resize(bit_size);\\n\\t\\tthis->cumulative_sum.resize(bit_size + 1, std::vector<uint64_t>(size + 1, 0));\\n\\n\\t\\tfor (uint64_t j = 0; j < array.size(); ++j) {\\n\\t\\t\\tthis->cumulative_sum.at(0).at(j + 1) = this->cumulative_sum.at(0).at(j) + array[j];\\n\\t\\t}\\n\\n\\t\\tstd::vector<uint64_t> v(array);\\n\\t\\tfor (uint64_t i = 0; i < bit_size; ++i) {\\n\\n\\t\\t\\tstd::vector<uint64_t> temp;\\n\\t\\t\\t// 0をtempにいれてく\\n\\t\\t\\tfor (uint64_t j = 0; j < v.size(); ++j) {\\n\\t\\t\\t\\tuint64_t c = v.at(j);\\n\\t\\t\\t\\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\\n\\t\\t\\t\\tif (bit == 0) {\\n\\t\\t\\t\\t\\ttemp.push_back(c);\\n\\t\\t\\t\\t\\tbit_arrays.at(i).setBit(0, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tthis->begin_one.at(i) = temp.size();\\n\\n\\t\\t\\t// 1をtempにいれてく\\n\\t\\t\\tfor (uint64_t j = 0; j < v.size(); ++j) {\\n\\t\\t\\t\\tuint64_t c = v.at(j);\\n\\t\\t\\t\\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\\n\\t\\t\\t\\tif (bit == 1) {\\n\\t\\t\\t\\t\\ttemp.push_back(c);\\n\\t\\t\\t\\t\\tbit_arrays.at(i).setBit(1, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (uint64_t j = 0; j < temp.size(); ++j) {\\n\\t\\t\\t\\tthis->cumulative_sum.at(i + 1).at(j + 1) = this->cumulative_sum.at(i + 1).at(j) + temp.at(j);\\n\\t\\t\\t}\\n\\n\\t\\t\\tbit_arrays.at(i).build();\\n\\t\\t\\tv = temp;\\n\\t\\t}\\n\\n\\t\\t// ソートされた配列内での各文字の位置を取得\\n\\t\\tfor (int i = (int)v.size() - 1; i >= 0; --i) {\\n\\t\\t\\tthis->begin_alphabet[v.at(i)] = i;\\n\\t\\t}\\n\\t}\\n\\n\\t// v[pos]\\n\\tuint64_t access(uint64_t pos) {\\n\\t\\tif (pos >= this->size) { return NOTFOUND; }\\n\\n\\t\\tuint64_t c = 0;\\n\\t\\tfor (uint64_t i = 0; i < bit_arrays.size(); ++i) {\\n\\t\\t\\tuint64_t bit = bit_arrays.at(i).access(pos); // もとの数値のi番目のbit\\n\\t\\t\\tc = (c <<= 1) | bit;\\n\\t\\t\\tpos = bit_arrays.at(i).rank(bit, pos);\\n\\t\\t\\tif (bit) {\\n\\t\\t\\t\\tpos += this->begin_one.at(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn c;\\n\\t}\\n\\n\\t// i番目のcの位置 + 1を返す。rankは1-origin\\n\\tuint64_t select(uint64_t c, uint64_t rank) {\\n\\t\\tassert(rank > 0);\\n\\t\\tif (c >= maximum_element) {\\n\\t\\t\\treturn NOTFOUND;\\n\\t\\t}\\n\\t\\tif (this->begin_alphabet.find(c) == this->begin_alphabet.end()) {\\n\\t\\t\\treturn NOTFOUND;\\n\\t\\t}\\n\\n\\t\\tuint64_t index = this->begin_alphabet.at(c) + rank;\\n\\t\\tfor (uint64_t i = 0; i < bit_arrays.size(); ++i) {\\n\\t\\t\\tuint64_t bit = ((c >> i) & 1); // 下からi番目のbit\\n\\t\\t\\tif (bit == 1) {\\n\\t\\t\\t\\tindex -= this->begin_one.at(bit_size - i - 1);\\n\\t\\t\\t}\\n\\t\\t\\tindex = this->bit_arrays.at(bit_size - i - 1).select(bit, index);\\n\\t\\t}\\n\\t\\treturn index;\\n\\t}\\n\\n\\t// v[begin_pos, end_pos)で最大値のindexを返す\\n\\tuint64_t maxRange(uint64_t begin_pos, uint64_t end_pos) {\\n\\t\\treturn quantileRange(begin_pos, end_pos, end_pos - begin_pos - 1);\\n\\t}\\n\\n\\t// v[begin_pos, end_pos)で最小値のindexを返す\\n\\tuint64_t minRange(uint64_t begin_pos, uint64_t end_pos) {\\n\\t\\treturn quantileRange(begin_pos, end_pos, 0);\\n\\t}\\n\\n\\t// v[begin_pos, end_pos)でk番目に小さい数値のindexを返す(kは0-origin)\\n\\t// つまり小さい順に並べてk番目の値\\n\\tuint64_t quantileRange(uint64_t begin_pos, uint64_t end_pos, uint64_t k) {\\n\\t\\tif ((end_pos > size || begin_pos >= end_pos) || (k >= end_pos - begin_pos)) {\\n\\t\\t\\treturn NOTFOUND;\\n\\t\\t}\\n\\n\\t\\tuint64_t val = 0;\\n\\t\\tfor (uint64_t i = 0; i < bit_size; ++i) {\\n\\t\\t\\tconst uint64_t num_of_zero_begin = bit_arrays.at(i).rank(0, begin_pos);\\n\\t\\t\\tconst uint64_t num_of_zero_end = bit_arrays.at(i).rank(0, end_pos);\\n\\t\\t\\tconst uint64_t num_of_zero = num_of_zero_end - num_of_zero_begin; // beginからendまでにある0の数\\n\\t\\t\\tconst uint64_t bit = (k < num_of_zero) ? 0 : 1; // k番目の値の上からi番目のbitが0か1か\\n\\n\\t\\t\\tif (bit) {\\n\\t\\t\\t\\tk -= num_of_zero;\\n\\t\\t\\t\\tbegin_pos = this->begin_one.at(i) + begin_pos - num_of_zero_begin;\\n\\t\\t\\t\\tend_pos = this->begin_one.at(i) + end_pos - num_of_zero_end;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbegin_pos = num_of_zero_begin;\\n\\t\\t\\t\\tend_pos = num_of_zero_begin + num_of_zero;\\n\\t\\t\\t}\\n\\n\\t\\t\\tval = ((val << 1) | bit);\\n\\t\\t}\\n\\n\\t\\tuint64_t left = 0;\\n\\t\\tfor (uint64_t i = 0; i < bit_size; ++i) {\\n\\t\\t\\tconst uint64_t bit = (val >> (bit_size - i - 1)) & 1; // 上からi番目のbit\\n\\t\\t\\tleft = bit_arrays.at(i).rank(bit, left); // cのi番目のbitと同じ数値の数\\n\\t\\t\\tif (bit) {\\n\\t\\t\\t\\tleft += this->begin_one.at(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tconst uint64_t rank = begin_pos + k - left + 1;\\n\\t\\treturn select(val, rank) - 1;\\n\\t}\\n\\n\\t// v[0, pos)のcの数\\n\\tuint64_t rank(uint64_t c, uint64_t pos) {\\n\\t\\tassert(pos < size);\\n\\t\\tif (c >= maximum_element) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (this->begin_alphabet.find(c) == this->begin_alphabet.end()) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tfor (uint64_t i = 0; i < bit_size; ++i) {\\n\\t\\t\\tuint64_t bit = (c >> (bit_size - i - 1)) & 1; // 上からi番目のbit\\n\\t\\t\\tpos = bit_arrays.at(i).rank(bit, pos); // cのi番目のbitと同じ数値の数\\n\\t\\t\\tif (bit) {\\n\\t\\t\\t\\tpos += this->begin_one.at(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tuint64_t begin_pos = this->begin_alphabet.at(c);\\n\\t\\treturn pos - begin_pos;\\n\\t}\\n\\n\\t// v[begin_pos, end_pos)で[min, max)に入る値の個数\\n\\tuint64_t rangeFreq(uint64_t begin_pos, uint64_t end_pos, uint64_t min_c, uint64_t max_c) {\\n\\t\\tif ((end_pos > size || begin_pos >= end_pos) || (min_c >= max_c) || min_c >= maximum_element) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tconst auto maxi_t = rankAll(max_c, begin_pos, end_pos);\\n\\t\\tconst auto mini_t = rankAll(min_c, begin_pos, end_pos);\\n\\t\\treturn std::get<1>(maxi_t) - std::get<1>(mini_t);\\n\\t}\\n\\n\\n\\t// v[begin, end)で(cと同じ値の数、cより小さい値の数、cより大きい値の数)を求める\\n\\tstd::tuple<uint64_t, uint64_t, uint64_t> rankAll(const uint64_t c, uint64_t begin, uint64_t end) {\\n\\t\\tassert(end <= size);\\n\\t\\tconst uint64_t num = end - begin;\\n\\n\\t\\tif (begin >= end) {\\n\\t\\t\\treturn std::make_tuple(0, 0, 0);\\n\\t\\t}\\n\\t\\tif (c >= maximum_element || end == 0) {\\n\\t\\t\\treturn std::make_tuple(0, num, 0);\\n\\t\\t}\\n\\n\\t\\tuint64_t rank_less_than = 0, rank_more_than = 0;\\n\\t\\tfor (size_t i = 0; i < bit_size && begin < end; ++i) {\\n\\t\\t\\tconst uint64_t bit = (c >> (bit_size - i - 1)) & 1;\\n\\n\\t\\t\\tconst uint64_t rank0_begin = this->bit_arrays.at(i).rank(0, begin);\\n\\t\\t\\tconst uint64_t rank0_end = this->bit_arrays.at(i).rank(0, end);\\n\\t\\t\\tconst uint64_t rank1_begin = begin - rank0_begin;\\n\\t\\t\\tconst uint64_t rank1_end = end - rank0_end;\\n\\n\\t\\t\\tif (bit) {\\n\\t\\t\\t\\trank_less_than += (rank0_end - rank0_begin); // i番目のbitが0のものは除外される\\n\\t\\t\\t\\tbegin = this->begin_one.at(i) + rank1_begin;\\n\\t\\t\\t\\tend = this->begin_one.at(i) + rank1_end;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\trank_more_than += (rank1_end - rank1_begin); // i番目のbitが1のものは除外される\\n\\t\\t\\t\\tbegin = rank0_begin;\\n\\t\\t\\t\\tend = rank0_end;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tconst uint64_t rank = num - rank_less_than - rank_more_than;\\n\\t\\treturn std::make_tuple(rank, rank_less_than, rank_more_than);\\n\\t}\\n\\nprivate:\\n\\tuint64_t get_num_of_bit(uint64_t x) {\\n\\t\\tif (x == 0) return 0;\\n\\t\\tx--;\\n\\t\\tuint64_t bit_num = 0;\\n\\t\\twhile (x >> bit_num) {\\n\\t\\t\\t++bit_num;\\n\\t\\t}\\n\\t\\treturn bit_num;\\n\\t}\\n\\n\\tuint64_t rangeSum(const uint64_t begin, const uint64_t end, const uint64_t depth, const uint64_t c, const uint64_t x, const uint64_t y) {\\n\\t\\tif (begin == end) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tif (depth == bit_size) {\\n\\t\\t\\tif (x <= c and c < y) {\\n\\t\\t\\t\\treturn c * (end - begin); // 値 * 頻度\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tconst uint64_t next_c = ((uint64_t)1 << (bit_size - depth - 1)) | c; // 上からdepth番目のbitを立てる\\n\\t\\tconst uint64_t all_one_c = (((uint64_t)1 << (bit_size - depth - 1)) - 1) | next_c; // depth以降のbitをたてる(これ以降全部1を選んだときの値)\\n\\t\\tif (all_one_c < x or y <= c) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\t// [begin, pos)のすべての要素は[x, y)\\n\\t\\tif (x <= c and all_one_c < y) {\\n\\t\\t\\treturn this->cumulative_sum.at(depth).at(end) - this->cumulative_sum.at(depth).at(begin);\\n\\t\\t}\\n\\n\\t\\tconst uint64_t rank0_begin = this->bit_arrays.at(depth).rank(0, begin);\\n\\t\\tconst uint64_t rank0_end = this->bit_arrays.at(depth).rank(0, end);\\n\\t\\tconst uint64_t rank1_begin = begin - rank0_begin;\\n\\t\\tconst uint64_t rank1_end = end - rank0_end;\\n\\n\\t\\treturn rangeSum(rank0_begin, rank0_end, depth + 1, c, x, y) +\\n\\t\\t\\trangeSum(this->begin_one.at(depth) + rank1_begin, this->begin_one[depth] + rank1_end, depth + 1, next_c, x, y);\\n\\t}\\n};\\n\\nclass UniquePoint {\\npublic:\\n\\tconst int INF = 1 << 30;\\n\\tvector<pair<long long, long long>> points;\\n\\tmap<long long, int> xs;\\n\\tmap<long long, int> yt;\\n\\tvector<uint64_t> data;\\n\\n\\tvoid add(long long y, long long x) {\\n\\t\\tpoints.emplace_back(make_pair(y, x));\\n\\t}\\n\\n\\tvoid build() {\\n\\t\\tpoints.emplace_back(pair<ll, ll>(2ll * INF, 2ll * INF));\\n\\n\\t\\t// yをnew_yに変換(yは座標圧縮 2244 -> 0011)\\n\\t\\tsort(points.begin(), points.end()); // yでソート\\n\\t\\tint new_y = 0;\\n\\t\\tfor (int i = 0; i < points.size(); ++i) {\\n\\t\\t\\tconst long long y = points[i].first;\\n\\t\\t\\tif (yt.count(y) == 0) {\\n\\t\\t\\t\\tyt[y] = new_y;\\n\\t\\t\\t\\tnew_y++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// xをnew_wに変換(xは順位圧縮 2244 -> 0022)\\n\\t\\tsort(points.begin(), points.end(), [&](pair<ll, ll>& a, pair<ll, ll>& b) {return a.second < b.second; }); // xでソート\\n\\t\\tfor (int i = 0; i < points.size(); ++i) {\\n\\t\\t\\tconst long long x = points[i].second;\\n\\t\\t\\tif (xs.count(x) == 0) {\\n\\t\\t\\t\\txs[x] = i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tdata.resize(points.size());\\n\\t\\tfor (int i = 0; i < points.size(); ++i) {\\n\\t\\t\\tconst long long y = points[i].first;\\n\\t\\t\\tdata[i] = yt[y];\\n\\t\\t}\\n\\t}\\n\\n\\tpair<int, int> x2s(long long x) {\\n\\t\\treturn make_pair(xs.lower_bound(x)->second, xs.upper_bound(x)->second);\\n\\t}\\n\\n\\tpair<int, int> y2t(long long y) {\\n\\t\\treturn make_pair(yt.lower_bound(y)->second, yt.upper_bound(y)->second);\\n\\t}\\n\\t//変換後の範囲\\n\\ttuple<int, int, int, int> grid(long long x1, long long y1, long long x2, long long y2) {\\n\\t\\tassert(x1 <= x2);\\n\\t\\tassert(y1 <= y2);\\n\\t\\treturn make_tuple(\\n\\t\\t\\txs.lower_bound(x1)->second,\\n\\t\\t\\tyt.lower_bound(y1)->second,\\n\\t\\t\\txs.upper_bound(x2)->second,\\n\\t\\t\\tyt.upper_bound(y2)->second\\n\\t\\t);\\n\\t}\\n\\n};\\n\\n#ifdef ATCODER\\ntypedef modint1000000007 mint0;\\ntypedef modint998244353 mint;\\n#endif\\nstring CONTEST = \\\"typical90\\\";\\nstring PROBLEM = \\\"typical90_cc\\\";//問題に合わせて変える\\n\\nclass Answer{\\npublic:\\n\\tchar problemc;\\n#ifdef TESTLOCAL\\n\\tvoid answertest(istream& cin, ostream& cout) {\\n\\n\\t}\\n#endif\\n\\tvoid answer(istream& cin, ostream& cout) {\\n\\t\\tint N, M;\\n\\t\\tcin >> N >> M;\\n\\t\\tUniquePoint up;\\n\\t\\tREP(i, N) {\\n\\t\\t\\tint x, y;\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tup.add(y, x);\\n\\t\\t}\\n\\t\\tup.build();\\n\\t\\tWaveletMatrix wm(up.data);\\n\\t\\tREP(i, M) {\\n\\t\\t\\tint x1, y1, x2, y2;\\n\\t\\t\\tcin >> x1 >> y1 >> x2 >> y2;\\n\\t\\t\\tauto g = up.grid(x1, y1, x2, y2);\\n\\t\\t\\tauto [nx1, ny1, nx2, ny2]=g;\\n\\t\\t\\tcout << (wm.rangeFreq(nx1, nx2, ny1, ny2)) << endl;\\n\\t\\t}\\n\\t}\\n\\n};\\n\\nbool test(char c) {\\n\\tstring inputdir = \\\"input\\\\\\\\\\\";\\n\\tstring outputdir = \\\"output\\\\\\\\\\\";\\n\\tstring fs = getS(inputdir + c + \\\".txt\\\");\\n\\tif (fs != \\\"\\\") {\\n\\t\\tstring os = getS(outputdir + c + \\\".txt\\\");\\n\\t\\tostringstream oss;\\n\\t\\tistringstream iss(fs);\\n\\t\\tAnswer A;\\n\\t\\tA.problemc = c;\\n\\t\\tA.answer(iss, oss);\\n\\t\\tif (ismatch(os, oss.str())) {\\n\\t\\t\\tcerr << (char)(c + 1) << \\\":ok\\\" << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcerr << (char)(c + 1) << \\\":ng\\\" << endl;\\n\\t\\t\\tcerr << \\\"true:\\\" << endl;\\n\\t\\t\\tcerr << os << endl;\\n\\t\\t\\tcerr << \\\"ans:\\\" << endl;\\n\\t\\t\\tcerr << oss.str() << endl;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n\\n}\\nvoid testall() {\\n\\tfor (char c = '0'; c < '9'; c++) {\\n\\t\\tif (!test(c))break;\\n\\t}\\n}\\nvoid createRandom(ostringstream& cout) {\\n\\tint N = 6;\\n\\tcout << N << endl;\\n\\t//vector<int> p = { 6,4,5,5,6,6 };\\n\\tvector<int> p = {};\\n\\tREP(i, N) {\\n\\t\\tp.push_back((rand() % (N - i)) + i + 1);\\n\\t}\\n\\tfor (auto a : p) {\\n\\t\\tcout << a << \\\" \\\";\\n\\t}\\n\\tcout << endl;\\n}\\n#ifdef TESTLOCAL\\nvoid testLocal() {\\n\\tint MAX_NUM = 100;\\n\\tint show = max(1, MAX_NUM / 10);\\n\\tREP(i, MAX_NUM) {\\n\\t\\tostringstream os;\\n\\t\\tcreateRandom(os);\\n\\t\\tostringstream ostest;\\n\\t\\tistringstream istest(os.str());\\n\\t\\tostringstream osa;\\n\\t\\tistringstream isa(os.str());\\n\\t\\tAnswer At('0');\\n\\t\\tAnswer A('0');\\n\\t\\tA.answer(isa, osa);\\n\\t\\tAt.answertest(istest, ostest);\\n\\t\\tif (ismatch(osa.str(), ostest.str())) {\\n\\t\\t\\tif (i % show == 0 || i == MAX_NUM - 1) {\\n\\t\\t\\t\\tcout << i << \\\":ok\\\" << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << i << \\\":ng\\\" << endl;\\n\\t\\t\\tcout << \\\"in:\\\" << endl;\\n\\t\\t\\tcout << os.str() << endl;\\n\\t\\t\\tcout << \\\"true->\\\" << endl;\\n\\t\\t\\tcout << ostest.str() << endl;\\n\\t\\t\\tcout << \\\"false->\\\" << endl;\\n\\t\\t\\tcout << osa.str() << endl;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\\n\\n}\\n#endif\\nint main() {\\n\\tcin.tie(nullptr);//出力後に必ずendl or flushすれば問題ない。\\n\\tios::sync_with_stdio(false);//scanf printfと混ぜなければ問題ない。\\n\\n#ifdef ATCODER\\n#ifdef _LOCAL\\n#ifdef TESTLOCAL\\n\\ttestLocal();\\n#else\\n\\tif (!std::filesystem::is_regular_file(PROBLEM + \\\"_AC\\\")) {\\n\\t\\tstring command = \\\"problemget.bat \\\" + CONTEST + \\\" \\\" + PROBLEM;\\n\\t\\tsystem(command.c_str());\\n\\t}\\n\\ttestall();\\n#endif\\n#else\\n\\tAnswer A;\\n\\tA.answer(cin, cout);\\n#endif\\n#else\\n#ifdef AIZU\\n#ifdef _LOCAL\\n\\tif (!std::filesystem::is_regular_file(CONTEST + \\\"_AC\\\")) {//問題を取得したら一旦抜ける。\\n\\t\\tstring command = \\\"problemgetaizu.bat \\\" + CONTEST;\\n\\t\\tsystem(command.c_str());\\n\\t}\\n\\ttestall();\\n#else\\n\\tAnswer A;\\n\\tA.answer(cin, cout);\\n#endif\\n#else\\n\\tAnswer A;\\n\\tA.answer(cin, cout);\\n#endif\\n#endif\\n#ifdef _LOCAL\\n\\tcin.get();\\n#endif\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 5072,\n \"score_of_the_acc\": -0.1444,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2426_9005033\",\n \"code_snippet\": \"#pragma region Macros\\n\\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\\\")\\n\\n#include <bits/extc++.h>\\n// #include <immintrin.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n\\n#define pb emplace_back\\n#define int ll\\n#define endl '\\\\n'\\n\\n#define sqrt __builtin_sqrt\\n#define cbrt __builtin_cbrt\\n#define hypot __builtin_hypot\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\nconst int MOD = 998244353;\\n// const int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n\\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n\\nstruct Edge {\\n int from, to;\\n ll cost;\\n Edge(int to, ll cost) : to(to), cost(cost) {}\\n Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\\n};\\n\\nchrono::system_clock::time_point start, now;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n\\n__int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n}\\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n}\\n// int perl(ld x, ld y) { // perld(4.5, 2.1) = 2 // TODO\\n// if (-EPS < x && x < 0 or 0 < x && x < EPS) x = 0;\\n// if (-EPS < y && y < 0 or 0 < x && x < EPS) y = 0;\\n// assert(!equals(y, 0));\\n// if (x >= 0 && y > 0) return floor(x / y)+EPS;\\n// if (x >= 0 && y < 0) return floor(x / y) - (x - floor(x/y)*y < -EPS);\\n// if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\\n// return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n// }\\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n if (x >= 0) return x % y;\\n __int128_t ret = x % y; // (x < 0)\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n}\\n// ld modl(ld x, ld y) { // TODO\\n// assert(!equals(y, 0));\\n// if (x >= -EPS) return (x - floor(x/y)*y);\\n// ld ret = x - floor(x/y)*y; // (x < 0)\\n// ret += abs(y) * INFL; // TODO : オーバーフローする?\\n// ret = x - floor(x/abs(y))*abs(y);\\n// return ret;\\n// }\\n// int floor(int x, int y) { // TODO\\n// assert(y != 0);\\n// if (b < 0) a = -a, b = -b;\\n// return a >= 0 ? a / b : (a + 1) / b - 1;\\n// }\\n// int ceil(int x, int y) { // TODO\\n// assert(y != 0);\\n// if (b < 0) a = -a, b = -b;\\n// return a > 0 ? (a - 1) / b + 1 : a / b;\\n// }\\n// int floorl(ld x, ld y) { return 0; } // TODO\\n// int ceill(ld x, ld y) { return 0; } // TODO\\n// int gauss(int x, int y) {\\n// assert(y != 0);\\n// return x / y;\\n// } // 整数部分(未verify)\\n// int gauss(ld x, ld y) { return 0; } // TODO\\n\\npair<int, int> max(const pair<int, int> &a, const pair<int, int> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) {\\n return a;\\n }\\n return b;\\n}\\npair<int, int> min(const pair<int, int> &a, const pair<int, int> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) {\\n return a;\\n }\\n return b;\\n}\\n\\ntemplate <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; }\\n return false;\\n}\\ntemplate <class T> T mid(T a, T b, T c) {\\n return a + b + c - max({a, b, c}) - min({a, b, c});\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b);\\n if (a > c) swap(a, c);\\n if (b > c) swap(b, c);\\n } else {\\n if (c > b) swap(c, b);\\n if (c > a) swap(c, a);\\n if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\\n if (b > c) swap(b, c); if (b > d) swap(b, d);\\n if (c > d) swap(c, d);\\n } else {\\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\\n if (c > b) swap(c, b); if (c > a) swap(c, a);\\n if (b > a) swap(b, a);\\n }\\n}\\n\\nint countl_zero(int x) { return __builtin_clzll(x); }\\nint countl_one(int x) {\\n int ret = 0; while (x % 2) { x /= 2; ret++; }\\n return ret;\\n}\\nint countr_zero(int x) { return __builtin_ctzll(x); }\\nint countr_one(int x) {\\n int ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n}\\nint popcount(int x) { return __builtin_popcountll(x); }\\nint unpopcount(int x) { return 64 - __builtin_clzll(x) - __builtin_popcountll(x); }\\n\\nint top_bit(int x) { return 63 - __builtin_clzll(x);} // 2^kの位\\nint bot_bit(int x) { return __builtin_ctz(x);} // 2^kの位\\nint MSB(int x) { return 1 << (63 - __builtin_clzll(x)); } // mask\\nint LSB(int x) { return (x & -x); } // mask\\n\\nint bit_width(int x) { return 64 - __builtin_clzll(x); } // 桁数\\nint ceil_log2(int x) { return 63 - __builtin_clzll(x); }\\nint bit_floor(int x) { return 1 << (63 - __builtin_clzll(x)); }\\nint floor_log2(int x) { return 64 - __builtin_clzll(x-1); }\\nint bit_ceil(int x) { return 1 << (64 - __builtin_clzll(x-1)) - (x==1); }\\n\\nint hamming(int a, int b) { return popcount(a ^ b); }\\nint compcnt(int x) { return (popcount(x^(x >> 1)) + (x&1)) / 2; }\\n\\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n\\n return true;\\n\\t}\\n\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase(\\n remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }),\\n G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par;\\n\\tvector<int> sz;\\n};\\n\\ntemplate<int mod> class Modint{\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n\\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator >(const Modint& r) { return this -> val > r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = Modint<MOD>;\\n// using Mint = modint998244353;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t;\\n x = t;\\n return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\nmint modpow(const mint &x, int n) {\\n assert(n >= 0); // TODO: n <= -1\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\n\\nint modpow(__int128_t x, int n, int mod) {\\n assert(n >= 0 && mod > 0); // TODO: n <= -1\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n\\nint modinv(__int128_t x, int mod) {\\n assert(mod > 0 && x > 0);\\n if (x == 1) return 1;\\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n}\\n\\nistream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n}\\nostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128];\\n char *d = end(buffer);\\n\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n\\n if (x < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = end(buffer) - d;\\n\\n if (os.rdbuf()->sputn(d, len) != len) {\\n os.setstate(ios_base::badbit);\\n }\\n }\\n return os;\\n}\\n\\n__int128_t stoll(string &S) {\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n}\\n__int128_t gcd(__int128_t a, __int128_t b) {\\n return b ? gcd(b, a % b) : a;\\n}\\n__int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n}\\n\\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\\n assert(k >= 0);\\n stringstream ss;\\n ss << setprecision(k + 2) << x;\\n string s = ss.str();\\n if (s.find('.') == string::npos) s += '.';\\n int pos = s.find('.');\\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\\n s.pop_back();\\n if (s.back() == '.') s.pop_back();\\n return s;\\n\\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\\n // ss << setprecision(k + 1) << x;\\n // string s = ss.str();\\n // if (s.find('.') == string::npos) s += '.';\\n // int pos = s.find('.');\\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\\n // if (s.back() == '.') s.pop_back();\\n // return s;\\n}\\n\\nstring to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) {\\n ret += \\\"-\\\";\\n x *= -1;\\n }\\n while (x) {\\n ret += (char)('0' + x % 10);\\n x /= 10;\\n }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\nstring to_string(char c) {\\n string s = \\\"\\\";\\n s += c;\\n return s;\\n}\\n\\nstruct SXor128 {\\n uint64_t x = 88172645463325252LL;\\n unsigned Int() {\\n x = x ^ (x << 7);\\n return x = x ^ (x >> 9);\\n }\\n unsigned Int(unsigned mod) {\\n x = x ^ (x << 7);\\n x = x ^ (x >> 9);\\n return x % mod;\\n }\\n unsigned Int(unsigned l, unsigned r) {\\n x = x ^ (x << 7);\\n x = x ^ (x >> 9);\\n return x % (r - l + 1) + l;\\n }\\n double Double() {\\n return double(Int()) / UINT_MAX;\\n }\\n} rnd;\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n\\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v){\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n\\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1);\\n _finv.resize(N + 1);\\n _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1;\\n _finv[0] = _finv[1] = 1;\\n _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n\\nmint FAC(int N) {\\n if (N < 0) return 0;\\n return _fac[N];\\n}\\nmint COM(int N, int K) {\\n if (N < K) return 0;\\n if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\nmint PERM(int N, int K) {\\n if (N < K) return 0;\\n if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[N - K];\\n}\\nmint NHK(int N, int K) {\\n if (N == 0 && K == 0) return 1;\\n return COM(N + K - 1, K);\\n}\\n\\n#pragma endregion\\n\\nstruct Bit_Vector {\\n int n, m;\\n vector<uint64_t> bit;\\n vector<int> sum;\\n\\n Bit_Vector(int n) : n(n), m((n + 63) / 64), bit(m), sum(m + 1) {}\\n void set(int k) { bit[k / 64] |= 1ULL << (k % 64); }\\n void build() {\\n for (int i = 0; i < m; i++) {\\n sum[i + 1] = sum[i] + __builtin_popcountll(bit[i]);\\n }\\n }\\n bool operator[](int k) const { return (bit[k / 64] >> (k % 64)) & 1ULL; }\\n \\n int rank(int r, bool b) const {\\n int one = sum[r / 64];\\n if (r & 63) one += __builtin_popcountll(bit[r / 64] & ((1ULL << (r % 64)) - 1));\\n return b ? one : r - one;\\n }\\n \\n int rank(int l, int r, bool b) const { return rank(r, b) - rank(l, b); }\\n};\\n\\ntemplate<typename T>\\nstruct WaveletMatrix {\\n int maxlog, n;\\n vector<Bit_Vector> matrix;\\n vector<int> zero_cnt;\\n vector<vector<ll>> cs;\\n\\n WaveletMatrix(vector<T> data, ll max_v) : n(data.size()) {\\n T min_v = n ? *min_element(data.begin(), data.end()) : 0;\\n assert(0 <= min_v);\\n maxlog = max(64 - __builtin_clzll(max_v), 1);\\n matrix.resize(maxlog, Bit_Vector(n));\\n cs.resize(maxlog, vector<ll>(n + 1));\\n zero_cnt.resize(maxlog);\\n vector<T> zero(n), one(n);\\n\\n for (int i = 0; i < maxlog; i++) {\\n int z = 0, o = 0;\\n for (int j = 0; j < n; j++) {\\n if ((data[j] >> (maxlog - 1 - i)) & 1) {\\n one[o++] = data[j];\\n matrix[i].set(j);\\n } \\n else {\\n zero[z++] = data[j];\\n zero_cnt[i]++;\\n }\\n }\\n matrix[i].build();\\n data.swap(zero);\\n for (int i = 0; i < o; i++) data[z + i] = one[i];\\n for (int j = 0; j < n; j++) cs[i][j + 1] = cs[i][j] + data[j];\\n }\\n }\\n\\n T access(int k) {\\n T ret = 0;\\n for (int i = 0; i < maxlog; i++) {\\n bool bit = matrix[i][k];\\n ret = (ret << 1) | bit;\\n k = matrix[i].rank(k, bit) + zero_cnt[i] * bit;\\n }\\n return ret;\\n }\\n\\n int rank(int l, int r, T x) {\\n for (int i = 0; i < maxlog; i++) {\\n bool bit = (x >> (maxlog - 1 - i)) & 1;\\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\\n }\\n return r - l;\\n }\\n \\n T kth_smallest(int l, int r, int k) const {\\n assert(0 <= k && k < r - l);\\n T res = 0;\\n for (int i = 0; i < maxlog; i++) {\\n int zero = matrix[i].rank(l, r, 0);\\n bool bit = k >= zero;\\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\\n res |= (T(1) << (maxlog - 1 - i)) * bit;\\n k -= zero * bit;\\n }\\n return res;\\n }\\n\\n T kth_largest(int l, int r, int k) { kth_smallest(l, r, r - l - k - 1); }\\n\\n tuple<int, int, int> rank_all(int l, int r, T x) const {\\n int lt_cnt = 0, eq_cnt = r - l , mt_cnt = 0;\\n for (int i = 0; i < maxlog; i++) {\\n int tmp = r - l;\\n bool bit = (x >> (maxlog - 1 - i)) & 1;\\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\\n int d = tmp - (r - l);\\n eq_cnt -= d;\\n (bit ? lt_cnt : mt_cnt) += d;\\n }\\n return { lt_cnt, eq_cnt, mt_cnt };\\n }\\n\\n int range_freq(int l, int r, T lower, T upper) {\\n auto l_cnt = get<0>(rank_all(l, r, lower));\\n auto r_cnt = get<0>(rank_all(l, r, upper));\\n return r_cnt - l_cnt; \\n }\\n\\n T prev_value(int l, int r, T upper) {\\n int cnt = get<0>(rank_all(l, r, upper));\\n return cnt == 0 ? T(-1) : kth_smallest(l, r, --cnt);\\n } \\n\\n T next_value(int l, int r, T lower) {\\n int cnt = get<0>(rank_all(l, r, lower));\\n return cnt == r - l ? T(-1) : kth_smallest(l, r, cnt);\\n }\\n\\n ll sum_less_than(int l, int r, T x) {\\n ll ret = 0;\\n for (int i = 0; i < maxlog; i++) {\\n bool bit = (x >> (maxlog - 1 - i) & 1);\\n if (bit) ret += cs[i][matrix[i].rank(r, 0)] - cs[i][matrix[i].rank(l, 0)];\\n l = matrix[i].rank(l, bit) + zero_cnt[i] * bit;\\n r = matrix[i].rank(r, bit) + zero_cnt[i] * bit;\\n }\\n return ret;\\n }\\n\\n ll range_sum(int l, int r, T lower, T upper) { \\n return sum_less_than(l, r, upper) - sum_less_than(l, r, lower);\\n }\\n};\\n\\nclass UniquePoint {\\npublic:\\n vector<pair<int, int>> P;\\n map<int, int> xs;\\n vector<int> data;\\n\\n UniquePoint() {}\\n\\n void insert(int x, int y) {\\n P.pb(make_pair(x, y));\\n }\\n\\n void unique() {\\n P.pb(make_pair(INFL, INFL));\\n\\n // xをuniqueになるように変換\\n sort(P.begin(), P.end(),\\n [&](pair<int, int> &a, pair<int, int> &b) {\\n return a.first < b.first;\\n }); // xでソート\\n\\n for (int i = 0; i < P.size(); i++) {\\n const int x = P[i].first;\\n if (xs.count(x) == 0) {\\n xs[x] = i;\\n }\\n }\\n\\n data.resize(P.size());\\n for (int i = 0; i < P.size(); i++) {\\n const int y = P[i].second;\\n data[i] = y;\\n }\\n }\\n\\n pair<int, int> x2s(int x) {\\n return make_pair(xs.lower_bound(x)->second, xs.upper_bound(x)->second);\\n }\\n\\n // [l, r] クエリの l, r をWMのindexとして渡せる値に直す\\n pair<int, int> encode(int l, int r) {\\n assert(l <= r);\\n return make_pair(\\n xs.lower_bound(l)->second,\\n xs.upper_bound(r)->second\\n );\\n }\\n};\\n\\nsigned main() {\\n\\tint N, Q;\\n cin >> N >> Q;\\n\\n UniquePoint P;\\n vector<int> X(N), Y(N);\\n for (int i = 0; i < N; i++) {\\n cin >> X[i] >> Y[i];\\n Y[i] += 1e9+EPS;\\n P.insert(X[i], Y[i]);\\n }\\n\\n P.unique();\\n\\n WaveletMatrix<int> WM(P.data, 2e9 + 1);\\n\\n for (int i = 0; i < Q; i++) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n y1 += 1e9+EPS;\\n y2 += 1e9+EPS;\\n pair<int, int> range = P.encode(x1, x2); // [l, r) の半開区間\\n // cout << range.first << \\\" \\\" << range.second << \\\" \\\" << y1 << \\\" \\\" << y2 << endl;\\n cout << WM.range_freq(range.first, range.second, y1, y2 + 1) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 5144,\n \"score_of_the_acc\": -0.0465,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2426_9004628\",\n \"code_snippet\": \"#pragma region Macros\\n\\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\\\")\\n\\n#include <bits/extc++.h>\\n// #include <immintrin.h>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\nusing namespace std;\\nusing namespace __gnu_pbds;\\n\\n// #include <boost/multiprecision/cpp_dec_float.hpp>\\n// #include <boost/multiprecision/cpp_int.hpp>\\n// namespace mp = boost::multiprecision;\\n// using Bint = mp::cpp_int;\\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\\n\\n#define pb emplace_back\\n// #define int ll\\n#define endl '\\\\n'\\n\\n#define sqrt __builtin_sqrt\\n#define cbrt __builtin_cbrt\\n#define hypot __builtin_hypot\\n\\nusing ll = long long;\\nusing ld = long double;\\nconst ld PI = acosl(-1);\\nconst int INF = 1 << 30;\\nconst ll INFL = 1LL << 61;\\nconst int MOD = 998244353;\\n// const int MOD = 1000000007;\\n\\nconst ld EPS = 1e-10;\\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\\n\\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\\n\\nstruct Edge {\\n int from, to;\\n ll cost;\\n Edge(int to, ll cost) : to(to), cost(cost) {}\\n Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}\\n};\\n\\nchrono::system_clock::time_point start, now;\\n__attribute__((constructor))\\nvoid constructor() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(10);\\n start = chrono::system_clock::now();\\n}\\n\\n__int128_t POW(__int128_t x, int n) {\\n __int128_t ret = 1;\\n assert(n >= 0);\\n if (x == 1 or n == 0) ret = 1;\\n else if (x == -1 && n % 2 == 0) ret = 1; \\n else if (x == -1) ret = -1; \\n else if (n % 2 == 0) {\\n assert(x < INFL);\\n ret = POW(x * x, n / 2);\\n } else {\\n assert(x < INFL);\\n ret = x * POW(x, n - 1);\\n }\\n return ret;\\n}\\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\\n assert(y != 0);\\n if (x >= 0 && y > 0) return x / y;\\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\\n if (x < 0 && y < 0) return x / y + (x % y < 0);\\n return x / y - (x % y < 0); // (x < 0 && y > 0) \\n}\\n// int perl(ld x, ld y) { // perld(4.5, 2.1) = 2 // TODO\\n// if (-EPS < x && x < 0 or 0 < x && x < EPS) x = 0;\\n// if (-EPS < y && y < 0 or 0 < x && x < EPS) y = 0;\\n// assert(!equals(y, 0));\\n// if (x >= 0 && y > 0) return floor(x / y)+EPS;\\n// if (x >= 0 && y < 0) return floor(x / y) - (x - floor(x/y)*y < -EPS);\\n// if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\\n// return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \\n// }\\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\\n assert(y != 0);\\n if (x >= 0) return x % y;\\n __int128_t ret = x % y; // (x < 0)\\n ret += (__int128_t)abs(y) * INFL;\\n ret %= abs(y);\\n return ret;\\n}\\n// ld modl(ld x, ld y) { // TODO\\n// assert(!equals(y, 0));\\n// if (x >= -EPS) return (x - floor(x/y)*y);\\n// ld ret = x - floor(x/y)*y; // (x < 0)\\n// ret += abs(y) * INFL; // TODO : オーバーフローする?\\n// ret = x - floor(x/abs(y))*abs(y);\\n// return ret;\\n// }\\n// int floor(int x, int y) { // TODO\\n// assert(y != 0);\\n// if (b < 0) a = -a, b = -b;\\n// return a >= 0 ? a / b : (a + 1) / b - 1;\\n// }\\n// int ceil(int x, int y) { // TODO\\n// assert(y != 0);\\n// if (b < 0) a = -a, b = -b;\\n// return a > 0 ? (a - 1) / b + 1 : a / b;\\n// }\\n// int floorl(ld x, ld y) { return 0; } // TODO\\n// int ceill(ld x, ld y) { return 0; } // TODO\\n// int gauss(int x, int y) {\\n// assert(y != 0);\\n// return x / y;\\n// } // 整数部分(未verify)\\n// int gauss(ld x, ld y) { return 0; } // TODO\\n\\npair<int, int> max(const pair<int, int> &a, const pair<int, int> &b) {\\n if (a.first > b.first or a.first == b.first && a.second > b.second) {\\n return a;\\n }\\n return b;\\n}\\npair<int, int> min(const pair<int, int> &a, const pair<int, int> &b) {\\n if (a.first < b.first or a.first == b.first && a.second < b.second) {\\n return a;\\n }\\n return b;\\n}\\n\\ntemplate <class T> bool chmax(T &a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate <class T> bool chmin(T &a, const T& b) {\\n if (a > b) { a = b; return true; }\\n return false;\\n}\\ntemplate <class T> T mid(T a, T b, T c) {\\n return a + b + c - max({a, b, c}) - min({a, b, c});\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b);\\n if (a > c) swap(a, c);\\n if (b > c) swap(b, c);\\n } else {\\n if (c > b) swap(c, b);\\n if (c > a) swap(c, a);\\n if (b > a) swap(b, a);\\n }\\n}\\ntemplate <class T> void sort(T &a, T &b, T &c, T &d, bool rev = false) {\\n if (rev == false) { \\n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\\n if (b > c) swap(b, c); if (b > d) swap(b, d);\\n if (c > d) swap(c, d);\\n } else {\\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\\n if (c > b) swap(c, b); if (c > a) swap(c, a);\\n if (b > a) swap(b, a);\\n }\\n}\\n\\nint countl_zero(int x) { return __builtin_clzll(x); }\\nint countl_one(int x) {\\n int ret = 0; while (x % 2) { x /= 2; ret++; }\\n return ret;\\n}\\nint countr_zero(int x) { return __builtin_ctzll(x); }\\nint countr_one(int x) {\\n int ret = 0, k = 63 - __builtin_clzll(x);\\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\\n return ret;\\n}\\nint popcount(int x) { return __builtin_popcountll(x); }\\nint unpopcount(int x) { return 64 - __builtin_clzll(x) - __builtin_popcountll(x); }\\n\\nint top_bit(int x) { return 63 - __builtin_clzll(x);} // 2^kの位\\nint bot_bit(int x) { return __builtin_ctz(x);} // 2^kの位\\nint MSB(int x) { return 1 << (63 - __builtin_clzll(x)); } // mask\\nint LSB(int x) { return (x & -x); } // mask\\n\\nint bit_width(int x) { return 64 - __builtin_clzll(x); } // 桁数\\nint ceil_log2(int x) { return 63 - __builtin_clzll(x); }\\nint bit_floor(int x) { return 1 << (63 - __builtin_clzll(x)); }\\nint floor_log2(int x) { return 64 - __builtin_clzll(x-1); }\\nint bit_ceil(int x) { return 1 << (64 - __builtin_clzll(x-1)) - (x==1); }\\n\\nint hamming(int a, int b) { return popcount(a ^ b); }\\nint compcnt(int x) { return (popcount(x^(x >> 1)) + (x&1)) / 2; }\\n\\nclass UnionFind {\\npublic:\\n\\tUnionFind() = default;\\n UnionFind(int N) : par(N), sz(N, 1) {\\n iota(par.begin(), par.end(), 0);\\n }\\n\\n\\tint root(int x) {\\n\\t\\tif (par[x] == x) return x;\\n\\t\\treturn (par[x] = root(par[x]));\\n\\t}\\n\\n\\tbool unite(int x, int y) {\\n\\t\\tint rx = root(x);\\n\\t\\tint ry = root(y);\\n\\n if (rx == ry) return false;\\n\\t\\tif (sz[rx] < sz[ry]) swap(rx, ry);\\n\\n\\t\\tsz[rx] += sz[ry];\\n\\t\\tpar[ry] = rx;\\n\\n return true;\\n\\t}\\n\\n\\tbool issame(int x, int y) { return (root(x) == root(y)); }\\n\\tint size(int x) { return sz[root(x)]; }\\n\\n vector<vector<int>> groups(int N) {\\n vector<vector<int>> G(N);\\n for (int x = 0; x < N; x++) {\\n G[root(x)].push_back(x);\\n }\\n\\t\\tG.erase(\\n remove_if(G.begin(), G.end(),\\n [&](const vector<int>& V) { return V.empty(); }),\\n G.end());\\n return G;\\n }\\nprivate:\\n\\tvector<int> par;\\n\\tvector<int> sz;\\n};\\n\\ntemplate<int mod> class Modint{\\npublic:\\n int val = 0;\\n Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }\\n Modint(const Modint &r) { val = r.val; }\\n\\n Modint operator -() { return Modint(-val); } // 単項\\n Modint operator +(const Modint &r) { return Modint(*this) += r; }\\n Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }\\n Modint operator -(const Modint &r) { return Modint(*this) -= r; }\\n Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }\\n Modint operator *(const Modint &r) { return Modint(*this) *= r; }\\n Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }\\n Modint operator /(const Modint &r) { return Modint(*this) /= r; }\\n Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }\\n \\n Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置\\n Modint operator ++(signed) { ++*this; return *this; } // 後置\\n Modint& operator --() { val--; if (val < 0) val += mod; return *this; }\\n Modint operator --(signed) { --*this; return *this; }\\n Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }\\n Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator -=(const int &q) { Modint r(q); if (val < r.val) val += mod; val -= r.val; return *this; }\\n Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }\\n Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }\\n Modint &operator /=(const Modint &r) {\\n int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n Modint &operator /=(const int &q) {\\n Modint r(q); int a = r.val, b = mod, u = 1, v = 0;\\n while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}\\n val = val * u % mod; if (val < 0) val += mod;\\n return *this;\\n }\\n\\n bool operator ==(const Modint& r) { return this -> val == r.val; }\\n bool operator <(const Modint& r) { return this -> val < r.val; }\\n bool operator >(const Modint& r) { return this -> val > r.val; }\\n bool operator !=(const Modint& r) { return this -> val != r.val; }\\n};\\n\\nusing mint = Modint<MOD>;\\n// using Mint = modint998244353;\\n\\nistream &operator >>(istream &is, mint& x) {\\n int t; is >> t;\\n x = t;\\n return (is);\\n}\\nostream &operator <<(ostream &os, const mint& x) {\\n return os << x.val;\\n}\\nmint modpow(const mint &x, int n) {\\n assert(n >= 0); // TODO: n <= -1\\n if (n == 0) return 1;\\n mint t = modpow(x, n / 2);\\n t = t * t;\\n if (n & 1) t = t * x;\\n return t;\\n}\\n\\nint modpow(__int128_t x, int n, int mod) {\\n assert(n >= 0 && mod > 0); // TODO: n <= -1\\n __int128_t ret = 1;\\n while (n > 0) {\\n if (n % 2 == 1) ret = ret * x % mod;\\n x = x * x % mod;\\n n /= 2;\\n }\\n return ret;\\n}\\n\\nint modinv(__int128_t x, int mod) {\\n assert(mod > 0 && x > 0);\\n if (x == 1) return 1;\\n return mod - modinv(mod % x, mod) * (mod / x) % mod;\\n}\\n\\nistream &operator >>(istream &is, __int128_t& x) {\\n string S; is >> S;\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n x = ret * f;\\n return (is);\\n}\\nostream &operator <<(ostream &os, __int128_t x) {\\n ostream::sentry s(os);\\n if (s) {\\n __uint128_t tmp = x < 0 ? -x : x;\\n char buffer[128];\\n char *d = end(buffer);\\n\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n\\n if (x < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = end(buffer) - d;\\n\\n if (os.rdbuf()->sputn(d, len) != len) {\\n os.setstate(ios_base::badbit);\\n }\\n }\\n return os;\\n}\\n\\n__int128_t stoll(string &S) {\\n __int128_t ret = 0;\\n int f = 1;\\n if (S[0] == '-') f = -1; \\n for (int i = 0; i < S.length(); i++)\\n if ('0' <= S[i] && S[i] <= '9')\\n ret = ret * 10 + S[i] - '0';\\n return ret * f;\\n}\\n__int128_t gcd(__int128_t a, __int128_t b) {\\n return b ? gcd(b, a % b) : a;\\n}\\n__int128_t lcm(__int128_t a, __int128_t b) {\\n return a / gcd(a, b) * b;\\n // lcmが__int128_tに収まる必要あり\\n}\\n\\nstring to_string(ld x, int k) { // xの小数第k位までをstring化する\\n assert(k >= 0);\\n stringstream ss;\\n ss << setprecision(k + 2) << x;\\n string s = ss.str();\\n if (s.find('.') == string::npos) s += '.';\\n int pos = s.find('.');\\n for (int i = 0; k >= (int)s.size() - 1 - pos; i++) s += '0';\\n s.pop_back();\\n if (s.back() == '.') s.pop_back();\\n return s;\\n\\n // stringstream ss; // 第k+1位を四捨五入して第k位まで返す\\n // ss << setprecision(k + 1) << x;\\n // string s = ss.str();\\n // if (s.find('.') == string::npos) s += '.';\\n // int pos = s.find('.');\\n // for (int i = 0; k > (int)s.size() - 1 - pos; i++) s += '0';\\n // if (s.back() == '.') s.pop_back();\\n // return s;\\n}\\n\\nstring to_string(__int128_t x) {\\n string ret = \\\"\\\";\\n if (x < 0) {\\n ret += \\\"-\\\";\\n x *= -1;\\n }\\n while (x) {\\n ret += (char)('0' + x % 10);\\n x /= 10;\\n }\\n reverse(ret.begin(), ret.end());\\n return ret;\\n}\\nstring to_string(char c) {\\n string s = \\\"\\\";\\n s += c;\\n return s;\\n}\\n\\nstruct SXor128 {\\n uint64_t x = 88172645463325252LL;\\n unsigned Int() {\\n x = x ^ (x << 7);\\n return x = x ^ (x >> 9);\\n }\\n unsigned Int(unsigned mod) {\\n x = x ^ (x << 7);\\n x = x ^ (x >> 9);\\n return x % mod;\\n }\\n unsigned Int(unsigned l, unsigned r) {\\n x = x ^ (x << 7);\\n x = x ^ (x >> 9);\\n return x % (r - l + 1) + l;\\n }\\n double Double() {\\n return double(Int()) / UINT_MAX;\\n }\\n} rnd;\\n\\nstruct custom_hash {\\n static uint64_t splitmix64(uint64_t x) {\\n x += 0x9e3779b97f4a7c15;\\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\\n return x ^ (x >> 31);\\n }\\n\\n size_t operator()(uint64_t x) const {\\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\\n return splitmix64(x + FIXED_RANDOM);\\n }\\n};\\n\\ntemplate<class T> size_t HashCombine(const size_t seed,const T &v){\\n return seed^(hash<T>()(v)+0x9e3779b9+(seed<<6)+(seed>>2));\\n}\\ntemplate<class T,class S> struct hash<pair<T,S>>{\\n size_t operator()(const pair<T,S> &keyval) const noexcept {\\n return HashCombine(hash<T>()(keyval.first), keyval.second);\\n }\\n};\\ntemplate<class T> struct hash<vector<T>>{\\n size_t operator()(const vector<T> &keyval) const noexcept {\\n size_t s=0;\\n for (auto&& v: keyval) s=HashCombine(s,v);\\n return s;\\n }\\n};\\ntemplate<int N> struct HashTupleCore{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{\\n size_t s=HashTupleCore<N-1>()(keyval);\\n return HashCombine(s,get<N-1>(keyval));\\n }\\n};\\ntemplate <> struct HashTupleCore<0>{\\n template<class Tuple> size_t operator()(const Tuple &keyval) const noexcept{ return 0; }\\n};\\ntemplate<class... Args> struct hash<tuple<Args...>>{\\n size_t operator()(const tuple<Args...> &keyval) const noexcept {\\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\\n }\\n};\\n\\nvector<mint> _fac, _finv, _inv;\\nvoid COMinit(int N) {\\n _fac.resize(N + 1);\\n _finv.resize(N + 1);\\n _inv.resize(N + 1);\\n _fac[0] = _fac[1] = 1;\\n _finv[0] = _finv[1] = 1;\\n _inv[1] = 1;\\n for (int i = 2; i <= N; i++) {\\n _fac[i] = _fac[i-1] * mint(i);\\n _inv[i] = -_inv[MOD % i] * mint(MOD / i);\\n _finv[i] = _finv[i - 1] * _inv[i];\\n }\\n}\\n\\nmint FAC(int N) {\\n if (N < 0) return 0;\\n return _fac[N];\\n}\\nmint COM(int N, int K) {\\n if (N < K) return 0;\\n if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[K] * _finv[N - K];\\n}\\nmint PERM(int N, int K) {\\n if (N < K) return 0;\\n if (N < 0 or K < 0) return 0;\\n return _fac[N] * _finv[N - K];\\n}\\nmint NHK(int N, int K) {\\n if (N == 0 && K == 0) return 1;\\n return COM(N + K - 1, K);\\n}\\n\\n#pragma endregion\\n\\nclass Compress {\\npublic:\\n int sz = 0;\\n unordered_map<int, ushort> Z; // 元の値 -> 圧縮した値\\n unordered_map<ushort, int> UZ; // 圧縮した値 -> 元の値\\n\\n Compress(const vector<int> &V, int base = 0) {\\n this->sz = base;\\n set<int> s(V.begin(), V.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n \\n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\\n this->sz = base;\\n vector<int> V3 = V2;\\n V3.insert(V3.end(), V1.begin(), V1.end());\\n set<int> s(V3.begin(), V3.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n\\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\\n this->sz = base;\\n vector<int> V4 = V1;\\n V4.insert(V4.end(), V2.begin(), V2.end());\\n V4.insert(V4.end(), V3.begin(), V3.end());\\n set<int> s(V4.begin(), V4.end());\\n\\n for (int x : s) {\\n this->Z[x] = this->sz;\\n this->UZ[this->sz] = x;\\n this->sz++;\\n }\\n }\\n\\n vector<ushort> zip(const vector<int> &V) {\\n vector<ushort> ret((int)V.size());\\n for (int i = 0; i < (int)V.size(); i++) {\\n ret[i] = Z[V[i]];\\n }\\n return ret;\\n }\\n\\n // vector<int> unzip(const vector<ushort> &V) {\\n // vector<int> ret = V;\\n // for (int i = 0; i < (int)V.size(); i++) {\\n // ret[i] = UZ[ret[i]];\\n // }\\n // return ret;\\n // }\\n\\n int size() { return sz; }\\n\\n int encode(int x) { return Z[x]; }\\n int decode(int x) { return UZ[x]; }\\n};\\n\\nushort bit[5001][5001];\\nstruct BIT2D {\\n int H, W;\\n BIT2D(int _H, int _W) : H(_H + 1), W(_W + 1) {\\n }\\n\\n // (x, y)にwを足す\\n void add(int x, int y, ushort w) {\\n // if (x < 0 or x >= H or y < 0 or y >= W) return ; // 範囲外の時は足さない\\n assert(x >= 0 && x < H && y >= 0 && y < W);\\n for (int a = (++y, ++x); a <= H; a += a & -a) {\\n for (int b = y; b <= W; b += b & -b) {\\n bit[a][b] += w;\\n }\\n }\\n }\\n\\n // [(0, 0) , (x, y)]の和 閉区間\\n ushort sum(int x, int y) {\\n if (x < 0 or y < 0) return 0; // x, y < 0の時は0\\n // if (x >= H) x = H - 1; // x >= H, y >= W のときは x = H - 1, y = W - 1\\n // if (y >= W) y = W - 1;\\n assert(x < H && y < W);\\n\\n ushort ret = 0;\\n for (int a = (++y, ++x); a > 0; a -= a & -a) {\\n for (int b = y; b > 0; b -= b & -b) {\\n ret += bit[a][b];\\n }\\n }\\n return ret;\\n }\\n\\n // [(x1, y1) , (x2, y2)] の和\\n ushort sum(int x1, int y1, int x2, int y2) {\\n // if (x1 > x2 or y1 > y2) return 0; // x1 > x2, y1 > y2の時は何もしない\\n // if (x1 > x2) swap(x1, x2); // x1 > x2, y1 > y2の時はswap\\n // if (y1 > y2) swap(y1, y2);\\n assert(x1 <= x2 && y1 <= y2);\\n return sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) +\\n sum(x1 - 1, y1 - 1);\\n }\\n\\n ushort get(int x, int y) {\\n assert(x >= 0 && x < H && y >= 0 && y < W);\\n int x1 = x, x2 = x, y1 = y, y2 = y;\\n if (x1 > x2 or y1 > y2) return 0;\\n return sum(x2, y2) - sum(x2, y1 - 1) - sum(x1 - 1, y2) +\\n sum(x1 - 1, y1 - 1);\\n }\\n\\n void set(int x, int y, ushort w) {\\n ushort s = get(x, y);\\n add(x, y, -s + w);\\n }\\n};\\n\\nsigned main() {\\n\\tint N, Q;\\n cin >> N >> Q;\\n vector<int> X(N), Y(N);\\n for (int i = 0; i < N; i++) cin >> X[i] >> Y[i];\\n\\n\\tCompress CX(X, 0); // ここにAとCを入れてはいけない(Q²はデカすぎるので)\\n\\tCompress CY(Y, 0);\\n vector<ushort> X1 = CX.zip(X);\\n vector<ushort> Y1 = CY.zip(Y);\\n\\n BIT2D bit(CX.size() + 1, CY.size() + 1);\\n for (int i = 0; i < N; i++) {\\n bit.add(X1[i], Y1[i], 1);\\n }\\n\\n vector<int> A(Q), B(Q), C(Q), D(Q);\\n for (int i = 0; i < Q; i++) cin >> A[i] >> B[i] >> C[i] >> D[i];\\n // 左下(A[i], B[i]), 右上(C[i], D[i]) の矩形領域\\n\\n Compress CX2(X, A, C, 0);\\n vector<ushort> X2 = CX2.zip(X);\\n X.clear();\\n sort(X2.begin(), X2.end());\\n vector<ushort> A2 = CX2.zip(A);\\n A.clear();\\n vector<ushort> C2 = CX2.zip(C);\\n C.clear();\\n\\n Compress CY2(Y, B, D, 0);\\n vector<ushort> Y2 = CY2.zip(Y);\\n Y.clear();\\n sort(Y2.begin(), Y2.end());\\n vector<ushort> B2 = CY2.zip(B);\\n B.clear();\\n vector<ushort> D2 = CY2.zip(D);\\n D.clear();\\n\\n for (int i = 0; i < Q; i++) {\\n // cout << A[i] << \\\" \\\" << B[i] << \\\" \\\" << C[i] << \\\" \\\" << D[i] << endl;\\n auto itl = lower_bound(X2.begin(), X2.end(), A2[i]);\\n if (itl == X2.end()) {\\n cout << 0 << endl;\\n continue;\\n }\\n auto itr = upper_bound(X2.begin(), X2.end(), C2[i]);\\n if (itr == X2.begin()) {\\n cout << 0 << endl;\\n continue;\\n }\\n itr--;\\n\\n int l = CX.encode(CX2.decode(*itl));\\n int r = CX.encode(CX2.decode(*itr));\\n\\n auto itd = lower_bound(Y2.begin(), Y2.end(), B2[i]);\\n if (itd == Y2.end()) {\\n cout << 0 << endl;\\n continue;\\n }\\n auto itu = upper_bound(Y2.begin(), Y2.end(), D2[i]);\\n if (itu == Y2.begin()) {\\n cout << 0 << endl;\\n continue;\\n }\\n itu--;\\n\\n int d = CY.encode(CY2.decode(*itd));\\n int u = CY.encode(CY2.decode(*itu));\\n\\n // cout << l << \\\" \\\" << r << \\\" \\\" << d << \\\" \\\" << u << endl;\\n\\n cout << bit.sum(l, d, r, u) << endl;\\n }\\n}\",\n \"accuracy\": 0.25,\n \"time_ms\": 810,\n \"memory_kb\": 165392,\n \"score_of_the_acc\": -1.1383,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2426_9003184\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = 3.141592653589793;\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\nint main(){\\n int N, M; cin >> N >> M;\\n set<ll> totx = {INF}, toty = {INF};\\n vc<pair<ll, ll>> points(N);\\n rep(i, N){\\n ll x, y; cin >> x >> y;\\n points[i] = {x, y};\\n totx.insert(x);\\n toty.insert(y);\\n }\\n map<ll, ll> px, py;\\n int H = 1;\\n for (auto x : totx){\\n px[x] = H;\\n H++;\\n }\\n int W = 1;\\n for (auto y : toty){\\n py[y] = W;\\n W++;\\n }\\n vv<int> cmsm(H + 1, vc<int>(W + 1, 0));\\n for (auto [x, y] : points){\\n cmsm[px[x]][py[y]]++;\\n }\\n rep(i, H + 1) rep(j, W + 1){\\n if (i > 0) cmsm[i][j] += cmsm[i - 1][j];\\n if (j > 0) cmsm[i][j] += cmsm[i][j - 1];\\n if (i > 0 && j > 0) cmsm[i][j] -= cmsm[i - 1][j - 1];\\n }\\n\\n rep(i, M){\\n ll xl, yl, xr, yr; cin >> xl >> yl >> xr >> yr;\\n auto xlit = totx.lower_bound(xl);\\n auto xrit = totx.upper_bound(xr);\\n auto ylit = toty.lower_bound(yl);\\n auto yrit = toty.upper_bound(yr);\\n if (*xlit != *xrit && *ylit != *yrit){\\n int xlid = px[*xlit], xrid = px[*xrit], ylid = py[*ylit], yrid = py[*yrit];\\n xlid--; ylid--; xrid--; yrid--;\\n cout<< cmsm[xrid][yrid] - cmsm[xrid][ylid] - cmsm[xlid][yrid] + cmsm[xlid][ylid] << endl;\\n }else cout << 0 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1360,\n \"memory_kb\": 102352,\n \"score_of_the_acc\": -0.8938,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2426_9003034\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nstruct merge_sort_tree{\\n int n;\\n vector<vector<T>> x;\\n merge_sort_tree()=default;\\n merge_sort_tree(const vector<T> &vec):n((int)vec.size()){\\n x.resize(n*2);\\n for(int i=0;i<n;i++)x[n+i]={vec[i]};\\n for(int i=n-1;i;i--){\\n merge(x[i*2].begin(),x[i*2].end(),x[i*2+1].begin(),x[i*2+1].end(),back_inserter(x[i]));\\n }\\n }\\n \\n int cntLess(int l,int r,T query)const{\\n l+=n,r+=n;\\n int ret=0;\\n while(l<r){\\n if(l&1){\\n ret+=lower_bound(x[l].begin(),x[l].end(),query)-x[l].begin(),l++;\\n }\\n if(r&1){\\n r--,ret+=lower_bound(x[r].begin(),x[r].end(),query)-x[r].begin();\\n }\\n l>>=1,r>>=1;\\n }\\n return ret;\\n }\\n \\n int cntLesseq(int l,int r,T query)const{\\n l+=n,r+=n;\\n int ret=0;\\n while(l<r){\\n if(l&1){\\n ret+=upper_bound(x[l].begin(),x[l].end(),query)-x[l].begin(),l++;\\n }\\n if(r&1){\\n r--,ret+=upper_bound(x[r].begin(),x[r].end(),query)-x[r].begin();\\n }\\n l>>=1,r>>=1;\\n }\\n return ret;\\n }\\n\\n int cntMore(int l,int r,T query)const{\\n int tot=max(0,min(r,n)-max(l,0));\\n return tot-cntLesseq(l,r,query);\\n }\\n\\n int cntMoreeq(int l,int r,T query)const{\\n int tot=max(0,min(r,n)-max(l,0));\\n return tot-cntLess(l,r,query);\\n }\\n\\n template<class OStream> friend OStream &operator<<(OStream &os,const merge_sort_tree &clt){\\n os<<'[';\\n for(int i=0;i<clt.n;i++)os<<clt.x[clt.n+i][0]<<',';\\n return os<<']';\\n }\\n};\\n\\nint main() {\\n cin.tie(nullptr), ios::sync_with_stdio(false);\\n int N, M;\\n cin >> N >> M;\\n vector<pair<int, int>> P(N);\\n for (auto &p : P) cin >> p.first >> p.second;\\n sort(P.begin(), P.end());\\n vector<int> xs, ys;\\n for (auto p : P) xs.push_back(p.first), ys.push_back(p.second);\\n merge_sort_tree<int> tree(ys);\\n while (M--) {\\n int x1, y1, x2, y2;\\n cin >> x1 >> y1 >> x2 >> y2;\\n int l = lower_bound(xs.begin(), xs.end(), x1) - xs.begin();\\n int r = upper_bound(xs.begin(), xs.end(), x2) - xs.begin();\\n cout << tree.cntLesseq(l, r, y2) - tree.cntLess(l, r, y1) << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 4084,\n \"score_of_the_acc\": -0.0585,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2426_8887581\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n#define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--)\\n#define repn(i,end) for(long long i = 0; i <= (long long)(end); i++)\\n#define reps(i,start,end) for(long long i = start; i < (long long)(end); i++)\\n#define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef vector<long long> vll;\\ntypedef vector<pair<long long ,long long>> vpll;\\ntypedef vector<vector<long long>> vvll;\\ntypedef set<ll> sll;\\ntypedef map<long long , long long> mpll;\\ntypedef pair<long long ,long long> pll;\\ntypedef tuple<long long , long long , long long> tpl3;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 60;\\nconst ld EPS = 1e-9;\\n \\ninline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\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<typename T>\\nstd::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T>\\nstd::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\n// ref https://hitonanode.github.io/cplib-cpp/segmenttree/merge_sort_tree.hpp\\n//1indexed\\n//静的配列aの[l,r)のうち値がx以下とかの個数をオンラインで求める\\ntemplate <class T>\\nclass MergeSortTree{\\n public:\\n ll n;\\n vector<vector<T>> tree;\\n \\n MergeSortTree(const vector<T> &a){\\n n = a.size();\\n tree.resize(n * 2);\\n rep(i,n){\\n tree[n+i] = {a[i]};\\n }\\n for(ll i = n-1;i >= 1;i--){\\n merge(tree[i * 2].begin(),tree[i * 2].end(),tree[i * 2 + 1].begin(),tree[i * 2 + 1].end(),back_inserter(tree[i]));\\n }\\n }\\n\\n //[l,r)でx未満\\n ll cntLess(ll l,ll r,T x){\\n l += n;\\n r += n;\\n ll ret = 0;\\n while(l < r){\\n if(l & 1){//演算してから足す\\n ret += lower_bound(all(tree[l]),x) - tree[l].begin();\\n l++;\\n }\\n if(r & 1){//演算する前に引く\\n r--;\\n ret += lower_bound(all(tree[r]),x) - tree[r].begin();\\n }\\n l>>=1;r>>=1;\\n }\\n return ret;\\n }\\n\\n //x以下\\n ll cntLesseq(ll l,ll r,T x){\\n l += n;\\n r += n;\\n ll ret = 0;\\n while(l < r){\\n if(l & 1){//演算してから足す\\n ret += upper_bound(all(tree[l]),x) - tree[l].begin();l++;\\n }\\n if(r & 1){//演算する前に引く\\n r--;ret += upper_bound(all(tree[r]),x) - tree[r].begin();\\n }\\n l>>=1;r>>=1;\\n }\\n return ret;\\n }\\n\\n //xより大きい\\n ll cntMore(ll l,ll r,T x){\\n ll total = max(0LL,min(r,n) - max(0LL,l));\\n return total - cntLesseq(l,r,x);\\n }\\n\\n //x以上\\n ll cntMoreeq(ll l,ll r,T x){\\n ll total = max(0LL,min(r,n) - max(0LL,l));\\n return total - cntLess(l,r,x);\\n }\\n};\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n LL(n,m);\\n vpll xy(n);\\n rep(i,n){\\n LL(x,y);\\n xy[i] = {x,y};\\n\\n }\\n\\n sort(all(xy));\\n vector<ll> a(n);\\n rep(i,n){\\n a[i] = xy[i].second;\\n }\\n MergeSortTree seg(a);\\n while(m--){\\n LL(x1,y1,x2,y2);\\n ll l = lower_bound(all(xy),make_pair(x1,-INF)) - xy.begin();\\n ll r = lower_bound(all(xy),make_pair(x2,INF)) - xy.begin();\\n cout << seg.cntMoreeq(l,r,y1) - seg.cntMore(l,r,y2) << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 4456,\n \"score_of_the_acc\": -0.1566,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1387,"cells":{"group_id":{"kind":"string","value":"aoj_2427_cpp"},"problem_description":{"kind":"string","value":"ほそながいところ\n高橋君は苹果(りんご)ちゃんとニューヨークを観光することになりました。\n高橋君は観光するところに特に希望はなかったのですが、苹果ちゃんの熱烈な誘いにより、以下の地図にあるような\"ほそながいところ\"を観光することに決まりました。\nGoogle マップ - (C)2012 Google\nこの\"ほそながいところ\"はとても細長く、直線とみなすことができます。また、\"ほそながいところ\"には片方の端にスタート地点が、もう片方の端にゴール地点があり、スタート地点からゴール地点へ向けて何台かの観光用の馬車が走っています。この馬車は以下のようなルールに従って運行されています。\n馬車は\nn\n台あり、すべての馬車はスタート地点から出発してゴール地点まで進みます。\n以下のすべての場合において馬車の大きさは無視できます。\n途中で速度を変更することが難しいため、すべての馬車は馬車はそれぞれ1kmあたりを\nS\ni\n(\nS\ni\nは1以上の整数)分の等速で進みます。\n馬車には出発する順番が定められており、この順番を守らなければなりません。ただし、ゴール地点に到着する順番について特に決まりはありません。\n複数の馬車はスタート地点を同時に発車することはできず、ある馬車が発車すれば次の馬車が発車するまでに1分以上間をあけなければなりません。\nゴール地点は十分に広いため、何台の馬車が同時に到着しても構いません。また、ゴール地点に到着した馬車はそこで止まり、ずっとゴール地点にいます。\n\"ほそながいところ\"は大変細長いため馬車は基本的に同じ場所に2台並ぶことはできません。しかし、特別に\"すこしひろいところ\"が\nm\n箇所あり、そこでのみ2台まで並ぶことができ、ある馬車が別の馬車を追い抜くことが可能です。\nまた、先述した\"ほそながいところ\"と\"すこしひろいところ\"について、以下の制約を満たします。\nスタート地点からゴール地点までは直線的に結ばれており、その距離は(\ndist\n)km(\ndist\nは1以上の整数)\nm\n箇所の\"すこしひろいところ\"はスタート地点からゴール地点までのどこかにあり、それらはいずれもスタート地点およびゴール地点とは重なりません。また、それぞれの\"すこしひろいところ\"はスタート地点からちょうど(\nD\ni\n)km(\nD\ni\nは1以上の整数)の地点にあります。\nこれを聞いた高橋君は、以上に述べた馬車運行のルールを守りつつ馬車の出発時刻を調整することにより、1台目の馬車が発車してからすべての馬車が到着するまでにかかる時間を小さくできることを見抜きました。\n\n高橋君の出した結果を知るために、\n馬車の台数\nn\n, それぞれの馬車の速度に関するパラメータ\nS\ni\n,\"ほそながいところ\"上に存在する\"すこしひろいところ\"の総数\nm\n,それぞれの\"すこしひろいところ\"のスタート地点からの距離\nD\ni\nが与えられるので、\n1台目の馬車が発車してからすべての馬車が到着するまでにかかる時間の最小値を求めるプログラムを書くことがあなたの仕事です。\n\n\nなお、苹果ちゃんは\"ほそながいところ\"での観光を存分に楽しみましたが、高橋君はこの観光の後には「ほそながかった…」としかつぶやかなかったそうです。\nInput\n入力形式は以下のようになっている。\ndist\nn\nS\n1\nS\n2\n..\nS\nn\nm\nD\n1\nD\n2\n..\nD\nm\ndist\nはスタート地点からゴール地点までの距離(km)を表す\nn\nはスタート地点を発車する馬車の数を表す\nS\ni\nは馬車の速度を表し、\ni\n番目に出発する馬車は1kmを\n(S\ni\n)\n分で進むことを表す。\nm\nは\"すこしひろいところ\"の総数を表す\nD\ni\nはスタート地点からそれぞれの\"すこしひろいところ\"への距離(km)を表す。\nConstraints\n1≤dist≤100000000(10\n8\n)\n1≤n≤5\n0≤m≤5\n1≤S\ni\n≤100\n0<D\ni\n<dist\ni≠j\nならば\nD\ni\n≠D\nj\n入力に出現する数はすべて整数である。\ni < j\nならば、\ni\n番目に出発する馬車は\nj\n番目の馬車より1分以上早く出発しなければならない\nOutput\n1台目の馬車が発車してからすべての馬車が到着するまでにかかる時間の最小値を1行に出力せよ。単位は分である。\nSample Input 1\n100\n2\n1\n2\n0\nOutput for the Sample Input 1\n201\n2台目は1台目が出発した1分後に出発する。\nSample Input 2\n100\n2\n2\n1\n0\nOutput for the Sample Input 2\n200\n2台目は1台目が出発した100分後に出発し、ゴールで1台目に追いつく。\nSample Input 3\n100\n3\n2\n1\n1\n1\n50\nOutput for the Sample Input 3\n200\n2台目は1台目が出発した50分後に出発し、50mのひろいところで1台目を抜く。\n3台目は1台目が出発した100分後に出発し、ゴールで1台目に追いつく。\nSample Input 4\n100\n4\n3\n1\n1\n3\n2\n40\n60\nOutput for the Sample Input 4\n421"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2427_8309365","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nlong long Answer = (1LL << 62);\nlong long Dist;\nlong long N, S[19];\nlong long M, D[19];\nlong long Memo[19];\nlong long NumOrder;\nvector<pair<int, int>> Order[1009];\n\nvoid InitDFS(int dep, vector<int> cur, vector<pair<int, int>> rec) {\n\tif (dep == N - 1) {\n\t\tOrder[NumOrder] = rec;\n\t\tNumOrder += 1;\n\t\treturn;\n\t}\n\tfor (int i = 0; i < cur.size(); i++) {\n\t\tfor (int j = 0; j < cur.size(); j++) {\n\t\t\tif (cur[i] == 0 || cur[j] == 1) continue;\n\t\t\tvector<int> nex = cur;\n\t\t\tvector<pair<int, int>> nexrec = rec;\n\t\t\tnex[j] = 1;\n\t\t\tnexrec.push_back(make_pair(i, j));\n\t\t\tInitDFS(dep + 1, nex, nexrec);\n\t\t}\n\t}\n}\n\nbool hantei(vector<long long> Start) {\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tif (Start[i] >= Start[i + 1]) return false;\n\t}\n\tvector<vector<int>> Count(M, vector<int>{});\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = i + 1; j < N; j++) {\n\t\t\tif (Start[j] - Start[i] >= Dist * (S[i] - S[j])) continue;\n\t\t\tif ((Start[j] - Start[i]) % (S[i] - S[j]) != 0) return false;\n\t\t\tlong long place = (Start[j] - Start[i]) / (S[i] - S[j]);\n\t\t\tlong long flag = -1;\n\t\t\tfor (int k = 0; k < M; k++) {\n\t\t\t\tif (place == D[k]) flag = k;\n\t\t\t}\n\t\t\tif (flag == -1) return false;\n\t\t\tCount[flag].push_back(Start[i] + S[i] * place);\n\t\t}\n\t}\n\tfor (int i = 0; i < M; i++) {\n\t\tfor (int j = 0; j < Count[i].size(); j++) {\n\t\t\tfor (int k = j + 1; k < Count[i].size(); k++) {\n\t\t\t\tif (Count[i][j] == Count[i][k]) return false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nvoid dfs(int dep, vector<long long> cur, vector<pair<int, int>> goal) {\n\tif (dep == goal.size()) {\n\t\tif (hantei(cur) == false) return;\n\t\tlong long score = 0;\n\t\tfor (int i = 0; i < N; i++) score = max(score, cur[i] + Dist * S[i]);\n\t\tAnswer = min(Answer, score);\n\t\treturn;\n\t}\n\n\t// Recursion\n\tint idx1 = goal[dep].first;\n\tint idx2 = goal[dep].second;\n\tfor (int i = 0; i <= M; i++) {\n\t\tvector<long long> cur2 = cur;\n\t\tif (i != M && idx1 < idx2 && S[idx1] <= S[idx2]) continue;\n\t\tif (i != M && idx1 > idx2 && S[idx1] >= S[idx2]) continue;\n\t\tif (i != M && idx1 < idx2) cur2[idx2] = cur[idx1] + D[i] * (S[idx1] - S[idx2]);\n\t\tif (i != M && idx1 > idx2) cur2[idx2] = cur[idx1] - D[i] * (S[idx2] - S[idx1]);\n\t\tif (i == M && idx1 < idx2) cur2[idx2] = cur[idx1] + max(1LL, Dist * (S[idx1] - S[idx2]));\n\t\tif (i == M && idx1 > idx2) cur2[idx2] = cur[idx1] - max(1LL, Dist * (S[idx2] - S[idx1]));\n\t\tdfs(dep + 1, cur2, goal);\n\t}\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> Dist;\n\tcin >> N;\n\tfor (int i = 0; i < N; i++) cin >> S[i];\n\tcin >> M;\n\tfor (int i = 0; i < M; i++) cin >> D[i];\n\tsort(D, D + M);\n\n\t// Step 2. Init\n\tvector<int> InitVec = vector<int>(N, 0);\n\tInitVec[0] = 1;\n\tInitDFS(0, InitVec, vector<pair<int, int>>{});\n\n\t// Step 3. Brute Force\n\tfor (int i = 0; i < NumOrder; i++) {\n\t\tdfs(0, vector<long long>(N, 0), Order[i]);\n\t}\n\n\t// Step 4. Output\n\tcout << Answer << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3480,"score_of_the_acc":-0.13,"final_rank":5},{"submission_id":"aoj_2427_7182516","code_snippet":"#include <bits/stdc++.h>\n\n// clang-format off\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\nusing ll = long long;\n// 2^60\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\nusing Graph = vector<vector<int>>;\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \"[\" << i << \"]\" << endl; s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \",\";}} s << endl; return s;}\n// clang-format on\n\n// ポテンシャル付きUnionFind\nstruct UnionFind {\n vector<int> par, siz;\n vector<ll> diff_weight;\n\n UnionFind(int n) : par(n, -1), siz(n, 1), diff_weight(n) {\n }\n\n // 根を求める\n int root(int x) {\n if (par[x] == -1) {\n return x;\n } else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n // weight(y) - weight(x) = w となるように merge する\n bool merge(int x, int y, ll w) {\n // x と y それぞれについて、 root との重み差分を補正\n w += weight(x);\n w -= weight(y);\n\n x = root(x), y = root(y);\n if (x == y)\n return false;\n if (siz[x] < siz[y]) {\n swap(x, y);\n w = -w;\n }\n par[y] = x;\n siz[x] += siz[y];\n diff_weight[y] = w;\n return true;\n }\n\n ll weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n ll diff(int x, int y) {\n return weight(y) - weight(x);\n }\n\n // グループを返却する\n vector<vector<int>> groups() {\n vector<vector<int>> g(par.size());\n for (int i = 0; i < par.size(); ++i) {\n g[root(i)].push_back(i);\n }\n auto result = std::remove_if(g.begin(), g.end(), [](auto &x) { return x.empty(); });\n g.erase(result, g.end());\n return g;\n }\n\n // x を含むグループのサイズ\n int size(int x) {\n return siz[root(x)];\n }\n};\n\nint main(void) {\n ll dist;\n int n;\n cin >> dist >> n;\n vector<int> S(n);\n rep(i, 0, n) {\n cin >> S[i];\n }\n int m;\n cin >> m;\n vector<ll> D(m);\n rep(i, 0, m) {\n cin >> D[i];\n }\n\n ll ans = 1e18;\n auto check = [&](vector<ll> &T) {\n /*\n cout << \"-------\" << endl;\n cout << T;\n cout << \"-------\" << endl;\n */\n\n UnionFind uf(n);\n int cur = -1;\n rep(i, 0, n) {\n rep(j, i + 1, n) {\n ++cur;\n if (T[cur] == -1)\n continue;\n if (uf.issame(i, j)) {\n if (uf.diff(i, j) != T[cur]) {\n return;\n }\n } else {\n uf.merge(i, j, T[cur]);\n }\n }\n }\n\n vector<map<ll, int>> count(m);\n rep(i, 0, n) {\n rep(j, i + 1, n) {\n if (not uf.issame(i, j)) {\n return;\n }\n ll diff = uf.diff(i, j);\n if (diff < 1) {\n return;\n }\n ll ig = dist * S[i];\n ll jg = diff + dist * S[j];\n if (jg < ig) {\n bool ok = false;\n\n rep(k, 0, m) {\n ll it = uf.diff(0, i) + D[k] * S[i];\n ll jt = uf.diff(0, j) + D[k] * S[j];\n if (jt == it) {\n ok = true;\n count[k][it] += 1;\n }\n }\n if (not ok) {\n return;\n }\n }\n }\n }\n\n rep(i, 0, m) {\n for (auto [t, cnt] : count[i]) {\n if (cnt >= 3) {\n return;\n }\n }\n }\n\n ll need = 0;\n rep(i, 0, n) {\n ll diff = uf.diff(0, i);\n chmax(need, diff + S[i] * dist);\n }\n\n chmin(ans, need);\n };\n\n auto rec = [&](auto &&f, int x, int y, vector<ll> &T) -> void {\n if (x == n - 1) {\n check(T);\n return;\n }\n\n int nx;\n int ny;\n\n if (y == n - 1) {\n nx = x + 1;\n ny = nx + 1;\n } else {\n nx = x;\n ny = y + 1;\n }\n\n rep(i, 0, m) {\n if (S[x] > S[y]) {\n ll diff = D[i] * (S[x] - S[y]);\n T.push_back(diff);\n f(f, nx, ny, T);\n T.pop_back();\n }\n }\n\n if (S[y] < S[x]) {\n ll diff = dist * (S[x] - S[y]);\n T.push_back(diff);\n f(f, nx, ny, T);\n T.pop_back();\n }\n\n T.push_back(1);\n f(f, nx, ny, T);\n T.pop_back();\n\n T.push_back(-1);\n f(f, nx, ny, T);\n T.pop_back();\n };\n vector<ll> t;\n rec(rec, 0, 1, t);\n cout << ans << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":3456,"score_of_the_acc":-0.1555,"final_rank":10},{"submission_id":"aoj_2427_7182510","code_snippet":"#include <bits/stdc++.h>\n\n// clang-format off\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\nusing ll = long long;\n// 2^60\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\nusing Graph = vector<vector<int>>;\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \"[\" << i << \"]\" << endl; s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \",\";}} s << endl; return s;}\n// clang-format on\n\n// ポテンシャル付きUnionFind\nstruct UnionFind {\n vector<int> par, siz;\n vector<int> diff_weight;\n\n UnionFind(int n) : par(n, -1), siz(n, 1), diff_weight(n) {\n }\n\n // 根を求める\n int root(int x) {\n if (par[x] == -1) {\n return x;\n } else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n // weight(y) - weight(x) = w となるように merge する\n bool merge(int x, int y, int w) {\n // x と y それぞれについて、 root との重み差分を補正\n w += weight(x);\n w -= weight(y);\n\n x = root(x), y = root(y);\n if (x == y)\n return false;\n if (siz[x] < siz[y]) {\n swap(x, y);\n w = -w;\n }\n par[y] = x;\n siz[x] += siz[y];\n diff_weight[y] = w;\n return true;\n }\n\n int weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n int diff(int x, int y) {\n return weight(y) - weight(x);\n }\n\n // グループを返却する\n vector<vector<int>> groups() {\n vector<vector<int>> g(par.size());\n for (int i = 0; i < par.size(); ++i) {\n g[root(i)].push_back(i);\n }\n auto result = std::remove_if(g.begin(), g.end(), [](auto &x) { return x.empty(); });\n g.erase(result, g.end());\n return g;\n }\n\n // x を含むグループのサイズ\n int size(int x) {\n return siz[root(x)];\n }\n};\n\nint main(void) {\n ll dist;\n int n;\n cin >> dist >> n;\n vector<int> S(n);\n rep(i, 0, n) {\n cin >> S[i];\n }\n int m;\n cin >> m;\n vector<ll> D(m);\n rep(i, 0, m) {\n cin >> D[i];\n }\n\n ll ans = 1e18;\n auto check = [&](vector<ll> &T) {\n /*\n cout << \"-------\" << endl;\n cout << T;\n cout << \"-------\" << endl;\n */\n\n UnionFind uf(n);\n int cur = -1;\n rep(i, 0, n) {\n rep(j, i + 1, n) {\n ++cur;\n if (T[cur] == -1)\n continue;\n if (uf.issame(i, j)) {\n if (uf.diff(i, j) != T[cur]) {\n return;\n }\n } else {\n uf.merge(i, j, T[cur]);\n }\n }\n }\n\n vector<map<ll, int>> count(m);\n rep(i, 0, n) {\n rep(j, i + 1, n) {\n if (not uf.issame(i, j)) {\n return;\n }\n ll diff = uf.diff(i, j);\n if (diff < 1) {\n return;\n }\n ll ig = dist * S[i];\n ll jg = diff + dist * S[j];\n if (jg < ig) {\n bool ok = false;\n\n rep(k, 0, m) {\n ll it = uf.diff(0, i) + D[k] * S[i];\n ll jt = uf.diff(0, j) + D[k] * S[j];\n if (jt == it) {\n ok = true;\n count[k][it] += 1;\n }\n }\n if (not ok) {\n return;\n }\n }\n }\n }\n\n rep(i, 0, m) {\n for (auto [t, cnt] : count[i]) {\n if (cnt >= 3) {\n return;\n }\n }\n }\n\n ll need = 0;\n rep(i, 0, n) {\n ll diff = uf.diff(0, i);\n chmax(need, diff + S[i] * dist);\n }\n\n chmin(ans, need);\n };\n\n auto rec = [&](auto &&f, int x, int y, vector<ll> &T) -> void {\n if (x == n - 1) {\n check(T);\n return;\n }\n\n int nx;\n int ny;\n\n if (y == n - 1) {\n nx = x + 1;\n ny = nx + 1;\n } else {\n nx = x;\n ny = y + 1;\n }\n\n rep(i, 0, m) {\n if (S[x] > S[y]) {\n ll diff = D[i] * (S[x] - S[y]);\n T.push_back(diff);\n f(f, nx, ny, T);\n T.pop_back();\n }\n }\n\n if (S[y] < S[x]) {\n ll diff = dist * (S[x] - S[y]);\n T.push_back(diff);\n f(f, nx, ny, T);\n T.pop_back();\n }\n\n T.push_back(1);\n f(f, nx, ny, T);\n T.pop_back();\n\n T.push_back(-1);\n f(f, nx, ny, T);\n T.pop_back();\n };\n vector<ll> t;\n rec(rec, 0, 1, t);\n cout << ans << endl;\n}","accuracy":0.5384615384615384,"time_ms":80,"memory_kb":3456,"score_of_the_acc":-0.1555,"final_rank":15},{"submission_id":"aoj_2427_7168642","code_snippet":"#include <bits/stdc++.h>\n\n// clang-format off\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\nusing ll = long long;\n// 2^60\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\nusing Graph = vector<vector<int>>;\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \"[\" << i << \"]\" << endl; s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \",\";}} s << endl; return s;}\n// clang-format on\n\ntemplate <class Abel>\nstruct UnionFind {\n vector<int> par;\n vector<int> rank;\n vector<Abel> diff_weight;\n\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n\n void init(int n = 1, Abel SUM_UNITY = 0) {\n par.resize(n);\n rank.resize(n);\n diff_weight.resize(n);\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n\n int root(int x) {\n if (par[x] == x) {\n return x;\n } else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n Abel weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n bool merge(int x, int y, Abel w) {\n w += weight(x);\n w -= weight(y);\n x = root(x);\n y = root(y);\n if (x == y)\n return false;\n if (rank[x] < rank[y])\n swap(x, y), w = -w;\n if (rank[x] == rank[y])\n ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n\n Abel diff(int x, int y) {\n return weight(y) - weight(x);\n }\n};\n\ntypedef pair<int, int> pint;\n\nlong long dist;\nint n, m;\nlong long S[11], D[11];\n\nconst long long INF = 1LL << 60;\nlong long res = INF; // 答えを更新していく\n\n// 各馬車が「どこですれ違うか」\nvoid check(vector<long long> diffs) {\n UnionFind<long long> uf(n);\n int iter = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n long long diff = diffs[iter++];\n if (diff == -1)\n continue;\n\n if (uf.issame(i, j)) {\n long long curdiff = uf.diff(i, j);\n if (diff != curdiff)\n return;\n } else {\n uf.merge(i, j, diff);\n }\n }\n }\n\n // 暫定回を求める\n ll ans = 0;\n for (int i = 0; i < n; ++i) {\n chmax(ans, uf.diff(0, i) + S[i] * dist);\n }\n\n // 整合性を確認\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n if (!uf.issame(i, j))\n return; // 繋がっていない箇所があったら明らかに最適でないので return\n if (uf.diff(i, j) < 1)\n return; // j が i の 1分後よりも早く出ていたらダメ\n\n // 追い越している場合はどこで追い越してるか\n long long start_i = uf.diff(0, i);\n long long goal_i = start_i + S[i] * dist;\n long long start_j = uf.diff(0, j);\n long long goal_j = start_j + S[j] * dist;\n if (goal_j < goal_i) {\n int pl = -1;\n for (int k = 0; k < m; ++k) {\n long long it = start_i + S[i] * D[k];\n long long jt = start_j + S[j] * D[k];\n if (it == jt) {\n pl = k;\n }\n }\n if (pl == -1)\n return; // 「少し広いところ以外で交わったらダメ\n }\n }\n }\n\n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\n for (int i = 0; i < m; ++i) {\n map<long long, int> ma;\n for (int j = 0; j < n; ++j) {\n long long t = uf.diff(0, j) + S[j] * D[i];\n ma[t]++;\n }\n for (map<long long, int>::iterator it = ma.begin(); it != ma.end(); ++it) {\n if (it->second >= 3)\n return;\n }\n }\n\n // 確認を終えたら OK\n if (res > ans)\n res = ans;\n}\n\nvoid dfs(vector<long long> diffs, int i, int j) {\n if (i == n - 1) {\n check(diffs);\n return;\n }\n\n // 馬車 i, j が何分でゴールするか\n long long total_i = S[i] * dist;\n long long total_j = S[j] * dist;\n\n // 次の index\n int ni = i;\n int nj = j + 1;\n if (nj == n) {\n ++ni;\n nj = ni + 1;\n }\n\n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\n if (total_j >= total_i - 1) {\n diffs.push_back(1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n\n // ゴールでピッタリ\n {\n long long diff = total_i - total_j;\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n\n // m 箇所それぞれ\n if (S[i] != S[j]) {\n for (int k = 0; k < m; ++k) {\n long long diff = (S[i] - S[j]) * D[k];\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n }\n\n // それ以外\n diffs.push_back(-1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n}\n\nint main() {\n while (cin >> dist) {\n cin >> n;\n for (int i = 0; i < n; ++i)\n cin >> S[i];\n cin >> m;\n for (int i = 0; i < m; ++i)\n cin >> D[i];\n\n vector<long long> diffs;\n dfs(diffs, 0, 1);\n\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3460,"score_of_the_acc":-0.1519,"final_rank":8},{"submission_id":"aoj_2427_7168636","code_snippet":"#include <bits/stdc++.h>\n\n// clang-format off\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\nusing ll = long long;\n// 2^60\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\nusing Graph = vector<vector<int>>;\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \"[\" << i << \"]\" << endl; s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \",\";}} s << endl; return s;}\n// clang-format on\n\ntemplate <class Abel>\nstruct UnionFind {\n vector<int> par;\n vector<int> rank;\n vector<Abel> diff_weight;\n\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n\n void init(int n = 1, Abel SUM_UNITY = 0) {\n par.resize(n);\n rank.resize(n);\n diff_weight.resize(n);\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n\n int root(int x) {\n if (par[x] == x) {\n return x;\n } else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n\n Abel weight(int x) {\n root(x);\n return diff_weight[x];\n }\n\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n bool merge(int x, int y, Abel w) {\n w += weight(x);\n w -= weight(y);\n x = root(x);\n y = root(y);\n if (x == y)\n return false;\n if (rank[x] < rank[y])\n swap(x, y), w = -w;\n if (rank[x] == rank[y])\n ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n\n Abel diff(int x, int y) {\n return weight(y) - weight(x);\n }\n};\n\ntypedef pair<int, int> pint;\n\nlong long dist;\nint n, m;\nlong long S[11], D[11];\n\nconst long long INF = 1LL << 60;\nlong long res = INF; // 答えを更新していく\n\n// 各馬車が「どこですれ違うか」\nvoid check(vector<long long> diffs) {\n UnionFind<long long> uf(n);\n int iter = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n long long diff = diffs[iter++];\n if (diff == -1)\n continue;\n\n if (uf.issame(i, j)) {\n long long curdiff = uf.diff(i, j);\n if (diff != curdiff)\n return;\n } else {\n uf.merge(i, j, diff);\n }\n }\n }\n\n // 暫定回を求める\n long long start = 0, goal = 0;\n for (int i = 0; i < n; ++i) {\n long long start_i = start + uf.diff(0, i);\n long long goal_i = start_i + S[i] * dist;\n if (start > start_i)\n start = start_i;\n if (goal < goal_i)\n goal = goal_i;\n }\n\n // 整合性を確認\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n if (!uf.issame(i, j))\n return; // 繋がっていない箇所があったら明らかに最適でないので return\n if (uf.diff(i, j) < 1)\n return; // j が i の 1分後よりも早く出ていたらダメ\n\n // 追い越している場合はどこで追い越してるか\n long long start_i = uf.diff(0, i);\n long long goal_i = start_i + S[i] * dist;\n long long start_j = uf.diff(0, j);\n long long goal_j = start_j + S[j] * dist;\n if (goal_j < goal_i) {\n int pl = -1;\n for (int k = 0; k < m; ++k) {\n long long it = start_i + S[i] * D[k];\n long long jt = start_j + S[j] * D[k];\n if (it == jt) {\n pl = k;\n }\n }\n if (pl == -1)\n return; // 「少し広いところ以外で交わったらダメ\n }\n }\n }\n\n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\n for (int i = 0; i < m; ++i) {\n map<long long, int> ma;\n for (int j = 0; j < n; ++j) {\n long long t = uf.diff(0, j) + S[j] * D[i];\n ma[t]++;\n }\n for (map<long long, int>::iterator it = ma.begin(); it != ma.end(); ++it) {\n if (it->second >= 3)\n return;\n }\n }\n\n // 確認を終えたら OK\n if (res > goal - start)\n res = goal - start;\n}\n\nvoid dfs(vector<long long> diffs, int i, int j) {\n if (i == n - 1) {\n check(diffs);\n return;\n }\n\n // 馬車 i, j が何分でゴールするか\n long long total_i = S[i] * dist;\n long long total_j = S[j] * dist;\n\n // 次の index\n int ni = i;\n int nj = j + 1;\n if (nj == n) {\n ++ni;\n nj = ni + 1;\n }\n\n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\n if (total_j >= total_i - 1) {\n diffs.push_back(1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n\n // ゴールでピッタリ\n {\n long long diff = total_i - total_j;\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n\n // m 箇所それぞれ\n if (S[i] != S[j]) {\n for (int k = 0; k < m; ++k) {\n long long diff = (S[i] - S[j]) * D[k];\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n }\n\n // それ以外\n diffs.push_back(-1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n}\n\nint main() {\n while (cin >> dist) {\n cin >> n;\n for (int i = 0; i < n; ++i)\n cin >> S[i];\n cin >> m;\n for (int i = 0; i < m; ++i)\n cin >> D[i];\n\n vector<long long> diffs;\n dfs(diffs, 0, 1);\n\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3472,"score_of_the_acc":-0.1525,"final_rank":9},{"submission_id":"aoj_2427_6031139","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;\nconst 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 << 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}\nint gcd(int a, int b) {\n\tif (a < b)swap(a, b);\n\twhile (b) {\n\t\tint r = a % b; a = b; b = r;\n\t}\n\treturn a;\n}\n\nstruct ufundo {\nprivate:\n\tvector<int> par, sz;\n\tvector<P> mem;\n\tvector<bool> united;\npublic:\n\tufundo(int n) {\n\t\tpar.resize(n, 0);\n\t\tsz.resize(n, 1);\n\t\trep(i, n) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\telse return find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y) {\n\t\t\tmem.push_back({ x,y });\n\t\t\tunited.push_back(false);\n\t\t\treturn;\n\t\t}\n\t\tunited.push_back(true);\n\t\tif (sz[x] < sz[y]) {\n\t\t\tpar[x] = y; sz[y] += sz[x];\n\t\t\tmem.push_back({ x,y });\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x; sz[x] += sz[y];\n\t\t\tmem.push_back({ y,x });\n\t\t}\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n\tint getsize(int k) {\n\t\treturn sz[k];\n\t}\n\tvoid undo() {\n\t\tassert(mem.size());\n\t\tP p = mem.back(); mem.pop_back();\n\t\tbool b = united.back(); united.pop_back();\n\t\tif (!b)return;\n\t\tint x = p.first, y = p.second;\n\t\tpar[x] = x;\n\t\tsz[y] -= sz[x];\n\t}\n};\n\n\nstruct edge {\n\tint to; ll dif;\n};\nvoid solve() {\n\tll d; cin >> d;\n\tint n, m; cin >> n;\n\tvector <ll> s(n);\n\trep(i, n)cin >> s[i];\n\tcin >> m;\n\tvector<ll> x(m);\n\trep(j, m)cin >> x[j];\n\tll ans = INF;\n\tauto upd = [&](vector<ll> t) {\n\t\trep(i, n - 1)if (t[i] + 1 > t[i + 1])return;\n\t\tvector<set<ll>> cs(m);\n\t\trep(i, n)Rep(j, i + 1, n) {\n\t\t\tif (s[i] > s[j]) {\n\t\t\t\tll dif = t[j] - t[i];\n\t\t\t\tll ds = s[i] - s[j];\n\t\t\t\tif (dif < ds * d) {\n\t\t\t\t\tif (dif % ds)return;\n\t\t\t\t\tll loc = dif / ds;\n\t\t\t\t\tbool exi = false;\n\t\t\t\t\trep(k, m)if (x[k] == loc) {\n\t\t\t\t\t\tll val = t[i] + s[i] * x[k];\n\t\t\t\t\t\tif (cs[k].count(val))return;\n\t\t\t\t\t\tcs[k].insert(val);\n\t\t\t\t\t\texi = true;\n\t\t\t\t\t}\n\t\t\t\t\tif (!exi)return;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tll ma = 0;\n\t\trep(i, n) {\n\t\t\tll val = t[i] + s[i] * d;\n\t\t\tma = max(ma, val);\n\t\t}\n\t\tans = min(ans, ma);\n\t};\n\tvector<int> cur;\n\tvector<P> vp;\n\trep(i, n)Rep(j, i + 1, n)vp.push_back({ i,j });\n\t\n\tufundo u(n);\n\tfunction<void(int)> dfs = [&](int dep) {\n\t\tif (dep == vp.size()) {\n\t\t\tvector<vector<edge>> G(n);\n\t\t\trep(i, vp.size()) {\n\t\t\t\tif (cur[i] >= 0) {\n\t\t\t\t\tint a = vp[i].first;\n\t\t\t\t\tint b = vp[i].second;\n\t\t\t\t\tll z = s[a] * x[cur[i]] - s[b] * x[cur[i]];\n\t\t\t\t\tG[a].push_back({ b,z });\n\t\t\t\t\tG[b].push_back({ a,-z });\n\t\t\t\t}\n\t\t\t}\n\t\t\tvector<bool> used(n);\n\t\t\tvector<ll> t(n);\n\t\t\tvector<int> ss;\n\n\t\t\trep(i, n) {\n\t\t\t\tif (used[i])continue;\n\t\t\t\tss.push_back(i);\n\t\t\t\t/*t[i] = 0;\n\t\t\t\tif (i > 0) {\n\t\t\t\t\tt[i] = t[i - 1] + 1;\n\t\t\t\t\trep(j, i) {\n\t\t\t\t\t\tll las = t[j]+s[j] * d - s[i] * d;\n\t\t\t\t\t\tt[i] = max(t[i], las);\n\t\t\t\t\t}\n\t\t\t\t}*/\n\t\t\t\tqueue<int> q;\n\t\t\t\tq.push(i);\n\t\t\t\tused[i] = true;\n\t\t\t\tt[i] = 0;\n\t\t\t\twhile (!q.empty()) {\n\t\t\t\t\tint id = q.front(); q.pop();\n\t\t\t\t\tfor (edge e : G[id]) {\n\t\t\t\t\t\tif (!used[e.to]) {\n\t\t\t\t\t\t\tused[e.to] = true;\n\t\t\t\t\t\t\tt[e.to] = t[id] + e.dif;\n\t\t\t\t\t\t\tq.push(e.to);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tint r = i + 1;\n\t\t\t\twhile (r < n && used[r])r++;\n\t\t\t}\n\t\t\trep(i, ss.size()) {\n\t\t\t\tint l = ss[i];\n\t\t\t\tint r = n; if (i + 1 < ss.size())r = ss[i + 1];\n\t\t\t\t//[l,r)\n\t\t\t\tif (l == 0)continue;\n\t\t\t\tll ad2 = 0;\n\t\t\t\tll clas = t[l] + s[l] * d;\n\t\t\t\tRep(j, l, r) {\n\t\t\t\t\tll las = t[j] + s[j] * d;\n\t\t\t\t\tad2 = max(ad2, clas - las);\n\t\t\t\t}\n\t\t\t\tll ad = t[l - 1]+1;\n\t\t\t\trep(j, l) {\n\t\t\t\t\tll las = t[j] + s[j] * d+ad2 - s[l] * d;\n\t\t\t\t\tad = max(ad, las);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tRep(j, l, r)t[j] += ad;\n\t\t\t}\n\t\t\t//rep(i, ss.size())cout << ss[i] << \" \";\n\t\t\t//cout << \"\\n\";\n\t\t\tupd(t);\n\n\t\t}\n\t\telse {\n\t\t\tfor (int i = -1; i < m; i++) {\n\t\t\t\tif (i >= 0) {\n\t\t\t\t\tint a = vp[dep].first;\n\t\t\t\t\tint b = vp[dep].second;\n\t\t\t\t\tif (u.same(a, b))continue;\n\t\t\t\t\tcur.push_back(i);\n\t\t\t\t\tu.unite(a, b);\n\t\t\t\t\tdfs(dep + 1);\n\t\t\t\t\tcur.pop_back();\n\t\t\t\t\tu.undo();\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcur.push_back(i);\n\t\t\t\t\tdfs(dep + 1);\n\t\t\t\t\tcur.pop_back();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t};\n\tdfs(0);\n\tcout << ans << \"\\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//int t; cin >> t; rep(i, t)\n\t//while (cin>>n>>m>>r,n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":19860,"score_of_the_acc":-1.0038,"final_rank":14},{"submission_id":"aoj_2427_3221561","code_snippet":"#include<cstdlib>\n#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<set>\n#include<cstring>\n#include<map>\nusing namespace std;\nconst int MAXN = (int) 105;\nconst int INF = (int) 0x3f3f3f3f;\ntypedef long long LL;\n\nint dist;\nint M,N;\nint S[MAXN];\nint D[MAXN];\nLL ans;\nLL out_time[MAXN];\nmap<LL,set<int> > mp;\nstruct permutation{\n int a[10];\n}per;\nint percnt;\nvector<permutation> P;\n\nbool is_judge(){\n mp.clear();\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\n for(int i=1;i<N;i++){\n for(int j=i+1;j<=N;j++){\n if(S[i]<=S[j]) continue;\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\n int ok=0;\n for(int k=1;k<=M;k++){\n if(D[k]==tmpD) ok=1;\n }\n if(!ok) return false;\n if(mp.count(tmpD)){\n if(mp[tmpD].count(i)) return false;\n if(mp[tmpD].count(j)) return false;\n }\n mp[tmpD].insert(i);\n mp[tmpD].insert(j);\n }\n }\n return true;\n}\n\nvoid update(){\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\n if(!is_judge()) return;\n LL tmpans=0;\n for(int i=1;i<=N;i++){\n LL tmp=out_time[i]+(LL)dist*S[i];\n tmpans=max(tmpans,tmp);\n }\n ans=min(ans,tmpans);\n}\n\nint mark[MAXN];\nvoid DFS1(int cur){\n if(cur>N){\n per.a[0]=1;\n P.push_back(per);\n return;\n }\n for(int i=1;i<=N;i++)if(!mark[i]){\n per.a[++percnt]=i;\n mark[i]=1;\n DFS1(cur+1);\n percnt--;\n mark[i]=0;\n }\n}\n\nvoid DFS2(int curid,const permutation& now){\n if(curid>N){\n update();\n return;\n }\n int cur=now.a[curid];\n if(curid==1){\n out_time[cur]=0;\n DFS2(curid+1,now);\n return;\n }\n\n for(int t=1;t<curid;t++){\n int pre=now.a[t];\n if(cur<pre){\n out_time[cur]=out_time[pre]-1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\n // printf(\"%d-%d : %lld->%lld\\n\",pre,cur,out_time[pre],out_time[cur]);\n DFS2(curid+1,now);\n }\n }\n if(cur>pre){\n out_time[cur]=out_time[pre]+1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\n DFS2(curid+1,now);\n }\n }\n }\n}\n\nvoid solve(){\n for(int perid=0;perid<P.size();perid++){\n DFS2(1,P[perid]);\n }\n}\n\nvoid work(){\n scanf(\"%d%d\",&dist,&N);\n for(int i=1;i<=N;i++) scanf(\"%d\",&S[i]);\n scanf(\"%d\",&M);\n for(int i=1;i<=M;i++) scanf(\"%d\",&D[i]);\n D[++M]=dist;\n ans=(LL)INF*INF;\n DFS1(1);\n solve();\n printf(\"%lld\\n\",ans);\n}\n\nint main(){\n#ifdef NNever\n//freopen(\"data.in\",\"r\",stdin);\n///freopen(\"out.txt\",\"w\",stdout);\n#endif // NNever\n work();\n return 0;\n}\n\n/*\ninput\n60516263\n5\n45\n16\n94\n71\n91\n4\n20586550\n54017689\n36941264\n49153094\n\noutput\n6577480535\n*/","accuracy":1,"time_ms":60,"memory_kb":3308,"score_of_the_acc":-0.14,"final_rank":6},{"submission_id":"aoj_2427_3221184","code_snippet":"#include<cstdlib>\n#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<set>\n#include<cstring>\n#include<map>\nusing namespace std;\nconst int MAXN = (int) 105;\nconst int INF = (int) 0x3f3f3f3f;\ntypedef long long LL;\n\nint dist;\nint M,N;\nint S[MAXN];\nint D[MAXN];\nLL ans;\nLL out_time[MAXN];\nmap<LL,set<int> > mp;\nstruct permutation{\n int a[10];\n}per;\nint percnt;\nvector<permutation> P;\n\nbool is_judge(){\n mp.clear();\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\n// for(int i=1;i<=n;i++) printf(\"%lld \",out_time[i]);\n// printf(\"\\n\");\n for(int i=1;i<N;i++){\n for(int j=i+1;j<=N;j++){\n if(S[i]<=S[j]) continue;\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\n int ok=0;\n for(int k=1;k<=M;k++){\n if(D[k]==tmpD) ok=1;\n }\n// printf(\"ok = %d! , tmpD = %-12d , i = %d , j = %d\\n\",ok,tmpD,i,j);\n if(!ok) return false;\n if(mp.count(tmpD)){\n if(mp[tmpD].count(i)) return false;\n if(mp[tmpD].count(j)) return false;\n }\n mp[tmpD].insert(i);\n mp[tmpD].insert(j);\n }\n }\n return true;\n}\n\nvoid update(){\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\n// for(int i=1;i<N;i++)if(out_time[i]>=out_time[i+1]) return;\n// for(int i=1;i<=N;i++) printf(\"%lld \",out_time[i]);\n// printf(\"\\n\");\n if(!is_judge()) return;\n LL tmpans=0;\n for(int i=1;i<=N;i++){\n LL tmp=out_time[i]+(LL)dist*S[i];\n tmpans=max(tmpans,tmp);\n }\n// if(tmpans==6577480535){\n// for(int i=1;i<=N;i++) printf(\"%lld \",out_time[i]);\n// printf(\"\\n\");\n// if(is_judge()) printf(\"true!\\n\");\n// else printf(\"false!\\n\");\n// exit(0xff);\n// }\n// for(int i=1;i<=n;i++) printf(\"%lld \",out_time[i]);\n// printf(\" : tmpans = %lld\\n\",tmpans);\n ans=min(ans,tmpans);\n}\n\nint mark[MAXN];\nvoid DFS1(int cur){\n if(cur>N){\n per.a[0]=1;\n P.push_back(per);\n return;\n }\n for(int i=1;i<=N;i++)if(!mark[i]){\n per.a[++percnt]=i;\n mark[i]=1;\n DFS1(cur+1);\n percnt--;\n mark[i]=0;\n }\n}\n\nvoid DFS2(int curid,const permutation& now){\n if(curid>N){\n update();\n return;\n }\n int cur=now.a[curid];\n if(curid==1){\n out_time[cur]=0;\n DFS2(curid+1,now);\n return;\n }\n\n for(int t=1;t<curid;t++){\n int pre=now.a[t];\n if(cur<pre){\n out_time[cur]=out_time[pre]-1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\n // printf(\"%d-%d : %lld->%lld\\n\",pre,cur,out_time[pre],out_time[cur]);\n DFS2(curid+1,now);\n }\n }\n if(cur>pre){\n out_time[cur]=out_time[pre]+1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\n // printf(\"%d-%d : %lld->%lld\\n\",pre,cur,out_time[pre],out_time[cur]);\n DFS2(curid+1,now);\n }\n }\n }\n}\n\nvoid solve(){\n for(int perid=0;perid<P.size();perid++){\n DFS2(1,P[perid]);\n }\n}\n\nvoid work(){\n scanf(\"%d%d\",&dist,&N);\n for(int i=1;i<=N;i++) scanf(\"%d\",&S[i]);\n scanf(\"%d\",&M);\n for(int i=1;i<=M;i++) scanf(\"%d\",&D[i]);\n D[++M]=dist;\n ans=(LL)INF*INF;\n DFS1(1);\n// printf(\"Pcnt = %d\\n\",P.size());\n// for(int i=0;i<P.size();i++){\n// for(int k=1;k<=N;k++) printf(\"%d \",P[i].a[k]);\n// printf(\"\\n\");\n// }\n solve();\n printf(\"%lld\\n\",ans);\n}\n\nint main(){\n#ifdef NNever\n//freopen(\"data.in\",\"r\",stdin);\n///freopen(\"out.txt\",\"w\",stdout);\n#endif // NNever\n work();\n return 0;\n}\n\n/*\ninput\n60516263\n5\n45\n16\n94\n71\n91\n4\n20586550\n54017689\n36941264\n49153094\n\noutput\n6577480535\n*/","accuracy":1,"time_ms":60,"memory_kb":3320,"score_of_the_acc":-0.1406,"final_rank":7},{"submission_id":"aoj_2427_3221132","code_snippet":"#include<cstdlib>\n#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<set>\n#include<cstring>\n#include<map>\nusing namespace std;\nconst int MAXN = (int) 105;\nconst int INF = (int) 0x3f3f3f3f;\ntypedef long long LL;\n\nint dist;\nint M,N;\nint S[MAXN];\nint D[MAXN];\nLL ans;\nLL out_time[MAXN];\nmap<LL,int> mp;\nstruct permutation{\n int a[10];\n}per;\nint percnt;\nvector<permutation> P;\n\nbool is_judge(){\n mp.clear();\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\n// for(int i=1;i<=n;i++) printf(\"%lld \",out_time[i]);\n// printf(\"\\n\");\n for(int i=1;i<=N;i++){\n for(int j=i+1;j<N;j++){\n if(S[i]<=S[j]) continue;\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\n int ok=0;\n for(int k=1;k<=M;k++){\n if(D[k]==tmpD) ok=1;\n }\n if(!ok) return false;\n if(mp.count(tmpD)) return false;\n mp[tmpD]++;\n }\n }\n return true;\n}\n\nvoid update(){\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\n// for(int i=1;i<N;i++)if(out_time[i]>=out_time[i+1]) return;\n// for(int i=1;i<=N;i++) printf(\"%lld \",out_time[i]);\n// printf(\"\\n\");\n if(!is_judge()) return;\n LL tmpans=0;\n for(int i=1;i<=N;i++){\n LL tmp=out_time[i]+(LL)dist*S[i];\n tmpans=max(tmpans,tmp);\n }\n// for(int i=1;i<=n;i++) printf(\"%lld \",out_time[i]);\n// printf(\" : tmpans = %lld\\n\",tmpans);\n ans=min(ans,tmpans);\n}\n\nint mark[MAXN];\nvoid DFS1(int cur){\n if(cur>N){\n per.a[0]=1;\n P.push_back(per);\n return;\n }\n for(int i=1;i<=N;i++)if(!mark[i]){\n per.a[++percnt]=i;\n mark[i]=1;\n DFS1(cur+1);\n percnt--;\n mark[i]=0;\n }\n}\n\nvoid DFS2(int curid,permutation now){\n if(curid>N){\n update();\n return;\n }\n int cur=now.a[curid];\n if(curid==1){\n out_time[cur]=0;\n DFS2(curid+1,now);\n return;\n }\n\n for(int t=1;t<curid;t++){\n int pre=now.a[t];\n if(cur<pre){\n out_time[cur]=out_time[pre]-1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\n // printf(\"%d-%d : %lld->%lld\\n\",pre,cur,out_time[pre],out_time[cur]);\n DFS2(curid+1,now);\n }\n }\n if(cur>pre){\n out_time[cur]=out_time[pre]+1;\n DFS2(curid+1,now);\n for(int i=1;i<=M;i++){\n LL dt=D[i];\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\n // printf(\"%d-%d : %lld->%lld\\n\",pre,cur,out_time[pre],out_time[cur]);\n DFS2(curid+1,now);\n }\n }\n }\n}\n\nvoid solve(){\n for(int perid=0;perid<P.size();perid++){\n permutation now=P[perid];\n DFS2(1,now);\n }\n}\n\nvoid work(){\n scanf(\"%d%d\",&dist,&N);\n for(int i=1;i<=N;i++) scanf(\"%d\",&S[i]);\n scanf(\"%d\",&M);\n for(int i=1;i<=M;i++) scanf(\"%d\",&D[i]);\n D[++M]=dist;\n ans=(LL)INF*INF;\n DFS1(1);\n// printf(\"Pcnt = %d\\n\",P.size());\n// for(int i=0;i<P.size();i++){\n// for(int k=1;k<=n;k++) printf(\"%d \",P[i].a[k]);\n// printf(\"\\n\");\n// }\n solve();\n printf(\"%lld\\n\",ans);\n}\n\nint main(){\n#ifdef NNever\n//freopen(\"data.in\",\"r\",stdin);\n///freopen(\"out.txt\",\"w\",stdout);\n#endif // NNever\n work();\n return 0;\n}\n\n/*\n60516263\n5\n45\n16\n94\n71\n91\n4\n20586550\n54017689\n36941264\n49153094\n*/","accuracy":0.3076923076923077,"time_ms":40,"memory_kb":3308,"score_of_the_acc":-0.1323,"final_rank":18},{"submission_id":"aoj_2427_3054377","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 dist;\n cin>>dist;\n Int n;\n cin>>n;\n vector<Int> s(n);\n for(Int i=0;i<n;i++) cin>>s[i];\n Int m;\n cin>>m;\n vector<Int> d(m);\n for(Int i=0;i<m;i++) cin>>d[i];\n\n const Int INF = 1e17;\n Int t[10][10];\n Int ans=INF;\n auto check=\n [&](){\n struct edge{\n\tInt from,to,cost;\n\tedge(Int from,Int to,Int cost):from(from),to(to),cost(cost){\n\t //cout<<from<<\" \"<<to<<\" \"<<cost<<endl;\n\t}\n };\n vector<edge> es;\n \n for(Int i=1;i<n;i++){\n\t// p[i-1] + 1 <= p[i]\n\t// p[i-1] - p[i] <= -1\n\tes.emplace_back(i,i-1,-1);\n }\n vector<Int> cnt(m,0);\n for(Int i=0;i<n;i++){\n\tfor(Int j=i+1;j<n;j++){\n\t // j catch up i at t[i][j]\n\t if(t[i][j]==m){\n\t // dist * s[i] + p[i] <= dist * s[j] + p[j]\n\t // p[i] - p[j] <= dist * s[j] - dist * s[i]\t \n\t es.emplace_back(j,i,dist*(s[j]-s[i]));\n\t continue;\n\t }\n\t cnt[t[i][j]]++;\n\t if(cnt[t[i][j]]>1) return;\n\t Int x=d[t[i][j]];\n\t // x * s[i] + p[i] == x * s[j] + p[j]\n\t // x * s[i] + p[i] <= x * s[j] + p[j]\t \n\t // p[i] - p[j] <= x * s[j] - x * s[i]\n\t es.emplace_back(j,i,x*(s[j]-s[i]));\n\t // x * s[i] + p[i] >= x * s[j] + p[j]\n\t // p[j] - p[i] <= x * s[i] - x * s[j]\n\t es.emplace_back(i,j,x*(s[i]-s[j]));\t \n\t}\n }\n \n vector<Int> p(n,INF);\n // minimize p[n-1] - p[0]\n // maximize p[0] - p[n-1]\n p[n-1] = 0;\n Int flg=1;\n for(Int t=0;t<n*3;t++){\n\tflg=0;\n\tfor(auto e:es){\n\t if(p[e.from]+e.cost<p[e.to]){\n\t p[e.to]=p[e.from]+e.cost;\n\t flg=1;\n\t }\n\t}\t\n }\n if(flg) return;\n assert(p[n-1]==0);\n vector<Int> z(n);\n for(Int i=0;i<n;i++) z[i]=p[i]-p[0];\n Int res=0;\n for(Int i=0;i<n;i++) chmax(res,dist*s[i]+z[i]);\n chmin(ans,res);\n //for(Int i=0;i<n;i++) cout<<i<<\":\"<<z[i]<<endl;\n //cout<<res<<endl;\n };\n\n using P = pair<Int, Int>;\n vector<P> vp;\n for(Int i=0;i<n;i++)\n for(Int j=i+1;j<n;j++)\n vp.emplace_back(i,j);\n\n function<void(Int)> dfs=\n [&](Int x){\n if(x==(Int)vp.size()){\n\tcheck();\n\treturn;\n }\n for(Int i=0;i<=m;i++){\n\tt[vp[x].first][vp[x].second]=i;\n\tdfs(x+1);\n }\n };\n \n dfs(0);\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.3076923076923077,"time_ms":2630,"memory_kb":3096,"score_of_the_acc":-1.1096,"final_rank":19},{"submission_id":"aoj_2427_2757662","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <string>\n#include <map>\nusing namespace std;\n\n\n#define REP(i, s) for (int i = 0; i < s; ++i)\n#define ALL(v) (v.begin(), v.end())\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; } return s << endl; }\n\n\n\ntemplate<class Abel> struct UnionFind {\n vector<int> par;\n vector<int> rank;\n vector<Abel> diff_weight;\n \n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\n init(n, SUM_UNITY);\n }\n \n void init(int n = 1, Abel SUM_UNITY = 0) {\n par.resize(n); rank.resize(n); diff_weight.resize(n);\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\n }\n \n int root(int x) {\n if (par[x] == x) {\n return x;\n }\n else {\n int r = root(par[x]);\n diff_weight[x] += diff_weight[par[x]];\n return par[x] = r;\n }\n }\n \n Abel weight(int x) {\n root(x);\n return diff_weight[x];\n }\n \n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n \n bool merge(int x, int y, Abel w) {\n w += weight(x); w -= weight(y);\n x = root(x); y = root(y);\n if (x == y) return false;\n if (rank[x] < rank[y]) swap(x, y), w = -w;\n if (rank[x] == rank[y]) ++rank[x];\n par[y] = x;\n diff_weight[y] = w;\n return true;\n }\n \n Abel diff(int x, int y) {\n return weight(y) - weight(x);\n }\n \n friend ostream& operator << (ostream& s, UnionFind uf) {\n map<int, vector<int> > res;\n for (int i = 0; i < uf.par.size(); ++i) {\n int r = uf.root(i);\n res[r].push_back(i);\n }\n for (map<int, vector<int> >::iterator it = res.begin(); it != res.end(); ++it) {\n s << endl;\n for (int j = 0; j < (int)it->second.size(); ++j) {\n s << it->second[j] << \"(\" << uf.weight(it->second[j]) << \"), \";\n }\n }\n return s << endl;\n }\n};\n\ntypedef pair<int,int> pint;\n\nlong long dist;\nint n, m;\nlong long S[11], D[11];\n\nconst long long INF = 1LL<<60;\nlong long res = INF; // 答えを更新していく\n\n// 各馬車が「どこですれ違うか」\nvoid check(vector<long long> diffs) {\n UnionFind<long long> uf(n);\n int iter = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n long long diff = diffs[iter++];\n if (diff == -1) continue;\n \n if (uf.issame(i, j)) {\n long long curdiff = uf.diff(i, j);\n if (diff != curdiff) return;\n }\n else {\n uf.merge(i, j, diff);\n }\n }\n }\n\n // 暫定回を求める\n long long start = 0, goal = 0;\n for (int i = 0; i < n; ++i) {\n long long start_i = start + uf.diff(0, i);\n long long goal_i = start_i + S[i] * dist;\n if (start > start_i) start = start_i;\n if (goal < goal_i) goal = goal_i;\n }\n \n // 整合性を確認\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n if (!uf.issame(i, j)) return; // 繋がっていない箇所があったら明らかに最適でないので return\n if (uf.diff(i, j) < 1) return; // j が i の 1分後よりも早く出ていたらダメ\n \n // 追い越している場合はどこで追い越してるか\n long long start_i = uf.diff(0, i);\n long long goal_i = start_i + S[i] * dist;\n long long start_j = uf.diff(0, j);\n long long goal_j = start_j + S[j] * dist;\n if (goal_j < goal_i) {\n int pl = -1;\n for (int k = 0; k < m; ++k) {\n long long it = start_i + S[i] * D[k];\n long long jt = start_j + S[j] * D[k];\n if (it == jt) {\n pl = k;\n }\n }\n if (pl == -1) return; // 「少し広いところ以外で交わったらダメ\n }\n }\n }\n \n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\n for (int i = 0; i < m; ++i) {\n map<long long,int> ma;\n for (int j = 0; j < n; ++j) {\n long long t = uf.diff(0, j) + S[j] * D[i];\n ma[t]++;\n }\n for (map<long long,int>::iterator it = ma.begin(); it != ma.end(); ++it) {\n if (it->second >= 3) return;\n }\n }\n \n /*\n COUT(\"--------------\");\n COUT(diffs);\n COUT(uf);\n COUT(start);\n COUT(goal);\n */\n \n // 確認を終えたら OK\n if (res > goal - start) res = goal - start;\n}\n\nvoid dfs(vector<long long> diffs, int i, int j) {\n if (i == n-1) {\n check(diffs);\n return;\n }\n \n // 馬車 i, j が何分でゴールするか\n long long total_i = S[i] * dist;\n long long total_j = S[j] * dist;\n \n // 次の index\n int ni = i;\n int nj = j+1;\n if (nj == n) {\n ++ni;\n nj = ni+1;\n }\n \n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\n if (total_j >= total_i - 1) {\n diffs.push_back(1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n \n // ゴールでピッタリ\n {\n long long diff = total_i - total_j;\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n \n // m 箇所それぞれ\n if (S[i] != S[j]) {\n for (int k = 0; k < m; ++k) {\n long long diff = (S[i] - S[j]) * D[k];\n if (diff >= 1) {\n diffs.push_back(diff);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n }\n }\n }\n \n // それ以外\n diffs.push_back(-1);\n dfs(diffs, ni, nj);\n diffs.pop_back();\n}\n\nint main() {\n while (cin >> dist) {\n cin >> n;\n for (int i = 0; i < n; ++i) cin >> S[i];\n cin >> m;\n for (int i = 0; i < m; ++i) cin >> D[i];\n \n vector<long long> diffs;\n dfs(diffs, 0, 1);\n \n cout << res << endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":3176,"score_of_the_acc":-0.1559,"final_rank":11},{"submission_id":"aoj_2427_1654709","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\n\nconst long long int My_LInf=9223372036854775807;\n\n\nstruct aUnionFind {\n\tvector<pair<int, long long int>> data;\n\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\n\n\t//y is w bigger than x\n\tbool unionSet(const int x, const int y, const long long int w) {\n\t\tconst int rx(root(x).first), ry(root(y).first);\n\t\tif (rx != ry) {\n\t\t\tdata[rx].first += data[ry].first; data[ry].first = rx;\n\t\t\tdata[ry].second = w + data[x].second - data[y].second;\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn root(x).second + w == root(y).second;\n\t\t}\n\t}\n\tbool findSet(const int x, const int y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\t//x is belong to first\n\t//x is second bigger than first\n\tpair<int, long long int> root(const int x) {\n\t\tif (data[x].first < 0) {\n\t\t\treturn make_pair(x, 0);\n\t\t}\n\t\telse {\n\t\t\tpair<int, long long int>ndata;\n\t\t\tndata.first = root(data[x].first).first;\n\t\t\tndata.second = data[x].second + root(data[x].first).second;\n\t\t\treturn data[x] = ndata;\n\t\t}\n\t}\n\tint size(const int x) {\n\t\treturn -data[root(x).first].first;\n\t}\n};\n\n\nint HorseNum, M;\n\nvector<long long int>sps;\n\nstruct aa {\n\tint fstfinid;\n\tlong long int fstfintime;\n\tint lasfinid;\n\tlong long int lasfintime;\n\tint fststaid;\n\tlong long int fststatime;\n\tint lasstaid;\n\tlong long int lasstatime;\n};\n\n\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\n\tvector<int>seq(HorseNum);\n\tiota(seq.begin(), seq.end(), 0);\n\taUnionFind uf(HorseNum);\n\tfor (int wide = 0; wide < M; ++wide) {\n\t\tfor (int change = 0; change < HorseNum - 1; ++change) {\n\t\t\tif (changes[wide][change]) {\n\t\t\t\tconst int c0 = seq[change];\n\t\t\t\tconst int c1 = seq[change + 1];\n\t\t\t\tconst long long int sa = times[c0][wide] - times[c1][wide];\n\t\t\t\tif (sa > 0) {\n\t\t\t\t\tif (!uf.unionSet(c0, c1, sa)) {\n\t\t\t\t\t\treturn My_LInf;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn My_LInf;\n\t\t\t\t}\n\t\t\t\tswap(seq[change], seq[change + 1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tmap<int, aa>mp;\n\tfor (int i = 0; i < HorseNum; ++i) {\n\t\tif (!mp.count(uf.root(i).first)) {\n\t\t\tmp[uf.root(i).first] = aa{\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,0,\n\t\t\ti,0,\n\t\t\t};\n\t\t}\n\t\telse {\n\t\t\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].fstfinid = i;\n\t\t\t\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].lasfinid = i;\n\t\t\t\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tmp[uf.root(i).first].lasstaid = i;\n\t\t\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\n\t\t}\n\t}\n\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\n\t\tif (it != mp.begin()) {\n\t\t\taa afrom(prev(it)->second);\n\t\t\taa ato(it->second);\n\n\t\t\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\n\t\t\t\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(seq[i]).second+times[seq[i]][M] > uf.root(seq[i + 1]).second + times[seq[i+1]][M])return My_LInf;\n\t}\n\tlong long int amax = 0;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\n\t}\n\treturn amax;\n}\n\nint main() {\n\tlong long int dist;\n\tcin >> dist;\n\n\tcin >> HorseNum;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tint S; cin >> S;\n\t\tsps.push_back(S);\n\t}\n\tcin >> M;\n\tvector<long long int>ds;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint D; cin >> D;\n\t\tds.push_back(D);\n\t}\n\tsort(ds.begin(), ds.end());\n\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\ttimes[i][j] = sps[i] * ds[j];\n\t\t}\n\t\ttimes[i][M] = sps[i] * dist;\n\t}\n\tlong long int ans = My_LInf;\n\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\n\t\tbitset<20>bs(i);\n\t\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\n\t\tbool ok = true;\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 1; ++k) {\n\t\t\t\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 2; ++k) {\n\t\t\t\tif (changes[j][k] && changes[j][k + 1]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok)continue;\n\t\tlong long int a = check(changes, times);\n\t\tif (a < ans) {\n\t\t\tans = a;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":330,"memory_kb":3176,"score_of_the_acc":-0.236,"final_rank":12},{"submission_id":"aoj_2427_1654653","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\n\nconst long long int My_LInf=9223372036854775807;\n\n\nstruct aUnionFind {\n\tvector<pair<int, long long int>> data;\n\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\n\n\t//y is w bigger than x\n\tbool unionSet(const int x, const int y, const long long int w) {\n\t\tconst int rx(root(x).first), ry(root(y).first);\n\t\tif (rx != ry) {\n\t\t\tdata[rx].first += data[ry].first; data[ry].first = rx;\n\t\t\tdata[ry].second = w + data[x].second - data[y].second;\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn root(x).second + w == root(y).second;\n\t\t}\n\t}\n\tbool findSet(const int x, const int y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\t//x is belong to first\n\t//x is second bigger than first\n\tpair<int, long long int> root(const int x) {\n\t\tif (data[x].first < 0) {\n\t\t\treturn make_pair(x, 0);\n\t\t}\n\t\telse {\n\t\t\tpair<int, long long int>ndata;\n\t\t\tndata.first = root(data[x].first).first;\n\t\t\tndata.second = data[x].second + root(data[x].first).second;\n\t\t\treturn data[x] = ndata;\n\t\t}\n\t}\n\tint size(const int x) {\n\t\treturn -data[root(x).first].first;\n\t}\n};\n\n\nint HorseNum, M;\n\nvector<long long int>sps;\n\nstruct aa {\n\tint fstfinid;\n\tlong long int fstfintime;\n\tint lasfinid;\n\tlong long int lasfintime;\n\tint fststaid;\n\tlong long int fststatime;\n\tint lasstaid;\n\tlong long int lasstatime;\n};\n\n\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\n\tvector<int>seq(HorseNum);\n\tiota(seq.begin(), seq.end(), 0);\n\taUnionFind uf(HorseNum);\n\tfor (int wide = 0; wide < M; ++wide) {\n\t\tfor (int change = 0; change < HorseNum - 1; ++change) {\n\t\t\tif (changes[wide][change]) {\n\t\t\t\tconst int c0 = seq[change];\n\t\t\t\tconst int c1 = seq[change + 1];\n\t\t\t\tconst long long int sa = times[c0][wide] - times[c1][wide];\n\t\t\t\tif (sa > 0) {\n\t\t\t\t\tif (!uf.unionSet(c0, c1, sa)) {\n\t\t\t\t\t\treturn My_LInf;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn My_LInf;\n\t\t\t\t}\n\t\t\t\tswap(seq[change], seq[change + 1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tmap<int, aa>mp;\n\tfor (int i = 0; i < HorseNum; ++i) {\n\t\tif (!mp.count(uf.root(i).first)) {\n\t\t\tmp[uf.root(i).first] = aa{\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,0,\n\t\t\ti,0,\n\t\t\t};\n\t\t}\n\t\telse {\n\t\t\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].fstfinid = i;\n\t\t\t\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].lasfinid = i;\n\t\t\t\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tmp[uf.root(i).first].lasstaid = i;\n\t\t\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\n\t\t}\n\t}\n\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\n\t\tif (it != mp.begin()) {\n\t\t\taa afrom(prev(it)->second);\n\t\t\taa ato(it->second);\n\n\t\t\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\n\t\t\t\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\n\t\t\t}\n\t\t\t/*aUnionFind auf(uf);\n\t\t\taUnionFind buf(uf);\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasfinid;\n\t\t\t\tint to = (it)->second.fstfinid;\n\n\t\t\t\tif (sps[from] > sps[to]) {\n\t\t\t\t\tauf.unionSet(from, to, times[from][M] - times[to][M]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasstaid;\n\t\t\t\tint to = (it)->second.fststaid;\n\t\t\t\tbuf.unionSet(from, to, 1);\n\t\t\t\t\n\t\t\t}\n\n\t\t\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\n\t\t\t\tuf = buf;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf = auf;\n\t\t\t}*/\n\t\t}\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(seq[i]).second+times[seq[i]][M] > uf.root(seq[i + 1]).second + times[seq[i+1]][M])return My_LInf;\n\t}\n\tlong long int amax = 0;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\n\t}\n\treturn amax;\n}\n\nint main() {\n\taUnionFind uu(10);\n\tuu.unionSet(0, 1, 3);\n\tuu.unionSet(0, 2, 4);\n\tuu.unionSet(2, 4, 5);\n\tuu.unionSet(6, 7, 1);\n\tuu.unionSet(7, 8, 2);\n\tuu.unionSet(0, 8, 0);\n\t\n\t\n\tlong long int dist;\n\tcin >> dist;\n\n\tcin >> HorseNum;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tint S; cin >> S;\n\t\tsps.push_back(S);\n\t}\n\tcin >> M;\n\tvector<long long int>ds;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint D; cin >> D;\n\t\tds.push_back(D);\n\t}\n\tsort(ds.begin(), ds.end());\n\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\ttimes[i][j] = sps[i] * ds[j];\n\t\t}\n\t\ttimes[i][M] = sps[i] * dist;\n\t}\n\tlong long int ans = My_LInf;\n\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\n\t\tbitset<20>bs(i);\n\t\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\n\t\tbool ok = true;\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 1; ++k) {\n\t\t\t\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 2; ++k) {\n\t\t\t\tif (changes[j][k] && changes[j][k + 1]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok)continue;\n\t\tlong long int a = check(changes, times);\n\t\tif (a < ans) {\n\t\t\tans = a;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":330,"memory_kb":3180,"score_of_the_acc":-0.2362,"final_rank":13},{"submission_id":"aoj_2427_1654627","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\n\nconst long long int My_LInf=9223372036854775807;\n\n\nstruct aUnionFind {\n\tvector<pair<int, long long int>> data;\n\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\n\n\t//y is w bigger than x\n\tbool unionSet(const int x, const int y, const long long int w) {\n\t\tconst int rx(root(x).first), ry(root(y).first);\n\t\tif (rx != ry) {\n\t\t\tdata[rx].first += data[ry].first; data[ry].first = rx;\n\t\t\tdata[ry].second = w + data[x].second - data[y].second;\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn root(x).second + w == root(y).second;\n\t\t}\n\t}\n\tbool findSet(const int x, const int y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\t//x is belong to first\n\t//x is second bigger than first\n\tpair<int, long long int> root(const int x) {\n\t\tif (data[x].first < 0) {\n\t\t\treturn make_pair(x, 0);\n\t\t}\n\t\telse {\n\t\t\tpair<int, long long int>ndata;\n\t\t\tndata.first = root(data[x].first).first;\n\t\t\tndata.second = data[x].second + root(data[x].first).second;\n\t\t\treturn data[x] = ndata;\n\t\t}\n\t}\n\tint size(const int x) {\n\t\treturn -data[root(x).first].first;\n\t}\n};\n\n\nint HorseNum, M;\n\nvector<long long int>sps;\n\nstruct aa {\n\tint fstfinid;\n\tlong long int fstfintime;\n\tint lasfinid;\n\tlong long int lasfintime;\n\tint fststaid;\n\tlong long int fststatime;\n\tint lasstaid;\n\tlong long int lasstatime;\n};\n\n\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\n\tvector<int>seq(HorseNum);\n\tiota(seq.begin(), seq.end(), 0);\n\taUnionFind uf(HorseNum);\n\tfor (int wide = 0; wide < M; ++wide) {\n\t\tfor (int change = 0; change < HorseNum - 1; ++change) {\n\t\t\tif (changes[wide][change]) {\n\t\t\t\tconst int c0 = seq[change];\n\t\t\t\tconst int c1 = seq[change + 1];\n\t\t\t\tconst long long int sa = times[c0][wide] - times[c1][wide];\n\t\t\t\tif (sa > 0) {\n\t\t\t\t\tif (!uf.unionSet(c0, c1, sa)) {\n\t\t\t\t\t\treturn My_LInf;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn My_LInf;\n\t\t\t\t}\n\t\t\t\tswap(seq[change], seq[change + 1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tmap<int, aa>mp;\n\tfor (int i = 0; i < HorseNum; ++i) {\n\t\tif (!mp.count(uf.root(i).first)) {\n\t\t\tmp[uf.root(i).first] = aa{\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,0,\n\t\t\ti,0,\n\t\t\t};\n\t\t}\n\t\telse {\n\t\t\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].fstfinid = i;\n\t\t\t\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].lasfinid = i;\n\t\t\t\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tmp[uf.root(i).first].lasstaid = i;\n\t\t\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\n\t\t}\n\t}\n\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\n\t\tif (it != mp.begin()) {\n\t\t\taa afrom(prev(it)->second);\n\t\t\taa ato(it->second);\n\n\t\t\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\n\t\t\t\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\n\t\t\t}\n\t\t\t/*aUnionFind auf(uf);\n\t\t\taUnionFind buf(uf);\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasfinid;\n\t\t\t\tint to = (it)->second.fstfinid;\n\n\t\t\t\tif (sps[from] > sps[to]) {\n\t\t\t\t\tauf.unionSet(from, to, times[from][M] - times[to][M]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasstaid;\n\t\t\t\tint to = (it)->second.fststaid;\n\t\t\t\tbuf.unionSet(from, to, 1);\n\t\t\t\t\n\t\t\t}\n\n\t\t\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\n\t\t\t\tuf = buf;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf = auf;\n\t\t\t}*/\n\t\t}\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\n\t}\n\tlong long int amax = 0;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\n\t}\n\treturn amax;\n}\n\nint main() {\n\t\n\t\n\tlong long int dist;\n\tcin >> dist;\n\n\tcin >> HorseNum;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tint S; cin >> S;\n\t\tsps.push_back(S);\n\t}\n\tcin >> M;\n\tvector<long long int>ds;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint D; cin >> D;\n\t\tds.push_back(D);\n\t}\n\tsort(ds.begin(), ds.end());\n\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\ttimes[i][j] = sps[i] * ds[j];\n\t\t}\n\t\ttimes[i][M] = sps[i] * dist;\n\t}\n\tlong long int ans = My_LInf;\n\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\n\t\tbitset<20>bs(i);\n\t\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\n\t\tbool ok = true;\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 1; ++k) {\n\t\t\t\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 2; ++k) {\n\t\t\t\tif (changes[j][k] && changes[j][k + 1]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok)continue;\n\t\tlong long int a = check(changes, times);\n\t\tans = min(ans,a);\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.46153846153846156,"time_ms":330,"memory_kb":3180,"score_of_the_acc":-0.2362,"final_rank":17},{"submission_id":"aoj_2427_1654608","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#pragma warning(disable:4996)\nusing namespace std;\n\nconst long long int My_LInf=9223372036854775807;\n\n\nstruct aUnionFind {\n\tvector<pair<int, long long int>> data;\n\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\n\n\t//y is w bigger than x\n\tbool unionSet(const int x, const int y, const long long int w) {\n\t\tconst int rx(root(x).first), ry(root(y).first);\n\t\tif (rx != ry) {\n\t\t\tdata[rx].first += data[ry].first; data[ry].first = rx;\n\t\t\tdata[ry].second = w + data[x].second - data[y].second;\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn root(x).second + w == root(y).second;\n\t\t}\n\t}\n\tbool findSet(const int x, const int y) {\n\t\treturn root(x) == root(y);\n\t}\n\n\t//x is belong to first\n\t//x is second bigger than first\n\tpair<int, long long int> root(const int x) {\n\t\tif (data[x].first < 0) {\n\t\t\treturn make_pair(x, 0);\n\t\t}\n\t\telse {\n\t\t\tpair<int, long long int>ndata;\n\t\t\tndata.first = root(data[x].first).first;\n\t\t\tndata.second = data[x].second + root(data[x].first).second;\n\t\t\treturn data[x] = ndata;\n\t\t}\n\t}\n\tint size(const int x) {\n\t\treturn -data[root(x).first].first;\n\t}\n};\n\n\nint HorseNum, M;\n\nvector<long long int>sps;\n\nstruct aa {\n\tint fstfinid;\n\tlong long int fstfintime;\n\tint lasfinid;\n\tlong long int lasfintime;\n\tint fststaid;\n\tlong long int fststatime;\n\tint lasstaid;\n\tlong long int lasstatime;\n};\n\n\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\n\tvector<int>seq(HorseNum);\n\tiota(seq.begin(), seq.end(), 0);\n\taUnionFind uf(HorseNum);\n\tfor (int wide = 0; wide < M; ++wide) {\n\t\tfor (int change = 0; change < HorseNum - 1; ++change) {\n\t\t\tif (changes[wide][change]) {\n\t\t\t\tconst int c0 = seq[change];\n\t\t\t\tconst int c1 = seq[change + 1];\n\t\t\t\tconst long long int sa = times[c0][wide] - times[c1][wide];\n\t\t\t\tif (sa > 0) {\n\t\t\t\t\tif (!uf.unionSet(c0, c1, sa)) {\n\t\t\t\t\t\treturn My_LInf;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn My_LInf;\n\t\t\t\t}\n\t\t\t\tswap(seq[change], seq[change + 1]);\n\t\t\t}\n\t\t}\n\t}\n\tmap<int, aa>mp;\n\tfor (int i = 0; i < HorseNum; ++i) {\n\t\tif (!mp.count(uf.root(i).first)) {\n\t\t\tmp[uf.root(i).first] = aa{\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,uf.root(i).second + times[i][M],\n\t\t\ti,0,\n\t\t\ti,0,\n\t\t\t};\n\t\t}\n\t\telse {\n\t\t\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].fstfinid = i;\n\t\t\t\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\n\t\t\t\tmp[uf.root(i).first].lasfinid = i;\n\t\t\t\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\n\t\t\t}\n\t\t\tmp[uf.root(i).first].lasstaid = i;\n\t\t\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\n\t\t}\n\t}\n\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\n\t\tif (it != mp.begin()) {\n\t\t\taa afrom(prev(it)->second);\n\t\t\taa ato(it->second);\n\n\t\t\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\n\t\t\t\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\n\t\t\t}\n\t\t\t/*aUnionFind auf(uf);\n\t\t\taUnionFind buf(uf);\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasfinid;\n\t\t\t\tint to = (it)->second.fstfinid;\n\n\t\t\t\tif (sps[from] > sps[to]) {\n\t\t\t\t\tauf.unionSet(from, to, times[from][M] - times[to][M]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t{\n\t\t\t\tint from = (prev(it))->second.lasstaid;\n\t\t\t\tint to = (it)->second.fststaid;\n\t\t\t\tbuf.unionSet(from, to, 1);\n\t\t\t\t\n\t\t\t}\n\n\t\t\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\n\t\t\t\tuf = buf;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuf = auf;\n\t\t\t}*/\n\t\t}\n\t}\n\tfor (int i = 0; i < HorseNum - 1; ++i) {\n\t\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\n\t}\n\tlong long int amax = 0;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\n\t}\n\treturn amax;\n}\n\nint main() {\n\t\n\t\n\tlong long int dist;\n\tcin >> dist;\n\n\tcin >> HorseNum;\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tint S; cin >> S;\n\t\tsps.push_back(S);\n\t}\n\tcin >> M;\n\tvector<long long int>ds;\n\tfor (int i = 0; i < M; ++i) {\n\t\tint D; cin >> D;\n\t\tds.push_back(D);\n\t}\n\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\n\tfor (int i = 0; i <HorseNum; ++i) {\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\ttimes[i][j] = sps[i] * ds[j];\n\t\t}\n\t\ttimes[i][M] = sps[i] * dist;\n\t}\n\tlong long int ans = My_LInf;\n\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\n\t\tbitset<20>bs(i);\n\t\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\n\t\tbool ok = true;\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 1; ++k) {\n\t\t\t\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < M; ++j) {\n\t\t\tfor (int k = 0; k < HorseNum - 2; ++k) {\n\t\t\t\tif (changes[j][k] && changes[j][k + 1]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!ok)continue;\n\t\tlong long int a = check(changes, times);\n\t\tans = min(ans,a);\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.46153846153846156,"time_ms":320,"memory_kb":3180,"score_of_the_acc":-0.2324,"final_rank":16},{"submission_id":"aoj_2427_1550555","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nlong long p[10];\nlong long q[10];\nstruct wolf{\n\tint p[5];\n\twolf(){}\n};\nwolf now[6];\nint N,M;\nint rev[10][10];\nint perm[10][10];\nlong long INF=9999999999999999LL;\nlong long t[10][10];\nlong long dfs(int a){\n\tif(a==M){\n\t\tfor(int i=0;i<=M+1;i++){\n\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\tt[i][j]=j+p[j]*q[i];\n\t\t\t}\n\t\t}\n\t\tint cnt=0;\n\t\twhile(1){\n\t\t\tbool chg=false;\n\t\t\tfor(int i=0;i<=M;i++){\n\t\t\t\tfor(int j=0;j<N;j++){\n\t\t\t\t\tfor(int k=j+1;k<N;k++){\n\t\t\t\t\t\tif(t[i][now[i].p[j]]+p[now[i].p[j]]*(q[i+1]-q[i])>t[i][now[i].p[k]]+p[now[i].p[k]]*(q[i+1]-q[i])){\n\t\t\t\t\t\t\tchg=true;\n\t\t\t\t\t\t\tt[i][now[i].p[k]]=t[i][now[i].p[j]]+p[now[i].p[j]]*(q[i+1]-q[i])-p[now[i].p[k]]*(q[i+1]-q[i]);\n\t\t\t\t\t\t\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[k]]+p[now[i].p[k]]*(q[l]-q[i]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(t[i][now[i].p[j]]>t[i][now[i].p[k]]){\n\t\t\t\t\t\t\tchg=true;\n\t\t\t\t\t\t\tt[i][now[i].p[k]]=t[i][now[i].p[j]];\n\t\t\t\t\t\t\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[k]]+p[now[i].p[k]]*(q[l]-q[i]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(i==0&&t[i][now[i].p[j]]>=t[i][now[i].p[k]]){\n\t\t\t\t\t\t\tchg=true;\n\t\t\t\t\t\t\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[j]]+1+p[now[i].p[k]]*(q[l]-q[i]);\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\tcnt++;\n\t\t\tif(cnt==200)return INF;\n\t\t\t//long long tmp=0;\n\t\t\t//for(int i=0;i<N;i++)tmp=max(tmp,t[M+1][i]);\n\t\t\t//printf(\"%lld\\n\",tmp);\n\t\t\tif(!chg)break;\n\t\t}\n\t\tlong long ret=0;\n\t\tfor(int i=0;i<N;i++)ret=max(ret,t[M+1][i]);\n\t\t/*if(ret==382){\n\t\t\tfor(int i=0;i<=M;i++){\n\t\t\t\tfor(int j=0;j<N;j++)printf(\"%d \",now[i].p[j]);\n\t\t\t\tprintf(\"\\n\");\n\t\t\t}\n\t\t\tfor(int i=0;i<=M+1;i++){\n\t\t\t\tfor(int j=0;j<N;j++)printf(\"%lld \",t[i][j]);\n\t\t\t\tprintf(\"\\n\");\n\t\t\t}\n\t\t}*/\n\t\treturn ret;\n\t}\n\tlong long ret=INF;\n\tfor(int i=0;i<N;i++){\n\t\tperm[a][i]=i;\n\t\trev[a][now[a].p[i]]=i;\n\t}\n\tdo{\n\t\tbool ok=true;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tif(rev[a][perm[a][i]]>i+1)ok=false;\n\t\t\tif(rev[a][perm[a][i]]<i-1)ok=false;\n\t\t\tfor(int j=i+1;j<N;j++){\n\t\t\t\tif(rev[a][perm[a][i]]>rev[a][perm[a][j]]&&p[perm[a][i]]>=p[perm[a][j]])ok=false;\n\t\t\t}\n\t\t}\n\t\tif(ok){\n\t\t\tfor(int i=0;i<N;i++)now[a+1].p[i]=perm[a][i];\n\t\t\tret=min(ret,dfs(a+1));\n\t\t}\n\t}while(next_permutation(perm[a],perm[a]+N));\n\treturn ret;\n}\nint main(){\n\tint a,b,c;\n\tscanf(\"%d%d\",&a,&b);\n\tfor(int i=0;i<b;i++)scanf(\"%lld\",p+i);\n\tscanf(\"%d\",&c);\n\tN=b;M=c;\n\tfor(int i=0;i<c;i++)scanf(\"%lld\",q+i+1);\n\tstd::sort(q,q+c+1);\n\tq[c+1]=a;\n\tfor(int i=0;i<b;i++){\n\t\tnow[0].p[i]=i;\n\t}\n\tprintf(\"%lld\\n\",dfs(0));\n}","accuracy":1,"time_ms":10,"memory_kb":1032,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2427_1335780","code_snippet":"/*\n ?????????????????¨??????\n*/\n\n#define __1__\n\n#ifdef __1__\n#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#define rep(i,n) for(int i = 0;i < (n);i++)\n#define _MAX 7\n#define INF 7e10\n#define MIN(a,b) (a)>(b)?(b):(a)\nusing namespace std;\ntypedef long long int lint;\n\n\nint dist,n,m;\nlint tm[_MAX][_MAX+2]; //tm[][0]?????????????????????,tm[][m+1]???????????´??????\nlint S[_MAX];\nlint D[_MAX];\n\nlint rettm(){\n lint ans = 0;\n rep(i,n){\n ans = max(ans,tm[i][m+1]);\n }\n return ans;\n}\n\nvoid maketm(int x){\n rep(i,m){\n tm[x][i+1]=tm[x][0]+D[i]*S[x];\n }\n tm[x][m+1]=tm[x][0]+S[x]*dist;\n return;\n}\n\nvoid show(){\n rep(i,n){\n rep(j,m+2){\n printf(\"%4lld \",tm[i][j]);\n }\n cout << endl;\n }\n cout << endl;\n return;\n}\n\nint flag[5]={0};\n\nbool check(){\n rep(i,n-1){\n if(tm[i][0]>=tm[i+1][0]){\n return false;\n }\n }\n rep(i,n){\n rep(j,n){\n if(i<j&&tm[i][m+1]>tm[j][m+1]){\n bool hoge = 0;\n rep(k,m){\n if(tm[i][k+1]==tm[j][k+1]){\n rep(l,n){\n if(l!=i&&l!=j&&tm[i][k+1]==tm[l][k+1])\n return false;\n }\n hoge = true;\n }\n }\n if(hoge == 0)\n return false;\n }\n }\n }\n return true;\n}\n\nlint dfs(int d){\n lint ans = INF;\n if(d==n){\n if(check()){\n// show();\n return rettm();\n }else{\n return 7e10;\n }\n }\n rep(i,n){\n if(flag[i]==1)\n continue;\n flag[i]=1;\n if(i==0){\n tm[i][0]=0;\n maketm(i);\n ans = min(dfs(d+1),ans);\n }else if(flag[i-1]==1){\n tm[i][0]=tm[i-1][0]+1;\n maketm(i);\n ans = min(dfs(d+1),ans);\n }\n rep(j,n){\n if(j==i||flag[j]==0)\n continue;\n rep(k,m){\n tm[i][0]=tm[j][k+1]-D[k]*S[i];\n maketm(i);\n ans = min(dfs(d+1),ans);\n }\n tm[i][0]=tm[j][m+1]-dist*S[i];\n maketm(i);\n ans = min(dfs(d+1),ans);\n }\n flag[i]=0;\n }\n return ans;\n}\n \nint main() {\n cin >> dist >> n;\n rep(i,n){\n cin >> S[i];\n }\n cin >> m;\n rep(i,m){\n cin >> D[i];\n }\n cout << dfs(0) << endl;\n return 0;\n}\n#endif","accuracy":1,"time_ms":10,"memory_kb":1172,"score_of_the_acc":-0.0074,"final_rank":2},{"submission_id":"aoj_2427_566558","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <bitset>\nusing namespace std;\n\ntypedef long long LL;\n\nLL dist, ans = (LL)1e18;\nint n, m;\nvector<int> S, intr;\nvector<LL> D;\n\nvector<int> ptn;\n\nvoid enumpattern(int a, int i){\n\tif(i >= n - 1){\n\t\tptn.push_back(a);\n\t}\n\telse{\n\t\tenumpattern(a, i + 1);\n\t\tenumpattern(a | 1 << i, i + 2);\n\t}\n}\n\n\nvoid calcans(){\n\tvector<LL> stm(n + 1, -1LL);\n\tLL lst0 = -1, lft0 = 0;\t// last start/finish time\n\n\tvector<vector<int> > odr(m + 1, vector<int>(n));\n\tfor(int i = 0; i < n; ++i){\n\t\todr[0][i] = i;\n\t}\n\t\n\tint cnt = 0;\n\tfor(int j = 0; j < m; ++j){\n\t\todr[j + 1] = odr[j];\n\t\tfor(int i = 0; i < n; ++i){\n\t\t\tif(intr[j] >> i & 1){\n\t\t\t\t++cnt;\n\t\t\t\tint a = odr[j][i], b = odr[j][i + 1];\n\t\t\t\tif(a > b || S[a] <= S[b]){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tswap(odr[j + 1][i], odr[j + 1][i + 1]);\n\t\t\t\t++i;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < n; ++i){\n\t\tif(stm[i] != -1LL) continue;\n\n\t\tstm[i] = 0;\n\t\tbool updated = true;\n\t\twhile(updated){\n\t\t\tupdated = false;\n\n\t\t\tfor(int j = 0; j < m; ++j){\n\t\t\t\tfor(int k = i; k < n; ++k){\n\t\t\t\t\tif((intr[j] >> k & 1) == 0){\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tint a = odr[j][k], b = odr[j][k+1];\n\t\t\t\t\tif(stm[a] == -1LL && stm[b] != -1LL){\n\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\tstm[a] = stm[b] + D[j] * (S[b] - S[a]);\n\t\t\t\t\t}\n\t\t\t\t\telse if(stm[a] != -1LL && stm[b] == -1LL){\n\t\t\t\t\t\tupdated = true;\n\t\t\t\t\t\tstm[b] = stm[a] + D[j] * (S[a] - S[b]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor(int j = i; stm[j] != -1LL; ++j)\n\t\tfor(int k = j + 1; stm[k] != -1LL; ++k){\n\t\t\tif(S[j] <= S[k]){ continue; }\n\t\t\tLL ip = (stm[k] - stm[j]) / (S[j] - S[k]);\n\t\t\tif(ip < 0 || ip >= dist){ continue; }\n\t\t\tif((stm[k] - stm[j]) % (S[j] - S[k]) != 0){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tint x = find(D.begin(), D.end(), ip) - D.begin();\n\t\t\tif(x >= m) return;\n\t\t\tint y = find(odr[x].begin(), odr[x].end(), j) - odr[x].begin();\n\t\t\tif(y >= n - 1 || odr[x][y+1] != k ||\n\t\t\t odr[x+1][y] != k || odr[x+1][y+1] != j){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t--cnt;\n\t\t}\n\t\t\n\t\tint u = find(stm.begin(), stm.end(), -1LL) - stm.begin() - 1;\t//[i,u]\n\t\tint farv = odr[m][i], larv = odr[m][u];\t//first/last arrival\n\t\tLL lst1 = stm[u];\n\t\tLL fft1 = S[farv] * dist + stm[farv];\n\t\tLL lft1 = S[larv] * dist + stm[larv];\n\n\t\tfor(int j = i; j < u; ++j){\n\t\t\tif(stm[j] >= stm[j + 1]){ return; }\n\t\t}\n\n\t\tLL offset;\n\t\tif(lst0 + fft1 + 1 >= lft0){\t//start as early as possible\n\t\t\toffset = lst0 + 1;\n\t\t}\n\t\telse{\n\t\t\toffset = lft0 - fft1;\n\t\t}\n\t\tlst0 = offset + lst1;\n\t\tlft0 = offset + lft1;\n\n\t\ti = u;\n\t}\n\tif(cnt != 0) return;\n\n\tans = min(ans, lft0);\n}\n\nvoid solve(int i){\n\tif(i == m){\n\t\tcalcans();\n\t}\n\telse{\n\t\tfor(int j = 0; j < ptn.size(); ++j){\n\t\t\tintr[i] = ptn[j];\n\t\t\tsolve(i + 1);\n\t\t}\n\t}\n}\n\n\nint main(){\n\tcin >> dist >> n;\n\tS.resize(n);\n\n\tfor(int i = 0; i < n; ++i){\n\t\tcin >> S[i];\n\t}\n\tcin >> m;\n\tD.resize(m);\n\tintr.resize(m);\n\tfor(int i = 0; i < m; ++i){\n\t\tcin >> D[i];\n\t}\n\tsort(D.begin(), D.end());\n\n\tenumpattern(0, 0);\n\n\tsolve(0);\n\n\tcout << ans << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":1228,"score_of_the_acc":-0.0104,"final_rank":4},{"submission_id":"aoj_2427_491758","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <cstdlib>\n#include <vector>\n#include <map>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i< (int)(n); i++)\n#define all(c) (c).begin(), (c).end()\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\nconst ll INF = (ll)1e12;\n\nll dist, n, m;\nll S[10], D[10], T[10];\n\nbool check(int N, int *p){\n //出発順が守られているか\n vector<P> v;\n rep(i, N + 1) v.push_back(P(p[i], T[i]));\n sort(v.begin(), v.end());\n rep(i, v.size() - 1) if(v[i+1].second <= v[i].second) return false;\n \n //少し広いところを同時に3つ以上の馬車が通るか\n rep(i, m){\n map<int, int> mp;\n rep(j, N + 1) if(++mp[T[j] + D[i] * S[p[j]]] > 2) return false;\n }\n //狭いところですれ違うか\n rep(i, N + 1)rep(j, N){\n bool f = false;\n rep(k, m) if(T[i] + S[p[i]] * D[k] == T[j] + S[p[j]] * D[k]) f = true;\n if(f) continue;\n if((T[i] - T[j]) * (T[i] - T[j] + (S[p[i]] - S[p[j]]) * dist) < 0) return false; \n }\n \n return true;\n}\n\nll dfs(int N, int *p){\n ll res = INF;\n if(N == n){\n res = -INF;\n rep(i, n) res = max(res, T[i] + S[p[i]] * dist);\n //cout << res << \" \"<< *min_element(T, T + n) << endl;\n return res - *min_element(T, T + n);\n }\n\n //どの馬車ともすれ違わない場合と\n ll lb = -INF;\n ll ub = INF;\n rep(i, N){\n if(p[i] < p[N]){\n lb = max(lb, T[i] + 1);\n lb = max(lb, (T[i] + (S[p[i]] - S[p[N]]) * dist));\n }else{\n ub = min(ub, T[i] - 1);\n ub = min(ub, (T[i] + (S[p[i]] - S[p[N]]) * dist));\n }\n }\n if(lb <= ub){\n T[N] = lb == -INF ? ub : lb;\n res = min(res, dfs(N + 1, p));\n }\n \n //各少し広いところで各でどの馬車とすれ違うかで探索\n rep(i, m)rep(j, N){\n T[N] = T[j] + (S[p[j]] - S[p[N]]) * D[i];\n if(check(N, p)) res = min(res, dfs(N + 1, p));\n }\n return res;\n}\n\nint main(){\n ll res = INF;\n int p[10];\n cin >> dist >> n;\n rep(i, n) cin >> S[i];\n cin >> m;\n rep(i, m) cin >> D[i];\n rep(i, n) p[i] = i;\n do{\n T[0] = 0;\n res = min(res, dfs(1, p));\n }while(next_permutation(p, p + n));\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":1196,"score_of_the_acc":-0.0087,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2427_8309365\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nlong long Answer = (1LL << 62);\\nlong long Dist;\\nlong long N, S[19];\\nlong long M, D[19];\\nlong long Memo[19];\\nlong long NumOrder;\\nvector<pair<int, int>> Order[1009];\\n\\nvoid InitDFS(int dep, vector<int> cur, vector<pair<int, int>> rec) {\\n\\tif (dep == N - 1) {\\n\\t\\tOrder[NumOrder] = rec;\\n\\t\\tNumOrder += 1;\\n\\t\\treturn;\\n\\t}\\n\\tfor (int i = 0; i < cur.size(); i++) {\\n\\t\\tfor (int j = 0; j < cur.size(); j++) {\\n\\t\\t\\tif (cur[i] == 0 || cur[j] == 1) continue;\\n\\t\\t\\tvector<int> nex = cur;\\n\\t\\t\\tvector<pair<int, int>> nexrec = rec;\\n\\t\\t\\tnex[j] = 1;\\n\\t\\t\\tnexrec.push_back(make_pair(i, j));\\n\\t\\t\\tInitDFS(dep + 1, nex, nexrec);\\n\\t\\t}\\n\\t}\\n}\\n\\nbool hantei(vector<long long> Start) {\\n\\tfor (int i = 0; i < N - 1; i++) {\\n\\t\\tif (Start[i] >= Start[i + 1]) return false;\\n\\t}\\n\\tvector<vector<int>> Count(M, vector<int>{});\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = i + 1; j < N; j++) {\\n\\t\\t\\tif (Start[j] - Start[i] >= Dist * (S[i] - S[j])) continue;\\n\\t\\t\\tif ((Start[j] - Start[i]) % (S[i] - S[j]) != 0) return false;\\n\\t\\t\\tlong long place = (Start[j] - Start[i]) / (S[i] - S[j]);\\n\\t\\t\\tlong long flag = -1;\\n\\t\\t\\tfor (int k = 0; k < M; k++) {\\n\\t\\t\\t\\tif (place == D[k]) flag = k;\\n\\t\\t\\t}\\n\\t\\t\\tif (flag == -1) return false;\\n\\t\\t\\tCount[flag].push_back(Start[i] + S[i] * place);\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tfor (int j = 0; j < Count[i].size(); j++) {\\n\\t\\t\\tfor (int k = j + 1; k < Count[i].size(); k++) {\\n\\t\\t\\t\\tif (Count[i][j] == Count[i][k]) return false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid dfs(int dep, vector<long long> cur, vector<pair<int, int>> goal) {\\n\\tif (dep == goal.size()) {\\n\\t\\tif (hantei(cur) == false) return;\\n\\t\\tlong long score = 0;\\n\\t\\tfor (int i = 0; i < N; i++) score = max(score, cur[i] + Dist * S[i]);\\n\\t\\tAnswer = min(Answer, score);\\n\\t\\treturn;\\n\\t}\\n\\n\\t// Recursion\\n\\tint idx1 = goal[dep].first;\\n\\tint idx2 = goal[dep].second;\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tvector<long long> cur2 = cur;\\n\\t\\tif (i != M && idx1 < idx2 && S[idx1] <= S[idx2]) continue;\\n\\t\\tif (i != M && idx1 > idx2 && S[idx1] >= S[idx2]) continue;\\n\\t\\tif (i != M && idx1 < idx2) cur2[idx2] = cur[idx1] + D[i] * (S[idx1] - S[idx2]);\\n\\t\\tif (i != M && idx1 > idx2) cur2[idx2] = cur[idx1] - D[i] * (S[idx2] - S[idx1]);\\n\\t\\tif (i == M && idx1 < idx2) cur2[idx2] = cur[idx1] + max(1LL, Dist * (S[idx1] - S[idx2]));\\n\\t\\tif (i == M && idx1 > idx2) cur2[idx2] = cur[idx1] - max(1LL, Dist * (S[idx2] - S[idx1]));\\n\\t\\tdfs(dep + 1, cur2, goal);\\n\\t}\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> Dist;\\n\\tcin >> N;\\n\\tfor (int i = 0; i < N; i++) cin >> S[i];\\n\\tcin >> M;\\n\\tfor (int i = 0; i < M; i++) cin >> D[i];\\n\\tsort(D, D + M);\\n\\n\\t// Step 2. Init\\n\\tvector<int> InitVec = vector<int>(N, 0);\\n\\tInitVec[0] = 1;\\n\\tInitDFS(0, InitVec, vector<pair<int, int>>{});\\n\\n\\t// Step 3. Brute Force\\n\\tfor (int i = 0; i < NumOrder; i++) {\\n\\t\\tdfs(0, vector<long long>(N, 0), Order[i]);\\n\\t}\\n\\n\\t// Step 4. Output\\n\\tcout << Answer << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.13,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2427_7182516\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// clang-format off\\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\\nusing ll = long long;\\n// 2^60\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\nusing Graph = vector<vector<int>>;\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \\\"[\\\" << i << \\\"]\\\" << endl; s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \\\",\\\";}} s << endl; return s;}\\n// clang-format on\\n\\n// ポテンシャル付きUnionFind\\nstruct UnionFind {\\n vector<int> par, siz;\\n vector<ll> diff_weight;\\n\\n UnionFind(int n) : par(n, -1), siz(n, 1), diff_weight(n) {\\n }\\n\\n // 根を求める\\n int root(int x) {\\n if (par[x] == -1) {\\n return x;\\n } else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n // weight(y) - weight(x) = w となるように merge する\\n bool merge(int x, int y, ll w) {\\n // x と y それぞれについて、 root との重み差分を補正\\n w += weight(x);\\n w -= weight(y);\\n\\n x = root(x), y = root(y);\\n if (x == y)\\n return false;\\n if (siz[x] < siz[y]) {\\n swap(x, y);\\n w = -w;\\n }\\n par[y] = x;\\n siz[x] += siz[y];\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n ll weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n ll diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n\\n // グループを返却する\\n vector<vector<int>> groups() {\\n vector<vector<int>> g(par.size());\\n for (int i = 0; i < par.size(); ++i) {\\n g[root(i)].push_back(i);\\n }\\n auto result = std::remove_if(g.begin(), g.end(), [](auto &x) { return x.empty(); });\\n g.erase(result, g.end());\\n return g;\\n }\\n\\n // x を含むグループのサイズ\\n int size(int x) {\\n return siz[root(x)];\\n }\\n};\\n\\nint main(void) {\\n ll dist;\\n int n;\\n cin >> dist >> n;\\n vector<int> S(n);\\n rep(i, 0, n) {\\n cin >> S[i];\\n }\\n int m;\\n cin >> m;\\n vector<ll> D(m);\\n rep(i, 0, m) {\\n cin >> D[i];\\n }\\n\\n ll ans = 1e18;\\n auto check = [&](vector<ll> &T) {\\n /*\\n cout << \\\"-------\\\" << endl;\\n cout << T;\\n cout << \\\"-------\\\" << endl;\\n */\\n\\n UnionFind uf(n);\\n int cur = -1;\\n rep(i, 0, n) {\\n rep(j, i + 1, n) {\\n ++cur;\\n if (T[cur] == -1)\\n continue;\\n if (uf.issame(i, j)) {\\n if (uf.diff(i, j) != T[cur]) {\\n return;\\n }\\n } else {\\n uf.merge(i, j, T[cur]);\\n }\\n }\\n }\\n\\n vector<map<ll, int>> count(m);\\n rep(i, 0, n) {\\n rep(j, i + 1, n) {\\n if (not uf.issame(i, j)) {\\n return;\\n }\\n ll diff = uf.diff(i, j);\\n if (diff < 1) {\\n return;\\n }\\n ll ig = dist * S[i];\\n ll jg = diff + dist * S[j];\\n if (jg < ig) {\\n bool ok = false;\\n\\n rep(k, 0, m) {\\n ll it = uf.diff(0, i) + D[k] * S[i];\\n ll jt = uf.diff(0, j) + D[k] * S[j];\\n if (jt == it) {\\n ok = true;\\n count[k][it] += 1;\\n }\\n }\\n if (not ok) {\\n return;\\n }\\n }\\n }\\n }\\n\\n rep(i, 0, m) {\\n for (auto [t, cnt] : count[i]) {\\n if (cnt >= 3) {\\n return;\\n }\\n }\\n }\\n\\n ll need = 0;\\n rep(i, 0, n) {\\n ll diff = uf.diff(0, i);\\n chmax(need, diff + S[i] * dist);\\n }\\n\\n chmin(ans, need);\\n };\\n\\n auto rec = [&](auto &&f, int x, int y, vector<ll> &T) -> void {\\n if (x == n - 1) {\\n check(T);\\n return;\\n }\\n\\n int nx;\\n int ny;\\n\\n if (y == n - 1) {\\n nx = x + 1;\\n ny = nx + 1;\\n } else {\\n nx = x;\\n ny = y + 1;\\n }\\n\\n rep(i, 0, m) {\\n if (S[x] > S[y]) {\\n ll diff = D[i] * (S[x] - S[y]);\\n T.push_back(diff);\\n f(f, nx, ny, T);\\n T.pop_back();\\n }\\n }\\n\\n if (S[y] < S[x]) {\\n ll diff = dist * (S[x] - S[y]);\\n T.push_back(diff);\\n f(f, nx, ny, T);\\n T.pop_back();\\n }\\n\\n T.push_back(1);\\n f(f, nx, ny, T);\\n T.pop_back();\\n\\n T.push_back(-1);\\n f(f, nx, ny, T);\\n T.pop_back();\\n };\\n vector<ll> t;\\n rec(rec, 0, 1, t);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.1555,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2427_7182510\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// clang-format off\\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\\nusing ll = long long;\\n// 2^60\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\nusing Graph = vector<vector<int>>;\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \\\"[\\\" << i << \\\"]\\\" << endl; s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \\\",\\\";}} s << endl; return s;}\\n// clang-format on\\n\\n// ポテンシャル付きUnionFind\\nstruct UnionFind {\\n vector<int> par, siz;\\n vector<int> diff_weight;\\n\\n UnionFind(int n) : par(n, -1), siz(n, 1), diff_weight(n) {\\n }\\n\\n // 根を求める\\n int root(int x) {\\n if (par[x] == -1) {\\n return x;\\n } else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n // weight(y) - weight(x) = w となるように merge する\\n bool merge(int x, int y, int w) {\\n // x と y それぞれについて、 root との重み差分を補正\\n w += weight(x);\\n w -= weight(y);\\n\\n x = root(x), y = root(y);\\n if (x == y)\\n return false;\\n if (siz[x] < siz[y]) {\\n swap(x, y);\\n w = -w;\\n }\\n par[y] = x;\\n siz[x] += siz[y];\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n int weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n int diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n\\n // グループを返却する\\n vector<vector<int>> groups() {\\n vector<vector<int>> g(par.size());\\n for (int i = 0; i < par.size(); ++i) {\\n g[root(i)].push_back(i);\\n }\\n auto result = std::remove_if(g.begin(), g.end(), [](auto &x) { return x.empty(); });\\n g.erase(result, g.end());\\n return g;\\n }\\n\\n // x を含むグループのサイズ\\n int size(int x) {\\n return siz[root(x)];\\n }\\n};\\n\\nint main(void) {\\n ll dist;\\n int n;\\n cin >> dist >> n;\\n vector<int> S(n);\\n rep(i, 0, n) {\\n cin >> S[i];\\n }\\n int m;\\n cin >> m;\\n vector<ll> D(m);\\n rep(i, 0, m) {\\n cin >> D[i];\\n }\\n\\n ll ans = 1e18;\\n auto check = [&](vector<ll> &T) {\\n /*\\n cout << \\\"-------\\\" << endl;\\n cout << T;\\n cout << \\\"-------\\\" << endl;\\n */\\n\\n UnionFind uf(n);\\n int cur = -1;\\n rep(i, 0, n) {\\n rep(j, i + 1, n) {\\n ++cur;\\n if (T[cur] == -1)\\n continue;\\n if (uf.issame(i, j)) {\\n if (uf.diff(i, j) != T[cur]) {\\n return;\\n }\\n } else {\\n uf.merge(i, j, T[cur]);\\n }\\n }\\n }\\n\\n vector<map<ll, int>> count(m);\\n rep(i, 0, n) {\\n rep(j, i + 1, n) {\\n if (not uf.issame(i, j)) {\\n return;\\n }\\n ll diff = uf.diff(i, j);\\n if (diff < 1) {\\n return;\\n }\\n ll ig = dist * S[i];\\n ll jg = diff + dist * S[j];\\n if (jg < ig) {\\n bool ok = false;\\n\\n rep(k, 0, m) {\\n ll it = uf.diff(0, i) + D[k] * S[i];\\n ll jt = uf.diff(0, j) + D[k] * S[j];\\n if (jt == it) {\\n ok = true;\\n count[k][it] += 1;\\n }\\n }\\n if (not ok) {\\n return;\\n }\\n }\\n }\\n }\\n\\n rep(i, 0, m) {\\n for (auto [t, cnt] : count[i]) {\\n if (cnt >= 3) {\\n return;\\n }\\n }\\n }\\n\\n ll need = 0;\\n rep(i, 0, n) {\\n ll diff = uf.diff(0, i);\\n chmax(need, diff + S[i] * dist);\\n }\\n\\n chmin(ans, need);\\n };\\n\\n auto rec = [&](auto &&f, int x, int y, vector<ll> &T) -> void {\\n if (x == n - 1) {\\n check(T);\\n return;\\n }\\n\\n int nx;\\n int ny;\\n\\n if (y == n - 1) {\\n nx = x + 1;\\n ny = nx + 1;\\n } else {\\n nx = x;\\n ny = y + 1;\\n }\\n\\n rep(i, 0, m) {\\n if (S[x] > S[y]) {\\n ll diff = D[i] * (S[x] - S[y]);\\n T.push_back(diff);\\n f(f, nx, ny, T);\\n T.pop_back();\\n }\\n }\\n\\n if (S[y] < S[x]) {\\n ll diff = dist * (S[x] - S[y]);\\n T.push_back(diff);\\n f(f, nx, ny, T);\\n T.pop_back();\\n }\\n\\n T.push_back(1);\\n f(f, nx, ny, T);\\n T.pop_back();\\n\\n T.push_back(-1);\\n f(f, nx, ny, T);\\n T.pop_back();\\n };\\n vector<ll> t;\\n rec(rec, 0, 1, t);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.5384615384615384,\n \"time_ms\": 80,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.1555,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2427_7168642\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// clang-format off\\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\\nusing ll = long long;\\n// 2^60\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\nusing Graph = vector<vector<int>>;\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \\\"[\\\" << i << \\\"]\\\" << endl; s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \\\",\\\";}} s << endl; return s;}\\n// clang-format on\\n\\ntemplate <class Abel>\\nstruct UnionFind {\\n vector<int> par;\\n vector<int> rank;\\n vector<Abel> diff_weight;\\n\\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n init(n, SUM_UNITY);\\n }\\n\\n void init(int n = 1, Abel SUM_UNITY = 0) {\\n par.resize(n);\\n rank.resize(n);\\n diff_weight.resize(n);\\n for (int i = 0; i < n; ++i)\\n par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n }\\n\\n int root(int x) {\\n if (par[x] == x) {\\n return x;\\n } else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n Abel weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n bool merge(int x, int y, Abel w) {\\n w += weight(x);\\n w -= weight(y);\\n x = root(x);\\n y = root(y);\\n if (x == y)\\n return false;\\n if (rank[x] < rank[y])\\n swap(x, y), w = -w;\\n if (rank[x] == rank[y])\\n ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n Abel diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n};\\n\\ntypedef pair<int, int> pint;\\n\\nlong long dist;\\nint n, m;\\nlong long S[11], D[11];\\n\\nconst long long INF = 1LL << 60;\\nlong long res = INF; // 答えを更新していく\\n\\n// 各馬車が「どこですれ違うか」\\nvoid check(vector<long long> diffs) {\\n UnionFind<long long> uf(n);\\n int iter = 0;\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n long long diff = diffs[iter++];\\n if (diff == -1)\\n continue;\\n\\n if (uf.issame(i, j)) {\\n long long curdiff = uf.diff(i, j);\\n if (diff != curdiff)\\n return;\\n } else {\\n uf.merge(i, j, diff);\\n }\\n }\\n }\\n\\n // 暫定回を求める\\n ll ans = 0;\\n for (int i = 0; i < n; ++i) {\\n chmax(ans, uf.diff(0, i) + S[i] * dist);\\n }\\n\\n // 整合性を確認\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n if (!uf.issame(i, j))\\n return; // 繋がっていない箇所があったら明らかに最適でないので return\\n if (uf.diff(i, j) < 1)\\n return; // j が i の 1分後よりも早く出ていたらダメ\\n\\n // 追い越している場合はどこで追い越してるか\\n long long start_i = uf.diff(0, i);\\n long long goal_i = start_i + S[i] * dist;\\n long long start_j = uf.diff(0, j);\\n long long goal_j = start_j + S[j] * dist;\\n if (goal_j < goal_i) {\\n int pl = -1;\\n for (int k = 0; k < m; ++k) {\\n long long it = start_i + S[i] * D[k];\\n long long jt = start_j + S[j] * D[k];\\n if (it == jt) {\\n pl = k;\\n }\\n }\\n if (pl == -1)\\n return; // 「少し広いところ以外で交わったらダメ\\n }\\n }\\n }\\n\\n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\\n for (int i = 0; i < m; ++i) {\\n map<long long, int> ma;\\n for (int j = 0; j < n; ++j) {\\n long long t = uf.diff(0, j) + S[j] * D[i];\\n ma[t]++;\\n }\\n for (map<long long, int>::iterator it = ma.begin(); it != ma.end(); ++it) {\\n if (it->second >= 3)\\n return;\\n }\\n }\\n\\n // 確認を終えたら OK\\n if (res > ans)\\n res = ans;\\n}\\n\\nvoid dfs(vector<long long> diffs, int i, int j) {\\n if (i == n - 1) {\\n check(diffs);\\n return;\\n }\\n\\n // 馬車 i, j が何分でゴールするか\\n long long total_i = S[i] * dist;\\n long long total_j = S[j] * dist;\\n\\n // 次の index\\n int ni = i;\\n int nj = j + 1;\\n if (nj == n) {\\n ++ni;\\n nj = ni + 1;\\n }\\n\\n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\\n if (total_j >= total_i - 1) {\\n diffs.push_back(1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n\\n // ゴールでピッタリ\\n {\\n long long diff = total_i - total_j;\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n\\n // m 箇所それぞれ\\n if (S[i] != S[j]) {\\n for (int k = 0; k < m; ++k) {\\n long long diff = (S[i] - S[j]) * D[k];\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n }\\n\\n // それ以外\\n diffs.push_back(-1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n}\\n\\nint main() {\\n while (cin >> dist) {\\n cin >> n;\\n for (int i = 0; i < n; ++i)\\n cin >> S[i];\\n cin >> m;\\n for (int i = 0; i < m; ++i)\\n cin >> D[i];\\n\\n vector<long long> diffs;\\n dfs(diffs, 0, 1);\\n\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.1519,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2427_7168636\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// clang-format off\\n#define rep(i, s ,n) for(int i=s, i##_len=(n); i<i##_len; ++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; }\\nusing ll = long long;\\n// 2^60\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\nusing Graph = vector<vector<int>>;\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<vector<T>>> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << \\\"[\\\" << i << \\\"]\\\" << endl; s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<vector<T>> const &v) { for (int i = 0; i < int(v.size()); ++i ){ s << v[i];} return s;}\\ntemplate <typename T> ostream &operator<<(ostream &s, vector<T> const &v) { for (int i = 0; i < int(v.size()); ++i) { s << v[i]; if (i != int(v.size()) - 1) { s << \\\",\\\";}} s << endl; return s;}\\n// clang-format on\\n\\ntemplate <class Abel>\\nstruct UnionFind {\\n vector<int> par;\\n vector<int> rank;\\n vector<Abel> diff_weight;\\n\\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n init(n, SUM_UNITY);\\n }\\n\\n void init(int n = 1, Abel SUM_UNITY = 0) {\\n par.resize(n);\\n rank.resize(n);\\n diff_weight.resize(n);\\n for (int i = 0; i < n; ++i)\\n par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n }\\n\\n int root(int x) {\\n if (par[x] == x) {\\n return x;\\n } else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n\\n Abel weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n bool merge(int x, int y, Abel w) {\\n w += weight(x);\\n w -= weight(y);\\n x = root(x);\\n y = root(y);\\n if (x == y)\\n return false;\\n if (rank[x] < rank[y])\\n swap(x, y), w = -w;\\n if (rank[x] == rank[y])\\n ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n\\n Abel diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n};\\n\\ntypedef pair<int, int> pint;\\n\\nlong long dist;\\nint n, m;\\nlong long S[11], D[11];\\n\\nconst long long INF = 1LL << 60;\\nlong long res = INF; // 答えを更新していく\\n\\n// 各馬車が「どこですれ違うか」\\nvoid check(vector<long long> diffs) {\\n UnionFind<long long> uf(n);\\n int iter = 0;\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n long long diff = diffs[iter++];\\n if (diff == -1)\\n continue;\\n\\n if (uf.issame(i, j)) {\\n long long curdiff = uf.diff(i, j);\\n if (diff != curdiff)\\n return;\\n } else {\\n uf.merge(i, j, diff);\\n }\\n }\\n }\\n\\n // 暫定回を求める\\n long long start = 0, goal = 0;\\n for (int i = 0; i < n; ++i) {\\n long long start_i = start + uf.diff(0, i);\\n long long goal_i = start_i + S[i] * dist;\\n if (start > start_i)\\n start = start_i;\\n if (goal < goal_i)\\n goal = goal_i;\\n }\\n\\n // 整合性を確認\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n if (!uf.issame(i, j))\\n return; // 繋がっていない箇所があったら明らかに最適でないので return\\n if (uf.diff(i, j) < 1)\\n return; // j が i の 1分後よりも早く出ていたらダメ\\n\\n // 追い越している場合はどこで追い越してるか\\n long long start_i = uf.diff(0, i);\\n long long goal_i = start_i + S[i] * dist;\\n long long start_j = uf.diff(0, j);\\n long long goal_j = start_j + S[j] * dist;\\n if (goal_j < goal_i) {\\n int pl = -1;\\n for (int k = 0; k < m; ++k) {\\n long long it = start_i + S[i] * D[k];\\n long long jt = start_j + S[j] * D[k];\\n if (it == jt) {\\n pl = k;\\n }\\n }\\n if (pl == -1)\\n return; // 「少し広いところ以外で交わったらダメ\\n }\\n }\\n }\\n\\n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\\n for (int i = 0; i < m; ++i) {\\n map<long long, int> ma;\\n for (int j = 0; j < n; ++j) {\\n long long t = uf.diff(0, j) + S[j] * D[i];\\n ma[t]++;\\n }\\n for (map<long long, int>::iterator it = ma.begin(); it != ma.end(); ++it) {\\n if (it->second >= 3)\\n return;\\n }\\n }\\n\\n // 確認を終えたら OK\\n if (res > goal - start)\\n res = goal - start;\\n}\\n\\nvoid dfs(vector<long long> diffs, int i, int j) {\\n if (i == n - 1) {\\n check(diffs);\\n return;\\n }\\n\\n // 馬車 i, j が何分でゴールするか\\n long long total_i = S[i] * dist;\\n long long total_j = S[j] * dist;\\n\\n // 次の index\\n int ni = i;\\n int nj = j + 1;\\n if (nj == n) {\\n ++ni;\\n nj = ni + 1;\\n }\\n\\n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\\n if (total_j >= total_i - 1) {\\n diffs.push_back(1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n\\n // ゴールでピッタリ\\n {\\n long long diff = total_i - total_j;\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n\\n // m 箇所それぞれ\\n if (S[i] != S[j]) {\\n for (int k = 0; k < m; ++k) {\\n long long diff = (S[i] - S[j]) * D[k];\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n }\\n\\n // それ以外\\n diffs.push_back(-1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n}\\n\\nint main() {\\n while (cin >> dist) {\\n cin >> n;\\n for (int i = 0; i < n; ++i)\\n cin >> S[i];\\n cin >> m;\\n for (int i = 0; i < m; ++i)\\n cin >> D[i];\\n\\n vector<long long> diffs;\\n dfs(diffs, 0, 1);\\n\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.1525,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2427_6031139\",\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;\\nconst 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 << 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}\\nint gcd(int a, int b) {\\n\\tif (a < b)swap(a, b);\\n\\twhile (b) {\\n\\t\\tint r = a % b; a = b; b = r;\\n\\t}\\n\\treturn a;\\n}\\n\\nstruct ufundo {\\nprivate:\\n\\tvector<int> par, sz;\\n\\tvector<P> mem;\\n\\tvector<bool> united;\\npublic:\\n\\tufundo(int n) {\\n\\t\\tpar.resize(n, 0);\\n\\t\\tsz.resize(n, 1);\\n\\t\\trep(i, n) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\telse return find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y) {\\n\\t\\t\\tmem.push_back({ x,y });\\n\\t\\t\\tunited.push_back(false);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tunited.push_back(true);\\n\\t\\tif (sz[x] < sz[y]) {\\n\\t\\t\\tpar[x] = y; sz[y] += sz[x];\\n\\t\\t\\tmem.push_back({ x,y });\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x; sz[x] += sz[y];\\n\\t\\t\\tmem.push_back({ y,x });\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n\\tint getsize(int k) {\\n\\t\\treturn sz[k];\\n\\t}\\n\\tvoid undo() {\\n\\t\\tassert(mem.size());\\n\\t\\tP p = mem.back(); mem.pop_back();\\n\\t\\tbool b = united.back(); united.pop_back();\\n\\t\\tif (!b)return;\\n\\t\\tint x = p.first, y = p.second;\\n\\t\\tpar[x] = x;\\n\\t\\tsz[y] -= sz[x];\\n\\t}\\n};\\n\\n\\nstruct edge {\\n\\tint to; ll dif;\\n};\\nvoid solve() {\\n\\tll d; cin >> d;\\n\\tint n, m; cin >> n;\\n\\tvector <ll> s(n);\\n\\trep(i, n)cin >> s[i];\\n\\tcin >> m;\\n\\tvector<ll> x(m);\\n\\trep(j, m)cin >> x[j];\\n\\tll ans = INF;\\n\\tauto upd = [&](vector<ll> t) {\\n\\t\\trep(i, n - 1)if (t[i] + 1 > t[i + 1])return;\\n\\t\\tvector<set<ll>> cs(m);\\n\\t\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\t\\tif (s[i] > s[j]) {\\n\\t\\t\\t\\tll dif = t[j] - t[i];\\n\\t\\t\\t\\tll ds = s[i] - s[j];\\n\\t\\t\\t\\tif (dif < ds * d) {\\n\\t\\t\\t\\t\\tif (dif % ds)return;\\n\\t\\t\\t\\t\\tll loc = dif / ds;\\n\\t\\t\\t\\t\\tbool exi = false;\\n\\t\\t\\t\\t\\trep(k, m)if (x[k] == loc) {\\n\\t\\t\\t\\t\\t\\tll val = t[i] + s[i] * x[k];\\n\\t\\t\\t\\t\\t\\tif (cs[k].count(val))return;\\n\\t\\t\\t\\t\\t\\tcs[k].insert(val);\\n\\t\\t\\t\\t\\t\\texi = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (!exi)return;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tll ma = 0;\\n\\t\\trep(i, n) {\\n\\t\\t\\tll val = t[i] + s[i] * d;\\n\\t\\t\\tma = max(ma, val);\\n\\t\\t}\\n\\t\\tans = min(ans, ma);\\n\\t};\\n\\tvector<int> cur;\\n\\tvector<P> vp;\\n\\trep(i, n)Rep(j, i + 1, n)vp.push_back({ i,j });\\n\\t\\n\\tufundo u(n);\\n\\tfunction<void(int)> dfs = [&](int dep) {\\n\\t\\tif (dep == vp.size()) {\\n\\t\\t\\tvector<vector<edge>> G(n);\\n\\t\\t\\trep(i, vp.size()) {\\n\\t\\t\\t\\tif (cur[i] >= 0) {\\n\\t\\t\\t\\t\\tint a = vp[i].first;\\n\\t\\t\\t\\t\\tint b = vp[i].second;\\n\\t\\t\\t\\t\\tll z = s[a] * x[cur[i]] - s[b] * x[cur[i]];\\n\\t\\t\\t\\t\\tG[a].push_back({ b,z });\\n\\t\\t\\t\\t\\tG[b].push_back({ a,-z });\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvector<bool> used(n);\\n\\t\\t\\tvector<ll> t(n);\\n\\t\\t\\tvector<int> ss;\\n\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (used[i])continue;\\n\\t\\t\\t\\tss.push_back(i);\\n\\t\\t\\t\\t/*t[i] = 0;\\n\\t\\t\\t\\tif (i > 0) {\\n\\t\\t\\t\\t\\tt[i] = t[i - 1] + 1;\\n\\t\\t\\t\\t\\trep(j, i) {\\n\\t\\t\\t\\t\\t\\tll las = t[j]+s[j] * d - s[i] * d;\\n\\t\\t\\t\\t\\t\\tt[i] = max(t[i], las);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}*/\\n\\t\\t\\t\\tqueue<int> q;\\n\\t\\t\\t\\tq.push(i);\\n\\t\\t\\t\\tused[i] = true;\\n\\t\\t\\t\\tt[i] = 0;\\n\\t\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\t\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\t\\t\\t\\tif (!used[e.to]) {\\n\\t\\t\\t\\t\\t\\t\\tused[e.to] = true;\\n\\t\\t\\t\\t\\t\\t\\tt[e.to] = t[id] + e.dif;\\n\\t\\t\\t\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint r = i + 1;\\n\\t\\t\\t\\twhile (r < n && used[r])r++;\\n\\t\\t\\t}\\n\\t\\t\\trep(i, ss.size()) {\\n\\t\\t\\t\\tint l = ss[i];\\n\\t\\t\\t\\tint r = n; if (i + 1 < ss.size())r = ss[i + 1];\\n\\t\\t\\t\\t//[l,r)\\n\\t\\t\\t\\tif (l == 0)continue;\\n\\t\\t\\t\\tll ad2 = 0;\\n\\t\\t\\t\\tll clas = t[l] + s[l] * d;\\n\\t\\t\\t\\tRep(j, l, r) {\\n\\t\\t\\t\\t\\tll las = t[j] + s[j] * d;\\n\\t\\t\\t\\t\\tad2 = max(ad2, clas - las);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tll ad = t[l - 1]+1;\\n\\t\\t\\t\\trep(j, l) {\\n\\t\\t\\t\\t\\tll las = t[j] + s[j] * d+ad2 - s[l] * d;\\n\\t\\t\\t\\t\\tad = max(ad, las);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tRep(j, l, r)t[j] += ad;\\n\\t\\t\\t}\\n\\t\\t\\t//rep(i, ss.size())cout << ss[i] << \\\" \\\";\\n\\t\\t\\t//cout << \\\"\\\\n\\\";\\n\\t\\t\\tupd(t);\\n\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int i = -1; i < m; i++) {\\n\\t\\t\\t\\tif (i >= 0) {\\n\\t\\t\\t\\t\\tint a = vp[dep].first;\\n\\t\\t\\t\\t\\tint b = vp[dep].second;\\n\\t\\t\\t\\t\\tif (u.same(a, b))continue;\\n\\t\\t\\t\\t\\tcur.push_back(i);\\n\\t\\t\\t\\t\\tu.unite(a, b);\\n\\t\\t\\t\\t\\tdfs(dep + 1);\\n\\t\\t\\t\\t\\tcur.pop_back();\\n\\t\\t\\t\\t\\tu.undo();\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tcur.push_back(i);\\n\\t\\t\\t\\t\\tdfs(dep + 1);\\n\\t\\t\\t\\t\\tcur.pop_back();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\tdfs(0);\\n\\tcout << ans << \\\"\\\\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//int t; cin >> t; rep(i, t)\\n\\t//while (cin>>n>>m>>r,n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 19860,\n \"score_of_the_acc\": -1.0038,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2427_3221561\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<iostream>\\n#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<set>\\n#include<cstring>\\n#include<map>\\nusing namespace std;\\nconst int MAXN = (int) 105;\\nconst int INF = (int) 0x3f3f3f3f;\\ntypedef long long LL;\\n\\nint dist;\\nint M,N;\\nint S[MAXN];\\nint D[MAXN];\\nLL ans;\\nLL out_time[MAXN];\\nmap<LL,set<int> > mp;\\nstruct permutation{\\n int a[10];\\n}per;\\nint percnt;\\nvector<permutation> P;\\n\\nbool is_judge(){\\n mp.clear();\\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\\n for(int i=1;i<N;i++){\\n for(int j=i+1;j<=N;j++){\\n if(S[i]<=S[j]) continue;\\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\\n int ok=0;\\n for(int k=1;k<=M;k++){\\n if(D[k]==tmpD) ok=1;\\n }\\n if(!ok) return false;\\n if(mp.count(tmpD)){\\n if(mp[tmpD].count(i)) return false;\\n if(mp[tmpD].count(j)) return false;\\n }\\n mp[tmpD].insert(i);\\n mp[tmpD].insert(j);\\n }\\n }\\n return true;\\n}\\n\\nvoid update(){\\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\\n if(!is_judge()) return;\\n LL tmpans=0;\\n for(int i=1;i<=N;i++){\\n LL tmp=out_time[i]+(LL)dist*S[i];\\n tmpans=max(tmpans,tmp);\\n }\\n ans=min(ans,tmpans);\\n}\\n\\nint mark[MAXN];\\nvoid DFS1(int cur){\\n if(cur>N){\\n per.a[0]=1;\\n P.push_back(per);\\n return;\\n }\\n for(int i=1;i<=N;i++)if(!mark[i]){\\n per.a[++percnt]=i;\\n mark[i]=1;\\n DFS1(cur+1);\\n percnt--;\\n mark[i]=0;\\n }\\n}\\n\\nvoid DFS2(int curid,const permutation& now){\\n if(curid>N){\\n update();\\n return;\\n }\\n int cur=now.a[curid];\\n if(curid==1){\\n out_time[cur]=0;\\n DFS2(curid+1,now);\\n return;\\n }\\n\\n for(int t=1;t<curid;t++){\\n int pre=now.a[t];\\n if(cur<pre){\\n out_time[cur]=out_time[pre]-1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\\n // printf(\\\"%d-%d : %lld->%lld\\\\n\\\",pre,cur,out_time[pre],out_time[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n if(cur>pre){\\n out_time[cur]=out_time[pre]+1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n }\\n}\\n\\nvoid solve(){\\n for(int perid=0;perid<P.size();perid++){\\n DFS2(1,P[perid]);\\n }\\n}\\n\\nvoid work(){\\n scanf(\\\"%d%d\\\",&dist,&N);\\n for(int i=1;i<=N;i++) scanf(\\\"%d\\\",&S[i]);\\n scanf(\\\"%d\\\",&M);\\n for(int i=1;i<=M;i++) scanf(\\\"%d\\\",&D[i]);\\n D[++M]=dist;\\n ans=(LL)INF*INF;\\n DFS1(1);\\n solve();\\n printf(\\\"%lld\\\\n\\\",ans);\\n}\\n\\nint main(){\\n#ifdef NNever\\n//freopen(\\\"data.in\\\",\\\"r\\\",stdin);\\n///freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n#endif // NNever\\n work();\\n return 0;\\n}\\n\\n/*\\ninput\\n60516263\\n5\\n45\\n16\\n94\\n71\\n91\\n4\\n20586550\\n54017689\\n36941264\\n49153094\\n\\noutput\\n6577480535\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.14,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2427_3221184\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<iostream>\\n#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<set>\\n#include<cstring>\\n#include<map>\\nusing namespace std;\\nconst int MAXN = (int) 105;\\nconst int INF = (int) 0x3f3f3f3f;\\ntypedef long long LL;\\n\\nint dist;\\nint M,N;\\nint S[MAXN];\\nint D[MAXN];\\nLL ans;\\nLL out_time[MAXN];\\nmap<LL,set<int> > mp;\\nstruct permutation{\\n int a[10];\\n}per;\\nint percnt;\\nvector<permutation> P;\\n\\nbool is_judge(){\\n mp.clear();\\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\\n// for(int i=1;i<=n;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\"\\\\n\\\");\\n for(int i=1;i<N;i++){\\n for(int j=i+1;j<=N;j++){\\n if(S[i]<=S[j]) continue;\\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\\n int ok=0;\\n for(int k=1;k<=M;k++){\\n if(D[k]==tmpD) ok=1;\\n }\\n// printf(\\\"ok = %d! , tmpD = %-12d , i = %d , j = %d\\\\n\\\",ok,tmpD,i,j);\\n if(!ok) return false;\\n if(mp.count(tmpD)){\\n if(mp[tmpD].count(i)) return false;\\n if(mp[tmpD].count(j)) return false;\\n }\\n mp[tmpD].insert(i);\\n mp[tmpD].insert(j);\\n }\\n }\\n return true;\\n}\\n\\nvoid update(){\\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\\n// for(int i=1;i<N;i++)if(out_time[i]>=out_time[i+1]) return;\\n// for(int i=1;i<=N;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\"\\\\n\\\");\\n if(!is_judge()) return;\\n LL tmpans=0;\\n for(int i=1;i<=N;i++){\\n LL tmp=out_time[i]+(LL)dist*S[i];\\n tmpans=max(tmpans,tmp);\\n }\\n// if(tmpans==6577480535){\\n// for(int i=1;i<=N;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\"\\\\n\\\");\\n// if(is_judge()) printf(\\\"true!\\\\n\\\");\\n// else printf(\\\"false!\\\\n\\\");\\n// exit(0xff);\\n// }\\n// for(int i=1;i<=n;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\" : tmpans = %lld\\\\n\\\",tmpans);\\n ans=min(ans,tmpans);\\n}\\n\\nint mark[MAXN];\\nvoid DFS1(int cur){\\n if(cur>N){\\n per.a[0]=1;\\n P.push_back(per);\\n return;\\n }\\n for(int i=1;i<=N;i++)if(!mark[i]){\\n per.a[++percnt]=i;\\n mark[i]=1;\\n DFS1(cur+1);\\n percnt--;\\n mark[i]=0;\\n }\\n}\\n\\nvoid DFS2(int curid,const permutation& now){\\n if(curid>N){\\n update();\\n return;\\n }\\n int cur=now.a[curid];\\n if(curid==1){\\n out_time[cur]=0;\\n DFS2(curid+1,now);\\n return;\\n }\\n\\n for(int t=1;t<curid;t++){\\n int pre=now.a[t];\\n if(cur<pre){\\n out_time[cur]=out_time[pre]-1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\\n // printf(\\\"%d-%d : %lld->%lld\\\\n\\\",pre,cur,out_time[pre],out_time[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n if(cur>pre){\\n out_time[cur]=out_time[pre]+1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\\n // printf(\\\"%d-%d : %lld->%lld\\\\n\\\",pre,cur,out_time[pre],out_time[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n }\\n}\\n\\nvoid solve(){\\n for(int perid=0;perid<P.size();perid++){\\n DFS2(1,P[perid]);\\n }\\n}\\n\\nvoid work(){\\n scanf(\\\"%d%d\\\",&dist,&N);\\n for(int i=1;i<=N;i++) scanf(\\\"%d\\\",&S[i]);\\n scanf(\\\"%d\\\",&M);\\n for(int i=1;i<=M;i++) scanf(\\\"%d\\\",&D[i]);\\n D[++M]=dist;\\n ans=(LL)INF*INF;\\n DFS1(1);\\n// printf(\\\"Pcnt = %d\\\\n\\\",P.size());\\n// for(int i=0;i<P.size();i++){\\n// for(int k=1;k<=N;k++) printf(\\\"%d \\\",P[i].a[k]);\\n// printf(\\\"\\\\n\\\");\\n// }\\n solve();\\n printf(\\\"%lld\\\\n\\\",ans);\\n}\\n\\nint main(){\\n#ifdef NNever\\n//freopen(\\\"data.in\\\",\\\"r\\\",stdin);\\n///freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n#endif // NNever\\n work();\\n return 0;\\n}\\n\\n/*\\ninput\\n60516263\\n5\\n45\\n16\\n94\\n71\\n91\\n4\\n20586550\\n54017689\\n36941264\\n49153094\\n\\noutput\\n6577480535\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -0.1406,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2427_3221132\",\n \"code_snippet\": \"#include<cstdlib>\\n#include<iostream>\\n#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<set>\\n#include<cstring>\\n#include<map>\\nusing namespace std;\\nconst int MAXN = (int) 105;\\nconst int INF = (int) 0x3f3f3f3f;\\ntypedef long long LL;\\n\\nint dist;\\nint M,N;\\nint S[MAXN];\\nint D[MAXN];\\nLL ans;\\nLL out_time[MAXN];\\nmap<LL,int> mp;\\nstruct permutation{\\n int a[10];\\n}per;\\nint percnt;\\nvector<permutation> P;\\n\\nbool is_judge(){\\n mp.clear();\\n for(int i=2;i<=N;i++)if(out_time[i]<=out_time[i-1]) return false;\\n// for(int i=1;i<=n;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\"\\\\n\\\");\\n for(int i=1;i<=N;i++){\\n for(int j=i+1;j<N;j++){\\n if(S[i]<=S[j]) continue;\\n if((out_time[j]-out_time[i])/(S[i]-S[j])>=dist) continue;\\n if((out_time[j]-out_time[i])%(S[i]-S[j])!=0) return false;\\n int tmpD=(out_time[j]-out_time[i])/(S[i]-S[j]);\\n int ok=0;\\n for(int k=1;k<=M;k++){\\n if(D[k]==tmpD) ok=1;\\n }\\n if(!ok) return false;\\n if(mp.count(tmpD)) return false;\\n mp[tmpD]++;\\n }\\n }\\n return true;\\n}\\n\\nvoid update(){\\n for(int i=N;i>=1;i--) out_time[i]-=out_time[1];\\n// for(int i=1;i<N;i++)if(out_time[i]>=out_time[i+1]) return;\\n// for(int i=1;i<=N;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\"\\\\n\\\");\\n if(!is_judge()) return;\\n LL tmpans=0;\\n for(int i=1;i<=N;i++){\\n LL tmp=out_time[i]+(LL)dist*S[i];\\n tmpans=max(tmpans,tmp);\\n }\\n// for(int i=1;i<=n;i++) printf(\\\"%lld \\\",out_time[i]);\\n// printf(\\\" : tmpans = %lld\\\\n\\\",tmpans);\\n ans=min(ans,tmpans);\\n}\\n\\nint mark[MAXN];\\nvoid DFS1(int cur){\\n if(cur>N){\\n per.a[0]=1;\\n P.push_back(per);\\n return;\\n }\\n for(int i=1;i<=N;i++)if(!mark[i]){\\n per.a[++percnt]=i;\\n mark[i]=1;\\n DFS1(cur+1);\\n percnt--;\\n mark[i]=0;\\n }\\n}\\n\\nvoid DFS2(int curid,permutation now){\\n if(curid>N){\\n update();\\n return;\\n }\\n int cur=now.a[curid];\\n if(curid==1){\\n out_time[cur]=0;\\n DFS2(curid+1,now);\\n return;\\n }\\n\\n for(int t=1;t<curid;t++){\\n int pre=now.a[t];\\n if(cur<pre){\\n out_time[cur]=out_time[pre]-1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]-dt*(S[cur]-S[pre]);\\n // printf(\\\"%d-%d : %lld->%lld\\\\n\\\",pre,cur,out_time[pre],out_time[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n if(cur>pre){\\n out_time[cur]=out_time[pre]+1;\\n DFS2(curid+1,now);\\n for(int i=1;i<=M;i++){\\n LL dt=D[i];\\n out_time[cur]=out_time[pre]+dt*(S[pre]-S[cur]);\\n // printf(\\\"%d-%d : %lld->%lld\\\\n\\\",pre,cur,out_time[pre],out_time[cur]);\\n DFS2(curid+1,now);\\n }\\n }\\n }\\n}\\n\\nvoid solve(){\\n for(int perid=0;perid<P.size();perid++){\\n permutation now=P[perid];\\n DFS2(1,now);\\n }\\n}\\n\\nvoid work(){\\n scanf(\\\"%d%d\\\",&dist,&N);\\n for(int i=1;i<=N;i++) scanf(\\\"%d\\\",&S[i]);\\n scanf(\\\"%d\\\",&M);\\n for(int i=1;i<=M;i++) scanf(\\\"%d\\\",&D[i]);\\n D[++M]=dist;\\n ans=(LL)INF*INF;\\n DFS1(1);\\n// printf(\\\"Pcnt = %d\\\\n\\\",P.size());\\n// for(int i=0;i<P.size();i++){\\n// for(int k=1;k<=n;k++) printf(\\\"%d \\\",P[i].a[k]);\\n// printf(\\\"\\\\n\\\");\\n// }\\n solve();\\n printf(\\\"%lld\\\\n\\\",ans);\\n}\\n\\nint main(){\\n#ifdef NNever\\n//freopen(\\\"data.in\\\",\\\"r\\\",stdin);\\n///freopen(\\\"out.txt\\\",\\\"w\\\",stdout);\\n#endif // NNever\\n work();\\n return 0;\\n}\\n\\n/*\\n60516263\\n5\\n45\\n16\\n94\\n71\\n91\\n4\\n20586550\\n54017689\\n36941264\\n49153094\\n*/\",\n \"accuracy\": 0.3076923076923077,\n \"time_ms\": 40,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.1323,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2427_3054377\",\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 dist;\\n cin>>dist;\\n Int n;\\n cin>>n;\\n vector<Int> s(n);\\n for(Int i=0;i<n;i++) cin>>s[i];\\n Int m;\\n cin>>m;\\n vector<Int> d(m);\\n for(Int i=0;i<m;i++) cin>>d[i];\\n\\n const Int INF = 1e17;\\n Int t[10][10];\\n Int ans=INF;\\n auto check=\\n [&](){\\n struct edge{\\n\\tInt from,to,cost;\\n\\tedge(Int from,Int to,Int cost):from(from),to(to),cost(cost){\\n\\t //cout<<from<<\\\" \\\"<<to<<\\\" \\\"<<cost<<endl;\\n\\t}\\n };\\n vector<edge> es;\\n \\n for(Int i=1;i<n;i++){\\n\\t// p[i-1] + 1 <= p[i]\\n\\t// p[i-1] - p[i] <= -1\\n\\tes.emplace_back(i,i-1,-1);\\n }\\n vector<Int> cnt(m,0);\\n for(Int i=0;i<n;i++){\\n\\tfor(Int j=i+1;j<n;j++){\\n\\t // j catch up i at t[i][j]\\n\\t if(t[i][j]==m){\\n\\t // dist * s[i] + p[i] <= dist * s[j] + p[j]\\n\\t // p[i] - p[j] <= dist * s[j] - dist * s[i]\\t \\n\\t es.emplace_back(j,i,dist*(s[j]-s[i]));\\n\\t continue;\\n\\t }\\n\\t cnt[t[i][j]]++;\\n\\t if(cnt[t[i][j]]>1) return;\\n\\t Int x=d[t[i][j]];\\n\\t // x * s[i] + p[i] == x * s[j] + p[j]\\n\\t // x * s[i] + p[i] <= x * s[j] + p[j]\\t \\n\\t // p[i] - p[j] <= x * s[j] - x * s[i]\\n\\t es.emplace_back(j,i,x*(s[j]-s[i]));\\n\\t // x * s[i] + p[i] >= x * s[j] + p[j]\\n\\t // p[j] - p[i] <= x * s[i] - x * s[j]\\n\\t es.emplace_back(i,j,x*(s[i]-s[j]));\\t \\n\\t}\\n }\\n \\n vector<Int> p(n,INF);\\n // minimize p[n-1] - p[0]\\n // maximize p[0] - p[n-1]\\n p[n-1] = 0;\\n Int flg=1;\\n for(Int t=0;t<n*3;t++){\\n\\tflg=0;\\n\\tfor(auto e:es){\\n\\t if(p[e.from]+e.cost<p[e.to]){\\n\\t p[e.to]=p[e.from]+e.cost;\\n\\t flg=1;\\n\\t }\\n\\t}\\t\\n }\\n if(flg) return;\\n assert(p[n-1]==0);\\n vector<Int> z(n);\\n for(Int i=0;i<n;i++) z[i]=p[i]-p[0];\\n Int res=0;\\n for(Int i=0;i<n;i++) chmax(res,dist*s[i]+z[i]);\\n chmin(ans,res);\\n //for(Int i=0;i<n;i++) cout<<i<<\\\":\\\"<<z[i]<<endl;\\n //cout<<res<<endl;\\n };\\n\\n using P = pair<Int, Int>;\\n vector<P> vp;\\n for(Int i=0;i<n;i++)\\n for(Int j=i+1;j<n;j++)\\n vp.emplace_back(i,j);\\n\\n function<void(Int)> dfs=\\n [&](Int x){\\n if(x==(Int)vp.size()){\\n\\tcheck();\\n\\treturn;\\n }\\n for(Int i=0;i<=m;i++){\\n\\tt[vp[x].first][vp[x].second]=i;\\n\\tdfs(x+1);\\n }\\n };\\n \\n dfs(0);\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.3076923076923077,\n \"time_ms\": 2630,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -1.1096,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2427_2757662\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <string>\\n#include <map>\\nusing namespace std;\\n\\n\\n#define REP(i, s) for (int i = 0; i < s; ++i)\\n#define ALL(v) (v.begin(), v.end())\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\n#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ EACH(it, P) { s << \\\"<\\\" << it->first << \\\"->\\\" << it->second << \\\"> \\\"; } return s << endl; }\\n\\n\\n\\ntemplate<class Abel> struct UnionFind {\\n vector<int> par;\\n vector<int> rank;\\n vector<Abel> diff_weight;\\n \\n UnionFind(int n = 1, Abel SUM_UNITY = 0) {\\n init(n, SUM_UNITY);\\n }\\n \\n void init(int n = 1, Abel SUM_UNITY = 0) {\\n par.resize(n); rank.resize(n); diff_weight.resize(n);\\n for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;\\n }\\n \\n int root(int x) {\\n if (par[x] == x) {\\n return x;\\n }\\n else {\\n int r = root(par[x]);\\n diff_weight[x] += diff_weight[par[x]];\\n return par[x] = r;\\n }\\n }\\n \\n Abel weight(int x) {\\n root(x);\\n return diff_weight[x];\\n }\\n \\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n \\n bool merge(int x, int y, Abel w) {\\n w += weight(x); w -= weight(y);\\n x = root(x); y = root(y);\\n if (x == y) return false;\\n if (rank[x] < rank[y]) swap(x, y), w = -w;\\n if (rank[x] == rank[y]) ++rank[x];\\n par[y] = x;\\n diff_weight[y] = w;\\n return true;\\n }\\n \\n Abel diff(int x, int y) {\\n return weight(y) - weight(x);\\n }\\n \\n friend ostream& operator << (ostream& s, UnionFind uf) {\\n map<int, vector<int> > res;\\n for (int i = 0; i < uf.par.size(); ++i) {\\n int r = uf.root(i);\\n res[r].push_back(i);\\n }\\n for (map<int, vector<int> >::iterator it = res.begin(); it != res.end(); ++it) {\\n s << endl;\\n for (int j = 0; j < (int)it->second.size(); ++j) {\\n s << it->second[j] << \\\"(\\\" << uf.weight(it->second[j]) << \\\"), \\\";\\n }\\n }\\n return s << endl;\\n }\\n};\\n\\ntypedef pair<int,int> pint;\\n\\nlong long dist;\\nint n, m;\\nlong long S[11], D[11];\\n\\nconst long long INF = 1LL<<60;\\nlong long res = INF; // 答えを更新していく\\n\\n// 各馬車が「どこですれ違うか」\\nvoid check(vector<long long> diffs) {\\n UnionFind<long long> uf(n);\\n int iter = 0;\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n long long diff = diffs[iter++];\\n if (diff == -1) continue;\\n \\n if (uf.issame(i, j)) {\\n long long curdiff = uf.diff(i, j);\\n if (diff != curdiff) return;\\n }\\n else {\\n uf.merge(i, j, diff);\\n }\\n }\\n }\\n\\n // 暫定回を求める\\n long long start = 0, goal = 0;\\n for (int i = 0; i < n; ++i) {\\n long long start_i = start + uf.diff(0, i);\\n long long goal_i = start_i + S[i] * dist;\\n if (start > start_i) start = start_i;\\n if (goal < goal_i) goal = goal_i;\\n }\\n \\n // 整合性を確認\\n for (int i = 0; i < n; ++i) {\\n for (int j = i + 1; j < n; ++j) {\\n if (!uf.issame(i, j)) return; // 繋がっていない箇所があったら明らかに最適でないので return\\n if (uf.diff(i, j) < 1) return; // j が i の 1分後よりも早く出ていたらダメ\\n \\n // 追い越している場合はどこで追い越してるか\\n long long start_i = uf.diff(0, i);\\n long long goal_i = start_i + S[i] * dist;\\n long long start_j = uf.diff(0, j);\\n long long goal_j = start_j + S[j] * dist;\\n if (goal_j < goal_i) {\\n int pl = -1;\\n for (int k = 0; k < m; ++k) {\\n long long it = start_i + S[i] * D[k];\\n long long jt = start_j + S[j] * D[k];\\n if (it == jt) {\\n pl = k;\\n }\\n }\\n if (pl == -1) return; // 「少し広いところ以外で交わったらダメ\\n }\\n }\\n }\\n \\n // 本当に m 箇所それぞれについて、3 個以上の馬車が交わることがないか確認\\n for (int i = 0; i < m; ++i) {\\n map<long long,int> ma;\\n for (int j = 0; j < n; ++j) {\\n long long t = uf.diff(0, j) + S[j] * D[i];\\n ma[t]++;\\n }\\n for (map<long long,int>::iterator it = ma.begin(); it != ma.end(); ++it) {\\n if (it->second >= 3) return;\\n }\\n }\\n \\n /*\\n COUT(\\\"--------------\\\");\\n COUT(diffs);\\n COUT(uf);\\n COUT(start);\\n COUT(goal);\\n */\\n \\n // 確認を終えたら OK\\n if (res > goal - start) res = goal - start;\\n}\\n\\nvoid dfs(vector<long long> diffs, int i, int j) {\\n if (i == n-1) {\\n check(diffs);\\n return;\\n }\\n \\n // 馬車 i, j が何分でゴールするか\\n long long total_i = S[i] * dist;\\n long long total_j = S[j] * dist;\\n \\n // 次の index\\n int ni = i;\\n int nj = j+1;\\n if (nj == n) {\\n ++ni;\\n nj = ni+1;\\n }\\n \\n // weight(j) - weight(i) = 1 (j が i より 1 分遅れスタートで、途中で抜かさない場合\\n if (total_j >= total_i - 1) {\\n diffs.push_back(1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n \\n // ゴールでピッタリ\\n {\\n long long diff = total_i - total_j;\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n \\n // m 箇所それぞれ\\n if (S[i] != S[j]) {\\n for (int k = 0; k < m; ++k) {\\n long long diff = (S[i] - S[j]) * D[k];\\n if (diff >= 1) {\\n diffs.push_back(diff);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n }\\n }\\n }\\n \\n // それ以外\\n diffs.push_back(-1);\\n dfs(diffs, ni, nj);\\n diffs.pop_back();\\n}\\n\\nint main() {\\n while (cin >> dist) {\\n cin >> n;\\n for (int i = 0; i < n; ++i) cin >> S[i];\\n cin >> m;\\n for (int i = 0; i < m; ++i) cin >> D[i];\\n \\n vector<long long> diffs;\\n dfs(diffs, 0, 1);\\n \\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.1559,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2427_1654709\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nconst long long int My_LInf=9223372036854775807;\\n\\n\\nstruct aUnionFind {\\n\\tvector<pair<int, long long int>> data;\\n\\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\\n\\n\\t//y is w bigger than x\\n\\tbool unionSet(const int x, const int y, const long long int w) {\\n\\t\\tconst int rx(root(x).first), ry(root(y).first);\\n\\t\\tif (rx != ry) {\\n\\t\\t\\tdata[rx].first += data[ry].first; data[ry].first = rx;\\n\\t\\t\\tdata[ry].second = w + data[x].second - data[y].second;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn root(x).second + w == root(y).second;\\n\\t\\t}\\n\\t}\\n\\tbool findSet(const int x, const int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\t//x is belong to first\\n\\t//x is second bigger than first\\n\\tpair<int, long long int> root(const int x) {\\n\\t\\tif (data[x].first < 0) {\\n\\t\\t\\treturn make_pair(x, 0);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpair<int, long long int>ndata;\\n\\t\\t\\tndata.first = root(data[x].first).first;\\n\\t\\t\\tndata.second = data[x].second + root(data[x].first).second;\\n\\t\\t\\treturn data[x] = ndata;\\n\\t\\t}\\n\\t}\\n\\tint size(const int x) {\\n\\t\\treturn -data[root(x).first].first;\\n\\t}\\n};\\n\\n\\nint HorseNum, M;\\n\\nvector<long long int>sps;\\n\\nstruct aa {\\n\\tint fstfinid;\\n\\tlong long int fstfintime;\\n\\tint lasfinid;\\n\\tlong long int lasfintime;\\n\\tint fststaid;\\n\\tlong long int fststatime;\\n\\tint lasstaid;\\n\\tlong long int lasstatime;\\n};\\n\\n\\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\\n\\tvector<int>seq(HorseNum);\\n\\tiota(seq.begin(), seq.end(), 0);\\n\\taUnionFind uf(HorseNum);\\n\\tfor (int wide = 0; wide < M; ++wide) {\\n\\t\\tfor (int change = 0; change < HorseNum - 1; ++change) {\\n\\t\\t\\tif (changes[wide][change]) {\\n\\t\\t\\t\\tconst int c0 = seq[change];\\n\\t\\t\\t\\tconst int c1 = seq[change + 1];\\n\\t\\t\\t\\tconst long long int sa = times[c0][wide] - times[c1][wide];\\n\\t\\t\\t\\tif (sa > 0) {\\n\\t\\t\\t\\t\\tif (!uf.unionSet(c0, c1, sa)) {\\n\\t\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(seq[change], seq[change + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tmap<int, aa>mp;\\n\\tfor (int i = 0; i < HorseNum; ++i) {\\n\\t\\tif (!mp.count(uf.root(i).first)) {\\n\\t\\t\\tmp[uf.root(i).first] = aa{\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,0,\\n\\t\\t\\ti,0,\\n\\t\\t\\t};\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tmp[uf.root(i).first].lasstaid = i;\\n\\t\\t\\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\\n\\t\\t}\\n\\t}\\n\\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\\n\\t\\tif (it != mp.begin()) {\\n\\t\\t\\taa afrom(prev(it)->second);\\n\\t\\t\\taa ato(it->second);\\n\\n\\t\\t\\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(seq[i]).second+times[seq[i]][M] > uf.root(seq[i + 1]).second + times[seq[i+1]][M])return My_LInf;\\n\\t}\\n\\tlong long int amax = 0;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\\n\\t}\\n\\treturn amax;\\n}\\n\\nint main() {\\n\\tlong long int dist;\\n\\tcin >> dist;\\n\\n\\tcin >> HorseNum;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tint S; cin >> S;\\n\\t\\tsps.push_back(S);\\n\\t}\\n\\tcin >> M;\\n\\tvector<long long int>ds;\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint D; cin >> D;\\n\\t\\tds.push_back(D);\\n\\t}\\n\\tsort(ds.begin(), ds.end());\\n\\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\ttimes[i][j] = sps[i] * ds[j];\\n\\t\\t}\\n\\t\\ttimes[i][M] = sps[i] * dist;\\n\\t}\\n\\tlong long int ans = My_LInf;\\n\\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\\n\\t\\tbitset<20>bs(i);\\n\\t\\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\\n\\t\\tbool ok = true;\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 1; ++k) {\\n\\t\\t\\t\\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 2; ++k) {\\n\\t\\t\\t\\tif (changes[j][k] && changes[j][k + 1]) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok)continue;\\n\\t\\tlong long int a = check(changes, times);\\n\\t\\tif (a < ans) {\\n\\t\\t\\tans = a;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -0.236,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2427_1654653\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nconst long long int My_LInf=9223372036854775807;\\n\\n\\nstruct aUnionFind {\\n\\tvector<pair<int, long long int>> data;\\n\\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\\n\\n\\t//y is w bigger than x\\n\\tbool unionSet(const int x, const int y, const long long int w) {\\n\\t\\tconst int rx(root(x).first), ry(root(y).first);\\n\\t\\tif (rx != ry) {\\n\\t\\t\\tdata[rx].first += data[ry].first; data[ry].first = rx;\\n\\t\\t\\tdata[ry].second = w + data[x].second - data[y].second;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn root(x).second + w == root(y).second;\\n\\t\\t}\\n\\t}\\n\\tbool findSet(const int x, const int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\t//x is belong to first\\n\\t//x is second bigger than first\\n\\tpair<int, long long int> root(const int x) {\\n\\t\\tif (data[x].first < 0) {\\n\\t\\t\\treturn make_pair(x, 0);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpair<int, long long int>ndata;\\n\\t\\t\\tndata.first = root(data[x].first).first;\\n\\t\\t\\tndata.second = data[x].second + root(data[x].first).second;\\n\\t\\t\\treturn data[x] = ndata;\\n\\t\\t}\\n\\t}\\n\\tint size(const int x) {\\n\\t\\treturn -data[root(x).first].first;\\n\\t}\\n};\\n\\n\\nint HorseNum, M;\\n\\nvector<long long int>sps;\\n\\nstruct aa {\\n\\tint fstfinid;\\n\\tlong long int fstfintime;\\n\\tint lasfinid;\\n\\tlong long int lasfintime;\\n\\tint fststaid;\\n\\tlong long int fststatime;\\n\\tint lasstaid;\\n\\tlong long int lasstatime;\\n};\\n\\n\\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\\n\\tvector<int>seq(HorseNum);\\n\\tiota(seq.begin(), seq.end(), 0);\\n\\taUnionFind uf(HorseNum);\\n\\tfor (int wide = 0; wide < M; ++wide) {\\n\\t\\tfor (int change = 0; change < HorseNum - 1; ++change) {\\n\\t\\t\\tif (changes[wide][change]) {\\n\\t\\t\\t\\tconst int c0 = seq[change];\\n\\t\\t\\t\\tconst int c1 = seq[change + 1];\\n\\t\\t\\t\\tconst long long int sa = times[c0][wide] - times[c1][wide];\\n\\t\\t\\t\\tif (sa > 0) {\\n\\t\\t\\t\\t\\tif (!uf.unionSet(c0, c1, sa)) {\\n\\t\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(seq[change], seq[change + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tmap<int, aa>mp;\\n\\tfor (int i = 0; i < HorseNum; ++i) {\\n\\t\\tif (!mp.count(uf.root(i).first)) {\\n\\t\\t\\tmp[uf.root(i).first] = aa{\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,0,\\n\\t\\t\\ti,0,\\n\\t\\t\\t};\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tmp[uf.root(i).first].lasstaid = i;\\n\\t\\t\\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\\n\\t\\t}\\n\\t}\\n\\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\\n\\t\\tif (it != mp.begin()) {\\n\\t\\t\\taa afrom(prev(it)->second);\\n\\t\\t\\taa ato(it->second);\\n\\n\\t\\t\\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\\n\\t\\t\\t}\\n\\t\\t\\t/*aUnionFind auf(uf);\\n\\t\\t\\taUnionFind buf(uf);\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasfinid;\\n\\t\\t\\t\\tint to = (it)->second.fstfinid;\\n\\n\\t\\t\\t\\tif (sps[from] > sps[to]) {\\n\\t\\t\\t\\t\\tauf.unionSet(from, to, times[from][M] - times[to][M]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasstaid;\\n\\t\\t\\t\\tint to = (it)->second.fststaid;\\n\\t\\t\\t\\tbuf.unionSet(from, to, 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\\n\\t\\t\\t\\tuf = buf;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf = auf;\\n\\t\\t\\t}*/\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(seq[i]).second+times[seq[i]][M] > uf.root(seq[i + 1]).second + times[seq[i+1]][M])return My_LInf;\\n\\t}\\n\\tlong long int amax = 0;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\\n\\t}\\n\\treturn amax;\\n}\\n\\nint main() {\\n\\taUnionFind uu(10);\\n\\tuu.unionSet(0, 1, 3);\\n\\tuu.unionSet(0, 2, 4);\\n\\tuu.unionSet(2, 4, 5);\\n\\tuu.unionSet(6, 7, 1);\\n\\tuu.unionSet(7, 8, 2);\\n\\tuu.unionSet(0, 8, 0);\\n\\t\\n\\t\\n\\tlong long int dist;\\n\\tcin >> dist;\\n\\n\\tcin >> HorseNum;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tint S; cin >> S;\\n\\t\\tsps.push_back(S);\\n\\t}\\n\\tcin >> M;\\n\\tvector<long long int>ds;\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint D; cin >> D;\\n\\t\\tds.push_back(D);\\n\\t}\\n\\tsort(ds.begin(), ds.end());\\n\\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\ttimes[i][j] = sps[i] * ds[j];\\n\\t\\t}\\n\\t\\ttimes[i][M] = sps[i] * dist;\\n\\t}\\n\\tlong long int ans = My_LInf;\\n\\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\\n\\t\\tbitset<20>bs(i);\\n\\t\\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\\n\\t\\tbool ok = true;\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 1; ++k) {\\n\\t\\t\\t\\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 2; ++k) {\\n\\t\\t\\t\\tif (changes[j][k] && changes[j][k + 1]) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok)continue;\\n\\t\\tlong long int a = check(changes, times);\\n\\t\\tif (a < ans) {\\n\\t\\t\\tans = a;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2362,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2427_1654627\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nconst long long int My_LInf=9223372036854775807;\\n\\n\\nstruct aUnionFind {\\n\\tvector<pair<int, long long int>> data;\\n\\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\\n\\n\\t//y is w bigger than x\\n\\tbool unionSet(const int x, const int y, const long long int w) {\\n\\t\\tconst int rx(root(x).first), ry(root(y).first);\\n\\t\\tif (rx != ry) {\\n\\t\\t\\tdata[rx].first += data[ry].first; data[ry].first = rx;\\n\\t\\t\\tdata[ry].second = w + data[x].second - data[y].second;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn root(x).second + w == root(y).second;\\n\\t\\t}\\n\\t}\\n\\tbool findSet(const int x, const int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\t//x is belong to first\\n\\t//x is second bigger than first\\n\\tpair<int, long long int> root(const int x) {\\n\\t\\tif (data[x].first < 0) {\\n\\t\\t\\treturn make_pair(x, 0);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpair<int, long long int>ndata;\\n\\t\\t\\tndata.first = root(data[x].first).first;\\n\\t\\t\\tndata.second = data[x].second + root(data[x].first).second;\\n\\t\\t\\treturn data[x] = ndata;\\n\\t\\t}\\n\\t}\\n\\tint size(const int x) {\\n\\t\\treturn -data[root(x).first].first;\\n\\t}\\n};\\n\\n\\nint HorseNum, M;\\n\\nvector<long long int>sps;\\n\\nstruct aa {\\n\\tint fstfinid;\\n\\tlong long int fstfintime;\\n\\tint lasfinid;\\n\\tlong long int lasfintime;\\n\\tint fststaid;\\n\\tlong long int fststatime;\\n\\tint lasstaid;\\n\\tlong long int lasstatime;\\n};\\n\\n\\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\\n\\tvector<int>seq(HorseNum);\\n\\tiota(seq.begin(), seq.end(), 0);\\n\\taUnionFind uf(HorseNum);\\n\\tfor (int wide = 0; wide < M; ++wide) {\\n\\t\\tfor (int change = 0; change < HorseNum - 1; ++change) {\\n\\t\\t\\tif (changes[wide][change]) {\\n\\t\\t\\t\\tconst int c0 = seq[change];\\n\\t\\t\\t\\tconst int c1 = seq[change + 1];\\n\\t\\t\\t\\tconst long long int sa = times[c0][wide] - times[c1][wide];\\n\\t\\t\\t\\tif (sa > 0) {\\n\\t\\t\\t\\t\\tif (!uf.unionSet(c0, c1, sa)) {\\n\\t\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(seq[change], seq[change + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tmap<int, aa>mp;\\n\\tfor (int i = 0; i < HorseNum; ++i) {\\n\\t\\tif (!mp.count(uf.root(i).first)) {\\n\\t\\t\\tmp[uf.root(i).first] = aa{\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,0,\\n\\t\\t\\ti,0,\\n\\t\\t\\t};\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tmp[uf.root(i).first].lasstaid = i;\\n\\t\\t\\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\\n\\t\\t}\\n\\t}\\n\\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\\n\\t\\tif (it != mp.begin()) {\\n\\t\\t\\taa afrom(prev(it)->second);\\n\\t\\t\\taa ato(it->second);\\n\\n\\t\\t\\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\\n\\t\\t\\t}\\n\\t\\t\\t/*aUnionFind auf(uf);\\n\\t\\t\\taUnionFind buf(uf);\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasfinid;\\n\\t\\t\\t\\tint to = (it)->second.fstfinid;\\n\\n\\t\\t\\t\\tif (sps[from] > sps[to]) {\\n\\t\\t\\t\\t\\tauf.unionSet(from, to, times[from][M] - times[to][M]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasstaid;\\n\\t\\t\\t\\tint to = (it)->second.fststaid;\\n\\t\\t\\t\\tbuf.unionSet(from, to, 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\\n\\t\\t\\t\\tuf = buf;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf = auf;\\n\\t\\t\\t}*/\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\\n\\t}\\n\\tlong long int amax = 0;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\\n\\t}\\n\\treturn amax;\\n}\\n\\nint main() {\\n\\t\\n\\t\\n\\tlong long int dist;\\n\\tcin >> dist;\\n\\n\\tcin >> HorseNum;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tint S; cin >> S;\\n\\t\\tsps.push_back(S);\\n\\t}\\n\\tcin >> M;\\n\\tvector<long long int>ds;\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint D; cin >> D;\\n\\t\\tds.push_back(D);\\n\\t}\\n\\tsort(ds.begin(), ds.end());\\n\\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\ttimes[i][j] = sps[i] * ds[j];\\n\\t\\t}\\n\\t\\ttimes[i][M] = sps[i] * dist;\\n\\t}\\n\\tlong long int ans = My_LInf;\\n\\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\\n\\t\\tbitset<20>bs(i);\\n\\t\\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\\n\\t\\tbool ok = true;\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 1; ++k) {\\n\\t\\t\\t\\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 2; ++k) {\\n\\t\\t\\t\\tif (changes[j][k] && changes[j][k + 1]) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok)continue;\\n\\t\\tlong long int a = check(changes, times);\\n\\t\\tans = min(ans,a);\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.46153846153846156,\n \"time_ms\": 330,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2362,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2427_1654608\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nconst long long int My_LInf=9223372036854775807;\\n\\n\\nstruct aUnionFind {\\n\\tvector<pair<int, long long int>> data;\\n\\taUnionFind(int size) : data(size, make_pair(-1, 0)) { }\\n\\n\\t//y is w bigger than x\\n\\tbool unionSet(const int x, const int y, const long long int w) {\\n\\t\\tconst int rx(root(x).first), ry(root(y).first);\\n\\t\\tif (rx != ry) {\\n\\t\\t\\tdata[rx].first += data[ry].first; data[ry].first = rx;\\n\\t\\t\\tdata[ry].second = w + data[x].second - data[y].second;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\treturn root(x).second + w == root(y).second;\\n\\t\\t}\\n\\t}\\n\\tbool findSet(const int x, const int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\n\\t//x is belong to first\\n\\t//x is second bigger than first\\n\\tpair<int, long long int> root(const int x) {\\n\\t\\tif (data[x].first < 0) {\\n\\t\\t\\treturn make_pair(x, 0);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpair<int, long long int>ndata;\\n\\t\\t\\tndata.first = root(data[x].first).first;\\n\\t\\t\\tndata.second = data[x].second + root(data[x].first).second;\\n\\t\\t\\treturn data[x] = ndata;\\n\\t\\t}\\n\\t}\\n\\tint size(const int x) {\\n\\t\\treturn -data[root(x).first].first;\\n\\t}\\n};\\n\\n\\nint HorseNum, M;\\n\\nvector<long long int>sps;\\n\\nstruct aa {\\n\\tint fstfinid;\\n\\tlong long int fstfintime;\\n\\tint lasfinid;\\n\\tlong long int lasfintime;\\n\\tint fststaid;\\n\\tlong long int fststatime;\\n\\tint lasstaid;\\n\\tlong long int lasstatime;\\n};\\n\\n\\nlong long int check(const vector<vector<bool>>&changes, const vector<vector<long long int>>×) {\\n\\tvector<int>seq(HorseNum);\\n\\tiota(seq.begin(), seq.end(), 0);\\n\\taUnionFind uf(HorseNum);\\n\\tfor (int wide = 0; wide < M; ++wide) {\\n\\t\\tfor (int change = 0; change < HorseNum - 1; ++change) {\\n\\t\\t\\tif (changes[wide][change]) {\\n\\t\\t\\t\\tconst int c0 = seq[change];\\n\\t\\t\\t\\tconst int c1 = seq[change + 1];\\n\\t\\t\\t\\tconst long long int sa = times[c0][wide] - times[c1][wide];\\n\\t\\t\\t\\tif (sa > 0) {\\n\\t\\t\\t\\t\\tif (!uf.unionSet(c0, c1, sa)) {\\n\\t\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\treturn My_LInf;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(seq[change], seq[change + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tmap<int, aa>mp;\\n\\tfor (int i = 0; i < HorseNum; ++i) {\\n\\t\\tif (!mp.count(uf.root(i).first)) {\\n\\t\\t\\tmp[uf.root(i).first] = aa{\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,uf.root(i).second + times[i][M],\\n\\t\\t\\ti,0,\\n\\t\\t\\ti,0,\\n\\t\\t\\t};\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (mp[uf.root(i).first].fstfintime > uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].fstfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tif (mp[uf.root(i).first].lasfintime < uf.root(i).second + times[i][M]) {\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfinid = i;\\n\\t\\t\\t\\tmp[uf.root(i).first].lasfintime = uf.root(i).second + times[i][M];\\n\\t\\t\\t}\\n\\t\\t\\tmp[uf.root(i).first].lasstaid = i;\\n\\t\\t\\tmp[uf.root(i).first].lasstatime = uf.root(i).second;\\n\\t\\t}\\n\\t}\\n\\tfor (auto it = mp.begin(); it != mp.end(); ++it) {\\n\\t\\tif (it != mp.begin()) {\\n\\t\\t\\taa afrom(prev(it)->second);\\n\\t\\t\\taa ato(it->second);\\n\\n\\t\\t\\tif (afrom.lasfintime - afrom.lasstatime>ato.fstfintime-ato.fststatime) {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasfinid, ato.fstfinid, times[afrom.lasfinid][M] - times[ato.fstfinid][M]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf.unionSet(afrom.lasstaid, ato.fststaid, 1);\\n\\t\\t\\t}\\n\\t\\t\\t/*aUnionFind auf(uf);\\n\\t\\t\\taUnionFind buf(uf);\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasfinid;\\n\\t\\t\\t\\tint to = (it)->second.fstfinid;\\n\\n\\t\\t\\t\\tif (sps[from] > sps[to]) {\\n\\t\\t\\t\\t\\tauf.unionSet(from, to, times[from][M] - times[to][M]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tauf.unionSet((prev(it))->second.lasstaid, (it)->second.fststaid, 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tint from = (prev(it))->second.lasstaid;\\n\\t\\t\\t\\tint to = (it)->second.fststaid;\\n\\t\\t\\t\\tbuf.unionSet(from, to, 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (buf.root((it)->second.fststaid).second > auf.root((it)->second.fststaid).second) {\\n\\t\\t\\t\\tuf = buf;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuf = auf;\\n\\t\\t\\t}*/\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < HorseNum - 1; ++i) {\\n\\t\\tif (uf.root(i).second >= uf.root(i + 1).second)return My_LInf;\\n\\t}\\n\\tlong long int amax = 0;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tamax = max(amax, uf.root(i).second + times[i][M] - uf.root(0).second);\\n\\t}\\n\\treturn amax;\\n}\\n\\nint main() {\\n\\t\\n\\t\\n\\tlong long int dist;\\n\\tcin >> dist;\\n\\n\\tcin >> HorseNum;\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tint S; cin >> S;\\n\\t\\tsps.push_back(S);\\n\\t}\\n\\tcin >> M;\\n\\tvector<long long int>ds;\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tint D; cin >> D;\\n\\t\\tds.push_back(D);\\n\\t}\\n\\tvector<vector<long long int>>times(HorseNum, vector<long long int>(M + 1));\\n\\tfor (int i = 0; i <HorseNum; ++i) {\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\ttimes[i][j] = sps[i] * ds[j];\\n\\t\\t}\\n\\t\\ttimes[i][M] = sps[i] * dist;\\n\\t}\\n\\tlong long int ans = My_LInf;\\n\\tfor (int i = 0; i < 1<<((HorseNum-1)*M); ++i) {\\n\\t\\tbitset<20>bs(i);\\n\\t\\tvector<vector<bool>>changes(M, vector<bool>(HorseNum -1));\\n\\t\\tbool ok = true;\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 1; ++k) {\\n\\t\\t\\t\\tchanges[j][k] = bs[j*(HorseNum - 1) + k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < M; ++j) {\\n\\t\\t\\tfor (int k = 0; k < HorseNum - 2; ++k) {\\n\\t\\t\\t\\tif (changes[j][k] && changes[j][k + 1]) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!ok)continue;\\n\\t\\tlong long int a = check(changes, times);\\n\\t\\tans = min(ans,a);\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.46153846153846156,\n \"time_ms\": 320,\n \"memory_kb\": 3180,\n \"score_of_the_acc\": -0.2324,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2427_1550555\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nlong long p[10];\\nlong long q[10];\\nstruct wolf{\\n\\tint p[5];\\n\\twolf(){}\\n};\\nwolf now[6];\\nint N,M;\\nint rev[10][10];\\nint perm[10][10];\\nlong long INF=9999999999999999LL;\\nlong long t[10][10];\\nlong long dfs(int a){\\n\\tif(a==M){\\n\\t\\tfor(int i=0;i<=M+1;i++){\\n\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\tt[i][j]=j+p[j]*q[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint cnt=0;\\n\\t\\twhile(1){\\n\\t\\t\\tbool chg=false;\\n\\t\\t\\tfor(int i=0;i<=M;i++){\\n\\t\\t\\t\\tfor(int j=0;j<N;j++){\\n\\t\\t\\t\\t\\tfor(int k=j+1;k<N;k++){\\n\\t\\t\\t\\t\\t\\tif(t[i][now[i].p[j]]+p[now[i].p[j]]*(q[i+1]-q[i])>t[i][now[i].p[k]]+p[now[i].p[k]]*(q[i+1]-q[i])){\\n\\t\\t\\t\\t\\t\\t\\tchg=true;\\n\\t\\t\\t\\t\\t\\t\\tt[i][now[i].p[k]]=t[i][now[i].p[j]]+p[now[i].p[j]]*(q[i+1]-q[i])-p[now[i].p[k]]*(q[i+1]-q[i]);\\n\\t\\t\\t\\t\\t\\t\\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[k]]+p[now[i].p[k]]*(q[l]-q[i]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(t[i][now[i].p[j]]>t[i][now[i].p[k]]){\\n\\t\\t\\t\\t\\t\\t\\tchg=true;\\n\\t\\t\\t\\t\\t\\t\\tt[i][now[i].p[k]]=t[i][now[i].p[j]];\\n\\t\\t\\t\\t\\t\\t\\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[k]]+p[now[i].p[k]]*(q[l]-q[i]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(i==0&&t[i][now[i].p[j]]>=t[i][now[i].p[k]]){\\n\\t\\t\\t\\t\\t\\t\\tchg=true;\\n\\t\\t\\t\\t\\t\\t\\tfor(int l=0;l<=M+1;l++)t[l][now[i].p[k]]=t[i][now[i].p[j]]+1+p[now[i].p[k]]*(q[l]-q[i]);\\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\\tcnt++;\\n\\t\\t\\tif(cnt==200)return INF;\\n\\t\\t\\t//long long tmp=0;\\n\\t\\t\\t//for(int i=0;i<N;i++)tmp=max(tmp,t[M+1][i]);\\n\\t\\t\\t//printf(\\\"%lld\\\\n\\\",tmp);\\n\\t\\t\\tif(!chg)break;\\n\\t\\t}\\n\\t\\tlong long ret=0;\\n\\t\\tfor(int i=0;i<N;i++)ret=max(ret,t[M+1][i]);\\n\\t\\t/*if(ret==382){\\n\\t\\t\\tfor(int i=0;i<=M;i++){\\n\\t\\t\\t\\tfor(int j=0;j<N;j++)printf(\\\"%d \\\",now[i].p[j]);\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<=M+1;i++){\\n\\t\\t\\t\\tfor(int j=0;j<N;j++)printf(\\\"%lld \\\",t[i][j]);\\n\\t\\t\\t\\tprintf(\\\"\\\\n\\\");\\n\\t\\t\\t}\\n\\t\\t}*/\\n\\t\\treturn ret;\\n\\t}\\n\\tlong long ret=INF;\\n\\tfor(int i=0;i<N;i++){\\n\\t\\tperm[a][i]=i;\\n\\t\\trev[a][now[a].p[i]]=i;\\n\\t}\\n\\tdo{\\n\\t\\tbool ok=true;\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tif(rev[a][perm[a][i]]>i+1)ok=false;\\n\\t\\t\\tif(rev[a][perm[a][i]]<i-1)ok=false;\\n\\t\\t\\tfor(int j=i+1;j<N;j++){\\n\\t\\t\\t\\tif(rev[a][perm[a][i]]>rev[a][perm[a][j]]&&p[perm[a][i]]>=p[perm[a][j]])ok=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok){\\n\\t\\t\\tfor(int i=0;i<N;i++)now[a+1].p[i]=perm[a][i];\\n\\t\\t\\tret=min(ret,dfs(a+1));\\n\\t\\t}\\n\\t}while(next_permutation(perm[a],perm[a]+N));\\n\\treturn ret;\\n}\\nint main(){\\n\\tint a,b,c;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tfor(int i=0;i<b;i++)scanf(\\\"%lld\\\",p+i);\\n\\tscanf(\\\"%d\\\",&c);\\n\\tN=b;M=c;\\n\\tfor(int i=0;i<c;i++)scanf(\\\"%lld\\\",q+i+1);\\n\\tstd::sort(q,q+c+1);\\n\\tq[c+1]=a;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tnow[0].p[i]=i;\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\",dfs(0));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1032,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2427_1335780\",\n \"code_snippet\": \"/*\\n ?????????????????¨??????\\n*/\\n\\n#define __1__\\n\\n#ifdef __1__\\n#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#define rep(i,n) for(int i = 0;i < (n);i++)\\n#define _MAX 7\\n#define INF 7e10\\n#define MIN(a,b) (a)>(b)?(b):(a)\\nusing namespace std;\\ntypedef long long int lint;\\n\\n\\nint dist,n,m;\\nlint tm[_MAX][_MAX+2]; //tm[][0]?????????????????????,tm[][m+1]???????????´??????\\nlint S[_MAX];\\nlint D[_MAX];\\n\\nlint rettm(){\\n lint ans = 0;\\n rep(i,n){\\n ans = max(ans,tm[i][m+1]);\\n }\\n return ans;\\n}\\n\\nvoid maketm(int x){\\n rep(i,m){\\n tm[x][i+1]=tm[x][0]+D[i]*S[x];\\n }\\n tm[x][m+1]=tm[x][0]+S[x]*dist;\\n return;\\n}\\n\\nvoid show(){\\n rep(i,n){\\n rep(j,m+2){\\n printf(\\\"%4lld \\\",tm[i][j]);\\n }\\n cout << endl;\\n }\\n cout << endl;\\n return;\\n}\\n\\nint flag[5]={0};\\n\\nbool check(){\\n rep(i,n-1){\\n if(tm[i][0]>=tm[i+1][0]){\\n return false;\\n }\\n }\\n rep(i,n){\\n rep(j,n){\\n if(i<j&&tm[i][m+1]>tm[j][m+1]){\\n bool hoge = 0;\\n rep(k,m){\\n if(tm[i][k+1]==tm[j][k+1]){\\n rep(l,n){\\n if(l!=i&&l!=j&&tm[i][k+1]==tm[l][k+1])\\n return false;\\n }\\n hoge = true;\\n }\\n }\\n if(hoge == 0)\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nlint dfs(int d){\\n lint ans = INF;\\n if(d==n){\\n if(check()){\\n// show();\\n return rettm();\\n }else{\\n return 7e10;\\n }\\n }\\n rep(i,n){\\n if(flag[i]==1)\\n continue;\\n flag[i]=1;\\n if(i==0){\\n tm[i][0]=0;\\n maketm(i);\\n ans = min(dfs(d+1),ans);\\n }else if(flag[i-1]==1){\\n tm[i][0]=tm[i-1][0]+1;\\n maketm(i);\\n ans = min(dfs(d+1),ans);\\n }\\n rep(j,n){\\n if(j==i||flag[j]==0)\\n continue;\\n rep(k,m){\\n tm[i][0]=tm[j][k+1]-D[k]*S[i];\\n maketm(i);\\n ans = min(dfs(d+1),ans);\\n }\\n tm[i][0]=tm[j][m+1]-dist*S[i];\\n maketm(i);\\n ans = min(dfs(d+1),ans);\\n }\\n flag[i]=0;\\n }\\n return ans;\\n}\\n \\nint main() {\\n cin >> dist >> n;\\n rep(i,n){\\n cin >> S[i];\\n }\\n cin >> m;\\n rep(i,m){\\n cin >> D[i];\\n }\\n cout << dfs(0) << endl;\\n return 0;\\n}\\n#endif\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1172,\n \"score_of_the_acc\": -0.0074,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2427_566558\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <bitset>\\nusing namespace std;\\n\\ntypedef long long LL;\\n\\nLL dist, ans = (LL)1e18;\\nint n, m;\\nvector<int> S, intr;\\nvector<LL> D;\\n\\nvector<int> ptn;\\n\\nvoid enumpattern(int a, int i){\\n\\tif(i >= n - 1){\\n\\t\\tptn.push_back(a);\\n\\t}\\n\\telse{\\n\\t\\tenumpattern(a, i + 1);\\n\\t\\tenumpattern(a | 1 << i, i + 2);\\n\\t}\\n}\\n\\n\\nvoid calcans(){\\n\\tvector<LL> stm(n + 1, -1LL);\\n\\tLL lst0 = -1, lft0 = 0;\\t// last start/finish time\\n\\n\\tvector<vector<int> > odr(m + 1, vector<int>(n));\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\todr[0][i] = i;\\n\\t}\\n\\t\\n\\tint cnt = 0;\\n\\tfor(int j = 0; j < m; ++j){\\n\\t\\todr[j + 1] = odr[j];\\n\\t\\tfor(int i = 0; i < n; ++i){\\n\\t\\t\\tif(intr[j] >> i & 1){\\n\\t\\t\\t\\t++cnt;\\n\\t\\t\\t\\tint a = odr[j][i], b = odr[j][i + 1];\\n\\t\\t\\t\\tif(a > b || S[a] <= S[b]){\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tswap(odr[j + 1][i], odr[j + 1][i + 1]);\\n\\t\\t\\t\\t++i;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\tif(stm[i] != -1LL) continue;\\n\\n\\t\\tstm[i] = 0;\\n\\t\\tbool updated = true;\\n\\t\\twhile(updated){\\n\\t\\t\\tupdated = false;\\n\\n\\t\\t\\tfor(int j = 0; j < m; ++j){\\n\\t\\t\\t\\tfor(int k = i; k < n; ++k){\\n\\t\\t\\t\\t\\tif((intr[j] >> k & 1) == 0){\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tint a = odr[j][k], b = odr[j][k+1];\\n\\t\\t\\t\\t\\tif(stm[a] == -1LL && stm[b] != -1LL){\\n\\t\\t\\t\\t\\t\\tupdated = true;\\n\\t\\t\\t\\t\\t\\tstm[a] = stm[b] + D[j] * (S[b] - S[a]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(stm[a] != -1LL && stm[b] == -1LL){\\n\\t\\t\\t\\t\\t\\tupdated = true;\\n\\t\\t\\t\\t\\t\\tstm[b] = stm[a] + D[j] * (S[a] - S[b]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor(int j = i; stm[j] != -1LL; ++j)\\n\\t\\tfor(int k = j + 1; stm[k] != -1LL; ++k){\\n\\t\\t\\tif(S[j] <= S[k]){ continue; }\\n\\t\\t\\tLL ip = (stm[k] - stm[j]) / (S[j] - S[k]);\\n\\t\\t\\tif(ip < 0 || ip >= dist){ continue; }\\n\\t\\t\\tif((stm[k] - stm[j]) % (S[j] - S[k]) != 0){\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tint x = find(D.begin(), D.end(), ip) - D.begin();\\n\\t\\t\\tif(x >= m) return;\\n\\t\\t\\tint y = find(odr[x].begin(), odr[x].end(), j) - odr[x].begin();\\n\\t\\t\\tif(y >= n - 1 || odr[x][y+1] != k ||\\n\\t\\t\\t odr[x+1][y] != k || odr[x+1][y+1] != j){\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t--cnt;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint u = find(stm.begin(), stm.end(), -1LL) - stm.begin() - 1;\\t//[i,u]\\n\\t\\tint farv = odr[m][i], larv = odr[m][u];\\t//first/last arrival\\n\\t\\tLL lst1 = stm[u];\\n\\t\\tLL fft1 = S[farv] * dist + stm[farv];\\n\\t\\tLL lft1 = S[larv] * dist + stm[larv];\\n\\n\\t\\tfor(int j = i; j < u; ++j){\\n\\t\\t\\tif(stm[j] >= stm[j + 1]){ return; }\\n\\t\\t}\\n\\n\\t\\tLL offset;\\n\\t\\tif(lst0 + fft1 + 1 >= lft0){\\t//start as early as possible\\n\\t\\t\\toffset = lst0 + 1;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\toffset = lft0 - fft1;\\n\\t\\t}\\n\\t\\tlst0 = offset + lst1;\\n\\t\\tlft0 = offset + lft1;\\n\\n\\t\\ti = u;\\n\\t}\\n\\tif(cnt != 0) return;\\n\\n\\tans = min(ans, lft0);\\n}\\n\\nvoid solve(int i){\\n\\tif(i == m){\\n\\t\\tcalcans();\\n\\t}\\n\\telse{\\n\\t\\tfor(int j = 0; j < ptn.size(); ++j){\\n\\t\\t\\tintr[i] = ptn[j];\\n\\t\\t\\tsolve(i + 1);\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main(){\\n\\tcin >> dist >> n;\\n\\tS.resize(n);\\n\\n\\tfor(int i = 0; i < n; ++i){\\n\\t\\tcin >> S[i];\\n\\t}\\n\\tcin >> m;\\n\\tD.resize(m);\\n\\tintr.resize(m);\\n\\tfor(int i = 0; i < m; ++i){\\n\\t\\tcin >> D[i];\\n\\t}\\n\\tsort(D.begin(), D.end());\\n\\n\\tenumpattern(0, 0);\\n\\n\\tsolve(0);\\n\\n\\tcout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1228,\n \"score_of_the_acc\": -0.0104,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2427_491758\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <cstdlib>\\n#include <vector>\\n#include <map>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i< (int)(n); i++)\\n#define all(c) (c).begin(), (c).end()\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\nconst ll INF = (ll)1e12;\\n\\nll dist, n, m;\\nll S[10], D[10], T[10];\\n\\nbool check(int N, int *p){\\n //出発順が守られているか\\n vector<P> v;\\n rep(i, N + 1) v.push_back(P(p[i], T[i]));\\n sort(v.begin(), v.end());\\n rep(i, v.size() - 1) if(v[i+1].second <= v[i].second) return false;\\n \\n //少し広いところを同時に3つ以上の馬車が通るか\\n rep(i, m){\\n map<int, int> mp;\\n rep(j, N + 1) if(++mp[T[j] + D[i] * S[p[j]]] > 2) return false;\\n }\\n //狭いところですれ違うか\\n rep(i, N + 1)rep(j, N){\\n bool f = false;\\n rep(k, m) if(T[i] + S[p[i]] * D[k] == T[j] + S[p[j]] * D[k]) f = true;\\n if(f) continue;\\n if((T[i] - T[j]) * (T[i] - T[j] + (S[p[i]] - S[p[j]]) * dist) < 0) return false; \\n }\\n \\n return true;\\n}\\n\\nll dfs(int N, int *p){\\n ll res = INF;\\n if(N == n){\\n res = -INF;\\n rep(i, n) res = max(res, T[i] + S[p[i]] * dist);\\n //cout << res << \\\" \\\"<< *min_element(T, T + n) << endl;\\n return res - *min_element(T, T + n);\\n }\\n\\n //どの馬車ともすれ違わない場合と\\n ll lb = -INF;\\n ll ub = INF;\\n rep(i, N){\\n if(p[i] < p[N]){\\n lb = max(lb, T[i] + 1);\\n lb = max(lb, (T[i] + (S[p[i]] - S[p[N]]) * dist));\\n }else{\\n ub = min(ub, T[i] - 1);\\n ub = min(ub, (T[i] + (S[p[i]] - S[p[N]]) * dist));\\n }\\n }\\n if(lb <= ub){\\n T[N] = lb == -INF ? ub : lb;\\n res = min(res, dfs(N + 1, p));\\n }\\n \\n //各少し広いところで各でどの馬車とすれ違うかで探索\\n rep(i, m)rep(j, N){\\n T[N] = T[j] + (S[p[j]] - S[p[N]]) * D[i];\\n if(check(N, p)) res = min(res, dfs(N + 1, p));\\n }\\n return res;\\n}\\n\\nint main(){\\n ll res = INF;\\n int p[10];\\n cin >> dist >> n;\\n rep(i, n) cin >> S[i];\\n cin >> m;\\n rep(i, m) cin >> D[i];\\n rep(i, n) p[i] = i;\\n do{\\n T[0] = 0;\\n res = min(res, dfs(1, p));\\n }while(next_permutation(p, p + n));\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1196,\n \"score_of_the_acc\": -0.0087,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1388,"cells":{"group_id":{"kind":"string","value":"aoj_2428_cpp"},"problem_description":{"kind":"string","value":"失われし数\n時は3xxx年、高度に発達した文明は停滞期を迎えていた。歴史家たちはこの状況を打開しようと過去の叡智を学ぶことにした。注目したのはコンピュータ創世期の天才が残した資料である。この資料には計算式が書かれておりその計算結果が知りたいのだが、残念ながらその一部の文字が薄れて読めなくなっている。仕方がないので計算結果としてありえる最も大きい数を求めることにした。\n\n計算式は2進数で書かれており、演算は足し算・引き算・掛け算の3種類である。括弧も用いられているが括弧内が数字のみであることはない。正確には以下のBNFで定義された文法を満たしている必要がある。\n<expression> ::= <number> | <expression> <operation> <expression>\n| ( <expression> <operation> <expression> )\n<number> ::= <digit> | <number> <digit>\n<operation> ::= + | - | *\n<digit> ::= 0 | 1\n当時のコンピュータの計算能力の限界により、数字は0以上\n2\n10\n未満の整数であり計算中もこの範囲を出ることはない。ただし計算は括弧内を先に行い、掛け算は足し算・引き算より先に行う。それ以外の場合は左から順に計算する。\nInput\n入力は1行からなり、解読すべき数式が1つ与えられる。数式は1文字以上100文字以下である。1つの数式について最大5文字が読めなくなっていて、「.」で表現されている。与えられる数式に含まれる文字は01+-*().のいずれかである。\nConstraints\n数式は1文字以上100文字以下\n改行を除くすべての文字は01+-*().のいずれか\n.の個数は5個以下\nOutput\n元の数式として考えられるものの内、計算結果が最大となるものを求め、計算結果を10進法で出力せよ。読めなくなっている文字をどのように埋めても元の数式と考えられるものを作れないときは-1を出力せよ。\nSample Input 1\n000\nOutput for the Sample Input 1\n0\nSample Input 2\n0.0\nOutput for the Sample Input 2\n2\nSample Input 3\n...\nOutput for the Sample Input 3\n7\nSample Input 4\n(1.1)\nOutput for the Sample Input 4\n2\nSample Input 5\n0-1.\nOutput for the Sample Input 5\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2428_10854054","code_snippet":"#include <bits/stdc++.h>\n#include <stdlib.h>\nusing namespace std;\n\nusing ll = long long;\nusing pll = pair<ll, ll>;\n \nconstexpr ll M = 1e9+7;\n\nconst string w = \"01+-*()\";\n\nconstexpr int mi = 0;\nconstexpr int ma = 1023;\n\nbool isrange(int n) {\n return mi <= n && n <= ma;\n}\n\nint expr(string const& s, int& p);\nint term(string const& s, int& p);\nint factor(string const& s, int& p);\nint number(string const& s, int& p);\n\nint expr(string const& s, int& p) {\n int res = term(s, p);\n while(p < s.size() && (s[p] == '+' || s[p] == '-')) {\n if(s[p] == '+') {\n res += term(s, ++p);\n } else if(s[p] == '-') {\n res -= term(s, ++p);\n }\n if(!isrange(res)) {\n throw runtime_error(\"\");\n }\n }\n return res;\n}\n\nint term(string const& s, int& p) {\n int res = factor(s, p);\n while(p < s.size() && s[p] == '*') {\n res *= factor(s, ++p);\n if(!isrange(res)) {\n throw runtime_error(\"\");\n }\n }\n return res;\n}\n\nint factor(string const& s, int& p) {\n if(isdigit(s[p])) {\n return number(s, p);\n }\n if(s[p] == '-') {\n int res = -factor(s, ++p);\n if(!isrange(res)) {\n throw runtime_error(\"\");\n }\n return res;\n } else if(s[p] == '(') {\n int res = expr(s, ++p);\n if(p < s.size() && s[p] != ')') {\n throw runtime_error(\"\");\n }\n ++p;\n return res;\n } else {\n throw runtime_error(\"\");\n }\n}\n\nint number(string const& s, int& p) {\n int res = 0;\n while(p < s.size() && isdigit(s[p])) {\n res <<= 1;\n res |= s[p] == '1';\n ++p;\n }\n if(!isrange(res)) {\n throw runtime_error(\"\");\n }\n return res;\n}\n\nbool check(string const& s) {\n stack<int> st;\n vector<vector<bool>> par(s.size(), vector<bool>(s.size()));\n bool ok = true;\n for(int i=0; i<s.size(); ++i) {\n if(s[i] == '(') {\n st.push(i);\n }\n if(s[i] == ')') {\n if(st.empty()) {\n ok = false;\n break;\n }\n if(s[st.top()+1] == '(' && s[i-1] == ')' && par[st.top()+1][i-1]) {\n ok = false;\n break;\n }\n par[st.top()][i] = true;\n bool f = false;\n for(int j=st.top()+1; j<i; ++j) {\n f |= !isdigit(s[j]);\n }\n st.pop();\n ok &= f;\n }\n }\n return st.empty() && ok;\n}\n\nint solve(int i, string& s, vector<int> const& lost) {\n int res = -1;\n if(i == lost.size()) {\n try {\n int p = 0;\n if(check(s)) {\n res = expr(s, p);\n }\n return (p == s.size() ? res : -1);\n } catch(...) {\n return -1;\n }\n }\n for(int j=0; j<w.size(); ++j) {\n s[lost[i]] = w[j];\n res = max(res, solve(i+1, s, lost));\n }\n return res;\n}\n\nint main() {\n string s;\n cin >> s;\n vector<int> pos;\n for(int i=0; i<s.size(); ++i) {\n if(s[i] == '.') {\n pos.push_back(i);\n }\n }\n cout << solve(0, s, pos) << endl;\n}","accuracy":1,"time_ms":110,"memory_kb":3532,"score_of_the_acc":-1.0527,"final_rank":11},{"submission_id":"aoj_2428_10511877","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nbool isin(char c, string t) {\n\tfoa(e, t) if(c == e) return true;\n\treturn false;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\tstring C = \"01+-*()\";\n\n\tstring s; cin >> s;\n\tvector<int> vec;\n\tint n = s.size();\n\trep(i, n) {\n\t\tif(s[i] == '.') {\n\t\t\tvec.pb(i);\n\t\t}\n\t}\n\tint sz = vec.size();\n\tint ans = -1;\n\t\n\tauto solve = [&](string t) -> void {\n\t\tstring u = \"\";\n\t\tvector<string> v;\n\t\tint sum = -1;\n\t\tfoa(e, t) {\n\t\t\tif(e == '0' or e == '1') {\n\t\t\t\tif(sum == -1) sum = e - '0';\n\t\t\t\telse {\n\t\t\t\t\tsum *= 2;\n\t\t\t\t\tsum += e - '0';\n\t\t\t\t}\n\t\t\t\tif(sum >= 1024) return;\n\t\t\t} else {\n\t\t\t\tif(sum == -1) {\n\t\t\t\t\tu += e;\n\t\t\t\t\tv.push_back(string(1, e));\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tu += to_string(sum);\n\t\t\t\t\tv.pb(to_string(sum));\n\t\t\t\t\tsum = -1;\n\t\t\t\t\tu += e;\n\t\t\t\t\tv.push_back(string(1, e));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(sum >= 1024) return;\n\t\t}\n\t\t\n\t\tif(sum != -1) {\n\t\t\tu += to_string(sum);\n\t\t\tv.pb(to_string(sum));\n\t\t}\n\t\tint num = 0;\n\t\tfoa(e, u) {\n\t\t\tif(e == '(') num ++;\n\t\t\telse if(e == ')') {\n\t\t\t\tnum --;\n\t\t\t\tif(num < 0) return;\n\t\t\t}\n\t\t}\n\t\tif(num) return;\n\t\tint usz = u.size() - 1;\n\t\trep(i, usz) if(isin(u[i], \"*+-\") and isin(u[i + 1], \"*+-\")) return;\n\t\trep(i, usz) if(isin(u[i], \"*+-\") and isin(u[i + 1], \")\")) return;\n\t\trep(i, usz) if(isin(u[i], \"(\") and isin(u[i + 1], \"*+-\")) return;\n\t\trep(i, usz) if(isin(u[i], \")\") and isin(u[i + 1], \"(\")) return;\n\t\trep(i, usz) if(isin(u[i], \"(\") and isin(u[i + 1], \")\")) return;\n\n\t\tint szv = v.size();\n\t\trep(j, szv - 2) {\n\t\t\tif(isin(v[j][0], \"(\") and isin(v[j + 2][0], \")\")) return;\n\t\t}\n\t\tbool ng = 0;\n\t\tauto dfs = [&](auto dfs, int i, bool flag) -> pair<int, int> {\n\t\t\tint K = i;\n\t\t\tvector<char> a;\n\t\t\tvector<int> b;\n\t\t\tint p = -1;\n\t\t\twhile(i < szv and v[i] != \")\") {\n\t\t\t\tif(v[i] == \"(\") {\n\t\t\t\t\tauto [val, id] = dfs(dfs, i + 1, 1);\n\t\t\t\t\tif(!(0 <= val and val < 1024)) {\n\t\t\t\t\t\tng = 1;\n\t\t\t\t\t\tval = 0;\n\t\t\t\t\t}\n\t\t\t\t\ti = id + 1;\n\t\t\t\t\tif(p == 0) ng = 1;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tb.pb(val);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tassert(v[i] != \")\");\n\t\t\t\tif(isin(v[i][0], \"*+-\")) {\n\t\t\t\t\tif(p != 0) ng = 1;\n\t\t\t\t\tp = 1;\n\t\t\t\t\ta.pb(v[i][0]);\n\t\t\t\t} else {\n\t\t\t\t\tif(p == 0) ng = 1;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tb.pb(stoi(v[i]));\n\t\t\t\t}\n\t\t\t\ti ++;\n\t\t\t}\n\t\t\tvector<char> A;\n\t\t\tvector<int> B;\n\t\t\tint ss = a.size();\n\t\t\tif(flag and ss == 0) ng = 1;\n\t\t\tif(ss + 1 != (int)b.size()) {\n\t\t\t\tng = 1;\n\t\t\t\ta.clear();\n\t\t\t\tss = 0;\n\t\t\t\tb.pb(0);\n\t\t\t}\n\t\t\tB.pb(b[0]);\n\t\t\trep(j, ss) {\n\t\t\t\tif(a[j] == '*') {\n\t\t\t\t\tB.back() *= b[j + 1];\n\t\t\t\t\tif(B.back() >= 1024) {\n\t\t\t\t\t\tB.back() = 0;\n\t\t\t\t\t\tng = 1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tA.pb(a[j]);\n\t\t\t\t\tB.pb(b[j + 1]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tint sum = B[0];\n\t\t\tss = A.size();\n\t\t\trep(j, ss) {\n\t\t\t\tif(A[j] == '-') {\n\t\t\t\t\tsum -= B[j + 1];\n\t\t\t\t\tif(sum < 0 or sum >= 1024) {\n\t\t\t\t\t\tng = 1;\n\t\t\t\t\t\tsum = 0;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tsum += B[j + 1];\n\t\t\t\t\tif(sum < 0 or sum >= 1024) {\n\t\t\t\t\t\tng = 1;\n\t\t\t\t\t\tsum = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn {sum, i};\n\t\t};\n\t\tauto [val, i] = dfs(dfs, 0, 0);\n\t\tif(!ng) ans = max(ans, val);\n\t};\n\tauto dfs1 = [&](auto dfs1, int vec_i, string in) -> void {\n\t\tif(vec_i == sz) {\n\t\t\tstring t = s;\n\t\t\trep(i, sz) t[vec[i]] = in[i];\n\t\t\tsolve(t);\n\t\t\treturn;\n\t\t}\n\t\tfoa(e, C) {\n\t\t\tdfs1(dfs1, vec_i + 1, in + e);\n\t\t}\n\t};\n\tdfs1(dfs1, 0, \"\");\n\tcout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3548,"score_of_the_acc":-0.3693,"final_rank":2},{"submission_id":"aoj_2428_9773091","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\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; }\nusing i64 = long long;\nusing f64 = long double;\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\n\nint n, i;\nstring s;\nconstexpr int L = 1 << 10;\n#define RANGE if(not (0 <= res and res < L)) throw logic_error(\"! 0 <= x < L\")\n\nint expression();\nint term();\nint factor();\nint number();\n\nint expression() {\n int res = term(); RANGE;\n while(i < n) {\n if(s[i] == '+') {\n i++;\n res += term(); RANGE;\n } else if(s[i] == '-') {\n i++;\n res -= term(); RANGE;\n } else break;\n }\n return res;\n}\n\nint term() {\n int res = factor(); RANGE;\n while(i < n) {\n if(s[i] == '*') {\n i++;\n res *= factor(); RANGE;\n } else break;\n }\n return res;\n}\n\nint factor() {\n if(i == n) throw logic_error(\"index\");\n if(s[i] == '(') {\n i++;\n int res = expression(); RANGE;\n if(i == n or i < n and s[i] != ')') throw logic_error(\"braket\");\n i++;\n return res;\n } else if(isdigit(s[i])) {\n return number();\n } else {\n throw logic_error(\"symbol\");\n }\n}\n\nint number() {\n if(i == n) throw logic_error(\"index\");\n int res = 0;\n while(i < n and isdigit(s[i])) {\n res <<= 1;\n res += (s[i] - '0');\n RANGE;\n i++;\n }\n return res;\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n \n string org; cin >> org;\n n = org.size();\n int ans = -1;\n vector<int> I;\n rep(p, n) if(org[p] == '.') I.push_back(p);\n auto dfs = [&](auto&& dfs, int p) -> void {\n if(p == I.size()) {\n s = org;\n i = 0;\n\n try {\n int cur = expression();\n if(i != n) throw logic_error(\"i!=n\");\n bool value_only = [&] {\n vector<vector<char>> v = {{}};\n for(char c : org) {\n if(c == '(') {\n v.push_back({c});\n } else if(c == ')') {\n if(v.back().size() <= 1) return true;\n v.pop_back();\n } else if(not isdigit(c)) {\n v.back().push_back(c);\n }\n }\n return false;\n }();\n if(value_only) throw logic_error(\"value only\");\n chmax(ans, cur);\n // cout << org << \" \" << cur << \"\\n\";\n } catch(logic_error e) {\n // cout << org << \" \" << e.what() << \"\\n\";\n }\n return;\n }\n\n for(char c : {'0', '1', '+', '-', '*', '(', ')'}) {\n org[I[p]] = c;\n dfs(dfs, p + 1);\n org[I[p]] = '.';\n }\n }; dfs(dfs, 0);\n\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":60,"memory_kb":3580,"score_of_the_acc":-0.6949,"final_rank":7},{"submission_id":"aoj_2428_8483809","code_snippet":"#include <bits/stdc++.h>\n\nclass ParseError {};\n\nstruct Parser {\n using CopyIter = std::string::const_iterator;\n using Iter = CopyIter&;\n std::string line;\n\n Parser(std::string s): line(s) {}\n\n void skip(Iter it, char c) {\n if (*it != c) {\n throw ParseError();\n }\n // std::cerr << *it << ' ' << c << std::endl;\n assert(*it == c);\n ++it;\n }\n\n void check(int value) {\n if (!(0 <= value && value < (1 << 10))) {\n throw ParseError();\n }\n }\n\n void check() {\n std::vector<char> stack;\n for (auto c: line) {\n if (contain({'+', '-', '*', '('}, c)) {\n stack.push_back(c);\n } else if (c == ')') {\n if (stack.empty() || stack.back() == '(') {\n throw ParseError();\n }\n while (!stack.empty() && stack.back() != '(') stack.pop_back();\n if (stack.empty()) {\n throw ParseError();\n }\n assert(stack.back() == '(');\n stack.pop_back();\n }\n }\n }\n\n int plus(int lhs, int rhs) {\n check(lhs);\n check(rhs);\n check(lhs + rhs);\n return lhs + rhs;\n }\n\n int minus(int lhs, int rhs) {\n check(lhs);\n check(rhs);\n check(lhs - rhs);\n return lhs - rhs;\n }\n\n int mul(int lhs, int rhs) {\n check(lhs);\n check(rhs);\n check(lhs * rhs);\n return lhs * rhs;\n }\n\n bool contain(const std::vector<char>& set, char elem) {\n return std::find(set.begin(), set.end(), elem) != set.end();\n }\n\n int parse() {\n try {\n check();\n auto it = line.cbegin();\n auto res = expr(it);\n if (it == line.end()) return res;\n return -1;\n } catch(ParseError) {\n return -1;\n }\n }\n\n int expr(Iter it) {\n auto res = term(it);\n\n while (it != line.end() && contain({'+', '-'}, *it)) {\n if (*it == '+') {\n skip(it, '+');\n res = plus(res, term(it));\n } else {\n skip(it, '-');\n res = minus(res, term(it));\n }\n }\n\n return res;\n }\n\n int term(Iter it) {\n auto res = factor(it);\n\n while (it != line.end() && contain({'*'}, *it)) {\n skip(it, '*');\n res = mul(res, factor(it));\n }\n\n return res;\n }\n\n int factor(Iter it) {\n if (*it == '(') {\n skip(it, '(');\n auto res = expr(it);\n skip(it, ')');\n return res;\n }\n return number(it);\n }\n\n int number(Iter it) {\n int res = 0;\n if (!contain({'0', '1'}, *it)) {\n throw ParseError();\n }\n while (it != line.end() && contain({'0', '1'}, *it)) {\n char c = *it;\n skip(it, c);\n res = (res << 1) | (c - '0');\n check(res);\n }\n return res;\n }\n};\n\nint main() {\n constexpr int W = 7;\n const char alphabet[W] = {'+', '-', '*', '1', '0', '(', ')'};\n\n std::string line;\n std::cin >> line;\n\n std::vector<int> dot_index;\n for (int i = 0; i < (int)line.size(); i++) {\n if (line[i] == '.') {\n dot_index.push_back(i);\n }\n }\n assert(dot_index.size() <= 5);\n\n int n = dot_index.size();\n int m = 1;\n for (int i = 0; i < n; i++) m *= W;\n\n int ans = -1;\n for (int state = 0; state < m; state++) {\n int temp = state;\n for (int i = 0; i < n; i++) {\n line[dot_index[i]] = alphabet[temp % W];\n temp /= W;\n }\n Parser parser(line);\n ans = std::max(ans, parser.parse());\n }\n std::cout << ans << std::endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3520,"score_of_the_acc":-0.5076,"final_rank":4},{"submission_id":"aoj_2428_7219110","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 all(x) (x).begin(), (x).end()\n\nstring s;\nstring token = \"01+-*()\";\n\nvoid check(bool f) {\n if (!f) throw runtime_error(\"hello\");\n}\n\nint evaluate();\npair<int, int> expr(int k, bool paren);\npair<int, int> number(int k);\n\nint fix_unknown(int k) {\n if (k == (int)s.size()) {\n // cerr << s << \": \";\n int ans;\n try {\n ans = evaluate();\n } catch (...) {\n ans = -1;\n }\n // cerr << ans << endl;\n return ans;\n }\n if (s[k] != '.') {\n return fix_unknown(k+1);\n }\n int ret = -1;\n for (char c : token) {\n s[k] = c;\n ret = max(ret, fix_unknown(k+1));\n }\n s[k] = '.';\n return ret;\n}\n\nint evaluate() {\n auto [x, k] = expr(0, false);\n check(k == (int)s.size());\n return x;\n}\n\nbool is_op(char c) {\n return c == '+' || c == '-' || c == '*';\n}\n\npair<int, int> expr(int k, bool paren) {\n // cout << \"expr: \" << k << \" \" << need_op << endl;\n int x = 0;\n int term = 0;\n bool first = true;\n bool use_op = false;\n while (k < (int)s.size() && s[k] != ')') {\n\n char op = '+';\n\n if (!first) {\n check(is_op(s[k]));\n op = s[k++];\n use_op = true;\n }\n first = false;\n\n int y;\n if (s[k] == '(') {\n ++k;\n tie(y, k) = expr(k, true);\n check(k >= 0 && s[k] == ')');\n ++k;\n } else {\n tie(y, k) = number(k);\n check(k >= 0);\n }\n\n if (op == '*') {\n term *= y;\n check(abs(term) < (1<<10));\n } else {\n x += term;\n check(0 <= x && x < (1<<10));\n term = y;\n if (op == '-') term *= -1;\n }\n }\n check(!first);\n x += term;\n check(0 <= x && x < (1<<10));\n if (paren) check(use_op);\n return {x, k};\n}\n\npair<int, int> number(int k) {\n // cout << \"number: \" << k << endl;\n check(s[k] == '0' || s[k] == '1');\n int n = 0;\n while (k < (int) s.size() && (s[k] == '0' || s[k] == '1')) {\n n = 2*n + (s[k]-'0');\n check(0 <= n && n < (1<<10));\n ++k;\n }\n return {n, k};\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n\n cin >> s;\n cout << fix_unknown(0) << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3540,"score_of_the_acc":-0.5187,"final_rank":5},{"submission_id":"aoj_2428_5255132","code_snippet":"#include <iostream>\n#include <string>\n\nusing namespace std;\n\nstruct Parser {\n static void check(int x) {\n if (x < 0 || (1 << 10) <= x) throw(0);\n }\n\n string s;\n int i;\n bool simple;\n\n explicit Parser(const string& s) : s(s), i(0), simple(true) {\n this->s.push_back('$');\n }\n\n int expr() {\n auto ret = term();\n\n while (s[i] == '+' || s[i] == '-') {\n simple = false;\n char op = s[i];\n\n ++i;\n auto x = term();\n\n if (op == '+') {\n ret += x;\n } else {\n ret -= x;\n }\n check(ret);\n }\n\n return ret;\n }\n\n int term() {\n auto ret = factor();\n\n while (s[i] == '*') {\n simple = false;\n\n ++i;\n auto x = factor();\n\n ret *= x;\n check(ret);\n }\n\n return ret;\n }\n\n int factor() {\n if (s[i] == '(') {\n ++i;\n\n auto ps = simple;\n simple = true;\n\n auto ret = expr();\n if (s[i] != ')' || simple) throw(0);\n ++i;\n\n simple = ps;\n return ret;\n\n } else {\n return number();\n }\n }\n\n int number() {\n if (!isdigit(s[i])) throw(0);\n\n int ret = 0;\n while (isdigit(s[i])) {\n ret = (ret << 1) + (s[i++] - '0');\n check(ret);\n }\n return ret;\n }\n\n int parse() {\n i = 0;\n simple = true;\n\n try {\n auto ret = expr();\n return s[i] == '$' ? ret : -1;\n } catch (int t) {\n return -1;\n }\n }\n};\n\nconst string ops{\"01+-*()\"};\n\nvoid solve() {\n string s;\n cin >> s;\n int n = s.length();\n Parser p(s);\n\n int ans = -1;\n auto dfs = [&](auto&& f) -> void {\n int i = 0;\n while (i < n && p.s[i] != '.') ++i;\n\n if (i < n) {\n for (char c : ops) {\n p.s[i] = c;\n f(f);\n }\n p.s[i] = '.';\n } else {\n ans = max(ans, p.parse());\n }\n };\n dfs(dfs);\n\n cout << ans << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3564,"score_of_the_acc":-0.3783,"final_rank":3},{"submission_id":"aoj_2428_4356485","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmax(T& a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate<class T>\nbool chmin(T& a, const T& b) {\n if (b < a) { a = b; return true; }\n return false;\n}\n\n// std::vector Declaration\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\n\n// std::vector Declaration and Initialization\ntemplate<typename T>\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\ntemplate<typename T, typename U, typename... Ts>\nauto make_vector(size_t a, U b, Ts... ts) {\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\n}\n\n// std::vector Input\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (auto &e : v) is >> e;\n return is;\n}\n\n// std::vector Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::array Debug\ntemplate<typename T, size_t n>\nostream& operator<<(ostream& os, const array<T, n>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::deque Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const deque<T>& d) {\n os << \"[\";\n bool a = 1;\n for (auto e : d) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::pair Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << \"(\" << p.first << \" \" << p.second << \")\";\n return os;\n}\n\n// std::set Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const set<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::multiset Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const multiset<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::map Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const map<T, U>& mp) {\n os << \"{\";\n bool a = 1;\n for (auto e : mp) {\n os << (a ? \"\" : \" \");\n os << e.first << \":\" << e.second;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::tuple Debug\ntemplate<int N, class Tuple>\nvoid out(ostream& os, const Tuple& t){}\ntemplate<int N, class Tuple, class H, class ...Ts>\nvoid out(ostream& os, const Tuple& t) {\n if (N) os << \" \";\n os << get<N>(t);\n out<N+1,Tuple,Ts...>(os, t);\n}\ntemplate<class ...Ts>\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\n os << \"(\";\n out<0,tuple<Ts...>,Ts...>(os, t);\n os << \")\";\n return os;\n}\n\n// Debug\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n\n// Weighted edge\ntemplate<typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge() {}\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n friend ostream& operator<<(ostream& os, const edge& e) {\n return os << \"(\" << e.src << \"->\" << e.to << \":\" << e.cost << \")\";\n }\n};\n\nusing LL = int64_t;\n\n#define fs first\n#define sc second\n\nconst int64_t MOD = 1e9+7;\n\nusing State = string::const_iterator;\nclass ParseError {};\n\nint number(State& begin) {\n int ret = 0;\n while (*begin == '0' or *begin == '1') {\n ret <<= 1;\n ret += (*begin - '0');\n if (ret < 0 or 1<<10 <= ret) {\n throw ParseError();\n }\n ++begin;\n }\n return ret;\n}\n\npair<int,int> expression(State& begin);\n\nint factor(State& begin) {\n if (*begin == '(') {\n ++begin;\n int ret, cnt; tie(ret, cnt) = expression(begin);\n if (cnt == 0) {\n throw ParseError();\n }\n if (ret < 0 or 1<<10 <= ret) {\n throw ParseError();\n }\n if (*begin != ')') {\n throw ParseError();\n }\n ++begin;\n return ret;\n } else if (*begin == '0' or *begin == '1') {\n return number(begin);\n } else {\n throw ParseError();\n }\n}\n\npair<int,int> term(State& begin) {\n int prod = 1, cnt = 0;\n while (true) {\n prod *= factor(begin);\n if (prod < 0 or 1<<10 <= prod) {\n throw ParseError();\n }\n if (*begin != '*') {\n return { prod, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\npair<int,int> expression(State& begin) {\n int sum = 0, cnt = 0;\n int plus = 1;\n while (true) {\n int s, c; tie(s, c) = term(begin);\n sum += s * plus;\n cnt += c;\n if (sum < 0 or 1<<10 <= sum) {\n throw ParseError();\n }\n if (*begin == '+') {\n plus = 1;\n } else if (*begin == '-') {\n plus = -1;\n } else {\n return { sum, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\nvoid test_number() {\n string s = \"1010\";\n State begin = s.begin();\n assert(number(begin) == 10);\n}\nvoid test() {\n //string s = \"1+10*10+10*(10+10+1)\";\n //State begin = s.begin();\n //assert(expression(begin).first == 15);\n string s = \"(1+1+1)\";\n State begin = s.begin();\n assert(expression(begin).first == 3);\n}\n\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n\n test_number();\n test();\n\n string s; cin >> s;\n vector<int> unknown;\n for (int i = 0; i < s.size(); ++i) {\n if (s[i] == '.') {\n unknown.push_back(i);\n }\n }\n\n int m = unknown.size();\n\n vector<int> a(m+1);\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\n\n int ans = numeric_limits<int>::min();\n\n while (!a[m]) {\n\n string t = s;\n for (int i = 0; i < m; ++i) {\n t[unknown[i]] = ch[a[i]];\n }\n\n State begin = t.begin();\n try {\n int val = expression(begin).first;\n if (*begin == '\\0') {\n chmax(ans, val);\n }\n } catch (const ParseError& e) {\n }\n\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\n }\n\n cout << (ans == numeric_limits<int>::min() ? -1 : ans) << endl;\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3280,"score_of_the_acc":-0.5275,"final_rank":6},{"submission_id":"aoj_2428_4356475","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmax(T& a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate<class T>\nbool chmin(T& a, const T& b) {\n if (b < a) { a = b; return true; }\n return false;\n}\n\n// std::vector Declaration\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\n\n// std::vector Declaration and Initialization\ntemplate<typename T>\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\ntemplate<typename T, typename U, typename... Ts>\nauto make_vector(size_t a, U b, Ts... ts) {\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\n}\n\n// std::vector Input\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (auto &e : v) is >> e;\n return is;\n}\n\n// std::vector Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::array Debug\ntemplate<typename T, size_t n>\nostream& operator<<(ostream& os, const array<T, n>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::deque Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const deque<T>& d) {\n os << \"[\";\n bool a = 1;\n for (auto e : d) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::pair Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << \"(\" << p.first << \" \" << p.second << \")\";\n return os;\n}\n\n// std::set Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const set<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::multiset Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const multiset<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::map Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const map<T, U>& mp) {\n os << \"{\";\n bool a = 1;\n for (auto e : mp) {\n os << (a ? \"\" : \" \");\n os << e.first << \":\" << e.second;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::tuple Debug\ntemplate<int N, class Tuple>\nvoid out(ostream& os, const Tuple& t){}\ntemplate<int N, class Tuple, class H, class ...Ts>\nvoid out(ostream& os, const Tuple& t) {\n if (N) os << \" \";\n os << get<N>(t);\n out<N+1,Tuple,Ts...>(os, t);\n}\ntemplate<class ...Ts>\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\n os << \"(\";\n out<0,tuple<Ts...>,Ts...>(os, t);\n os << \")\";\n return os;\n}\n\n// Debug\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n\n// Weighted edge\ntemplate<typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge() {}\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n friend ostream& operator<<(ostream& os, const edge& e) {\n return os << \"(\" << e.src << \"->\" << e.to << \":\" << e.cost << \")\";\n }\n};\n\nusing LL = int64_t;\n\n#define fs first\n#define sc second\n\nconst int64_t MOD = 1e9+7;\n\nusing State = string::const_iterator;\nclass ParseError {};\n\nint number(State& begin) {\n int ret = 0;\n while (*begin == '0' or *begin == '1') {\n ret <<= 1;\n ret += (*begin - '0');\n if (ret >= 1<<10) {\n throw ParseError();\n }\n ++begin;\n }\n return ret;\n}\n\npair<int,int> expression(State& begin);\n\nint factor(State& begin) {\n if (*begin == '(') {\n ++begin;\n int ret, cnt; tie(ret, cnt) = expression(begin);\n if (cnt == 0) {\n throw ParseError();\n }\n if (ret >= 1<<10) {\n throw ParseError();\n }\n if (*begin != ')') {\n throw ParseError();\n }\n ++begin;\n return ret;\n } else if (*begin == '0' or *begin == '1') {\n return number(begin);\n } else {\n throw ParseError();\n }\n}\n\npair<int,int> term(State& begin) {\n int prod = 1, cnt = 0;\n while (true) {\n prod *= factor(begin);\n if (prod >= 1<<10) {\n throw ParseError();\n }\n if (*begin != '*') {\n return { prod, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\npair<int,int> expression(State& begin) {\n int sum = 0, cnt = 0;\n int plus = 1;\n while (true) {\n int s, c; tie(s, c) = term(begin);\n sum += s * plus;\n cnt += c;\n if (sum >= 1<<10) {\n throw ParseError();\n }\n if (*begin == '+') {\n plus = 1;\n } else if (*begin == '-') {\n plus = -1;\n } else {\n return { sum, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\nvoid test_number() {\n string s = \"1010\";\n State begin = s.begin();\n assert(number(begin) == 10);\n}\nvoid test() {\n //string s = \"1+10*10+10*(10+10+1)\";\n //State begin = s.begin();\n //assert(expression(begin).first == 15);\n string s = \"(1+1+1)\";\n State begin = s.begin();\n assert(expression(begin).first == 3);\n}\n\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n\n test_number();\n test();\n\n string s; cin >> s;\n vector<int> unknown;\n for (int i = 0; i < s.size(); ++i) {\n if (s[i] == '.') {\n unknown.push_back(i);\n }\n }\n\n int m = unknown.size();\n\n vector<int> a(m+1);\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\n\n int ans = numeric_limits<int>::min();\n\n while (!a[m]) {\n\n string t = s;\n for (int i = 0; i < m; ++i) {\n t[unknown[i]] = ch[a[i]];\n }\n\n State begin = t.begin();\n try {\n int val = expression(begin).first;\n if (*begin == '\\0') {\n chmax(ans, val);\n }\n } catch (const ParseError& e) {\n }\n\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.11678832116788321,"time_ms":50,"memory_kb":3280,"score_of_the_acc":-0.4505,"final_rank":15},{"submission_id":"aoj_2428_4356459","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmax(T& a, const T& b) {\n if (a < b) { a = b; return true; }\n return false;\n}\ntemplate<class T>\nbool chmin(T& a, const T& b) {\n if (b < a) { a = b; return true; }\n return false;\n}\n\n// std::vector Declaration\ntemplate<typename T>\nvector<T> make_v(size_t a) { return vector<T>(a); }\ntemplate<typename T, typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\n}\n\n// std::vector Declaration and Initialization\ntemplate<typename T>\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\ntemplate<typename T, typename U, typename... Ts>\nauto make_vector(size_t a, U b, Ts... ts) {\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\n}\n\n// std::vector Input\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n for (auto &e : v) is >> e;\n return is;\n}\n\n// std::vector Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::array Debug\ntemplate<typename T, size_t n>\nostream& operator<<(ostream& os, const array<T, n>& v) {\n os << \"[\";\n bool a = 1;\n for (auto e : v) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::deque Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const deque<T>& d) {\n os << \"[\";\n bool a = 1;\n for (auto e : d) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"]\";\n return os;\n}\n\n// std::pair Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << \"(\" << p.first << \" \" << p.second << \")\";\n return os;\n}\n\n// std::set Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const set<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::multiset Debug\ntemplate<typename T>\nostream& operator<<(ostream& os, const multiset<T>& st) {\n os << \"{\";\n bool a = 1;\n for (auto e : st) {\n os << (a ? \"\" : \" \");\n os << e;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::map Debug\ntemplate<typename T, typename U>\nostream& operator<<(ostream& os, const map<T, U>& mp) {\n os << \"{\";\n bool a = 1;\n for (auto e : mp) {\n os << (a ? \"\" : \" \");\n os << e.first << \":\" << e.second;\n a = 0;\n }\n os << \"}\";\n return os;\n}\n\n// std::tuple Debug\ntemplate<int N, class Tuple>\nvoid out(ostream& os, const Tuple& t){}\ntemplate<int N, class Tuple, class H, class ...Ts>\nvoid out(ostream& os, const Tuple& t) {\n if (N) os << \" \";\n os << get<N>(t);\n out<N+1,Tuple,Ts...>(os, t);\n}\ntemplate<class ...Ts>\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\n os << \"(\";\n out<0,tuple<Ts...>,Ts...>(os, t);\n os << \")\";\n return os;\n}\n\n// Debug\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n\n// Weighted edge\ntemplate<typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge() {}\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\n\n friend ostream& operator<<(ostream& os, const edge& e) {\n return os << \"(\" << e.src << \"->\" << e.to << \":\" << e.cost << \")\";\n }\n};\n\nusing LL = int64_t;\n\n#define fs first\n#define sc second\n\nconst int64_t MOD = 1e9+7;\n\nusing State = string::const_iterator;\nclass ParseError {};\n\nint number(State& begin) {\n int ret = 0;\n while (*begin == '0' or *begin == '1') {\n ret <<= 1;\n ret += (*begin - '0');\n ++begin;\n }\n return ret;\n}\n\npair<int,int> expression(State& begin);\n\nint factor(State& begin) {\n if (*begin == '(') {\n ++begin;\n int ret, cnt; tie(ret, cnt) = expression(begin);\n if (cnt == 0) {\n throw ParseError();\n }\n if (*begin != ')') {\n throw ParseError();\n }\n ++begin;\n return ret;\n } else if (*begin == '0' or *begin == '1') {\n return number(begin);\n } else {\n throw ParseError();\n }\n}\n\npair<int,int> term(State& begin) {\n int prod = 1, cnt = 0;\n while (true) {\n prod *= factor(begin);\n if (*begin != '*') {\n return { prod, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\npair<int,int> expression(State& begin) {\n int sum = 0, cnt = 0;\n int plus = 1;\n while (true) {\n int s, c; tie(s, c) = term(begin);\n sum += s * plus;\n cnt += c;\n if (*begin == '+') {\n plus = 1;\n } else if (*begin == '-') {\n plus = -1;\n } else {\n return { sum, cnt };\n }\n ++cnt;\n ++begin;\n }\n}\n\nvoid test_number() {\n string s = \"1010\";\n State begin = s.begin();\n assert(number(begin) == 10);\n}\nvoid test() {\n //string s = \"1+10*10+10*(10+10+1)\";\n //State begin = s.begin();\n //assert(expression(begin).first == 15);\n string s = \"(1+1+1)\";\n State begin = s.begin();\n assert(expression(begin).first == 3);\n}\n\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n\n test_number();\n test();\n\n string s; cin >> s;\n vector<int> unknown;\n for (int i = 0; i < s.size(); ++i) {\n if (s[i] == '.') {\n unknown.push_back(i);\n }\n }\n\n int m = unknown.size();\n\n vector<int> a(m+1);\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\n\n int ans = numeric_limits<int>::min();\n\n while (!a[m]) {\n\n string t = s;\n for (int i = 0; i < m; ++i) {\n t[unknown[i]] = ch[a[i]];\n }\n\n State begin = t.begin();\n try {\n int val = expression(begin).first;\n if (*begin == '\\0') {\n chmax(ans, val);\n }\n } catch (const ParseError& e) {\n }\n\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.043795620437956206,"time_ms":50,"memory_kb":3228,"score_of_the_acc":-0.4215,"final_rank":18},{"submission_id":"aoj_2428_4275403","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-5L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\n// geometry library\n\ntypedef complex<long double> Point;\ntypedef pair<complex<long double>, complex<long double>> Line;\n\ntypedef struct Circle {\n complex<long double> center;\n long double r;\n}Circle;\n\n//内積、 dot(a,b) = |a||b|cos()\nlong double dot(Point a, Point b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n//外積、cross(a,b) = |a||b|sin()\nlong double cross(Point a, Point b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\n//線分と点の距離\nlong double Dist_Line_Point(Line a, Point b) {\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\n}\n\n//線分の交差判定\nint is_intersected_ls(Line a, Line b) {\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < eps) &&\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < eps);\n}\n\n//線分の交点\nPoint intersection_l(Line a, Line b) {\n Point da = a.second - a.first;\n Point db = b.second - b.first;\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\n}\n\n//線分と線分の距離\nlong double Dist_Line_Line(Line a, Line b) {\n if (is_intersected_ls(a, b) == 1) {\n return 0;\n }\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\n}\n\n//円と円の交点\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\n long double dist = abs(a.center - b.center);\n assert(dist <= eps + a.r + b.r);\n assert(dist+eps >= abs(a.r - b.r));\n Point target = b.center - a.center;\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\n long double aa = pointer + a.r * a.r - b.r * b.r;\n aa /= 2.0L;\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\n r = r + a.center;\n l = l + a.center;\n return mp(l, r);\n}\n\n//end of geometry\n\ntemplate<typename A>\nA pows(A val, ll b) {\n assert(b >= 1);\n A ans = val;\n b--;\n while (b) {\n if (b % 2) {\n ans *= val;\n }\n val *= val;\n b /= 2LL;\n }\n return ans;\n}\n\ntemplate<typename A>\nclass Compressor {\npublic:\n bool is_zipped = false;\n map<A, ll> zipper;\n map<ll, A> unzipper;\n queue<A> fetcher;\n Compressor(){\n is_zipped = false;\n zipper.clear();\n unzipper.clear();\n }\n void add(A now) {\n assert(is_zipped == false);\n zipper[now] = 1;\n fetcher.push(now);\n }\n void exec() {\n assert(is_zipped == false);\n int cnt = 0;\n for (auto i = zipper.begin(); i != zipper.end(); ++i) {\n i->second = cnt;\n unzipper[cnt] = i->first;\n cnt++;\n }\n is_zipped = true;\n }\n ll fetch() {\n assert(is_zipped == true);\n A hoge = fetcher.front();\n fetcher.pop();\n return zipper[hoge];\n }\n ll zip(A now) {\n assert(is_zipped == true);\n assert(zipper.find(now) != zipper.end());\n return zipper[now];\n }\n A unzip(ll a) {\n assert(is_zipped == true);\n assert(a < unzipper.size());\n return unzipper[a];\n }\n ll next(A now) {\n auto x = zipper.upper_bound(now);\n if (x == zipper.end()) return zipper.size();\n return (ll)((*x).second);\n }\n ll back(A now) {\n auto x = zipper.lower_bound(now);\n if (x == zipper.begin()) return -1;\n x--;\n return (ll)((*x).second);\n }\n};\n\ntemplate<typename A>\nclass Matrix {\npublic:\n vector<vector<A>> data;\n Matrix(vector<vector<A>> a) :data(a){\n\n }\n Matrix operator + (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data.size());\n assert(obj.data[0].size() == this->data[0].size());\n REP(i, obj.data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[i].size()) {\n A hoge = obj.data[i][q] + (this -> data[i][q]);\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix operator - (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data.size());\n assert(obj.data[0].size() == this->data[0].size());\n REP(i, obj.data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[i].size()) {\n A hoge = this->data[i][q] - obj.data[i][q];\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix operator * (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data[0].size());\n REP(i, this -> data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[0].size()) {\n A hoge = (this -> data[i][0]) * (obj.data[0][q]);\n for(int t = 1;t < obj.data[i].size();++t){\n hoge += this -> data[i][t] * obj.data[t][q];\n }\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix &operator *= (const Matrix obj) {\n *this = (*this * obj);\n return *this;\n }\n Matrix& operator += (const Matrix obj) {\n *this = (*this + obj);\n return *this;\n }\n Matrix& operator -= (const Matrix obj) {\n *this = (*this - obj);\n return *this;\n }\n};\n\nclass modint {\npublic:\n using u64 = std::uint_fast64_t;\n u64 value = 0;\n u64 mod;\n modint(ll a, ll b): value(((a%b) + 2 * b) % b),mod(b) {\n\n }\n modint operator+(const modint rhs) const{\n return modint(*this) += rhs;\n }\n modint operator-(const modint rhs) const{\n return modint(*this) -= rhs;\n }\n modint operator*(const modint rhs) const {\n return modint(*this) *= rhs;\n }\n modint operator/(const modint rhs) const{\n return modint(*this) /= rhs;\n }\n modint& operator+=(const modint rhs) {\n assert(rhs.mod == mod);\n value += rhs.value;\n if (value >= mod) {\n value -= mod;\n }\n return *this;\n }\n modint& operator-=(const modint rhs) {\n assert(rhs.mod == mod);\n if (value < rhs.value) {\n value += mod;\n }\n value -= rhs.value;\n return *this;\n }\n modint& operator*=(const modint rhs) {\n assert(rhs.mod == mod);\n value = (value * rhs.value) % mod;\n return *this;\n }\n modint& operator/=(modint rhs) {\n assert(rhs.mod == mod);\n ll rem = mod - 2;\n while (rem) {\n if (rem % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n rem /= 2LL;\n }\n return *this;\n }\n bool operator <(modint rhs) const{\n return value < rhs.value;\n }\n friend ostream& operator<<(ostream& os, modint& p) {\n os << p.value;\n return (os);\n }\n};\n\nclass Dice {\npublic:\n vector<ll> vertexs;\n //Up: 0,Left: 1,Center: 2,Right: 3,Adj: 4, Down: 5\n Dice(vector<ll> init):vertexs(init){\n \n }\n //Look from Center\n void RtoL() {\n for (int q = 1; q < 4; ++q) {\n swap(vertexs[q], vertexs[q + 1]);\n }\n }\n void LtoR() {\n for (int q = 3; q >= 1; --q) {\n swap(vertexs[q], vertexs[q + 1]);\n }\n }\n void UtoD() {\n swap(vertexs[5], vertexs[4]);\n swap(vertexs[2], vertexs[5]);\n swap(vertexs[0], vertexs[2]);\n }\n void DtoU() {\n swap(vertexs[0], vertexs[2]);\n swap(vertexs[2], vertexs[5]);\n swap(vertexs[5], vertexs[4]);\n }\n bool ReachAble(Dice now) {\n set<Dice> hoge;\n queue<Dice> next;\n next.push(now);\n hoge.insert(now);\n while (next.empty() == false) {\n Dice seeing = next.front();\n next.pop();\n if (seeing == *this) return true;\n seeing.RtoL();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.LtoR();\n seeing.LtoR();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.RtoL();\n seeing.UtoD();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.DtoU();\n seeing.DtoU();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n }\n return false;\n }\n bool operator ==(const Dice& a) {\n for (int q = 0; q < 6; ++q) {\n if (a.vertexs[q] != (*this).vertexs[q]) {\n return false;\n }\n }\n return true;\n }\n bool operator <(const Dice& a) const{\n return (*this).vertexs < a.vertexs;\n }\n};\n\npair<Dice, Dice> TwoDimDice(int center, int up) {\n int target = 1;\n while (true) {\n if (center != target && 7 - center != target && up != target && 7 - up != target) {\n break;\n }\n target++;\n }\n return mp(Dice(vector<ll>{up, target, center, 7 - target, 7 - center, 7 - up}), Dice(vector<ll>{up, 7 - target, center, target, 7 - center, 7 - up}));\n}\n\ntuple<Dice, Dice, Dice, Dice> OneDimDice(int center) {\n int bo = min(center, 7 - center);\n pair<int, int> goa;\n if (bo == 1) {\n goa = mp(2, 3);\n }\n else if (bo == 2) {\n goa = mp(1, 3);\n }\n else if(bo == 3){\n goa = mp(1, 2);\n }\n tuple<Dice, Dice, Dice, Dice> now = make_tuple(Dice(vector<ll>{goa.first,goa.second,center,7 - goa.second,7-center,7 - goa.first}), \n Dice(vector<ll>{goa.first, 7 - goa.second, center, goa.second, 7 - center, 7 - goa.first}),\n Dice(vector<ll>{7 - goa.first, goa.second, center, 7 - goa.second, 7 - center, goa.first}),\n Dice(vector<ll>{7 - goa.first, 7 - goa.second, center, goa.second, 7 - center, goa.first}));\n return now;\n}\n\ntemplate<typename A,typename B>\nclass Dijkstra {\npublic:\n vector<vector<pair<int, A>>> vertexs;\n B Cost_Function;\n Dijkstra(int n, B cost) : Cost_Function(cost){\n vertexs = vector<vector<pair<int, A>>>(n, vector<pair<int, A>>{});\n }\n ~Dijkstra() {\n vertexs.clear();\n }\n void add_edge(int a, int b, A c) {\n vertexs[a].push_back(mp(b, c));\n }\n vector<ll> build_result(int StartPoint) {\n vector<ll> dist(vertexs.size(), 2e18);\n dist[StartPoint] = 0;\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> next;\n next.push(make_pair(0, StartPoint));\n while (next.empty() == false) {\n pair<ll, int> now = next.top();\n next.pop();\n if (dist[now.second] != now.first) continue;\n for (auto x : vertexs[now.second]) {\n ll now_cost = now.first + Cost_Function(x.second);\n if (dist[x.first] > now_cost) {\n dist[x.first] = now_cost;\n next.push(mp(now_cost, x.first));\n }\n }\n }\n return dist;\n }\n};\n\nclass Dinic {\npublic:\n struct edge {\n int to;\n int cap;\n int rev;\n };\n vector<vector<edge>> Graph;\n vector<int> level;\n vector<int> itr;\n Dinic(int n){\n Graph = vector<vector<edge>>(n, vector<edge>());\n }\n void add_edge(int a, int b, int cap) {\n Graph[a].push_back(edge{ b, cap ,(int)Graph[b].size() });\n Graph[b].push_back(edge{ a,0,(int)Graph[a].size() - 1 });\n }\n void bfs(int s) {\n level = vector<int>(Graph.size(), -1);\n level[s] = 0;\n queue<int> next;\n next.push(s);\n while (next.empty() == false) {\n int now = next.front();\n next.pop();\n for (auto x : Graph[now]) {\n if (x.cap == 0) continue;\n if (level[x.to] == -1) {\n level[x.to] = level[now] + 1;\n next.push(x.to);\n }\n }\n }\n }\n int dfs(int now, int goal, int val) {\n if (goal == now) return val;\n for (int& i = itr[now]; i < (int)Graph[now].size(); ++i) {\n edge& target = Graph[now][i];\n if (target.cap > 0&&level[now] < level[target.to]) {\n int d = dfs(target.to, goal, min(val, target.cap));\n if (d > 0) {\n target.cap -= d;\n Graph[target.to][target.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n int run(int s,int t) {\n int ans = 0;\n int f = 0;\n while (bfs(s), level[t] >= 0) {\n itr = vector<int>(Graph.size(), 0);\n while ((f = dfs(s, t, 1e9)) > 0) {\n ans += f;\n }\n }\n return ans;\n }\n};\n\n//by ei1333\n//https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html\ntemplate< typename Monoid >\nstruct SegmentTree {\n using F = function< Monoid(Monoid, Monoid) >;\n\n int sz;\n vector< Monoid > seg;\n\n const F f;\n const Monoid M1;\n\n SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\n sz = 1;\n while (sz < n) sz <<= 1;\n seg.assign(2 * sz + 1, M1);\n }\n\n void set(int k, const Monoid& x) {\n seg[k + sz] = x;\n }\n\n void build() {\n for (int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void update(int k, const Monoid& x) {\n k += sz;\n seg[k] = x;\n while (k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n Monoid query(int a, int b) {\n Monoid L = M1, R = M1;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) L = f(L, seg[a++]);\n if (b & 1) R = f(seg[--b], R);\n }\n return f(L, R);\n }\n\n Monoid operator[](const int& k) const {\n return seg[k + sz];\n }\n\n template< typename C >\n int find_subtree(int a, const C& check, Monoid& M, bool type) {\n while (a < sz) {\n Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\n if (check(nxt)) a = 2 * a + type;\n else M = nxt, a = 2 * a + 1 - type;\n }\n return a - sz;\n }\n\n\n template< typename C >\n int find_first(int a, const C& check) {\n Monoid L = M1;\n if (a <= 0) {\n if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\n return -1;\n }\n int b = sz;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) {\n Monoid nxt = f(L, seg[a]);\n if (check(nxt)) return find_subtree(a, check, L, false);\n L = nxt;\n ++a;\n }\n }\n return -1;\n }\n\n template< typename C >\n int find_last(int b, const C& check) {\n Monoid R = M1;\n if (b >= sz) {\n if (check(f(seg[1], R))) return find_subtree(1, check, R, true);\n return -1;\n }\n int a = sz;\n for (b += sz; a < b; a >>= 1, b >>= 1) {\n if (b & 1) {\n Monoid nxt = f(seg[--b], R);\n if (check(nxt)) return find_subtree(b, check, R, true);\n R = nxt;\n }\n }\n return -1;\n }\n};\n\nvoid init() {\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\n\nunsigned long xor128() {\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n unsigned long t = (x ^ (x << 11));\n x = y; y = z; z = w;\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\n#define int ll\nint num(State& now) {\n int ans = 0;\n while (*now == '0' || *now == '1') {\n ans *= 2LL;\n ans += *now - '0';\n if (ans >= (1 << 10)) {\n return -1;\n }\n now++;\n }\n return ans;\n}\n\nint calc(State& now) {\n int ans = 0;\n int next_req = 1;\n if (*now == '0' || *now == '1') {\n ans = num(now);\n if (ans == -1) return -1;\n }\n else if (*now == '(') {\n now++;\n ans = calc(now);\n if (ans == -1) return -1;\n now++;\n }\n else return -1;\n vector<pair<int, int>> nexter;\n nexter.push_back(mp(ans, -1));\n while (*now != ')') {\n next_req = 0;\n if (*now == '+') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n nexter.push_back(mp(hoge, 0));\n }\n else if (*now == '-') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n nexter.push_back(mp(hoge, 1));\n }\n else if (*now == '*') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n nexter.push_back(mp(hoge, 2));\n }\n else if (*now == '0') {\n return -1;\n }\n else if (*now == '1') {\n return -1;\n }\n else if (*now == '(') {\n return -1;\n }\n else break;\n }\n if (next_req == 1) {\n return -1;\n }\n for (int q = 1; q < nexter.size(); ++q) {\n if (nexter[q].second == 2) {\n nexter[q - 1].first *= nexter[q].first;\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\n nexter.erase(nexter.begin() + q);\n q--;\n }\n }\n for (int q = 1; q < nexter.size(); ++q) {\n if (nexter[q].second == 0) {\n nexter[q - 1].first += nexter[q].first;\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\n nexter.erase(nexter.begin() + q);\n q--;\n }\n else {\n nexter[q - 1].first -= nexter[q].first;\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\n nexter.erase(nexter.begin() + q);\n q--;\n }\n }\n return nexter[0].first;\n}\n\nvoid solve() {\n string s;\n cin >> s;\n s = \"0+\" + s;\n s.push_back(')');\n int ans = -1;\n REP(i, 7 * 7 * 7 * 7 * 7) {\n string b;\n int now = i;\n string c = \"01+-*()\";\n REP(q, s.length()) {\n if (s[q] == '.') {\n b.push_back(c[now % 7]);\n now /= 7;\n }\n else {\n b.push_back(s[q]);\n }\n }\n int ng = 0;\n for (int q = 0; q < b.length() - 1; ++q) {\n if (b[q] == '(') {\n ng++;\n }\n else if (b[q] == ')') {\n ng--;\n }\n if (ng < 0) {\n b.clear();\n break;\n }\n }\n if (ng != 0) b.clear();\n if (b.size() == 0) continue;\n State hoge = b.begin();\n\n int nya = calc(hoge);\n if (nya > ans) {\n ans = max(ans, nya);\n }\n }\n cout << ans << endl;\n}\n\n#undef int\nint main() {\n init();\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":3240,"score_of_the_acc":-0.1205,"final_rank":1},{"submission_id":"aoj_2428_4275370","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-5L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\n// geometry library\n\ntypedef complex<long double> Point;\ntypedef pair<complex<long double>, complex<long double>> Line;\n\ntypedef struct Circle {\n complex<long double> center;\n long double r;\n}Circle;\n\n//内積、 dot(a,b) = |a||b|cos()\nlong double dot(Point a, Point b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n//外積、cross(a,b) = |a||b|sin()\nlong double cross(Point a, Point b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\n//線分と点の距離\nlong double Dist_Line_Point(Line a, Point b) {\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\n}\n\n//線分の交差判定\nint is_intersected_ls(Line a, Line b) {\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < eps) &&\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < eps);\n}\n\n//線分の交点\nPoint intersection_l(Line a, Line b) {\n Point da = a.second - a.first;\n Point db = b.second - b.first;\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\n}\n\n//線分と線分の距離\nlong double Dist_Line_Line(Line a, Line b) {\n if (is_intersected_ls(a, b) == 1) {\n return 0;\n }\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\n}\n\n//円と円の交点\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\n long double dist = abs(a.center - b.center);\n assert(dist <= eps + a.r + b.r);\n assert(dist+eps >= abs(a.r - b.r));\n Point target = b.center - a.center;\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\n long double aa = pointer + a.r * a.r - b.r * b.r;\n aa /= 2.0L;\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\n r = r + a.center;\n l = l + a.center;\n return mp(l, r);\n}\n\n//end of geometry\n\ntemplate<typename A>\nA pows(A val, ll b) {\n assert(b >= 1);\n A ans = val;\n b--;\n while (b) {\n if (b % 2) {\n ans *= val;\n }\n val *= val;\n b /= 2LL;\n }\n return ans;\n}\n\ntemplate<typename A>\nclass Compressor {\npublic:\n bool is_zipped = false;\n map<A, ll> zipper;\n map<ll, A> unzipper;\n queue<A> fetcher;\n Compressor(){\n is_zipped = false;\n zipper.clear();\n unzipper.clear();\n }\n void add(A now) {\n assert(is_zipped == false);\n zipper[now] = 1;\n fetcher.push(now);\n }\n void exec() {\n assert(is_zipped == false);\n int cnt = 0;\n for (auto i = zipper.begin(); i != zipper.end(); ++i) {\n i->second = cnt;\n unzipper[cnt] = i->first;\n cnt++;\n }\n is_zipped = true;\n }\n ll fetch() {\n assert(is_zipped == true);\n A hoge = fetcher.front();\n fetcher.pop();\n return zipper[hoge];\n }\n ll zip(A now) {\n assert(is_zipped == true);\n assert(zipper.find(now) != zipper.end());\n return zipper[now];\n }\n A unzip(ll a) {\n assert(is_zipped == true);\n assert(a < unzipper.size());\n return unzipper[a];\n }\n ll next(A now) {\n auto x = zipper.upper_bound(now);\n if (x == zipper.end()) return zipper.size();\n return (ll)((*x).second);\n }\n ll back(A now) {\n auto x = zipper.lower_bound(now);\n if (x == zipper.begin()) return -1;\n x--;\n return (ll)((*x).second);\n }\n};\n\ntemplate<typename A>\nclass Matrix {\npublic:\n vector<vector<A>> data;\n Matrix(vector<vector<A>> a) :data(a){\n\n }\n Matrix operator + (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data.size());\n assert(obj.data[0].size() == this->data[0].size());\n REP(i, obj.data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[i].size()) {\n A hoge = obj.data[i][q] + (this -> data[i][q]);\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix operator - (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data.size());\n assert(obj.data[0].size() == this->data[0].size());\n REP(i, obj.data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[i].size()) {\n A hoge = this->data[i][q] - obj.data[i][q];\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix operator * (const Matrix obj) {\n vector<vector<A>> ans;\n assert(obj.data.size() == this->data[0].size());\n REP(i, this -> data.size()) {\n ans.push_back(vector<A>());\n REP(q, obj.data[0].size()) {\n A hoge = (this -> data[i][0]) * (obj.data[0][q]);\n for(int t = 1;t < obj.data[i].size();++t){\n hoge += this -> data[i][t] * obj.data[t][q];\n }\n ans.back().push_back(hoge);\n }\n }\n return Matrix(ans);\n }\n Matrix &operator *= (const Matrix obj) {\n *this = (*this * obj);\n return *this;\n }\n Matrix& operator += (const Matrix obj) {\n *this = (*this + obj);\n return *this;\n }\n Matrix& operator -= (const Matrix obj) {\n *this = (*this - obj);\n return *this;\n }\n};\n\nclass modint {\npublic:\n using u64 = std::uint_fast64_t;\n u64 value = 0;\n u64 mod;\n modint(ll a, ll b): value(((a%b) + 2 * b) % b),mod(b) {\n\n }\n modint operator+(const modint rhs) const{\n return modint(*this) += rhs;\n }\n modint operator-(const modint rhs) const{\n return modint(*this) -= rhs;\n }\n modint operator*(const modint rhs) const {\n return modint(*this) *= rhs;\n }\n modint operator/(const modint rhs) const{\n return modint(*this) /= rhs;\n }\n modint& operator+=(const modint rhs) {\n assert(rhs.mod == mod);\n value += rhs.value;\n if (value >= mod) {\n value -= mod;\n }\n return *this;\n }\n modint& operator-=(const modint rhs) {\n assert(rhs.mod == mod);\n if (value < rhs.value) {\n value += mod;\n }\n value -= rhs.value;\n return *this;\n }\n modint& operator*=(const modint rhs) {\n assert(rhs.mod == mod);\n value = (value * rhs.value) % mod;\n return *this;\n }\n modint& operator/=(modint rhs) {\n assert(rhs.mod == mod);\n ll rem = mod - 2;\n while (rem) {\n if (rem % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n rem /= 2LL;\n }\n return *this;\n }\n bool operator <(modint rhs) const{\n return value < rhs.value;\n }\n friend ostream& operator<<(ostream& os, modint& p) {\n os << p.value;\n return (os);\n }\n};\n\nclass Dice {\npublic:\n vector<ll> vertexs;\n //Up: 0,Left: 1,Center: 2,Right: 3,Adj: 4, Down: 5\n Dice(vector<ll> init):vertexs(init){\n \n }\n //Look from Center\n void RtoL() {\n for (int q = 1; q < 4; ++q) {\n swap(vertexs[q], vertexs[q + 1]);\n }\n }\n void LtoR() {\n for (int q = 3; q >= 1; --q) {\n swap(vertexs[q], vertexs[q + 1]);\n }\n }\n void UtoD() {\n swap(vertexs[5], vertexs[4]);\n swap(vertexs[2], vertexs[5]);\n swap(vertexs[0], vertexs[2]);\n }\n void DtoU() {\n swap(vertexs[0], vertexs[2]);\n swap(vertexs[2], vertexs[5]);\n swap(vertexs[5], vertexs[4]);\n }\n bool ReachAble(Dice now) {\n set<Dice> hoge;\n queue<Dice> next;\n next.push(now);\n hoge.insert(now);\n while (next.empty() == false) {\n Dice seeing = next.front();\n next.pop();\n if (seeing == *this) return true;\n seeing.RtoL();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.LtoR();\n seeing.LtoR();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.RtoL();\n seeing.UtoD();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n seeing.DtoU();\n seeing.DtoU();\n if (hoge.count(seeing) == 0) {\n hoge.insert(seeing);\n next.push(seeing);\n }\n }\n return false;\n }\n bool operator ==(const Dice& a) {\n for (int q = 0; q < 6; ++q) {\n if (a.vertexs[q] != (*this).vertexs[q]) {\n return false;\n }\n }\n return true;\n }\n bool operator <(const Dice& a) const{\n return (*this).vertexs < a.vertexs;\n }\n};\n\npair<Dice, Dice> TwoDimDice(int center, int up) {\n int target = 1;\n while (true) {\n if (center != target && 7 - center != target && up != target && 7 - up != target) {\n break;\n }\n target++;\n }\n return mp(Dice(vector<ll>{up, target, center, 7 - target, 7 - center, 7 - up}), Dice(vector<ll>{up, 7 - target, center, target, 7 - center, 7 - up}));\n}\n\ntuple<Dice, Dice, Dice, Dice> OneDimDice(int center) {\n int bo = min(center, 7 - center);\n pair<int, int> goa;\n if (bo == 1) {\n goa = mp(2, 3);\n }\n else if (bo == 2) {\n goa = mp(1, 3);\n }\n else if(bo == 3){\n goa = mp(1, 2);\n }\n tuple<Dice, Dice, Dice, Dice> now = make_tuple(Dice(vector<ll>{goa.first,goa.second,center,7 - goa.second,7-center,7 - goa.first}), \n Dice(vector<ll>{goa.first, 7 - goa.second, center, goa.second, 7 - center, 7 - goa.first}),\n Dice(vector<ll>{7 - goa.first, goa.second, center, 7 - goa.second, 7 - center, goa.first}),\n Dice(vector<ll>{7 - goa.first, 7 - goa.second, center, goa.second, 7 - center, goa.first}));\n return now;\n}\n\ntemplate<typename A,typename B>\nclass Dijkstra {\npublic:\n vector<vector<pair<int, A>>> vertexs;\n B Cost_Function;\n Dijkstra(int n, B cost) : Cost_Function(cost){\n vertexs = vector<vector<pair<int, A>>>(n, vector<pair<int, A>>{});\n }\n ~Dijkstra() {\n vertexs.clear();\n }\n void add_edge(int a, int b, A c) {\n vertexs[a].push_back(mp(b, c));\n }\n vector<ll> build_result(int StartPoint) {\n vector<ll> dist(vertexs.size(), 2e18);\n dist[StartPoint] = 0;\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> next;\n next.push(make_pair(0, StartPoint));\n while (next.empty() == false) {\n pair<ll, int> now = next.top();\n next.pop();\n if (dist[now.second] != now.first) continue;\n for (auto x : vertexs[now.second]) {\n ll now_cost = now.first + Cost_Function(x.second);\n if (dist[x.first] > now_cost) {\n dist[x.first] = now_cost;\n next.push(mp(now_cost, x.first));\n }\n }\n }\n return dist;\n }\n};\n\nclass Dinic {\npublic:\n struct edge {\n int to;\n int cap;\n int rev;\n };\n vector<vector<edge>> Graph;\n vector<int> level;\n vector<int> itr;\n Dinic(int n){\n Graph = vector<vector<edge>>(n, vector<edge>());\n }\n void add_edge(int a, int b, int cap) {\n Graph[a].push_back(edge{ b, cap ,(int)Graph[b].size() });\n Graph[b].push_back(edge{ a,0,(int)Graph[a].size() - 1 });\n }\n void bfs(int s) {\n level = vector<int>(Graph.size(), -1);\n level[s] = 0;\n queue<int> next;\n next.push(s);\n while (next.empty() == false) {\n int now = next.front();\n next.pop();\n for (auto x : Graph[now]) {\n if (x.cap == 0) continue;\n if (level[x.to] == -1) {\n level[x.to] = level[now] + 1;\n next.push(x.to);\n }\n }\n }\n }\n int dfs(int now, int goal, int val) {\n if (goal == now) return val;\n for (int& i = itr[now]; i < (int)Graph[now].size(); ++i) {\n edge& target = Graph[now][i];\n if (target.cap > 0&&level[now] < level[target.to]) {\n int d = dfs(target.to, goal, min(val, target.cap));\n if (d > 0) {\n target.cap -= d;\n Graph[target.to][target.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n int run(int s,int t) {\n int ans = 0;\n int f = 0;\n while (bfs(s), level[t] >= 0) {\n itr = vector<int>(Graph.size(), 0);\n while ((f = dfs(s, t, 1e9)) > 0) {\n ans += f;\n }\n }\n return ans;\n }\n};\n\n//by ei1333\n//https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html\ntemplate< typename Monoid >\nstruct SegmentTree {\n using F = function< Monoid(Monoid, Monoid) >;\n\n int sz;\n vector< Monoid > seg;\n\n const F f;\n const Monoid M1;\n\n SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\n sz = 1;\n while (sz < n) sz <<= 1;\n seg.assign(2 * sz + 1, M1);\n }\n\n void set(int k, const Monoid& x) {\n seg[k + sz] = x;\n }\n\n void build() {\n for (int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void update(int k, const Monoid& x) {\n k += sz;\n seg[k] = x;\n while (k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n Monoid query(int a, int b) {\n Monoid L = M1, R = M1;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) L = f(L, seg[a++]);\n if (b & 1) R = f(seg[--b], R);\n }\n return f(L, R);\n }\n\n Monoid operator[](const int& k) const {\n return seg[k + sz];\n }\n\n template< typename C >\n int find_subtree(int a, const C& check, Monoid& M, bool type) {\n while (a < sz) {\n Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\n if (check(nxt)) a = 2 * a + type;\n else M = nxt, a = 2 * a + 1 - type;\n }\n return a - sz;\n }\n\n\n template< typename C >\n int find_first(int a, const C& check) {\n Monoid L = M1;\n if (a <= 0) {\n if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\n return -1;\n }\n int b = sz;\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\n if (a & 1) {\n Monoid nxt = f(L, seg[a]);\n if (check(nxt)) return find_subtree(a, check, L, false);\n L = nxt;\n ++a;\n }\n }\n return -1;\n }\n\n template< typename C >\n int find_last(int b, const C& check) {\n Monoid R = M1;\n if (b >= sz) {\n if (check(f(seg[1], R))) return find_subtree(1, check, R, true);\n return -1;\n }\n int a = sz;\n for (b += sz; a < b; a >>= 1, b >>= 1) {\n if (b & 1) {\n Monoid nxt = f(seg[--b], R);\n if (check(nxt)) return find_subtree(b, check, R, true);\n R = nxt;\n }\n }\n return -1;\n }\n};\n\nvoid init() {\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\n\nunsigned long xor128() {\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n unsigned long t = (x ^ (x << 11));\n x = y; y = z; z = w;\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\n#define int ll\nint num(State& now) {\n int ans = 0;\n while (*now == '0' || *now == '1') {\n ans *= 2LL;\n ans += *now - '0';\n if (ans >= (1 << 10)) {\n return -1;\n }\n now++;\n }\n return ans;\n}\n\nint calc(State& now) {\n int ans = 0;\n int next_req = 1;\n if (*now == '0' || *now == '1') {\n ans = num(now);\n if (ans == -1) return -1;\n }\n else if (*now == '(') {\n now++;\n ans = calc(now);\n if (ans == -1) return -1;\n now++;\n }\n else return -1;\n while (*now != ')') {\n next_req = 0;\n if (*now == '+') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n ans += hoge;\n }\n else if (*now == '-') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n ans -= hoge;\n }\n else if (*now == '*') {\n now++;\n int hoge = 0;\n if (*now == '(') {\n now++;\n hoge = calc(now);\n if (hoge == -1) return -1;\n now++;\n }\n else if (*now == '0' || *now == '1') {\n hoge = num(now);\n if (hoge == -1) return -1;\n }\n else return -1;\n ans *= hoge;\n }\n else if (*now == '0') {\n return -1;\n }\n else if (*now == '1') {\n return -1;\n }\n else if (*now == '(') {\n return -1;\n }\n else break;\n if (ans < 0 || ans >= (1 << 10)) return -1;\n }\n if (next_req == 1) {\n return -1;\n }\n return ans;\n}\n\nvoid solve() {\n string s;\n cin >> s;\n s = \"0+\" + s;\n s.push_back(')');\n int ans = -1;\n REP(i, 7 * 7 * 7 * 7 * 7) {\n string b;\n int now = i;\n string c = \"01+-*()\";\n REP(q, s.length()) {\n if (s[q] == '.') {\n b.push_back(c[now % 7]);\n now /= 7;\n }\n else {\n b.push_back(s[q]);\n }\n }\n int ng = 0;\n for (int q = 0; q < b.length() - 1; ++q) {\n if (b[q] == '(') {\n ng++;\n }\n else if (b[q] == ')') {\n ng--;\n }\n if (ng < 0) {\n b.clear();\n break;\n }\n }\n if (ng != 0) b.clear();\n if (b.size() == 0) continue;\n State hoge = b.begin();\n\n int nya = calc(hoge);\n if (nya > ans) {\n ans = max(ans, nya);\n }\n }\n cout << ans << endl;\n}\n\n#undef int\nint main() {\n init();\n solve();\n}","accuracy":0.48905109489051096,"time_ms":10,"memory_kb":3240,"score_of_the_acc":-0.1205,"final_rank":14},{"submission_id":"aoj_2428_4268961","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _USE_MATH_DEFINES\n\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-5L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define seg_size 262144LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\n// geometry library\n\ntypedef complex<long double> Point;\ntypedef pair<complex<long double>, complex<long double>> Line;\n\ntypedef struct Circle {\n complex<long double> center;\n long double r;\n}Circle;\n\n//内積、 dot(a,b) = |a||b|cos()\nlong double dot(Point a, Point b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n//外積、cross(a,b) = |a||b|sin()\nlong double cross(Point a, Point b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\n//線分と点の距離\nlong double Dist_Line_Point(Line a, Point b) {\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\n}\n\n//線分の交差判定\nint is_intersected_ls(Line a, Line b) {\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < 0) &&\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < 0);\n}\n\n//線分の交点\nPoint intersection_l(Line a, Line b) {\n Point da = a.second - a.first;\n Point db = b.second - b.first;\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\n}\n\n//線分と線分の距離\nlong double Dist_Line_Line(Line a, Line b) {\n if (is_intersected_ls(a, b) == 1) {\n return 0;\n }\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\n}\n\n//円と円の交点\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\n long double dist = abs(a.center - b.center);\n assert(dist <= eps + a.r + b.r);\n assert(dist+eps >= abs(a.r - b.r));\n Point target = b.center - a.center;\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\n long double aa = pointer + a.r * a.r - b.r * b.r;\n aa /= 2.0L;\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\n r = r + a.center;\n l = l + a.center;\n return mp(l, r);\n}\n\n//end of geometry\n\n\n\nvoid init() {\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\n\nunsigned long xor128() {\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\n unsigned long t = (x ^ (x << 11));\n x = y; y = z; z = w;\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\n}\n\n#define int ll\nint num(State& a) {\n int ans = 0;\n while (*a == '0' || *a == '1') {\n ans *= 2;\n ans += *a - '0';\n a++;\n if (ans >= (1 << 10)) {\n return -1;\n }\n }\n return ans;\n}\nint calc(State& a,int ok) {\n int hoge =0;\n if (*a == '(') {\n a++;\n hoge = calc(a, 1);\n }\n else {\n if (*a != '0' && *a != '1') return -1;\n hoge = num(a);\n }\n if (hoge == -1) return -1;\n if (ok == 1 && *a == ')') return -1;\n while (*a != ')' && *a != ' ') {\n if (*a == '+') {\n a++;\n int tmp = 0;\n if (*a == '(') {\n a++;\n tmp = calc(a, 1);\n }\n else {\n if (*a != '0' && *a != '1') return -1;\n tmp = num(a);\n }\n if (tmp == -1) return -1;\n hoge += tmp;\n if (hoge >= (1 << 10)) return -1;\n }\n else if (*a == '-') {\n a++;\n int tmp = 0;\n if (*a == '(') {\n a++;\n tmp = calc(a, 1);\n }\n else {\n\n if (*a != '0' && *a != '1') return -1;\n tmp = num(a);\n }\n if (tmp == -1) return -1;\n hoge -= tmp;\n if (hoge >= (1 << 10) || hoge < 0) return -1;\n }\n else if (*a == '*') {\n a++;\n int tmp = 0;\n if (*a == '(') {\n a++;\n tmp = calc(a, 1);\n }\n else {\n if (*a != '0' && *a != '1') return -1;\n tmp = num(a);\n }\n if (tmp == -1) return -1;\n hoge *= tmp;\n if (hoge >= (1 << 10) || hoge < 0) return -1;\n }\n else return -1;\n }\n if (*a == ')') a++;\n return hoge;\n}\nvoid solve(){\n while (true) {\n string s;\n cin >> s;\n s.push_back(' ');\n int ans = -1;\n for (int i = 0; i < 7 * 7 * 7 * 7 * 7; ++i) {\n string b;\n int now = i;\n REP(q, s.length()) {\n if (s[q] == '.') {\n if (now % 7 == 0) {\n b.push_back('0');\n }\n else if (now % 7 == 1) {\n b.push_back('1');\n }\n else if (now % 7 == 2) {\n b.push_back('+');\n }\n else if (now % 7 == 3) {\n b.push_back('-');\n }\n else if (now % 7 == 4) {\n b.push_back('*');\n }\n else if (now % 7 == 5) {\n b.push_back('(');\n }\n else if (now % 7 == 6) {\n b.push_back(')');\n }\n now /= 7;\n }\n else {\n b.push_back(s[q]);\n }\n }\n int cnt = 0;\n REP(q, b.length()-1) {\n if (b[q] == '(') cnt++;\n else if (b[q] == ')') cnt--;\n if (cnt < 0) {\n b.clear();\n break;\n }\n }\n if (cnt != 0) b.clear();\n if (b.empty() == true) continue;\n State beg = b.begin();\n ans = max(ans, calc(beg, 0));\n }\n cout << ans << endl;\n return;\n }\n}\n\n#undef int\nint main() {\n init();\n solve();\n}","accuracy":0.48905109489051096,"time_ms":10,"memory_kb":3236,"score_of_the_acc":-0.1183,"final_rank":13},{"submission_id":"aoj_2428_3925997","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(x) ;\n#else\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\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#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\n/* 再帰下降法 */\n// char *p = str; res = expr(p);\n\nint term(char* &s);\nint number(char* &s);\nint factor(char* &s);\nint expr(char* &s);\n\nconst int LIMIT = 1 << 10;\n\n//数\nint number(char* &s){\n if (!*s) throw \"number\";\n\n int res = 0;\n while('0' <= *s && *s <= '9')\n res = res*2 + (*s++ - '0');\n\n if (*s == '(') throw \"number\";\n\n if (res < 0 || LIMIT <= res)\n throw \"number\";\n\n return res;\n}\n\n//乗算除算(優先順位:高)\nint term(char* &s){\n if (!*s) throw \"term\";\n\n int res = factor(s);\n while(1){\n if(*s == '*') res *= factor(++s);\n else if(*s == '/') res /= factor(++s);\n else break;\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n\n return res;\n}\n\n//括弧か数\nint factor(char* &s){\n if (!*s) throw \"factor\";\n if (!isdigit(*s) && *s != '(') throw \"factor\";\n\n if(*s != '(') return number(s);\n int res = expr(++s);\n\n if (!*s) throw \"factor\";\n\n s++;\n\n if (res < 0 || LIMIT <= res)\n throw \"factor\";\n\n return res;\n}\n\n//式(優先順位: 低)\nint expr(char* &s){\n if (!*s) throw \"expr\";\n\n int res = term(s);\n while(1){\n if(*s == '+') res += term(++s);\n else if(*s == '-') res -= term(++s);\n else break;\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"expr\";\n\n return res;\n}\n\nbool check(string s) {\n stack<int> st;\n\n for (int i=0; i<s.size(); i++) {\n switch (s[i]) {\n case '(':\n st.push(1);\n break;\n case ')': {\n if (st.empty()) return false;\n if (st.top() > 0) return false;\n while(st.size() && st.top() < 0) st.pop();\n if (st.empty()) return false;\n st.pop();\n }\n break;\n case '0':\n case '1':\n break;\n default:\n st.push(-1);\n break;\n }\n }\n\n while(st.size() && st.top() < 0)\n st.pop();\n\n return st.empty();\n}\n\n\nint calc(string s2) {\n if (!check(s2)) return -1;\n\n char s[1000];\n strcpy(s, s2.c_str());\n char *p = s;\n\n try{\n int res = expr(p);\n\n if (*p) return -1;\n\n return res;\n\n }catch(...){\n\n return -1;\n }\n}\n\nint main(){\n string str;\n\n cin >> str;\n\n vector<int> dots;\n\n for (int i=0; i<str.size(); i++)\n if (str[i] == '.') dots.push_back(i);\n\n int ans = -1;\n\n int limit = 7 * 7 * 7 * 7 * 7;\n for (int i=0; i<limit; i++) {\n int tmp = i;\n\n for (int p : dots) {\n str[p] = \"01+-*()\"[tmp % 7];\n tmp /= 7;\n }\n\n int res = calc(str);\n if (ans < res) {\n debug(str); debug(res);\n }\n\n ans = max(ans, res);\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":3268,"score_of_the_acc":-0.8285,"final_rank":8},{"submission_id":"aoj_2428_3925995","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(x) ;\n#else\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\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#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\n/* 再帰下降法 */\n// char *p = str; res = expr(p);\n\nint term(char* &s);\nint number(char* &s);\nint factor(char* &s);\nint expr(char* &s);\n\nconst int LIMIT = 1 << 10;\n\n//数\nint number(char* &s){\n if (!*s) throw \"number\";\n\n int res = 0;\n while('0' <= *s && *s <= '9')\n res = res*2 + (*s++ - '0');\n\n if (*s == '(') throw \"number\";\n\n if (res < 0 || LIMIT <= res)\n throw \"number\";\n\n return res;\n}\n\n//乗算除算(優先順位:高)\nint term(char* &s){\n if (!*s) throw \"term\";\n\n int res = factor(s);\n while(1){\n if(*s == '*') res *= factor(++s);\n else if(*s == '/') res /= factor(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n\n return res;\n}\n\n//括弧か数\nint factor(char* &s){\n if (!*s) throw \"factor\";\n if (!isdigit(*s) && *s != '(') throw \"factor\";\n\n if(*s != '(') return number(s);\n int res = expr(++s);\n\n if (!*s) throw \"factor\";\n\n s++;\n\n if (res < 0 || LIMIT <= res)\n throw \"factor\";\n\n return res;\n}\n\n//式(優先順位: 低)\nint expr(char* &s){\n if (!*s) throw \"expr\";\n\n int res = term(s);\n while(1){\n if(*s == '+') res += term(++s);\n else if(*s == '-') res -= term(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"expr\";\n\n return res;\n}\n\nbool check(string s) {\n stack<int> st;\n\n for (int i=0; i<s.size(); i++) {\n switch (s[i]) {\n case '(':\n st.push(1);\n break;\n case ')': {\n if (st.empty()) return false;\n if (st.top() > 0) return false;\n while(st.size() && st.top() < 0) st.pop();\n if (st.empty()) return false;\n st.pop();\n }\n break;\n case '0':\n case '1':\n break;\n default:\n st.push(-1);\n break;\n }\n }\n\n while(st.size() && st.top() < 0)\n st.pop();\n\n return st.empty();\n}\n\n\nint calc(string s2) {\n if (!check(s2)) return -1;\n\n char s[1000];\n strcpy(s, s2.c_str());\n char *p = s;\n\n try{\n int res = expr(p);\n\n if (*p) return -1;\n\n return res;\n\n }catch(...){\n\n return -1;\n }\n}\n\nint main(){\n string str;\n\n cin >> str;\n\n vector<int> dots;\n\n for (int i=0; i<str.size(); i++)\n if (str[i] == '.') dots.push_back(i);\n\n int ans = -1;\n\n int limit = 7 * 7 * 7 * 7 * 7;\n for (int i=0; i<limit; i++) {\n int tmp = i;\n\n for (int p : dots) {\n str[p] = \"01+-*()\"[tmp % 7];\n tmp /= 7;\n }\n\n int res = calc(str);\n if (ans < res) {\n debug(str); debug(res);\n }\n\n ans = max(ans, res);\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.656934306569343,"time_ms":100,"memory_kb":3268,"score_of_the_acc":-0.8285,"final_rank":12},{"submission_id":"aoj_2428_3925987","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(x) ;\n#else\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\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#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\n/* 再帰下降法 */\n// char *p = str; res = expr(p);\n\nint term(char* &s);\nint number(char* &s);\nint factor(char* &s);\nint expr(char* &s);\n\nconst int LIMIT = 1 << 10;\n\n//数\nint number(char* &s){\n if (!*s) throw \"number\";\n\n int res = 0;\n while('0' <= *s && *s <= '9')\n res = res*2 + (*s++ - '0');\n\n if (res < 0 || LIMIT <= res)\n throw \"number\";\n\n return res;\n}\n\n//乗算除算(優先順位:高)\nint term(char* &s){\n if (!*s) throw \"term\";\n\n int res = factor(s);\n while(1){\n if(*s == '*') res *= factor(++s);\n else if(*s == '/') res /= factor(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n\n return res;\n}\n\n//括弧か数\nint factor(char* &s){\n if (!*s) throw \"factor\";\n\n if(*s != '(') return number(s);\n int res = expr(++s);\n\n if (!*s) throw \"factor\";\n\n s++;\n\n if (res < 0 || LIMIT <= res)\n throw \"factor\";\n\n return res;\n}\n\n//式(優先順位: 低)\nint expr(char* &s){\n if (!*s) throw \"expr\";\n\n int res = term(s);\n while(1){\n if(*s == '+') res += term(++s);\n else if(*s == '-') res -= term(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"expr\";\n\n return res;\n}\n\nbool check(string s) {\n stack<int> st;\n\n for (int i=0; i<s.size(); i++) {\n switch (s[i]) {\n case '(':\n st.push(1);\n break;\n case ')': {\n if (st.empty()) return false;\n if (st.top() > 0) return false;\n while(st.size() && st.top() < 0) st.pop();\n if (st.empty()) return false;\n st.pop();\n }\n break;\n case '0':\n case '1':\n break;\n default:\n st.push(-1);\n break;\n }\n }\n\n return true;\n}\n\n\nint calc(string s2) {\n if (!check(s2)) return -1;\n\n char s[1000];\n strcpy(s, s2.c_str());\n char *p = s;\n\n try{\n int res = expr(p);\n\n if (*p) return -1;\n\n return res;\n\n }catch(...){\n\n return -1;\n }\n}\n\nint main(){\n string str;\n\n cin >> str;\n\n vector<int> dots;\n\n for (int i=0; i<str.size(); i++)\n if (str[i] == '.') dots.push_back(i);\n\n int ans = -1;\n\n int limit = 7 * 7 * 7 * 7 * 7;\n for (int i=0; i<limit; i++) {\n int tmp = i;\n\n for (int p : dots) {\n str[p] = \"01+-*()\"[tmp % 7];\n tmp /= 7;\n }\n\n int res = calc(str);\n debug(str); debug(res);\n\n ans = max(ans, res);\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.0364963503649635,"time_ms":30,"memory_kb":3212,"score_of_the_acc":-0.2588,"final_rank":19},{"submission_id":"aoj_2428_3925969","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n\n#include <iostream>\n#include <complex>\n#include <string>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n\n#include <functional>\n#include <cassert>\n\ntypedef long long ll;\nusing namespace std;\n\n#ifndef LOCAL\n#define debug(x) ;\n#else\n#define debug(x) cerr << __LINE__ << \" : \" << #x << \" = \" << (x) << endl;\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#endif\n\n#define mod 1000000007 //1e9+7(prime number)\n#define INF 1000000000 //1e9\n#define LLINF 2000000000000000000LL //2e18\n#define SIZE 200010\n\n/* 再帰下降法 */\n// char *p = str; res = expr(p);\n\nint term(char* &s);\nint number(char* &s);\nint factor(char* &s);\nint expr(char* &s);\n\nconst int LIMIT = 1 << 10;\n\n//数\nint number(char* &s){\n if (!*s) throw \"number\";\n\n int res = 0;\n while('0' <= *s && *s <= '9')\n res = res*2 + (*s++ - '0');\n\n if (res < 0 || LIMIT <= res)\n throw \"number\";\n\n return res;\n}\n\n//乗算除算(優先順位:高)\nint term(char* &s){\n if (!*s) throw \"term\";\n\n int res = factor(s);\n while(1){\n if(*s == '*') res *= factor(++s);\n else if(*s == '/') res /= factor(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"term\";\n\n return res;\n}\n\n//括弧か数\nint factor(char* &s){\n if (!*s) throw \"factor\";\n\n if(*s != '(') return number(s);\n int res = expr(++s);\n\n if (!*s) throw \"factor\";\n\n s++;\n\n if (res < 0 || LIMIT <= res)\n throw \"factor\";\n\n return res;\n}\n\n//式(優先順位: 低)\nint expr(char* &s){\n if (!*s) throw \"expr\";\n\n int res = term(s);\n while(1){\n if(*s == '+') res += term(++s);\n else if(*s == '-') res -= term(++s);\n else break;\n }\n\n if (res < 0 || LIMIT <= res)\n throw \"expr\";\n\n return res;\n}\n\nbool check(string s) {\n bool open = false;\n bool onlyNumber = false;\n\n for (char c : s) {\n switch (c) {\n case '(':\n open = true;\n onlyNumber = true;\n break;\n case ')':\n if (open && onlyNumber) return false;\n open = false;\n break;\n case '0':\n case '1':\n break;\n default:\n onlyNumber = false;\n break;\n }\n }\n\n return true;\n}\n\n\nint calc(string s2) {\n if (!check(s2)) return -1;\n\n char s[1000];\n strcpy(s, s2.c_str());\n char *p = s;\n\n try{\n int res = expr(p);\n\n if (*p) return -1;\n\n return res;\n\n }catch(...){\n\n return -1;\n }\n}\n\nint main(){\n string str;\n\n cin >> str;\n\n vector<int> dots;\n\n for (int i=0; i<str.size(); i++)\n if (str[i] == '.') dots.push_back(i);\n\n int ans = -1;\n\n int limit = 7 * 7 * 7 * 7 * 7;\n for (int i=0; i<limit; i++) {\n int tmp = i;\n\n for (int p : dots) {\n str[p] = \"01+-*()\"[tmp % 7];\n tmp /= 7;\n }\n\n int res = calc(str);\n debug(str); debug(res);\n\n ans = max(ans, res);\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":0.021897810218978103,"time_ms":30,"memory_kb":3160,"score_of_the_acc":-0.2297,"final_rank":20},{"submission_id":"aoj_2428_3676450","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef string::const_iterator State;\nclass ParseError {};\n\nint digit(State& begin);\nint number(State& begin);\nint term(State& begin);\nint fact(State& begin);\nint expr(State& begin);\n\nint digit(State& begin) {\n int res = *begin - '0';\n begin++;\n return res;\n}\n\nint number(State& begin) {\n if (!isdigit(*begin)) throw ParseError();\n int res = digit(begin);\n while (isdigit(*begin)) {\n res *= 2;\n res += digit(begin);\n }\n if (res >= 1024 || 0 > res) throw ParseError();\n return res;\n}\n\nint term(State& begin) {\n int res = fact(begin);\n while (*begin == '*') {\n begin++;\n res *= fact(begin);\n }\n if (res >= 1024 || 0 > res) throw ParseError();\n return res;\n}\n\nint fact(State& begin) {\n if (*begin == '(') {\n begin++;\n int res = expr(begin);\n if (*begin != ')') throw ParseError();\n begin++;\n return res;\n }\n return number(begin);\n}\n\nint expr(State& begin) {\n int res = term(begin);\n while (true) {\n if (*begin == '+') {\n begin++;\n res += term(begin);\n } else if (*begin == '-') {\n begin++;\n res -= term(begin);\n } else {\n break;\n }\n if (res >= 1024 || 0 > res) throw ParseError();\n }\n return res;\n}\n\nbool check(string s) {\n vector<int> v;\n set<int> S;\n map<int, bool> m;\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == '(') {\n v.push_back(i);\n S.insert(i);\n }\n if ((s[i] == '*' || s[i] == '+' || s[i] == '-') && v.size()) {\n m[v[v.size() - 1]] = true;\n }\n if (s[i] == ')') {\n v.pop_back();\n }\n }\n bool flag = true;\n for (auto x : S) {\n flag &= m[x];\n }\n return flag;\n}\n\nint solve(string s) {\n State begin = s.begin();\n try {\n int res = expr(begin);\n if (begin == s.end() && check(s)) {\n return res;\n } else {\n return -1;\n }\n } catch (ParseError p) {\n return -1;\n }\n}\n\nint main() {\n string s;\n cin >> s;\n string kouho = \"01+-*()\";\n int SIZE = 1;\n int n = 7;\n int N = 0;\n vector<int> index;\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == '.') {\n index.push_back(i);\n N++;\n }\n }\n for (int i = 0; i < N; i++) SIZE *= n;\n vector<vector<char>> v(SIZE, vector<char>());\n for (int rep = 0; rep < N; rep++) {\n SIZE /= n;\n for (int i = 0; i < v.size(); i++) {\n v[i].push_back(kouho[(i / SIZE) % n]);\n }\n }\n int ans = -1;\n for (auto V : v) {\n for (int i = 0; i < N; i++) {\n s[index[i]] = V[i];\n }\n ans = max(ans, solve(s));\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":4020,"score_of_the_acc":-0.9404,"final_rank":9},{"submission_id":"aoj_2428_3675853","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef string::const_iterator State;\nclass ParseError {};\n\nint factor(State& s);\n\nint digit(State& s) {\n if ('0' <= *s && *s <= '1') {\n return *s - '0';\n } else {\n throw ParseError();\n }\n}\n\nint number(State& s) {\n if (!isdigit(*s)) throw ParseError();\n int res = 0;\n while (isdigit(*s)) {\n res *= 2;\n res += *s - '0';\n s++;\n }\n if (res >= 1024) {\n throw ParseError();\n }\n return res;\n}\n\nint term(State& s) {\n int res = (*s == '(' ? factor(s) : number(s));\n while (true) {\n if (*s == '*') {\n s++;\n res *= (*s == '(' ? factor(s) : number(s));\n if (res >= 1024) throw ParseError();\n } else {\n break;\n }\n }\n return res;\n}\n\nint expression(State& s) {\n int counter = 0;\n int res = term(s);\n while (true) {\n if (*s == '+') {\n s++;\n res += term(s);\n counter++;\n } else if (*s == '-') {\n s++;\n res -= term(s);\n counter++;\n } else {\n break;\n }\n if (res >= 1024) throw ParseError();\n }\n return res;\n}\n\nint factor(State& s) {\n if (*s == '(') {\n s++;\n int res = expression(s);\n if (*s != ')') throw ParseError();\n s++;\n return res;\n } else {\n return expression(s);\n }\n}\n\nbool check(string s) {\n vector<int> v;\n set<int> S;\n map<int, bool> m;\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == '(') {\n v.push_back(i);\n S.insert(i);\n }\n if ((s[i] == '*' || s[i] == '+' || s[i] == '-') && v.size()) {\n m[v[v.size() - 1]] = true;\n }\n if (s[i] == ')') {\n v.pop_back();\n }\n }\n bool flag = true;\n for (auto x : S) {\n flag &= m[x];\n }\n return flag;\n}\n\nint solve(string s) {\n State begin = s.begin();\n try {\n int res = factor(begin);\n if (begin != s.end() || !check(s)) {\n return -1;\n } else {\n return res;\n }\n } catch (ParseError p) {\n return -1;\n }\n}\n\nint main() {\n string s;\n cin >> s;\n string kouho = \"01+-*().\";\n int SIZE = 1;\n int n = 8;\n int N = 0;\n vector<int> index;\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == '.') {\n index.push_back(i);\n N++;\n }\n }\n for (int i = 0; i < N; i++) SIZE *= n;\n vector<vector<char>> v(SIZE, vector<char>());\n for (int rep = 0; rep < N; rep++) {\n SIZE /= n;\n for (int i = 0; i < v.size(); i++) {\n v[i].push_back(kouho[(i / SIZE) % n]);\n }\n }\n int ans = -1;\n for (auto V : v) {\n for (int i = 0; i < N; i++) {\n s[index[i]] = V[i];\n }\n // cerr << s << solve(s) << endl;\n ans = max(ans, solve(s));\n }\n cout << ans << endl;\n}","accuracy":0.06569343065693431,"time_ms":90,"memory_kb":4816,"score_of_the_acc":-1.6154,"final_rank":17},{"submission_id":"aoj_2428_3055153","code_snippet":"#include <cstdio>\n#include <cctype>\n#include <cassert>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stdexcept>\n\n#define fprintf(...) void(0)\n\nconst std::string chs=\"01+-*()\";\n\nbool next_assignment(std::vector<size_t> &d) {\n for (size_t i=d.size(); i--;) {\n if (d[i] < 6) {\n ++d[i];\n return true;\n }\n d[i] = 0;\n }\n return false;\n}\n\nint apply(int lhs, char op, int rhs) {\n if (op == '+') {\n lhs += rhs;\n } else if (op == '-') {\n lhs -= rhs;\n } else if (op == '*') {\n lhs *= rhs;\n }\n if (!(0 <= lhs && lhs < 1024))\n throw std::logic_error(\"overflow\");\n\n return lhs;\n}\n\nint parse(\n const std::string &s, size_t &i, size_t preced=0) {\n\n static const std::vector<std::string> ops={\"+-\", \"*\"};\n\n if (preced == ops.size()) {\n if (s[i] == '(') {\n fprintf(stderr, \"starting from %zu\\n\", i);\n size_t j=i;\n parse(s, ++j, preced);\n int res=parse(s, ++i);\n if (!(i < s.length() && s[i] == ')'))\n throw std::logic_error(\"mismatch parentheses\");\n fprintf(stderr, \"i: %zu, j: %zu\\n\", i, j);\n if (i == j)\n throw std::logic_error(\"redundant parentheses\");\n ++i;\n return res;\n }\n if (isdigit(s[i])) {\n int res=s[i]-'0';\n while (++i < s.length() && isdigit(s[i])) {\n res = res*2+s[i]-'0';\n if (res >= 1024) throw std::logic_error(\"overflow\");\n }\n return res;\n }\n throw std::logic_error(\"unexpected\");\n }\n\n int res=parse(s, i, preced+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\n int tmp=parse(s, ++i, preced+1);\n res = apply(res, op, tmp);\n }\n return res;\n}\n\nint parse(const std::string &s, std::vector<size_t> &d) {\n std::string t;\n size_t i=0;\n for (char ch: s) {\n if (ch == '.') {\n t += chs[d[i++]];\n continue;\n }\n t += ch;\n }\n i = 0;\n fprintf(stderr, \"%s\\n\", t.c_str());\n int res=parse(t, i);\n fprintf(stderr, \"[%zu]\\n\", i);\n if (i < t.length())\n throw std::logic_error(\"garbage\");\n return res;\n}\n\nint main() {\n char buf[128];\n scanf(\"%s\", buf);\n std::string s=buf;\n size_t dot=std::count(s.begin(), s.end(), '.');\n std::vector<size_t> d(dot);\n\n int res=-1;\n do {\n try {\n res = std::max(res, parse(s, d));\n } catch (std::logic_error &e) {\n fprintf(stderr, \"failed: %s\\n\", e.what());\n }\n } while (next_assignment(d));\n printf(\"%d\\n\", res);\n}","accuracy":1,"time_ms":140,"memory_kb":3044,"score_of_the_acc":-1.0112,"final_rank":10},{"submission_id":"aoj_2428_3055152","code_snippet":"#include <cstdio>\n#include <cctype>\n#include <cassert>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <stdexcept>\n\n#define fprintf(...) void(0)\n\nconst std::string chs=\"01+-*()\";\n\nbool next_assignment(std::vector<size_t> &d) {\n for (size_t i=d.size(); i--;) {\n if (d[i] < 6) {\n ++d[i];\n return true;\n }\n d[i] = 0;\n }\n return false;\n}\n\nint apply(int lhs, char op, int rhs) {\n if (op == '+') {\n lhs += rhs;\n } else if (op == '-') {\n lhs -= rhs;\n } else if (op == '*') {\n lhs *= rhs;\n }\n if (!(0 <= lhs && lhs < 1024))\n throw std::logic_error(\"overflow\");\n\n return lhs;\n}\n\nint parse(\n const std::string &s, size_t &i, size_t preced=0) {\n\n static const std::vector<std::string> ops={\"+-\", \"*\"};\n\n if (preced == ops.size()) {\n if (s[i] == '(') {\n fprintf(stderr, \"starting from %zu\\n\", i);\n size_t j=i;\n parse(s, ++j, preced);\n int res=parse(s, ++i);\n if (!(i < s.length() && s[i] == ')'))\n throw std::logic_error(\"mismatch parentheses\");\n fprintf(stderr, \"i: %zu, j: %zu\\n\", i, j);\n if (i == j)\n throw std::logic_error(\"redundant parentheses\");\n ++i;\n return res;\n }\n if (isdigit(s[i])) {\n int res=s[i]-'0';\n while (++i < s.length() && isdigit(s[i])) {\n res = res*2+s[i]-'0';\n }\n return res;\n }\n throw std::logic_error(\"unexpected\");\n }\n\n int res=parse(s, i, preced+1);\n while (i < s.length()) {\n char op=s[i];\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\n int tmp=parse(s, ++i, preced+1);\n res = apply(res, op, tmp);\n }\n return res;\n}\n\nint parse(const std::string &s, std::vector<size_t> &d) {\n std::string t;\n size_t i=0;\n for (char ch: s) {\n if (ch == '.') {\n t += chs[d[i++]];\n continue;\n }\n t += ch;\n }\n i = 0;\n fprintf(stderr, \"%s\\n\", t.c_str());\n int res=parse(t, i);\n fprintf(stderr, \"[%zu]\\n\", i);\n if (i < t.length())\n throw std::logic_error(\"garbage\");\n return res;\n}\n\nint main() {\n char buf[128];\n scanf(\"%s\", buf);\n std::string s=buf;\n size_t dot=std::count(s.begin(), s.end(), '.');\n std::vector<size_t> d(dot);\n\n int res=-1;\n do {\n try {\n res = std::max(res, parse(s, d));\n } catch (std::logic_error &e) {\n fprintf(stderr, \"failed: %s\\n\", e.what());\n }\n } while (next_assignment(d));\n printf(\"%d\\n\", res);\n}","accuracy":0.08029197080291971,"time_ms":110,"memory_kb":3024,"score_of_the_acc":-0.7692,"final_rank":16}],"string":"[\n {\n \"submission_id\": \"aoj_2428_10854054\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <stdlib.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n \\nconstexpr ll M = 1e9+7;\\n\\nconst string w = \\\"01+-*()\\\";\\n\\nconstexpr int mi = 0;\\nconstexpr int ma = 1023;\\n\\nbool isrange(int n) {\\n return mi <= n && n <= ma;\\n}\\n\\nint expr(string const& s, int& p);\\nint term(string const& s, int& p);\\nint factor(string const& s, int& p);\\nint number(string const& s, int& p);\\n\\nint expr(string const& s, int& p) {\\n int res = term(s, p);\\n while(p < s.size() && (s[p] == '+' || s[p] == '-')) {\\n if(s[p] == '+') {\\n res += term(s, ++p);\\n } else if(s[p] == '-') {\\n res -= term(s, ++p);\\n }\\n if(!isrange(res)) {\\n throw runtime_error(\\\"\\\");\\n }\\n }\\n return res;\\n}\\n\\nint term(string const& s, int& p) {\\n int res = factor(s, p);\\n while(p < s.size() && s[p] == '*') {\\n res *= factor(s, ++p);\\n if(!isrange(res)) {\\n throw runtime_error(\\\"\\\");\\n }\\n }\\n return res;\\n}\\n\\nint factor(string const& s, int& p) {\\n if(isdigit(s[p])) {\\n return number(s, p);\\n }\\n if(s[p] == '-') {\\n int res = -factor(s, ++p);\\n if(!isrange(res)) {\\n throw runtime_error(\\\"\\\");\\n }\\n return res;\\n } else if(s[p] == '(') {\\n int res = expr(s, ++p);\\n if(p < s.size() && s[p] != ')') {\\n throw runtime_error(\\\"\\\");\\n }\\n ++p;\\n return res;\\n } else {\\n throw runtime_error(\\\"\\\");\\n }\\n}\\n\\nint number(string const& s, int& p) {\\n int res = 0;\\n while(p < s.size() && isdigit(s[p])) {\\n res <<= 1;\\n res |= s[p] == '1';\\n ++p;\\n }\\n if(!isrange(res)) {\\n throw runtime_error(\\\"\\\");\\n }\\n return res;\\n}\\n\\nbool check(string const& s) {\\n stack<int> st;\\n vector<vector<bool>> par(s.size(), vector<bool>(s.size()));\\n bool ok = true;\\n for(int i=0; i<s.size(); ++i) {\\n if(s[i] == '(') {\\n st.push(i);\\n }\\n if(s[i] == ')') {\\n if(st.empty()) {\\n ok = false;\\n break;\\n }\\n if(s[st.top()+1] == '(' && s[i-1] == ')' && par[st.top()+1][i-1]) {\\n ok = false;\\n break;\\n }\\n par[st.top()][i] = true;\\n bool f = false;\\n for(int j=st.top()+1; j<i; ++j) {\\n f |= !isdigit(s[j]);\\n }\\n st.pop();\\n ok &= f;\\n }\\n }\\n return st.empty() && ok;\\n}\\n\\nint solve(int i, string& s, vector<int> const& lost) {\\n int res = -1;\\n if(i == lost.size()) {\\n try {\\n int p = 0;\\n if(check(s)) {\\n res = expr(s, p);\\n }\\n return (p == s.size() ? res : -1);\\n } catch(...) {\\n return -1;\\n }\\n }\\n for(int j=0; j<w.size(); ++j) {\\n s[lost[i]] = w[j];\\n res = max(res, solve(i+1, s, lost));\\n }\\n return res;\\n}\\n\\nint main() {\\n string s;\\n cin >> s;\\n vector<int> pos;\\n for(int i=0; i<s.size(); ++i) {\\n if(s[i] == '.') {\\n pos.push_back(i);\\n }\\n }\\n cout << solve(0, s, pos) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -1.0527,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2428_10511877\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(v) (v).begin(),(v).end()\\n#define pb(a) push_back(a)\\n#define rep(i, n) for(int i=0;i<n;i++)\\n#define foa(e, v) for(auto&& e : v)\\nusing ll = long long;\\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\nbool isin(char c, string t) {\\n\\tfoa(e, t) if(c == e) return true;\\n\\treturn false;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\tstring C = \\\"01+-*()\\\";\\n\\n\\tstring s; cin >> s;\\n\\tvector<int> vec;\\n\\tint n = s.size();\\n\\trep(i, n) {\\n\\t\\tif(s[i] == '.') {\\n\\t\\t\\tvec.pb(i);\\n\\t\\t}\\n\\t}\\n\\tint sz = vec.size();\\n\\tint ans = -1;\\n\\t\\n\\tauto solve = [&](string t) -> void {\\n\\t\\tstring u = \\\"\\\";\\n\\t\\tvector<string> v;\\n\\t\\tint sum = -1;\\n\\t\\tfoa(e, t) {\\n\\t\\t\\tif(e == '0' or e == '1') {\\n\\t\\t\\t\\tif(sum == -1) sum = e - '0';\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tsum *= 2;\\n\\t\\t\\t\\t\\tsum += e - '0';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(sum >= 1024) return;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif(sum == -1) {\\n\\t\\t\\t\\t\\tu += e;\\n\\t\\t\\t\\t\\tv.push_back(string(1, e));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tu += to_string(sum);\\n\\t\\t\\t\\t\\tv.pb(to_string(sum));\\n\\t\\t\\t\\t\\tsum = -1;\\n\\t\\t\\t\\t\\tu += e;\\n\\t\\t\\t\\t\\tv.push_back(string(1, e));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(sum >= 1024) return;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(sum != -1) {\\n\\t\\t\\tu += to_string(sum);\\n\\t\\t\\tv.pb(to_string(sum));\\n\\t\\t}\\n\\t\\tint num = 0;\\n\\t\\tfoa(e, u) {\\n\\t\\t\\tif(e == '(') num ++;\\n\\t\\t\\telse if(e == ')') {\\n\\t\\t\\t\\tnum --;\\n\\t\\t\\t\\tif(num < 0) return;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(num) return;\\n\\t\\tint usz = u.size() - 1;\\n\\t\\trep(i, usz) if(isin(u[i], \\\"*+-\\\") and isin(u[i + 1], \\\"*+-\\\")) return;\\n\\t\\trep(i, usz) if(isin(u[i], \\\"*+-\\\") and isin(u[i + 1], \\\")\\\")) return;\\n\\t\\trep(i, usz) if(isin(u[i], \\\"(\\\") and isin(u[i + 1], \\\"*+-\\\")) return;\\n\\t\\trep(i, usz) if(isin(u[i], \\\")\\\") and isin(u[i + 1], \\\"(\\\")) return;\\n\\t\\trep(i, usz) if(isin(u[i], \\\"(\\\") and isin(u[i + 1], \\\")\\\")) return;\\n\\n\\t\\tint szv = v.size();\\n\\t\\trep(j, szv - 2) {\\n\\t\\t\\tif(isin(v[j][0], \\\"(\\\") and isin(v[j + 2][0], \\\")\\\")) return;\\n\\t\\t}\\n\\t\\tbool ng = 0;\\n\\t\\tauto dfs = [&](auto dfs, int i, bool flag) -> pair<int, int> {\\n\\t\\t\\tint K = i;\\n\\t\\t\\tvector<char> a;\\n\\t\\t\\tvector<int> b;\\n\\t\\t\\tint p = -1;\\n\\t\\t\\twhile(i < szv and v[i] != \\\")\\\") {\\n\\t\\t\\t\\tif(v[i] == \\\"(\\\") {\\n\\t\\t\\t\\t\\tauto [val, id] = dfs(dfs, i + 1, 1);\\n\\t\\t\\t\\t\\tif(!(0 <= val and val < 1024)) {\\n\\t\\t\\t\\t\\t\\tng = 1;\\n\\t\\t\\t\\t\\t\\tval = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ti = id + 1;\\n\\t\\t\\t\\t\\tif(p == 0) ng = 1;\\n\\t\\t\\t\\t\\tp = 0;\\n\\t\\t\\t\\t\\tb.pb(val);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tassert(v[i] != \\\")\\\");\\n\\t\\t\\t\\tif(isin(v[i][0], \\\"*+-\\\")) {\\n\\t\\t\\t\\t\\tif(p != 0) ng = 1;\\n\\t\\t\\t\\t\\tp = 1;\\n\\t\\t\\t\\t\\ta.pb(v[i][0]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif(p == 0) ng = 1;\\n\\t\\t\\t\\t\\tp = 0;\\n\\t\\t\\t\\t\\tb.pb(stoi(v[i]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ti ++;\\n\\t\\t\\t}\\n\\t\\t\\tvector<char> A;\\n\\t\\t\\tvector<int> B;\\n\\t\\t\\tint ss = a.size();\\n\\t\\t\\tif(flag and ss == 0) ng = 1;\\n\\t\\t\\tif(ss + 1 != (int)b.size()) {\\n\\t\\t\\t\\tng = 1;\\n\\t\\t\\t\\ta.clear();\\n\\t\\t\\t\\tss = 0;\\n\\t\\t\\t\\tb.pb(0);\\n\\t\\t\\t}\\n\\t\\t\\tB.pb(b[0]);\\n\\t\\t\\trep(j, ss) {\\n\\t\\t\\t\\tif(a[j] == '*') {\\n\\t\\t\\t\\t\\tB.back() *= b[j + 1];\\n\\t\\t\\t\\t\\tif(B.back() >= 1024) {\\n\\t\\t\\t\\t\\t\\tB.back() = 0;\\n\\t\\t\\t\\t\\t\\tng = 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tA.pb(a[j]);\\n\\t\\t\\t\\t\\tB.pb(b[j + 1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tint sum = B[0];\\n\\t\\t\\tss = A.size();\\n\\t\\t\\trep(j, ss) {\\n\\t\\t\\t\\tif(A[j] == '-') {\\n\\t\\t\\t\\t\\tsum -= B[j + 1];\\n\\t\\t\\t\\t\\tif(sum < 0 or sum >= 1024) {\\n\\t\\t\\t\\t\\t\\tng = 1;\\n\\t\\t\\t\\t\\t\\tsum = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tsum += B[j + 1];\\n\\t\\t\\t\\t\\tif(sum < 0 or sum >= 1024) {\\n\\t\\t\\t\\t\\t\\tng = 1;\\n\\t\\t\\t\\t\\t\\tsum = 0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn {sum, i};\\n\\t\\t};\\n\\t\\tauto [val, i] = dfs(dfs, 0, 0);\\n\\t\\tif(!ng) ans = max(ans, val);\\n\\t};\\n\\tauto dfs1 = [&](auto dfs1, int vec_i, string in) -> void {\\n\\t\\tif(vec_i == sz) {\\n\\t\\t\\tstring t = s;\\n\\t\\t\\trep(i, sz) t[vec[i]] = in[i];\\n\\t\\t\\tsolve(t);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tfoa(e, C) {\\n\\t\\t\\tdfs1(dfs1, vec_i + 1, in + e);\\n\\t\\t}\\n\\t};\\n\\tdfs1(dfs1, 0, \\\"\\\");\\n\\tcout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.3693,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2428_9773091\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n#define srep(i, s, t) for(int i = (s); i < (t); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\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; }\\nusing i64 = long long;\\nusing f64 = long double;\\ni64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0); }\\ni64 ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }\\n\\nint n, i;\\nstring s;\\nconstexpr int L = 1 << 10;\\n#define RANGE if(not (0 <= res and res < L)) throw logic_error(\\\"! 0 <= x < L\\\")\\n\\nint expression();\\nint term();\\nint factor();\\nint number();\\n\\nint expression() {\\n int res = term(); RANGE;\\n while(i < n) {\\n if(s[i] == '+') {\\n i++;\\n res += term(); RANGE;\\n } else if(s[i] == '-') {\\n i++;\\n res -= term(); RANGE;\\n } else break;\\n }\\n return res;\\n}\\n\\nint term() {\\n int res = factor(); RANGE;\\n while(i < n) {\\n if(s[i] == '*') {\\n i++;\\n res *= factor(); RANGE;\\n } else break;\\n }\\n return res;\\n}\\n\\nint factor() {\\n if(i == n) throw logic_error(\\\"index\\\");\\n if(s[i] == '(') {\\n i++;\\n int res = expression(); RANGE;\\n if(i == n or i < n and s[i] != ')') throw logic_error(\\\"braket\\\");\\n i++;\\n return res;\\n } else if(isdigit(s[i])) {\\n return number();\\n } else {\\n throw logic_error(\\\"symbol\\\");\\n }\\n}\\n\\nint number() {\\n if(i == n) throw logic_error(\\\"index\\\");\\n int res = 0;\\n while(i < n and isdigit(s[i])) {\\n res <<= 1;\\n res += (s[i] - '0');\\n RANGE;\\n i++;\\n }\\n return res;\\n}\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n \\n string org; cin >> org;\\n n = org.size();\\n int ans = -1;\\n vector<int> I;\\n rep(p, n) if(org[p] == '.') I.push_back(p);\\n auto dfs = [&](auto&& dfs, int p) -> void {\\n if(p == I.size()) {\\n s = org;\\n i = 0;\\n\\n try {\\n int cur = expression();\\n if(i != n) throw logic_error(\\\"i!=n\\\");\\n bool value_only = [&] {\\n vector<vector<char>> v = {{}};\\n for(char c : org) {\\n if(c == '(') {\\n v.push_back({c});\\n } else if(c == ')') {\\n if(v.back().size() <= 1) return true;\\n v.pop_back();\\n } else if(not isdigit(c)) {\\n v.back().push_back(c);\\n }\\n }\\n return false;\\n }();\\n if(value_only) throw logic_error(\\\"value only\\\");\\n chmax(ans, cur);\\n // cout << org << \\\" \\\" << cur << \\\"\\\\n\\\";\\n } catch(logic_error e) {\\n // cout << org << \\\" \\\" << e.what() << \\\"\\\\n\\\";\\n }\\n return;\\n }\\n\\n for(char c : {'0', '1', '+', '-', '*', '(', ')'}) {\\n org[I[p]] = c;\\n dfs(dfs, p + 1);\\n org[I[p]] = '.';\\n }\\n }; dfs(dfs, 0);\\n\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.6949,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2428_8483809\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nclass ParseError {};\\n\\nstruct Parser {\\n using CopyIter = std::string::const_iterator;\\n using Iter = CopyIter&;\\n std::string line;\\n\\n Parser(std::string s): line(s) {}\\n\\n void skip(Iter it, char c) {\\n if (*it != c) {\\n throw ParseError();\\n }\\n // std::cerr << *it << ' ' << c << std::endl;\\n assert(*it == c);\\n ++it;\\n }\\n\\n void check(int value) {\\n if (!(0 <= value && value < (1 << 10))) {\\n throw ParseError();\\n }\\n }\\n\\n void check() {\\n std::vector<char> stack;\\n for (auto c: line) {\\n if (contain({'+', '-', '*', '('}, c)) {\\n stack.push_back(c);\\n } else if (c == ')') {\\n if (stack.empty() || stack.back() == '(') {\\n throw ParseError();\\n }\\n while (!stack.empty() && stack.back() != '(') stack.pop_back();\\n if (stack.empty()) {\\n throw ParseError();\\n }\\n assert(stack.back() == '(');\\n stack.pop_back();\\n }\\n }\\n }\\n\\n int plus(int lhs, int rhs) {\\n check(lhs);\\n check(rhs);\\n check(lhs + rhs);\\n return lhs + rhs;\\n }\\n\\n int minus(int lhs, int rhs) {\\n check(lhs);\\n check(rhs);\\n check(lhs - rhs);\\n return lhs - rhs;\\n }\\n\\n int mul(int lhs, int rhs) {\\n check(lhs);\\n check(rhs);\\n check(lhs * rhs);\\n return lhs * rhs;\\n }\\n\\n bool contain(const std::vector<char>& set, char elem) {\\n return std::find(set.begin(), set.end(), elem) != set.end();\\n }\\n\\n int parse() {\\n try {\\n check();\\n auto it = line.cbegin();\\n auto res = expr(it);\\n if (it == line.end()) return res;\\n return -1;\\n } catch(ParseError) {\\n return -1;\\n }\\n }\\n\\n int expr(Iter it) {\\n auto res = term(it);\\n\\n while (it != line.end() && contain({'+', '-'}, *it)) {\\n if (*it == '+') {\\n skip(it, '+');\\n res = plus(res, term(it));\\n } else {\\n skip(it, '-');\\n res = minus(res, term(it));\\n }\\n }\\n\\n return res;\\n }\\n\\n int term(Iter it) {\\n auto res = factor(it);\\n\\n while (it != line.end() && contain({'*'}, *it)) {\\n skip(it, '*');\\n res = mul(res, factor(it));\\n }\\n\\n return res;\\n }\\n\\n int factor(Iter it) {\\n if (*it == '(') {\\n skip(it, '(');\\n auto res = expr(it);\\n skip(it, ')');\\n return res;\\n }\\n return number(it);\\n }\\n\\n int number(Iter it) {\\n int res = 0;\\n if (!contain({'0', '1'}, *it)) {\\n throw ParseError();\\n }\\n while (it != line.end() && contain({'0', '1'}, *it)) {\\n char c = *it;\\n skip(it, c);\\n res = (res << 1) | (c - '0');\\n check(res);\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n constexpr int W = 7;\\n const char alphabet[W] = {'+', '-', '*', '1', '0', '(', ')'};\\n\\n std::string line;\\n std::cin >> line;\\n\\n std::vector<int> dot_index;\\n for (int i = 0; i < (int)line.size(); i++) {\\n if (line[i] == '.') {\\n dot_index.push_back(i);\\n }\\n }\\n assert(dot_index.size() <= 5);\\n\\n int n = dot_index.size();\\n int m = 1;\\n for (int i = 0; i < n; i++) m *= W;\\n\\n int ans = -1;\\n for (int state = 0; state < m; state++) {\\n int temp = state;\\n for (int i = 0; i < n; i++) {\\n line[dot_index[i]] = alphabet[temp % W];\\n temp /= W;\\n }\\n Parser parser(line);\\n ans = std::max(ans, parser.parse());\\n }\\n std::cout << ans << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.5076,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2428_7219110\",\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 all(x) (x).begin(), (x).end()\\n\\nstring s;\\nstring token = \\\"01+-*()\\\";\\n\\nvoid check(bool f) {\\n if (!f) throw runtime_error(\\\"hello\\\");\\n}\\n\\nint evaluate();\\npair<int, int> expr(int k, bool paren);\\npair<int, int> number(int k);\\n\\nint fix_unknown(int k) {\\n if (k == (int)s.size()) {\\n // cerr << s << \\\": \\\";\\n int ans;\\n try {\\n ans = evaluate();\\n } catch (...) {\\n ans = -1;\\n }\\n // cerr << ans << endl;\\n return ans;\\n }\\n if (s[k] != '.') {\\n return fix_unknown(k+1);\\n }\\n int ret = -1;\\n for (char c : token) {\\n s[k] = c;\\n ret = max(ret, fix_unknown(k+1));\\n }\\n s[k] = '.';\\n return ret;\\n}\\n\\nint evaluate() {\\n auto [x, k] = expr(0, false);\\n check(k == (int)s.size());\\n return x;\\n}\\n\\nbool is_op(char c) {\\n return c == '+' || c == '-' || c == '*';\\n}\\n\\npair<int, int> expr(int k, bool paren) {\\n // cout << \\\"expr: \\\" << k << \\\" \\\" << need_op << endl;\\n int x = 0;\\n int term = 0;\\n bool first = true;\\n bool use_op = false;\\n while (k < (int)s.size() && s[k] != ')') {\\n\\n char op = '+';\\n\\n if (!first) {\\n check(is_op(s[k]));\\n op = s[k++];\\n use_op = true;\\n }\\n first = false;\\n\\n int y;\\n if (s[k] == '(') {\\n ++k;\\n tie(y, k) = expr(k, true);\\n check(k >= 0 && s[k] == ')');\\n ++k;\\n } else {\\n tie(y, k) = number(k);\\n check(k >= 0);\\n }\\n\\n if (op == '*') {\\n term *= y;\\n check(abs(term) < (1<<10));\\n } else {\\n x += term;\\n check(0 <= x && x < (1<<10));\\n term = y;\\n if (op == '-') term *= -1;\\n }\\n }\\n check(!first);\\n x += term;\\n check(0 <= x && x < (1<<10));\\n if (paren) check(use_op);\\n return {x, k};\\n}\\n\\npair<int, int> number(int k) {\\n // cout << \\\"number: \\\" << k << endl;\\n check(s[k] == '0' || s[k] == '1');\\n int n = 0;\\n while (k < (int) s.size() && (s[k] == '0' || s[k] == '1')) {\\n n = 2*n + (s[k]-'0');\\n check(0 <= n && n < (1<<10));\\n ++k;\\n }\\n return {n, k};\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n cin >> s;\\n cout << fix_unknown(0) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.5187,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2428_5255132\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n\\nusing namespace std;\\n\\nstruct Parser {\\n static void check(int x) {\\n if (x < 0 || (1 << 10) <= x) throw(0);\\n }\\n\\n string s;\\n int i;\\n bool simple;\\n\\n explicit Parser(const string& s) : s(s), i(0), simple(true) {\\n this->s.push_back('$');\\n }\\n\\n int expr() {\\n auto ret = term();\\n\\n while (s[i] == '+' || s[i] == '-') {\\n simple = false;\\n char op = s[i];\\n\\n ++i;\\n auto x = term();\\n\\n if (op == '+') {\\n ret += x;\\n } else {\\n ret -= x;\\n }\\n check(ret);\\n }\\n\\n return ret;\\n }\\n\\n int term() {\\n auto ret = factor();\\n\\n while (s[i] == '*') {\\n simple = false;\\n\\n ++i;\\n auto x = factor();\\n\\n ret *= x;\\n check(ret);\\n }\\n\\n return ret;\\n }\\n\\n int factor() {\\n if (s[i] == '(') {\\n ++i;\\n\\n auto ps = simple;\\n simple = true;\\n\\n auto ret = expr();\\n if (s[i] != ')' || simple) throw(0);\\n ++i;\\n\\n simple = ps;\\n return ret;\\n\\n } else {\\n return number();\\n }\\n }\\n\\n int number() {\\n if (!isdigit(s[i])) throw(0);\\n\\n int ret = 0;\\n while (isdigit(s[i])) {\\n ret = (ret << 1) + (s[i++] - '0');\\n check(ret);\\n }\\n return ret;\\n }\\n\\n int parse() {\\n i = 0;\\n simple = true;\\n\\n try {\\n auto ret = expr();\\n return s[i] == '$' ? ret : -1;\\n } catch (int t) {\\n return -1;\\n }\\n }\\n};\\n\\nconst string ops{\\\"01+-*()\\\"};\\n\\nvoid solve() {\\n string s;\\n cin >> s;\\n int n = s.length();\\n Parser p(s);\\n\\n int ans = -1;\\n auto dfs = [&](auto&& f) -> void {\\n int i = 0;\\n while (i < n && p.s[i] != '.') ++i;\\n\\n if (i < n) {\\n for (char c : ops) {\\n p.s[i] = c;\\n f(f);\\n }\\n p.s[i] = '.';\\n } else {\\n ans = max(ans, p.parse());\\n }\\n };\\n dfs(dfs);\\n\\n cout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.3783,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2428_4356485\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T& a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate<class T>\\nbool chmin(T& a, const T& b) {\\n if (b < a) { a = b; return true; }\\n return false;\\n}\\n\\n// std::vector Declaration\\ntemplate<typename T>\\nvector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T, typename... Ts>\\nauto make_v(size_t a, Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\\n}\\n\\n// std::vector Declaration and Initialization\\ntemplate<typename T>\\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\\ntemplate<typename T, typename U, typename... Ts>\\nauto make_vector(size_t a, U b, Ts... ts) {\\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\\n}\\n\\n// std::vector Input\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\n\\n// std::vector Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::array Debug\\ntemplate<typename T, size_t n>\\nostream& operator<<(ostream& os, const array<T, n>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::deque Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const deque<T>& d) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : d) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::pair Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << \\\"(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\n// std::set Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const set<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::multiset Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const multiset<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::map Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const map<T, U>& mp) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : mp) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e.first << \\\":\\\" << e.second;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::tuple Debug\\ntemplate<int N, class Tuple>\\nvoid out(ostream& os, const Tuple& t){}\\ntemplate<int N, class Tuple, class H, class ...Ts>\\nvoid out(ostream& os, const Tuple& t) {\\n if (N) os << \\\" \\\";\\n os << get<N>(t);\\n out<N+1,Tuple,Ts...>(os, t);\\n}\\ntemplate<class ...Ts>\\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\\n os << \\\"(\\\";\\n out<0,tuple<Ts...>,Ts...>(os, t);\\n os << \\\")\\\";\\n return os;\\n}\\n\\n// Debug\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n\\n// Weighted edge\\ntemplate<typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge() {}\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n friend ostream& operator<<(ostream& os, const edge& e) {\\n return os << \\\"(\\\" << e.src << \\\"->\\\" << e.to << \\\":\\\" << e.cost << \\\")\\\";\\n }\\n};\\n\\nusing LL = int64_t;\\n\\n#define fs first\\n#define sc second\\n\\nconst int64_t MOD = 1e9+7;\\n\\nusing State = string::const_iterator;\\nclass ParseError {};\\n\\nint number(State& begin) {\\n int ret = 0;\\n while (*begin == '0' or *begin == '1') {\\n ret <<= 1;\\n ret += (*begin - '0');\\n if (ret < 0 or 1<<10 <= ret) {\\n throw ParseError();\\n }\\n ++begin;\\n }\\n return ret;\\n}\\n\\npair<int,int> expression(State& begin);\\n\\nint factor(State& begin) {\\n if (*begin == '(') {\\n ++begin;\\n int ret, cnt; tie(ret, cnt) = expression(begin);\\n if (cnt == 0) {\\n throw ParseError();\\n }\\n if (ret < 0 or 1<<10 <= ret) {\\n throw ParseError();\\n }\\n if (*begin != ')') {\\n throw ParseError();\\n }\\n ++begin;\\n return ret;\\n } else if (*begin == '0' or *begin == '1') {\\n return number(begin);\\n } else {\\n throw ParseError();\\n }\\n}\\n\\npair<int,int> term(State& begin) {\\n int prod = 1, cnt = 0;\\n while (true) {\\n prod *= factor(begin);\\n if (prod < 0 or 1<<10 <= prod) {\\n throw ParseError();\\n }\\n if (*begin != '*') {\\n return { prod, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\npair<int,int> expression(State& begin) {\\n int sum = 0, cnt = 0;\\n int plus = 1;\\n while (true) {\\n int s, c; tie(s, c) = term(begin);\\n sum += s * plus;\\n cnt += c;\\n if (sum < 0 or 1<<10 <= sum) {\\n throw ParseError();\\n }\\n if (*begin == '+') {\\n plus = 1;\\n } else if (*begin == '-') {\\n plus = -1;\\n } else {\\n return { sum, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\nvoid test_number() {\\n string s = \\\"1010\\\";\\n State begin = s.begin();\\n assert(number(begin) == 10);\\n}\\nvoid test() {\\n //string s = \\\"1+10*10+10*(10+10+1)\\\";\\n //State begin = s.begin();\\n //assert(expression(begin).first == 15);\\n string s = \\\"(1+1+1)\\\";\\n State begin = s.begin();\\n assert(expression(begin).first == 3);\\n}\\n\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n\\n test_number();\\n test();\\n\\n string s; cin >> s;\\n vector<int> unknown;\\n for (int i = 0; i < s.size(); ++i) {\\n if (s[i] == '.') {\\n unknown.push_back(i);\\n }\\n }\\n\\n int m = unknown.size();\\n\\n vector<int> a(m+1);\\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\\n\\n int ans = numeric_limits<int>::min();\\n\\n while (!a[m]) {\\n\\n string t = s;\\n for (int i = 0; i < m; ++i) {\\n t[unknown[i]] = ch[a[i]];\\n }\\n\\n State begin = t.begin();\\n try {\\n int val = expression(begin).first;\\n if (*begin == '\\\\0') {\\n chmax(ans, val);\\n }\\n } catch (const ParseError& e) {\\n }\\n\\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\\n }\\n\\n cout << (ans == numeric_limits<int>::min() ? -1 : ans) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.5275,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2428_4356475\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T& a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate<class T>\\nbool chmin(T& a, const T& b) {\\n if (b < a) { a = b; return true; }\\n return false;\\n}\\n\\n// std::vector Declaration\\ntemplate<typename T>\\nvector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T, typename... Ts>\\nauto make_v(size_t a, Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\\n}\\n\\n// std::vector Declaration and Initialization\\ntemplate<typename T>\\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\\ntemplate<typename T, typename U, typename... Ts>\\nauto make_vector(size_t a, U b, Ts... ts) {\\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\\n}\\n\\n// std::vector Input\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\n\\n// std::vector Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::array Debug\\ntemplate<typename T, size_t n>\\nostream& operator<<(ostream& os, const array<T, n>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::deque Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const deque<T>& d) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : d) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::pair Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << \\\"(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\n// std::set Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const set<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::multiset Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const multiset<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::map Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const map<T, U>& mp) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : mp) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e.first << \\\":\\\" << e.second;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::tuple Debug\\ntemplate<int N, class Tuple>\\nvoid out(ostream& os, const Tuple& t){}\\ntemplate<int N, class Tuple, class H, class ...Ts>\\nvoid out(ostream& os, const Tuple& t) {\\n if (N) os << \\\" \\\";\\n os << get<N>(t);\\n out<N+1,Tuple,Ts...>(os, t);\\n}\\ntemplate<class ...Ts>\\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\\n os << \\\"(\\\";\\n out<0,tuple<Ts...>,Ts...>(os, t);\\n os << \\\")\\\";\\n return os;\\n}\\n\\n// Debug\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n\\n// Weighted edge\\ntemplate<typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge() {}\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n friend ostream& operator<<(ostream& os, const edge& e) {\\n return os << \\\"(\\\" << e.src << \\\"->\\\" << e.to << \\\":\\\" << e.cost << \\\")\\\";\\n }\\n};\\n\\nusing LL = int64_t;\\n\\n#define fs first\\n#define sc second\\n\\nconst int64_t MOD = 1e9+7;\\n\\nusing State = string::const_iterator;\\nclass ParseError {};\\n\\nint number(State& begin) {\\n int ret = 0;\\n while (*begin == '0' or *begin == '1') {\\n ret <<= 1;\\n ret += (*begin - '0');\\n if (ret >= 1<<10) {\\n throw ParseError();\\n }\\n ++begin;\\n }\\n return ret;\\n}\\n\\npair<int,int> expression(State& begin);\\n\\nint factor(State& begin) {\\n if (*begin == '(') {\\n ++begin;\\n int ret, cnt; tie(ret, cnt) = expression(begin);\\n if (cnt == 0) {\\n throw ParseError();\\n }\\n if (ret >= 1<<10) {\\n throw ParseError();\\n }\\n if (*begin != ')') {\\n throw ParseError();\\n }\\n ++begin;\\n return ret;\\n } else if (*begin == '0' or *begin == '1') {\\n return number(begin);\\n } else {\\n throw ParseError();\\n }\\n}\\n\\npair<int,int> term(State& begin) {\\n int prod = 1, cnt = 0;\\n while (true) {\\n prod *= factor(begin);\\n if (prod >= 1<<10) {\\n throw ParseError();\\n }\\n if (*begin != '*') {\\n return { prod, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\npair<int,int> expression(State& begin) {\\n int sum = 0, cnt = 0;\\n int plus = 1;\\n while (true) {\\n int s, c; tie(s, c) = term(begin);\\n sum += s * plus;\\n cnt += c;\\n if (sum >= 1<<10) {\\n throw ParseError();\\n }\\n if (*begin == '+') {\\n plus = 1;\\n } else if (*begin == '-') {\\n plus = -1;\\n } else {\\n return { sum, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\nvoid test_number() {\\n string s = \\\"1010\\\";\\n State begin = s.begin();\\n assert(number(begin) == 10);\\n}\\nvoid test() {\\n //string s = \\\"1+10*10+10*(10+10+1)\\\";\\n //State begin = s.begin();\\n //assert(expression(begin).first == 15);\\n string s = \\\"(1+1+1)\\\";\\n State begin = s.begin();\\n assert(expression(begin).first == 3);\\n}\\n\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n\\n test_number();\\n test();\\n\\n string s; cin >> s;\\n vector<int> unknown;\\n for (int i = 0; i < s.size(); ++i) {\\n if (s[i] == '.') {\\n unknown.push_back(i);\\n }\\n }\\n\\n int m = unknown.size();\\n\\n vector<int> a(m+1);\\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\\n\\n int ans = numeric_limits<int>::min();\\n\\n while (!a[m]) {\\n\\n string t = s;\\n for (int i = 0; i < m; ++i) {\\n t[unknown[i]] = ch[a[i]];\\n }\\n\\n State begin = t.begin();\\n try {\\n int val = expression(begin).first;\\n if (*begin == '\\\\0') {\\n chmax(ans, val);\\n }\\n } catch (const ParseError& e) {\\n }\\n\\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.11678832116788321,\n \"time_ms\": 50,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.4505,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2428_4356459\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T& a, const T& b) {\\n if (a < b) { a = b; return true; }\\n return false;\\n}\\ntemplate<class T>\\nbool chmin(T& a, const T& b) {\\n if (b < a) { a = b; return true; }\\n return false;\\n}\\n\\n// std::vector Declaration\\ntemplate<typename T>\\nvector<T> make_v(size_t a) { return vector<T>(a); }\\ntemplate<typename T, typename... Ts>\\nauto make_v(size_t a, Ts... ts) {\\n return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));\\n}\\n\\n// std::vector Declaration and Initialization\\ntemplate<typename T>\\nvector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }\\ntemplate<typename T, typename U, typename... Ts>\\nauto make_vector(size_t a, U b, Ts... ts) {\\n return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));\\n}\\n\\n// std::vector Input\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\n\\n// std::vector Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::array Debug\\ntemplate<typename T, size_t n>\\nostream& operator<<(ostream& os, const array<T, n>& v) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : v) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::deque Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const deque<T>& d) {\\n os << \\\"[\\\";\\n bool a = 1;\\n for (auto e : d) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"]\\\";\\n return os;\\n}\\n\\n// std::pair Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << \\\"(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";\\n return os;\\n}\\n\\n// std::set Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const set<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::multiset Debug\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const multiset<T>& st) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : st) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::map Debug\\ntemplate<typename T, typename U>\\nostream& operator<<(ostream& os, const map<T, U>& mp) {\\n os << \\\"{\\\";\\n bool a = 1;\\n for (auto e : mp) {\\n os << (a ? \\\"\\\" : \\\" \\\");\\n os << e.first << \\\":\\\" << e.second;\\n a = 0;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n\\n// std::tuple Debug\\ntemplate<int N, class Tuple>\\nvoid out(ostream& os, const Tuple& t){}\\ntemplate<int N, class Tuple, class H, class ...Ts>\\nvoid out(ostream& os, const Tuple& t) {\\n if (N) os << \\\" \\\";\\n os << get<N>(t);\\n out<N+1,Tuple,Ts...>(os, t);\\n}\\ntemplate<class ...Ts>\\nostream& operator<<(ostream& os, const tuple<Ts...>& t) {\\n os << \\\"(\\\";\\n out<0,tuple<Ts...>,Ts...>(os, t);\\n os << \\\")\\\";\\n return os;\\n}\\n\\n// Debug\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n\\n// Weighted edge\\ntemplate<typename T>\\nstruct edge {\\n int src, to;\\n T cost;\\n\\n edge() {}\\n edge(int to, T cost) : src(-1), to(to), cost(cost) {}\\n edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}\\n\\n friend ostream& operator<<(ostream& os, const edge& e) {\\n return os << \\\"(\\\" << e.src << \\\"->\\\" << e.to << \\\":\\\" << e.cost << \\\")\\\";\\n }\\n};\\n\\nusing LL = int64_t;\\n\\n#define fs first\\n#define sc second\\n\\nconst int64_t MOD = 1e9+7;\\n\\nusing State = string::const_iterator;\\nclass ParseError {};\\n\\nint number(State& begin) {\\n int ret = 0;\\n while (*begin == '0' or *begin == '1') {\\n ret <<= 1;\\n ret += (*begin - '0');\\n ++begin;\\n }\\n return ret;\\n}\\n\\npair<int,int> expression(State& begin);\\n\\nint factor(State& begin) {\\n if (*begin == '(') {\\n ++begin;\\n int ret, cnt; tie(ret, cnt) = expression(begin);\\n if (cnt == 0) {\\n throw ParseError();\\n }\\n if (*begin != ')') {\\n throw ParseError();\\n }\\n ++begin;\\n return ret;\\n } else if (*begin == '0' or *begin == '1') {\\n return number(begin);\\n } else {\\n throw ParseError();\\n }\\n}\\n\\npair<int,int> term(State& begin) {\\n int prod = 1, cnt = 0;\\n while (true) {\\n prod *= factor(begin);\\n if (*begin != '*') {\\n return { prod, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\npair<int,int> expression(State& begin) {\\n int sum = 0, cnt = 0;\\n int plus = 1;\\n while (true) {\\n int s, c; tie(s, c) = term(begin);\\n sum += s * plus;\\n cnt += c;\\n if (*begin == '+') {\\n plus = 1;\\n } else if (*begin == '-') {\\n plus = -1;\\n } else {\\n return { sum, cnt };\\n }\\n ++cnt;\\n ++begin;\\n }\\n}\\n\\nvoid test_number() {\\n string s = \\\"1010\\\";\\n State begin = s.begin();\\n assert(number(begin) == 10);\\n}\\nvoid test() {\\n //string s = \\\"1+10*10+10*(10+10+1)\\\";\\n //State begin = s.begin();\\n //assert(expression(begin).first == 15);\\n string s = \\\"(1+1+1)\\\";\\n State begin = s.begin();\\n assert(expression(begin).first == 3);\\n}\\n\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n\\n test_number();\\n test();\\n\\n string s; cin >> s;\\n vector<int> unknown;\\n for (int i = 0; i < s.size(); ++i) {\\n if (s[i] == '.') {\\n unknown.push_back(i);\\n }\\n }\\n\\n int m = unknown.size();\\n\\n vector<int> a(m+1);\\n vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};\\n\\n int ans = numeric_limits<int>::min();\\n\\n while (!a[m]) {\\n\\n string t = s;\\n for (int i = 0; i < m; ++i) {\\n t[unknown[i]] = ch[a[i]];\\n }\\n\\n State begin = t.begin();\\n try {\\n int val = expression(begin).first;\\n if (*begin == '\\\\0') {\\n chmax(ans, val);\\n }\\n } catch (const ParseError& e) {\\n }\\n\\n for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.043795620437956206,\n \"time_ms\": 50,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": -0.4215,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2428_4275403\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-5L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\n// geometry library\\n\\ntypedef complex<long double> Point;\\ntypedef pair<complex<long double>, complex<long double>> Line;\\n\\ntypedef struct Circle {\\n complex<long double> center;\\n long double r;\\n}Circle;\\n\\n//内積、 dot(a,b) = |a||b|cos()\\nlong double dot(Point a, Point b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n//外積、cross(a,b) = |a||b|sin()\\nlong double cross(Point a, Point b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\n//線分と点の距離\\nlong double Dist_Line_Point(Line a, Point b) {\\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\\n}\\n\\n//線分の交差判定\\nint is_intersected_ls(Line a, Line b) {\\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < eps) &&\\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < eps);\\n}\\n\\n//線分の交点\\nPoint intersection_l(Line a, Line b) {\\n Point da = a.second - a.first;\\n Point db = b.second - b.first;\\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\\n}\\n\\n//線分と線分の距離\\nlong double Dist_Line_Line(Line a, Line b) {\\n if (is_intersected_ls(a, b) == 1) {\\n return 0;\\n }\\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\\n}\\n\\n//円と円の交点\\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\\n long double dist = abs(a.center - b.center);\\n assert(dist <= eps + a.r + b.r);\\n assert(dist+eps >= abs(a.r - b.r));\\n Point target = b.center - a.center;\\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\\n long double aa = pointer + a.r * a.r - b.r * b.r;\\n aa /= 2.0L;\\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\\n r = r + a.center;\\n l = l + a.center;\\n return mp(l, r);\\n}\\n\\n//end of geometry\\n\\ntemplate<typename A>\\nA pows(A val, ll b) {\\n assert(b >= 1);\\n A ans = val;\\n b--;\\n while (b) {\\n if (b % 2) {\\n ans *= val;\\n }\\n val *= val;\\n b /= 2LL;\\n }\\n return ans;\\n}\\n\\ntemplate<typename A>\\nclass Compressor {\\npublic:\\n bool is_zipped = false;\\n map<A, ll> zipper;\\n map<ll, A> unzipper;\\n queue<A> fetcher;\\n Compressor(){\\n is_zipped = false;\\n zipper.clear();\\n unzipper.clear();\\n }\\n void add(A now) {\\n assert(is_zipped == false);\\n zipper[now] = 1;\\n fetcher.push(now);\\n }\\n void exec() {\\n assert(is_zipped == false);\\n int cnt = 0;\\n for (auto i = zipper.begin(); i != zipper.end(); ++i) {\\n i->second = cnt;\\n unzipper[cnt] = i->first;\\n cnt++;\\n }\\n is_zipped = true;\\n }\\n ll fetch() {\\n assert(is_zipped == true);\\n A hoge = fetcher.front();\\n fetcher.pop();\\n return zipper[hoge];\\n }\\n ll zip(A now) {\\n assert(is_zipped == true);\\n assert(zipper.find(now) != zipper.end());\\n return zipper[now];\\n }\\n A unzip(ll a) {\\n assert(is_zipped == true);\\n assert(a < unzipper.size());\\n return unzipper[a];\\n }\\n ll next(A now) {\\n auto x = zipper.upper_bound(now);\\n if (x == zipper.end()) return zipper.size();\\n return (ll)((*x).second);\\n }\\n ll back(A now) {\\n auto x = zipper.lower_bound(now);\\n if (x == zipper.begin()) return -1;\\n x--;\\n return (ll)((*x).second);\\n }\\n};\\n\\ntemplate<typename A>\\nclass Matrix {\\npublic:\\n vector<vector<A>> data;\\n Matrix(vector<vector<A>> a) :data(a){\\n\\n }\\n Matrix operator + (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data.size());\\n assert(obj.data[0].size() == this->data[0].size());\\n REP(i, obj.data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[i].size()) {\\n A hoge = obj.data[i][q] + (this -> data[i][q]);\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix operator - (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data.size());\\n assert(obj.data[0].size() == this->data[0].size());\\n REP(i, obj.data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[i].size()) {\\n A hoge = this->data[i][q] - obj.data[i][q];\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix operator * (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data[0].size());\\n REP(i, this -> data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[0].size()) {\\n A hoge = (this -> data[i][0]) * (obj.data[0][q]);\\n for(int t = 1;t < obj.data[i].size();++t){\\n hoge += this -> data[i][t] * obj.data[t][q];\\n }\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix &operator *= (const Matrix obj) {\\n *this = (*this * obj);\\n return *this;\\n }\\n Matrix& operator += (const Matrix obj) {\\n *this = (*this + obj);\\n return *this;\\n }\\n Matrix& operator -= (const Matrix obj) {\\n *this = (*this - obj);\\n return *this;\\n }\\n};\\n\\nclass modint {\\npublic:\\n using u64 = std::uint_fast64_t;\\n u64 value = 0;\\n u64 mod;\\n modint(ll a, ll b): value(((a%b) + 2 * b) % b),mod(b) {\\n\\n }\\n modint operator+(const modint rhs) const{\\n return modint(*this) += rhs;\\n }\\n modint operator-(const modint rhs) const{\\n return modint(*this) -= rhs;\\n }\\n modint operator*(const modint rhs) const {\\n return modint(*this) *= rhs;\\n }\\n modint operator/(const modint rhs) const{\\n return modint(*this) /= rhs;\\n }\\n modint& operator+=(const modint rhs) {\\n assert(rhs.mod == mod);\\n value += rhs.value;\\n if (value >= mod) {\\n value -= mod;\\n }\\n return *this;\\n }\\n modint& operator-=(const modint rhs) {\\n assert(rhs.mod == mod);\\n if (value < rhs.value) {\\n value += mod;\\n }\\n value -= rhs.value;\\n return *this;\\n }\\n modint& operator*=(const modint rhs) {\\n assert(rhs.mod == mod);\\n value = (value * rhs.value) % mod;\\n return *this;\\n }\\n modint& operator/=(modint rhs) {\\n assert(rhs.mod == mod);\\n ll rem = mod - 2;\\n while (rem) {\\n if (rem % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n rem /= 2LL;\\n }\\n return *this;\\n }\\n bool operator <(modint rhs) const{\\n return value < rhs.value;\\n }\\n friend ostream& operator<<(ostream& os, modint& p) {\\n os << p.value;\\n return (os);\\n }\\n};\\n\\nclass Dice {\\npublic:\\n vector<ll> vertexs;\\n //Up: 0,Left: 1,Center: 2,Right: 3,Adj: 4, Down: 5\\n Dice(vector<ll> init):vertexs(init){\\n \\n }\\n //Look from Center\\n void RtoL() {\\n for (int q = 1; q < 4; ++q) {\\n swap(vertexs[q], vertexs[q + 1]);\\n }\\n }\\n void LtoR() {\\n for (int q = 3; q >= 1; --q) {\\n swap(vertexs[q], vertexs[q + 1]);\\n }\\n }\\n void UtoD() {\\n swap(vertexs[5], vertexs[4]);\\n swap(vertexs[2], vertexs[5]);\\n swap(vertexs[0], vertexs[2]);\\n }\\n void DtoU() {\\n swap(vertexs[0], vertexs[2]);\\n swap(vertexs[2], vertexs[5]);\\n swap(vertexs[5], vertexs[4]);\\n }\\n bool ReachAble(Dice now) {\\n set<Dice> hoge;\\n queue<Dice> next;\\n next.push(now);\\n hoge.insert(now);\\n while (next.empty() == false) {\\n Dice seeing = next.front();\\n next.pop();\\n if (seeing == *this) return true;\\n seeing.RtoL();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.LtoR();\\n seeing.LtoR();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.RtoL();\\n seeing.UtoD();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.DtoU();\\n seeing.DtoU();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n }\\n return false;\\n }\\n bool operator ==(const Dice& a) {\\n for (int q = 0; q < 6; ++q) {\\n if (a.vertexs[q] != (*this).vertexs[q]) {\\n return false;\\n }\\n }\\n return true;\\n }\\n bool operator <(const Dice& a) const{\\n return (*this).vertexs < a.vertexs;\\n }\\n};\\n\\npair<Dice, Dice> TwoDimDice(int center, int up) {\\n int target = 1;\\n while (true) {\\n if (center != target && 7 - center != target && up != target && 7 - up != target) {\\n break;\\n }\\n target++;\\n }\\n return mp(Dice(vector<ll>{up, target, center, 7 - target, 7 - center, 7 - up}), Dice(vector<ll>{up, 7 - target, center, target, 7 - center, 7 - up}));\\n}\\n\\ntuple<Dice, Dice, Dice, Dice> OneDimDice(int center) {\\n int bo = min(center, 7 - center);\\n pair<int, int> goa;\\n if (bo == 1) {\\n goa = mp(2, 3);\\n }\\n else if (bo == 2) {\\n goa = mp(1, 3);\\n }\\n else if(bo == 3){\\n goa = mp(1, 2);\\n }\\n tuple<Dice, Dice, Dice, Dice> now = make_tuple(Dice(vector<ll>{goa.first,goa.second,center,7 - goa.second,7-center,7 - goa.first}), \\n Dice(vector<ll>{goa.first, 7 - goa.second, center, goa.second, 7 - center, 7 - goa.first}),\\n Dice(vector<ll>{7 - goa.first, goa.second, center, 7 - goa.second, 7 - center, goa.first}),\\n Dice(vector<ll>{7 - goa.first, 7 - goa.second, center, goa.second, 7 - center, goa.first}));\\n return now;\\n}\\n\\ntemplate<typename A,typename B>\\nclass Dijkstra {\\npublic:\\n vector<vector<pair<int, A>>> vertexs;\\n B Cost_Function;\\n Dijkstra(int n, B cost) : Cost_Function(cost){\\n vertexs = vector<vector<pair<int, A>>>(n, vector<pair<int, A>>{});\\n }\\n ~Dijkstra() {\\n vertexs.clear();\\n }\\n void add_edge(int a, int b, A c) {\\n vertexs[a].push_back(mp(b, c));\\n }\\n vector<ll> build_result(int StartPoint) {\\n vector<ll> dist(vertexs.size(), 2e18);\\n dist[StartPoint] = 0;\\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> next;\\n next.push(make_pair(0, StartPoint));\\n while (next.empty() == false) {\\n pair<ll, int> now = next.top();\\n next.pop();\\n if (dist[now.second] != now.first) continue;\\n for (auto x : vertexs[now.second]) {\\n ll now_cost = now.first + Cost_Function(x.second);\\n if (dist[x.first] > now_cost) {\\n dist[x.first] = now_cost;\\n next.push(mp(now_cost, x.first));\\n }\\n }\\n }\\n return dist;\\n }\\n};\\n\\nclass Dinic {\\npublic:\\n struct edge {\\n int to;\\n int cap;\\n int rev;\\n };\\n vector<vector<edge>> Graph;\\n vector<int> level;\\n vector<int> itr;\\n Dinic(int n){\\n Graph = vector<vector<edge>>(n, vector<edge>());\\n }\\n void add_edge(int a, int b, int cap) {\\n Graph[a].push_back(edge{ b, cap ,(int)Graph[b].size() });\\n Graph[b].push_back(edge{ a,0,(int)Graph[a].size() - 1 });\\n }\\n void bfs(int s) {\\n level = vector<int>(Graph.size(), -1);\\n level[s] = 0;\\n queue<int> next;\\n next.push(s);\\n while (next.empty() == false) {\\n int now = next.front();\\n next.pop();\\n for (auto x : Graph[now]) {\\n if (x.cap == 0) continue;\\n if (level[x.to] == -1) {\\n level[x.to] = level[now] + 1;\\n next.push(x.to);\\n }\\n }\\n }\\n }\\n int dfs(int now, int goal, int val) {\\n if (goal == now) return val;\\n for (int& i = itr[now]; i < (int)Graph[now].size(); ++i) {\\n edge& target = Graph[now][i];\\n if (target.cap > 0&&level[now] < level[target.to]) {\\n int d = dfs(target.to, goal, min(val, target.cap));\\n if (d > 0) {\\n target.cap -= d;\\n Graph[target.to][target.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n int run(int s,int t) {\\n int ans = 0;\\n int f = 0;\\n while (bfs(s), level[t] >= 0) {\\n itr = vector<int>(Graph.size(), 0);\\n while ((f = dfs(s, t, 1e9)) > 0) {\\n ans += f;\\n }\\n }\\n return ans;\\n }\\n};\\n\\n//by ei1333\\n//https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html\\ntemplate< typename Monoid >\\nstruct SegmentTree {\\n using F = function< Monoid(Monoid, Monoid) >;\\n\\n int sz;\\n vector< Monoid > seg;\\n\\n const F f;\\n const Monoid M1;\\n\\n SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\\n sz = 1;\\n while (sz < n) sz <<= 1;\\n seg.assign(2 * sz + 1, M1);\\n }\\n\\n void set(int k, const Monoid& x) {\\n seg[k + sz] = x;\\n }\\n\\n void build() {\\n for (int k = sz - 1; k > 0; k--) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n void update(int k, const Monoid& x) {\\n k += sz;\\n seg[k] = x;\\n while (k >>= 1) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n Monoid query(int a, int b) {\\n Monoid L = M1, R = M1;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) L = f(L, seg[a++]);\\n if (b & 1) R = f(seg[--b], R);\\n }\\n return f(L, R);\\n }\\n\\n Monoid operator[](const int& k) const {\\n return seg[k + sz];\\n }\\n\\n template< typename C >\\n int find_subtree(int a, const C& check, Monoid& M, bool type) {\\n while (a < sz) {\\n Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\\n if (check(nxt)) a = 2 * a + type;\\n else M = nxt, a = 2 * a + 1 - type;\\n }\\n return a - sz;\\n }\\n\\n\\n template< typename C >\\n int find_first(int a, const C& check) {\\n Monoid L = M1;\\n if (a <= 0) {\\n if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\\n return -1;\\n }\\n int b = sz;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) {\\n Monoid nxt = f(L, seg[a]);\\n if (check(nxt)) return find_subtree(a, check, L, false);\\n L = nxt;\\n ++a;\\n }\\n }\\n return -1;\\n }\\n\\n template< typename C >\\n int find_last(int b, const C& check) {\\n Monoid R = M1;\\n if (b >= sz) {\\n if (check(f(seg[1], R))) return find_subtree(1, check, R, true);\\n return -1;\\n }\\n int a = sz;\\n for (b += sz; a < b; a >>= 1, b >>= 1) {\\n if (b & 1) {\\n Monoid nxt = f(seg[--b], R);\\n if (check(nxt)) return find_subtree(b, check, R, true);\\n R = nxt;\\n }\\n }\\n return -1;\\n }\\n};\\n\\nvoid init() {\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\n\\nunsigned long xor128() {\\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n unsigned long t = (x ^ (x << 11));\\n x = y; y = z; z = w;\\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\\n}\\n\\n#define int ll\\nint num(State& now) {\\n int ans = 0;\\n while (*now == '0' || *now == '1') {\\n ans *= 2LL;\\n ans += *now - '0';\\n if (ans >= (1 << 10)) {\\n return -1;\\n }\\n now++;\\n }\\n return ans;\\n}\\n\\nint calc(State& now) {\\n int ans = 0;\\n int next_req = 1;\\n if (*now == '0' || *now == '1') {\\n ans = num(now);\\n if (ans == -1) return -1;\\n }\\n else if (*now == '(') {\\n now++;\\n ans = calc(now);\\n if (ans == -1) return -1;\\n now++;\\n }\\n else return -1;\\n vector<pair<int, int>> nexter;\\n nexter.push_back(mp(ans, -1));\\n while (*now != ')') {\\n next_req = 0;\\n if (*now == '+') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n nexter.push_back(mp(hoge, 0));\\n }\\n else if (*now == '-') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n nexter.push_back(mp(hoge, 1));\\n }\\n else if (*now == '*') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n nexter.push_back(mp(hoge, 2));\\n }\\n else if (*now == '0') {\\n return -1;\\n }\\n else if (*now == '1') {\\n return -1;\\n }\\n else if (*now == '(') {\\n return -1;\\n }\\n else break;\\n }\\n if (next_req == 1) {\\n return -1;\\n }\\n for (int q = 1; q < nexter.size(); ++q) {\\n if (nexter[q].second == 2) {\\n nexter[q - 1].first *= nexter[q].first;\\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\\n nexter.erase(nexter.begin() + q);\\n q--;\\n }\\n }\\n for (int q = 1; q < nexter.size(); ++q) {\\n if (nexter[q].second == 0) {\\n nexter[q - 1].first += nexter[q].first;\\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\\n nexter.erase(nexter.begin() + q);\\n q--;\\n }\\n else {\\n nexter[q - 1].first -= nexter[q].first;\\n if (nexter[q - 1].first >= (1 << 10) || nexter[q - 1].first < 0) return -1;\\n nexter.erase(nexter.begin() + q);\\n q--;\\n }\\n }\\n return nexter[0].first;\\n}\\n\\nvoid solve() {\\n string s;\\n cin >> s;\\n s = \\\"0+\\\" + s;\\n s.push_back(')');\\n int ans = -1;\\n REP(i, 7 * 7 * 7 * 7 * 7) {\\n string b;\\n int now = i;\\n string c = \\\"01+-*()\\\";\\n REP(q, s.length()) {\\n if (s[q] == '.') {\\n b.push_back(c[now % 7]);\\n now /= 7;\\n }\\n else {\\n b.push_back(s[q]);\\n }\\n }\\n int ng = 0;\\n for (int q = 0; q < b.length() - 1; ++q) {\\n if (b[q] == '(') {\\n ng++;\\n }\\n else if (b[q] == ')') {\\n ng--;\\n }\\n if (ng < 0) {\\n b.clear();\\n break;\\n }\\n }\\n if (ng != 0) b.clear();\\n if (b.size() == 0) continue;\\n State hoge = b.begin();\\n\\n int nya = calc(hoge);\\n if (nya > ans) {\\n ans = max(ans, nya);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\n#undef int\\nint main() {\\n init();\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.1205,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2428_4275370\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-5L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\n// geometry library\\n\\ntypedef complex<long double> Point;\\ntypedef pair<complex<long double>, complex<long double>> Line;\\n\\ntypedef struct Circle {\\n complex<long double> center;\\n long double r;\\n}Circle;\\n\\n//内積、 dot(a,b) = |a||b|cos()\\nlong double dot(Point a, Point b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n//外積、cross(a,b) = |a||b|sin()\\nlong double cross(Point a, Point b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\n//線分と点の距離\\nlong double Dist_Line_Point(Line a, Point b) {\\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\\n}\\n\\n//線分の交差判定\\nint is_intersected_ls(Line a, Line b) {\\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < eps) &&\\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < eps);\\n}\\n\\n//線分の交点\\nPoint intersection_l(Line a, Line b) {\\n Point da = a.second - a.first;\\n Point db = b.second - b.first;\\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\\n}\\n\\n//線分と線分の距離\\nlong double Dist_Line_Line(Line a, Line b) {\\n if (is_intersected_ls(a, b) == 1) {\\n return 0;\\n }\\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\\n}\\n\\n//円と円の交点\\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\\n long double dist = abs(a.center - b.center);\\n assert(dist <= eps + a.r + b.r);\\n assert(dist+eps >= abs(a.r - b.r));\\n Point target = b.center - a.center;\\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\\n long double aa = pointer + a.r * a.r - b.r * b.r;\\n aa /= 2.0L;\\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\\n r = r + a.center;\\n l = l + a.center;\\n return mp(l, r);\\n}\\n\\n//end of geometry\\n\\ntemplate<typename A>\\nA pows(A val, ll b) {\\n assert(b >= 1);\\n A ans = val;\\n b--;\\n while (b) {\\n if (b % 2) {\\n ans *= val;\\n }\\n val *= val;\\n b /= 2LL;\\n }\\n return ans;\\n}\\n\\ntemplate<typename A>\\nclass Compressor {\\npublic:\\n bool is_zipped = false;\\n map<A, ll> zipper;\\n map<ll, A> unzipper;\\n queue<A> fetcher;\\n Compressor(){\\n is_zipped = false;\\n zipper.clear();\\n unzipper.clear();\\n }\\n void add(A now) {\\n assert(is_zipped == false);\\n zipper[now] = 1;\\n fetcher.push(now);\\n }\\n void exec() {\\n assert(is_zipped == false);\\n int cnt = 0;\\n for (auto i = zipper.begin(); i != zipper.end(); ++i) {\\n i->second = cnt;\\n unzipper[cnt] = i->first;\\n cnt++;\\n }\\n is_zipped = true;\\n }\\n ll fetch() {\\n assert(is_zipped == true);\\n A hoge = fetcher.front();\\n fetcher.pop();\\n return zipper[hoge];\\n }\\n ll zip(A now) {\\n assert(is_zipped == true);\\n assert(zipper.find(now) != zipper.end());\\n return zipper[now];\\n }\\n A unzip(ll a) {\\n assert(is_zipped == true);\\n assert(a < unzipper.size());\\n return unzipper[a];\\n }\\n ll next(A now) {\\n auto x = zipper.upper_bound(now);\\n if (x == zipper.end()) return zipper.size();\\n return (ll)((*x).second);\\n }\\n ll back(A now) {\\n auto x = zipper.lower_bound(now);\\n if (x == zipper.begin()) return -1;\\n x--;\\n return (ll)((*x).second);\\n }\\n};\\n\\ntemplate<typename A>\\nclass Matrix {\\npublic:\\n vector<vector<A>> data;\\n Matrix(vector<vector<A>> a) :data(a){\\n\\n }\\n Matrix operator + (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data.size());\\n assert(obj.data[0].size() == this->data[0].size());\\n REP(i, obj.data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[i].size()) {\\n A hoge = obj.data[i][q] + (this -> data[i][q]);\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix operator - (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data.size());\\n assert(obj.data[0].size() == this->data[0].size());\\n REP(i, obj.data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[i].size()) {\\n A hoge = this->data[i][q] - obj.data[i][q];\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix operator * (const Matrix obj) {\\n vector<vector<A>> ans;\\n assert(obj.data.size() == this->data[0].size());\\n REP(i, this -> data.size()) {\\n ans.push_back(vector<A>());\\n REP(q, obj.data[0].size()) {\\n A hoge = (this -> data[i][0]) * (obj.data[0][q]);\\n for(int t = 1;t < obj.data[i].size();++t){\\n hoge += this -> data[i][t] * obj.data[t][q];\\n }\\n ans.back().push_back(hoge);\\n }\\n }\\n return Matrix(ans);\\n }\\n Matrix &operator *= (const Matrix obj) {\\n *this = (*this * obj);\\n return *this;\\n }\\n Matrix& operator += (const Matrix obj) {\\n *this = (*this + obj);\\n return *this;\\n }\\n Matrix& operator -= (const Matrix obj) {\\n *this = (*this - obj);\\n return *this;\\n }\\n};\\n\\nclass modint {\\npublic:\\n using u64 = std::uint_fast64_t;\\n u64 value = 0;\\n u64 mod;\\n modint(ll a, ll b): value(((a%b) + 2 * b) % b),mod(b) {\\n\\n }\\n modint operator+(const modint rhs) const{\\n return modint(*this) += rhs;\\n }\\n modint operator-(const modint rhs) const{\\n return modint(*this) -= rhs;\\n }\\n modint operator*(const modint rhs) const {\\n return modint(*this) *= rhs;\\n }\\n modint operator/(const modint rhs) const{\\n return modint(*this) /= rhs;\\n }\\n modint& operator+=(const modint rhs) {\\n assert(rhs.mod == mod);\\n value += rhs.value;\\n if (value >= mod) {\\n value -= mod;\\n }\\n return *this;\\n }\\n modint& operator-=(const modint rhs) {\\n assert(rhs.mod == mod);\\n if (value < rhs.value) {\\n value += mod;\\n }\\n value -= rhs.value;\\n return *this;\\n }\\n modint& operator*=(const modint rhs) {\\n assert(rhs.mod == mod);\\n value = (value * rhs.value) % mod;\\n return *this;\\n }\\n modint& operator/=(modint rhs) {\\n assert(rhs.mod == mod);\\n ll rem = mod - 2;\\n while (rem) {\\n if (rem % 2) {\\n *this *= rhs;\\n }\\n rhs *= rhs;\\n rem /= 2LL;\\n }\\n return *this;\\n }\\n bool operator <(modint rhs) const{\\n return value < rhs.value;\\n }\\n friend ostream& operator<<(ostream& os, modint& p) {\\n os << p.value;\\n return (os);\\n }\\n};\\n\\nclass Dice {\\npublic:\\n vector<ll> vertexs;\\n //Up: 0,Left: 1,Center: 2,Right: 3,Adj: 4, Down: 5\\n Dice(vector<ll> init):vertexs(init){\\n \\n }\\n //Look from Center\\n void RtoL() {\\n for (int q = 1; q < 4; ++q) {\\n swap(vertexs[q], vertexs[q + 1]);\\n }\\n }\\n void LtoR() {\\n for (int q = 3; q >= 1; --q) {\\n swap(vertexs[q], vertexs[q + 1]);\\n }\\n }\\n void UtoD() {\\n swap(vertexs[5], vertexs[4]);\\n swap(vertexs[2], vertexs[5]);\\n swap(vertexs[0], vertexs[2]);\\n }\\n void DtoU() {\\n swap(vertexs[0], vertexs[2]);\\n swap(vertexs[2], vertexs[5]);\\n swap(vertexs[5], vertexs[4]);\\n }\\n bool ReachAble(Dice now) {\\n set<Dice> hoge;\\n queue<Dice> next;\\n next.push(now);\\n hoge.insert(now);\\n while (next.empty() == false) {\\n Dice seeing = next.front();\\n next.pop();\\n if (seeing == *this) return true;\\n seeing.RtoL();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.LtoR();\\n seeing.LtoR();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.RtoL();\\n seeing.UtoD();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n seeing.DtoU();\\n seeing.DtoU();\\n if (hoge.count(seeing) == 0) {\\n hoge.insert(seeing);\\n next.push(seeing);\\n }\\n }\\n return false;\\n }\\n bool operator ==(const Dice& a) {\\n for (int q = 0; q < 6; ++q) {\\n if (a.vertexs[q] != (*this).vertexs[q]) {\\n return false;\\n }\\n }\\n return true;\\n }\\n bool operator <(const Dice& a) const{\\n return (*this).vertexs < a.vertexs;\\n }\\n};\\n\\npair<Dice, Dice> TwoDimDice(int center, int up) {\\n int target = 1;\\n while (true) {\\n if (center != target && 7 - center != target && up != target && 7 - up != target) {\\n break;\\n }\\n target++;\\n }\\n return mp(Dice(vector<ll>{up, target, center, 7 - target, 7 - center, 7 - up}), Dice(vector<ll>{up, 7 - target, center, target, 7 - center, 7 - up}));\\n}\\n\\ntuple<Dice, Dice, Dice, Dice> OneDimDice(int center) {\\n int bo = min(center, 7 - center);\\n pair<int, int> goa;\\n if (bo == 1) {\\n goa = mp(2, 3);\\n }\\n else if (bo == 2) {\\n goa = mp(1, 3);\\n }\\n else if(bo == 3){\\n goa = mp(1, 2);\\n }\\n tuple<Dice, Dice, Dice, Dice> now = make_tuple(Dice(vector<ll>{goa.first,goa.second,center,7 - goa.second,7-center,7 - goa.first}), \\n Dice(vector<ll>{goa.first, 7 - goa.second, center, goa.second, 7 - center, 7 - goa.first}),\\n Dice(vector<ll>{7 - goa.first, goa.second, center, 7 - goa.second, 7 - center, goa.first}),\\n Dice(vector<ll>{7 - goa.first, 7 - goa.second, center, goa.second, 7 - center, goa.first}));\\n return now;\\n}\\n\\ntemplate<typename A,typename B>\\nclass Dijkstra {\\npublic:\\n vector<vector<pair<int, A>>> vertexs;\\n B Cost_Function;\\n Dijkstra(int n, B cost) : Cost_Function(cost){\\n vertexs = vector<vector<pair<int, A>>>(n, vector<pair<int, A>>{});\\n }\\n ~Dijkstra() {\\n vertexs.clear();\\n }\\n void add_edge(int a, int b, A c) {\\n vertexs[a].push_back(mp(b, c));\\n }\\n vector<ll> build_result(int StartPoint) {\\n vector<ll> dist(vertexs.size(), 2e18);\\n dist[StartPoint] = 0;\\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> next;\\n next.push(make_pair(0, StartPoint));\\n while (next.empty() == false) {\\n pair<ll, int> now = next.top();\\n next.pop();\\n if (dist[now.second] != now.first) continue;\\n for (auto x : vertexs[now.second]) {\\n ll now_cost = now.first + Cost_Function(x.second);\\n if (dist[x.first] > now_cost) {\\n dist[x.first] = now_cost;\\n next.push(mp(now_cost, x.first));\\n }\\n }\\n }\\n return dist;\\n }\\n};\\n\\nclass Dinic {\\npublic:\\n struct edge {\\n int to;\\n int cap;\\n int rev;\\n };\\n vector<vector<edge>> Graph;\\n vector<int> level;\\n vector<int> itr;\\n Dinic(int n){\\n Graph = vector<vector<edge>>(n, vector<edge>());\\n }\\n void add_edge(int a, int b, int cap) {\\n Graph[a].push_back(edge{ b, cap ,(int)Graph[b].size() });\\n Graph[b].push_back(edge{ a,0,(int)Graph[a].size() - 1 });\\n }\\n void bfs(int s) {\\n level = vector<int>(Graph.size(), -1);\\n level[s] = 0;\\n queue<int> next;\\n next.push(s);\\n while (next.empty() == false) {\\n int now = next.front();\\n next.pop();\\n for (auto x : Graph[now]) {\\n if (x.cap == 0) continue;\\n if (level[x.to] == -1) {\\n level[x.to] = level[now] + 1;\\n next.push(x.to);\\n }\\n }\\n }\\n }\\n int dfs(int now, int goal, int val) {\\n if (goal == now) return val;\\n for (int& i = itr[now]; i < (int)Graph[now].size(); ++i) {\\n edge& target = Graph[now][i];\\n if (target.cap > 0&&level[now] < level[target.to]) {\\n int d = dfs(target.to, goal, min(val, target.cap));\\n if (d > 0) {\\n target.cap -= d;\\n Graph[target.to][target.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n int run(int s,int t) {\\n int ans = 0;\\n int f = 0;\\n while (bfs(s), level[t] >= 0) {\\n itr = vector<int>(Graph.size(), 0);\\n while ((f = dfs(s, t, 1e9)) > 0) {\\n ans += f;\\n }\\n }\\n return ans;\\n }\\n};\\n\\n//by ei1333\\n//https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html\\ntemplate< typename Monoid >\\nstruct SegmentTree {\\n using F = function< Monoid(Monoid, Monoid) >;\\n\\n int sz;\\n vector< Monoid > seg;\\n\\n const F f;\\n const Monoid M1;\\n\\n SegmentTree(int n, const F f, const Monoid& M1) : f(f), M1(M1) {\\n sz = 1;\\n while (sz < n) sz <<= 1;\\n seg.assign(2 * sz + 1, M1);\\n }\\n\\n void set(int k, const Monoid& x) {\\n seg[k + sz] = x;\\n }\\n\\n void build() {\\n for (int k = sz - 1; k > 0; k--) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n void update(int k, const Monoid& x) {\\n k += sz;\\n seg[k] = x;\\n while (k >>= 1) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n Monoid query(int a, int b) {\\n Monoid L = M1, R = M1;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) L = f(L, seg[a++]);\\n if (b & 1) R = f(seg[--b], R);\\n }\\n return f(L, R);\\n }\\n\\n Monoid operator[](const int& k) const {\\n return seg[k + sz];\\n }\\n\\n template< typename C >\\n int find_subtree(int a, const C& check, Monoid& M, bool type) {\\n while (a < sz) {\\n Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);\\n if (check(nxt)) a = 2 * a + type;\\n else M = nxt, a = 2 * a + 1 - type;\\n }\\n return a - sz;\\n }\\n\\n\\n template< typename C >\\n int find_first(int a, const C& check) {\\n Monoid L = M1;\\n if (a <= 0) {\\n if (check(f(L, seg[1]))) return find_subtree(1, check, L, false);\\n return -1;\\n }\\n int b = sz;\\n for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {\\n if (a & 1) {\\n Monoid nxt = f(L, seg[a]);\\n if (check(nxt)) return find_subtree(a, check, L, false);\\n L = nxt;\\n ++a;\\n }\\n }\\n return -1;\\n }\\n\\n template< typename C >\\n int find_last(int b, const C& check) {\\n Monoid R = M1;\\n if (b >= sz) {\\n if (check(f(seg[1], R))) return find_subtree(1, check, R, true);\\n return -1;\\n }\\n int a = sz;\\n for (b += sz; a < b; a >>= 1, b >>= 1) {\\n if (b & 1) {\\n Monoid nxt = f(seg[--b], R);\\n if (check(nxt)) return find_subtree(b, check, R, true);\\n R = nxt;\\n }\\n }\\n return -1;\\n }\\n};\\n\\nvoid init() {\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\n\\nunsigned long xor128() {\\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n unsigned long t = (x ^ (x << 11));\\n x = y; y = z; z = w;\\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\\n}\\n\\n#define int ll\\nint num(State& now) {\\n int ans = 0;\\n while (*now == '0' || *now == '1') {\\n ans *= 2LL;\\n ans += *now - '0';\\n if (ans >= (1 << 10)) {\\n return -1;\\n }\\n now++;\\n }\\n return ans;\\n}\\n\\nint calc(State& now) {\\n int ans = 0;\\n int next_req = 1;\\n if (*now == '0' || *now == '1') {\\n ans = num(now);\\n if (ans == -1) return -1;\\n }\\n else if (*now == '(') {\\n now++;\\n ans = calc(now);\\n if (ans == -1) return -1;\\n now++;\\n }\\n else return -1;\\n while (*now != ')') {\\n next_req = 0;\\n if (*now == '+') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n ans += hoge;\\n }\\n else if (*now == '-') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n ans -= hoge;\\n }\\n else if (*now == '*') {\\n now++;\\n int hoge = 0;\\n if (*now == '(') {\\n now++;\\n hoge = calc(now);\\n if (hoge == -1) return -1;\\n now++;\\n }\\n else if (*now == '0' || *now == '1') {\\n hoge = num(now);\\n if (hoge == -1) return -1;\\n }\\n else return -1;\\n ans *= hoge;\\n }\\n else if (*now == '0') {\\n return -1;\\n }\\n else if (*now == '1') {\\n return -1;\\n }\\n else if (*now == '(') {\\n return -1;\\n }\\n else break;\\n if (ans < 0 || ans >= (1 << 10)) return -1;\\n }\\n if (next_req == 1) {\\n return -1;\\n }\\n return ans;\\n}\\n\\nvoid solve() {\\n string s;\\n cin >> s;\\n s = \\\"0+\\\" + s;\\n s.push_back(')');\\n int ans = -1;\\n REP(i, 7 * 7 * 7 * 7 * 7) {\\n string b;\\n int now = i;\\n string c = \\\"01+-*()\\\";\\n REP(q, s.length()) {\\n if (s[q] == '.') {\\n b.push_back(c[now % 7]);\\n now /= 7;\\n }\\n else {\\n b.push_back(s[q]);\\n }\\n }\\n int ng = 0;\\n for (int q = 0; q < b.length() - 1; ++q) {\\n if (b[q] == '(') {\\n ng++;\\n }\\n else if (b[q] == ')') {\\n ng--;\\n }\\n if (ng < 0) {\\n b.clear();\\n break;\\n }\\n }\\n if (ng != 0) b.clear();\\n if (b.size() == 0) continue;\\n State hoge = b.begin();\\n\\n int nya = calc(hoge);\\n if (nya > ans) {\\n ans = max(ans, nya);\\n }\\n }\\n cout << ans << endl;\\n}\\n\\n#undef int\\nint main() {\\n init();\\n solve();\\n}\",\n \"accuracy\": 0.48905109489051096,\n \"time_ms\": 10,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.1205,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2428_4268961\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _USE_MATH_DEFINES\\n\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-5L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define seg_size 262144LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\n// geometry library\\n\\ntypedef complex<long double> Point;\\ntypedef pair<complex<long double>, complex<long double>> Line;\\n\\ntypedef struct Circle {\\n complex<long double> center;\\n long double r;\\n}Circle;\\n\\n//内積、 dot(a,b) = |a||b|cos()\\nlong double dot(Point a, Point b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n}\\n//外積、cross(a,b) = |a||b|sin()\\nlong double cross(Point a, Point b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n}\\n\\n//線分と点の距離\\nlong double Dist_Line_Point(Line a, Point b) {\\n if (dot(a.second - a.first, b - a.first) < eps) return abs(b - a.first);\\n if (dot(a.first - a.second, b - a.second) < eps) return abs(b - a.second);\\n return abs(cross(a.second - a.first, b - a.first)) / abs(a.second - a.first);\\n}\\n\\n//線分の交差判定\\nint is_intersected_ls(Line a, Line b) {\\n return (cross(a.second - a.first, b.first - a.first) * cross(a.second - a.first, b.second - a.first) < 0) &&\\n (cross(b.second - b.first, a.first - b.first) * cross(b.second - b.first, a.second - b.first) < 0);\\n}\\n\\n//線分の交点\\nPoint intersection_l(Line a, Line b) {\\n Point da = a.second - a.first;\\n Point db = b.second - b.first;\\n return a.first + da * cross(db, b.first - a.first) / cross(db, da);\\n}\\n\\n//線分と線分の距離\\nlong double Dist_Line_Line(Line a, Line b) {\\n if (is_intersected_ls(a, b) == 1) {\\n return 0;\\n }\\n return min({ Dist_Line_Point(a,b.first), Dist_Line_Point(a,b.second),Dist_Line_Point(b,a.first),Dist_Line_Point(b,a.second) });\\n}\\n\\n//円と円の交点\\npair<Point, Point> intersection_Circle_Circle(Circle a, Circle b) {\\n long double dist = abs(a.center - b.center);\\n assert(dist <= eps + a.r + b.r);\\n assert(dist+eps >= abs(a.r - b.r));\\n Point target = b.center - a.center;\\n long double pointer = target.real() * target.real() + target.imag() * target.imag();\\n long double aa = pointer + a.r * a.r - b.r * b.r;\\n aa /= 2.0L;\\n Point l{ (aa * target.real() + target.imag() * sqrt(pointer * a.r * a.r - aa * aa))/pointer,\\n (aa* target.imag() - target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer};\\n Point r{ (aa * target.real() - target.imag() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer,\\n (aa * target.imag() + target.real() * sqrt(pointer * a.r * a.r - aa * aa)) / pointer };\\n r = r + a.center;\\n l = l + a.center;\\n return mp(l, r);\\n}\\n\\n//end of geometry\\n\\n\\n\\nvoid init() {\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\n\\nunsigned long xor128() {\\n static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;\\n unsigned long t = (x ^ (x << 11));\\n x = y; y = z; z = w;\\n return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));\\n}\\n\\n#define int ll\\nint num(State& a) {\\n int ans = 0;\\n while (*a == '0' || *a == '1') {\\n ans *= 2;\\n ans += *a - '0';\\n a++;\\n if (ans >= (1 << 10)) {\\n return -1;\\n }\\n }\\n return ans;\\n}\\nint calc(State& a,int ok) {\\n int hoge =0;\\n if (*a == '(') {\\n a++;\\n hoge = calc(a, 1);\\n }\\n else {\\n if (*a != '0' && *a != '1') return -1;\\n hoge = num(a);\\n }\\n if (hoge == -1) return -1;\\n if (ok == 1 && *a == ')') return -1;\\n while (*a != ')' && *a != ' ') {\\n if (*a == '+') {\\n a++;\\n int tmp = 0;\\n if (*a == '(') {\\n a++;\\n tmp = calc(a, 1);\\n }\\n else {\\n if (*a != '0' && *a != '1') return -1;\\n tmp = num(a);\\n }\\n if (tmp == -1) return -1;\\n hoge += tmp;\\n if (hoge >= (1 << 10)) return -1;\\n }\\n else if (*a == '-') {\\n a++;\\n int tmp = 0;\\n if (*a == '(') {\\n a++;\\n tmp = calc(a, 1);\\n }\\n else {\\n\\n if (*a != '0' && *a != '1') return -1;\\n tmp = num(a);\\n }\\n if (tmp == -1) return -1;\\n hoge -= tmp;\\n if (hoge >= (1 << 10) || hoge < 0) return -1;\\n }\\n else if (*a == '*') {\\n a++;\\n int tmp = 0;\\n if (*a == '(') {\\n a++;\\n tmp = calc(a, 1);\\n }\\n else {\\n if (*a != '0' && *a != '1') return -1;\\n tmp = num(a);\\n }\\n if (tmp == -1) return -1;\\n hoge *= tmp;\\n if (hoge >= (1 << 10) || hoge < 0) return -1;\\n }\\n else return -1;\\n }\\n if (*a == ')') a++;\\n return hoge;\\n}\\nvoid solve(){\\n while (true) {\\n string s;\\n cin >> s;\\n s.push_back(' ');\\n int ans = -1;\\n for (int i = 0; i < 7 * 7 * 7 * 7 * 7; ++i) {\\n string b;\\n int now = i;\\n REP(q, s.length()) {\\n if (s[q] == '.') {\\n if (now % 7 == 0) {\\n b.push_back('0');\\n }\\n else if (now % 7 == 1) {\\n b.push_back('1');\\n }\\n else if (now % 7 == 2) {\\n b.push_back('+');\\n }\\n else if (now % 7 == 3) {\\n b.push_back('-');\\n }\\n else if (now % 7 == 4) {\\n b.push_back('*');\\n }\\n else if (now % 7 == 5) {\\n b.push_back('(');\\n }\\n else if (now % 7 == 6) {\\n b.push_back(')');\\n }\\n now /= 7;\\n }\\n else {\\n b.push_back(s[q]);\\n }\\n }\\n int cnt = 0;\\n REP(q, b.length()-1) {\\n if (b[q] == '(') cnt++;\\n else if (b[q] == ')') cnt--;\\n if (cnt < 0) {\\n b.clear();\\n break;\\n }\\n }\\n if (cnt != 0) b.clear();\\n if (b.empty() == true) continue;\\n State beg = b.begin();\\n ans = max(ans, calc(beg, 0));\\n }\\n cout << ans << endl;\\n return;\\n }\\n}\\n\\n#undef int\\nint main() {\\n init();\\n solve();\\n}\",\n \"accuracy\": 0.48905109489051096,\n \"time_ms\": 10,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.1183,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2428_3925997\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#ifndef LOCAL\\n#define debug(x) ;\\n#else\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\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#endif\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\n/* 再帰下降法 */\\n// char *p = str; res = expr(p);\\n\\nint term(char* &s);\\nint number(char* &s);\\nint factor(char* &s);\\nint expr(char* &s);\\n\\nconst int LIMIT = 1 << 10;\\n\\n//数\\nint number(char* &s){\\n if (!*s) throw \\\"number\\\";\\n\\n int res = 0;\\n while('0' <= *s && *s <= '9')\\n res = res*2 + (*s++ - '0');\\n\\n if (*s == '(') throw \\\"number\\\";\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"number\\\";\\n\\n return res;\\n}\\n\\n//乗算除算(優先順位:高)\\nint term(char* &s){\\n if (!*s) throw \\\"term\\\";\\n\\n int res = factor(s);\\n while(1){\\n if(*s == '*') res *= factor(++s);\\n else if(*s == '/') res /= factor(++s);\\n else break;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n\\n return res;\\n}\\n\\n//括弧か数\\nint factor(char* &s){\\n if (!*s) throw \\\"factor\\\";\\n if (!isdigit(*s) && *s != '(') throw \\\"factor\\\";\\n\\n if(*s != '(') return number(s);\\n int res = expr(++s);\\n\\n if (!*s) throw \\\"factor\\\";\\n\\n s++;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"factor\\\";\\n\\n return res;\\n}\\n\\n//式(優先順位: 低)\\nint expr(char* &s){\\n if (!*s) throw \\\"expr\\\";\\n\\n int res = term(s);\\n while(1){\\n if(*s == '+') res += term(++s);\\n else if(*s == '-') res -= term(++s);\\n else break;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"expr\\\";\\n\\n return res;\\n}\\n\\nbool check(string s) {\\n stack<int> st;\\n\\n for (int i=0; i<s.size(); i++) {\\n switch (s[i]) {\\n case '(':\\n st.push(1);\\n break;\\n case ')': {\\n if (st.empty()) return false;\\n if (st.top() > 0) return false;\\n while(st.size() && st.top() < 0) st.pop();\\n if (st.empty()) return false;\\n st.pop();\\n }\\n break;\\n case '0':\\n case '1':\\n break;\\n default:\\n st.push(-1);\\n break;\\n }\\n }\\n\\n while(st.size() && st.top() < 0)\\n st.pop();\\n\\n return st.empty();\\n}\\n\\n\\nint calc(string s2) {\\n if (!check(s2)) return -1;\\n\\n char s[1000];\\n strcpy(s, s2.c_str());\\n char *p = s;\\n\\n try{\\n int res = expr(p);\\n\\n if (*p) return -1;\\n\\n return res;\\n\\n }catch(...){\\n\\n return -1;\\n }\\n}\\n\\nint main(){\\n string str;\\n\\n cin >> str;\\n\\n vector<int> dots;\\n\\n for (int i=0; i<str.size(); i++)\\n if (str[i] == '.') dots.push_back(i);\\n\\n int ans = -1;\\n\\n int limit = 7 * 7 * 7 * 7 * 7;\\n for (int i=0; i<limit; i++) {\\n int tmp = i;\\n\\n for (int p : dots) {\\n str[p] = \\\"01+-*()\\\"[tmp % 7];\\n tmp /= 7;\\n }\\n\\n int res = calc(str);\\n if (ans < res) {\\n debug(str); debug(res);\\n }\\n\\n ans = max(ans, res);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.8285,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2428_3925995\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#ifndef LOCAL\\n#define debug(x) ;\\n#else\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\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#endif\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\n/* 再帰下降法 */\\n// char *p = str; res = expr(p);\\n\\nint term(char* &s);\\nint number(char* &s);\\nint factor(char* &s);\\nint expr(char* &s);\\n\\nconst int LIMIT = 1 << 10;\\n\\n//数\\nint number(char* &s){\\n if (!*s) throw \\\"number\\\";\\n\\n int res = 0;\\n while('0' <= *s && *s <= '9')\\n res = res*2 + (*s++ - '0');\\n\\n if (*s == '(') throw \\\"number\\\";\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"number\\\";\\n\\n return res;\\n}\\n\\n//乗算除算(優先順位:高)\\nint term(char* &s){\\n if (!*s) throw \\\"term\\\";\\n\\n int res = factor(s);\\n while(1){\\n if(*s == '*') res *= factor(++s);\\n else if(*s == '/') res /= factor(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n\\n return res;\\n}\\n\\n//括弧か数\\nint factor(char* &s){\\n if (!*s) throw \\\"factor\\\";\\n if (!isdigit(*s) && *s != '(') throw \\\"factor\\\";\\n\\n if(*s != '(') return number(s);\\n int res = expr(++s);\\n\\n if (!*s) throw \\\"factor\\\";\\n\\n s++;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"factor\\\";\\n\\n return res;\\n}\\n\\n//式(優先順位: 低)\\nint expr(char* &s){\\n if (!*s) throw \\\"expr\\\";\\n\\n int res = term(s);\\n while(1){\\n if(*s == '+') res += term(++s);\\n else if(*s == '-') res -= term(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"expr\\\";\\n\\n return res;\\n}\\n\\nbool check(string s) {\\n stack<int> st;\\n\\n for (int i=0; i<s.size(); i++) {\\n switch (s[i]) {\\n case '(':\\n st.push(1);\\n break;\\n case ')': {\\n if (st.empty()) return false;\\n if (st.top() > 0) return false;\\n while(st.size() && st.top() < 0) st.pop();\\n if (st.empty()) return false;\\n st.pop();\\n }\\n break;\\n case '0':\\n case '1':\\n break;\\n default:\\n st.push(-1);\\n break;\\n }\\n }\\n\\n while(st.size() && st.top() < 0)\\n st.pop();\\n\\n return st.empty();\\n}\\n\\n\\nint calc(string s2) {\\n if (!check(s2)) return -1;\\n\\n char s[1000];\\n strcpy(s, s2.c_str());\\n char *p = s;\\n\\n try{\\n int res = expr(p);\\n\\n if (*p) return -1;\\n\\n return res;\\n\\n }catch(...){\\n\\n return -1;\\n }\\n}\\n\\nint main(){\\n string str;\\n\\n cin >> str;\\n\\n vector<int> dots;\\n\\n for (int i=0; i<str.size(); i++)\\n if (str[i] == '.') dots.push_back(i);\\n\\n int ans = -1;\\n\\n int limit = 7 * 7 * 7 * 7 * 7;\\n for (int i=0; i<limit; i++) {\\n int tmp = i;\\n\\n for (int p : dots) {\\n str[p] = \\\"01+-*()\\\"[tmp % 7];\\n tmp /= 7;\\n }\\n\\n int res = calc(str);\\n if (ans < res) {\\n debug(str); debug(res);\\n }\\n\\n ans = max(ans, res);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.656934306569343,\n \"time_ms\": 100,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.8285,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2428_3925987\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#ifndef LOCAL\\n#define debug(x) ;\\n#else\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\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#endif\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\n/* 再帰下降法 */\\n// char *p = str; res = expr(p);\\n\\nint term(char* &s);\\nint number(char* &s);\\nint factor(char* &s);\\nint expr(char* &s);\\n\\nconst int LIMIT = 1 << 10;\\n\\n//数\\nint number(char* &s){\\n if (!*s) throw \\\"number\\\";\\n\\n int res = 0;\\n while('0' <= *s && *s <= '9')\\n res = res*2 + (*s++ - '0');\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"number\\\";\\n\\n return res;\\n}\\n\\n//乗算除算(優先順位:高)\\nint term(char* &s){\\n if (!*s) throw \\\"term\\\";\\n\\n int res = factor(s);\\n while(1){\\n if(*s == '*') res *= factor(++s);\\n else if(*s == '/') res /= factor(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n\\n return res;\\n}\\n\\n//括弧か数\\nint factor(char* &s){\\n if (!*s) throw \\\"factor\\\";\\n\\n if(*s != '(') return number(s);\\n int res = expr(++s);\\n\\n if (!*s) throw \\\"factor\\\";\\n\\n s++;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"factor\\\";\\n\\n return res;\\n}\\n\\n//式(優先順位: 低)\\nint expr(char* &s){\\n if (!*s) throw \\\"expr\\\";\\n\\n int res = term(s);\\n while(1){\\n if(*s == '+') res += term(++s);\\n else if(*s == '-') res -= term(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"expr\\\";\\n\\n return res;\\n}\\n\\nbool check(string s) {\\n stack<int> st;\\n\\n for (int i=0; i<s.size(); i++) {\\n switch (s[i]) {\\n case '(':\\n st.push(1);\\n break;\\n case ')': {\\n if (st.empty()) return false;\\n if (st.top() > 0) return false;\\n while(st.size() && st.top() < 0) st.pop();\\n if (st.empty()) return false;\\n st.pop();\\n }\\n break;\\n case '0':\\n case '1':\\n break;\\n default:\\n st.push(-1);\\n break;\\n }\\n }\\n\\n return true;\\n}\\n\\n\\nint calc(string s2) {\\n if (!check(s2)) return -1;\\n\\n char s[1000];\\n strcpy(s, s2.c_str());\\n char *p = s;\\n\\n try{\\n int res = expr(p);\\n\\n if (*p) return -1;\\n\\n return res;\\n\\n }catch(...){\\n\\n return -1;\\n }\\n}\\n\\nint main(){\\n string str;\\n\\n cin >> str;\\n\\n vector<int> dots;\\n\\n for (int i=0; i<str.size(); i++)\\n if (str[i] == '.') dots.push_back(i);\\n\\n int ans = -1;\\n\\n int limit = 7 * 7 * 7 * 7 * 7;\\n for (int i=0; i<limit; i++) {\\n int tmp = i;\\n\\n for (int p : dots) {\\n str[p] = \\\"01+-*()\\\"[tmp % 7];\\n tmp /= 7;\\n }\\n\\n int res = calc(str);\\n debug(str); debug(res);\\n\\n ans = max(ans, res);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.0364963503649635,\n \"time_ms\": 30,\n \"memory_kb\": 3212,\n \"score_of_the_acc\": -0.2588,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2428_3925969\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <cmath>\\n#include <cstring>\\n\\n#include <iostream>\\n#include <complex>\\n#include <string>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#include <functional>\\n#include <cassert>\\n\\ntypedef long long ll;\\nusing namespace std;\\n\\n#ifndef LOCAL\\n#define debug(x) ;\\n#else\\n#define debug(x) cerr << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl;\\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#endif\\n\\n#define mod 1000000007 //1e9+7(prime number)\\n#define INF 1000000000 //1e9\\n#define LLINF 2000000000000000000LL //2e18\\n#define SIZE 200010\\n\\n/* 再帰下降法 */\\n// char *p = str; res = expr(p);\\n\\nint term(char* &s);\\nint number(char* &s);\\nint factor(char* &s);\\nint expr(char* &s);\\n\\nconst int LIMIT = 1 << 10;\\n\\n//数\\nint number(char* &s){\\n if (!*s) throw \\\"number\\\";\\n\\n int res = 0;\\n while('0' <= *s && *s <= '9')\\n res = res*2 + (*s++ - '0');\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"number\\\";\\n\\n return res;\\n}\\n\\n//乗算除算(優先順位:高)\\nint term(char* &s){\\n if (!*s) throw \\\"term\\\";\\n\\n int res = factor(s);\\n while(1){\\n if(*s == '*') res *= factor(++s);\\n else if(*s == '/') res /= factor(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"term\\\";\\n\\n return res;\\n}\\n\\n//括弧か数\\nint factor(char* &s){\\n if (!*s) throw \\\"factor\\\";\\n\\n if(*s != '(') return number(s);\\n int res = expr(++s);\\n\\n if (!*s) throw \\\"factor\\\";\\n\\n s++;\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"factor\\\";\\n\\n return res;\\n}\\n\\n//式(優先順位: 低)\\nint expr(char* &s){\\n if (!*s) throw \\\"expr\\\";\\n\\n int res = term(s);\\n while(1){\\n if(*s == '+') res += term(++s);\\n else if(*s == '-') res -= term(++s);\\n else break;\\n }\\n\\n if (res < 0 || LIMIT <= res)\\n throw \\\"expr\\\";\\n\\n return res;\\n}\\n\\nbool check(string s) {\\n bool open = false;\\n bool onlyNumber = false;\\n\\n for (char c : s) {\\n switch (c) {\\n case '(':\\n open = true;\\n onlyNumber = true;\\n break;\\n case ')':\\n if (open && onlyNumber) return false;\\n open = false;\\n break;\\n case '0':\\n case '1':\\n break;\\n default:\\n onlyNumber = false;\\n break;\\n }\\n }\\n\\n return true;\\n}\\n\\n\\nint calc(string s2) {\\n if (!check(s2)) return -1;\\n\\n char s[1000];\\n strcpy(s, s2.c_str());\\n char *p = s;\\n\\n try{\\n int res = expr(p);\\n\\n if (*p) return -1;\\n\\n return res;\\n\\n }catch(...){\\n\\n return -1;\\n }\\n}\\n\\nint main(){\\n string str;\\n\\n cin >> str;\\n\\n vector<int> dots;\\n\\n for (int i=0; i<str.size(); i++)\\n if (str[i] == '.') dots.push_back(i);\\n\\n int ans = -1;\\n\\n int limit = 7 * 7 * 7 * 7 * 7;\\n for (int i=0; i<limit; i++) {\\n int tmp = i;\\n\\n for (int p : dots) {\\n str[p] = \\\"01+-*()\\\"[tmp % 7];\\n tmp /= 7;\\n }\\n\\n int res = calc(str);\\n debug(str); debug(res);\\n\\n ans = max(ans, res);\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.021897810218978103,\n \"time_ms\": 30,\n \"memory_kb\": 3160,\n \"score_of_the_acc\": -0.2297,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2428_3676450\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\nint digit(State& begin);\\nint number(State& begin);\\nint term(State& begin);\\nint fact(State& begin);\\nint expr(State& begin);\\n\\nint digit(State& begin) {\\n int res = *begin - '0';\\n begin++;\\n return res;\\n}\\n\\nint number(State& begin) {\\n if (!isdigit(*begin)) throw ParseError();\\n int res = digit(begin);\\n while (isdigit(*begin)) {\\n res *= 2;\\n res += digit(begin);\\n }\\n if (res >= 1024 || 0 > res) throw ParseError();\\n return res;\\n}\\n\\nint term(State& begin) {\\n int res = fact(begin);\\n while (*begin == '*') {\\n begin++;\\n res *= fact(begin);\\n }\\n if (res >= 1024 || 0 > res) throw ParseError();\\n return res;\\n}\\n\\nint fact(State& begin) {\\n if (*begin == '(') {\\n begin++;\\n int res = expr(begin);\\n if (*begin != ')') throw ParseError();\\n begin++;\\n return res;\\n }\\n return number(begin);\\n}\\n\\nint expr(State& begin) {\\n int res = term(begin);\\n while (true) {\\n if (*begin == '+') {\\n begin++;\\n res += term(begin);\\n } else if (*begin == '-') {\\n begin++;\\n res -= term(begin);\\n } else {\\n break;\\n }\\n if (res >= 1024 || 0 > res) throw ParseError();\\n }\\n return res;\\n}\\n\\nbool check(string s) {\\n vector<int> v;\\n set<int> S;\\n map<int, bool> m;\\n for (int i = 0; i < s.size(); i++) {\\n if (s[i] == '(') {\\n v.push_back(i);\\n S.insert(i);\\n }\\n if ((s[i] == '*' || s[i] == '+' || s[i] == '-') && v.size()) {\\n m[v[v.size() - 1]] = true;\\n }\\n if (s[i] == ')') {\\n v.pop_back();\\n }\\n }\\n bool flag = true;\\n for (auto x : S) {\\n flag &= m[x];\\n }\\n return flag;\\n}\\n\\nint solve(string s) {\\n State begin = s.begin();\\n try {\\n int res = expr(begin);\\n if (begin == s.end() && check(s)) {\\n return res;\\n } else {\\n return -1;\\n }\\n } catch (ParseError p) {\\n return -1;\\n }\\n}\\n\\nint main() {\\n string s;\\n cin >> s;\\n string kouho = \\\"01+-*()\\\";\\n int SIZE = 1;\\n int n = 7;\\n int N = 0;\\n vector<int> index;\\n for (int i = 0; i < s.size(); i++) {\\n if (s[i] == '.') {\\n index.push_back(i);\\n N++;\\n }\\n }\\n for (int i = 0; i < N; i++) SIZE *= n;\\n vector<vector<char>> v(SIZE, vector<char>());\\n for (int rep = 0; rep < N; rep++) {\\n SIZE /= n;\\n for (int i = 0; i < v.size(); i++) {\\n v[i].push_back(kouho[(i / SIZE) % n]);\\n }\\n }\\n int ans = -1;\\n for (auto V : v) {\\n for (int i = 0; i < N; i++) {\\n s[index[i]] = V[i];\\n }\\n ans = max(ans, solve(s));\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4020,\n \"score_of_the_acc\": -0.9404,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2428_3675853\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\nint factor(State& s);\\n\\nint digit(State& s) {\\n if ('0' <= *s && *s <= '1') {\\n return *s - '0';\\n } else {\\n throw ParseError();\\n }\\n}\\n\\nint number(State& s) {\\n if (!isdigit(*s)) throw ParseError();\\n int res = 0;\\n while (isdigit(*s)) {\\n res *= 2;\\n res += *s - '0';\\n s++;\\n }\\n if (res >= 1024) {\\n throw ParseError();\\n }\\n return res;\\n}\\n\\nint term(State& s) {\\n int res = (*s == '(' ? factor(s) : number(s));\\n while (true) {\\n if (*s == '*') {\\n s++;\\n res *= (*s == '(' ? factor(s) : number(s));\\n if (res >= 1024) throw ParseError();\\n } else {\\n break;\\n }\\n }\\n return res;\\n}\\n\\nint expression(State& s) {\\n int counter = 0;\\n int res = term(s);\\n while (true) {\\n if (*s == '+') {\\n s++;\\n res += term(s);\\n counter++;\\n } else if (*s == '-') {\\n s++;\\n res -= term(s);\\n counter++;\\n } else {\\n break;\\n }\\n if (res >= 1024) throw ParseError();\\n }\\n return res;\\n}\\n\\nint factor(State& s) {\\n if (*s == '(') {\\n s++;\\n int res = expression(s);\\n if (*s != ')') throw ParseError();\\n s++;\\n return res;\\n } else {\\n return expression(s);\\n }\\n}\\n\\nbool check(string s) {\\n vector<int> v;\\n set<int> S;\\n map<int, bool> m;\\n for (int i = 0; i < s.size(); i++) {\\n if (s[i] == '(') {\\n v.push_back(i);\\n S.insert(i);\\n }\\n if ((s[i] == '*' || s[i] == '+' || s[i] == '-') && v.size()) {\\n m[v[v.size() - 1]] = true;\\n }\\n if (s[i] == ')') {\\n v.pop_back();\\n }\\n }\\n bool flag = true;\\n for (auto x : S) {\\n flag &= m[x];\\n }\\n return flag;\\n}\\n\\nint solve(string s) {\\n State begin = s.begin();\\n try {\\n int res = factor(begin);\\n if (begin != s.end() || !check(s)) {\\n return -1;\\n } else {\\n return res;\\n }\\n } catch (ParseError p) {\\n return -1;\\n }\\n}\\n\\nint main() {\\n string s;\\n cin >> s;\\n string kouho = \\\"01+-*().\\\";\\n int SIZE = 1;\\n int n = 8;\\n int N = 0;\\n vector<int> index;\\n for (int i = 0; i < s.size(); i++) {\\n if (s[i] == '.') {\\n index.push_back(i);\\n N++;\\n }\\n }\\n for (int i = 0; i < N; i++) SIZE *= n;\\n vector<vector<char>> v(SIZE, vector<char>());\\n for (int rep = 0; rep < N; rep++) {\\n SIZE /= n;\\n for (int i = 0; i < v.size(); i++) {\\n v[i].push_back(kouho[(i / SIZE) % n]);\\n }\\n }\\n int ans = -1;\\n for (auto V : v) {\\n for (int i = 0; i < N; i++) {\\n s[index[i]] = V[i];\\n }\\n // cerr << s << solve(s) << endl;\\n ans = max(ans, solve(s));\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.06569343065693431,\n \"time_ms\": 90,\n \"memory_kb\": 4816,\n \"score_of_the_acc\": -1.6154,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2428_3055153\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cctype>\\n#include <cassert>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stdexcept>\\n\\n#define fprintf(...) void(0)\\n\\nconst std::string chs=\\\"01+-*()\\\";\\n\\nbool next_assignment(std::vector<size_t> &d) {\\n for (size_t i=d.size(); i--;) {\\n if (d[i] < 6) {\\n ++d[i];\\n return true;\\n }\\n d[i] = 0;\\n }\\n return false;\\n}\\n\\nint apply(int lhs, char op, int rhs) {\\n if (op == '+') {\\n lhs += rhs;\\n } else if (op == '-') {\\n lhs -= rhs;\\n } else if (op == '*') {\\n lhs *= rhs;\\n }\\n if (!(0 <= lhs && lhs < 1024))\\n throw std::logic_error(\\\"overflow\\\");\\n\\n return lhs;\\n}\\n\\nint parse(\\n const std::string &s, size_t &i, size_t preced=0) {\\n\\n static const std::vector<std::string> ops={\\\"+-\\\", \\\"*\\\"};\\n\\n if (preced == ops.size()) {\\n if (s[i] == '(') {\\n fprintf(stderr, \\\"starting from %zu\\\\n\\\", i);\\n size_t j=i;\\n parse(s, ++j, preced);\\n int res=parse(s, ++i);\\n if (!(i < s.length() && s[i] == ')'))\\n throw std::logic_error(\\\"mismatch parentheses\\\");\\n fprintf(stderr, \\\"i: %zu, j: %zu\\\\n\\\", i, j);\\n if (i == j)\\n throw std::logic_error(\\\"redundant parentheses\\\");\\n ++i;\\n return res;\\n }\\n if (isdigit(s[i])) {\\n int res=s[i]-'0';\\n while (++i < s.length() && isdigit(s[i])) {\\n res = res*2+s[i]-'0';\\n if (res >= 1024) throw std::logic_error(\\\"overflow\\\");\\n }\\n return res;\\n }\\n throw std::logic_error(\\\"unexpected\\\");\\n }\\n\\n int res=parse(s, i, preced+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\\n int tmp=parse(s, ++i, preced+1);\\n res = apply(res, op, tmp);\\n }\\n return res;\\n}\\n\\nint parse(const std::string &s, std::vector<size_t> &d) {\\n std::string t;\\n size_t i=0;\\n for (char ch: s) {\\n if (ch == '.') {\\n t += chs[d[i++]];\\n continue;\\n }\\n t += ch;\\n }\\n i = 0;\\n fprintf(stderr, \\\"%s\\\\n\\\", t.c_str());\\n int res=parse(t, i);\\n fprintf(stderr, \\\"[%zu]\\\\n\\\", i);\\n if (i < t.length())\\n throw std::logic_error(\\\"garbage\\\");\\n return res;\\n}\\n\\nint main() {\\n char buf[128];\\n scanf(\\\"%s\\\", buf);\\n std::string s=buf;\\n size_t dot=std::count(s.begin(), s.end(), '.');\\n std::vector<size_t> d(dot);\\n\\n int res=-1;\\n do {\\n try {\\n res = std::max(res, parse(s, d));\\n } catch (std::logic_error &e) {\\n fprintf(stderr, \\\"failed: %s\\\\n\\\", e.what());\\n }\\n } while (next_assignment(d));\\n printf(\\\"%d\\\\n\\\", res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3044,\n \"score_of_the_acc\": -1.0112,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2428_3055152\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cctype>\\n#include <cassert>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <stdexcept>\\n\\n#define fprintf(...) void(0)\\n\\nconst std::string chs=\\\"01+-*()\\\";\\n\\nbool next_assignment(std::vector<size_t> &d) {\\n for (size_t i=d.size(); i--;) {\\n if (d[i] < 6) {\\n ++d[i];\\n return true;\\n }\\n d[i] = 0;\\n }\\n return false;\\n}\\n\\nint apply(int lhs, char op, int rhs) {\\n if (op == '+') {\\n lhs += rhs;\\n } else if (op == '-') {\\n lhs -= rhs;\\n } else if (op == '*') {\\n lhs *= rhs;\\n }\\n if (!(0 <= lhs && lhs < 1024))\\n throw std::logic_error(\\\"overflow\\\");\\n\\n return lhs;\\n}\\n\\nint parse(\\n const std::string &s, size_t &i, size_t preced=0) {\\n\\n static const std::vector<std::string> ops={\\\"+-\\\", \\\"*\\\"};\\n\\n if (preced == ops.size()) {\\n if (s[i] == '(') {\\n fprintf(stderr, \\\"starting from %zu\\\\n\\\", i);\\n size_t j=i;\\n parse(s, ++j, preced);\\n int res=parse(s, ++i);\\n if (!(i < s.length() && s[i] == ')'))\\n throw std::logic_error(\\\"mismatch parentheses\\\");\\n fprintf(stderr, \\\"i: %zu, j: %zu\\\\n\\\", i, j);\\n if (i == j)\\n throw std::logic_error(\\\"redundant parentheses\\\");\\n ++i;\\n return res;\\n }\\n if (isdigit(s[i])) {\\n int res=s[i]-'0';\\n while (++i < s.length() && isdigit(s[i])) {\\n res = res*2+s[i]-'0';\\n }\\n return res;\\n }\\n throw std::logic_error(\\\"unexpected\\\");\\n }\\n\\n int res=parse(s, i, preced+1);\\n while (i < s.length()) {\\n char op=s[i];\\n if (!std::count(ops[preced].begin(), ops[preced].end(), op)) break;\\n int tmp=parse(s, ++i, preced+1);\\n res = apply(res, op, tmp);\\n }\\n return res;\\n}\\n\\nint parse(const std::string &s, std::vector<size_t> &d) {\\n std::string t;\\n size_t i=0;\\n for (char ch: s) {\\n if (ch == '.') {\\n t += chs[d[i++]];\\n continue;\\n }\\n t += ch;\\n }\\n i = 0;\\n fprintf(stderr, \\\"%s\\\\n\\\", t.c_str());\\n int res=parse(t, i);\\n fprintf(stderr, \\\"[%zu]\\\\n\\\", i);\\n if (i < t.length())\\n throw std::logic_error(\\\"garbage\\\");\\n return res;\\n}\\n\\nint main() {\\n char buf[128];\\n scanf(\\\"%s\\\", buf);\\n std::string s=buf;\\n size_t dot=std::count(s.begin(), s.end(), '.');\\n std::vector<size_t> d(dot);\\n\\n int res=-1;\\n do {\\n try {\\n res = std::max(res, parse(s, d));\\n } catch (std::logic_error &e) {\\n fprintf(stderr, \\\"failed: %s\\\\n\\\", e.what());\\n }\\n } while (next_assignment(d));\\n printf(\\\"%d\\\\n\\\", res);\\n}\",\n \"accuracy\": 0.08029197080291971,\n \"time_ms\": 110,\n \"memory_kb\": 3024,\n \"score_of_the_acc\": -0.7692,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":1389,"cells":{"group_id":{"kind":"string","value":"aoj_2429_cpp"},"problem_description":{"kind":"string","value":"まるかいて\n太郎君は小学生で、チラシの裏に落書きをしています。\n\nある時、太郎君は次のゲームを思いつきました。\nn×n\nの格子状のマス目を書いておきます。\nそれぞれのマス目の初期状態は、丸印が書かれているか、書かれていないかのどちらか一方です。\nこれらの丸印を消したり書いたりして最終的にどの一列を見ても必ずちょうど1つのみの丸印が、どの一行を見ても必ず1つのみの丸印が存在するようにすることが目標であり、この状態にすればゲームをクリアしたことになります。\n太郎君はこのゲームを思いつきましたが、太郎君はこのゲームをクリアするのに大変時間がかかってしまいます。そこで、大学生であるあなたに助けを求めました。\n\n太郎君の兄であり大学生であるあなたの仕事は以下の通りです。\n厳密な状況を考えるために、あるマス目に丸印を書き込むコスト、あるマス目にある丸印を消すコストをあなたは導き出しました。このコストを用いてこのゲームをクリアするためにかかる操作のコストを最小化するような手順を考える。\nこのとき、最小のコストおよびそのコストを達成するような手順を出力するプログラムを書いてください。\n出力については、最小コストを達成する手順なら、どのような操作、順番でも出力してもよいものとする。\nInput\nn\nW\n11\nW\n12\n..\nW\n1n\nW\n21\nW\n22\n..\nW\n2n\n..\nW\nn1\nW\nn2\n..\nW\nnn\nE\n11\nE\n12\n..\nE\n1n\nE\n21\nE\n22\n..\nE\n2n\n..\nE\nn1\nE\nn2\n..\nE\nnn\nF\n1\n(\nn\n文字)\nF\n2\n(\nn\n文字)\n..\nF\nn\n(\nn\n文字)\nn\nは太郎君の作ったマス目が一辺にいくつあるかを表す\nW\nij\nは上から\ni\n番目、左から\nj\n番目のマス目に丸印を書き込むコストを表す\nE\nij\nは上から\ni\n番目、左から\nj\n番目のマス目に書かれてある丸印を消すコストを表す\nF\ni\nは上から\ni\n番目の行のマス目の初期状態を表す\nF\ni\nの左から\nj\n文字目について\n'o'のとき、上から\ni\n番目、左から\nj\n番目のマス目に丸印が書かれてあることを表す。\n'.'のとき、上から\ni\n番目、左から\nj\n番目のマス目が空白であることを表す。\nConstraints\n1≤ n ≤ 100\n1≤ W\nij\n≤ 1000\n1≤ E\nij\n≤ 1000\nF\ni\nは文字列であり、その長さは\nn\nである\nF\ni\nは'o'と'.'のみで構成されている\nOutput\nmincost\ncnt\nR\n1\nC\n1\noperate\n1\nR\n2\nC\n2\noperate\n2\n..\nR\ncnt\nC\ncnt\noperate\ncnt\nmincost\nは、太郎君のゲームをクリアするために必要な最小コストを表す。\nmincost\nは書き込み操作、消去操作で発生するコストの総和で計算される。\ncnt\n:\nmincost\nのコストを達成する操作を行った回数を表す\nk\n回目\n(1≤k≤cnt)\nに実行する操作は\nk+2\n行目に記述する\nk\n回目\n(1≤k≤cnt)\nの操作に対して\n上から\ni\n番目のマス目、左から\nj\n番目のマス目に対して行ったものとすると\nR\nk\nk\nである。\nこの操作が丸印を消す操作であるならば\noperate\nk\n= \"erase\"とせよ\nこの操作が丸印を書き込む操作であるならば\noperate\nk\n= \"write\"とせよ\nR\nk\n,C\nk\n,operate\nk\nは一行に空白区切りで出力しなければならない\n丸印の書かれてあるマス目に対して丸印を記述する操作、および丸印が書かれていないマス目に対して丸印を消去する操作をした場合はWrongAnswerである\ncnt\n個の操作にかかるコストの総和が\nmincost\nに一致しないときはWrongAnswerである\nSample Input 1\n3\n1 1 1\n1 1 1\n1 1 1\n1 1 1 \n1 1 1\n1 1 1\no.o\n...\n.o.\nOutput for the Sample Input 1\n2\n2\n1 3 erase\n2 3 write\n上から1番目、左から3番目のマス目の丸印を消去し、\n上から2番目、左から3番目のマス目に丸印を書き加えれば目標は達成できる。\nこのときコストは2のみしかかからず、これが最小のコストである。\nSample Input 2\n4\n1 2 3 4 \n1 2 3 4 \n1 2 3 4 \n1 2 3 4\n1 2 3 4 \n1 2 3 4 \n1 2 3 4 \n1 2 3 4\noooo\noooo\noooo\noooo\nOutput for the Sample Input 2\n30\n12\n1 1 erase\n1 2 erase\n1 3 erase\n2 1 erase\n2 2 erase\n2 4 erase\n3 1 erase\n3 3 erase\n3 4 erase\n4 2 erase\n4 3 erase\n4 4 erase\nコスト(1+2+3+4)*3だけ消去処理をすればクリアとなります。\nSample Input 3\n3\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\no..\n.o.\n..o\nOutput for the Sample Input 3\n0\n0\nすでに目標は達成されているため、コスト及び操作回数はともに0となる。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2429_9723846","code_snippet":"#include <bits/stdc++.h>\n#define INF 1e9\nusing namespace std;\n\nconst int MAX_N = 100; // Максимальное количество вершин\nconst int MAX_V = 1000; // Максимальное количество вершин в сети\n\nstruct Edge {\n int to, cap, cost, rev;\n};\n\nint n, N, K, V;\nint W[MAX_N][MAX_N], E[MAX_N][MAX_N];\nstring F[MAX_N];\nvector<Edge> G[MAX_V]; // Граф сети\nint dist[MAX_V], prevv[MAX_V], preve[MAX_V]; // Для хранения пути\n\n// Добавление ребра в граф\nvoid add_edge(int from, int to, int cap, int cost) {\n G[from].push_back({to, cap, cost, (int)G[to].size()});\n G[to].push_back({from, 0, -cost, (int)G[from].size() - 1});\n}\n\n// Алгоритм поиска минимальной стоимости потока\nint min_cost_flow(int s, int t, int f) {\n int total_cost = 0;\n while (f > 0) {\n fill(dist, dist + V, INF);\n dist[s] = 0;\n bool update = true;\n\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 // Если нет пути до t, возвращаем -1\n if (dist[t] == INF) return -1;\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\n f -= d;\n total_cost += d * dist[t];\n\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 total_cost;\n}\n\n// Основная функция для двудольного сопоставления\nint Bipartite_Matching() {\n int source = N + K, sink = source + 1;\n\n // Соединяем исход с вершинами первой доли\n for (int i = 0; i < N; ++i) add_edge(source, i, 1, 0);\n\n // Соединяем вершины второй доли с стоком\n for (int i = 0; i < K; ++i) add_edge(N + i, sink, 1, 0);\n\n int initial_cost = 0;\n\n // Добавляем рёбра между долями с соответствующими весами\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (F[i][j] == 'o') {\n initial_cost += E[i][j];\n add_edge(i, N + j, 1, -E[i][j]); // Если 'o', это исходное состояние\n } else {\n add_edge(i, N + j, 1, W[i][j]); // Если '.', это потенциальный переход\n }\n }\n }\n\n return initial_cost + min_cost_flow(source, sink, N);\n}\n\nint main() {\n // Ввод данных\n cin >> n;\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < n; ++j)\n cin >> W[i][j];\n\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < n; ++j)\n cin >> E[i][j];\n\n for (int i = 0; i < n; ++i)\n cin >> F[i];\n\n N = K = n;\n V = 2 * n + 2;\n\n // Решение задачи\n cout << Bipartite_Matching() << endl;\n\n int cnt = 0;\n\n // Подсчёт и вывод результата\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < (int)G[i].size(); ++j) {\n int to = G[i][j].to - N;\n if (G[i][j].cap <= 0 && F[i][to] == '.') cnt++;\n if (G[i][j].cap > 0 && F[i][to] == 'o') cnt++;\n }\n }\n\n cout << cnt << endl;\n\n // Вывод операций \"write\" и \"erase\"\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < (int)G[i].size(); ++j) {\n int to = G[i][j].to - N;\n if (G[i][j].cap <= 0 && F[i][to] == '.')\n cout << i + 1 << \" \" << to + 1 << \" write\" << endl;\n else if (G[i][j].cap > 0 && F[i][to] == 'o')\n cout << i + 1 << \" \" << to + 1 << \" erase\" << endl;\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3932,"score_of_the_acc":-0.0221,"final_rank":9},{"submission_id":"aoj_2429_8416735","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// ========================================================================== Library Part ==========================================================================\nstruct Edge {\n int to, cap, rev, cost;\n};\n\nclass MinCostFlow {\n public:\n int size_ = 0;\n vector<vector<Edge>> G;\n\n void init(int sz) {\n size_ = sz;\n G.resize(size_, vector<Edge>(0));\n }\n\n void add_edge(int u, int v, int c, int d) {\n G[u].push_back(Edge{v, c, (int)G[v].size() - 0, +d});\n G[v].push_back(Edge{u, 0, (int)G[u].size() - 1, -d});\n }\n\n int min_flow(int s, int t, int f) {\n int Answer = 0;\n\n // Simulation Start\n while (f > 0) {\n vector<int> Dist;\n vector<int> PreV;\n vector<int> PreE;\n Dist.resize(size_, 100000000);\n PreV.resize(size_, -1);\n PreE.resize(size_, -1);\n\n // Shortest Path\n Dist[s] = 0;\n for (int i = 0; i < size_; i++) {\n for (int j = 0; j < size_; j++) {\n if (Dist[j] == 100000000) continue;\n for (int k = 0; k < (int)G[j].size(); k++) {\n if (G[j][k].cap == 0) continue;\n int nex = G[j][k].to;\n int cos = G[j][k].cost;\n if (Dist[nex] > Dist[j] + cos) {\n Dist[nex] = Dist[j] + cos;\n PreV[nex] = j;\n PreE[nex] = k;\n }\n }\n }\n }\n if (Dist[t] == 100000000) return -1;\n\n // Fukugen 1\n int cx = t, mincap = f;\n while (cx != s) {\n int nex = PreV[cx];\n int idx = PreE[cx];\n mincap = min(mincap, G[nex][idx].cap);\n cx = nex;\n }\n Answer += mincap * Dist[t];\n\n // Fukugen 2\n cx = t;\n while (cx != s) {\n int nex = PreV[cx];\n int idx = PreE[cx];\n G[nex][idx].cap -= mincap;\n G[G[nex][idx].to][G[nex][idx].rev].cap += mincap;\n cx = nex;\n }\n f -= mincap;\n }\n\n // Return\n return Answer;\n }\n};\n\n// ========================================================================== Main Part ==========================================================================\nint N;\nint Cost1[1009][1009];\nint Cost2[1009][1009];\nchar C[1009][1009];\nint Calc[1009][1009];\n\nint main() {\n // Step 1. Input\n cin >> N;\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) cin >> Cost1[i][j];\n }\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) cin >> Cost2[i][j];\n }\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) cin >> C[i][j];\n }\n\n // Step 2. Get Cost\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n for (int k = 1; k <= N; k++) {\n if (j == k && C[i][k] == '.') Calc[i][j] += Cost1[i][k];\n if (j != k && C[i][k] == 'o') Calc[i][j] += Cost2[i][k];\n }\n }\n }\n\n // Step 3. Get Graph\n MinCostFlow Z; Z.init(2 * N + 8);\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) Z.add_edge(i, N + j, 1, Calc[i][j]);\n }\n for (int i = 1; i <= N; i++) Z.add_edge(2 * N + 1, i, 1, 0);\n for (int i = 1; i <= N; i++) Z.add_edge(N + i, 2 * N + 2, 1, 0);\n\n // Step 4. Flow\n int Answer = Z.min_flow(2 * N + 1, 2 * N + 2, N);\n vector<tuple<int, int, string>> Answer2;\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j < Z.G[i].size(); j++) {\n int nex = Z.G[i][j].to;\n if (N + 1 <= nex && nex <= 2 * N && Z.G[i][j].cap == 0) {\n for (int k = 1; k <= N; k++) {\n if (k == nex - N && C[i][k] == '.') Answer2.push_back(make_tuple(i, k, \"write\"));\n if (k != nex - N && C[i][k] == 'o') Answer2.push_back(make_tuple(i, k, \"erase\"));\n }\n }\n }\n }\n\n // Step 5. Output\n cout << Answer << endl;\n cout << Answer2.size() << endl;\n for (int i = 0; i < (int)Answer2.size(); i++) {\n cout << get<0>(Answer2[i]) << \" \" << get<1>(Answer2[i]) << \" \" << get<2>(Answer2[i]) << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":10452,"score_of_the_acc":-1.4142,"final_rank":20},{"submission_id":"aoj_2429_7407721","code_snippet":"// \n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\n#define all(x) (x).begin(), (x).end()\n\nconst int INF = (int)(1e9);\n\nstruct MinCostFlow {\n struct edge {\n int to, cap, rev, cost;\n edge(int t, int ca, int r, int co) : to(t), cap(ca), rev(r), cost(co) {}\n };\n int n;\n vector<vector<edge>> g;\n vector<int> dist, preve, prevv;\n MinCostFlow(int n_) {\n n = n_;\n g.resize(n, vector<edge>());\n dist.resize(n), preve.resize(n), prevv.resize(n);\n }\n void add_edge(int f, int t, int ca, int co) {\n g[f].emplace_back(t, ca, (int)(g[t].size()), co);\n g[t].emplace_back(f, 0, (int)(g[f].size())-1, -co);\n }\n int min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n dist.assign(n, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n rep(v, n) if (dist[v] != INF) {\n rep(e, g[v].size()) if (g[v][e].cap>0 && dist[g[v][e].to]>dist[v]+g[v][e].cost) {\n dist[g[v][e].to] = dist[v] + g[v][e].cost;\n preve[g[v][e].to] = e;\n prevv[g[v][e].to] = v;\n if (!update) update = true;\n }\n }\n }\n if (dist[t] == INF) return -1;\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 * dist[t];\n for (int v=t; v!=s; v=prevv[v]) {\n g[prevv[v]][preve[v]].cap -= d;\n g[v][g[prevv[v]][preve[v]].rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<vector<int>> w(n, vector<int>(n)), e(n, vector<int>(n));\n\trep(i, n) rep(j, n) cin >> w[i][j];\n\trep(i, n) rep(j, n) cin >> e[i][j];\n\tvector<string> f(n);\n\trep(i, n) cin >> f[i];\n\tMinCostFlow mcf(2*n+2);\n\trep(i, n) {\n\t\tint scost = 0;\n\t\trep(j, n) if (f[i][j] == 'o') scost += e[i][j];\n\t\trep(j, n) {\n\t\t\tint tcost = scost + (f[i][j]=='o' ? -e[i][j] : w[i][j]);\n\t\t\tmcf.add_edge(i, n+j, 1, tcost);\n\t\t}\n\t}\n\trep(i, n) mcf.add_edge(2*n, i, 1, 0);\n\trep(i, n) mcf.add_edge(n+i, 2*n+1, 1, 0);\n\tint res = mcf.min_cost_flow(2*n, 2*n+1, n);\n\tcout << res << endl;\n\tvector<tuple<int, int, string>> rlst;\n\trep(i, n) for (const auto& ei : mcf.g[i]) if (ei.cap==0 && ei.cost>0) {\n\t\trep(j, n) {\n\t\t\tif (j!=ei.to-n && f[i][j]=='o') rlst.emplace_back(i+1, j+1, \"erase\");\n\t\t\tif (j==ei.to-n && f[i][j]=='.') rlst.emplace_back(i+1, j+1, \"write\"); \n\t\t}\n\t}\n\tint rlen = rlst.size();\n\tcout << rlen << endl;\n\trep(i, rlen) cout << get<0>(rlst[i]) << ' ' << get<1>(rlst[i]) << ' ' << get<2>(rlst[i]) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4028,"score_of_the_acc":-0.0279,"final_rank":11},{"submission_id":"aoj_2429_7407710","code_snippet":"// \n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\n#define all(x) (x).begin(), (x).end()\n\nconst int INF = (int)(1e9);\n\nstruct edge {\n\tint to, cap, rev, cost;\n\tedge(int t, int ca, int r, int co) : to(t), cap(ca), rev(r), cost(co) {}\n};\nclass MinCostFlow {\n int n;\n vector<int> dist, preve, prevv;\npublic:\n vector<vector<edge>> g;\n MinCostFlow(int n_) {\n n = n_;\n g.resize(n, vector<edge>());\n dist.resize(n), preve.resize(n), prevv.resize(n);\n }\n void add_edge(int f, int t, int ca, int co) {\n g[f].emplace_back(t, ca, (int)(g[t].size()), co);\n g[t].emplace_back(f, 0, (int)(g[f].size())-1, -co);\n }\n int min_cost_flow(int s, int t, int f) {\n int res = 0;\n while (f > 0) {\n dist.assign(n, INF);\n dist[s] = 0;\n bool update = true;\n while (update) {\n update = false;\n rep(v, n) if (dist[v] != INF) {\n rep(e, g[v].size()) if (g[v][e].cap>0 && dist[g[v][e].to]>dist[v]+g[v][e].cost) {\n dist[g[v][e].to] = dist[v] + g[v][e].cost;\n preve[g[v][e].to] = e;\n prevv[g[v][e].to] = v;\n if (!update) update = true;\n }\n }\n }\n if (dist[t] == INF) return -1;\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 * dist[t];\n for (int v=t; v!=s; v=prevv[v]) {\n g[prevv[v]][preve[v]].cap -= d;\n g[v][g[prevv[v]][preve[v]].rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<vector<int>> w(n, vector<int>(n)), e(n, vector<int>(n));\n\trep(i, n) rep(j, n) cin >> w[i][j];\n\trep(i, n) rep(j, n) cin >> e[i][j];\n\tvector<string> f(n);\n\trep(i, n) cin >> f[i];\n\tMinCostFlow mcf(2*n+2);\n\trep(i, n) {\n\t\tint scost = 0;\n\t\trep(j, n) if (f[i][j] == 'o') scost += e[i][j];\n\t\trep(j, n) {\n\t\t\tint tcost = scost + (f[i][j]=='o' ? -e[i][j] : w[i][j]);\n\t\t\tmcf.add_edge(i, n+j, 1, tcost);\n\t\t}\n\t}\n\trep(i, n) mcf.add_edge(2*n, i, 1, 0);\n\trep(i, n) mcf.add_edge(n+i, 2*n+1, 1, 0);\n\tint res = mcf.min_cost_flow(2*n, 2*n+1, n);\n\tcout << res << endl;\n\tvector<tuple<int, int, string>> rlst;\n\trep(i, n) for (const auto& ei : mcf.g[i]) if (ei.cap==0 && ei.cost>0) {\n\t\trep(j, n) {\n\t\t\tif (j!=ei.to-n && f[i][j]=='o') rlst.emplace_back(i+1, j+1, \"erase\");\n\t\t\tif (j==ei.to-n && f[i][j]=='.') rlst.emplace_back(i+1, j+1, \"write\"); \n\t\t}\n\t}\n\tint rlen = rlst.size();\n\tcout << rlen << endl;\n\trep(i, rlen) cout << get<0>(rlst[i]) << ' ' << get<1>(rlst[i]) << ' ' << get<2>(rlst[i]) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4036,"score_of_the_acc":-0.0284,"final_rank":12},{"submission_id":"aoj_2429_7270852","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)\n#define rep(i, n) drep(i, 0, n - 1)\n#define all(a) (a).begin(), (a).end()\n#define pb push_back\n#define fi first\n#define se second\n\nconst ll MOD = 1000000007;\nconst ll MOD2 = 998244353;\nconst ll INF = 1LL << 60;\nconst ll MAX_N = 2e5;\n\nstruct MinCostFlow{\n struct Edge{\n ll to;\n ll cap;\n ll cost;\n ll rev;\n };\n\n vector<vector<Edge>> G;\n ll N;\n vector<ll> h; // ポテンシャル\n vector<ll> dist; // 最短距離\n vector<ll> prevv; // 直前の頂点\n vector<ll> preve; // 直前の辺\n\n MinCostFlow(vector<vector<tuple<ll, ll, ll>>> G_){\n N = (ll)G_.size();\n G.resize(N);\n h.resize(N, 0);\n dist.resize(N, 0);\n prevv.resize(N, 0);\n preve.resize(N, 0);\n\n rep(from, N){\n for(tuple<ll, ll, ll> tmp : G_[from]){\n ll to = get<0>(tmp);\n ll cap = get<1>(tmp);\n ll cost = get<2>(tmp);\n G[from].pb((Edge){to, cap, cost, (ll)G[to].size()});\n G[to].pb((Edge){from, 0, -cost, (ll)G[from].size()-1});\n }\n }\n }\n\n //コストが非負実数の場合\n ll min_cost_flow1(ll s, ll t, ll f){\n vector<vector<Edge>> H(N);\n rep(from, N) for(Edge e : G[from]) H[from].pb(e);\n rep(i, N) h[i] = 0;\n\n ll res = 0;\n while(f > 0){\n //ダイクストラ法を用いてhを更新\n priority_queue<pll, vector<pll>, greater<pll>> PQ;\n rep(i, N) dist[i] = INF;\n dist[s] = 0;\n PQ.push({0, s});\n while(!PQ.empty()){\n pll p = PQ.top();\n PQ.pop();\n ll v = p.se;\n if(dist[v] < p.fi) continue;\n\n for(ll i=0; i<(ll)H[v].size(); i++){\n Edge &e = H[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({dist[e.to], e.to});\n }\n }\n }\n if(dist[t] == INF){\n //これ以上流せない\n return -1;\n }\n for(ll v=0; v<N; v++) h[v] += dist[v];\n\n // s-t間最短経路に沿って目一杯流す\n ll d = f;\n for(ll v=t; v!=s; v=prevv[v]){\n d = min(d, H[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d*h[t];\n for(ll v=t; v!=s; v=prevv[v]){\n Edge &e = H[prevv[v]][preve[v]];\n e.cap -= d;\n H[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n\n //負のコストが存在する場合\n ll min_cost_flow2(ll s, ll t, ll f){\n ll res = 0;\n while(f > 0){\n //ベルマンフォード法により, s-t間最短経路を求める\n rep(i, N) dist[i] = INF;\n dist[s] = 0;\n bool update = true;\n while(update){\n update = false;\n rep(v, N){\n if(dist[v]==INF) continue;\n for(ll i=0; i<(ll)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 //これ以上流せない\n return -1;\n }\n\n //s-t間最短経路に沿って目一杯流す\n ll d = f;\n for(ll 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(ll 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 vector<pll> match_pair(){\n vector<pll> res;\n ll n = (N-2)/2;\n rep(u, n){\n for(ll i=0; i<(ll)G[u].size(); i++){\n Edge e = G[u][i];\n if(n <= e.to && e.to < 2*n && e.cap==0){\n res.pb({u, e.to-n});\n }\n }\n }\n\n return res;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n ll n;\n cin >> n;\n\n vector<vector<ll>> w(n, vector<ll>(n)), e(n, vector<ll>(n));\n rep(i, n) rep(j, n) cin >> w[i][j];\n rep(i, n) rep(j, n) cin >> e[i][j];\n\n vector<vector<char>> f(n, vector<char>(n));\n rep(i, n) rep(j, n) cin >> f[i][j];\n\n ll mcf = 0;\n rep(i, n) rep(j, n) if(f[i][j]=='o') mcf += e[i][j];\n\n vector<vector<tuple<ll, ll, ll>>> G(2*n+2);\n ll s = 2*n;\n ll t = 2*n+1;\n rep(i, n) G[s].pb({i, 1, 0});\n rep(i, n) rep(j, n){\n if(f[i][j]=='.'){\n G[i].pb({n+j, 1, w[i][j]});\n }else{\n G[i].pb({n+j, 1, -e[i][j]});\n }\n }\n rep(j, n) G[n+j].pb({t, 1, 0});\n\n MinCostFlow MCF(G);\n mcf += MCF.min_cost_flow2(s, t, n);\n cout << mcf << endl;\n \n vector<pll> mp = MCF.match_pair();\n vector<vector<char>> ans(n, vector<char>(n, '.'));\n for(pll tmp : mp){\n ll u = tmp.fi;\n ll v = tmp.se;\n ans[u][v] = 'o';\n }\n\n ll cnt = 0;\n rep(i, n) rep(j, n){\n if(f[i][j]!=ans[i][j]){\n cnt++;\n }\n }\n\n cout << cnt << endl;\n rep(i, n) rep(j, n){\n if(f[i][j] != ans[i][j]){\n if(f[i][j]=='.'){\n cout << i+1 << \" \" << j+1 << \" write\" << endl; \n }else{\n cout << i+1 << \" \" << j+1 << \" erase\" << endl;\n }\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4616,"score_of_the_acc":-0.0633,"final_rank":16},{"submission_id":"aoj_2429_7140909","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 per(i,n) for(int i = (n) - 1; 0 <= i; i--)\n#define rep2(i,l,r) for(int i = (l); i < int(r); i++)\n#define per2(i,l,r) for(int i = (r) - 1; int(l) <= i; i--)\n#define MM << \" \" <<\n#define pb push_back\n#define eb emplace_back\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\n#define each(e, x) for(atuo &e : x)\n\ntemplate<class T>\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T>\nusing maxheap = priority_queue<T>;\n\ntemplate<class T>\nvoid print(const vector<T> &v, T x = 0) {\n int n = sz(v);\n rep(i,n) {\n cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n }\n if(v.empty()) cout << '\\n';\n}\n\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\ntemplate<class T>\nbool chmax(T &x, const T &y) {\n return (x < y) ? (x = y, true) : false;\n}\n\ntemplate<class T>\nbool chmin(T &x, const T &y) {\n return (x > y) ? (x = y, true) : false;\n}\n\nstruct MCF {\n struct edge {\n int to;\n ll cap, cost;\n int rev;\n edge(int to, ll cap, ll cost, int rev)\n : to(to), cap(cap), cost(cost), rev(rev) {}\n };\n\n vector<vector<edge>> es;\n vector<ll> d, h;\n vector<int> pre_v, pre_e;\n vector<pii> cash;\n ll INF = 1LL << 60;\n int n;\n\n MCF(int n) : es(n), d(n), h(n), pre_v(n), pre_e(n), cash(), n(n) {}\n\n int add_edge(int u, int v, int cap, ll cost) {\n es[u].eb(v, cap, cost, sz(es[v]));\n es[v].eb(u, 0 , -cost, sz(es[u]) - 1);\n int res = cash.size();\n cash.eb(u, sz(es[u]) - 1);\n return res;\n }\n\n void dijkstra(int s) {\n fill(all(d), INF);\n minheap<pll> q;\n q.emplace(d[s] = 0, s);\n while(!q.empty()) {\n auto [p, i] = q.top();\n q.pop();\n if(p > d[i]) continue;\n rep(j, sz(es[i])) {\n edge e = es[i][j];\n if(e.cap > 0 && chmin(d[e.to], d[i] + e.cost + h[i] - h[e.to])) {\n assert(e.cost + h[i] - h[e.to] >= 0);\n pre_v[e.to] = i;\n pre_e[e.to] = j;\n q.emplace(d[e.to], e.to);\n }\n }\n }\n }\n\n ll mcf(int s, int t, ll flow) {\n ll ret = 0;\n while(flow > 0) {\n dijkstra(s);\n if(d[t] == INF) return -INF;\n rep(i,n) {\n if(h[i] == INF || d[i] == INF) {\n h[i] = INF;\n } else {\n h[i] += d[i];\n }\n }\n ll f = flow;\n for(int i = t; i != s; i = pre_v[i]) {\n chmin(f, es[pre_v[i]][pre_e[i]].cap);\n }\n assert(f > 0);\n ret += h[t] * f, flow -= f;\n for(int i = t; i != s; i = pre_v[i]) {\n edge &e = es[pre_v[i]][pre_e[i]];\n e.cap -= f;\n es[i][e.rev].cap += f;\n }\n }\n return ret;\n }\n\n edge get_edge(int s) {\n assert(0 <= s);\n assert(s < sz(cash));\n auto [i, j] = cash[s];\n return es[i][j];\n }\n };\n\nint main() {\n int n; cin >> n;\n vector<vector<ll>> w(n, vector<ll>(n));\n vector<vector<ll>> e(n, vector<ll>(n));\n vector<string> f(n);\n\n rep(i,n) rep(j,n) cin >> w[i][j];\n rep(i,n) rep(j,n) cin >> e[i][j];\n rep(i,n) cin >> f[i];\n\n MCF mcf(n * 2 + 2);\n const int S = n * 2, T = S + 1;\n vector<vector<ll>> id(n, vector<ll>(n));\n rep(i,n) {\n ll sm = 0;\n rep(j,n) {\n if(f[i][j] == 'o') sm += e[i][j];\n }\n rep(j,n) {\n if(f[i][j] == 'o') {\n id[i][j] = mcf.add_edge(i, j + n, 1, sm - e[i][j]);\n } else {\n id[i][j] = mcf.add_edge(i, j + n, 1, sm + w[i][j]);\n }\n }\n }\n\n rep(i,n) {\n mcf.add_edge(S, i, 1, 0);\n mcf.add_edge(i + n, T, 1, 0);\n }\n\n ll score = mcf.mcf(S, T, n);\n cout << score << endl;\n vector<pii> ans;\n rep(i,n) rep(j,n) {\n int k = f[i][j] == 'o' ? 1 : 0;\n if(mcf.get_edge(id[i][j]).cap == k) ans.eb(i, j);\n }\n\n cout << sz(ans) << endl;\n for(auto &i : ans) {\n if(f[i.first][i.second] == 'o') cout << i.first + 1 MM i.second + 1 MM \"erase\" << endl;\n else cout << i.first + 1 MM i.second + 1 MM \"write\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4536,"score_of_the_acc":-0.0585,"final_rank":15},{"submission_id":"aoj_2429_6521699","code_snippet":"#include <bits/stdc++.h>\nusing std::cout;\nusing std::cin;\nusing std::endl;\nnamespace po167{\ntemplate<class Cap,class Cost>\nstruct min_cost_flow\n{\n\tstruct edge{\n\t\tint to;\n\t\tCap cap;\n\t\tCost cost;\n\t};\n\tstd::vector<std::vector<edge>> G;\n\tstd::vector<std::vector<int>> rev_edge;\n\tstd::vector<std::pair<int,int>> edge_order;\n\tint _n;\n\tmin_cost_flow(int n):G(n),rev_edge(n),_n(n){}\n\tint add_edge(int from,int to,Cap cap,Cost cost){\n\t\tassert(0<=from&&from<_n);\n\t\tassert(0<=to&&to<_n);\n\t\tedge_order.push_back({from,(int)(G[from].size())});\n\t\trev_edge[to].push_back((int)(G[from].size()));\n\t\tG[from].push_back((edge){to,cap,cost});\n\t\trev_edge[from].push_back((int)(G[to].size()));\n\t\tG[to].push_back((edge){from,(Cap)0,-cost});\n\t\treturn (int)(edge_order.size());\n\t}\n\tstd::vector<Cost> min_cost_slope(int s,int t){\n\t\tassert(0<=s&&s<_n);\n\t\tassert(0<=t&&t<_n);\n\t\tstd::vector<Cost> ans={0};\n\t\tstd::vector<Cost> pot(_n);\n\t\twhile(true){\n\t\t\tstd::priority_queue<std::pair<Cost,int>,std::vector<std::pair<Cost,int>>,std::greater<std::pair<Cost,int>>> pq;\n\t\t\tstd::vector<int> front(_n);\n\t\t\tstd::vector<Cost> seen(_n,std::numeric_limits<Cost>::max());\n\t\t\tseen[s]=0;\n\t\t\tpq.push({0,s});\n\t\t\twhile(!pq.empty()){\n\t\t\t\tCost time;\n\t\t\t\tint ind;\n\t\t\t\tCost n_time;\n\t\t\t\tstd::tie(time,ind)=pq.top();\n\t\t\t\tpq.pop();\n\t\t\t\tif(seen[ind]<time) continue;\n\t\t\t\tfor(int i=0;i<(int)(G[ind].size());i++){\n\t\t\t\t\tauto x=G[ind][i];\n\t\t\t\t\tif(x.cap==0) continue;\n\t\t\t\t\tn_time=time+x.cost+pot[ind]-pot[x.to];\n\t\t\t\t\tif(seen[x.to]>n_time){\n\t\t\t\t\t\tseen[x.to]=n_time;\n\t\t\t\t\t\tfront[x.to]=rev_edge[ind][i];\n\t\t\t\t\t\tpq.push({n_time,x.to});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*for(int i=0;i<_n;i++){\n\t\t\t\tcout<<seen[i]<<\" \";\n\t\t\t}\n\t\t\tcout<<endl;*/\n\t\t\tif(seen[t]==std::numeric_limits<Cost>::max()){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint ind=t;\n\t\t\twhile(ind!=s){\n\t\t\t\tG[ind][front[ind]].cap++;\n\t\t\t\tint f=G[ind][front[ind]].to;\n\t\t\t\tG[f][rev_edge[ind][front[ind]]].cap--;\n\t\t\t\tind=f;\n\t\t\t}\n\t\t\tans.push_back(pot[t]-pot[s]+seen[t]);\n\t\t\tstd::swap(pot,seen);\n\t\t}\n\t\tfor(int i=1;i<(int)(ans.size());i++) ans[i+1]+=ans[i];\n\t\treturn ans;\n\t}\n\tstd::pair<Cap,Cost> flow(int s,int t){\n\t\tauto tmp=min_cost_slope(s,t);\n\t\tint x=tmp.size();\n\t\treturn {(Cap)(x-1),tmp[x-1]};\n\t}\n\tstd::tuple<int,int,Cap> report_edge(int i){\n\t\tint x,y;\n\t\tstd::tie(x,y)=edge_order[i];\n\t\tint t=G[x][y].to;\n\t\treturn {x,t,G[t][rev_edge[x][y]].cap};\n\t}\n};\n};\n\n\n\nvoid solve();\n// oddloop\nint main() {\n\tsolve();\n}\n\nvoid solve(){\n\tint n;\n\tcin>>n;\n\tstd::vector<std::vector<int>> W(n,std::vector<int>(n)),E(n,std::vector<int>(n)),F(n,std::vector<int>(n));\n\tint tmp=0;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++) cin>>W[i][j];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++) cin>>E[i][j];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tchar c;\n\t\t\tcin>>c;\n\t\t\tif(c=='o'){\n\t\t\t\tF[i][j]=1;\n\t\t\t\ttmp+=E[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tint M=2000;\n\tpo167::min_cost_flow<int,int> G(n*2+2);\n\tint S=n*2,T=S+1;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tif(F[i][j]) G.add_edge(i,j+n,1,M-E[i][j]);\n\t\t\telse G.add_edge(i,j+n,1,M+W[i][j]);\n\t\t}\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tG.add_edge(S,i,1,0);\n\t\tG.add_edge(i+n,T,1,0);\n\t}\n\tauto ans=G.flow(S,T);\n\tcout<<ans.second+tmp-M*n<<\"\\n\";\n\tstd::vector<std::pair<int,int>> p;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tauto x=G.report_edge(i*n+j);\n\t\t\tint r=std::get<2>(x);\n\t\t\tif(r^F[i][j]) p.push_back({i,j});\n\t\t}\n\t}\n\tcout<<p.size()<<\"\\n\";\n\tfor(auto x:p){\n\t\tint s,t;\n\t\tstd::tie(s,t)=x;\n\t\tcout<<s+1<<\" \"<<t+1<<\" \";\n\t\tif(F[s][t]) cout<<\"erase\\n\";\n\t\telse cout<<\"write\\n\";\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3940,"score_of_the_acc":-0.0226,"final_rank":10},{"submission_id":"aoj_2429_6022393","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 << 29;\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\n/*\n○のついてる頂点を全て消したとみなす\noの頂点はコスト-a[i][j]\nxの頂点はコストa[i][j]\nとする\nS -> (i行) -> (j列) -> T の順番で流す\nS -> (i行), (j列) -> T はcap=1, cost=0\n(i行) -> (j列) はcap=1, cost=a[i][j] or -a[i][j]\n*/\n\ntemplate<typename Cap, typename Cost>\nclass MinCostFlow {\nprivate:\n struct edge {\n int to, rev;\n Cap cap;\n Cost cost;\n edge() {}\n edge(int to, Cap cap, Cost cost, int rev):\n to(to), cap(cap), cost(cost), rev(rev) {}\n };\n\n int N;\n vector<vector<edge>> G;\n vector<Cost> h, dist;\n vector<int> prev_v, prev_e;\n Cost res;\n\n void bellman_ford(int S) {\n const Cost inf = numeric_limits<Cost>::max();\n fill(dist.begin(), dist.end(), inf);\n dist[S] = 0;\n bool upd = true;\n while(upd) {\n upd = false;\n for(int from = 0; from < N; from++) {\n if(dist[from] == inf) continue;\n for(int i = 0; i < (int)G[from].size(); i++) {\n auto &e = G[from][i];\n if(e.cap > 0 and dist[e.to] > dist[from] + e.cost) {\n dist[e.to] = dist[from] + e.cost;\n prev_v[e.to] = from;\n prev_e[e.to] = i;\n upd = true;\n }\n }\n }\n }\n }\n\npublic:\n MinCostFlow() {}\n MinCostFlow(int N): N(N), G(N), h(N), dist(N), prev_v(N), prev_e(N) {}\n\n void add_edge(int from, int to, Cap cap, Cost cost) {\n G[from].emplace_back(to, cap, cost, (int)G[to].size());\n G[to].emplace_back(from, 0, -cost, (int)G[from].size() - 1);\n }\n\n bool build(int S, int T, Cap f = numeric_limits<Cap>::max()) {\n res = 0;\n const Cost inf = numeric_limits<Cost>::max();\n while(f > 0) {\n bellman_ford(S);\n if(dist[T] == inf) return false;\n\n Cap d = f;\n for(int v = T; v != S; v = prev_v[v]) {\n d = min(d, G[prev_v[v]][prev_e[v]].cap);\n }\n f -= d;\n res += d * dist[T];\n for(int v = T; v != S; v = prev_v[v]) {\n auto &e = G[prev_v[v]][prev_e[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n return true;\n }\n\n Cost get_cost() { return res; }\n vector<vector<edge>> get_graph() { return G; }\n};\n\nint main() {\n int N;\n cin >> N;\n vector w(N, vector<int>(N));\n vector e(N, vector<int>(N));\n REP(i, N) REP(j, N) cin >> w[i][j];\n REP(i, N) REP(j, N) cin >> e[i][j];\n vector<string> g(N);\n REP(i, N) cin >> g[i];\n\n MinCostFlow<int, int> mcf(2*N+2);\n int S = 2*N, T = S+1;\n REP(i, N) {\n mcf.add_edge(S, i, 1, 0);\n mcf.add_edge(i+N, T, 1, 0);\n }\n int ans = 0;\n REP(i, N) REP(j, N) {\n if(g[i][j] == 'o') {\n ans += e[i][j];\n mcf.add_edge(i, j+N, 1, -e[i][j]);\n } else {\n mcf.add_edge(i, j+N, 1, w[i][j]);\n }\n }\n assert(mcf.build(S, T, N));\n ans += mcf.get_cost();\n auto G = mcf.get_graph();\n vector<tuple<int, int, string>> outputs;\n REP(i, N) {\n for(auto& e : G[i]) {\n if(N <= e.to and e.to < N*2) {\n int j = e.to - N;\n // debug(i, j, e.cap, e.cost, g[i][j]);\n if(g[i][j] == '.' and e.cap == 0) {\n outputs.emplace_back(i+1, j+1, \"write\");\n }\n if(g[i][j] == 'o' and e.cap == 1) {\n outputs.emplace_back(i+1, j+1, \"erase\");\n }\n }\n } \n }\n cout << ans << endl;\n cout << outputs.size() << endl;\n for(auto [i, j, op] : outputs) {\n cout << i << ' ' << j << ' ' << op << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4252,"score_of_the_acc":-0.0414,"final_rank":13},{"submission_id":"aoj_2429_5811538","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 405\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\nstruct Info{\n\tInfo(int arg_row,int arg_col,bool arg_is_write){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tis_write = arg_is_write;\n\t}\n\tint row,col;\n\tbool is_write;\n};\n\nint V; //頂点数\nvector<Edge> G[SIZE]; //グラフの隣接リスト表現\nint dist[SIZE]; //最短距離\nint pre_node[SIZE],pre_edge[SIZE]; //直前の頂点と辺\n\nint W[105][105],E[105][105];\nchar table[105][105];\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;\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&W[i][k]);\n\t\t}\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&E[i][k]);\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tint source = 2*N;\n\tint sink = source+1;\n\n\tV = 2*N + 2;\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tadd_edge(source,row,1,0);\n\t}\n\tfor(int col = 0; col < N; col++){\n\n\t\tadd_edge(N+col,sink,1,0);\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tif(table[row][col] == 'o'){\n\n\t\t\t\t//先に消しておく\n\t\t\t\tans += E[row][col];\n\t\t\t\tadd_edge(row,N+col,1,-E[row][col]); //消さないコスト\n\n\t\t\t}else{ //元々白\n\n\t\t\t\tadd_edge(row,N+col,1,W[row][col]);\n\t\t\t}\n\t\t}\n\t}\n\n\tint C = min_cost_flow(source,sink,N);\n\n\t//printf(\"ans:%d C:%d\\n\",ans,C);\n\tprintf(\"%d\\n\", ans+C);\n\n\tvector<Info> info;\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int i = 0; i < G[row].size(); i++){\n\n\t\t\tint col = G[row][i].to-N;\n\t\t\tif(table[row][col] == 'o' && G[row][i].capacity > 0){ //消した\n\n\t\t\t\tinfo.push_back(Info(row+1,col+1,false));\n\t\t\t}\n\t\t\tif(table[row][col] == '.' && G[row][i].capacity == 0){ //書いた\n\n\t\t\t\tinfo.push_back(Info(row+1,col+1,true));\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",info.size());\n\tfor(int i = 0; i < info.size(); i++){\n\n\t\tprintf(\"%d %d \",info[i].row,info[i].col);\n\t\tif(info[i].is_write){\n\n\t\t\tprintf(\"write\\n\");\n\t\t}else{\n\n\t\t\tprintf(\"erase\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3576,"score_of_the_acc":-0.0007,"final_rank":2},{"submission_id":"aoj_2429_5761109","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\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()\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 25000000;\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-8;\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//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nstruct mcf{\n struct edge{\n ll to, cap, cost, rev;\n };\n int n;\n vector<vector<edge>> G;\n vector<ll> dist,prevv,preve;\n\n mcf(int n) : n(n) {\n G.resize(n);\n dist.resize(n);\n prevv.resize(n);\n preve.resize(n);\n }\n\n void add_edge(ll from, ll to, ll cap, ll cost){\n G[from].push_back(edge{to, cap, cost, (ll)G[to].size()});\n G[to].push_back(edge{from, 0, -cost, (ll)G[from].size()-1});\n }\n\n ll flow(ll s, ll t, ll f){\n ll res = 0;\n while(f > 0){\n fill(dist.begin(), dist.end(), linf);\n dist[s] = 0;\n bool upd = true;\n while(upd){\n upd = false;\n for(int u=0; u<n; u++){\n if(dist[u] == linf) continue;\n for(int i=0; i<G[u].size(); i++){\n edge &e = G[u][i];\n if(e.cap > 0 && dist[e.to] > dist[u] + e.cost){\n dist[e.to] = dist[u] + e.cost;\n prevv[e.to] = u;\n preve[e.to] = i;\n upd = true;\n }\n }\n }\n }\n\n if(dist[t] == linf) return -1;\n\n ll d = f;\n for(int u=t; u!=s; u=prevv[u]){\n d = min(d, G[prevv[u]][preve[u]].cap);\n }\n f -= d;\n res += d * dist[t];\n for(int u=t; u!=s; u=prevv[u]){\n edge &e = G[prevv[u]][preve[u]];\n e.cap -= d;\n G[u][e.rev].cap += d;\n }\n }\n return res;\n }\n};\n\nint main(){\n int n; cin >> n;\n vvl w(n,vl(n)), e(n,vl(n));\n rep(i,n) rep(j,n) cin >> w[i][j];\n rep(i,n) rep(j,n) cin >> e[i][j];\n vs s(n); rep(i,n) cin >> s[i];\n int mn = 0;\n rep(i,n) rep(j,n) if(s[i][j] == 'o') chmin(mn, -e[i][j]);\n mcf g(n*2+2);\n ll ans = 0;\n int S = n*2, T = n*2+1;\n rep(i,n){\n g.add_edge(S,i,1,0);\n g.add_edge(i+n,T,1,0);\n }\n rep(i,n) rep(j,n){\n if(s[i][j] == '.'){\n g.add_edge(i,j+n,1,w[i][j]-mn);\n }else{\n ans += e[i][j];\n g.add_edge(i,j+n,1,-e[i][j]-mn);\n }\n }\n ans += g.flow(S,T,n) + mn*n;\n cout << ans << \"\\n\";\n vl y,x;\n vs op;\n rep(i,n){\n for(auto e : g.G[i]){\n if(n <= e.to && e.to < n*2){\n int j = e.to - n;\n if(s[i][j] == '.' && e.cap == 0){\n y.push_back(i+1); x.push_back(j+1);\n op.push_back(\"write\");\n }\n if(s[i][j] == 'o' && e.cap == 1){\n y.push_back(i+1); x.push_back(j+1);\n op.push_back(\"erase\");\n }\n }\n }\n }\n cout << y.size() << \"\\n\";\n rep(i,y.size()){\n cout << y[i] << \" \" << x[i] << \" \" << op[i] << \"\\n\";\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4520,"score_of_the_acc":-0.0575,"final_rank":14},{"submission_id":"aoj_2429_5707930","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#define SIZE 205\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\nstruct Info{\n\tInfo(int arg_row,int arg_col,bool arg_is_erase){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tis_erase = arg_is_erase;\n\t}\n\n\tint row,col;\n\tbool is_erase;\n};\n\nint V; //頂点数\nvector<Edge> G[SIZE]; //グラフの隣接リスト表現\nint dist[SIZE]; //最短距離\nint pre_node[SIZE],pre_edge[SIZE]; //直前の頂点と辺\nint W[SIZE][SIZE],E[SIZE][SIZE];\nchar table[SIZE][SIZE];\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;\n\tscanf(\"%d\",&N);\n\n\tint source = 2*N;\n\tint sink = source+1;\n\tV = sink+1;\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&W[i][k]);\n\t\t}\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&E[i][k]);\n\t\t}\n\t}\n\n\tint sum = 0;\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t\tfor(int col = 0; col < N; col++){\n\n\t\t\tif(table[row][col] == 'o'){\n\n\t\t\t\tsum += E[row][col]; //消したことにする\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tadd_edge(source,row,1,0);\n\t}\n\tfor(int col = 0;col < N; col++){\n\n\t\tadd_edge(col+N,sink,1,0);\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tif(table[row][col] == 'o'){\n\n\t\t\t\tadd_edge(row,col+N,1,-E[row][col]); //消さなかったことにする\n\t\t\t}else{\n\n\t\t\t\tadd_edge(row,col+N,1,W[row][col]); //新たに書き込むコスト\n\t\t\t}\n\t\t}\n\t}\n\n\tsum += min_cost_flow(source,sink,N);\n\n\tprintf(\"%d\\n\",sum);\n\n\tvector<Info> info;\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int i = 0; i < G[row].size(); i++){\n\t\t\tint col = G[row][i].to-N;\n\t\t\tif(table[row][col] == 'o' && G[row][i].capacity == 1){ //消えたまま\n\n\t\t\t\tinfo.push_back(Info(row,col,true));\n\t\t\t}\n\t\t\tif(table[row][col] == '.' && G[row][i].capacity == 0){ //書き込み\n\n\t\t\t\tinfo.push_back(Info(row,col,false));\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",info.size());\n\n\tfor(int i = 0; i < info.size(); i++){\n\n\t\tprintf(\"%d %d\",info[i].row+1,info[i].col+1);\n\t\tif(info[i].is_erase){\n\n\t\t\tprintf(\" erase\\n\");\n\t\t}else{\n\n\t\t\tprintf(\" write\\n\");\n\t\t}\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3660,"score_of_the_acc":-0.0058,"final_rank":7},{"submission_id":"aoj_2429_5705771","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 NUM 205\n\ntypedef pair<int,int> P; //firstは最短距離、secondは頂点の番号\n\nstruct Info{\n\tInfo(int arg_row,int arg_col,bool arg_is_del){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tis_del = arg_is_del;\n\t}\n\tint row,col;\n\tbool is_del;\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 W[NUM][NUM],E[NUM][NUM];\nchar table[NUM][NUM];\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;\n\tscanf(\"%d\",&N);\n\n\tint source = 2*N;\n\tint sink = source+1;\n\tV = sink+1;\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&W[i][k]);\n\t\t}\n\t}\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\n\t\t\tscanf(\"%d\",&E[i][k]);\n\t\t}\n\t}\n\n\tint sum = 0;\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tif(table[row][col] == 'o'){\n\n\t\t\t\tsum += E[row][col]; //先に全ての〇を消す\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\n\t\tadd_edge(source,row,1,0);\n\t}\n\tfor(int col = 0; col < N; col++){\n\n\t\tadd_edge(col+N,sink,1,0);\n\t}\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int col = 0; col < N; col++){\n\t\t\tif(table[row][col] == 'o'){\n\n\t\t\t\tadd_edge(row,col+N,1,-E[row][col]); //元々計上していたコストを消す\n\n\t\t\t}else{\n\n\t\t\t\tadd_edge(row,col+N,1,W[row][col]); //新たに書き込むコスト\n\t\t\t}\n\t\t}\n\t}\n\n\tsum += min_cost_flow(source,sink,N);\n\n\tvector<Info> info;\n\n\tfor(int row = 0; row < N; row++){\n\t\tfor(int i = 0; i < G[row].size(); i++){\n\t\t\tint col = G[row][i].to-N;\n\n\t\t\tif(table[row][col] == 'o' && G[row][i].capacity == 1){ //逆辺に流れた\n\n\t\t\t\t//FLOW += E[row][col];\n\t\t\t\tinfo.push_back(Info(row,col,true));\n\t\t\t}\n\t\t\tif(table[row][col] != 'o' && G[row][i].capacity == 0){ //辺に流れた\n\n\t\t\t\tinfo.push_back(Info(row,col,false));\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",sum);\n\n\tprintf(\"%lld\\n\",info.size());\n\n\tfor(int i = 0; i < info.size(); i++){\n\n\t\tprintf(\"%d %d\",info[i].row+1,info[i].col+1);\n\t\tif(info[i].is_del){\n\n\t\t\tprintf(\" erase\\n\");\n\t\t}else{\n\n\t\t\tprintf(\" write\\n\");\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3636,"score_of_the_acc":-0.0043,"final_rank":5},{"submission_id":"aoj_2429_5629835","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <algorithm>\n#include <utility>\n#include <vector>\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\n} // namespace atcoder\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\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\n private:\n int _n;\n std::vector<edge> _edges;\n\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\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 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 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 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_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} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int N;\n cin >> N;\n vector W(N, vector(N, 0));\n vector E(N, vector(N, 0));\n vector<string> F(N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> W[i][j];\n }\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> E[i][j];\n }\n }\n for (int i = 0; i < N; i++) {\n cin >> F[i];\n }\n mcf_graph<int, int> G(2 + N + N * N + N);\n int S = 0, T = 1;\n int bef = 0, now = 2;\n for (int i = 0; i < N; i++) {\n G.add_edge(bef, now + i, 1, 0);\n }\n bef = now;\n now += N;\n int maine = now;\n for (int i = 0; i < N; i++) {\n int tot = 0;\n for (int j = 0; j < N; j++) {\n if (F[i][j] == 'o')\n tot += E[i][j];\n }\n for (int j = 0; j < N; j++) {\n G.add_edge(bef + i, now + i * N + j, 1, (F[i][j] == 'o' ? tot - E[i][j] : tot + W[i][j]));\n }\n }\n bef = now;\n now += N * N;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n G.add_edge(bef + i * N + j, now + j, 1, 0);\n }\n }\n bef = now;\n now += N * N;\n for (int i = 0; i < N; i++) {\n G.add_edge(bef + i, T, 1, 0);\n }\n cout << G.flow(S, T).second << endl;\n vector<pair<int, int>> er, wr;\n for (auto&& e : G.edges()) {\n if (e.to >= maine && e.to < maine + N * N) {\n int idx = e.to - maine;\n int x = idx / N, y = idx % N;\n if (e.flow == 1 && F[x][y] == '.') {\n wr.emplace_back(x, y);\n } else if (e.flow == 0 && F[x][y] == 'o') {\n er.emplace_back(x, y);\n }\n }\n }\n cout << wr.size() + er.size() << endl;\n for (auto&& [x, y] : wr) {\n cout << x + 1 << \" \" << y + 1 << \" \"\n << \"write\" << endl;\n }\n for (auto&& [x, y] : er) {\n cout << x + 1 << \" \" << y + 1 << \" \"\n << \"erase\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5292,"score_of_the_acc":-0.1039,"final_rank":17},{"submission_id":"aoj_2429_5629826","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <algorithm>\n#include <utility>\n#include <vector>\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\n} // namespace atcoder\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\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\n private:\n int _n;\n std::vector<edge> _edges;\n\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\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 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 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 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_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} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int N;\n cin >> N;\n vector W(N, vector(N, 0));\n vector E(N, vector(N, 0));\n vector<string> F(N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> W[i][j];\n }\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n cin >> E[i][j];\n }\n }\n for (int i = 0; i < N; i++) {\n cin >> F[i];\n }\n mcf_graph<int, int> G(1000000);\n int S = 0, T = 1;\n int bef = 0, now = 2;\n for (int i = 0; i < N; i++) {\n G.add_edge(bef, now + i, 1, 0);\n }\n bef = now;\n now += N;\n int maine = now;\n for (int i = 0; i < N; i++) {\n int tot = 0;\n for (int j = 0; j < N; j++) {\n if (F[i][j] == 'o')\n tot += E[i][j];\n }\n for (int j = 0; j < N; j++) {\n G.add_edge(bef + i, now + i * N + j, 1, (F[i][j] == 'o' ? tot - E[i][j] : tot + W[i][j]));\n }\n }\n bef = now;\n now += N * N;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n G.add_edge(bef + i * N + j, now + j, 1, 0);\n }\n }\n bef = now;\n now += N * N;\n for (int i = 0; i < N; i++) {\n G.add_edge(bef + i, T, 1, 0);\n }\n cout << G.flow(S, T).second << endl;\n vector<pair<int, int>> er, wr;\n for (auto&& e : G.edges()) {\n if (e.to >= maine && e.to < maine + N * N) {\n int idx = e.to - maine;\n int x = idx / N, y = idx % N;\n if (e.flow == 1 && F[x][y] == '.') {\n wr.emplace_back(x, y);\n } else if (e.flow == 0 && F[x][y] == 'o') {\n er.emplace_back(x, y);\n }\n }\n }\n cout << wr.size() + er.size() << endl;\n for (auto&& [x, y] : wr) {\n cout << x + 1 << \" \" << y + 1 << \" \"\n << \"write\" << endl;\n }\n for (auto&& [x, y] : er) {\n cout << x + 1 << \" \" << y + 1 << \" \"\n << \"erase\" << endl;\n }\n}","accuracy":1,"time_ms":100,"memory_kb":20192,"score_of_the_acc":-1.25,"final_rank":19},{"submission_id":"aoj_2429_5346608","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T>\nclass Edmonds_Karp {\n T inf = numeric_limits<T> :: max() / 2;\n class edge {\n public:\n int nxt, to;\n T c, f;\n };\n vector<edge> e;\n vector<T> d;\n vector<int> head;\n vector<int> prev;\n vector<int> pree;\n vector<int> vis;\n int cnt;\n int source;\n int sink;\n\n public:\n Edmonds_Karp() {}\n Edmonds_Karp(int N, int M, int _source, int _sink) : source(_source), sink(_sink), head(N + 1), vis(N + 1), d(N + 1), prev(N + 1), pree(N + 1), e(M * 2 + 3) {\n cnt = 1;\n }\n\n void link(int u, int v, T f, T c) {\n e[++cnt].nxt = head[u];\n head[u] = cnt;\n e[cnt].f = f;\n e[cnt].to = v;\n e[cnt].c = c;\n }\n void add_edge(int u, int v, T f, T c) {\n link(u, v, f, c);\n link(v, u, 0, -c);\n } \n bool spfa() {\n d.assign(d.size(), -1);\n d[source] = 0;\n queue<int> q;\n q.push(source);\n while(!q.empty()) {\n int u = q.front();\n q.pop();\n vis[u] = 0;\n for(int i = head[u]; i; i = e[i].nxt) { \n if(e[i].f && (d[e[i].to] > d[u] + e[i].c || d[e[i].to] == -1)) {\n pree[e[i].to] = i;\n prev[e[i].to] = u;\n d[e[i].to] = d[u] + e[i].c;\n if(vis[e[i].to] == 0) {\n q.push(e[i].to);\n vis[e[i].to] = 1;\n }\n }\n }\n }\n return ~d[sink]; \n }\n T _Edmonds_Karp() {\n T cost = 0;\n T flow = 0;\n while(spfa()) {\n int now = sink;\n T delta = inf;\n while(now != source) {\n delta = min(delta, (T)e[pree[now]].f);\n now = prev[now];\n }\n now = sink;\n while(now != source) {\n e[pree[now]].f -= delta;\n e[pree[now] ^ 1].f += delta; \n now = prev[now];\n }\n flow += delta;\n cost += (T)delta * d[sink];\n } \n return cost;\n }\n void print(vector<string> S) {\n vector<tuple<int, int, string>> Ans;\n int N = S.size();\n for (int i = 0; i < N; ++i) {\n for (int j = head[i]; j; j = e[j].nxt) {\n if (e[j].f == 0) {\n int k = e[j].to - N;\n if (0 <= k && k < N) {\n if (S[i][k] == 'o') {\n for (int P = 0; P < N; ++P) {\n if (P != k && S[i][P] == 'o') {\n Ans.emplace_back(i, P, \"erase\");\n }\n }\n break;\n } else {\n for (int P = 0; P < N; ++P) {\n if (S[i][P] == 'o') {\n Ans.emplace_back(i, P, \"erase\");\n }\n }\n Ans.emplace_back(i, k, \"write\");\n }\n }\n }\n }\n }\n cout << Ans.size() << '\\n';\n for (auto [X, Y, O] : Ans) {\n cout << X + 1 << ' ' << Y + 1 << ' ' << O << '\\n';\n }\n }\n};\nint main() {\n int N;\n cin >> N;\n vector<vector<int>> W(N, vector<int> (N));\n for (int i = 0; i < N; ++i) {\n for (int j = 0; j < N; ++j) {\n cin >> W[i][j];\n }\n }\n vector<vector<int>> E(N, vector<int> (N));\n for (int i = 0; i < N; ++i) {\n for (int j = 0; j < N; ++j) {\n cin >> E[i][j];\n }\n }\n vector<string> S(N);\n for (int i = 0; i < N; ++i) {\n cin >> S[i];\n }\n int source = N + N;\n int sink = N + N + 1;\n Edmonds_Karp<int> flow(N + N + 2, N * N * 5, source, sink);\n for (int i = 0; i < N; ++i) {\n int V = 0;\n for (int j = 0; j < N; ++j) {\n if (S[i][j] == 'o') {\n V += E[i][j]; \n }\n }\n for (int j = 0; j < N; ++j) {\n if (S[i][j] == 'o') {\n flow.add_edge(i, j + N, 1, V - E[i][j]);\n } else {\n flow.add_edge(i, j + N, 1, V + W[i][j]); \n } \n }\n }\n for (int i = 0; i < N; ++i) {\n flow.add_edge(source, i, 1, 0);\n }\n for (int i = 0; i < N; ++i) {\n flow.add_edge(i + N, sink, 1, 0);\n }\n cout << flow._Edmonds_Karp() << '\\n';\n flow.print(S);\n}","accuracy":1,"time_ms":20,"memory_kb":5052,"score_of_the_acc":-0.1173,"final_rank":18},{"submission_id":"aoj_2429_5084344","code_snippet":"#include <iostream>\n#include <math.h>\n#include <iomanip>\n#include <limits>\n// #include <atcoder/all>\n// using namespace atcoder;\n#include <cstring>\n#include <string>\n#include <vector>\n#include <algorithm>\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#define chmax(x,y) x = max(x,y)\nusing R=double;\nusing ld = long double;\nint INF = 1e9;\nll LINF = 1e18;\nint mod = 1000000007;\n//using mint = modint1000000007;\nint mod2 = 1;\nusing graph = vector<vector<int>>;\n#define MV 1000\nstruct edge{int to,cap,cost,rev;};\nint V;\nvector<edge> G[MV];\nint dist[MV];\nint prevv[MV],preve[MV];\nvector<P> circle;\n\nvoid add_edge(int from,int to,int cap,int cost){\n\t//if(from == 0) printf(\"to is %d\\n\",to);\n\tG[from].push_back((edge){to,cap,cost,(int)(G[to].size())});\n\tG[to].push_back((edge){from,0,-cost,(int)(G[from].size()-1)});\n}\n\nint min_cost_flow(int s,int t,int f){\n\tint res = 0;\n\twhile(f > 0){\n\t\tfill(dist,dist+V,INF);\n\t\tdist[s] = 0;\n\t\tbool update = true;\n\t\twhile(update){\n\t\t\tupdate = false;\n\t\t\trep(i,V){\n\t\t\t\t//cout << i << \" \" << dist[i] << endl;\n\t\t\t\tif(dist[i] == INF) continue;\n\t\t\t\tfor(int j=0;j<G[i].size();j++){\n\t\t\t\t\tedge &e = G[i][j];\n\t\t\t\t\tif(e.cap>0&&dist[e.to]>dist[i]+e.cost){\n\t\t\t\t\t\t//cout << i << \" \" << e.to << \" \" << e.cost<<endl;\n\t\t\t\t\t\tdist[e.to] = dist[i]+e.cost;\n\t\t\t\t\t\tprevv[e.to] = i;\n\t\t\t\t\t\tpreve[e.to] = j;\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\t\n\n\t\tif(dist[t]==INF) return -1;\n\n\t\tint d = f;\n\t\tfor(int v=t;v!=s;v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\n\t\t//for(int v=t;v!=s;v=prevv[v]) printf(\"%d %d %d\\n\",v,prevv[v],G[prevv[v]][preve[v]].cap);\n\t\tf -= d;\n\t\t// cout <<\" \" << f << endl;;\n\t\t// int du;cin >> du;\n\t\tres += d*dist[t];\n\t\tfor(int v=t;v!=s;v=prevv[v]) {\n\t\t\tedge &e = G[prevv[v]][preve[v]];\n\t\t\te.cap -= d;\n\t\t\tG[v][e.rev].cap += d;\n\t\t}\n\t}\n\treturn res;\n}\n\nint wtable[105][105];\nint etable[105][105];\nint anstable[105][105];\nint main(){\n\t// rep(i,105)rep(j,105) wtable[i][j] = 0;\n\t// rep(i,105)rep(j,105) etable[i][j] = 0;\n\t// rep(i,105)rep(j,105) anstable[i][j] = 0;\n\trep(i,MV) prevv[i] = 0;\n\trep(i,MV) preve[i] = 0;\n\tint n;cin >> n;\n\tV = 2*n+2;\n\tint st = 2*n;\n\tint go = st+1;\n\trep(i,n)rep(j,n) cin >> wtable[i][j];\n\trep(i,n)rep(j,n) cin >> etable[i][j];\n\trep(i,n) {\n\t\tadd_edge(st,i,1,0);\n\t\tadd_edge(i+n,go,1,0);\n\t}\n\tint num = 0;\n\tint ind = 0;\n\trep(i,n)rep(j,n){\n\t\tchar temp;cin >> temp;\n\t\tif(temp == '.') add_edge(i,j+n,1,wtable[i][j]);\n\t\telse {\n\t\t\tadd_edge(i,j+n,1,-etable[i][j]);\n\t\t\tnum += etable[i][j];\n\t\t\tanstable[i][j] = -1;\n\t\t\tind++;\n\t\t}\n\t}\n\tnum += min_cost_flow(st,go,n);\n\trep(i,n){\n\t\trep(j,G[i].size()){\n\t\t\tif(G[i][j].cap == 0) circle.emplace_back(i,G[i][j].to);\n\t\t}\n\t}\n\tfor(P p:circle) {\n\t\t//printf(\"%d %d\\n\",p.first,p.second);\n\t\tanstable[p.first][p.second-n]++;\n\t}\n\tint temp = 0;\n\trep(i,n)rep(j,n) if(anstable[i][j]!= 0) temp++;\n\tcout << num << endl;\n\tcout << temp << endl;\n\n\trep(i,n)rep(j,n) {\n\t\tif(anstable[i][j]==1) printf(\"%d %d write\\n\",i+1,j+1);\n\t\telse if(anstable[i][j] == -1) printf(\"%d %d erase\\n\",i+1,j+1);\n\t}\n\t//cout << ind << endl;\n\t\n\n\t\n\n\n}","accuracy":1,"time_ms":10,"memory_kb":3652,"score_of_the_acc":-0.0053,"final_rank":6},{"submission_id":"aoj_2429_4969897","code_snippet":"#include<iostream>\nusing namespace std;\n//Minimum Cost Flow O(FE log V)\n#include<algorithm>\n#include<utility>\n#include<vector>\n#include<queue>\n#include<limits>\ntemplate<typename T>\nstruct MCF{\n\tstruct edge{\n\t\tint to,rev,cap;\n\t\tT cost;\n\t};\n\tvector<vector<edge> >G;\n\tvector<T>h,d;\n\tvector<int>pv,pe;\n\tMCF(int n_=0):G(n_),h(n_,0),d(n_),pv(n_),pe(n_){}\n\tint add_edge(int from,int to,int cap,T cost)\n\t{\n\t\tG[from].push_back({to,(int)G[to].size(),cap,cost});\n\t\tG[to].push_back({from,(int)G[from].size()-1,0,-cost});\n\t\treturn (int)G[from].size()-1;\n\t}\n\tT min_cost_flow(int s,int t,int f)//ans or -1\n\t{\n\t\tT ret=0;\n\t\twhile(f>0)\n\t\t{\n\t\t\tpriority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;\n\t\t\tfill(d.begin(),d.end(),numeric_limits<T>::max());\n\t\t\td[s]=0;\n\t\t\tP.push(make_pair(0,s));\n\t\t\twhile(!P.empty())\n\t\t\t{\n\t\t\t\tpair<T,int>p=P.top();P.pop();\n\t\t\t\tif(d[p.second]<p.first)continue;\n\t\t\t\tfor(int i=0;i<G[p.second].size();i++)\n\t\t\t\t{\n\t\t\t\t\tedge&e=G[p.second][i];\n\t\t\t\t\tif(e.cap>0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to])\n\t\t\t\t\t{\n\t\t\t\t\t\td[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to];\n\t\t\t\t\t\tpv[e.to]=p.second;\n\t\t\t\t\t\tpe[e.to]=i;\n\t\t\t\t\t\tP.push(make_pair(d[e.to],e.to));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d[t]==numeric_limits<T>::max())return -1;\n\t\t\tfor(int u=0;u<G.size();u++)h[u]+=d[u];\n\t\t\tint d=f;\n\t\t\tfor(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].cap);\n\t\t\tf-=d;\n\t\t\tret+=d*h[t];\n\t\t\tfor(int u=t;u!=s;u=pv[u])\n\t\t\t{\n\t\t\t\tG[pv[u]][pe[u]].cap-=d;\n\t\t\t\tG[u][G[pv[u]][pe[u]].rev].cap+=d;\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n};\nint N;\nstring S[100];\nint W[100][100],F[100][100];\nint ei[100][100];\nint O[100];\nmain()\n{\n\tcin>>N;\n\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>W[i][j];\n\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>F[i][j];\n\tMCF<int>P(2*N+2);\n\tint st=2*N,go=2*N+1;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tP.add_edge(N+i,go,1,0);\n\t\tP.add_edge(st,i,1,0);\n\t\tcin>>S[i];\n\t\tint cost=0;\n\t\tfor(int j=0;j<N;j++)if(S[i][j]=='o')cost+=F[i][j];\n\t\tfor(int j=0;j<N;j++)\n\t\t{\n\t\t\tint now=cost;\n\t\t\tif(S[i][j]=='o')now-=F[i][j];\n\t\t\telse now+=W[i][j];\n\t\t\tei[i][j]=P.add_edge(i,N+j,1,now);\n\t\t}\n\t}\n\tcout<<P.min_cost_flow(st,go,N)<<endl;\n\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\n\t{\n\t\tif(P.G[i][ei[i][j]].cap==0)O[i]=j;\n\t}\n\tvector<pair<int,int> >C;\n\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\n\t{\n\t\tif(O[i]==j)\n\t\t{\n\t\t\tif(S[i][j]=='.')C.push_back(make_pair(i,j));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(S[i][j]=='o')C.push_back(make_pair(i,j));\n\t\t}\n\t}\n\tcout<<C.size()<<endl;\n\tfor(pair<int,int>p:C)\n\t{\n\t\tcout<<p.first+1<<\" \"<<p.second+1<<\" \";\n\t\tif(S[p.first][p.second]=='o')cout<<\"erase\"<<endl;\n\t\telse cout<<\"write\"<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3564,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2429_4908799","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < n; ++ i)\n\nusing cap_type = int;\nusing cost_type = int;\n\nstruct edge {\n int to, rev;\n cap_type cap;\n cost_type cost;\n edge(int t, cap_type c, cost_type ct, int r) : to(t), rev(r), cap(c), cost(ct) {}\n};\nusing graph = vector<vector<edge>>;\n\nvoid add_edge(graph& g, int from, int to, cap_type cap, cost_type cost) {\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\ncost_type min_cost_flow(graph& g, int s, int t, cap_type f) {\n static_assert(!is_floating_point<cap_type>::value, \"\");\n using P = pair<cost_type, int>;\n const auto inf = numeric_limits<cost_type>::max() / 2;\n cost_type res = 0;\n vector<cost_type> h(g.size()), dist(g.size());\n vector<int> prevv(g.size()), preve(g.size());\n while(f > 0) {\n priority_queue<P, vector<P>, greater<>> que;\n fill(std::begin(dist), std::end(dist), inf);\n dist[s] = 0;\n que.emplace(dist[s], s);\n while(!que.empty()) {\n const auto cur_d = que.top().first;\n const int v = que.top().second;\n que.pop();\n if(dist[v] < cur_d) continue;\n for(int i = 0; i < (int)g[v].size(); ++i) {\n auto& 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.emplace(dist[e.to], e.to);\n }\n }\n }\n if(dist[t] == inf) return -1;\n for(int v = 0; v < (int)g.size(); ++v) {\n h[v] += dist[v];\n }\n\n auto 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 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\nint n;\n\nint main() {\n cin >> n;\n vector<vector<int>> w(n, vector<int>(n));\n vector<vector<int>> e(n, vector<int>(n));\n vector<vector<char>> f(n, vector<char>(n));\n rep(i, n) {\n rep(j, n) {\n cin >> w[i][j];\n }\n }\n rep(i, n) {\n rep(j, n) {\n cin >> e[i][j];\n }\n }\n rep(i, n) {\n rep(j, n) {\n cin >> f[i][j];\n }\n }\n graph g(2 * n + 2, vector<edge>());\n int s = 2 * n, t = 2 * n + 1;\n rep(i, n) {\n add_edge(g, s, i, 1, 0);\n add_edge(g, i + n, t, 1, 0);\n }\n rep(i, n) {\n rep(j, n) {\n int cost = 0;\n if(f[i][j] == '.') cost += w[i][j] * 2;\n rep(k, n) {\n if(k != j and f[i][k] == 'o') cost += e[i][k];\n }\n rep(k, n) {\n if(k != i and f[k][j] == 'o') cost += e[k][j];\n }\n // cerr << i << \" \" << j << \" \" << cost << endl;\n add_edge(g, i, j + n, 1, cost);\n }\n }\n int mincost = min_cost_flow(g, s, t, n);\n cout << mincost / 2 << endl;\n vector<pair<pair<int, int>, string>> vec;\n vector<vector<char>> fi(n, vector<char>(n, '.'));\n rep(i, n) {\n for(auto e: g[i]) {\n int j = e.to, cp = e.cap;\n // cerr << i << \" \" << j << \" \" << cp << endl;\n if(cp == 0) {\n fi[i][j - n] = 'o';\n }\n }\n }\n rep(i, n) {\n rep(j, n) {\n if(fi[i][j] == 'o' and f[i][j] == '.') {\n vec.push_back({{i, j}, \"write\"});\n }\n if(fi[i][j] == '.' and f[i][j] == 'o') {\n vec.push_back({{i, j}, \"erase\"});\n }\n }\n }\n int sz = (int)vec.size();\n cout << sz << endl;\n rep(i, sz) {\n cout << vec[i].first.first + 1 << \" \" << vec[i].first.second + 1 << \" \" << vec[i].second << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3660,"score_of_the_acc":-0.0058,"final_rank":7},{"submission_id":"aoj_2429_4868525","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1000000000;\ntemplate <typename Cap, typename Cost>\nstruct primal_dual{\n struct edge{\n int to, rev;\n Cap cap;\n Cost cost;\n edge(int to, int rev, Cap cap, Cost cost): to(to), rev(rev), cap(cap), cost(cost){\n }\n };\n int N;\n vector<vector<edge>> G;\n primal_dual(int N): N(N), G(N){\n }\n void add_edge(int from, int to, Cap cap, Cost cost){\n int id1 = G[from].size();\n int id2 = G[to].size();\n G[from].push_back(edge(to, id2, cap, cost));\n G[to].push_back(edge(from, id1, 0, - cost));\n }\n Cost min_cost_flow(int s, int t, Cap F){\n Cap flow = 0;\n Cost cost = 0;\n vector<Cost> h(N, 0);\n while (flow < F){\n vector<Cap> m(N, INF);\n vector<Cost> d(N, INF);\n vector<int> pv(N, -1);\n vector<int> pe(N, -1);\n vector<bool> used(N, false);\n priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> pq;\n pq.push(make_pair(0, s));\n d[s] = 0;\n while (!pq.empty()){\n int v = pq.top().second;\n pq.pop();\n if (!used[v]){\n used[v] = true;\n if (v == t){\n break;\n }\n int cnt = G[v].size();\n for (int i = 0; i < cnt; i++){\n int w = G[v][i].to;\n if (!used[w] && G[v][i].cap > 0){\n Cost tmp = G[v][i].cost - h[w] + h[v];\n if (d[w] > d[v] + tmp){\n d[w] = d[v] + tmp;\n m[w] = min(m[v], G[v][i].cap);\n pv[w] = v;\n pe[w] = i;\n pq.push(make_pair(d[w], w));\n }\n }\n }\n }\n }\n if (!used[t]){\n break;\n }\n for (int i = 0; i < N; i++){\n if (used[i]){\n h[i] -= d[t] - d[i];\n }\n }\n Cap c = min(m[t], F - flow);\n for (int i = t; i != s; i = pv[i]){\n G[pv[i]][pe[i]].cap -= c;\n G[i][G[pv[i]][pe[i]].rev].cap += c;\n }\n flow += c;\n cost += c * (- h[s]);\n }\n return cost;\n }\n};\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> W(n, vector<int>(n));\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n cin >> W[i][j];\n }\n }\n vector<vector<int>> E(n, vector<int>(n));\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n cin >> E[i][j];\n }\n }\n vector<string> F(n);\n for (int i = 0; i < n; i++){\n cin >> F[i];\n }\n primal_dual<int, int> G(n * 2 + 2);\n for (int i = 0; i < n; i++){\n G.add_edge(0, i + 1, 1, 0);\n }\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n if (F[i][j] == '.'){\n G.add_edge(1 + i, 1 + n + j, 1, 1000 + W[i][j]);\n }\n if (F[i][j] == 'o'){\n G.add_edge(1 + i, 1 + n + j, 1, 1000 - E[i][j]);\n }\n }\n }\n for (int i = 0; i < n; i++){\n G.add_edge(1 + n + i, 1 + n + n, 1, 0);\n }\n int sum = 0;\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n if (F[i][j] == 'o'){\n sum += E[i][j];\n }\n }\n }\n cout << sum + G.min_cost_flow(0, n * 2 + 1, n) - 1000 * n << endl;\n vector<vector<char>> S(n, vector<char>(n, '.'));\n for (int i = 1; i <= n; i++){\n for (auto e : G.G[i]){\n if (e.to > 0 && e.cap == 0){\n S[i - 1][e.to - n - 1] = 'o';\n }\n }\n }\n vector<tuple<int, int, string>> op;\n for (int i = 0; i < n; i++){\n for (int j = 0; j < n; j++){\n if (S[i][j] == 'o' && F[i][j] == '.'){\n op.push_back(make_tuple(i, j, \"write\"));\n }\n if (S[i][j] == '.' && F[i][j] == 'o'){\n op.push_back(make_tuple(i, j, \"erase\"));\n }\n }\n }\n int m = op.size();\n cout << m << endl;\n for (int i = 0; i < m; i++){\n cout << get<0>(op[i]) + 1 << ' ' << get<1>(op[i]) + 1 << ' ' << get<2>(op[i]) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3580,"score_of_the_acc":-0.001,"final_rank":3},{"submission_id":"aoj_2429_4815013","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=205;\nconst ll INF=1<<30;\ntypedef pair<int,int> P;\n\nstruct edge{int to,cap,cost,rev;};\n\nint V;\nvector<edge> G[MAX];\nint h[MAX];\nint dist[MAX];\nint prevv[MAX],preve[MAX];\n\nvoid add_edge(int from,int to,int cap,int cost){\n G[from].push_back((edge){to,cap,cost,int(G[to].size())});\n G[to].push_back((edge){from,0,-cost,int(G[from].size()-1)});\n}\n\nint min_cost_flow(int s,int t,int f){\n int res=0;\n fill(h,h+V,0);\n \n while(f>0){\n priority_queue<P,vector<P>,greater<P>> que;\n fill(dist,dist+V,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<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 \n if(dist[t]==INF){\n return -1;\n }\n for(int v=0;v<V;v++){\n h[v]+=dist[v];\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*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}//sからtへの流量fの最小費用流、流せない場合は-1\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N;cin>>N;\n vector<vector<int>> A(N,vector<int>(N)),B(N,vector<int>(N));\n for(int i=0;i<N;i++) for(int j=0;j<N;j++) cin>>A[i][j];\n for(int i=0;i<N;i++) for(int j=0;j<N;j++) cin>>B[i][j];\n vector<string> S(N);\n for(int i=0;i<N;i++) cin>>S[i];\n \n V=2*N+2;\n \n for(int i=0;i<N;i++){\n for(int j=0;j<N;j++){\n int cost=0;\n \n for(int k=0;k<N;k++){\n if(j==k){\n if(S[i][k]=='.') cost+=A[i][k];\n }else{\n if(S[i][k]=='o') cost+=B[i][k];\n }\n }\n \n add_edge(i,N+j,1,cost);\n }\n add_edge(2*N,i,1,0);\n add_edge(N+i,2*N+1,1,0);\n }\n \n int x=min_cost_flow(2*N,2*N+1,N);\n \n vector<pair<int,int>> C,D;\n \n for(int i=0;i<N;i++){\n for(auto j:G[i]){\n if(j.to>=N&&j.cap==0){\n for(int k=0;k<N;k++){\n if(j.to-N==k){\n if(S[i][k]=='.') C.push_back(mp(i+1,k+1));\n }else{\n if(S[i][k]=='o') D.push_back(mp(i+1,k+1));\n }\n }\n }\n }\n }\n \n cout<<x<<endl;\n \n cout<<si(C)+si(D)<<endl;\n \n for(auto a:C) cout<<a.fi<<\" \"<<a.se<<\" \"<<\"write\"<<endl;\n for(auto a:D) cout<<a.fi<<\" \"<<a.se<<\" \"<<\"erase\"<<endl;\n \n}","accuracy":1,"time_ms":10,"memory_kb":3632,"score_of_the_acc":-0.0041,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_2429_9723846\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define INF 1e9\\nusing namespace std;\\n\\nconst int MAX_N = 100; // Максимальное количество вершин\\nconst int MAX_V = 1000; // Максимальное количество вершин в сети\\n\\nstruct Edge {\\n int to, cap, cost, rev;\\n};\\n\\nint n, N, K, V;\\nint W[MAX_N][MAX_N], E[MAX_N][MAX_N];\\nstring F[MAX_N];\\nvector<Edge> G[MAX_V]; // Граф сети\\nint dist[MAX_V], prevv[MAX_V], preve[MAX_V]; // Для хранения пути\\n\\n// Добавление ребра в граф\\nvoid add_edge(int from, int to, int cap, int cost) {\\n G[from].push_back({to, cap, cost, (int)G[to].size()});\\n G[to].push_back({from, 0, -cost, (int)G[from].size() - 1});\\n}\\n\\n// Алгоритм поиска минимальной стоимости потока\\nint min_cost_flow(int s, int t, int f) {\\n int total_cost = 0;\\n while (f > 0) {\\n fill(dist, dist + V, INF);\\n dist[s] = 0;\\n bool update = true;\\n\\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 // Если нет пути до t, возвращаем -1\\n if (dist[t] == INF) return -1;\\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\\n f -= d;\\n total_cost += d * dist[t];\\n\\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 total_cost;\\n}\\n\\n// Основная функция для двудольного сопоставления\\nint Bipartite_Matching() {\\n int source = N + K, sink = source + 1;\\n\\n // Соединяем исход с вершинами первой доли\\n for (int i = 0; i < N; ++i) add_edge(source, i, 1, 0);\\n\\n // Соединяем вершины второй доли с стоком\\n for (int i = 0; i < K; ++i) add_edge(N + i, sink, 1, 0);\\n\\n int initial_cost = 0;\\n\\n // Добавляем рёбра между долями с соответствующими весами\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < n; ++j) {\\n if (F[i][j] == 'o') {\\n initial_cost += E[i][j];\\n add_edge(i, N + j, 1, -E[i][j]); // Если 'o', это исходное состояние\\n } else {\\n add_edge(i, N + j, 1, W[i][j]); // Если '.', это потенциальный переход\\n }\\n }\\n }\\n\\n return initial_cost + min_cost_flow(source, sink, N);\\n}\\n\\nint main() {\\n // Ввод данных\\n cin >> n;\\n for (int i = 0; i < n; ++i)\\n for (int j = 0; j < n; ++j)\\n cin >> W[i][j];\\n\\n for (int i = 0; i < n; ++i)\\n for (int j = 0; j < n; ++j)\\n cin >> E[i][j];\\n\\n for (int i = 0; i < n; ++i)\\n cin >> F[i];\\n\\n N = K = n;\\n V = 2 * n + 2;\\n\\n // Решение задачи\\n cout << Bipartite_Matching() << endl;\\n\\n int cnt = 0;\\n\\n // Подсчёт и вывод результата\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < (int)G[i].size(); ++j) {\\n int to = G[i][j].to - N;\\n if (G[i][j].cap <= 0 && F[i][to] == '.') cnt++;\\n if (G[i][j].cap > 0 && F[i][to] == 'o') cnt++;\\n }\\n }\\n\\n cout << cnt << endl;\\n\\n // Вывод операций \\\"write\\\" и \\\"erase\\\"\\n for (int i = 0; i < n; ++i) {\\n for (int j = 0; j < (int)G[i].size(); ++j) {\\n int to = G[i][j].to - N;\\n if (G[i][j].cap <= 0 && F[i][to] == '.')\\n cout << i + 1 << \\\" \\\" << to + 1 << \\\" write\\\" << endl;\\n else if (G[i][j].cap > 0 && F[i][to] == 'o')\\n cout << i + 1 << \\\" \\\" << to + 1 << \\\" erase\\\" << endl;\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3932,\n \"score_of_the_acc\": -0.0221,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2429_8416735\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// ========================================================================== Library Part ==========================================================================\\nstruct Edge {\\n int to, cap, rev, cost;\\n};\\n\\nclass MinCostFlow {\\n public:\\n int size_ = 0;\\n vector<vector<Edge>> G;\\n\\n void init(int sz) {\\n size_ = sz;\\n G.resize(size_, vector<Edge>(0));\\n }\\n\\n void add_edge(int u, int v, int c, int d) {\\n G[u].push_back(Edge{v, c, (int)G[v].size() - 0, +d});\\n G[v].push_back(Edge{u, 0, (int)G[u].size() - 1, -d});\\n }\\n\\n int min_flow(int s, int t, int f) {\\n int Answer = 0;\\n\\n // Simulation Start\\n while (f > 0) {\\n vector<int> Dist;\\n vector<int> PreV;\\n vector<int> PreE;\\n Dist.resize(size_, 100000000);\\n PreV.resize(size_, -1);\\n PreE.resize(size_, -1);\\n\\n // Shortest Path\\n Dist[s] = 0;\\n for (int i = 0; i < size_; i++) {\\n for (int j = 0; j < size_; j++) {\\n if (Dist[j] == 100000000) continue;\\n for (int k = 0; k < (int)G[j].size(); k++) {\\n if (G[j][k].cap == 0) continue;\\n int nex = G[j][k].to;\\n int cos = G[j][k].cost;\\n if (Dist[nex] > Dist[j] + cos) {\\n Dist[nex] = Dist[j] + cos;\\n PreV[nex] = j;\\n PreE[nex] = k;\\n }\\n }\\n }\\n }\\n if (Dist[t] == 100000000) return -1;\\n\\n // Fukugen 1\\n int cx = t, mincap = f;\\n while (cx != s) {\\n int nex = PreV[cx];\\n int idx = PreE[cx];\\n mincap = min(mincap, G[nex][idx].cap);\\n cx = nex;\\n }\\n Answer += mincap * Dist[t];\\n\\n // Fukugen 2\\n cx = t;\\n while (cx != s) {\\n int nex = PreV[cx];\\n int idx = PreE[cx];\\n G[nex][idx].cap -= mincap;\\n G[G[nex][idx].to][G[nex][idx].rev].cap += mincap;\\n cx = nex;\\n }\\n f -= mincap;\\n }\\n\\n // Return\\n return Answer;\\n }\\n};\\n\\n// ========================================================================== Main Part ==========================================================================\\nint N;\\nint Cost1[1009][1009];\\nint Cost2[1009][1009];\\nchar C[1009][1009];\\nint Calc[1009][1009];\\n\\nint main() {\\n // Step 1. Input\\n cin >> N;\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) cin >> Cost1[i][j];\\n }\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) cin >> Cost2[i][j];\\n }\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) cin >> C[i][j];\\n }\\n\\n // Step 2. Get Cost\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n for (int k = 1; k <= N; k++) {\\n if (j == k && C[i][k] == '.') Calc[i][j] += Cost1[i][k];\\n if (j != k && C[i][k] == 'o') Calc[i][j] += Cost2[i][k];\\n }\\n }\\n }\\n\\n // Step 3. Get Graph\\n MinCostFlow Z; Z.init(2 * N + 8);\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) Z.add_edge(i, N + j, 1, Calc[i][j]);\\n }\\n for (int i = 1; i <= N; i++) Z.add_edge(2 * N + 1, i, 1, 0);\\n for (int i = 1; i <= N; i++) Z.add_edge(N + i, 2 * N + 2, 1, 0);\\n\\n // Step 4. Flow\\n int Answer = Z.min_flow(2 * N + 1, 2 * N + 2, N);\\n vector<tuple<int, int, string>> Answer2;\\n for (int i = 1; i <= N; i++) {\\n for (int j = 0; j < Z.G[i].size(); j++) {\\n int nex = Z.G[i][j].to;\\n if (N + 1 <= nex && nex <= 2 * N && Z.G[i][j].cap == 0) {\\n for (int k = 1; k <= N; k++) {\\n if (k == nex - N && C[i][k] == '.') Answer2.push_back(make_tuple(i, k, \\\"write\\\"));\\n if (k != nex - N && C[i][k] == 'o') Answer2.push_back(make_tuple(i, k, \\\"erase\\\"));\\n }\\n }\\n }\\n }\\n\\n // Step 5. Output\\n cout << Answer << endl;\\n cout << Answer2.size() << endl;\\n for (int i = 0; i < (int)Answer2.size(); i++) {\\n cout << get<0>(Answer2[i]) << \\\" \\\" << get<1>(Answer2[i]) << \\\" \\\" << get<2>(Answer2[i]) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 10452,\n \"score_of_the_acc\": -1.4142,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2429_7407721\",\n \"code_snippet\": \"// \\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\\n#define all(x) (x).begin(), (x).end()\\n\\nconst int INF = (int)(1e9);\\n\\nstruct MinCostFlow {\\n struct edge {\\n int to, cap, rev, cost;\\n edge(int t, int ca, int r, int co) : to(t), cap(ca), rev(r), cost(co) {}\\n };\\n int n;\\n vector<vector<edge>> g;\\n vector<int> dist, preve, prevv;\\n MinCostFlow(int n_) {\\n n = n_;\\n g.resize(n, vector<edge>());\\n dist.resize(n), preve.resize(n), prevv.resize(n);\\n }\\n void add_edge(int f, int t, int ca, int co) {\\n g[f].emplace_back(t, ca, (int)(g[t].size()), co);\\n g[t].emplace_back(f, 0, (int)(g[f].size())-1, -co);\\n }\\n int min_cost_flow(int s, int t, int f) {\\n int res = 0;\\n while (f > 0) {\\n dist.assign(n, INF);\\n dist[s] = 0;\\n bool update = true;\\n while (update) {\\n update = false;\\n rep(v, n) if (dist[v] != INF) {\\n rep(e, g[v].size()) if (g[v][e].cap>0 && dist[g[v][e].to]>dist[v]+g[v][e].cost) {\\n dist[g[v][e].to] = dist[v] + g[v][e].cost;\\n preve[g[v][e].to] = e;\\n prevv[g[v][e].to] = v;\\n if (!update) update = true;\\n }\\n }\\n }\\n if (dist[t] == INF) return -1;\\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 * dist[t];\\n for (int v=t; v!=s; v=prevv[v]) {\\n g[prevv[v]][preve[v]].cap -= d;\\n g[v][g[prevv[v]][preve[v]].rev].cap += d;\\n }\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<vector<int>> w(n, vector<int>(n)), e(n, vector<int>(n));\\n\\trep(i, n) rep(j, n) cin >> w[i][j];\\n\\trep(i, n) rep(j, n) cin >> e[i][j];\\n\\tvector<string> f(n);\\n\\trep(i, n) cin >> f[i];\\n\\tMinCostFlow mcf(2*n+2);\\n\\trep(i, n) {\\n\\t\\tint scost = 0;\\n\\t\\trep(j, n) if (f[i][j] == 'o') scost += e[i][j];\\n\\t\\trep(j, n) {\\n\\t\\t\\tint tcost = scost + (f[i][j]=='o' ? -e[i][j] : w[i][j]);\\n\\t\\t\\tmcf.add_edge(i, n+j, 1, tcost);\\n\\t\\t}\\n\\t}\\n\\trep(i, n) mcf.add_edge(2*n, i, 1, 0);\\n\\trep(i, n) mcf.add_edge(n+i, 2*n+1, 1, 0);\\n\\tint res = mcf.min_cost_flow(2*n, 2*n+1, n);\\n\\tcout << res << endl;\\n\\tvector<tuple<int, int, string>> rlst;\\n\\trep(i, n) for (const auto& ei : mcf.g[i]) if (ei.cap==0 && ei.cost>0) {\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (j!=ei.to-n && f[i][j]=='o') rlst.emplace_back(i+1, j+1, \\\"erase\\\");\\n\\t\\t\\tif (j==ei.to-n && f[i][j]=='.') rlst.emplace_back(i+1, j+1, \\\"write\\\"); \\n\\t\\t}\\n\\t}\\n\\tint rlen = rlst.size();\\n\\tcout << rlen << endl;\\n\\trep(i, rlen) cout << get<0>(rlst[i]) << ' ' << get<1>(rlst[i]) << ' ' << get<2>(rlst[i]) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4028,\n \"score_of_the_acc\": -0.0279,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2429_7407710\",\n \"code_snippet\": \"// \\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\\n#define all(x) (x).begin(), (x).end()\\n\\nconst int INF = (int)(1e9);\\n\\nstruct edge {\\n\\tint to, cap, rev, cost;\\n\\tedge(int t, int ca, int r, int co) : to(t), cap(ca), rev(r), cost(co) {}\\n};\\nclass MinCostFlow {\\n int n;\\n vector<int> dist, preve, prevv;\\npublic:\\n vector<vector<edge>> g;\\n MinCostFlow(int n_) {\\n n = n_;\\n g.resize(n, vector<edge>());\\n dist.resize(n), preve.resize(n), prevv.resize(n);\\n }\\n void add_edge(int f, int t, int ca, int co) {\\n g[f].emplace_back(t, ca, (int)(g[t].size()), co);\\n g[t].emplace_back(f, 0, (int)(g[f].size())-1, -co);\\n }\\n int min_cost_flow(int s, int t, int f) {\\n int res = 0;\\n while (f > 0) {\\n dist.assign(n, INF);\\n dist[s] = 0;\\n bool update = true;\\n while (update) {\\n update = false;\\n rep(v, n) if (dist[v] != INF) {\\n rep(e, g[v].size()) if (g[v][e].cap>0 && dist[g[v][e].to]>dist[v]+g[v][e].cost) {\\n dist[g[v][e].to] = dist[v] + g[v][e].cost;\\n preve[g[v][e].to] = e;\\n prevv[g[v][e].to] = v;\\n if (!update) update = true;\\n }\\n }\\n }\\n if (dist[t] == INF) return -1;\\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 * dist[t];\\n for (int v=t; v!=s; v=prevv[v]) {\\n g[prevv[v]][preve[v]].cap -= d;\\n g[v][g[prevv[v]][preve[v]].rev].cap += d;\\n }\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<vector<int>> w(n, vector<int>(n)), e(n, vector<int>(n));\\n\\trep(i, n) rep(j, n) cin >> w[i][j];\\n\\trep(i, n) rep(j, n) cin >> e[i][j];\\n\\tvector<string> f(n);\\n\\trep(i, n) cin >> f[i];\\n\\tMinCostFlow mcf(2*n+2);\\n\\trep(i, n) {\\n\\t\\tint scost = 0;\\n\\t\\trep(j, n) if (f[i][j] == 'o') scost += e[i][j];\\n\\t\\trep(j, n) {\\n\\t\\t\\tint tcost = scost + (f[i][j]=='o' ? -e[i][j] : w[i][j]);\\n\\t\\t\\tmcf.add_edge(i, n+j, 1, tcost);\\n\\t\\t}\\n\\t}\\n\\trep(i, n) mcf.add_edge(2*n, i, 1, 0);\\n\\trep(i, n) mcf.add_edge(n+i, 2*n+1, 1, 0);\\n\\tint res = mcf.min_cost_flow(2*n, 2*n+1, n);\\n\\tcout << res << endl;\\n\\tvector<tuple<int, int, string>> rlst;\\n\\trep(i, n) for (const auto& ei : mcf.g[i]) if (ei.cap==0 && ei.cost>0) {\\n\\t\\trep(j, n) {\\n\\t\\t\\tif (j!=ei.to-n && f[i][j]=='o') rlst.emplace_back(i+1, j+1, \\\"erase\\\");\\n\\t\\t\\tif (j==ei.to-n && f[i][j]=='.') rlst.emplace_back(i+1, j+1, \\\"write\\\"); \\n\\t\\t}\\n\\t}\\n\\tint rlen = rlst.size();\\n\\tcout << rlen << endl;\\n\\trep(i, rlen) cout << get<0>(rlst[i]) << ' ' << get<1>(rlst[i]) << ' ' << get<2>(rlst[i]) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -0.0284,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2429_7270852\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)\\n#define rep(i, n) drep(i, 0, n - 1)\\n#define all(a) (a).begin(), (a).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n\\nconst ll MOD = 1000000007;\\nconst ll MOD2 = 998244353;\\nconst ll INF = 1LL << 60;\\nconst ll MAX_N = 2e5;\\n\\nstruct MinCostFlow{\\n struct Edge{\\n ll to;\\n ll cap;\\n ll cost;\\n ll rev;\\n };\\n\\n vector<vector<Edge>> G;\\n ll N;\\n vector<ll> h; // ポテンシャル\\n vector<ll> dist; // 最短距離\\n vector<ll> prevv; // 直前の頂点\\n vector<ll> preve; // 直前の辺\\n\\n MinCostFlow(vector<vector<tuple<ll, ll, ll>>> G_){\\n N = (ll)G_.size();\\n G.resize(N);\\n h.resize(N, 0);\\n dist.resize(N, 0);\\n prevv.resize(N, 0);\\n preve.resize(N, 0);\\n\\n rep(from, N){\\n for(tuple<ll, ll, ll> tmp : G_[from]){\\n ll to = get<0>(tmp);\\n ll cap = get<1>(tmp);\\n ll cost = get<2>(tmp);\\n G[from].pb((Edge){to, cap, cost, (ll)G[to].size()});\\n G[to].pb((Edge){from, 0, -cost, (ll)G[from].size()-1});\\n }\\n }\\n }\\n\\n //コストが非負実数の場合\\n ll min_cost_flow1(ll s, ll t, ll f){\\n vector<vector<Edge>> H(N);\\n rep(from, N) for(Edge e : G[from]) H[from].pb(e);\\n rep(i, N) h[i] = 0;\\n\\n ll res = 0;\\n while(f > 0){\\n //ダイクストラ法を用いてhを更新\\n priority_queue<pll, vector<pll>, greater<pll>> PQ;\\n rep(i, N) dist[i] = INF;\\n dist[s] = 0;\\n PQ.push({0, s});\\n while(!PQ.empty()){\\n pll p = PQ.top();\\n PQ.pop();\\n ll v = p.se;\\n if(dist[v] < p.fi) continue;\\n\\n for(ll i=0; i<(ll)H[v].size(); i++){\\n Edge &e = H[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({dist[e.to], e.to});\\n }\\n }\\n }\\n if(dist[t] == INF){\\n //これ以上流せない\\n return -1;\\n }\\n for(ll v=0; v<N; v++) h[v] += dist[v];\\n\\n // s-t間最短経路に沿って目一杯流す\\n ll d = f;\\n for(ll v=t; v!=s; v=prevv[v]){\\n d = min(d, H[prevv[v]][preve[v]].cap);\\n }\\n f -= d;\\n res += d*h[t];\\n for(ll v=t; v!=s; v=prevv[v]){\\n Edge &e = H[prevv[v]][preve[v]];\\n e.cap -= d;\\n H[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n }\\n\\n //負のコストが存在する場合\\n ll min_cost_flow2(ll s, ll t, ll f){\\n ll res = 0;\\n while(f > 0){\\n //ベルマンフォード法により, s-t間最短経路を求める\\n rep(i, N) dist[i] = INF;\\n dist[s] = 0;\\n bool update = true;\\n while(update){\\n update = false;\\n rep(v, N){\\n if(dist[v]==INF) continue;\\n for(ll i=0; i<(ll)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 //これ以上流せない\\n return -1;\\n }\\n\\n //s-t間最短経路に沿って目一杯流す\\n ll d = f;\\n for(ll 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(ll 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 vector<pll> match_pair(){\\n vector<pll> res;\\n ll n = (N-2)/2;\\n rep(u, n){\\n for(ll i=0; i<(ll)G[u].size(); i++){\\n Edge e = G[u][i];\\n if(n <= e.to && e.to < 2*n && e.cap==0){\\n res.pb({u, e.to-n});\\n }\\n }\\n }\\n\\n return res;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n \\n ll n;\\n cin >> n;\\n\\n vector<vector<ll>> w(n, vector<ll>(n)), e(n, vector<ll>(n));\\n rep(i, n) rep(j, n) cin >> w[i][j];\\n rep(i, n) rep(j, n) cin >> e[i][j];\\n\\n vector<vector<char>> f(n, vector<char>(n));\\n rep(i, n) rep(j, n) cin >> f[i][j];\\n\\n ll mcf = 0;\\n rep(i, n) rep(j, n) if(f[i][j]=='o') mcf += e[i][j];\\n\\n vector<vector<tuple<ll, ll, ll>>> G(2*n+2);\\n ll s = 2*n;\\n ll t = 2*n+1;\\n rep(i, n) G[s].pb({i, 1, 0});\\n rep(i, n) rep(j, n){\\n if(f[i][j]=='.'){\\n G[i].pb({n+j, 1, w[i][j]});\\n }else{\\n G[i].pb({n+j, 1, -e[i][j]});\\n }\\n }\\n rep(j, n) G[n+j].pb({t, 1, 0});\\n\\n MinCostFlow MCF(G);\\n mcf += MCF.min_cost_flow2(s, t, n);\\n cout << mcf << endl;\\n \\n vector<pll> mp = MCF.match_pair();\\n vector<vector<char>> ans(n, vector<char>(n, '.'));\\n for(pll tmp : mp){\\n ll u = tmp.fi;\\n ll v = tmp.se;\\n ans[u][v] = 'o';\\n }\\n\\n ll cnt = 0;\\n rep(i, n) rep(j, n){\\n if(f[i][j]!=ans[i][j]){\\n cnt++;\\n }\\n }\\n\\n cout << cnt << endl;\\n rep(i, n) rep(j, n){\\n if(f[i][j] != ans[i][j]){\\n if(f[i][j]=='.'){\\n cout << i+1 << \\\" \\\" << j+1 << \\\" write\\\" << endl; \\n }else{\\n cout << i+1 << \\\" \\\" << j+1 << \\\" erase\\\" << endl;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4616,\n \"score_of_the_acc\": -0.0633,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2429_7140909\",\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 per(i,n) for(int i = (n) - 1; 0 <= i; i--)\\n#define rep2(i,l,r) for(int i = (l); i < int(r); i++)\\n#define per2(i,l,r) for(int i = (r) - 1; int(l) <= i; i--)\\n#define MM << \\\" \\\" <<\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\n#define each(e, x) for(atuo &e : x)\\n\\ntemplate<class T>\\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T>\\nusing maxheap = priority_queue<T>;\\n\\ntemplate<class T>\\nvoid print(const vector<T> &v, T x = 0) {\\n int n = sz(v);\\n rep(i,n) {\\n cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n }\\n if(v.empty()) cout << '\\\\n';\\n}\\n\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\ntemplate<class T>\\nbool chmax(T &x, const T &y) {\\n return (x < y) ? (x = y, true) : false;\\n}\\n\\ntemplate<class T>\\nbool chmin(T &x, const T &y) {\\n return (x > y) ? (x = y, true) : false;\\n}\\n\\nstruct MCF {\\n struct edge {\\n int to;\\n ll cap, cost;\\n int rev;\\n edge(int to, ll cap, ll cost, int rev)\\n : to(to), cap(cap), cost(cost), rev(rev) {}\\n };\\n\\n vector<vector<edge>> es;\\n vector<ll> d, h;\\n vector<int> pre_v, pre_e;\\n vector<pii> cash;\\n ll INF = 1LL << 60;\\n int n;\\n\\n MCF(int n) : es(n), d(n), h(n), pre_v(n), pre_e(n), cash(), n(n) {}\\n\\n int add_edge(int u, int v, int cap, ll cost) {\\n es[u].eb(v, cap, cost, sz(es[v]));\\n es[v].eb(u, 0 , -cost, sz(es[u]) - 1);\\n int res = cash.size();\\n cash.eb(u, sz(es[u]) - 1);\\n return res;\\n }\\n\\n void dijkstra(int s) {\\n fill(all(d), INF);\\n minheap<pll> q;\\n q.emplace(d[s] = 0, s);\\n while(!q.empty()) {\\n auto [p, i] = q.top();\\n q.pop();\\n if(p > d[i]) continue;\\n rep(j, sz(es[i])) {\\n edge e = es[i][j];\\n if(e.cap > 0 && chmin(d[e.to], d[i] + e.cost + h[i] - h[e.to])) {\\n assert(e.cost + h[i] - h[e.to] >= 0);\\n pre_v[e.to] = i;\\n pre_e[e.to] = j;\\n q.emplace(d[e.to], e.to);\\n }\\n }\\n }\\n }\\n\\n ll mcf(int s, int t, ll flow) {\\n ll ret = 0;\\n while(flow > 0) {\\n dijkstra(s);\\n if(d[t] == INF) return -INF;\\n rep(i,n) {\\n if(h[i] == INF || d[i] == INF) {\\n h[i] = INF;\\n } else {\\n h[i] += d[i];\\n }\\n }\\n ll f = flow;\\n for(int i = t; i != s; i = pre_v[i]) {\\n chmin(f, es[pre_v[i]][pre_e[i]].cap);\\n }\\n assert(f > 0);\\n ret += h[t] * f, flow -= f;\\n for(int i = t; i != s; i = pre_v[i]) {\\n edge &e = es[pre_v[i]][pre_e[i]];\\n e.cap -= f;\\n es[i][e.rev].cap += f;\\n }\\n }\\n return ret;\\n }\\n\\n edge get_edge(int s) {\\n assert(0 <= s);\\n assert(s < sz(cash));\\n auto [i, j] = cash[s];\\n return es[i][j];\\n }\\n };\\n\\nint main() {\\n int n; cin >> n;\\n vector<vector<ll>> w(n, vector<ll>(n));\\n vector<vector<ll>> e(n, vector<ll>(n));\\n vector<string> f(n);\\n\\n rep(i,n) rep(j,n) cin >> w[i][j];\\n rep(i,n) rep(j,n) cin >> e[i][j];\\n rep(i,n) cin >> f[i];\\n\\n MCF mcf(n * 2 + 2);\\n const int S = n * 2, T = S + 1;\\n vector<vector<ll>> id(n, vector<ll>(n));\\n rep(i,n) {\\n ll sm = 0;\\n rep(j,n) {\\n if(f[i][j] == 'o') sm += e[i][j];\\n }\\n rep(j,n) {\\n if(f[i][j] == 'o') {\\n id[i][j] = mcf.add_edge(i, j + n, 1, sm - e[i][j]);\\n } else {\\n id[i][j] = mcf.add_edge(i, j + n, 1, sm + w[i][j]);\\n }\\n }\\n }\\n\\n rep(i,n) {\\n mcf.add_edge(S, i, 1, 0);\\n mcf.add_edge(i + n, T, 1, 0);\\n }\\n\\n ll score = mcf.mcf(S, T, n);\\n cout << score << endl;\\n vector<pii> ans;\\n rep(i,n) rep(j,n) {\\n int k = f[i][j] == 'o' ? 1 : 0;\\n if(mcf.get_edge(id[i][j]).cap == k) ans.eb(i, j);\\n }\\n\\n cout << sz(ans) << endl;\\n for(auto &i : ans) {\\n if(f[i.first][i.second] == 'o') cout << i.first + 1 MM i.second + 1 MM \\\"erase\\\" << endl;\\n else cout << i.first + 1 MM i.second + 1 MM \\\"write\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4536,\n \"score_of_the_acc\": -0.0585,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2429_6521699\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nnamespace po167{\\ntemplate<class Cap,class Cost>\\nstruct min_cost_flow\\n{\\n\\tstruct edge{\\n\\t\\tint to;\\n\\t\\tCap cap;\\n\\t\\tCost cost;\\n\\t};\\n\\tstd::vector<std::vector<edge>> G;\\n\\tstd::vector<std::vector<int>> rev_edge;\\n\\tstd::vector<std::pair<int,int>> edge_order;\\n\\tint _n;\\n\\tmin_cost_flow(int n):G(n),rev_edge(n),_n(n){}\\n\\tint add_edge(int from,int to,Cap cap,Cost cost){\\n\\t\\tassert(0<=from&&from<_n);\\n\\t\\tassert(0<=to&&to<_n);\\n\\t\\tedge_order.push_back({from,(int)(G[from].size())});\\n\\t\\trev_edge[to].push_back((int)(G[from].size()));\\n\\t\\tG[from].push_back((edge){to,cap,cost});\\n\\t\\trev_edge[from].push_back((int)(G[to].size()));\\n\\t\\tG[to].push_back((edge){from,(Cap)0,-cost});\\n\\t\\treturn (int)(edge_order.size());\\n\\t}\\n\\tstd::vector<Cost> min_cost_slope(int s,int t){\\n\\t\\tassert(0<=s&&s<_n);\\n\\t\\tassert(0<=t&&t<_n);\\n\\t\\tstd::vector<Cost> ans={0};\\n\\t\\tstd::vector<Cost> pot(_n);\\n\\t\\twhile(true){\\n\\t\\t\\tstd::priority_queue<std::pair<Cost,int>,std::vector<std::pair<Cost,int>>,std::greater<std::pair<Cost,int>>> pq;\\n\\t\\t\\tstd::vector<int> front(_n);\\n\\t\\t\\tstd::vector<Cost> seen(_n,std::numeric_limits<Cost>::max());\\n\\t\\t\\tseen[s]=0;\\n\\t\\t\\tpq.push({0,s});\\n\\t\\t\\twhile(!pq.empty()){\\n\\t\\t\\t\\tCost time;\\n\\t\\t\\t\\tint ind;\\n\\t\\t\\t\\tCost n_time;\\n\\t\\t\\t\\tstd::tie(time,ind)=pq.top();\\n\\t\\t\\t\\tpq.pop();\\n\\t\\t\\t\\tif(seen[ind]<time) continue;\\n\\t\\t\\t\\tfor(int i=0;i<(int)(G[ind].size());i++){\\n\\t\\t\\t\\t\\tauto x=G[ind][i];\\n\\t\\t\\t\\t\\tif(x.cap==0) continue;\\n\\t\\t\\t\\t\\tn_time=time+x.cost+pot[ind]-pot[x.to];\\n\\t\\t\\t\\t\\tif(seen[x.to]>n_time){\\n\\t\\t\\t\\t\\t\\tseen[x.to]=n_time;\\n\\t\\t\\t\\t\\t\\tfront[x.to]=rev_edge[ind][i];\\n\\t\\t\\t\\t\\t\\tpq.push({n_time,x.to});\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t/*for(int i=0;i<_n;i++){\\n\\t\\t\\t\\tcout<<seen[i]<<\\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout<<endl;*/\\n\\t\\t\\tif(seen[t]==std::numeric_limits<Cost>::max()){\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tint ind=t;\\n\\t\\t\\twhile(ind!=s){\\n\\t\\t\\t\\tG[ind][front[ind]].cap++;\\n\\t\\t\\t\\tint f=G[ind][front[ind]].to;\\n\\t\\t\\t\\tG[f][rev_edge[ind][front[ind]]].cap--;\\n\\t\\t\\t\\tind=f;\\n\\t\\t\\t}\\n\\t\\t\\tans.push_back(pot[t]-pot[s]+seen[t]);\\n\\t\\t\\tstd::swap(pot,seen);\\n\\t\\t}\\n\\t\\tfor(int i=1;i<(int)(ans.size());i++) ans[i+1]+=ans[i];\\n\\t\\treturn ans;\\n\\t}\\n\\tstd::pair<Cap,Cost> flow(int s,int t){\\n\\t\\tauto tmp=min_cost_slope(s,t);\\n\\t\\tint x=tmp.size();\\n\\t\\treturn {(Cap)(x-1),tmp[x-1]};\\n\\t}\\n\\tstd::tuple<int,int,Cap> report_edge(int i){\\n\\t\\tint x,y;\\n\\t\\tstd::tie(x,y)=edge_order[i];\\n\\t\\tint t=G[x][y].to;\\n\\t\\treturn {x,t,G[t][rev_edge[x][y]].cap};\\n\\t}\\n};\\n};\\n\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint n;\\n\\tcin>>n;\\n\\tstd::vector<std::vector<int>> W(n,std::vector<int>(n)),E(n,std::vector<int>(n)),F(n,std::vector<int>(n));\\n\\tint tmp=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++) cin>>W[i][j];\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++) cin>>E[i][j];\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tchar c;\\n\\t\\t\\tcin>>c;\\n\\t\\t\\tif(c=='o'){\\n\\t\\t\\t\\tF[i][j]=1;\\n\\t\\t\\t\\ttmp+=E[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint M=2000;\\n\\tpo167::min_cost_flow<int,int> G(n*2+2);\\n\\tint S=n*2,T=S+1;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tif(F[i][j]) G.add_edge(i,j+n,1,M-E[i][j]);\\n\\t\\t\\telse G.add_edge(i,j+n,1,M+W[i][j]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tG.add_edge(S,i,1,0);\\n\\t\\tG.add_edge(i+n,T,1,0);\\n\\t}\\n\\tauto ans=G.flow(S,T);\\n\\tcout<<ans.second+tmp-M*n<<\\\"\\\\n\\\";\\n\\tstd::vector<std::pair<int,int>> p;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tauto x=G.report_edge(i*n+j);\\n\\t\\t\\tint r=std::get<2>(x);\\n\\t\\t\\tif(r^F[i][j]) p.push_back({i,j});\\n\\t\\t}\\n\\t}\\n\\tcout<<p.size()<<\\\"\\\\n\\\";\\n\\tfor(auto x:p){\\n\\t\\tint s,t;\\n\\t\\tstd::tie(s,t)=x;\\n\\t\\tcout<<s+1<<\\\" \\\"<<t+1<<\\\" \\\";\\n\\t\\tif(F[s][t]) cout<<\\\"erase\\\\n\\\";\\n\\t\\telse cout<<\\\"write\\\\n\\\";\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3940,\n \"score_of_the_acc\": -0.0226,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2429_6022393\",\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 << 29;\\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\\n/*\\n○のついてる頂点を全て消したとみなす\\noの頂点はコスト-a[i][j]\\nxの頂点はコストa[i][j]\\nとする\\nS -> (i行) -> (j列) -> T の順番で流す\\nS -> (i行), (j列) -> T はcap=1, cost=0\\n(i行) -> (j列) はcap=1, cost=a[i][j] or -a[i][j]\\n*/\\n\\ntemplate<typename Cap, typename Cost>\\nclass MinCostFlow {\\nprivate:\\n struct edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n edge() {}\\n edge(int to, Cap cap, Cost cost, int rev):\\n to(to), cap(cap), cost(cost), rev(rev) {}\\n };\\n\\n int N;\\n vector<vector<edge>> G;\\n vector<Cost> h, dist;\\n vector<int> prev_v, prev_e;\\n Cost res;\\n\\n void bellman_ford(int S) {\\n const Cost inf = numeric_limits<Cost>::max();\\n fill(dist.begin(), dist.end(), inf);\\n dist[S] = 0;\\n bool upd = true;\\n while(upd) {\\n upd = false;\\n for(int from = 0; from < N; from++) {\\n if(dist[from] == inf) continue;\\n for(int i = 0; i < (int)G[from].size(); i++) {\\n auto &e = G[from][i];\\n if(e.cap > 0 and dist[e.to] > dist[from] + e.cost) {\\n dist[e.to] = dist[from] + e.cost;\\n prev_v[e.to] = from;\\n prev_e[e.to] = i;\\n upd = true;\\n }\\n }\\n }\\n }\\n }\\n\\npublic:\\n MinCostFlow() {}\\n MinCostFlow(int N): N(N), G(N), h(N), dist(N), prev_v(N), prev_e(N) {}\\n\\n void add_edge(int from, int to, Cap cap, Cost cost) {\\n G[from].emplace_back(to, cap, cost, (int)G[to].size());\\n G[to].emplace_back(from, 0, -cost, (int)G[from].size() - 1);\\n }\\n\\n bool build(int S, int T, Cap f = numeric_limits<Cap>::max()) {\\n res = 0;\\n const Cost inf = numeric_limits<Cost>::max();\\n while(f > 0) {\\n bellman_ford(S);\\n if(dist[T] == inf) return false;\\n\\n Cap d = f;\\n for(int v = T; v != S; v = prev_v[v]) {\\n d = min(d, G[prev_v[v]][prev_e[v]].cap);\\n }\\n f -= d;\\n res += d * dist[T];\\n for(int v = T; v != S; v = prev_v[v]) {\\n auto &e = G[prev_v[v]][prev_e[v]];\\n e.cap -= d;\\n G[v][e.rev].cap += d;\\n }\\n }\\n return true;\\n }\\n\\n Cost get_cost() { return res; }\\n vector<vector<edge>> get_graph() { return G; }\\n};\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector w(N, vector<int>(N));\\n vector e(N, vector<int>(N));\\n REP(i, N) REP(j, N) cin >> w[i][j];\\n REP(i, N) REP(j, N) cin >> e[i][j];\\n vector<string> g(N);\\n REP(i, N) cin >> g[i];\\n\\n MinCostFlow<int, int> mcf(2*N+2);\\n int S = 2*N, T = S+1;\\n REP(i, N) {\\n mcf.add_edge(S, i, 1, 0);\\n mcf.add_edge(i+N, T, 1, 0);\\n }\\n int ans = 0;\\n REP(i, N) REP(j, N) {\\n if(g[i][j] == 'o') {\\n ans += e[i][j];\\n mcf.add_edge(i, j+N, 1, -e[i][j]);\\n } else {\\n mcf.add_edge(i, j+N, 1, w[i][j]);\\n }\\n }\\n assert(mcf.build(S, T, N));\\n ans += mcf.get_cost();\\n auto G = mcf.get_graph();\\n vector<tuple<int, int, string>> outputs;\\n REP(i, N) {\\n for(auto& e : G[i]) {\\n if(N <= e.to and e.to < N*2) {\\n int j = e.to - N;\\n // debug(i, j, e.cap, e.cost, g[i][j]);\\n if(g[i][j] == '.' and e.cap == 0) {\\n outputs.emplace_back(i+1, j+1, \\\"write\\\");\\n }\\n if(g[i][j] == 'o' and e.cap == 1) {\\n outputs.emplace_back(i+1, j+1, \\\"erase\\\");\\n }\\n }\\n } \\n }\\n cout << ans << endl;\\n cout << outputs.size() << endl;\\n for(auto [i, j, op] : outputs) {\\n cout << i << ' ' << j << ' ' << op << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4252,\n \"score_of_the_acc\": -0.0414,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2429_5811538\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n#define EPS 0.000000001\\n\\n\\n\\n\\n#define SIZE 405\\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\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col,bool arg_is_write){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tis_write = arg_is_write;\\n\\t}\\n\\tint row,col;\\n\\tbool is_write;\\n};\\n\\nint V; //頂点数\\nvector<Edge> G[SIZE]; //グラフの隣接リスト表現\\nint dist[SIZE]; //最短距離\\nint pre_node[SIZE],pre_edge[SIZE]; //直前の頂点と辺\\n\\nint W[105][105],E[105][105];\\nchar table[105][105];\\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;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&W[i][k]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&E[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tint source = 2*N;\\n\\tint sink = source+1;\\n\\n\\tV = 2*N + 2;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tadd_edge(source,row,1,0);\\n\\t}\\n\\tfor(int col = 0; col < N; col++){\\n\\n\\t\\tadd_edge(N+col,sink,1,0);\\n\\t}\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tfor(int col = 0; col < N; col++){\\n\\t\\t\\tif(table[row][col] == 'o'){\\n\\n\\t\\t\\t\\t//先に消しておく\\n\\t\\t\\t\\tans += E[row][col];\\n\\t\\t\\t\\tadd_edge(row,N+col,1,-E[row][col]); //消さないコスト\\n\\n\\t\\t\\t}else{ //元々白\\n\\n\\t\\t\\t\\tadd_edge(row,N+col,1,W[row][col]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint C = min_cost_flow(source,sink,N);\\n\\n\\t//printf(\\\"ans:%d C:%d\\\\n\\\",ans,C);\\n\\tprintf(\\\"%d\\\\n\\\", ans+C);\\n\\n\\tvector<Info> info;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\t\\tfor(int i = 0; i < G[row].size(); i++){\\n\\n\\t\\t\\tint col = G[row][i].to-N;\\n\\t\\t\\tif(table[row][col] == 'o' && G[row][i].capacity > 0){ //消した\\n\\n\\t\\t\\t\\tinfo.push_back(Info(row+1,col+1,false));\\n\\t\\t\\t}\\n\\t\\t\\tif(table[row][col] == '.' && G[row][i].capacity == 0){ //書いた\\n\\n\\t\\t\\t\\tinfo.push_back(Info(row+1,col+1,true));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",info.size());\\n\\tfor(int i = 0; i < info.size(); i++){\\n\\n\\t\\tprintf(\\\"%d %d \\\",info[i].row,info[i].col);\\n\\t\\tif(info[i].is_write){\\n\\n\\t\\t\\tprintf(\\\"write\\\\n\\\");\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\"erase\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0007,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2429_5761109\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\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()\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 25000000;\\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-8;\\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//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nstruct mcf{\\n struct edge{\\n ll to, cap, cost, rev;\\n };\\n int n;\\n vector<vector<edge>> G;\\n vector<ll> dist,prevv,preve;\\n\\n mcf(int n) : n(n) {\\n G.resize(n);\\n dist.resize(n);\\n prevv.resize(n);\\n preve.resize(n);\\n }\\n\\n void add_edge(ll from, ll to, ll cap, ll cost){\\n G[from].push_back(edge{to, cap, cost, (ll)G[to].size()});\\n G[to].push_back(edge{from, 0, -cost, (ll)G[from].size()-1});\\n }\\n\\n ll flow(ll s, ll t, ll f){\\n ll res = 0;\\n while(f > 0){\\n fill(dist.begin(), dist.end(), linf);\\n dist[s] = 0;\\n bool upd = true;\\n while(upd){\\n upd = false;\\n for(int u=0; u<n; u++){\\n if(dist[u] == linf) continue;\\n for(int i=0; i<G[u].size(); i++){\\n edge &e = G[u][i];\\n if(e.cap > 0 && dist[e.to] > dist[u] + e.cost){\\n dist[e.to] = dist[u] + e.cost;\\n prevv[e.to] = u;\\n preve[e.to] = i;\\n upd = true;\\n }\\n }\\n }\\n }\\n\\n if(dist[t] == linf) return -1;\\n\\n ll d = f;\\n for(int u=t; u!=s; u=prevv[u]){\\n d = min(d, G[prevv[u]][preve[u]].cap);\\n }\\n f -= d;\\n res += d * dist[t];\\n for(int u=t; u!=s; u=prevv[u]){\\n edge &e = G[prevv[u]][preve[u]];\\n e.cap -= d;\\n G[u][e.rev].cap += d;\\n }\\n }\\n return res;\\n }\\n};\\n\\nint main(){\\n int n; cin >> n;\\n vvl w(n,vl(n)), e(n,vl(n));\\n rep(i,n) rep(j,n) cin >> w[i][j];\\n rep(i,n) rep(j,n) cin >> e[i][j];\\n vs s(n); rep(i,n) cin >> s[i];\\n int mn = 0;\\n rep(i,n) rep(j,n) if(s[i][j] == 'o') chmin(mn, -e[i][j]);\\n mcf g(n*2+2);\\n ll ans = 0;\\n int S = n*2, T = n*2+1;\\n rep(i,n){\\n g.add_edge(S,i,1,0);\\n g.add_edge(i+n,T,1,0);\\n }\\n rep(i,n) rep(j,n){\\n if(s[i][j] == '.'){\\n g.add_edge(i,j+n,1,w[i][j]-mn);\\n }else{\\n ans += e[i][j];\\n g.add_edge(i,j+n,1,-e[i][j]-mn);\\n }\\n }\\n ans += g.flow(S,T,n) + mn*n;\\n cout << ans << \\\"\\\\n\\\";\\n vl y,x;\\n vs op;\\n rep(i,n){\\n for(auto e : g.G[i]){\\n if(n <= e.to && e.to < n*2){\\n int j = e.to - n;\\n if(s[i][j] == '.' && e.cap == 0){\\n y.push_back(i+1); x.push_back(j+1);\\n op.push_back(\\\"write\\\");\\n }\\n if(s[i][j] == 'o' && e.cap == 1){\\n y.push_back(i+1); x.push_back(j+1);\\n op.push_back(\\\"erase\\\");\\n }\\n }\\n }\\n }\\n cout << y.size() << \\\"\\\\n\\\";\\n rep(i,y.size()){\\n cout << y[i] << \\\" \\\" << x[i] << \\\" \\\" << op[i] << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4520,\n \"score_of_the_acc\": -0.0575,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2429_5707930\",\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#define SIZE 205\\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\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col,bool arg_is_erase){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tis_erase = arg_is_erase;\\n\\t}\\n\\n\\tint row,col;\\n\\tbool is_erase;\\n};\\n\\nint V; //頂点数\\nvector<Edge> G[SIZE]; //グラフの隣接リスト表現\\nint dist[SIZE]; //最短距離\\nint pre_node[SIZE],pre_edge[SIZE]; //直前の頂点と辺\\nint W[SIZE][SIZE],E[SIZE][SIZE];\\nchar table[SIZE][SIZE];\\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;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint source = 2*N;\\n\\tint sink = source+1;\\n\\tV = sink+1;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&W[i][k]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&E[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tint sum = 0;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tfor(int col = 0; col < N; col++){\\n\\n\\t\\t\\tif(table[row][col] == 'o'){\\n\\n\\t\\t\\t\\tsum += E[row][col]; //消したことにする\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tadd_edge(source,row,1,0);\\n\\t}\\n\\tfor(int col = 0;col < N; col++){\\n\\n\\t\\tadd_edge(col+N,sink,1,0);\\n\\t}\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\t\\tfor(int col = 0; col < N; col++){\\n\\t\\t\\tif(table[row][col] == 'o'){\\n\\n\\t\\t\\t\\tadd_edge(row,col+N,1,-E[row][col]); //消さなかったことにする\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tadd_edge(row,col+N,1,W[row][col]); //新たに書き込むコスト\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tsum += min_cost_flow(source,sink,N);\\n\\n\\tprintf(\\\"%d\\\\n\\\",sum);\\n\\n\\tvector<Info> info;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\t\\tfor(int i = 0; i < G[row].size(); i++){\\n\\t\\t\\tint col = G[row][i].to-N;\\n\\t\\t\\tif(table[row][col] == 'o' && G[row][i].capacity == 1){ //消えたまま\\n\\n\\t\\t\\t\\tinfo.push_back(Info(row,col,true));\\n\\t\\t\\t}\\n\\t\\t\\tif(table[row][col] == '.' && G[row][i].capacity == 0){ //書き込み\\n\\n\\t\\t\\t\\tinfo.push_back(Info(row,col,false));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",info.size());\\n\\n\\tfor(int i = 0; i < info.size(); i++){\\n\\n\\t\\tprintf(\\\"%d %d\\\",info[i].row+1,info[i].col+1);\\n\\t\\tif(info[i].is_erase){\\n\\n\\t\\t\\tprintf(\\\" erase\\\\n\\\");\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\" write\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3660,\n \"score_of_the_acc\": -0.0058,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2429_5705771\",\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 NUM 205\\n\\ntypedef pair<int,int> P; //firstは最短距離、secondは頂点の番号\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col,bool arg_is_del){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t\\tis_del = arg_is_del;\\n\\t}\\n\\tint row,col;\\n\\tbool is_del;\\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 W[NUM][NUM],E[NUM][NUM];\\nchar table[NUM][NUM];\\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;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tint source = 2*N;\\n\\tint sink = source+1;\\n\\tV = sink+1;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&W[i][k]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&E[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tint sum = 0;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t\\tfor(int col = 0; col < N; col++){\\n\\t\\t\\tif(table[row][col] == 'o'){\\n\\n\\t\\t\\t\\tsum += E[row][col]; //先に全ての〇を消す\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\n\\t\\tadd_edge(source,row,1,0);\\n\\t}\\n\\tfor(int col = 0; col < N; col++){\\n\\n\\t\\tadd_edge(col+N,sink,1,0);\\n\\t}\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\t\\tfor(int col = 0; col < N; col++){\\n\\t\\t\\tif(table[row][col] == 'o'){\\n\\n\\t\\t\\t\\tadd_edge(row,col+N,1,-E[row][col]); //元々計上していたコストを消す\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tadd_edge(row,col+N,1,W[row][col]); //新たに書き込むコスト\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tsum += min_cost_flow(source,sink,N);\\n\\n\\tvector<Info> info;\\n\\n\\tfor(int row = 0; row < N; row++){\\n\\t\\tfor(int i = 0; i < G[row].size(); i++){\\n\\t\\t\\tint col = G[row][i].to-N;\\n\\n\\t\\t\\tif(table[row][col] == 'o' && G[row][i].capacity == 1){ //逆辺に流れた\\n\\n\\t\\t\\t\\t//FLOW += E[row][col];\\n\\t\\t\\t\\tinfo.push_back(Info(row,col,true));\\n\\t\\t\\t}\\n\\t\\t\\tif(table[row][col] != 'o' && G[row][i].capacity == 0){ //辺に流れた\\n\\n\\t\\t\\t\\tinfo.push_back(Info(row,col,false));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",sum);\\n\\n\\tprintf(\\\"%lld\\\\n\\\",info.size());\\n\\n\\tfor(int i = 0; i < info.size(); i++){\\n\\n\\t\\tprintf(\\\"%d %d\\\",info[i].row+1,info[i].col+1);\\n\\t\\tif(info[i].is_del){\\n\\n\\t\\t\\tprintf(\\\" erase\\\\n\\\");\\n\\t\\t}else{\\n\\n\\t\\t\\tprintf(\\\" write\\\\n\\\");\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.0043,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2429_5629835\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\n\\n#include <algorithm>\\n#include <utility>\\n#include <vector>\\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\\n} // namespace atcoder\\n\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\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\\n private:\\n int _n;\\n std::vector<edge> _edges;\\n\\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\\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 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 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 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_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} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector W(N, vector(N, 0));\\n vector E(N, vector(N, 0));\\n vector<string> F(N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n cin >> W[i][j];\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n cin >> E[i][j];\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n cin >> F[i];\\n }\\n mcf_graph<int, int> G(2 + N + N * N + N);\\n int S = 0, T = 1;\\n int bef = 0, now = 2;\\n for (int i = 0; i < N; i++) {\\n G.add_edge(bef, now + i, 1, 0);\\n }\\n bef = now;\\n now += N;\\n int maine = now;\\n for (int i = 0; i < N; i++) {\\n int tot = 0;\\n for (int j = 0; j < N; j++) {\\n if (F[i][j] == 'o')\\n tot += E[i][j];\\n }\\n for (int j = 0; j < N; j++) {\\n G.add_edge(bef + i, now + i * N + j, 1, (F[i][j] == 'o' ? tot - E[i][j] : tot + W[i][j]));\\n }\\n }\\n bef = now;\\n now += N * N;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n G.add_edge(bef + i * N + j, now + j, 1, 0);\\n }\\n }\\n bef = now;\\n now += N * N;\\n for (int i = 0; i < N; i++) {\\n G.add_edge(bef + i, T, 1, 0);\\n }\\n cout << G.flow(S, T).second << endl;\\n vector<pair<int, int>> er, wr;\\n for (auto&& e : G.edges()) {\\n if (e.to >= maine && e.to < maine + N * N) {\\n int idx = e.to - maine;\\n int x = idx / N, y = idx % N;\\n if (e.flow == 1 && F[x][y] == '.') {\\n wr.emplace_back(x, y);\\n } else if (e.flow == 0 && F[x][y] == 'o') {\\n er.emplace_back(x, y);\\n }\\n }\\n }\\n cout << wr.size() + er.size() << endl;\\n for (auto&& [x, y] : wr) {\\n cout << x + 1 << \\\" \\\" << y + 1 << \\\" \\\"\\n << \\\"write\\\" << endl;\\n }\\n for (auto&& [x, y] : er) {\\n cout << x + 1 << \\\" \\\" << y + 1 << \\\" \\\"\\n << \\\"erase\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5292,\n \"score_of_the_acc\": -0.1039,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2429_5629826\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\n\\n#include <algorithm>\\n#include <utility>\\n#include <vector>\\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\\n} // namespace atcoder\\n\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\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\\n private:\\n int _n;\\n std::vector<edge> _edges;\\n\\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\\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 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 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 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_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} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector W(N, vector(N, 0));\\n vector E(N, vector(N, 0));\\n vector<string> F(N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n cin >> W[i][j];\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n cin >> E[i][j];\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n cin >> F[i];\\n }\\n mcf_graph<int, int> G(1000000);\\n int S = 0, T = 1;\\n int bef = 0, now = 2;\\n for (int i = 0; i < N; i++) {\\n G.add_edge(bef, now + i, 1, 0);\\n }\\n bef = now;\\n now += N;\\n int maine = now;\\n for (int i = 0; i < N; i++) {\\n int tot = 0;\\n for (int j = 0; j < N; j++) {\\n if (F[i][j] == 'o')\\n tot += E[i][j];\\n }\\n for (int j = 0; j < N; j++) {\\n G.add_edge(bef + i, now + i * N + j, 1, (F[i][j] == 'o' ? tot - E[i][j] : tot + W[i][j]));\\n }\\n }\\n bef = now;\\n now += N * N;\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n G.add_edge(bef + i * N + j, now + j, 1, 0);\\n }\\n }\\n bef = now;\\n now += N * N;\\n for (int i = 0; i < N; i++) {\\n G.add_edge(bef + i, T, 1, 0);\\n }\\n cout << G.flow(S, T).second << endl;\\n vector<pair<int, int>> er, wr;\\n for (auto&& e : G.edges()) {\\n if (e.to >= maine && e.to < maine + N * N) {\\n int idx = e.to - maine;\\n int x = idx / N, y = idx % N;\\n if (e.flow == 1 && F[x][y] == '.') {\\n wr.emplace_back(x, y);\\n } else if (e.flow == 0 && F[x][y] == 'o') {\\n er.emplace_back(x, y);\\n }\\n }\\n }\\n cout << wr.size() + er.size() << endl;\\n for (auto&& [x, y] : wr) {\\n cout << x + 1 << \\\" \\\" << y + 1 << \\\" \\\"\\n << \\\"write\\\" << endl;\\n }\\n for (auto&& [x, y] : er) {\\n cout << x + 1 << \\\" \\\" << y + 1 << \\\" \\\"\\n << \\\"erase\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 20192,\n \"score_of_the_acc\": -1.25,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2429_5346608\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T>\\nclass Edmonds_Karp {\\n T inf = numeric_limits<T> :: max() / 2;\\n class edge {\\n public:\\n int nxt, to;\\n T c, f;\\n };\\n vector<edge> e;\\n vector<T> d;\\n vector<int> head;\\n vector<int> prev;\\n vector<int> pree;\\n vector<int> vis;\\n int cnt;\\n int source;\\n int sink;\\n\\n public:\\n Edmonds_Karp() {}\\n Edmonds_Karp(int N, int M, int _source, int _sink) : source(_source), sink(_sink), head(N + 1), vis(N + 1), d(N + 1), prev(N + 1), pree(N + 1), e(M * 2 + 3) {\\n cnt = 1;\\n }\\n\\n void link(int u, int v, T f, T c) {\\n e[++cnt].nxt = head[u];\\n head[u] = cnt;\\n e[cnt].f = f;\\n e[cnt].to = v;\\n e[cnt].c = c;\\n }\\n void add_edge(int u, int v, T f, T c) {\\n link(u, v, f, c);\\n link(v, u, 0, -c);\\n } \\n bool spfa() {\\n d.assign(d.size(), -1);\\n d[source] = 0;\\n queue<int> q;\\n q.push(source);\\n while(!q.empty()) {\\n int u = q.front();\\n q.pop();\\n vis[u] = 0;\\n for(int i = head[u]; i; i = e[i].nxt) { \\n if(e[i].f && (d[e[i].to] > d[u] + e[i].c || d[e[i].to] == -1)) {\\n pree[e[i].to] = i;\\n prev[e[i].to] = u;\\n d[e[i].to] = d[u] + e[i].c;\\n if(vis[e[i].to] == 0) {\\n q.push(e[i].to);\\n vis[e[i].to] = 1;\\n }\\n }\\n }\\n }\\n return ~d[sink]; \\n }\\n T _Edmonds_Karp() {\\n T cost = 0;\\n T flow = 0;\\n while(spfa()) {\\n int now = sink;\\n T delta = inf;\\n while(now != source) {\\n delta = min(delta, (T)e[pree[now]].f);\\n now = prev[now];\\n }\\n now = sink;\\n while(now != source) {\\n e[pree[now]].f -= delta;\\n e[pree[now] ^ 1].f += delta; \\n now = prev[now];\\n }\\n flow += delta;\\n cost += (T)delta * d[sink];\\n } \\n return cost;\\n }\\n void print(vector<string> S) {\\n vector<tuple<int, int, string>> Ans;\\n int N = S.size();\\n for (int i = 0; i < N; ++i) {\\n for (int j = head[i]; j; j = e[j].nxt) {\\n if (e[j].f == 0) {\\n int k = e[j].to - N;\\n if (0 <= k && k < N) {\\n if (S[i][k] == 'o') {\\n for (int P = 0; P < N; ++P) {\\n if (P != k && S[i][P] == 'o') {\\n Ans.emplace_back(i, P, \\\"erase\\\");\\n }\\n }\\n break;\\n } else {\\n for (int P = 0; P < N; ++P) {\\n if (S[i][P] == 'o') {\\n Ans.emplace_back(i, P, \\\"erase\\\");\\n }\\n }\\n Ans.emplace_back(i, k, \\\"write\\\");\\n }\\n }\\n }\\n }\\n }\\n cout << Ans.size() << '\\\\n';\\n for (auto [X, Y, O] : Ans) {\\n cout << X + 1 << ' ' << Y + 1 << ' ' << O << '\\\\n';\\n }\\n }\\n};\\nint main() {\\n int N;\\n cin >> N;\\n vector<vector<int>> W(N, vector<int> (N));\\n for (int i = 0; i < N; ++i) {\\n for (int j = 0; j < N; ++j) {\\n cin >> W[i][j];\\n }\\n }\\n vector<vector<int>> E(N, vector<int> (N));\\n for (int i = 0; i < N; ++i) {\\n for (int j = 0; j < N; ++j) {\\n cin >> E[i][j];\\n }\\n }\\n vector<string> S(N);\\n for (int i = 0; i < N; ++i) {\\n cin >> S[i];\\n }\\n int source = N + N;\\n int sink = N + N + 1;\\n Edmonds_Karp<int> flow(N + N + 2, N * N * 5, source, sink);\\n for (int i = 0; i < N; ++i) {\\n int V = 0;\\n for (int j = 0; j < N; ++j) {\\n if (S[i][j] == 'o') {\\n V += E[i][j]; \\n }\\n }\\n for (int j = 0; j < N; ++j) {\\n if (S[i][j] == 'o') {\\n flow.add_edge(i, j + N, 1, V - E[i][j]);\\n } else {\\n flow.add_edge(i, j + N, 1, V + W[i][j]); \\n } \\n }\\n }\\n for (int i = 0; i < N; ++i) {\\n flow.add_edge(source, i, 1, 0);\\n }\\n for (int i = 0; i < N; ++i) {\\n flow.add_edge(i + N, sink, 1, 0);\\n }\\n cout << flow._Edmonds_Karp() << '\\\\n';\\n flow.print(S);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5052,\n \"score_of_the_acc\": -0.1173,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2429_5084344\",\n \"code_snippet\": \"#include <iostream>\\n#include <math.h>\\n#include <iomanip>\\n#include <limits>\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n#include <cstring>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\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#define chmax(x,y) x = max(x,y)\\nusing R=double;\\nusing ld = long double;\\nint INF = 1e9;\\nll LINF = 1e18;\\nint mod = 1000000007;\\n//using mint = modint1000000007;\\nint mod2 = 1;\\nusing graph = vector<vector<int>>;\\n#define MV 1000\\nstruct edge{int to,cap,cost,rev;};\\nint V;\\nvector<edge> G[MV];\\nint dist[MV];\\nint prevv[MV],preve[MV];\\nvector<P> circle;\\n\\nvoid add_edge(int from,int to,int cap,int cost){\\n\\t//if(from == 0) printf(\\\"to is %d\\\\n\\\",to);\\n\\tG[from].push_back((edge){to,cap,cost,(int)(G[to].size())});\\n\\tG[to].push_back((edge){from,0,-cost,(int)(G[from].size()-1)});\\n}\\n\\nint min_cost_flow(int s,int t,int f){\\n\\tint res = 0;\\n\\twhile(f > 0){\\n\\t\\tfill(dist,dist+V,INF);\\n\\t\\tdist[s] = 0;\\n\\t\\tbool update = true;\\n\\t\\twhile(update){\\n\\t\\t\\tupdate = false;\\n\\t\\t\\trep(i,V){\\n\\t\\t\\t\\t//cout << i << \\\" \\\" << dist[i] << endl;\\n\\t\\t\\t\\tif(dist[i] == INF) continue;\\n\\t\\t\\t\\tfor(int j=0;j<G[i].size();j++){\\n\\t\\t\\t\\t\\tedge &e = G[i][j];\\n\\t\\t\\t\\t\\tif(e.cap>0&&dist[e.to]>dist[i]+e.cost){\\n\\t\\t\\t\\t\\t\\t//cout << i << \\\" \\\" << e.to << \\\" \\\" << e.cost<<endl;\\n\\t\\t\\t\\t\\t\\tdist[e.to] = dist[i]+e.cost;\\n\\t\\t\\t\\t\\t\\tprevv[e.to] = i;\\n\\t\\t\\t\\t\\t\\tpreve[e.to] = j;\\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\\t\\n\\n\\t\\tif(dist[t]==INF) return -1;\\n\\n\\t\\tint d = f;\\n\\t\\tfor(int v=t;v!=s;v=prevv[v]) d = min(d,G[prevv[v]][preve[v]].cap);\\n\\t\\t//for(int v=t;v!=s;v=prevv[v]) printf(\\\"%d %d %d\\\\n\\\",v,prevv[v],G[prevv[v]][preve[v]].cap);\\n\\t\\tf -= d;\\n\\t\\t// cout <<\\\" \\\" << f << endl;;\\n\\t\\t// int du;cin >> du;\\n\\t\\tres += d*dist[t];\\n\\t\\tfor(int v=t;v!=s;v=prevv[v]) {\\n\\t\\t\\tedge &e = G[prevv[v]][preve[v]];\\n\\t\\t\\te.cap -= d;\\n\\t\\t\\tG[v][e.rev].cap += d;\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nint wtable[105][105];\\nint etable[105][105];\\nint anstable[105][105];\\nint main(){\\n\\t// rep(i,105)rep(j,105) wtable[i][j] = 0;\\n\\t// rep(i,105)rep(j,105) etable[i][j] = 0;\\n\\t// rep(i,105)rep(j,105) anstable[i][j] = 0;\\n\\trep(i,MV) prevv[i] = 0;\\n\\trep(i,MV) preve[i] = 0;\\n\\tint n;cin >> n;\\n\\tV = 2*n+2;\\n\\tint st = 2*n;\\n\\tint go = st+1;\\n\\trep(i,n)rep(j,n) cin >> wtable[i][j];\\n\\trep(i,n)rep(j,n) cin >> etable[i][j];\\n\\trep(i,n) {\\n\\t\\tadd_edge(st,i,1,0);\\n\\t\\tadd_edge(i+n,go,1,0);\\n\\t}\\n\\tint num = 0;\\n\\tint ind = 0;\\n\\trep(i,n)rep(j,n){\\n\\t\\tchar temp;cin >> temp;\\n\\t\\tif(temp == '.') add_edge(i,j+n,1,wtable[i][j]);\\n\\t\\telse {\\n\\t\\t\\tadd_edge(i,j+n,1,-etable[i][j]);\\n\\t\\t\\tnum += etable[i][j];\\n\\t\\t\\tanstable[i][j] = -1;\\n\\t\\t\\tind++;\\n\\t\\t}\\n\\t}\\n\\tnum += min_cost_flow(st,go,n);\\n\\trep(i,n){\\n\\t\\trep(j,G[i].size()){\\n\\t\\t\\tif(G[i][j].cap == 0) circle.emplace_back(i,G[i][j].to);\\n\\t\\t}\\n\\t}\\n\\tfor(P p:circle) {\\n\\t\\t//printf(\\\"%d %d\\\\n\\\",p.first,p.second);\\n\\t\\tanstable[p.first][p.second-n]++;\\n\\t}\\n\\tint temp = 0;\\n\\trep(i,n)rep(j,n) if(anstable[i][j]!= 0) temp++;\\n\\tcout << num << endl;\\n\\tcout << temp << endl;\\n\\n\\trep(i,n)rep(j,n) {\\n\\t\\tif(anstable[i][j]==1) printf(\\\"%d %d write\\\\n\\\",i+1,j+1);\\n\\t\\telse if(anstable[i][j] == -1) printf(\\\"%d %d erase\\\\n\\\",i+1,j+1);\\n\\t}\\n\\t//cout << ind << endl;\\n\\t\\n\\n\\t\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3652,\n \"score_of_the_acc\": -0.0053,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2429_4969897\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n//Minimum Cost Flow O(FE log V)\\n#include<algorithm>\\n#include<utility>\\n#include<vector>\\n#include<queue>\\n#include<limits>\\ntemplate<typename T>\\nstruct MCF{\\n\\tstruct edge{\\n\\t\\tint to,rev,cap;\\n\\t\\tT cost;\\n\\t};\\n\\tvector<vector<edge> >G;\\n\\tvector<T>h,d;\\n\\tvector<int>pv,pe;\\n\\tMCF(int n_=0):G(n_),h(n_,0),d(n_),pv(n_),pe(n_){}\\n\\tint add_edge(int from,int to,int cap,T cost)\\n\\t{\\n\\t\\tG[from].push_back({to,(int)G[to].size(),cap,cost});\\n\\t\\tG[to].push_back({from,(int)G[from].size()-1,0,-cost});\\n\\t\\treturn (int)G[from].size()-1;\\n\\t}\\n\\tT min_cost_flow(int s,int t,int f)//ans or -1\\n\\t{\\n\\t\\tT ret=0;\\n\\t\\twhile(f>0)\\n\\t\\t{\\n\\t\\t\\tpriority_queue<pair<T,int>,vector<pair<T,int> >,greater<pair<T,int> > >P;\\n\\t\\t\\tfill(d.begin(),d.end(),numeric_limits<T>::max());\\n\\t\\t\\td[s]=0;\\n\\t\\t\\tP.push(make_pair(0,s));\\n\\t\\t\\twhile(!P.empty())\\n\\t\\t\\t{\\n\\t\\t\\t\\tpair<T,int>p=P.top();P.pop();\\n\\t\\t\\t\\tif(d[p.second]<p.first)continue;\\n\\t\\t\\t\\tfor(int i=0;i<G[p.second].size();i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tedge&e=G[p.second][i];\\n\\t\\t\\t\\t\\tif(e.cap>0&&d[e.to]>d[p.second]+e.cost+h[p.second]-h[e.to])\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\td[e.to]=d[p.second]+e.cost+h[p.second]-h[e.to];\\n\\t\\t\\t\\t\\t\\tpv[e.to]=p.second;\\n\\t\\t\\t\\t\\t\\tpe[e.to]=i;\\n\\t\\t\\t\\t\\t\\tP.push(make_pair(d[e.to],e.to));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(d[t]==numeric_limits<T>::max())return -1;\\n\\t\\t\\tfor(int u=0;u<G.size();u++)h[u]+=d[u];\\n\\t\\t\\tint d=f;\\n\\t\\t\\tfor(int u=t;u!=s;u=pv[u])d=min(d,G[pv[u]][pe[u]].cap);\\n\\t\\t\\tf-=d;\\n\\t\\t\\tret+=d*h[t];\\n\\t\\t\\tfor(int u=t;u!=s;u=pv[u])\\n\\t\\t\\t{\\n\\t\\t\\t\\tG[pv[u]][pe[u]].cap-=d;\\n\\t\\t\\t\\tG[u][G[pv[u]][pe[u]].rev].cap+=d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n};\\nint N;\\nstring S[100];\\nint W[100][100],F[100][100];\\nint ei[100][100];\\nint O[100];\\nmain()\\n{\\n\\tcin>>N;\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>W[i][j];\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>F[i][j];\\n\\tMCF<int>P(2*N+2);\\n\\tint st=2*N,go=2*N+1;\\n\\tfor(int i=0;i<N;i++)\\n\\t{\\n\\t\\tP.add_edge(N+i,go,1,0);\\n\\t\\tP.add_edge(st,i,1,0);\\n\\t\\tcin>>S[i];\\n\\t\\tint cost=0;\\n\\t\\tfor(int j=0;j<N;j++)if(S[i][j]=='o')cost+=F[i][j];\\n\\t\\tfor(int j=0;j<N;j++)\\n\\t\\t{\\n\\t\\t\\tint now=cost;\\n\\t\\t\\tif(S[i][j]=='o')now-=F[i][j];\\n\\t\\t\\telse now+=W[i][j];\\n\\t\\t\\tei[i][j]=P.add_edge(i,N+j,1,now);\\n\\t\\t}\\n\\t}\\n\\tcout<<P.min_cost_flow(st,go,N)<<endl;\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\\n\\t{\\n\\t\\tif(P.G[i][ei[i][j]].cap==0)O[i]=j;\\n\\t}\\n\\tvector<pair<int,int> >C;\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<N;j++)\\n\\t{\\n\\t\\tif(O[i]==j)\\n\\t\\t{\\n\\t\\t\\tif(S[i][j]=='.')C.push_back(make_pair(i,j));\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tif(S[i][j]=='o')C.push_back(make_pair(i,j));\\n\\t\\t}\\n\\t}\\n\\tcout<<C.size()<<endl;\\n\\tfor(pair<int,int>p:C)\\n\\t{\\n\\t\\tcout<<p.first+1<<\\\" \\\"<<p.second+1<<\\\" \\\";\\n\\t\\tif(S[p.first][p.second]=='o')cout<<\\\"erase\\\"<<endl;\\n\\t\\telse cout<<\\\"write\\\"<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2429_4908799\",\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 < n; ++ i)\\n\\nusing cap_type = int;\\nusing cost_type = int;\\n\\nstruct edge {\\n int to, rev;\\n cap_type cap;\\n cost_type cost;\\n edge(int t, cap_type c, cost_type ct, int r) : to(t), rev(r), cap(c), cost(ct) {}\\n};\\nusing graph = vector<vector<edge>>;\\n\\nvoid add_edge(graph& g, int from, int to, cap_type cap, cost_type cost) {\\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\\ncost_type min_cost_flow(graph& g, int s, int t, cap_type f) {\\n static_assert(!is_floating_point<cap_type>::value, \\\"\\\");\\n using P = pair<cost_type, int>;\\n const auto inf = numeric_limits<cost_type>::max() / 2;\\n cost_type res = 0;\\n vector<cost_type> h(g.size()), dist(g.size());\\n vector<int> prevv(g.size()), preve(g.size());\\n while(f > 0) {\\n priority_queue<P, vector<P>, greater<>> que;\\n fill(std::begin(dist), std::end(dist), inf);\\n dist[s] = 0;\\n que.emplace(dist[s], s);\\n while(!que.empty()) {\\n const auto cur_d = que.top().first;\\n const int v = que.top().second;\\n que.pop();\\n if(dist[v] < cur_d) continue;\\n for(int i = 0; i < (int)g[v].size(); ++i) {\\n auto& 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.emplace(dist[e.to], e.to);\\n }\\n }\\n }\\n if(dist[t] == inf) return -1;\\n for(int v = 0; v < (int)g.size(); ++v) {\\n h[v] += dist[v];\\n }\\n\\n auto 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 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\\nint n;\\n\\nint main() {\\n cin >> n;\\n vector<vector<int>> w(n, vector<int>(n));\\n vector<vector<int>> e(n, vector<int>(n));\\n vector<vector<char>> f(n, vector<char>(n));\\n rep(i, n) {\\n rep(j, n) {\\n cin >> w[i][j];\\n }\\n }\\n rep(i, n) {\\n rep(j, n) {\\n cin >> e[i][j];\\n }\\n }\\n rep(i, n) {\\n rep(j, n) {\\n cin >> f[i][j];\\n }\\n }\\n graph g(2 * n + 2, vector<edge>());\\n int s = 2 * n, t = 2 * n + 1;\\n rep(i, n) {\\n add_edge(g, s, i, 1, 0);\\n add_edge(g, i + n, t, 1, 0);\\n }\\n rep(i, n) {\\n rep(j, n) {\\n int cost = 0;\\n if(f[i][j] == '.') cost += w[i][j] * 2;\\n rep(k, n) {\\n if(k != j and f[i][k] == 'o') cost += e[i][k];\\n }\\n rep(k, n) {\\n if(k != i and f[k][j] == 'o') cost += e[k][j];\\n }\\n // cerr << i << \\\" \\\" << j << \\\" \\\" << cost << endl;\\n add_edge(g, i, j + n, 1, cost);\\n }\\n }\\n int mincost = min_cost_flow(g, s, t, n);\\n cout << mincost / 2 << endl;\\n vector<pair<pair<int, int>, string>> vec;\\n vector<vector<char>> fi(n, vector<char>(n, '.'));\\n rep(i, n) {\\n for(auto e: g[i]) {\\n int j = e.to, cp = e.cap;\\n // cerr << i << \\\" \\\" << j << \\\" \\\" << cp << endl;\\n if(cp == 0) {\\n fi[i][j - n] = 'o';\\n }\\n }\\n }\\n rep(i, n) {\\n rep(j, n) {\\n if(fi[i][j] == 'o' and f[i][j] == '.') {\\n vec.push_back({{i, j}, \\\"write\\\"});\\n }\\n if(fi[i][j] == '.' and f[i][j] == 'o') {\\n vec.push_back({{i, j}, \\\"erase\\\"});\\n }\\n }\\n }\\n int sz = (int)vec.size();\\n cout << sz << endl;\\n rep(i, sz) {\\n cout << vec[i].first.first + 1 << \\\" \\\" << vec[i].first.second + 1 << \\\" \\\" << vec[i].second << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3660,\n \"score_of_the_acc\": -0.0058,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2429_4868525\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1000000000;\\ntemplate <typename Cap, typename Cost>\\nstruct primal_dual{\\n struct edge{\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n edge(int to, int rev, Cap cap, Cost cost): to(to), rev(rev), cap(cap), cost(cost){\\n }\\n };\\n int N;\\n vector<vector<edge>> G;\\n primal_dual(int N): N(N), G(N){\\n }\\n void add_edge(int from, int to, Cap cap, Cost cost){\\n int id1 = G[from].size();\\n int id2 = G[to].size();\\n G[from].push_back(edge(to, id2, cap, cost));\\n G[to].push_back(edge(from, id1, 0, - cost));\\n }\\n Cost min_cost_flow(int s, int t, Cap F){\\n Cap flow = 0;\\n Cost cost = 0;\\n vector<Cost> h(N, 0);\\n while (flow < F){\\n vector<Cap> m(N, INF);\\n vector<Cost> d(N, INF);\\n vector<int> pv(N, -1);\\n vector<int> pe(N, -1);\\n vector<bool> used(N, false);\\n priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> pq;\\n pq.push(make_pair(0, s));\\n d[s] = 0;\\n while (!pq.empty()){\\n int v = pq.top().second;\\n pq.pop();\\n if (!used[v]){\\n used[v] = true;\\n if (v == t){\\n break;\\n }\\n int cnt = G[v].size();\\n for (int i = 0; i < cnt; i++){\\n int w = G[v][i].to;\\n if (!used[w] && G[v][i].cap > 0){\\n Cost tmp = G[v][i].cost - h[w] + h[v];\\n if (d[w] > d[v] + tmp){\\n d[w] = d[v] + tmp;\\n m[w] = min(m[v], G[v][i].cap);\\n pv[w] = v;\\n pe[w] = i;\\n pq.push(make_pair(d[w], w));\\n }\\n }\\n }\\n }\\n }\\n if (!used[t]){\\n break;\\n }\\n for (int i = 0; i < N; i++){\\n if (used[i]){\\n h[i] -= d[t] - d[i];\\n }\\n }\\n Cap c = min(m[t], F - flow);\\n for (int i = t; i != s; i = pv[i]){\\n G[pv[i]][pe[i]].cap -= c;\\n G[i][G[pv[i]][pe[i]].rev].cap += c;\\n }\\n flow += c;\\n cost += c * (- h[s]);\\n }\\n return cost;\\n }\\n};\\nint main(){\\n int n;\\n cin >> n;\\n vector<vector<int>> W(n, vector<int>(n));\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n cin >> W[i][j];\\n }\\n }\\n vector<vector<int>> E(n, vector<int>(n));\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n cin >> E[i][j];\\n }\\n }\\n vector<string> F(n);\\n for (int i = 0; i < n; i++){\\n cin >> F[i];\\n }\\n primal_dual<int, int> G(n * 2 + 2);\\n for (int i = 0; i < n; i++){\\n G.add_edge(0, i + 1, 1, 0);\\n }\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n if (F[i][j] == '.'){\\n G.add_edge(1 + i, 1 + n + j, 1, 1000 + W[i][j]);\\n }\\n if (F[i][j] == 'o'){\\n G.add_edge(1 + i, 1 + n + j, 1, 1000 - E[i][j]);\\n }\\n }\\n }\\n for (int i = 0; i < n; i++){\\n G.add_edge(1 + n + i, 1 + n + n, 1, 0);\\n }\\n int sum = 0;\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n if (F[i][j] == 'o'){\\n sum += E[i][j];\\n }\\n }\\n }\\n cout << sum + G.min_cost_flow(0, n * 2 + 1, n) - 1000 * n << endl;\\n vector<vector<char>> S(n, vector<char>(n, '.'));\\n for (int i = 1; i <= n; i++){\\n for (auto e : G.G[i]){\\n if (e.to > 0 && e.cap == 0){\\n S[i - 1][e.to - n - 1] = 'o';\\n }\\n }\\n }\\n vector<tuple<int, int, string>> op;\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < n; j++){\\n if (S[i][j] == 'o' && F[i][j] == '.'){\\n op.push_back(make_tuple(i, j, \\\"write\\\"));\\n }\\n if (S[i][j] == '.' && F[i][j] == 'o'){\\n op.push_back(make_tuple(i, j, \\\"erase\\\"));\\n }\\n }\\n }\\n int m = op.size();\\n cout << m << endl;\\n for (int i = 0; i < m; i++){\\n cout << get<0>(op[i]) + 1 << ' ' << get<1>(op[i]) + 1 << ' ' << get<2>(op[i]) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.001,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2429_4815013\",\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=205;\\nconst ll INF=1<<30;\\ntypedef pair<int,int> P;\\n\\nstruct edge{int to,cap,cost,rev;};\\n\\nint V;\\nvector<edge> G[MAX];\\nint h[MAX];\\nint dist[MAX];\\nint prevv[MAX],preve[MAX];\\n\\nvoid add_edge(int from,int to,int cap,int cost){\\n G[from].push_back((edge){to,cap,cost,int(G[to].size())});\\n G[to].push_back((edge){from,0,-cost,int(G[from].size()-1)});\\n}\\n\\nint min_cost_flow(int s,int t,int f){\\n int res=0;\\n fill(h,h+V,0);\\n \\n while(f>0){\\n priority_queue<P,vector<P>,greater<P>> que;\\n fill(dist,dist+V,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<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 \\n if(dist[t]==INF){\\n return -1;\\n }\\n for(int v=0;v<V;v++){\\n h[v]+=dist[v];\\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*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}//sからtへの流量fの最小費用流、流せない場合は-1\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int N;cin>>N;\\n vector<vector<int>> A(N,vector<int>(N)),B(N,vector<int>(N));\\n for(int i=0;i<N;i++) for(int j=0;j<N;j++) cin>>A[i][j];\\n for(int i=0;i<N;i++) for(int j=0;j<N;j++) cin>>B[i][j];\\n vector<string> S(N);\\n for(int i=0;i<N;i++) cin>>S[i];\\n \\n V=2*N+2;\\n \\n for(int i=0;i<N;i++){\\n for(int j=0;j<N;j++){\\n int cost=0;\\n \\n for(int k=0;k<N;k++){\\n if(j==k){\\n if(S[i][k]=='.') cost+=A[i][k];\\n }else{\\n if(S[i][k]=='o') cost+=B[i][k];\\n }\\n }\\n \\n add_edge(i,N+j,1,cost);\\n }\\n add_edge(2*N,i,1,0);\\n add_edge(N+i,2*N+1,1,0);\\n }\\n \\n int x=min_cost_flow(2*N,2*N+1,N);\\n \\n vector<pair<int,int>> C,D;\\n \\n for(int i=0;i<N;i++){\\n for(auto j:G[i]){\\n if(j.to>=N&&j.cap==0){\\n for(int k=0;k<N;k++){\\n if(j.to-N==k){\\n if(S[i][k]=='.') C.push_back(mp(i+1,k+1));\\n }else{\\n if(S[i][k]=='o') D.push_back(mp(i+1,k+1));\\n }\\n }\\n }\\n }\\n }\\n \\n cout<<x<<endl;\\n \\n cout<<si(C)+si(D)<<endl;\\n \\n for(auto a:C) cout<<a.fi<<\\\" \\\"<<a.se<<\\\" \\\"<<\\\"write\\\"<<endl;\\n for(auto a:D) cout<<a.fi<<\\\" \\\"<<a.se<<\\\" \\\"<<\\\"erase\\\"<<endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.0041,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":1390,"cells":{"group_id":{"kind":"string","value":"aoj_2430_cpp"},"problem_description":{"kind":"string","value":"最長増加列問題\n時は過ぎて太郎君は高校生になりました。\n大学生だったお兄さんの影響も受け、コンピューターサイエンスに興味を持ち始めました。\n\n太郎君はコンピューターサイエンスの教科書を読み進め、「最長増加部分列問題」という有名問題があることを知りました。太郎君はこの問題のことを理解しましたが、自分でも類似問題が作れないものかと気になりました。\n\nそこで太郎君は試行錯誤の結果に次のような問題を作りました。\nn\n個の整数で構成される数列Aがある\nm-1\n個の区切りを入れて、数列Aを\nm\n個の数列に分解する。なお、分解後のそれぞれの数列は1つ以上の数を必ず含まなければならない。\nこの\nm\n個それぞれの数列内の整数をすべて足し合わせた結果出来上がる\nm\n個の数を、元の数列の順に配置すると厳密な増加列になっている(つまり、出来上がる数列は\nB\ni\n< B\ni+1\nをみたす)ようにしたい。\n目標は最終的にできる数列\nB\nの長さ\nm\nを最大化することである。\n例えば、数列\nA\nが{5,-4,10,-3,8}の場合を考えてみる。\n区切りの位置を表す数列\nC\nを用意し、\nC={2,4}\nとする。\nこのとき、数列\nA\nは(5,-4),(10,-3),(8)の部分に分かれ、これらの内部を足し合わせるとそれぞれ1,7,8となり、出来上がる数列\nB\nは{1,7,8}となる。\n太郎君はこの問題について\"最長増加列問題\"と名付け、これを解くアルゴリズムも考えました。\nそして社会人になったあなたにチェックをしてほしいと連絡をしました。\n\nあなたの仕事は、成長した太郎君の作った問題を解くプログラムを作ることです。\nチェックするのが仕事なので、\nm-1\n個の区切りの位置も出力します。\nなお、最適な\nm\nに対してこのような区切り方が複数考えられる場合もありますが、この\nm\nが正しく出力されていれば、考えられるもののうち一つを出力すればよいです。\nInput\n改行区切りで\nn+1\n個の整数が与えられる。\nn\nA\n1\nA\n2\n...\nA\nn\nn\nは与えられる数列\nA\nの長さを表す\nA\ni\nは数列\nA\nのi番目の要素を表す。\nConstraints\n1≤n≤4000\n|Ai|≤ 10\n8\n整数\nk\nに対して\n|k|\nは\nk\nの絶対値を表す\nOutput\nm\nC\n1\nC\n2\n..\nC\nm-1\n1行目は一つの整数\nm\nを出力する。\nm\nは最終的にできる数列\nB\nの長さを表す。\n2行目は\nm-1\n個の整数\nC\ni\nを空白区切りで出力する。\nC\ni\nは、数列\nA\nを\nm\n個の部分に適切に区切った時の\ni\n番目の区切り場所を表す。\n区切り場所の定義は図を参照せよ。なお、\n1≤C\ni\n<n\nを満たす。\n2行目の\nm-1\n個の整数列Cは昇順に並んでいなければならないしたがって、\ni < j\nならば\nC\ni\n< C\nj\nが成立する。\nm=1\nの場合2行目は空行になる。\n数列\nC\nに従って数列\nA\nから数列\nB\nを生成したとき、数列\nB\nが増加列になっていないとき(すなわち\nB\ni\n≥B\ni+1\nとなる\ni(1≤i<m)\nが存在するとき)、WrongAnswerとなる\nSample Input 1\n3\n1\n2\n4\nOutput for the Sample Input 1\n3\n1 2\nもともと増加列なので、すべての場所に区切りを入れればよい\nSample Input 2\n3\n2\n2\n2\nOutput for the Sample Input 2\n2\n1\n2 2 2は増加列でないので、3つに分割することはできない\nSample Input 3\n3\n4\n2\n1\nOutput for the Sample Input 3\n1\n(空行)\nどう分割しても増加列にはならないため、分割をしない"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2430_8323868","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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 rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\n\nTT void print(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\n' : ' ');\n if (n == 0) cout << '\\n';\n}\n\nTT void printn(vector<T> v, T x = 0) {\n int n = sz(v);\n rep(i, n) cout << v[i] + x << '\\n';\n}\n\nTT void rearrange(vector<T> &v) {\n sort(all(v));\n v.erase(unique(all(v)));\n}\n\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\n\nconst ll INF = (1LL << 60) - 1;\n\nstruct io_setup {\n io_setup() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main() {\n int N;\n cin >> N;\n\n vector<ll> a(N);\n rep(i, N) cin >> a[i];\n\n vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, INF));\n vector<vector<int>> pre(N + 1, vector<int>(N + 1, -1));\n dp[0][0] = -INF;\n\n rep(i, N) {\n per(j, N) chmin(dp[i][j], dp[i][j + 1]);\n ll sum = 0;\n rep2(j, i, N) {\n sum += a[j];\n int t = lb(dp[i], sum);\n if (t > 0 && chmin(dp[j + 1][t], sum)) pre[j + 1][t] = i;\n }\n }\n // rep(i, N + 1) print(dp[i]);\n\n int M = lb(dp[N], INF) - 1;\n\n cout << M << '\\n';\n int p = N;\n vector<int> ans;\n\n rep(i, M - 1) {\n int q = pre[p][M - i];\n ans.eb(q);\n p = q;\n }\n reverse(all(ans));\n\n print(ans);\n}","accuracy":1,"time_ms":160,"memory_kb":191044,"score_of_the_acc":-0.9935,"final_rank":7},{"submission_id":"aoj_2430_7223235","code_snippet":"#include \"bits/stdc++.h\"\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#define REP(i, n) for(int i = 0;i < (n);i++)\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\nconst int mod=1000000007;\nconst llint inf=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-10;\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool chmax(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>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\n\nint main(void){\n\tint n,i,j;cin>>n;\n\tvector<llint>a(n);\n\tvector<llint>wa(n+1);\n\tfor(i=0;i<n;i++){\n\t\tcin>>a[i];\n\t\twa[i+1]=wa[i]+a[i];\n\t}\n\tint kaz=0;\n\tvector<multiset<pair<llint,int>>> dp(n+1);\n\tdp[0].ins(mp(-inf,0LL));\n\tint ans=0;\n\tstatic int fukugen[4001][4001]={};\n\tfor(i=0;i<n;i++){\n\t\tfor(j=kaz;j>=0;j--){\n\t\t\tauto itr=dp[j].lower_bound(mp(wa[i+1],-999));\n\t\t\tif(itr==dp[j].begin()){continue;}\n\t\t\titr--;\n\t\t\tllint Bnum=wa[i+1] - wa[itr->sec];\n\t\t\tfukugen[j+1][i+1]=itr->sec;\n\t\t\tauto jtr=dp[j+1].ins(mp(wa[i+1]+Bnum,i+1));\n\t\t\t\n\t\t\tif(j==kaz){kaz++;}\n\t\t\tif(i==n-1){chmax(ans,j+1);}\n\t\t\tif(jtr!=dp[j+1].begin() && wa[prev(jtr)->sec] >= wa[jtr->sec]){\n\t\t\t\tdp[j+1].erase(jtr);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\twhile(next(jtr)!=dp[j+1].end() && wa[jtr->sec] >= wa[next(jtr)->sec]){\n\t\t\t\tdp[j+1].erase(next(jtr));\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n\tvector<int>kugiri;\n\tint bas=n;\n\tfor(j=ans;j>1;j--){\n\t\tbas=fukugen[j][bas];\n\t\tkugiri.pub(bas);\n\t}\n\tREV(kugiri);\n\tfor(auto it:kugiri){cout<<it<<\" \";}\n\tcout<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":630,"memory_kb":160772,"score_of_the_acc":-0.9657,"final_rank":6},{"submission_id":"aoj_2430_7223230","code_snippet":"#include \"bits/stdc++.h\"\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#define REP(i, n) for(int i = 0;i < (n);i++)\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\nconst int mod=1000000007;\nconst llint inf=2.19e15+1;\nconst long double pai=3.141592653589793238462643383279502884197;\nconst long double eps=1e-10;\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\ntemplate <class T,class U>bool chmax(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>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\n\nint main(void){\n\tint n,i,j;cin>>n;\n\tvector<llint>a(n);\n\tvector<llint>wa(n+1);\n\tfor(i=0;i<n;i++){\n\t\tcin>>a[i];\n\t\twa[i+1]=wa[i]+a[i];\n\t}\n\tint kaz=0;\n\tvector<multiset<pair<llint,int>>> dp(n+1);\n\tdp[0].ins(mp(-inf,0LL));\n\tint ans=0;\n\tstatic int fukugen[4001][4001]={};\n\tfor(i=0;i<n;i++){\n\t\tfor(j=kaz;j>=0;j--){\n\t\t\tauto itr=dp[j].lower_bound(mp(wa[i+1],-999));\n\t\t\tif(itr==dp[j].begin()){continue;}\n\t\t\titr--;\n\t\t\tllint Bnum=wa[i+1] - wa[itr->sec];\n\t\t\tfukugen[j+1][i+1]=itr->sec;\n\t\t\tauto jtr=dp[j+1].ins(mp(wa[i+1]+Bnum,i+1));\n\t\t\tif(jtr!=dp[j+1].begin() && wa[prev(jtr)->sec] >= wa[jtr->sec]){\n\t\t\t\tdp[j+1].erase(jtr);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\twhile(next(jtr)!=dp[j+1].end() && wa[jtr->sec] >= wa[next(jtr)->sec]){\n\t\t\t\tdp[j+1].erase(next(jtr));\n\t\t\t}\n\t\t\tif(j==kaz){kaz++;}\n\t\t\tif(i==n-1){chmax(ans,j+1);}\n\t\t}\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n\tvector<int>kugiri;\n\tint bas=n;\n\tfor(j=ans;j>1;j--){\n\t\tbas=fukugen[j][bas];\n\t\tkugiri.pub(bas);\n\t}\n\tREV(kugiri);\n\tfor(auto it:kugiri){cout<<it<<\" \";}\n\tcout<<endl;\n\treturn 0;\n}","accuracy":0.4666666666666667,"time_ms":660,"memory_kb":160552,"score_of_the_acc":-0.9732,"final_rank":15},{"submission_id":"aoj_2430_7209247","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint inf = 1001001001;\n\nint dp[4040][4040],res[4040],mx[4040];\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++) {\n cin >> A[i];\n }\n for(int i = 0; i <= n; i++) {\n for(int j = i; j <= n; j++) {\n dp[i][j] = -inf;\n }\n res[i] = -inf;\n }\n res[0] = 0;\n vector<pair<long long,pair<int,int>>>tmp;\n for(int i = 0; i < n; i++) {\n long long sum = 0;\n for(int j = i; j < n; j++) {\n sum += A[j];\n tmp.push_back({sum,{-j,i}});\n }\n }\n sort(tmp.begin(),tmp.end());\n for(int i = 0; i < tmp.size(); i++) {\n int a = tmp[i].second.second,b = -tmp[i].second.first;\n dp[a][b] = res[a]+1;\n if(res[b+1] < dp[a][b]) {\n res[b+1] = dp[a][b];\n mx[b+1] = a;\n }\n }\n vector<int>ans;\n int now = n;\n while(now) {\n if(mx[now]) ans.push_back(mx[now]);\n now = mx[now];\n }\n cout << res[n] << endl;\n reverse(ans.begin(),ans.end());\n for(int i = 0; i < ans.size(); i++) {\n cout << ans[i] << ((i+1 == ans.size())?\"\\n\":\" \");\n }\n}","accuracy":1,"time_ms":640,"memory_kb":199728,"score_of_the_acc":-1.1792,"final_rank":10},{"submission_id":"aoj_2430_7209243","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint inf = 1001001001;\n\nint dp[4040][4040],res[4040],mx[4040];\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++) {\n cin >> A[i];\n }\n for(int i = 0; i <= n; i++) {\n for(int j = i; j <= n; j++) {\n dp[i][j] = -inf;\n }\n res[i] = -inf;\n }\n res[0] = 0;\n vector<array<int,3>>tmp;\n for(int i = 0; i < n; i++) {\n int sum = 0;\n for(int j = i; j < n; j++) {\n sum += A[j];\n tmp.push_back({sum,-j,i});\n }\n }\n sort(tmp.begin(),tmp.end());\n for(int i = 0; i < tmp.size(); i++) {\n int a = tmp[i][2],b = -tmp[i][1];\n dp[a][b] = res[a]+1;\n if(res[b+1] < dp[a][b]) {\n res[b+1] = dp[a][b];\n mx[b+1] = a;\n }\n }\n vector<int>ans;\n int now = n;\n while(now) {\n if(mx[now]) ans.push_back(mx[now]);\n now = mx[now];\n }\n cout << res[n] << endl;\n reverse(ans.begin(),ans.end());\n for(int i = 0; i < ans.size(); i++) {\n cout << ans[i] << ((i+1 == ans.size())?\"\\n\":\" \");\n }\n}","accuracy":0.6666666666666666,"time_ms":790,"memory_kb":167012,"score_of_the_acc":-1.0457,"final_rank":14},{"submission_id":"aoj_2430_6813539","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\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 rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\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__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\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__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\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}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\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}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\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 UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return 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 scan(a), scan(b), scan(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 res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nnamespace segtree_impl {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while(!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace segtree_impl\n\nnamespace segtree_impl {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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--) { update(i); }\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S operator[](int k) const { return get(k); }\n\n S prod(int l, int r) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(r > _n) r = _n;\n if(l > r) return e();\n#endif\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(l > _n) l = _n;\n#endif\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\n#ifdef ONLINE_JUDGE\n if(r < 0) r = 0;\n if(r > _n) r = _n;\n#endif\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\n os << \"{\";\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \"\" : \", \");\n return os << \"}\";\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\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\ntemplate <typename T> T min_e() { return inf<T>; }\ntemplate <typename T> T max_e() { return -inf<T>; }\ntemplate <typename T> T plus_e() { return 0; }\n\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\n\n} // namespace segtree_impl\nusing segtree_impl::RmT;\nusing segtree_impl::RMT;\nusing segtree_impl::RST;\nusing segtree_impl::segtree;\n\nint main() {\n INT(n);\n VEC(ll, a, n);\n auto r = RUI(a);\n vector<tuple<ll, int, int>> v;\n vi id = iota(n + 1);\n sort(all(id), [&](int x, int y) { return r[x] == r[y] ? x > y : r[x] < r[y]; });\n\n per(i, n) {\n decltype(v) nv(si(v) + n - i), w;\n fore(j, id) {\n if(i < j) w.eb(r[j] - r[i], i, j);\n }\n merge(all(v), all(w), begin(nv));\n swap(v, nv);\n }\n\n vpi dp(n + 1, pii(-inf<int>, 0));\n\n dp[0] = pii(0, 0);\n fore(_, l, r, v) {\n if(dp[l].fi < 0) continue;\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\n }\n OUT(dp[n].fi);\n vi ans;\n int now = n;\n while(now) {\n now = dp[now].se;\n if(now) ans.eb(now);\n }\n REV(ans);\n OUT(ans);\n}","accuracy":0.03333333333333333,"time_ms":630,"memory_kb":18948,"score_of_the_acc":-0.199,"final_rank":19},{"submission_id":"aoj_2430_6813538","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\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 rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\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__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\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__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\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}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\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}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\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 UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return 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 scan(a), scan(b), scan(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 res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nnamespace segtree_impl {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while(!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace segtree_impl\n\nnamespace segtree_impl {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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--) { update(i); }\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S operator[](int k) const { return get(k); }\n\n S prod(int l, int r) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(r > _n) r = _n;\n if(l > r) return e();\n#endif\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(l > _n) l = _n;\n#endif\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\n#ifdef ONLINE_JUDGE\n if(r < 0) r = 0;\n if(r > _n) r = _n;\n#endif\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\n os << \"{\";\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \"\" : \", \");\n return os << \"}\";\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\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\ntemplate <typename T> T min_e() { return inf<T>; }\ntemplate <typename T> T max_e() { return -inf<T>; }\ntemplate <typename T> T plus_e() { return 0; }\n\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\n\n} // namespace segtree_impl\nusing segtree_impl::RmT;\nusing segtree_impl::RMT;\nusing segtree_impl::RST;\nusing segtree_impl::segtree;\n\nint main() {\n INT(n);\n VEC(ll, a, n);\n auto r = RUI(a);\n vector<tuple<ll, int, int>> v;\n vi id = iota(n + 1);\n sort(all(id), [&](int x, int y) { return r[x] == r[y] ? x > y : r[x] < r[y]; });\n\n rep(i, n) {\n decltype(v) nv(si(v) + n - i), w;\n fore(j, id) {\n if(i < j) w.eb(r[j] - r[i], i, j);\n }\n merge(all(v), all(w), begin(nv));\n swap(v, nv);\n }\n vpi dp(n + 1, pii(-inf<int>, 0));\n\n dp[0] = pii(0, 0);\n fore(_, l, r, v) {\n if(dp[l].fi < 0) continue;\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\n }\n OUT(dp[n].fi);\n vi ans;\n int now = n;\n while(now) {\n now = dp[now].se;\n if(now) ans.eb(now);\n }\n REV(ans);\n OUT(ans);\n}","accuracy":0.03333333333333333,"time_ms":1230,"memory_kb":26600,"score_of_the_acc":-0.4138,"final_rank":20},{"submission_id":"aoj_2430_6813507","code_snippet":"#pragma region Macros\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\n// #pragma comment(linker, \"/stack:200000000\")\n#include <stdc++.h>\n#pragma GCC optimize(\"O3\")\n#else\n#pragma GCC optimize(\"Ofast\")\n// #pragma GCC optimize(\"unroll-loops\")\n// #pragma GCC target(\"popcnt\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\")\n// #pragma GCC target(\"avx2\")\n// #include <bits/stdc++.h>\n#include <bits/stdc++.h>\n#endif\n#include <cstdint>\n#include <immintrin.h>\n#include <variant>\n\n#ifdef noimi\n#define oj_local(a, b) b\n#else\n#define oj_local(a, b) a\n#endif\n\n#define LOCAL if(oj_local(0, 1))\n#define OJ if(oj_local(1, 0))\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long int;\nusing i128 = __int128_t;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing ld = long double;\ntemplate <typename T> using vc = vector<T>;\ntemplate <typename T> using vvc = vector<vc<T>>;\ntemplate <typename T> using vvvc = vector<vvc<T>>;\nusing vi = vc<int>;\nusing vl = vc<ll>;\nusing vpi = vc<pii>;\nusing vpl = vc<pll>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <typename T> int si(const T &x) { return x.size(); }\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\nvi iota(int n) {\n vi a(n);\n return iota(a.begin(), a.end(), 0), a;\n}\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(res.begin(), res.end(), 0);\n sort(res.begin(), res.end(), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n\n// macros\n#define overload5(a, b, c, d, e, name, ...) name\n#define overload4(a, b, c, d, name, ...) name\n#define endl '\\n'\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\n#define fore0(a) rep(a.size())\n#define fore1(i, a) for(auto &&i : a)\n#define fore2(a, b, v) for(auto &&[a, b] : v)\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\n#define fi first\n#define se second\n#define pb push_back\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define drop(s) cout << #s << endl, exit(0)\n#define si(c) (int)(c).size()\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 rng(v, l, r) v.begin() + l, v.begin() + r\n#define all(c) begin(c), end(c)\n#define rall(c) rbegin(c), rend(c)\n#define SORT(v) sort(all(v))\n#define REV(v) reverse(all(v))\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\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__))))\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\n\nnamespace yesno_impl {\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nconst string firstsecond[2] = {\"second\", \"first\"};\nconst string FirstSecond[2] = {\"Second\", \"First\"};\nconst string possiblestr[2] = {\"impossible\", \"possible\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\nvoid no(bool t = 1) { yes(!t); }\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\n}; // namespace yesno_impl\nusing namespace yesno_impl;\n\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__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define VEC2(type, name1, name2, size) \\\n vector<type> name1(size), name2(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n vector<type> name1(size), name2(size), name3(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\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}\n\ntemplate <typename T, typename S> T ceil(T x, S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\n\ntemplate <typename T, typename S> T floor(T x, S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\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}\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\n T res = 1;\n x %= mod;\n for(; n; n >>= 1, x = x * x % mod)\n if(n & 1) res = res * x % mod;\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 UNIQUE(y);\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\ntemplate <class S> void fold_in(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto e : a) v.emplace_back(e);\n fold_in(v, tail...);\n}\ntemplate <class S> void renumber(vector<S> &v) {}\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\n for(auto &&e : a) e = lb(v, e);\n renumber(v, tail...);\n}\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\n vector<S> v;\n fold_in(v, head, args...);\n sort(all(v)), v.erase(unique(all(v)), v.end());\n renumber(v, head, args...);\n return v;\n}\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\n vector<T> res(v.size() + 1);\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\n return res;\n}\n// 反時計周りに 90 度回転\ntemplate <typename T> void rot(vector<vector<T>> &v) {\n if(empty(v)) return;\n int n = v.size(), m = v[0].size();\n vector res(m, vector<T>(n));\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\n v.swap(res);\n}\n// x in [l, r)\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\n\n// 便利関数\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\n// l + ... + r\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\nll max(int x, ll y) { return max((ll)x, y); }\nll max(ll x, int y) { return max(x, (ll)y); }\nint min(int x, ll y) { return min((ll)x, y); }\nint min(ll x, int y) { return min(x, (ll)y); }\n// bit 演算系\nll pow2(int i) { return 1LL << i; }\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\n// int allbit(int n) { return (1 << n) - 1; }\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\n// int popcount(signed t) { return __builtin_popcount(t); }\n// int popcount(ll t) { return __builtin_popcountll(t); }\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\nstatic inline uint64_t popcount64(uint64_t x) {\n uint64_t m1 = 0x5555555555555555ll;\n uint64_t m2 = 0x3333333333333333ll;\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\n uint64_t h01 = 0x0101010101010101ll;\n\n x -= (x >> 1) & m1;\n x = (x & m2) + ((x >> 2) & m2);\n x = (x + (x >> 4)) & m4;\n\n return (x * h01) >> 56;\n}\nbool ispow2(int i) { return i && (i & -i) == i; }\n\nll rnd(ll l, ll r) { //[l, r)\n#ifdef noimi\n static mt19937_64 gen;\n#else\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\n#endif\n return uniform_int_distribution<ll>(l, r - 1)(gen);\n}\nll rnd(ll n) { return rnd(0, n); }\n\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\n\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return res;\n}\nGraph getTreeFromPar(int n, int margin = 1) {\n Graph res(n);\n for(int i = 1; i < n; i++) {\n int a;\n cin >> a;\n res[a - margin].emplace_back(i);\n }\n return 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 scan(a), scan(b), scan(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 res;\n}\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\n\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\n\nistream &operator>>(istream &is, i128 &v) {\n string s;\n is >> s;\n v = 0;\n for(int i = 0; i < (int)s.size(); i++) {\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\n }\n if(s[0] == '-') { v *= -1; }\n return is;\n}\n\nostream &operator<<(ostream &os, const i128 &v) {\n if(v == 0) { return (os << \"0\"); }\n i128 num = v;\n if(v < 0) {\n os << '-';\n num = -num;\n }\n string s;\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\n reverse(s.begin(), s.end());\n return (os << s);\n}\nnamespace aux {\ntemplate <typename T, unsigned N, unsigned L> struct tp {\n static void output(std::ostream &os, const T &v) {\n os << std::get<N>(v) << (&os == &cerr ? \", \" : \" \");\n tp<T, N + 1, L>::output(os, v);\n }\n};\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\n};\n} // namespace aux\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\n if(&os == &cerr) { os << '('; }\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\n if(&os == &cerr) { os << ')'; }\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n if(&os == &cerr) { return os << \"(\" << p.first << \", \" << p.second << \")\"; }\n return os << p.first << \" \" << p.second;\n}\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\n bool f = true;\n if(&os == &cerr) os << \"[\";\n for(auto &y : x) {\n if(&os == &cerr)\n os << (f ? \"\" : \", \") << y;\n else\n os << (f ? \"\" : \" \") << y;\n f = false;\n }\n if(&os == &cerr) os << \"]\";\n return os;\n}\n\n#ifdef noimi\n#undef endl\nvoid debug() { cerr << endl; }\nvoid debug(bool) { cerr << endl; }\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\n if(!is_front) cerr << \", \";\n cerr << head;\n debug(false, tail...);\n}\n\n#define dump(args...) \\\n { \\\n vector<string> _debug = _split(#args, ','); \\\n err(true, begin(_debug), args); \\\n }\n\nvector<string> _split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while(getline(ss, x, c)) {\n if(empty(v))\n v.eb(x);\n else {\n bool flag = false;\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\n }\n if(flag)\n v.back() += \",\" + x;\n else\n v.eb(x);\n }\n }\n return move(v);\n}\n\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\n if(!is_front) cerr << \", \";\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \" = \" << a, err(false, ++it, args...);\n}\n\n// #define dump(...) cerr << #__VA_ARGS__ << \" : \", debug(true, __VA_ARGS__)\n#else\n#define dump(...) static_cast<void>(0)\n#define dbg(...) static_cast<void>(0)\n#endif\nvoid OUT() { cout << endl; }\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\n cout << head;\n if(sizeof...(tail)) cout << ' ';\n OUT(tail...);\n}\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\n\ntemplate <class F> struct REC {\n F f;\n REC(F &&f_) : f(std::forward<F>(f_)) {}\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\n};\n\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\n vector<pair<S, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\nvector<pair<char, int>> runLength(const string &v) {\n vector<pair<char, int>> res;\n for(auto &e : v) {\n if(res.empty() or res.back().fi != e)\n res.eb(e, 1);\n else\n res.back().se++;\n }\n return res;\n}\n\nint toint(const char &c, const char start = 'a') { return c - start; }\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\ntemplate <typename T> auto toint(const T &v, const string &start) {\n vector<decltype(toint(v[0]))> ret;\n ret.reserve(v.size());\n for(auto &&e : v) ret.emplace_back(toint(e, start));\n return ret;\n}\n// a -> 0, A -> 26\ntemplate <typename T> auto alphabets_to_int(const T &s) {\n vector<decltype(alphabets_to_int(s[0]))> res;\n res.reserve(s.size());\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\n return res;\n}\n\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\n while(abs(ok - ng) > 1) {\n T mid = ok + ng >> 1;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\n while(iter--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(11);\n }\n} setup_io;\n\n#pragma endregion\n\nnamespace segtree_impl {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while(!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace segtree_impl\n\nnamespace segtree_impl {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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--) { update(i); }\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S operator[](int k) const { return get(k); }\n\n S prod(int l, int r) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(r > _n) r = _n;\n if(l > r) return e();\n#endif\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(l > _n) l = _n;\n#endif\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\n#ifdef ONLINE_JUDGE\n if(r < 0) r = 0;\n if(r > _n) r = _n;\n#endif\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\n os << \"{\";\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \"\" : \", \");\n return os << \"}\";\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\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\ntemplate <typename T> T min_e() { return inf<T>; }\ntemplate <typename T> T max_e() { return -inf<T>; }\ntemplate <typename T> T plus_e() { return 0; }\n\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\n\n} // namespace segtree_impl\nusing segtree_impl::RmT;\nusing segtree_impl::RMT;\nusing segtree_impl::RST;\nusing segtree_impl::segtree;\n\nint main() {\n INT(n);\n VEC(ll, a, n);\n auto r = RUI(a);\n vector<tuple<ll, int, int>> v;\n rep(i, n) rep(j, i + 1, n + 1) v.eb(r[j] - r[i], i, j);\n sort(all(v), [](auto x, auto y) {\n auto [a, i, j] = x;\n auto [b, ii, jj] = y;\n if(a != b) return a < b;\n return i > ii;\n });\n // dump(v);\n vpi dp(n + 1, pii(-inf<int>, 0));\n\n dp[0] = pii(0, 0);\n fore(_, l, r, v) {\n if(dp[l].fi < 0) continue;\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\n }\n OUT(dp[n].fi);\n vi ans;\n int now = n;\n while(now) {\n now = dp[now].se;\n if(now) ans.eb(now);\n }\n REV(ans);\n OUT(ans);\n}","accuracy":1,"time_ms":660,"memory_kb":136008,"score_of_the_acc":-0.8405,"final_rank":5},{"submission_id":"aoj_2430_6126552","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>\n#include<numeric>\n#include<functional>\n#include<unordered_map>\n#include<unordered_set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,LL> LP;\nconst LL INF=1LL<<60;\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}\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++){\n if(i)os<<\" \";\n os<<v1[i];\n }\n return os;\n}\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\n os<<p.first<<\" \"<<p.second;\n return os;\n}\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\n int n=v1.size();\n for(int i=0;i<n;i++)is>>v1[i];\n return is;\n}\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\n is>>p.first>>p.second;\n return is;\n}\n\nnamespace sol{\n\n void solve(){\n int n,m;\n int i,j,k;\n LL a,b,c;\n cin>>n;\n vector<LL> v1(n),v2(n+1);\n vector<vector<LL>> dp(n+3,vector<LL>(n+3,-1));\n vector<vector<int>> bef(n+3,vector<int>(n+3));\n cin>>v1;\n for(i=0;i<n;i++){\n v2[i+1]=v2[i]+v1[i];\n }\n for(i=0;i<n;i++){\n vector<LL> va(n+4,INF),vb(n+4,-2);\n if(i==0)va[0]=-INF,vb[0]=-1;\n for(j=0;j<i;j++){\n if(dp[j][i]==-1)continue;\n b=v2[i]-v2[j]+v2[i]+1;\n c=dp[j][i]+1;\n if(va[c]>b){\n va[c]=b;\n vb[c]=j;\n }\n }\n for(j=n-1;j>=0;j--){\n if(va[j+1]<va[j]){\n va[j]=va[j+1];\n vb[j]=-1;\n }\n }\n for(j=i+1;j<=n;j++){\n auto itr=upper_bound(va.begin(),va.end(),v2[j]);\n if(itr==va.begin())continue;\n assert(itr!=va.end());\n itr--;\n k=itr-va.begin();\n assert(vb[k]!=-2);\n dp[i][j]=k;\n bef[i][j]=vb[k];\n }\n }\n int s=-1;\n a=-1;\n for(i=0;i<n;i++){\n if(s<dp[i][n]){\n s=dp[i][n];\n a=i,b=n;\n }\n }\n assert(a!=-1);\n vector<int> vs;\n for(i=0;i<n && a>0;i++){\n vs.push_back(a);\n c=bef[a][b];\n b=a,a=c;\n }\n assert(a==0);\n assert(vs.size()==s);\n reverse(vs.begin(),vs.end());\n cout<<s+1<<endl;\n cout<<vs<<endl;\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n sol::solve();\n}","accuracy":1,"time_ms":280,"memory_kb":191476,"score_of_the_acc":-1.0305,"final_rank":8},{"submission_id":"aoj_2430_6041853","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=210005,INF=1<<29;\n\n// BIT セグ木 遅延セグ木 のみ\n\n// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9\n// (based on AtCoder STL)\n\n#include <algorithm>\n#include <array>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nnamespace atcoder {\n namespace internal {\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n int bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n }\n } // namespace internal\n \n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n \n namespace internal {\n \n#ifndef _MSC_VER\n template <class T>\n using is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n \n template <class T>\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n \n#else\n \n template <class T> using is_integral = typename std::is_integral<T>;\n \n template <class T>\n using is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n \n template <class T>\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n \n#endif\n \n template <class T>\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n \n template <class T>\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n \n template <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n \n } // namespace internal\n \n} // namespace atcoder\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n \n template <class T> struct fenwick_tree {\n using U = internal::to_unsigned_t<T>;\n \n public:\n fenwick_tree() : _n(0) {}\n fenwick_tree(int n) : _n(n), data(n) {}\n \n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while (p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n \n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n \n private:\n int _n;\n std::vector<U> data;\n \n U sum(int r) {\n U s = 0;\n while (r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n };\n \n} // namespace atcoder\n\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\nnamespace atcoder {\n \n template <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\n struct lazy_segtree {\n public:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n \n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n \n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n \n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n \n l += size;\n r += size;\n \n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n \n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n \n return op(sml, smr);\n }\n \n S all_prod() { return d[1]; }\n \n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n \n l += size;\n r += size;\n \n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n \n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n \n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n \n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\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 += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n \n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\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 += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n \n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n \n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n };\n \n} // namespace atcoder\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n \n template <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 = internal::ceil_pow2(_n);\n size = 1 << log;\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 atcoder\n\nusing T=int;\n\nT f(T a,T b){\n return max(a,b);\n}\n\nT ti(){\n return -INF;\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N;cin>>N;\n vector<ll> A(N),rui(N+1);\n for(int i=0;i<N;i++){\n cin>>A[i];\n rui[i+1]=rui[i]+A[i];\n }\n vector<vector<ll>> diff(N+1);\n diff[0].push_back(-INF);\n for(int i=1;i<=N;i++){\n diff[i].resize(i+1);\n for(int j=0;j<i;j++){\n diff[i][j]=rui[i]-rui[j];\n }\n diff[i].back()=rui[i];\n diff[i].push_back(-INF);\n sort(all(diff[i]));\n diff[i].erase(unique(all(diff[i])),diff[i].end());\n }\n \n vector<atcoder::segtree<T,f,ti>> seg(N+1);\n \n seg[0]=atcoder::segtree<T,f,ti>(1);\n seg[0].set(0,0);\n \n for(int i=1;i<=N;i++){\n seg[i]=atcoder::segtree<T,f,ti>(si(diff[i]));\n for(int j=0;j<i;j++){\n ll x=rui[i]-rui[j];\n int k=lower_bound(all(diff[i]),x)-diff[i].begin();\n T res=seg[i].get(k);\n chmax(res,seg[j].prod(0,lower_bound(all(diff[j]),x)-diff[j].begin())+1);\n seg[i].set(k,res);\n //cout<<i<<\" \"<<j<<\" \"<<res.fi<<endl;\n }\n }\n \n cout<<seg[N].all_prod()<<endl;\n vector<int> ans;\n int i=N;\n while(1){\n auto ma=seg[i].all_prod();\n int to=-1;\n for(int j=0;j<i;j++){\n ll x=rui[i]-rui[j];\n int k=lower_bound(all(diff[i]),x)-diff[i].begin();\n if(seg[j].prod(0,lower_bound(all(diff[j]),x)-diff[j].begin())+1==ma&&seg[i].get(k)==ma) to=j;\n }\n i=to;\n if(i<=0) break;\n ans.push_back(i);\n }\n reverse(all(ans));\n for(int i=0;i<si(ans);i++){\n if(i) cout<<\" \";\n cout<<ans[i];\n }\n cout<<endl;\n}","accuracy":1,"time_ms":1500,"memory_kb":176012,"score_of_the_acc":-1.2995,"final_rank":11},{"submission_id":"aoj_2430_6014492","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <numeric>\n#include <limits>\n#include <vector>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\nnamespace atcoder {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S prod(int l, int r) const {\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\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 atcoder\n\nconstexpr long long inf = std::numeric_limits<long long>::max() / 2;\n\nusing S = std::pair<long long, int>;\n\nconstexpr S op(S x, S y) {\n return x > y ? x : y;\n}\nconstexpr S e() {\n return { -inf, -1 };\n}\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int n;\n std::cin >> n;\n std::vector<long long> s(n + 1, 0);\n for (int i = 1; i <= n; ++i) {\n std::cin >> s[i];\n s[i] += s[i - 1];\n }\n\n std::vector dp(n + 1, std::vector(n + 1, inf));\n std::vector pr(n + 1, std::vector(n + 1, -1));\n\n dp[0][0] = -inf;\n\n for (int num = 0; num < n; ++num) {\n std::vector<int> p(n + 1);\n std::iota(p.begin(), p.end(), 0);\n std::sort(p.begin(), p.end(), [&](int i, int j) {\n long long ai = dp[num][i] + s[i];\n long long aj = dp[num][j] + s[j];\n return ai == aj ? i < j : ai < aj;\n });\n std::vector<int> q(n + 1);\n for (int i = 0; i <= n; ++i) {\n q[p[i]] = i;\n }\n\n std::vector<long long> a(n + 1);\n for (int i = 0; i <= n; ++i) {\n a[i] = dp[num][p[i]] + s[p[i]];\n }\n atcoder::segtree<S, op, e> seg(n + 1);\n\n for (int j = 0; j <= n; ++j) {\n int r = std::lower_bound(a.begin(), a.end(), s[j]) - a.begin();\n auto [v, k] = seg.prod(0, r);\n if (k >= 0) {\n dp[num + 1][j] = s[j] - v;\n pr[num + 1][j] = k;\n }\n seg.set(q[j], { s[j], j });\n }\n }\n std::vector<int> sep;\n for (int num = n; num > 0; --num) {\n if (pr[num][n] < 0) continue;\n for (int cur = pr[num][n]; cur > 0; cur = pr[--num][cur]) {\n sep.push_back(cur);\n }\n break;\n }\n std::reverse(sep.begin(), sep.end());\n const int sz = sep.size();\n std::cout << sz + 1 << '\\n';\n for (int i = 0; i < sz; ++i) {\n std::cout << sep[i];\n if (i + 1 < sz) std::cout << ' ';\n }\n std::cout << '\\n';\n return 0;\n}","accuracy":1,"time_ms":2110,"memory_kb":191340,"score_of_the_acc":-1.5587,"final_rank":12},{"submission_id":"aoj_2430_6014428","code_snippet":"#include <algorithm>\n#include <iostream>\n#include <numeric>\n#include <limits>\n#include <vector>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\nnamespace atcoder {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S prod(int l, int r) const {\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\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 atcoder\n\nconstexpr long long inf = std::numeric_limits<long long>::max() / 2;\n\nusing S = std::pair<long long, int>;\n\nconstexpr S op(S x, S y) {\n return x > y ? x : y;\n}\nconstexpr S e() {\n return { -inf, -1 };\n}\n\ntemplate <typename T>\nbool chmin(T &x, const T &y) {\n if (x <= y) return false;\n x = y;\n return true;\n}\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int n;\n std::cin >> n;\n std::vector<long long> s(n + 1, 0);\n for (int i = 1; i <= n; ++i) {\n std::cin >> s[i];\n s[i] += s[i - 1];\n }\n std::vector dp(n + 1, std::vector(n + 1, inf));\n std::vector pr(n + 1, std::vector(n + 1, -1));\n dp[0][0] = 0;\n for (int num = 0; num < n; ++num) {\n std::vector<int> p(n + 1);\n std::iota(p.begin(), p.end(), 0);\n std::sort(p.begin(), p.end(), [&](int i, int j) {\n long long ai = dp[num][i] + s[i];\n long long aj = dp[num][j] + s[j];\n return ai == aj ? i < j : ai < aj;\n });\n std::vector<int> q(n + 1);\n for (int i = 0; i <= n; ++i) {\n q[p[i]] = i;\n }\n\n std::vector<long long> a(n + 1);\n for (int i = 0; i <= n; ++i) {\n a[i] = dp[num][p[i]] + s[p[i]];\n }\n atcoder::segtree<S, op, e> seg(n + 1);\n\n for (int j = 0; j <= n; ++j) {\n int r = std::lower_bound(a.begin(), a.end(), s[j]) - a.begin();\n auto [v, k] = seg.prod(0, r);\n if (k >= 0) {\n dp[num + 1][j] = s[j] - v;\n pr[num + 1][j] = k;\n }\n seg.set(q[j], { s[j], j });\n }\n }\n std::vector<int> sep;\n for (int num = n; num > 0; --num) {\n if (dp[num][n] == inf) continue;\n for (int cur = pr[num][n]; cur > 0; cur = pr[--num][cur]) {\n sep.push_back(cur);\n }\n break;\n }\n std::reverse(sep.begin(), sep.end());\n const int sz = sep.size();\n std::cout << sz + 1 << '\\n';\n for (int i = 0; i < sz; ++i) {\n std::cout << sep[i];\n if (i + 1 < sz) std::cout << ' ';\n }\n std::cout << '\\n';\n return 0;\n}","accuracy":0.03333333333333333,"time_ms":100,"memory_kb":14752,"score_of_the_acc":-0.0231,"final_rank":18},{"submission_id":"aoj_2430_6004975","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\nll modulo(ll n,ll d){return (n%d+d)%d;};\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n;cin>>n;\n vector<ll>a(n);\n rep(i,0,n)cin>>a[i];\n vector<ll>b(n+1);\n rep(i,0,n)b[i+1]=a[i]+b[i];\n auto ord=ascend(b);\n const int inf=1e9;\n auto dp=vec(n+1,n+1,-inf);\n auto from=vec(n+1,n+1,-1);\n rep(i,1,n+1){\n dp[0][i]=1;\n }\n rep(i,1,n){\n ll mx=-inf;\n ll pre=-1;\n ll idx=n;\n for(auto j:ord){\n while(idx>=0&&b[i]-b[ord[idx]]<b[j]-b[i]){\n if(ord[idx]<i&&chmax(mx,dp[ord[idx]][i]+1)){\n pre=ord[idx];\n };\n idx--;\n }\n dp[i][j]=mx;\n from[i][j]=pre;\n }\n }\n ll pre=-1,mx=-inf;\n //debug(dp);\n rep(i,0,n){\n if(chmax(mx,dp[i][n]))pre=i;\n }\n vector<ll>ret;\n ll r=n;\n while(pre>0){\n ret.PB(pre);\n ll tmppre=pre;\n pre=from[pre][r];\n r=tmppre;\n }\n reverse(ALL(ret));\n cout<<mx<<endl;\n debug(ret);\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":128484,"score_of_the_acc":-0.6524,"final_rank":3},{"submission_id":"aoj_2430_6004955","code_snippet":"//#define _GLIBCXX_DEBUG\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define endl '\\n'\n#define lfs cout<<fixed<<setprecision(10)\n#define ALL(a) (a).begin(),(a).end()\n#define ALLR(a) (a).rbegin(),(a).rend()\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\n#define spa << \" \" <<\n#define fi first\n#define se second\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define EB emplace_back\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\nusing ll = long long;\nusing ld = long double;\nconst ll MOD1 = 1e9+7;\nconst ll MOD9 = 998244353;\nconst ll INF = 1e18;\nusing P = pair<ll, ll>;\ntemplate<typename T> using PQ = priority_queue<T>;\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\nvoid ans1(bool x){if(x) cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;}\nvoid ans2(bool x){if(x) cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;}\nvoid ans3(bool x){if(x) cout<<\"Yay!\"<<endl;else cout<<\":(\"<<endl;}\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\" \"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\ntemplate<typename T>void debug(const T &v,ll n,string sv=\" \"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\" \";st.pop_front();}cout<<endl;}\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\" \";st.pop();}cout<<endl;}\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\" \";cout<<endl;}\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\"[\"<<z.first<<\"]=\"<<z.second<<\",\";cout<<endl;}\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \" \" << p.second;}\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \" \";cout<<\"|\"; return os;}\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\n auto tmp = v;\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\n}\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\n rearrange(ord, head);\n rearrange(ord, tail...);\n}\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\n return ord;\n}\ntemplate<typename T> vector<int> descend(const vector<T>&v){\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\n return ord;\n}\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\nll modulo(ll n,ll d){return (n%d+d)%d;};\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\nint popcount(ll x){return __builtin_popcountll(x);};\nint poplow(ll x){return __builtin_ctzll(x);};\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\ntemplate< typename T = int >\nstruct edge {\n int to;\n T cost;\n int id;\n edge():id(-1){};\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\n operator int() const { return to; }\n};\n\ntemplate<typename T>\nusing Graph = vector<vector<edge<T>>>;\ntemplate<typename T>\nGraph<T>revgraph(const Graph<T> &g){\n Graph<T>ret(g.size());\n for(int i=0;i<g.size();i++){\n for(auto e:g[i]){\n int to = e.to;\n e.to = i;\n ret[to].push_back(e);\n }\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\n Graph<T> ret(n);\n for(int es = 0; es < m; es++){\n int u,v;\n T w=1;\n cin>>u>>v;u-=indexed,v-=indexed;\n if(weighted)cin>>w;\n ret[u].emplace_back(v,w,es);\n if(!directed)ret[v].emplace_back(u,w,es);\n }\n return ret;\n}\ntemplate<typename T>\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\n Graph<T>ret(n);\n for(int i=1;i<n;i++){\n int p;cin>>p;\n p-=indexed;\n ret[p].emplace_back(i);\n if(!directed)ret[i].emplace_back(p);\n }\n return ret;\n}\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n ll res=0,buf=0;\n bool judge = true;\n ll n;cin>>n;\n vector<ll>a(n);\n rep(i,0,n)cin>>a[i];\n vector<ll>b(n+1);\n rep(i,0,n)b[i+1]=a[i]+b[i];\n auto ord=ascend(b);\n const int inf=1e9;\n auto dp=vec(n+1,n+1,-inf);\n auto from=vec(n+1,n+1,-1);\n rep(i,1,n+1){\n dp[0][i]=1;\n }\n rep(i,1,n){\n ll mx=-inf;\n ll pre=-1;\n ll idx=n;\n for(auto j:ord){\n while(idx>=0&&b[i]-b[ord[idx]]<b[j]-b[i]){\n if(chmax(mx,dp[ord[idx]][i]+1)){\n pre=ord[idx];\n };\n idx--;\n }\n dp[i][j]=mx;\n from[i][j]=pre;\n }\n }\n ll pre=-1,mx=-inf;\n //debug(dp);\n rep(i,0,n){\n if(chmax(mx,dp[i][n]))pre=i;\n }\n vector<ll>ret;\n ll r=n;\n while(pre>0){\n ret.PB(pre);\n ll tmppre=pre;\n pre=from[pre][r];\n r=tmppre;\n }\n reverse(ALL(ret));\n cout<<mx<<endl;\n debug(ret);\n return 0;\n}","accuracy":0.16666666666666666,"time_ms":20,"memory_kb":34444,"score_of_the_acc":-0.1065,"final_rank":16},{"submission_id":"aoj_2430_5925719","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>;\nusing P3 = pair<ll,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-9;\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\n// MLEが厳しい\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 REP(i,n) cin >> a[i];\n vector<ll> cum(n+1);\n REP(i,n) cum[i+1] = cum[i]+a[i];\n vector<vector<int> > dp(n+1), rev(n+1); // dp[i][j] 末尾の区間が[j,i)であるときの最大長さ\n REP(i,n+1){\n dp[i].resize(i+1,-1);\n rev[i].resize(i+1);\n }\n // 初期条件\n REP(i,n+1){\n dp[i][0] = 1;\n }\n for(int i=1;i<n;i++){\n // 末尾の区間和でソート\n vector<pair<ll,int>> val;\n for(int j=0;j<=i;j++){\n if(dp[i][j] < 0) continue;\n val.emplace_back(cum[i]-cum[j],j);\n }\n if(val.empty()) continue;\n sort(ALL(val));\n // 末尾を昇順に見た時のdp[i][j]の累積maxを求める\n vector<P> max_dp;\n for(auto p : val){\n int k = p.second;\n max_dp.emplace_back(dp[i][k],k);\n }\n for(int j=0;j<(int)max_dp.size()-1;j++) chmax(max_dp[j+1], max_dp[j]);\n // [i,k)で区切ったときの更新\n for(int k=i+1;k<=n;k++){\n auto itr = lower_bound(ALL(val), make_pair(cum[k]-cum[i],-1));\n if(itr == val.begin()) continue;\n int idx = (--itr) - val.begin();\n auto [x,j] = max_dp[idx];\n if(chmax(dp[k][i], x+1)){\n rev[k][i] = j;\n }\n }\n\n }\n int m = 0, idx = 0;\n REP(i,n) if(chmax(m, dp[n][i])) idx = i;\n cout << m << endl;\n vector<int> c;\n for(int k=0,i=idx,j=n;k<m-1;k++){\n c.push_back(i);\n int nxt = rev[j][i];\n j = i;\n i = nxt;\n }\n reverse(ALL(c));\n for(int i=0;i<m-1;i++){\n if(i>0) cout << \" \";\n cout << c[i];\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":66472,"score_of_the_acc":-0.3923,"final_rank":2},{"submission_id":"aoj_2430_5925687","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>;\nusing P3 = pair<ll,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-9;\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\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<ll> a(n);\n REP(i,n) cin >> a[i];\n vector<ll> cum(n+1);\n REP(i,n) cum[i+1] = cum[i]+a[i];\n vector<vector<int> > dp(n+1), rev(n+1);\n REP(i,n+1){\n dp[i].resize(i+1,-1);\n rev[i].resize(i+1);\n }\n REP(i,n+1){\n dp[i][0] = 1;\n }\n for(int i=1;i<n;i++){\n vector<pair<ll,int>> v;\n for(int j=0;j<=i;j++){\n if(dp[i][j] < 0) continue;\n v.emplace_back(cum[i]-cum[j],j);\n }\n if(v.empty()) continue;\n sort(ALL(v));\n vector<P> ls;\n for(auto p : v){\n int k = p.second;\n ls.emplace_back(dp[i][k],k);\n }\n for(int j=0;j<(int)ls.size()-1;j++) chmax(ls[j+1], ls[j]);\n for(int k=i+1;k<=n;k++){\n auto itr = lower_bound(ALL(v), make_pair(cum[k]-cum[i],-1));\n if(itr == v.begin()) continue;\n int idx = (--itr) - v.begin();\n auto [x,j] = ls[idx];\n if(chmax(dp[k][i], x+1)){\n rev[k][i] = j;\n }\n }\n\n }\n int m = 0, idx = 0;\n REP(i,n) if(chmax(m, dp[n][i])) idx = i;\n cout << m << endl;\n vector<int> c;\n for(int k=0,i=idx,j=n;k<m-1;k++){\n c.push_back(i);\n int nxt = rev[j][i];\n j = i;\n i = nxt;\n }\n reverse(ALL(c));\n for(int i=0;i<m-1;i++){\n if(i>0) cout << \" \";\n cout << c[i];\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":410,"memory_kb":66412,"score_of_the_acc":-0.392,"final_rank":1},{"submission_id":"aoj_2430_5924585","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()\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-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n 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;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nll dp[4040][4040];\nint pre[4040][4040];\n\nint main(){\n int n; cin >> n;\n vl a(n); rep(i,n) cin >> a[i];\n vl s(n+1); rep(i,n) s[i+1] = s[i] + a[i];\n rep(i,n+1) rep(j,n+1){\n dp[i][j] = linf;\n pre[i][j] = -1;\n }\n dp[0][0] = -linf;\n rep(i,n){\n rep(j,i+1){\n ll S = s[i+1] - s[j];\n int ok = -1, ng = n+1;\n while(ng-ok > 1){\n int mid = (ok+ng) / 2;\n if(dp[j][mid] < S) ok = mid;\n else ng = mid;\n }\n if(ok >= 0){\n if(chmin(dp[i+1][ok+1], S)) pre[i+1][ok+1] = j;\n }\n }\n for(int j=n-1; j>=0; j--){\n if(chmin(dp[i+1][j], dp[i+1][j+1])) pre[i+1][j] = pre[i+1][j+1];\n }\n }\n for(int i=n; i>=0; i--){\n if(dp[n][i] < linf){\n cout << i << \"\\n\";\n int now = n;\n int pos = i;\n vl ans;\n while(1){\n now = pre[now][pos];\n if(now == 0) break;\n ans.push_back(now);\n pos--;\n }\n assert(ans.size() == i-1);\n reverse(all(ans));\n rep(j,i-1) cout << ans[j] << \" \\n\"[j==i-2];\n return 0;\n }\n }\n}","accuracy":1,"time_ms":660,"memory_kb":193864,"score_of_the_acc":-1.1533,"final_rank":9},{"submission_id":"aoj_2430_5922413","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.29 17:37:47 */\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 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\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\t// debug(a);\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\nll dp[4020][4020];\nvector<int> solve(int n, vll a) {\n\t// VV<pair<ll, int>> dp(n + 1, V<pair<ll, int>>(n + 1, pair(INF, -1)));\n\n\trep(i, n + 1) rep(j, n + 1) dp[i][j] = INF;\n\tvll acc(n + 1, 0LL);\n\trep(i, n) acc[i + 1] = acc[i] + a[i];\n\n\tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\n\n\trep(i, 1, n + 1) dp[i][1] = sum(0, i);\n\n\tint i = -1, j = n + 1;\n\trep(from, 1, n + 1) {\n\t\tdrep(i, n) { chmin(dp[from][i], dp[from][i + 1]); }\n\t\trep(nxt, from + 1, n + 1) {\n\t\t\tconst ll val_nxt = sum(from, nxt);\n\t\t\tfor(i = -1, j = n + 1; j - i > 1;) {\n\t\t\t\tint k = (i + j) / 2;\n\t\t\t\tif(dp[from][k] >= val_nxt) {\n\t\t\t\t\tj = k;\n\t\t\t\t} else {\n\t\t\t\t\ti = k;\n\t\t\t\t}\n\t\t\t}\n\t\t\tswap(i, j);\n\t\t\tif(!i || i > n) continue;\n\t\t\tchmin(dp[nxt][i], val_nxt);\n\t\t}\n\t}\n\n\tconst ll val_max = 1e15;\n\n\tint ans = 0;\n\trep(i, n + 1) if(dp[n][i] < val_max) ans = i;\n\n\tvector<int> ret;\n\tint now = n;\n\n\twhile(ans) {\n\t\tll val = dp[now][ans];\n\t\tfor(int pre_idx = now - 1; pre_idx >= 0; pre_idx--) {\n\t\t\tif(pre_idx == 0 || dp[pre_idx][ans - 1] < val) {\n\t\t\t\tret.push_back(pre_idx);\n\t\t\t\tnow = pre_idx;\n\t\t\t\tans--;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tret.pop_back();\n\treverse(all(ret));\n\n\t// {\n\t// \tauto c = ret;\n\t// \tc.insert(c.begin(), 0);\n\t// \tc.push_back(n);\n\t// \tint cs = c.size();\n\t// \tll val;\n\t// \trep(i, cs - 1) {\n\t// \t\tint l, r;\n\t// \t\tl = c[i];\n\t// \t\tr = c[i + 1];\n\t// \t\tif(i) {\n\t// \t\t\tif(val >= sum(l, r)) {\n\t// \t\t\t\t// debug(ret);\n\t// \t\t\t\texit(0);\n\t// \t\t\t}\n\t// \t\t}\n\t// \t\tval = sum(l, r);\n\t// \t}\n\t// }\n\n\treturn ret;\n}\n\n// int naive(int n, vll a) {\n// \tvll acc(n + 1, 0LL);\n// \trep(i, n) acc[i + 1] = acc[i] + a[i];\n\n// \tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\n\n// \tint ans = 1;\n\n// \tauto judge = [&](vector<int> walls) {\n// \t\tll val;\n// \t\trep(i, int(walls.size()) - 1) {\n// \t\t\tint lef = walls[i];\n// \t\t\tint rig = walls[i + 1];\n// \t\t\tll val_now = sum(lef, rig);\n// \t\t\tif(lef && val >= val_now) {\n// \t\t\t\treturn false;\n// \t\t\t}\n// \t\t\tval = val_now;\n// \t\t}\n// \t\treturn true;\n// \t};\n\n// \tconst int bit_max = 1 << (n - 1);\n// \trep(bits, bit_max) {\n// \t\tint pp = popcnt(bits) + 1;\n// \t\tif(pp <= ans) continue;\n// \t\tvector<int> walls = {0};\n// \t\trep(i, n - 1) {\n// \t\t\tif(bits & (1 << i)) {\n// \t\t\t\twalls.push_back(i + 1);\n// \t\t\t}\n// \t\t}\n// \t\twalls.push_back(n);\n// \t\tif(judge(walls)) ans = pp;\n// \t}\n\n// \treturn ans;\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\t// while(1) {\n\t// \t// int n = 3;\n\t// \tint n = rand() % 6 + 3;\n\t// \tvll a(n);\n\t// \t// // foa(t, a) t = rand() % 123456 - rand() % 60000;\n\t// \t// vll a = {56346, -37076, -2330};\n\t// \t// debug(n);\n\t// \t// debug(a);\n\n\t// \t// int n = 8;\n\t// \t// vll a = {-17405, 60160, 69055, 80555, -27834, 66437, 5030, -23590};\n\n\t// \tvector<int> res = solve(n, a);\n\t// \t// debug(res);\n\n\t// \tint split_ans = naive(n, a);\n\t// \t// debug(split_ans);;\n\n\t// \tauto err = [&]() {\n\t// \t\tdebug(res);\n\t// \t\tdebug(split_ans);\n\t// \t\texit(0);\n\t// \t\treturn;\n\t// \t};\n\n\t// \tif(res.size() + 1 != split_ans) {\n\t// \t\terr();\n\t// \t}\n\t// }\n\n\tint n;\n\twhile(cin >> n) {\n\t\tvll a(n);\n\t\tfoa(t, a) cin >> t;\n\t\tvector<int> res = solve(n, a);\n\t\tprint(int(res.size()) + 1);\n\t\tvout(res, 0);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":240,"memory_kb":129196,"score_of_the_acc":-0.6823,"final_rank":4},{"submission_id":"aoj_2430_5922175","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.29 17:37:47 */\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\nvector<int> solve(int n) {\n\tvll a(n);\n\tfoa(t, a) cin >> t;\n\n\tVV<pair<ll, int>> dp(n + 1, V<pair<ll, int>>(n + 1, pair(INF, -1)));\n\t// dp[from_here][array_len] = pair(value_min, pre_idx);\n\n\tvll acc(n + 1);\n\trep(i, n) acc[i + 1] = acc[i] + a[i];\n\n\tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\n\n\trep(i, 1, n + 1) dp[i][1] = pair(sum(0, i), 0);\n\n\trep(from, 1, n) {\n\t\trep(i, n) { chmin(dp[from][i], dp[from][i + 1]); }\n\t\trep(nxt, from + 1, n + 1) {\n\t\t\tconst ll val_nxt = sum(from, nxt);\n\t\t\tint i = lb(dp[from], pair(val_nxt, -inf)) - 1;\n\t\t\tchmin(dp[nxt][i + 1], pair(val_nxt, from));\n\t\t}\n\t}\n\n\tint ans = 0;\n\trep(i, n + 1) {\n\t\tif(dp[n][i].first < INF) {\n\t\t\tans = i;\n\t\t}\n\t}\n\n\tvector<int> ret;\n\tint now = n;\n\twhile(now) {\n\t\tint pre_idx = dp[now][ans].second;\n\t\tret.push_back(pre_idx);\n\t\tnow = pre_idx;\n\t\tans--;\n\t}\n\n\tret.pop_back();\n\treverse(all(ret));\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 n;\n\twhile(cin >> n) {\n\t\tvector<int> res = solve(n);\n\t\tprint(int(res.size()) + 1);\n\t\tvout(res, 0);\n\t}\n\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":40,"memory_kb":65848,"score_of_the_acc":-0.282,"final_rank":17},{"submission_id":"aoj_2430_5044042","code_snippet":"#include <bits/stdc++.h>\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\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 = internal::ceil_pow2(_n);\n size = 1 << log;\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 atcoder\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, int> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long double EPS = 1e-10;\nconst long long INF = 1e18;\nconst long double PI = acos(-1.0L);\n//const ll mod = 1000000007;\nll N;\nll A[4005];\nll Asum[4005];\nll dp[4001][4001];\nint from[4005][4005];\nl_l e() {return {INF, -1};}\nl_l op(l_l a, l_l b) {return min(a, b);}\nusing segtree = atcoder::segtree<l_l, op, e>;\n\nint main() {\n cin >> N;\n for(int i = 0; i < N; i++) {\n cin >> A[i];\n Asum[i+1] = Asum[i] + A[i];\n }\n for(int i = 0; i <= N; i++) {\n for(int j = 0; j <= N; j++) {\n dp[i][j] = INF;\n }\n }\n dp[0][0] = -INF;\n ll ansm = 0;\n for(ll m = 1; m <= N; m++) {\n vector<l_l> a(N + 1);\n for(int i = 0; i <= N; i++) {\n a[i] = {INF, i};\n }\n segtree seg(a);\n vector<l_l> v;\n for(int i = 0; i < N; i++) {\n v.push_back({dp[m-1][i] + Asum[i], i});\n v.push_back({Asum[i+1], -i-1});\n }\n sort(v.begin(), v.end());\n for(auto tmp : v) {\n //cerr << tmp.first << \", \" << tmp.second << endl;\n if(tmp.second >= 0) {\n ll idx = tmp.second;\n seg.set(idx, {-Asum[idx], idx});\n } else {\n ll idx = -tmp.second - 1;\n auto val = seg.prod(0, idx + 1);\n dp[m][idx+1] = val.first + Asum[idx+1];\n from[m][idx+1] = val.second;\n }\n }\n if(dp[m][N] <= 1e17) ansm = m;\n /*\n for(int i = 0; i <= N; i++) {\n cerr << dp[m][i] << \" \";\n }\n cerr << endl;\n */\n }\n //cerr << ansm << endl;\n ll nowm = ansm;\n ll nowidx = N;\n vector<ll> ansidx(ansm - 1);\n for(int i = ansm - 2; i >= 0; i--) {\n nowidx = from[nowm][nowidx];\n ansidx[i] = nowidx;\n nowm--;\n //cerr << nowidx << \" \";\n }\n //cerr << endl;\n cout << ansm << endl;\n for(int i = 0; i < ansidx.size(); i++) {\n if(i != 0) cout << \" \";\n cout << ansidx[i];\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":3480,"memory_kb":191536,"score_of_the_acc":-1.9557,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_2430_8323868\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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 rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\n\\nTT void print(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << (i == n - 1 ? '\\\\n' : ' ');\\n if (n == 0) cout << '\\\\n';\\n}\\n\\nTT void printn(vector<T> v, T x = 0) {\\n int n = sz(v);\\n rep(i, n) cout << v[i] + x << '\\\\n';\\n}\\n\\nTT void rearrange(vector<T> &v) {\\n sort(all(v));\\n v.erase(unique(all(v)));\\n}\\n\\nTT int lb(vector<T> &v, T x) { return lower_bound(all(v), x) - begin(v); }\\nTT int ub(vector<T> &v, T x) { return upper_bound(all(v), x) - begin(v); }\\n\\nconst ll INF = (1LL << 60) - 1;\\n\\nstruct io_setup {\\n io_setup() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main() {\\n int N;\\n cin >> N;\\n\\n vector<ll> a(N);\\n rep(i, N) cin >> a[i];\\n\\n vector<vector<ll>> dp(N + 1, vector<ll>(N + 1, INF));\\n vector<vector<int>> pre(N + 1, vector<int>(N + 1, -1));\\n dp[0][0] = -INF;\\n\\n rep(i, N) {\\n per(j, N) chmin(dp[i][j], dp[i][j + 1]);\\n ll sum = 0;\\n rep2(j, i, N) {\\n sum += a[j];\\n int t = lb(dp[i], sum);\\n if (t > 0 && chmin(dp[j + 1][t], sum)) pre[j + 1][t] = i;\\n }\\n }\\n // rep(i, N + 1) print(dp[i]);\\n\\n int M = lb(dp[N], INF) - 1;\\n\\n cout << M << '\\\\n';\\n int p = N;\\n vector<int> ans;\\n\\n rep(i, M - 1) {\\n int q = pre[p][M - i];\\n ans.eb(q);\\n p = q;\\n }\\n reverse(all(ans));\\n\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 191044,\n \"score_of_the_acc\": -0.9935,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2430_7223235\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\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#define REP(i, n) for(int i = 0;i < (n);i++)\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst int mod=1000000007;\\nconst llint inf=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-10;\\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool chmax(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>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\nint main(void){\\n\\tint n,i,j;cin>>n;\\n\\tvector<llint>a(n);\\n\\tvector<llint>wa(n+1);\\n\\tfor(i=0;i<n;i++){\\n\\t\\tcin>>a[i];\\n\\t\\twa[i+1]=wa[i]+a[i];\\n\\t}\\n\\tint kaz=0;\\n\\tvector<multiset<pair<llint,int>>> dp(n+1);\\n\\tdp[0].ins(mp(-inf,0LL));\\n\\tint ans=0;\\n\\tstatic int fukugen[4001][4001]={};\\n\\tfor(i=0;i<n;i++){\\n\\t\\tfor(j=kaz;j>=0;j--){\\n\\t\\t\\tauto itr=dp[j].lower_bound(mp(wa[i+1],-999));\\n\\t\\t\\tif(itr==dp[j].begin()){continue;}\\n\\t\\t\\titr--;\\n\\t\\t\\tllint Bnum=wa[i+1] - wa[itr->sec];\\n\\t\\t\\tfukugen[j+1][i+1]=itr->sec;\\n\\t\\t\\tauto jtr=dp[j+1].ins(mp(wa[i+1]+Bnum,i+1));\\n\\t\\t\\t\\n\\t\\t\\tif(j==kaz){kaz++;}\\n\\t\\t\\tif(i==n-1){chmax(ans,j+1);}\\n\\t\\t\\tif(jtr!=dp[j+1].begin() && wa[prev(jtr)->sec] >= wa[jtr->sec]){\\n\\t\\t\\t\\tdp[j+1].erase(jtr);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\twhile(next(jtr)!=dp[j+1].end() && wa[jtr->sec] >= wa[next(jtr)->sec]){\\n\\t\\t\\t\\tdp[j+1].erase(next(jtr));\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n\\tvector<int>kugiri;\\n\\tint bas=n;\\n\\tfor(j=ans;j>1;j--){\\n\\t\\tbas=fukugen[j][bas];\\n\\t\\tkugiri.pub(bas);\\n\\t}\\n\\tREV(kugiri);\\n\\tfor(auto it:kugiri){cout<<it<<\\\" \\\";}\\n\\tcout<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 160772,\n \"score_of_the_acc\": -0.9657,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2430_7223230\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\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#define REP(i, n) for(int i = 0;i < (n);i++)\\n/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/\\nconst int mod=1000000007;\\nconst llint inf=2.19e15+1;\\nconst long double pai=3.141592653589793238462643383279502884197;\\nconst long double eps=1e-10;\\ntemplate <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}\\ntemplate <class T,class U>bool chmax(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>int LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}\\ntemplate<class T>int UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}\\n\\nint main(void){\\n\\tint n,i,j;cin>>n;\\n\\tvector<llint>a(n);\\n\\tvector<llint>wa(n+1);\\n\\tfor(i=0;i<n;i++){\\n\\t\\tcin>>a[i];\\n\\t\\twa[i+1]=wa[i]+a[i];\\n\\t}\\n\\tint kaz=0;\\n\\tvector<multiset<pair<llint,int>>> dp(n+1);\\n\\tdp[0].ins(mp(-inf,0LL));\\n\\tint ans=0;\\n\\tstatic int fukugen[4001][4001]={};\\n\\tfor(i=0;i<n;i++){\\n\\t\\tfor(j=kaz;j>=0;j--){\\n\\t\\t\\tauto itr=dp[j].lower_bound(mp(wa[i+1],-999));\\n\\t\\t\\tif(itr==dp[j].begin()){continue;}\\n\\t\\t\\titr--;\\n\\t\\t\\tllint Bnum=wa[i+1] - wa[itr->sec];\\n\\t\\t\\tfukugen[j+1][i+1]=itr->sec;\\n\\t\\t\\tauto jtr=dp[j+1].ins(mp(wa[i+1]+Bnum,i+1));\\n\\t\\t\\tif(jtr!=dp[j+1].begin() && wa[prev(jtr)->sec] >= wa[jtr->sec]){\\n\\t\\t\\t\\tdp[j+1].erase(jtr);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\twhile(next(jtr)!=dp[j+1].end() && wa[jtr->sec] >= wa[next(jtr)->sec]){\\n\\t\\t\\t\\tdp[j+1].erase(next(jtr));\\n\\t\\t\\t}\\n\\t\\t\\tif(j==kaz){kaz++;}\\n\\t\\t\\tif(i==n-1){chmax(ans,j+1);}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n\\tvector<int>kugiri;\\n\\tint bas=n;\\n\\tfor(j=ans;j>1;j--){\\n\\t\\tbas=fukugen[j][bas];\\n\\t\\tkugiri.pub(bas);\\n\\t}\\n\\tREV(kugiri);\\n\\tfor(auto it:kugiri){cout<<it<<\\\" \\\";}\\n\\tcout<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4666666666666667,\n \"time_ms\": 660,\n \"memory_kb\": 160552,\n \"score_of_the_acc\": -0.9732,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2430_7209247\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint inf = 1001001001;\\n\\nint dp[4040][4040],res[4040],mx[4040];\\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++) {\\n cin >> A[i];\\n }\\n for(int i = 0; i <= n; i++) {\\n for(int j = i; j <= n; j++) {\\n dp[i][j] = -inf;\\n }\\n res[i] = -inf;\\n }\\n res[0] = 0;\\n vector<pair<long long,pair<int,int>>>tmp;\\n for(int i = 0; i < n; i++) {\\n long long sum = 0;\\n for(int j = i; j < n; j++) {\\n sum += A[j];\\n tmp.push_back({sum,{-j,i}});\\n }\\n }\\n sort(tmp.begin(),tmp.end());\\n for(int i = 0; i < tmp.size(); i++) {\\n int a = tmp[i].second.second,b = -tmp[i].second.first;\\n dp[a][b] = res[a]+1;\\n if(res[b+1] < dp[a][b]) {\\n res[b+1] = dp[a][b];\\n mx[b+1] = a;\\n }\\n }\\n vector<int>ans;\\n int now = n;\\n while(now) {\\n if(mx[now]) ans.push_back(mx[now]);\\n now = mx[now];\\n }\\n cout << res[n] << endl;\\n reverse(ans.begin(),ans.end());\\n for(int i = 0; i < ans.size(); i++) {\\n cout << ans[i] << ((i+1 == ans.size())?\\\"\\\\n\\\":\\\" \\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 199728,\n \"score_of_the_acc\": -1.1792,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2430_7209243\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint inf = 1001001001;\\n\\nint dp[4040][4040],res[4040],mx[4040];\\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++) {\\n cin >> A[i];\\n }\\n for(int i = 0; i <= n; i++) {\\n for(int j = i; j <= n; j++) {\\n dp[i][j] = -inf;\\n }\\n res[i] = -inf;\\n }\\n res[0] = 0;\\n vector<array<int,3>>tmp;\\n for(int i = 0; i < n; i++) {\\n int sum = 0;\\n for(int j = i; j < n; j++) {\\n sum += A[j];\\n tmp.push_back({sum,-j,i});\\n }\\n }\\n sort(tmp.begin(),tmp.end());\\n for(int i = 0; i < tmp.size(); i++) {\\n int a = tmp[i][2],b = -tmp[i][1];\\n dp[a][b] = res[a]+1;\\n if(res[b+1] < dp[a][b]) {\\n res[b+1] = dp[a][b];\\n mx[b+1] = a;\\n }\\n }\\n vector<int>ans;\\n int now = n;\\n while(now) {\\n if(mx[now]) ans.push_back(mx[now]);\\n now = mx[now];\\n }\\n cout << res[n] << endl;\\n reverse(ans.begin(),ans.end());\\n for(int i = 0; i < ans.size(); i++) {\\n cout << ans[i] << ((i+1 == ans.size())?\\\"\\\\n\\\":\\\" \\\");\\n }\\n}\",\n \"accuracy\": 0.6666666666666666,\n \"time_ms\": 790,\n \"memory_kb\": 167012,\n \"score_of_the_acc\": -1.0457,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2430_6813539\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\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 rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\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__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\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__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\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}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\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}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\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 UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return 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 scan(a), scan(b), scan(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 res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nnamespace segtree_impl {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while(!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace segtree_impl\\n\\nnamespace segtree_impl {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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--) { update(i); }\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S operator[](int k) const { return get(k); }\\n\\n S prod(int l, int r) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(r > _n) r = _n;\\n if(l > r) return e();\\n#endif\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(l > _n) l = _n;\\n#endif\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(r < 0) r = 0;\\n if(r > _n) r = _n;\\n#endif\\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\\n os << \\\"{\\\";\\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \\\"\\\" : \\\", \\\");\\n return os << \\\"}\\\";\\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\\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\\ntemplate <typename T> T min_e() { return inf<T>; }\\ntemplate <typename T> T max_e() { return -inf<T>; }\\ntemplate <typename T> T plus_e() { return 0; }\\n\\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\\n\\n} // namespace segtree_impl\\nusing segtree_impl::RmT;\\nusing segtree_impl::RMT;\\nusing segtree_impl::RST;\\nusing segtree_impl::segtree;\\n\\nint main() {\\n INT(n);\\n VEC(ll, a, n);\\n auto r = RUI(a);\\n vector<tuple<ll, int, int>> v;\\n vi id = iota(n + 1);\\n sort(all(id), [&](int x, int y) { return r[x] == r[y] ? x > y : r[x] < r[y]; });\\n\\n per(i, n) {\\n decltype(v) nv(si(v) + n - i), w;\\n fore(j, id) {\\n if(i < j) w.eb(r[j] - r[i], i, j);\\n }\\n merge(all(v), all(w), begin(nv));\\n swap(v, nv);\\n }\\n\\n vpi dp(n + 1, pii(-inf<int>, 0));\\n\\n dp[0] = pii(0, 0);\\n fore(_, l, r, v) {\\n if(dp[l].fi < 0) continue;\\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\\n }\\n OUT(dp[n].fi);\\n vi ans;\\n int now = n;\\n while(now) {\\n now = dp[now].se;\\n if(now) ans.eb(now);\\n }\\n REV(ans);\\n OUT(ans);\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 630,\n \"memory_kb\": 18948,\n \"score_of_the_acc\": -0.199,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2430_6813538\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\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 rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\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__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\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__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\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}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\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}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\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 UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return 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 scan(a), scan(b), scan(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 res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nnamespace segtree_impl {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while(!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace segtree_impl\\n\\nnamespace segtree_impl {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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--) { update(i); }\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S operator[](int k) const { return get(k); }\\n\\n S prod(int l, int r) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(r > _n) r = _n;\\n if(l > r) return e();\\n#endif\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(l > _n) l = _n;\\n#endif\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(r < 0) r = 0;\\n if(r > _n) r = _n;\\n#endif\\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\\n os << \\\"{\\\";\\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \\\"\\\" : \\\", \\\");\\n return os << \\\"}\\\";\\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\\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\\ntemplate <typename T> T min_e() { return inf<T>; }\\ntemplate <typename T> T max_e() { return -inf<T>; }\\ntemplate <typename T> T plus_e() { return 0; }\\n\\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\\n\\n} // namespace segtree_impl\\nusing segtree_impl::RmT;\\nusing segtree_impl::RMT;\\nusing segtree_impl::RST;\\nusing segtree_impl::segtree;\\n\\nint main() {\\n INT(n);\\n VEC(ll, a, n);\\n auto r = RUI(a);\\n vector<tuple<ll, int, int>> v;\\n vi id = iota(n + 1);\\n sort(all(id), [&](int x, int y) { return r[x] == r[y] ? x > y : r[x] < r[y]; });\\n\\n rep(i, n) {\\n decltype(v) nv(si(v) + n - i), w;\\n fore(j, id) {\\n if(i < j) w.eb(r[j] - r[i], i, j);\\n }\\n merge(all(v), all(w), begin(nv));\\n swap(v, nv);\\n }\\n vpi dp(n + 1, pii(-inf<int>, 0));\\n\\n dp[0] = pii(0, 0);\\n fore(_, l, r, v) {\\n if(dp[l].fi < 0) continue;\\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\\n }\\n OUT(dp[n].fi);\\n vi ans;\\n int now = n;\\n while(now) {\\n now = dp[now].se;\\n if(now) ans.eb(now);\\n }\\n REV(ans);\\n OUT(ans);\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 1230,\n \"memory_kb\": 26600,\n \"score_of_the_acc\": -0.4138,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2430_6813507\",\n \"code_snippet\": \"#pragma region Macros\\n#if defined(noimi) && defined(_GLIBCXX_DEBUG) && defined(_GLIBCXX_DEBUG_PEDANTIC)\\n// #pragma comment(linker, \\\"/stack:200000000\\\")\\n#include <stdc++.h>\\n#pragma GCC optimize(\\\"O3\\\")\\n#else\\n#pragma GCC optimize(\\\"Ofast\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n// #pragma GCC target(\\\"popcnt\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native\\\")\\n// #pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n// #include <bits/stdc++.h>\\n#include <bits/stdc++.h>\\n#endif\\n#include <cstdint>\\n#include <immintrin.h>\\n#include <variant>\\n\\n#ifdef noimi\\n#define oj_local(a, b) b\\n#else\\n#define oj_local(a, b) a\\n#endif\\n\\n#define LOCAL if(oj_local(0, 1))\\n#define OJ if(oj_local(1, 0))\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long int;\\nusing i128 = __int128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing ld = long double;\\ntemplate <typename T> using vc = vector<T>;\\ntemplate <typename T> using vvc = vector<vc<T>>;\\ntemplate <typename T> using vvvc = vector<vvc<T>>;\\nusing vi = vc<int>;\\nusing vl = vc<ll>;\\nusing vpi = vc<pii>;\\nusing vpl = vc<pll>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <typename T> int si(const T &x) { return x.size(); }\\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }\\nvi iota(int n) {\\n vi a(n);\\n return iota(a.begin(), a.end(), 0), a;\\n}\\ntemplate <typename T> vi iota(const vector<T> &a, bool greater = false) {\\n vi res(a.size());\\n iota(res.begin(), res.end(), 0);\\n sort(res.begin(), res.end(), [&](int i, int j) {\\n if(greater) return a[i] > a[j];\\n return a[i] < a[j];\\n });\\n return res;\\n}\\n\\n// macros\\n#define overload5(a, b, c, d, e, name, ...) name\\n#define overload4(a, b, c, d, name, ...) name\\n#define endl '\\\\n'\\n#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)\\n#define REP1(i, n) for(ll i = 0; i < (n); ++i)\\n#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)\\n#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\\n#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)\\n#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)\\n#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)\\n#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))\\n#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)\\n#define fore0(a) rep(a.size())\\n#define fore1(i, a) for(auto &&i : a)\\n#define fore2(a, b, v) for(auto &&[a, b] : v)\\n#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)\\n#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)\\n#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define drop(s) cout << #s << endl, exit(0)\\n#define si(c) (int)(c).size()\\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 rng(v, l, r) v.begin() + l, v.begin() + r\\n#define all(c) begin(c), end(c)\\n#define rall(c) rbegin(c), rend(c)\\n#define SORT(v) sort(all(v))\\n#define REV(v) reverse(all(v))\\n#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())\\ntemplate <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\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__))))\\nconstexpr pii dx4[4] = {pii{1, 0}, pii{0, 1}, pii{-1, 0}, pii{0, -1}};\\nconstexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};\\n\\nnamespace yesno_impl {\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nconst string firstsecond[2] = {\\\"second\\\", \\\"first\\\"};\\nconst string FirstSecond[2] = {\\\"Second\\\", \\\"First\\\"};\\nconst string possiblestr[2] = {\\\"impossible\\\", \\\"possible\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid first(bool t = 1) { cout << firstsecond[t] << endl; }\\nvoid First(bool t = 1) { cout << FirstSecond[t] << endl; }\\nvoid possible(bool t = 1) { cout << possiblestr[t] << endl; }\\n}; // namespace yesno_impl\\nusing namespace yesno_impl;\\n\\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__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n vector<type> name1(size), name2(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n vector<type> name1(size), name2(size), name3(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\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}\\n\\ntemplate <typename T, typename S> T ceil(T x, S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\n\\ntemplate <typename T, typename S> T floor(T x, S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\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}\\ntemplate <class T, class S> T POW(T x, S n, const ll &mod) {\\n T res = 1;\\n x %= mod;\\n for(; n; n >>= 1, x = x * x % mod)\\n if(n & 1) res = res * x % mod;\\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 UNIQUE(y);\\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\\n}\\ntemplate <class S> void fold_in(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void fold_in(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto e : a) v.emplace_back(e);\\n fold_in(v, tail...);\\n}\\ntemplate <class S> void renumber(vector<S> &v) {}\\ntemplate <typename Head, typename... Tail, class S> void renumber(vector<S> &v, Head &&a, Tail &&...tail) {\\n for(auto &&e : a) e = lb(v, e);\\n renumber(v, tail...);\\n}\\ntemplate <class S, class... Args> vector<S> zip(vector<S> &head, Args &&...args) {\\n vector<S> v;\\n fold_in(v, head, args...);\\n sort(all(v)), v.erase(unique(all(v)), v.end());\\n renumber(v, head, args...);\\n return v;\\n}\\ntemplate <typename T> vector<T> RUI(const vector<T> &v) {\\n vector<T> res(v.size() + 1);\\n for(int i = 0; i < v.size(); i++) res[i + 1] = res[i] + v[i];\\n return res;\\n}\\n// 反時計周りに 90 度回転\\ntemplate <typename T> void rot(vector<vector<T>> &v) {\\n if(empty(v)) return;\\n int n = v.size(), m = v[0].size();\\n vector res(m, vector<T>(n));\\n rep(i, n) rep(j, m) res[m - 1 - j][i] = v[i][j];\\n v.swap(res);\\n}\\n// x in [l, r)\\ntemplate <class T, class S> bool inc(const T &x, const S &l, const S &r) { return l <= x and x < r; }\\n\\n// 便利関数\\nconstexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }\\nconstexpr ll tri(ll n) { return n * (n + 1) / 2; }\\n// l + ... + r\\nconstexpr ll tri(ll l, ll r) { return (l + r) * (r - l + 1) / 2; }\\nll max(int x, ll y) { return max((ll)x, y); }\\nll max(ll x, int y) { return max(x, (ll)y); }\\nint min(int x, ll y) { return min((ll)x, y); }\\nint min(ll x, int y) { return min(x, (ll)y); }\\n// bit 演算系\\nll pow2(int i) { return 1LL << i; }\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\n// int allbit(int n) { return (1 << n) - 1; }\\nconstexpr ll mask(int n) { return (1LL << n) - 1; }\\n// int popcount(signed t) { return __builtin_popcount(t); }\\n// int popcount(ll t) { return __builtin_popcountll(t); }\\nint popcount(uint64_t t) { return __builtin_popcountll(t); }\\nstatic inline uint64_t popcount64(uint64_t x) {\\n uint64_t m1 = 0x5555555555555555ll;\\n uint64_t m2 = 0x3333333333333333ll;\\n uint64_t m4 = 0x0F0F0F0F0F0F0F0Fll;\\n uint64_t h01 = 0x0101010101010101ll;\\n\\n x -= (x >> 1) & m1;\\n x = (x & m2) + ((x >> 2) & m2);\\n x = (x + (x >> 4)) & m4;\\n\\n return (x * h01) >> 56;\\n}\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\nll rnd(ll l, ll r) { //[l, r)\\n#ifdef noimi\\n static mt19937_64 gen;\\n#else\\n static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());\\n#endif\\n return uniform_int_distribution<ll>(l, r - 1)(gen);\\n}\\nll rnd(ll n) { return rnd(0, n); }\\n\\ntemplate <class t> void random_shuffle(vc<t> &a) { rep(i, si(a)) swap(a[i], a[rnd(0, i + 1)]); }\\n\\nint in() {\\n int x;\\n cin >> x;\\n return x;\\n}\\nll lin() {\\n unsigned long long x;\\n cin >> x;\\n return x;\\n}\\n\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x) { return pair<T, S>(-x.first, -x.second); }\\ntemplate <class T, class S> pair<T, S> operator-(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi - y.fi, x.se - y.se); }\\ntemplate <class T, class S> pair<T, S> operator+(const pair<T, S> &x, const pair<T, S> &y) { return pair<T, S>(x.fi + y.fi, x.se + y.se); }\\ntemplate <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.fi, r.fi), min(l.se, r.se)); }\\ntemplate <class T, class S> pair<T, S> operator+=(pair<T, S> &l, const pair<T, S> &r) { return l = l + r; }\\ntemplate <class T, class S> pair<T, S> operator-=(pair<T, S> &l, const pair<T, S> &r) { return l = l - r; }\\ntemplate <class T> bool intersect(const pair<T, T> &l, const pair<T, T> &r) { return (l.se < r.se ? r.fi < l.se : l.fi < r.se); }\\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 constexpr bool operator<(const edge<T> &rhs) const noexcept { return cost < rhs.cost; }\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n friend ostream operator<<(ostream &os, edge &e) { return os << e.to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return res;\\n}\\nGraph getTreeFromPar(int n, int margin = 1) {\\n Graph res(n);\\n for(int i = 1; i < n; i++) {\\n int a;\\n cin >> a;\\n res[a - margin].emplace_back(i);\\n }\\n return 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 scan(a), scan(b), scan(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 res;\\n}\\nvoid add(Graph &G, int x, int y) { G[x].eb(y), G[y].eb(x); }\\ntemplate <class S, class T> void add(Wgraph<S> &G, int x, int y, T c) { G[x].eb(y, c), G[y].eb(x, c); }\\n\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\n\\nistream &operator>>(istream &is, i128 &v) {\\n string s;\\n is >> s;\\n v = 0;\\n for(int i = 0; i < (int)s.size(); i++) {\\n if(isdigit(s[i])) { v = v * 10 + s[i] - '0'; }\\n }\\n if(s[0] == '-') { v *= -1; }\\n return is;\\n}\\n\\nostream &operator<<(ostream &os, const i128 &v) {\\n if(v == 0) { return (os << \\\"0\\\"); }\\n i128 num = v;\\n if(v < 0) {\\n os << '-';\\n num = -num;\\n }\\n string s;\\n for(; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }\\n reverse(s.begin(), s.end());\\n return (os << s);\\n}\\nnamespace aux {\\ntemplate <typename T, unsigned N, unsigned L> struct tp {\\n static void output(std::ostream &os, const T &v) {\\n os << std::get<N>(v) << (&os == &cerr ? \\\", \\\" : \\\" \\\");\\n tp<T, N + 1, L>::output(os, v);\\n }\\n};\\ntemplate <typename T, unsigned N> struct tp<T, N, N> {\\n static void output(std::ostream &os, const T &v) { os << std::get<N>(v); }\\n};\\n} // namespace aux\\ntemplate <typename... Ts> std::ostream &operator<<(std::ostream &os, const std::tuple<Ts...> &t) {\\n if(&os == &cerr) { os << '('; }\\n aux::tp<std::tuple<Ts...>, 0, sizeof...(Ts) - 1>::output(os, t);\\n if(&os == &cerr) { os << ')'; }\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n if(&os == &cerr) { return os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\"; }\\n return os << p.first << \\\" \\\" << p.second;\\n}\\ntemplate <class Ch, class Tr, class Container> std::basic_ostream<Ch, Tr> &operator<<(std::basic_ostream<Ch, Tr> &os, const Container &x) {\\n bool f = true;\\n if(&os == &cerr) os << \\\"[\\\";\\n for(auto &y : x) {\\n if(&os == &cerr)\\n os << (f ? \\\"\\\" : \\\", \\\") << y;\\n else\\n os << (f ? \\\"\\\" : \\\" \\\") << y;\\n f = false;\\n }\\n if(&os == &cerr) os << \\\"]\\\";\\n return os;\\n}\\n\\n#ifdef noimi\\n#undef endl\\nvoid debug() { cerr << endl; }\\nvoid debug(bool) { cerr << endl; }\\ntemplate <class Head, class... Tail> void debug(bool is_front, Head head, Tail... tail) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << head;\\n debug(false, tail...);\\n}\\n\\n#define dump(args...) \\\\\\n { \\\\\\n vector<string> _debug = _split(#args, ','); \\\\\\n err(true, begin(_debug), args); \\\\\\n }\\n\\nvector<string> _split(const string &s, char c) {\\n vector<string> v;\\n stringstream ss(s);\\n string x;\\n while(getline(ss, x, c)) {\\n if(empty(v))\\n v.eb(x);\\n else {\\n bool flag = false;\\n for(auto [c, d] : {pair('(', ')'), pair('[', ']'), pair('{', '}')}) {\\n if(count(all(v.back()), c) != count(all(v.back()), d)) flag = true;\\n }\\n if(flag)\\n v.back() += \\\",\\\" + x;\\n else\\n v.eb(x);\\n }\\n }\\n return move(v);\\n}\\n\\nvoid err(bool, vector<string>::iterator) { cerr << endl; }\\ntemplate <typename T, typename... Args> void err(bool is_front, vector<string>::iterator it, T a, Args... args) {\\n if(!is_front) cerr << \\\", \\\";\\n cerr << it->substr((*it)[0] == ' ', (*it).size()) << \\\" = \\\" << a, err(false, ++it, args...);\\n}\\n\\n// #define dump(...) cerr << #__VA_ARGS__ << \\\" : \\\", debug(true, __VA_ARGS__)\\n#else\\n#define dump(...) static_cast<void>(0)\\n#define dbg(...) static_cast<void>(0)\\n#endif\\nvoid OUT() { cout << endl; }\\ntemplate <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {\\n cout << head;\\n if(sizeof...(tail)) cout << ' ';\\n OUT(tail...);\\n}\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\ntemplate <class T, class S> constexpr pair<T, S> inf<pair<T, S>> = {inf<T>, inf<S>};\\n\\ntemplate <class F> struct REC {\\n F f;\\n REC(F &&f_) : f(std::forward<F>(f_)) {}\\n template <class... Args> auto operator()(Args &&...args) const { return f(*this, std::forward<Args>(args)...); }\\n};\\n\\ntemplate <class S> vector<pair<S, int>> runLength(const vector<S> &v) {\\n vector<pair<S, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\nvector<pair<char, int>> runLength(const string &v) {\\n vector<pair<char, int>> res;\\n for(auto &e : v) {\\n if(res.empty() or res.back().fi != e)\\n res.eb(e, 1);\\n else\\n res.back().se++;\\n }\\n return res;\\n}\\n\\nint toint(const char &c, const char start = 'a') { return c - start; }\\nint toint(const char &c, const string &chars) { return find(all(chars), c) - begin(chars); }\\nint alphabets_to_int(const char &c) { return (islower(c) ? c - 'a' : c - 'A' + 26); }\\ntemplate <typename T> auto toint(const T &v, const char &start = 'a') {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\ntemplate <typename T> auto toint(const T &v, const string &start) {\\n vector<decltype(toint(v[0]))> ret;\\n ret.reserve(v.size());\\n for(auto &&e : v) ret.emplace_back(toint(e, start));\\n return ret;\\n}\\n// a -> 0, A -> 26\\ntemplate <typename T> auto alphabets_to_int(const T &s) {\\n vector<decltype(alphabets_to_int(s[0]))> res;\\n res.reserve(s.size());\\n for(auto &&e : s) { res.emplace_back(alphabets_to_int(e)); }\\n return res;\\n}\\n\\ntemplate <class T, class F> T bin_search(T ok, T ng, const F &f) {\\n while(abs(ok - ng) > 1) {\\n T mid = ok + ng >> 1;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_double(T ok, T ng, const F &f, int iter = 80) {\\n while(iter--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\nstruct Setup_io {\\n Setup_io() {\\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\\n cout << fixed << setprecision(11);\\n }\\n} setup_io;\\n\\n#pragma endregion\\n\\nnamespace segtree_impl {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while(!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace segtree_impl\\n\\nnamespace segtree_impl {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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--) { update(i); }\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S operator[](int k) const { return get(k); }\\n\\n S prod(int l, int r) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(r > _n) r = _n;\\n if(l > r) return e();\\n#endif\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(l > _n) l = _n;\\n#endif\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(r < 0) r = 0;\\n if(r > _n) r = _n;\\n#endif\\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\\n os << \\\"{\\\";\\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \\\"\\\" : \\\", \\\");\\n return os << \\\"}\\\";\\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\\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\\ntemplate <typename T> T min_e() { return inf<T>; }\\ntemplate <typename T> T max_e() { return -inf<T>; }\\ntemplate <typename T> T plus_e() { return 0; }\\n\\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\\n\\n} // namespace segtree_impl\\nusing segtree_impl::RmT;\\nusing segtree_impl::RMT;\\nusing segtree_impl::RST;\\nusing segtree_impl::segtree;\\n\\nint main() {\\n INT(n);\\n VEC(ll, a, n);\\n auto r = RUI(a);\\n vector<tuple<ll, int, int>> v;\\n rep(i, n) rep(j, i + 1, n + 1) v.eb(r[j] - r[i], i, j);\\n sort(all(v), [](auto x, auto y) {\\n auto [a, i, j] = x;\\n auto [b, ii, jj] = y;\\n if(a != b) return a < b;\\n return i > ii;\\n });\\n // dump(v);\\n vpi dp(n + 1, pii(-inf<int>, 0));\\n\\n dp[0] = pii(0, 0);\\n fore(_, l, r, v) {\\n if(dp[l].fi < 0) continue;\\n if(chmax(dp[r].fi, dp[l].fi + 1)) dp[r].se = l;\\n }\\n OUT(dp[n].fi);\\n vi ans;\\n int now = n;\\n while(now) {\\n now = dp[now].se;\\n if(now) ans.eb(now);\\n }\\n REV(ans);\\n OUT(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 136008,\n \"score_of_the_acc\": -0.8405,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2430_6126552\",\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>\\n#include<numeric>\\n#include<functional>\\n#include<unordered_map>\\n#include<unordered_set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,LL> LP;\\nconst LL INF=1LL<<60;\\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}\\ntemplate<typename T> ostream& operator<<(ostream& os,const vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++){\\n if(i)os<<\\\" \\\";\\n os<<v1[i];\\n }\\n return os;\\n}\\ntemplate<typename T1,typename T2> ostream& operator<<(ostream& os,const pair<T1,T2>& p){\\n os<<p.first<<\\\" \\\"<<p.second;\\n return os;\\n}\\ntemplate<typename T> istream& operator>>(istream& is,vector<T>& v1){\\n int n=v1.size();\\n for(int i=0;i<n;i++)is>>v1[i];\\n return is;\\n}\\ntemplate<typename T1,typename T2> istream& operator>>(istream& is,pair<T1,T2>& p){\\n is>>p.first>>p.second;\\n return is;\\n}\\n\\nnamespace sol{\\n\\n void solve(){\\n int n,m;\\n int i,j,k;\\n LL a,b,c;\\n cin>>n;\\n vector<LL> v1(n),v2(n+1);\\n vector<vector<LL>> dp(n+3,vector<LL>(n+3,-1));\\n vector<vector<int>> bef(n+3,vector<int>(n+3));\\n cin>>v1;\\n for(i=0;i<n;i++){\\n v2[i+1]=v2[i]+v1[i];\\n }\\n for(i=0;i<n;i++){\\n vector<LL> va(n+4,INF),vb(n+4,-2);\\n if(i==0)va[0]=-INF,vb[0]=-1;\\n for(j=0;j<i;j++){\\n if(dp[j][i]==-1)continue;\\n b=v2[i]-v2[j]+v2[i]+1;\\n c=dp[j][i]+1;\\n if(va[c]>b){\\n va[c]=b;\\n vb[c]=j;\\n }\\n }\\n for(j=n-1;j>=0;j--){\\n if(va[j+1]<va[j]){\\n va[j]=va[j+1];\\n vb[j]=-1;\\n }\\n }\\n for(j=i+1;j<=n;j++){\\n auto itr=upper_bound(va.begin(),va.end(),v2[j]);\\n if(itr==va.begin())continue;\\n assert(itr!=va.end());\\n itr--;\\n k=itr-va.begin();\\n assert(vb[k]!=-2);\\n dp[i][j]=k;\\n bef[i][j]=vb[k];\\n }\\n }\\n int s=-1;\\n a=-1;\\n for(i=0;i<n;i++){\\n if(s<dp[i][n]){\\n s=dp[i][n];\\n a=i,b=n;\\n }\\n }\\n assert(a!=-1);\\n vector<int> vs;\\n for(i=0;i<n && a>0;i++){\\n vs.push_back(a);\\n c=bef[a][b];\\n b=a,a=c;\\n }\\n assert(a==0);\\n assert(vs.size()==s);\\n reverse(vs.begin(),vs.end());\\n cout<<s+1<<endl;\\n cout<<vs<<endl;\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n sol::solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 191476,\n \"score_of_the_acc\": -1.0305,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2430_6041853\",\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=210005,INF=1<<29;\\n\\n// BIT セグ木 遅延セグ木 のみ\\n\\n// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9\\n// (based on AtCoder STL)\\n\\n#include <algorithm>\\n#include <array>\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\nnamespace atcoder {\\n namespace internal {\\n int ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n }\\n int bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n }\\n } // namespace internal\\n \\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n \\n namespace internal {\\n \\n#ifndef _MSC_VER\\n template <class T>\\n using is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n \\n template <class T>\\n using is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n \\n#else\\n \\n template <class T> using is_integral = typename std::is_integral<T>;\\n \\n template <class T>\\n using is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n \\n template <class T>\\n using to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n \\n#endif\\n \\n template <class T>\\n using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n \\n template <class T>\\n using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n \\n template <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n \\n } // namespace internal\\n \\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n \\n template <class T> struct fenwick_tree {\\n using U = internal::to_unsigned_t<T>;\\n \\n public:\\n fenwick_tree() : _n(0) {}\\n fenwick_tree(int n) : _n(n), data(n) {}\\n \\n void add(int p, T x) {\\n assert(0 <= p && p < _n);\\n p++;\\n while (p <= _n) {\\n data[p - 1] += U(x);\\n p += p & -p;\\n }\\n }\\n \\n T sum(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n return sum(r) - sum(l);\\n }\\n \\n private:\\n int _n;\\n std::vector<U> data;\\n \\n U sum(int r) {\\n U s = 0;\\n while (r > 0) {\\n s += data[r - 1];\\n r -= r & -r;\\n }\\n return s;\\n }\\n };\\n \\n} // namespace atcoder\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <vector>\\nnamespace atcoder {\\n \\n template <class S,\\n S (*op)(S, S),\\n S (*e)(),\\n class F,\\n S (*mapping)(F, S),\\n F (*composition)(F, F),\\n F (*id)()>\\n struct lazy_segtree {\\n public:\\n lazy_segtree() : lazy_segtree(0) {}\\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\n d = std::vector<S>(2 * size, e());\\n lz = std::vector<F>(size, id());\\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\\n for (int i = size - 1; i >= 1; i--) {\\n update(i);\\n }\\n }\\n \\n void set(int p, S x) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n d[p] = x;\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n \\n S get(int p) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n return d[p];\\n }\\n \\n S prod(int l, int r) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return e();\\n \\n l += size;\\n r += size;\\n \\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push(r >> i);\\n }\\n \\n S sml = e(), smr = e();\\n while (l < r) {\\n if (l & 1) sml = op(sml, d[l++]);\\n if (r & 1) smr = op(d[--r], smr);\\n l >>= 1;\\n r >>= 1;\\n }\\n \\n return op(sml, smr);\\n }\\n \\n S all_prod() { return d[1]; }\\n \\n void apply(int p, F f) {\\n assert(0 <= p && p < _n);\\n p += size;\\n for (int i = log; i >= 1; i--) push(p >> i);\\n d[p] = mapping(f, d[p]);\\n for (int i = 1; i <= log; i++) update(p >> i);\\n }\\n void apply(int l, int r, F f) {\\n assert(0 <= l && l <= r && r <= _n);\\n if (l == r) return;\\n \\n l += size;\\n r += size;\\n \\n for (int i = log; i >= 1; i--) {\\n if (((l >> i) << i) != l) push(l >> i);\\n if (((r >> i) << i) != r) push((r - 1) >> i);\\n }\\n \\n {\\n int l2 = l, r2 = r;\\n while (l < r) {\\n if (l & 1) all_apply(l++, f);\\n if (r & 1) all_apply(--r, f);\\n l >>= 1;\\n r >>= 1;\\n }\\n l = l2;\\n r = r2;\\n }\\n \\n for (int i = 1; i <= log; i++) {\\n if (((l >> i) << i) != l) update(l >> i);\\n if (((r >> i) << i) != r) update((r - 1) >> i);\\n }\\n }\\n \\n template <bool (*g)(S)> int max_right(int l) {\\n return max_right(l, [](S x) { return g(x); });\\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 += size;\\n for (int i = log; i >= 1; i--) push(l >> i);\\n S sm = e();\\n do {\\n while (l % 2 == 0) l >>= 1;\\n if (!g(op(sm, d[l]))) {\\n while (l < size) {\\n push(l);\\n l = (2 * l);\\n if (g(op(sm, d[l]))) {\\n sm = op(sm, d[l]);\\n l++;\\n }\\n }\\n return l - size;\\n }\\n sm = op(sm, d[l]);\\n l++;\\n } while ((l & -l) != l);\\n return _n;\\n }\\n \\n template <bool (*g)(S)> int min_left(int r) {\\n return min_left(r, [](S x) { return g(x); });\\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 += size;\\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\\n S sm = e();\\n do {\\n r--;\\n while (r > 1 && (r % 2)) r >>= 1;\\n if (!g(op(d[r], sm))) {\\n while (r < size) {\\n push(r);\\n r = (2 * r + 1);\\n if (g(op(d[r], sm))) {\\n sm = op(d[r], sm);\\n r--;\\n }\\n }\\n return r + 1 - size;\\n }\\n sm = op(d[r], sm);\\n } while ((r & -r) != r);\\n return 0;\\n }\\n \\n private:\\n int _n, size, log;\\n std::vector<S> d;\\n std::vector<F> lz;\\n \\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n void all_apply(int k, F f) {\\n d[k] = mapping(f, d[k]);\\n if (k < size) lz[k] = composition(f, lz[k]);\\n }\\n void push(int k) {\\n all_apply(2 * k, lz[k]);\\n all_apply(2 * k + 1, lz[k]);\\n lz[k] = id();\\n }\\n };\\n \\n} // namespace atcoder\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n \\n template <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 = internal::ceil_pow2(_n);\\n size = 1 << log;\\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 atcoder\\n\\nusing T=int;\\n\\nT f(T a,T b){\\n return max(a,b);\\n}\\n\\nT ti(){\\n return -INF;\\n}\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int N;cin>>N;\\n vector<ll> A(N),rui(N+1);\\n for(int i=0;i<N;i++){\\n cin>>A[i];\\n rui[i+1]=rui[i]+A[i];\\n }\\n vector<vector<ll>> diff(N+1);\\n diff[0].push_back(-INF);\\n for(int i=1;i<=N;i++){\\n diff[i].resize(i+1);\\n for(int j=0;j<i;j++){\\n diff[i][j]=rui[i]-rui[j];\\n }\\n diff[i].back()=rui[i];\\n diff[i].push_back(-INF);\\n sort(all(diff[i]));\\n diff[i].erase(unique(all(diff[i])),diff[i].end());\\n }\\n \\n vector<atcoder::segtree<T,f,ti>> seg(N+1);\\n \\n seg[0]=atcoder::segtree<T,f,ti>(1);\\n seg[0].set(0,0);\\n \\n for(int i=1;i<=N;i++){\\n seg[i]=atcoder::segtree<T,f,ti>(si(diff[i]));\\n for(int j=0;j<i;j++){\\n ll x=rui[i]-rui[j];\\n int k=lower_bound(all(diff[i]),x)-diff[i].begin();\\n T res=seg[i].get(k);\\n chmax(res,seg[j].prod(0,lower_bound(all(diff[j]),x)-diff[j].begin())+1);\\n seg[i].set(k,res);\\n //cout<<i<<\\\" \\\"<<j<<\\\" \\\"<<res.fi<<endl;\\n }\\n }\\n \\n cout<<seg[N].all_prod()<<endl;\\n vector<int> ans;\\n int i=N;\\n while(1){\\n auto ma=seg[i].all_prod();\\n int to=-1;\\n for(int j=0;j<i;j++){\\n ll x=rui[i]-rui[j];\\n int k=lower_bound(all(diff[i]),x)-diff[i].begin();\\n if(seg[j].prod(0,lower_bound(all(diff[j]),x)-diff[j].begin())+1==ma&&seg[i].get(k)==ma) to=j;\\n }\\n i=to;\\n if(i<=0) break;\\n ans.push_back(i);\\n }\\n reverse(all(ans));\\n for(int i=0;i<si(ans);i++){\\n if(i) cout<<\\\" \\\";\\n cout<<ans[i];\\n }\\n cout<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1500,\n \"memory_kb\": 176012,\n \"score_of_the_acc\": -1.2995,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2430_6014492\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <numeric>\\n#include <limits>\\n#include <vector>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while (!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nnamespace atcoder {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S prod(int l, int r) const {\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\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 atcoder\\n\\nconstexpr long long inf = std::numeric_limits<long long>::max() / 2;\\n\\nusing S = std::pair<long long, int>;\\n\\nconstexpr S op(S x, S y) {\\n return x > y ? x : y;\\n}\\nconstexpr S e() {\\n return { -inf, -1 };\\n}\\n\\nint main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n\\n int n;\\n std::cin >> n;\\n std::vector<long long> s(n + 1, 0);\\n for (int i = 1; i <= n; ++i) {\\n std::cin >> s[i];\\n s[i] += s[i - 1];\\n }\\n\\n std::vector dp(n + 1, std::vector(n + 1, inf));\\n std::vector pr(n + 1, std::vector(n + 1, -1));\\n\\n dp[0][0] = -inf;\\n\\n for (int num = 0; num < n; ++num) {\\n std::vector<int> p(n + 1);\\n std::iota(p.begin(), p.end(), 0);\\n std::sort(p.begin(), p.end(), [&](int i, int j) {\\n long long ai = dp[num][i] + s[i];\\n long long aj = dp[num][j] + s[j];\\n return ai == aj ? i < j : ai < aj;\\n });\\n std::vector<int> q(n + 1);\\n for (int i = 0; i <= n; ++i) {\\n q[p[i]] = i;\\n }\\n\\n std::vector<long long> a(n + 1);\\n for (int i = 0; i <= n; ++i) {\\n a[i] = dp[num][p[i]] + s[p[i]];\\n }\\n atcoder::segtree<S, op, e> seg(n + 1);\\n\\n for (int j = 0; j <= n; ++j) {\\n int r = std::lower_bound(a.begin(), a.end(), s[j]) - a.begin();\\n auto [v, k] = seg.prod(0, r);\\n if (k >= 0) {\\n dp[num + 1][j] = s[j] - v;\\n pr[num + 1][j] = k;\\n }\\n seg.set(q[j], { s[j], j });\\n }\\n }\\n std::vector<int> sep;\\n for (int num = n; num > 0; --num) {\\n if (pr[num][n] < 0) continue;\\n for (int cur = pr[num][n]; cur > 0; cur = pr[--num][cur]) {\\n sep.push_back(cur);\\n }\\n break;\\n }\\n std::reverse(sep.begin(), sep.end());\\n const int sz = sep.size();\\n std::cout << sz + 1 << '\\\\n';\\n for (int i = 0; i < sz; ++i) {\\n std::cout << sep[i];\\n if (i + 1 < sz) std::cout << ' ';\\n }\\n std::cout << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2110,\n \"memory_kb\": 191340,\n \"score_of_the_acc\": -1.5587,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2430_6014428\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iostream>\\n#include <numeric>\\n#include <limits>\\n#include <vector>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while (!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nnamespace atcoder {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S prod(int l, int r) const {\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\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 atcoder\\n\\nconstexpr long long inf = std::numeric_limits<long long>::max() / 2;\\n\\nusing S = std::pair<long long, int>;\\n\\nconstexpr S op(S x, S y) {\\n return x > y ? x : y;\\n}\\nconstexpr S e() {\\n return { -inf, -1 };\\n}\\n\\ntemplate <typename T>\\nbool chmin(T &x, const T &y) {\\n if (x <= y) return false;\\n x = y;\\n return true;\\n}\\n\\nint main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n\\n int n;\\n std::cin >> n;\\n std::vector<long long> s(n + 1, 0);\\n for (int i = 1; i <= n; ++i) {\\n std::cin >> s[i];\\n s[i] += s[i - 1];\\n }\\n std::vector dp(n + 1, std::vector(n + 1, inf));\\n std::vector pr(n + 1, std::vector(n + 1, -1));\\n dp[0][0] = 0;\\n for (int num = 0; num < n; ++num) {\\n std::vector<int> p(n + 1);\\n std::iota(p.begin(), p.end(), 0);\\n std::sort(p.begin(), p.end(), [&](int i, int j) {\\n long long ai = dp[num][i] + s[i];\\n long long aj = dp[num][j] + s[j];\\n return ai == aj ? i < j : ai < aj;\\n });\\n std::vector<int> q(n + 1);\\n for (int i = 0; i <= n; ++i) {\\n q[p[i]] = i;\\n }\\n\\n std::vector<long long> a(n + 1);\\n for (int i = 0; i <= n; ++i) {\\n a[i] = dp[num][p[i]] + s[p[i]];\\n }\\n atcoder::segtree<S, op, e> seg(n + 1);\\n\\n for (int j = 0; j <= n; ++j) {\\n int r = std::lower_bound(a.begin(), a.end(), s[j]) - a.begin();\\n auto [v, k] = seg.prod(0, r);\\n if (k >= 0) {\\n dp[num + 1][j] = s[j] - v;\\n pr[num + 1][j] = k;\\n }\\n seg.set(q[j], { s[j], j });\\n }\\n }\\n std::vector<int> sep;\\n for (int num = n; num > 0; --num) {\\n if (dp[num][n] == inf) continue;\\n for (int cur = pr[num][n]; cur > 0; cur = pr[--num][cur]) {\\n sep.push_back(cur);\\n }\\n break;\\n }\\n std::reverse(sep.begin(), sep.end());\\n const int sz = sep.size();\\n std::cout << sz + 1 << '\\\\n';\\n for (int i = 0; i < sz; ++i) {\\n std::cout << sep[i];\\n if (i + 1 < sz) std::cout << ' ';\\n }\\n std::cout << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.03333333333333333,\n \"time_ms\": 100,\n \"memory_kb\": 14752,\n \"score_of_the_acc\": -0.0231,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2430_6004975\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\nll modulo(ll n,ll d){return (n%d+d)%d;};\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n;cin>>n;\\n vector<ll>a(n);\\n rep(i,0,n)cin>>a[i];\\n vector<ll>b(n+1);\\n rep(i,0,n)b[i+1]=a[i]+b[i];\\n auto ord=ascend(b);\\n const int inf=1e9;\\n auto dp=vec(n+1,n+1,-inf);\\n auto from=vec(n+1,n+1,-1);\\n rep(i,1,n+1){\\n dp[0][i]=1;\\n }\\n rep(i,1,n){\\n ll mx=-inf;\\n ll pre=-1;\\n ll idx=n;\\n for(auto j:ord){\\n while(idx>=0&&b[i]-b[ord[idx]]<b[j]-b[i]){\\n if(ord[idx]<i&&chmax(mx,dp[ord[idx]][i]+1)){\\n pre=ord[idx];\\n };\\n idx--;\\n }\\n dp[i][j]=mx;\\n from[i][j]=pre;\\n }\\n }\\n ll pre=-1,mx=-inf;\\n //debug(dp);\\n rep(i,0,n){\\n if(chmax(mx,dp[i][n]))pre=i;\\n }\\n vector<ll>ret;\\n ll r=n;\\n while(pre>0){\\n ret.PB(pre);\\n ll tmppre=pre;\\n pre=from[pre][r];\\n r=tmppre;\\n }\\n reverse(ALL(ret));\\n cout<<mx<<endl;\\n debug(ret);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 128484,\n \"score_of_the_acc\": -0.6524,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2430_6004955\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define endl '\\\\n'\\n#define lfs cout<<fixed<<setprecision(10)\\n#define ALL(a) (a).begin(),(a).end()\\n#define ALLR(a) (a).rbegin(),(a).rend()\\n#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())\\n#define spa << \\\" \\\" <<\\n#define fi first\\n#define se second\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define EB emplace_back\\n#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)\\n#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)\\nusing ll = long long;\\nusing ld = long double;\\nconst ll MOD1 = 1e9+7;\\nconst ll MOD9 = 998244353;\\nconst ll INF = 1e18;\\nusing P = pair<ll, ll>;\\ntemplate<typename T> using PQ = priority_queue<T>;\\ntemplate<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}\\ntemplate<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}\\nll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}\\nvoid ans1(bool x){if(x) cout<<\\\"Yes\\\"<<endl;else cout<<\\\"No\\\"<<endl;}\\nvoid ans2(bool x){if(x) cout<<\\\"YES\\\"<<endl;else cout<<\\\"NO\\\"<<endl;}\\nvoid ans3(bool x){if(x) cout<<\\\"Yay!\\\"<<endl;else cout<<\\\":(\\\"<<endl;}\\ntemplate<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} \\ntemplate<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);}; \\ntemplate<typename T>void debug(const T &v,ll h,ll w,string sv=\\\" \\\"){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};\\ntemplate<typename T>void debug(const T &v,ll n,string sv=\\\" \\\"){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};\\ntemplate<typename T>void debug(const vector<T>&v){debug(v,v.size());}\\ntemplate<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}\\ntemplate<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<\\\" \\\";st.pop_front();}cout<<endl;}\\ntemplate<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<\\\" \\\";st.pop();}cout<<endl;}\\ntemplate<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<\\\" \\\";cout<<endl;}\\ntemplate<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<\\\"[\\\"<<z.first<<\\\"]=\\\"<<z.second<<\\\",\\\";cout<<endl;}\\ntemplate<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}\\nll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}\\nvector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};\\ntemplate<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}\\ntemplate<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}\\ntemplate<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << \\\" \\\" << p.second;}\\ntemplate<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << \\\" \\\";cout<<\\\"|\\\"; return os;}\\ntemplate<typename T>void rearrange(vector<int>&ord, vector<T>&v){\\n auto tmp = v;\\n for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];\\n}\\ntemplate<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){\\n rearrange(ord, head);\\n rearrange(ord, tail...);\\n}\\ntemplate<typename T> vector<int> ascend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];});\\n return ord;\\n}\\ntemplate<typename T> vector<int> descend(const vector<T>&v){\\n vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];});\\n return ord;\\n}\\nll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}\\nll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}\\nll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}\\nll modulo(ll n,ll d){return (n%d+d)%d;};\\ntemplate<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}\\ntemplate<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}\\ntemplate<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};\\ntemplate<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};\\n//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());\\nint popcount(ll x){return __builtin_popcountll(x);};\\nint poplow(ll x){return __builtin_ctzll(x);};\\nint pophigh(ll x){return 63 - __builtin_clzll(x);};\\ntemplate<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};\\ntemplate<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};\\ntemplate<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};\\nll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}\\nll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}\\nll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}\\ntemplate< typename T = int >\\nstruct edge {\\n int to;\\n T cost;\\n int id;\\n edge():id(-1){};\\n edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}\\n operator int() const { return to; }\\n};\\n\\ntemplate<typename T>\\nusing Graph = vector<vector<edge<T>>>;\\ntemplate<typename T>\\nGraph<T>revgraph(const Graph<T> &g){\\n Graph<T>ret(g.size());\\n for(int i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n int to = e.to;\\n e.to = i;\\n ret[to].push_back(e);\\n }\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){\\n Graph<T> ret(n);\\n for(int es = 0; es < m; es++){\\n int u,v;\\n T w=1;\\n cin>>u>>v;u-=indexed,v-=indexed;\\n if(weighted)cin>>w;\\n ret[u].emplace_back(v,w,es);\\n if(!directed)ret[v].emplace_back(u,w,es);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nGraph<T> readParent(int n,int indexed=1,bool directed=true){\\n Graph<T>ret(n);\\n for(int i=1;i<n;i++){\\n int p;cin>>p;\\n p-=indexed;\\n ret[p].emplace_back(i);\\n if(!directed)ret[i].emplace_back(p);\\n }\\n return ret;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n ll res=0,buf=0;\\n bool judge = true;\\n ll n;cin>>n;\\n vector<ll>a(n);\\n rep(i,0,n)cin>>a[i];\\n vector<ll>b(n+1);\\n rep(i,0,n)b[i+1]=a[i]+b[i];\\n auto ord=ascend(b);\\n const int inf=1e9;\\n auto dp=vec(n+1,n+1,-inf);\\n auto from=vec(n+1,n+1,-1);\\n rep(i,1,n+1){\\n dp[0][i]=1;\\n }\\n rep(i,1,n){\\n ll mx=-inf;\\n ll pre=-1;\\n ll idx=n;\\n for(auto j:ord){\\n while(idx>=0&&b[i]-b[ord[idx]]<b[j]-b[i]){\\n if(chmax(mx,dp[ord[idx]][i]+1)){\\n pre=ord[idx];\\n };\\n idx--;\\n }\\n dp[i][j]=mx;\\n from[i][j]=pre;\\n }\\n }\\n ll pre=-1,mx=-inf;\\n //debug(dp);\\n rep(i,0,n){\\n if(chmax(mx,dp[i][n]))pre=i;\\n }\\n vector<ll>ret;\\n ll r=n;\\n while(pre>0){\\n ret.PB(pre);\\n ll tmppre=pre;\\n pre=from[pre][r];\\n r=tmppre;\\n }\\n reverse(ALL(ret));\\n cout<<mx<<endl;\\n debug(ret);\\n return 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 20,\n \"memory_kb\": 34444,\n \"score_of_the_acc\": -0.1065,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2430_5925719\",\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>;\\nusing P3 = pair<ll,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-9;\\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\\n// MLEが厳しい\\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 REP(i,n) cin >> a[i];\\n vector<ll> cum(n+1);\\n REP(i,n) cum[i+1] = cum[i]+a[i];\\n vector<vector<int> > dp(n+1), rev(n+1); // dp[i][j] 末尾の区間が[j,i)であるときの最大長さ\\n REP(i,n+1){\\n dp[i].resize(i+1,-1);\\n rev[i].resize(i+1);\\n }\\n // 初期条件\\n REP(i,n+1){\\n dp[i][0] = 1;\\n }\\n for(int i=1;i<n;i++){\\n // 末尾の区間和でソート\\n vector<pair<ll,int>> val;\\n for(int j=0;j<=i;j++){\\n if(dp[i][j] < 0) continue;\\n val.emplace_back(cum[i]-cum[j],j);\\n }\\n if(val.empty()) continue;\\n sort(ALL(val));\\n // 末尾を昇順に見た時のdp[i][j]の累積maxを求める\\n vector<P> max_dp;\\n for(auto p : val){\\n int k = p.second;\\n max_dp.emplace_back(dp[i][k],k);\\n }\\n for(int j=0;j<(int)max_dp.size()-1;j++) chmax(max_dp[j+1], max_dp[j]);\\n // [i,k)で区切ったときの更新\\n for(int k=i+1;k<=n;k++){\\n auto itr = lower_bound(ALL(val), make_pair(cum[k]-cum[i],-1));\\n if(itr == val.begin()) continue;\\n int idx = (--itr) - val.begin();\\n auto [x,j] = max_dp[idx];\\n if(chmax(dp[k][i], x+1)){\\n rev[k][i] = j;\\n }\\n }\\n\\n }\\n int m = 0, idx = 0;\\n REP(i,n) if(chmax(m, dp[n][i])) idx = i;\\n cout << m << endl;\\n vector<int> c;\\n for(int k=0,i=idx,j=n;k<m-1;k++){\\n c.push_back(i);\\n int nxt = rev[j][i];\\n j = i;\\n i = nxt;\\n }\\n reverse(ALL(c));\\n for(int i=0;i<m-1;i++){\\n if(i>0) cout << \\\" \\\";\\n cout << c[i];\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 66472,\n \"score_of_the_acc\": -0.3923,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2430_5925687\",\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>;\\nusing P3 = pair<ll,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-9;\\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\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<ll> a(n);\\n REP(i,n) cin >> a[i];\\n vector<ll> cum(n+1);\\n REP(i,n) cum[i+1] = cum[i]+a[i];\\n vector<vector<int> > dp(n+1), rev(n+1);\\n REP(i,n+1){\\n dp[i].resize(i+1,-1);\\n rev[i].resize(i+1);\\n }\\n REP(i,n+1){\\n dp[i][0] = 1;\\n }\\n for(int i=1;i<n;i++){\\n vector<pair<ll,int>> v;\\n for(int j=0;j<=i;j++){\\n if(dp[i][j] < 0) continue;\\n v.emplace_back(cum[i]-cum[j],j);\\n }\\n if(v.empty()) continue;\\n sort(ALL(v));\\n vector<P> ls;\\n for(auto p : v){\\n int k = p.second;\\n ls.emplace_back(dp[i][k],k);\\n }\\n for(int j=0;j<(int)ls.size()-1;j++) chmax(ls[j+1], ls[j]);\\n for(int k=i+1;k<=n;k++){\\n auto itr = lower_bound(ALL(v), make_pair(cum[k]-cum[i],-1));\\n if(itr == v.begin()) continue;\\n int idx = (--itr) - v.begin();\\n auto [x,j] = ls[idx];\\n if(chmax(dp[k][i], x+1)){\\n rev[k][i] = j;\\n }\\n }\\n\\n }\\n int m = 0, idx = 0;\\n REP(i,n) if(chmax(m, dp[n][i])) idx = i;\\n cout << m << endl;\\n vector<int> c;\\n for(int k=0,i=idx,j=n;k<m-1;k++){\\n c.push_back(i);\\n int nxt = rev[j][i];\\n j = i;\\n i = nxt;\\n }\\n reverse(ALL(c));\\n for(int i=0;i<m-1;i++){\\n if(i>0) cout << \\\" \\\";\\n cout << c[i];\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 410,\n \"memory_kb\": 66412,\n \"score_of_the_acc\": -0.392,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2430_5924585\",\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()\\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-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n 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;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nll dp[4040][4040];\\nint pre[4040][4040];\\n\\nint main(){\\n int n; cin >> n;\\n vl a(n); rep(i,n) cin >> a[i];\\n vl s(n+1); rep(i,n) s[i+1] = s[i] + a[i];\\n rep(i,n+1) rep(j,n+1){\\n dp[i][j] = linf;\\n pre[i][j] = -1;\\n }\\n dp[0][0] = -linf;\\n rep(i,n){\\n rep(j,i+1){\\n ll S = s[i+1] - s[j];\\n int ok = -1, ng = n+1;\\n while(ng-ok > 1){\\n int mid = (ok+ng) / 2;\\n if(dp[j][mid] < S) ok = mid;\\n else ng = mid;\\n }\\n if(ok >= 0){\\n if(chmin(dp[i+1][ok+1], S)) pre[i+1][ok+1] = j;\\n }\\n }\\n for(int j=n-1; j>=0; j--){\\n if(chmin(dp[i+1][j], dp[i+1][j+1])) pre[i+1][j] = pre[i+1][j+1];\\n }\\n }\\n for(int i=n; i>=0; i--){\\n if(dp[n][i] < linf){\\n cout << i << \\\"\\\\n\\\";\\n int now = n;\\n int pos = i;\\n vl ans;\\n while(1){\\n now = pre[now][pos];\\n if(now == 0) break;\\n ans.push_back(now);\\n pos--;\\n }\\n assert(ans.size() == i-1);\\n reverse(all(ans));\\n rep(j,i-1) cout << ans[j] << \\\" \\\\n\\\"[j==i-2];\\n return 0;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 193864,\n \"score_of_the_acc\": -1.1533,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2430_5922413\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.29 17:37:47 */\\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 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\\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\\t// debug(a);\\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\\nll dp[4020][4020];\\nvector<int> solve(int n, vll a) {\\n\\t// VV<pair<ll, int>> dp(n + 1, V<pair<ll, int>>(n + 1, pair(INF, -1)));\\n\\n\\trep(i, n + 1) rep(j, n + 1) dp[i][j] = INF;\\n\\tvll acc(n + 1, 0LL);\\n\\trep(i, n) acc[i + 1] = acc[i] + a[i];\\n\\n\\tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\\n\\n\\trep(i, 1, n + 1) dp[i][1] = sum(0, i);\\n\\n\\tint i = -1, j = n + 1;\\n\\trep(from, 1, n + 1) {\\n\\t\\tdrep(i, n) { chmin(dp[from][i], dp[from][i + 1]); }\\n\\t\\trep(nxt, from + 1, n + 1) {\\n\\t\\t\\tconst ll val_nxt = sum(from, nxt);\\n\\t\\t\\tfor(i = -1, j = n + 1; j - i > 1;) {\\n\\t\\t\\t\\tint k = (i + j) / 2;\\n\\t\\t\\t\\tif(dp[from][k] >= val_nxt) {\\n\\t\\t\\t\\t\\tj = k;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\ti = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tswap(i, j);\\n\\t\\t\\tif(!i || i > n) continue;\\n\\t\\t\\tchmin(dp[nxt][i], val_nxt);\\n\\t\\t}\\n\\t}\\n\\n\\tconst ll val_max = 1e15;\\n\\n\\tint ans = 0;\\n\\trep(i, n + 1) if(dp[n][i] < val_max) ans = i;\\n\\n\\tvector<int> ret;\\n\\tint now = n;\\n\\n\\twhile(ans) {\\n\\t\\tll val = dp[now][ans];\\n\\t\\tfor(int pre_idx = now - 1; pre_idx >= 0; pre_idx--) {\\n\\t\\t\\tif(pre_idx == 0 || dp[pre_idx][ans - 1] < val) {\\n\\t\\t\\t\\tret.push_back(pre_idx);\\n\\t\\t\\t\\tnow = pre_idx;\\n\\t\\t\\t\\tans--;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tret.pop_back();\\n\\treverse(all(ret));\\n\\n\\t// {\\n\\t// \\tauto c = ret;\\n\\t// \\tc.insert(c.begin(), 0);\\n\\t// \\tc.push_back(n);\\n\\t// \\tint cs = c.size();\\n\\t// \\tll val;\\n\\t// \\trep(i, cs - 1) {\\n\\t// \\t\\tint l, r;\\n\\t// \\t\\tl = c[i];\\n\\t// \\t\\tr = c[i + 1];\\n\\t// \\t\\tif(i) {\\n\\t// \\t\\t\\tif(val >= sum(l, r)) {\\n\\t// \\t\\t\\t\\t// debug(ret);\\n\\t// \\t\\t\\t\\texit(0);\\n\\t// \\t\\t\\t}\\n\\t// \\t\\t}\\n\\t// \\t\\tval = sum(l, r);\\n\\t// \\t}\\n\\t// }\\n\\n\\treturn ret;\\n}\\n\\n// int naive(int n, vll a) {\\n// \\tvll acc(n + 1, 0LL);\\n// \\trep(i, n) acc[i + 1] = acc[i] + a[i];\\n\\n// \\tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\\n\\n// \\tint ans = 1;\\n\\n// \\tauto judge = [&](vector<int> walls) {\\n// \\t\\tll val;\\n// \\t\\trep(i, int(walls.size()) - 1) {\\n// \\t\\t\\tint lef = walls[i];\\n// \\t\\t\\tint rig = walls[i + 1];\\n// \\t\\t\\tll val_now = sum(lef, rig);\\n// \\t\\t\\tif(lef && val >= val_now) {\\n// \\t\\t\\t\\treturn false;\\n// \\t\\t\\t}\\n// \\t\\t\\tval = val_now;\\n// \\t\\t}\\n// \\t\\treturn true;\\n// \\t};\\n\\n// \\tconst int bit_max = 1 << (n - 1);\\n// \\trep(bits, bit_max) {\\n// \\t\\tint pp = popcnt(bits) + 1;\\n// \\t\\tif(pp <= ans) continue;\\n// \\t\\tvector<int> walls = {0};\\n// \\t\\trep(i, n - 1) {\\n// \\t\\t\\tif(bits & (1 << i)) {\\n// \\t\\t\\t\\twalls.push_back(i + 1);\\n// \\t\\t\\t}\\n// \\t\\t}\\n// \\t\\twalls.push_back(n);\\n// \\t\\tif(judge(walls)) ans = pp;\\n// \\t}\\n\\n// \\treturn ans;\\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\\t// while(1) {\\n\\t// \\t// int n = 3;\\n\\t// \\tint n = rand() % 6 + 3;\\n\\t// \\tvll a(n);\\n\\t// \\t// // foa(t, a) t = rand() % 123456 - rand() % 60000;\\n\\t// \\t// vll a = {56346, -37076, -2330};\\n\\t// \\t// debug(n);\\n\\t// \\t// debug(a);\\n\\n\\t// \\t// int n = 8;\\n\\t// \\t// vll a = {-17405, 60160, 69055, 80555, -27834, 66437, 5030, -23590};\\n\\n\\t// \\tvector<int> res = solve(n, a);\\n\\t// \\t// debug(res);\\n\\n\\t// \\tint split_ans = naive(n, a);\\n\\t// \\t// debug(split_ans);;\\n\\n\\t// \\tauto err = [&]() {\\n\\t// \\t\\tdebug(res);\\n\\t// \\t\\tdebug(split_ans);\\n\\t// \\t\\texit(0);\\n\\t// \\t\\treturn;\\n\\t// \\t};\\n\\n\\t// \\tif(res.size() + 1 != split_ans) {\\n\\t// \\t\\terr();\\n\\t// \\t}\\n\\t// }\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tvll a(n);\\n\\t\\tfoa(t, a) cin >> t;\\n\\t\\tvector<int> res = solve(n, a);\\n\\t\\tprint(int(res.size()) + 1);\\n\\t\\tvout(res, 0);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 129196,\n \"score_of_the_acc\": -0.6823,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2430_5922175\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.29 17:37:47 */\\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\\nvector<int> solve(int n) {\\n\\tvll a(n);\\n\\tfoa(t, a) cin >> t;\\n\\n\\tVV<pair<ll, int>> dp(n + 1, V<pair<ll, int>>(n + 1, pair(INF, -1)));\\n\\t// dp[from_here][array_len] = pair(value_min, pre_idx);\\n\\n\\tvll acc(n + 1);\\n\\trep(i, n) acc[i + 1] = acc[i] + a[i];\\n\\n\\tauto sum = [&](int lf, int rg) { return acc[rg] - acc[lf]; };\\n\\n\\trep(i, 1, n + 1) dp[i][1] = pair(sum(0, i), 0);\\n\\n\\trep(from, 1, n) {\\n\\t\\trep(i, n) { chmin(dp[from][i], dp[from][i + 1]); }\\n\\t\\trep(nxt, from + 1, n + 1) {\\n\\t\\t\\tconst ll val_nxt = sum(from, nxt);\\n\\t\\t\\tint i = lb(dp[from], pair(val_nxt, -inf)) - 1;\\n\\t\\t\\tchmin(dp[nxt][i + 1], pair(val_nxt, from));\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\trep(i, n + 1) {\\n\\t\\tif(dp[n][i].first < INF) {\\n\\t\\t\\tans = i;\\n\\t\\t}\\n\\t}\\n\\n\\tvector<int> ret;\\n\\tint now = n;\\n\\twhile(now) {\\n\\t\\tint pre_idx = dp[now][ans].second;\\n\\t\\tret.push_back(pre_idx);\\n\\t\\tnow = pre_idx;\\n\\t\\tans--;\\n\\t}\\n\\n\\tret.pop_back();\\n\\treverse(all(ret));\\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 n;\\n\\twhile(cin >> n) {\\n\\t\\tvector<int> res = solve(n);\\n\\t\\tprint(int(res.size()) + 1);\\n\\t\\tvout(res, 0);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 40,\n \"memory_kb\": 65848,\n \"score_of_the_acc\": -0.282,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2430_5044042\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <algorithm>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\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 = internal::ceil_pow2(_n);\\n size = 1 << log;\\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 atcoder\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, int> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long double EPS = 1e-10;\\nconst long long INF = 1e18;\\nconst long double PI = acos(-1.0L);\\n//const ll mod = 1000000007;\\nll N;\\nll A[4005];\\nll Asum[4005];\\nll dp[4001][4001];\\nint from[4005][4005];\\nl_l e() {return {INF, -1};}\\nl_l op(l_l a, l_l b) {return min(a, b);}\\nusing segtree = atcoder::segtree<l_l, op, e>;\\n\\nint main() {\\n cin >> N;\\n for(int i = 0; i < N; i++) {\\n cin >> A[i];\\n Asum[i+1] = Asum[i] + A[i];\\n }\\n for(int i = 0; i <= N; i++) {\\n for(int j = 0; j <= N; j++) {\\n dp[i][j] = INF;\\n }\\n }\\n dp[0][0] = -INF;\\n ll ansm = 0;\\n for(ll m = 1; m <= N; m++) {\\n vector<l_l> a(N + 1);\\n for(int i = 0; i <= N; i++) {\\n a[i] = {INF, i};\\n }\\n segtree seg(a);\\n vector<l_l> v;\\n for(int i = 0; i < N; i++) {\\n v.push_back({dp[m-1][i] + Asum[i], i});\\n v.push_back({Asum[i+1], -i-1});\\n }\\n sort(v.begin(), v.end());\\n for(auto tmp : v) {\\n //cerr << tmp.first << \\\", \\\" << tmp.second << endl;\\n if(tmp.second >= 0) {\\n ll idx = tmp.second;\\n seg.set(idx, {-Asum[idx], idx});\\n } else {\\n ll idx = -tmp.second - 1;\\n auto val = seg.prod(0, idx + 1);\\n dp[m][idx+1] = val.first + Asum[idx+1];\\n from[m][idx+1] = val.second;\\n }\\n }\\n if(dp[m][N] <= 1e17) ansm = m;\\n /*\\n for(int i = 0; i <= N; i++) {\\n cerr << dp[m][i] << \\\" \\\";\\n }\\n cerr << endl;\\n */\\n }\\n //cerr << ansm << endl;\\n ll nowm = ansm;\\n ll nowidx = N;\\n vector<ll> ansidx(ansm - 1);\\n for(int i = ansm - 2; i >= 0; i--) {\\n nowidx = from[nowm][nowidx];\\n ansidx[i] = nowidx;\\n nowm--;\\n //cerr << nowidx << \\\" \\\";\\n }\\n //cerr << endl;\\n cout << ansm << endl;\\n for(int i = 0; i < ansidx.size(); i++) {\\n if(i != 0) cout << \\\" \\\";\\n cout << ansidx[i];\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3480,\n \"memory_kb\": 191536,\n \"score_of_the_acc\": -1.9557,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1391,"cells":{"group_id":{"kind":"string","value":"aoj_2431_cpp"},"problem_description":{"kind":"string","value":"引越し\n太郎君は引っ越しをすることになりました。太郎君はたくさんの荷物を持っているので、荷物の運搬を引っ越し業者に頼むことにしました。荷物はいろいろな重さの物があるので、わかりやすいように軽い方から順番に並べて置いてもらうように頼みましたが、引っ越し業者の人はばらばらの順番で荷物を置いていってしまいました。そこで太郎君は荷物を並べ替えようとしましたが、荷物は重いので運ぶのには体力が必要です。それぞれの荷物は今ある場所から他の荷物の間や荷物の端など好きな場所に運ぶことができますが、ある荷物を運ぶにはその荷物の重さと同じだけ体力を使います。太郎君はあまり体力がないので、できるだけ体力を使わずに荷物を軽い方から順番に並べる方法を考えることにしました。\nInput\nn\nx\n1\nx\n2\n...\nx\nn\nn\nは太郎君の持っている荷物の数を表す\nx\n1\nから\nx\nn\nはそれぞれの荷物の重さを表し、現在は\nx\n1\n、\nx\n2\n、…、\nx\nn\nの順に並んでいる\nConstraints\n1 ≤ n ≤ 10\n5\n1 ≤ x\ni\n≤ n (1 ≤ i ≤ n)\nx\ni\n≠ x\nj\n(\n1 ≤ i, j ≤ n\nかつ\ni ≠ j\n)\n入力はすべて整数で与えられる\nOutput\nS\n荷物を軽い方から順番に並べるのに必要な最小の体力の合計\nS\nを出力せよ、ただし最後に改行を出力せよ\nSample Input 1\n4\n1 4 2 3\nOutput for the Sample Input 1\n4\n重さ4の荷物を右端に運ぶと重さの軽い順になります\nSample Input 2\n5\n1 5 3 2 4\nOutput for the Sample Input 2\n7\n重さ2の荷物を重さ1の荷物の右側に運び、重さ5の荷物を右端に運ぶと重さの軽い順になります\nSample Input 3\n7\n1 2 3 4 5 6 7\nOutput for the Sample Input 3\n0\n最初から重さの軽い順に並んでいます\nSample Input 4\n8\n6 2 1 3 8 5 4 7\nOutput for the Sample Input 4\n19"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2431_10506310","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\n// base: bafcf8\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while(x < (unsigned int)(n)) x *= 2;\n return x;\n}\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while(!(n & (1 << x))) x++;\n return x;\n}\ntemplate<class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(vector<S>(n, e())) {}\n explicit segtree(const vector<S>& v) : _n(int(v.size())) {\n size = (int)bit_ceil((unsigned int)(_n));\n log = countr_zero((unsigned int)size);\n d = 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--) { update(i); }\n }\n\n void set(int p, S x) {\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) const { return d[p + size]; }\n\n S prod(int l, int r) const {\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() const { return d[1]; }\n\n template<class F> int max_right(int l, F f) {\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 } // faa03f\n\n template<class F> int min_left(int r, F f) {\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 } // efa466\n\n private:\n int _n, size, log;\n vector<S> d;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n};\n\nll op(ll a, ll b) {\n return max(a, b);\n}\nll e() {\n return 0LL;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll n; cin >> n;\n segtree<ll, op, e> seg(n + 1);\n rep(i, n) {\n ll x; cin >> x;\n seg.set(x, seg.prod(0, x) + x);\n }\n cout << n * (n + 1) / 2 - seg.all_prod() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5976,"score_of_the_acc":-0.1591,"final_rank":2},{"submission_id":"aoj_2431_9548288","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\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 max(A,B);}\n\nll g(ll A, ll B) {return B;}\n\nll e() {return 0;}\n\nint main() {\n ll N;\n cin >> N;\n vector<ll> A(N);\n rep(i,0,N) cin >> A[i];\n SegmentTree<ll,ll,f,g,e> Seg(N+1);\n rep(i,0,N) {\n Seg.update(A[i], Seg.query(0,A[i])+A[i]);\n }\n cout << N * (N + 1) / 2 - Seg.query(0,N+1) << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":6068,"score_of_the_acc":-0.6678,"final_rank":8},{"submission_id":"aoj_2431_9402683","code_snippet":"// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2431&lang=jp\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, a, n) for (int i = a; i < n; i++)\n#define rrep(i, a, n) for (int i = a; i >= n; i--)\n#define inr(l, x, r) (l <= x && x < r)\n#define ll long long\n#define ld long double\n\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 9e18;\n\ntemplate <class t, class u>\nvoid chmax(t& a, u b) {\n if (a < b) a = b;\n}\ntemplate <class t, class u>\nvoid chmin(t& a, u b) {\n if (b < a) a = b;\n}\n\ntemplate <typename X>\nstruct SegTree {\n using FX = function<X(X, X)>; // X•X -> X となる関数の型\n int n;\n FX fx;\n const X ex;\n vector<X> dat;\n SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {\n int x = 1;\n while (n_ > x) {\n x *= 2;\n }\n n = x;\n }\n void set(int i, X x) { dat[i + n - 1] = x; }\n void build() {\n for (int k = n - 2; k >= 0; k--)\n dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);\n }\n void update(int i, X x) {\n i += n - 1;\n dat[i] = x;\n while (i > 0) {\n i = (i - 1) / 2; // parent\n dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);\n }\n }\n X query(int a, int b) { return query_sub(a, b, 0, 0, n); }\n X query_sub(int a, int b, int k, int l, int r) {\n if (r <= a || b <= l) {\n return ex;\n } else if (a <= l && r <= b) {\n return dat[k];\n } else {\n X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);\n X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);\n return fx(vl, vr);\n }\n }\n};\n\n// using S = ll;\nauto fx = [](ll x1, ll x2) -> ll { return max(x1, x2); };\nll ex = 0;\n\nint main() {\n int n; cin >> n;\n vector<int> x(n);\n rep(i, 0, n) cin >> x[i];\n SegTree<ll> seg(n + 1, fx, ex);\n ll sum = 0;\n rep(i, 0, n) {\n sum += x[i];\n seg.update(x[i], seg.query(0, x[i]) + x[i]);\n }\n cout << sum - seg.query(0, n + 1) << endl;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":6724,"score_of_the_acc":-1.2296,"final_rank":13},{"submission_id":"aoj_2431_8643965","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint n;\nll x;\nstruct Segtree{\n int n2;\n ll dat[300030];\n Segtree(int n){\n n2 = 1;\n while(n2<n) n2*=2;\n memset(dat, 0, sizeof(dat));\n }\n ll update(int a){\n ll res = query(0, a, 0, 0, n2) + a;\n int k = a+n2-1;\n dat[k] = res;\n while(k>0){\n k = (k-1)/2;\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\n }\n return res;\n }\n ll query(int a, int b, int k, int l, int r){\n if(r<a || b<l) return 0;\n if(a<=l && r<=b) return dat[k];\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+1, r);\n return max(vl, vr);\n }\n};\nint main(){\n cin >> n;\n Segtree seg(n+1);\n ll sum=0, ma=0;\n for(int i=0;i<n;i++){\n cin >> x;\n sum += x;\n ma = max(ma, seg.update(x));\n }\n cout << sum-ma << endl;\n return(0);\n}","accuracy":1,"time_ms":30,"memory_kb":5460,"score_of_the_acc":-1.1105,"final_rank":11},{"submission_id":"aoj_2431_8643879","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint n;\nll x;\nstruct Segtree{\n int n2;\n ll dat[300030];\n Segtree(int n){\n n2 = 1;\n while(n2<n) n2*=2;\n memset(dat, 0, sizeof(dat));\n }\n ll update(int a, int r){\n ll res = query(0, a, 0, 0, n2) + a;\n int k = a+n2-1;\n dat[k] = res;\n while(k>0){\n k = (k-1)/2;\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\n }\n return res;\n }\n ll query(int a, int b, int k, int l, int r){\n if(r<a || b<l) return 0;\n if(a<=l && r<=b) return dat[k];\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+1, r);\n return max(vl, vr);\n }\n};\nint main(){\n cin >> n;\n Segtree seg(n+1);\n ll sum=0, ma=0;\n for(int i=0;i<n;i++){\n cin >> x;\n sum += x;\n ma = max(ma, seg.update(x, n));\n }\n cout << sum-ma << endl;\n return(0);\n}","accuracy":1,"time_ms":30,"memory_kb":5464,"score_of_the_acc":-1.1109,"final_rank":12},{"submission_id":"aoj_2431_8643865","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint n, x;\nstruct Segtree{\n int n2;\n int dat[300030];\n Segtree(int n){\n n2 = 1;\n while(n2<n) n2*=2;\n memset(dat, 0, sizeof(dat));\n }\n int update(int a, int r){\n int res = query(0, a, 0, 0, n2) + a;\n int k = a+n2-1;\n dat[k] = res;\n while(k>0){\n k = (k-1)/2;\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\n }\n return res;\n }\n int query(int a, int b, int k, int l, int r){\n if(r<a || b<l) return 0;\n if(a<=l && r<=b) return dat[k];\n int vl = query(a, b, k*2+1, l, (l+r)/2);\n int vr = query(a, b, k*2+2, (l+r)/2+1, r);\n return max(vl, vr);\n }\n};\nint main(){\n cin >> n;\n Segtree seg(n+1);\n int sum=0, ma=0;\n for(int i=0;i<n;i++){\n cin >> x;\n sum += x;\n ma = max(ma, seg.update(x, n));\n }\n cout << sum-ma << endl;\n return(0);\n}","accuracy":0.10256410256410256,"time_ms":20,"memory_kb":4288,"score_of_the_acc":-0.5,"final_rank":18},{"submission_id":"aoj_2431_8308575","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\nstruct SegmentTree\n{\n\tint sz;\n\tvector<ll> seg;\n\t\n\tSegmentTree() = default;\n\tSegmentTree(int n)\n\t{\n\t\tsz = 1;\n\t\twhile (sz < n) {sz <<= 1;}\n\t\tseg.assign(sz * 2, 0);\n\t}\n\t\n\tvoid update(int k, ll x)\n\t{\n\t\tk += sz;\n\t\tseg[k] = x;\n\t\twhile (k >>= 1)\n\t\t{\n\t\t\tseg[k] = max(seg[2*k+0], seg[2*k+1]);\n\t\t}\n\t\treturn;\n\t}\n\t\n\tll query(int a, int b)\n\t{\n\t\tll L = 0, R = 0;\n\t\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1)\n\t\t{\n\t\t\tif (a & 1) L = max(L, seg[a++]);\n\t\t\tif (b & 1) R = max(seg[--b], R);\n\t\t}\n\t\treturn max(L, R);\n\t}\n\t\n};\n\n\nvoid calc()\n{\n\tll N; cin >> N;\n\tSegmentTree seg(N+1);\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tint a; cin >> a;\n\t\tll mx = seg.query(0, a);\n\t\tseg.update(a, mx + a);\n\t}\n\t\n\tll res = N * (N+1) / 2;\n\tres -= seg.query(0, N+1);\n\tcout << res << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5204,"score_of_the_acc":-0.5863,"final_rank":4},{"submission_id":"aoj_2431_8032250","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define REP(i, m, n) for (int i = m; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define dbg(x) cerr << #x << \":\" << x << endl;\n#define all(v) v.begin(), v.end()\n\nconstexpr ll LINF = 1e18;\n\ntemplate <typename T, typename F>\nstruct SegmentTree {\n int n, sz;\n vector<T> seg;\n\n const F f;\n const T ti;\n\n SegmentTree() = default;\n\n explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {\n sz = 1;\n while (sz < n) sz <<= 1;\n seg.assign(2 * sz, ti);\n }\n\n explicit SegmentTree(const vector<T> &v, const F f, const T &ti)\n : SegmentTree((int)v.size(), f, ti) {\n build(v);\n }\n\n void build(const vector<T> &v) {\n assert(n == (int)v.size());\n for (int k = 0; k < n; k++) seg[k + sz] = v[k];\n for (int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void set(int k, const T &x) {\n k += sz;\n seg[k] = x;\n while (k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T get(int k) const { return seg[k + sz]; }\n\n T operator[](const int &k) const { return get(k); }\n\n void apply(int k, const T &x) {\n k += sz;\n seg[k] = f(seg[k], x);\n while (k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T prod(int l, int r) const {\n T L = ti, R = ti;\n for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {\n if (l & 1) L = f(L, seg[l++]);\n if (r & 1) R = f(seg[--r], R);\n }\n return f(L, R);\n }\n\n T all_prod() const { return seg[1]; }\n};\n\ntemplate <typename T, typename F>\nSegmentTree<T, F> get_segment_tree(int N, const F &f, const T &ti) {\n return SegmentTree{N, f, ti};\n}\n\n/*\ntemplate <typename T, typename F>\nSegmentTree<T, F> get_segment_tree(const vector<T> &v, const F &f,\n const T &ti) {\n return SegmentTree{v, f, ti};\n}\n*/\n\n// ll op(ll a, ll b) { return max(a, b); }\n\nint main() {\n int n;\n cin >> n;\n vector<ll> x(n);\n rep(i, n) cin >> x[i];\n\n auto f = [&](ll a, ll b) { return max(a, b); };\n auto seg = get_segment_tree(n + 1, f, 0LL);\n\n rep(i, n) {\n ll sum = seg.prod(0, x[i]);\n seg.set(x[i], sum + x[i]);\n }\n cout << accumulate(all(x), 0LL) - seg.all_prod() << \"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":6012,"score_of_the_acc":-0.6625,"final_rank":7},{"submission_id":"aoj_2431_8022699","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nnamespace zawa {\n\ntemplate <class monoid>\nclass segmentTree {\nprivate:\n\tusing V = typename monoid::valueType;\n\tstd::size_t N;\n\tstd::vector<V> dat;\n\npublic:\n\tsegmentTree() {}\n\tsegmentTree(int _N) : N(_N), dat(2 * _N, monoid::identity) {}\n\tsegmentTree(const std::vector<V>& A) : N(A.size()), dat(2 * N, monoid::identity) {\n\t\tfor (std::size_t i = 0 ; i < A.size() ; i++) {\n\t\t\tdat[i + N] = A[i];\n\t\t}\n\t\tfor (std::size_t i = N - 1 ; i > 0 ; i--) {\n\t\t\tdat[i] = monoid::operation(dat[i << 1], dat[i << 1 | 1]);\t\t\n\t\t}\n\t}\n\n\tvoid set(std::size_t pos, const V& value) {\n\t\tpos += N;\n\t\tdat[pos] = value;\n\t\twhile (pos >>= 1) {\n\t\t\tdat[pos] = monoid::operation(dat[pos << 1], dat[pos << 1 | 1]);\n\t\t}\n\t}\n\n\tV update(std::size_t pos, const V& value) {\n\t\tpos += N;\n\t\tdo {\n\t\t\tdat[pos] = monoid::operation(dat[pos], value);\n\t\t} while (pos >>= 1);\n\t\treturn dat[pos];\n\t}\n\n\tV prod(std::size_t l, std::size_t r) const {\n\t\tV left = monoid::identity, right = monoid::identity;\n\t\tfor (l += N, r += N ; l < r ; l >>= 1, r >>= 1) {\n\t\t\tif (l & 1) {\n\t\t\t\tleft = monoid::operation(left, dat[l++]);\t\n\t\t\t}\n\t\t\tif (r & 1) {\n\t\t\t\tright = monoid::operation(dat[--r], right);\n\t\t\t}\n\t\t}\n\t\treturn monoid::operation(left, right);\n\t}\n\n\ttemplate <class functionType>\n\tint maxRight(int l, const functionType& f) const {\n\t\tint L = l + N, w = 1;\n\t\tV v = monoid::identity;\n\t\tfor ( ; l + w <= (int)N ; L >>= 1, w <<= 1) {\n\t\t\tif (L & 1) {\n\t\t\t \tif (f(monoid::operation(v, dat[L]))) {\n\t\t\t\t\tv = monoid::operation(v, dat[L++]);\n\t\t\t\t\tl += w;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (L <<= 1, w >>= 1) {\n\t\t\tif (l + w <= (int)N and f(monoid::operation(v, dat[L]))) {\n\t\t\t\tv = monoid::operation(v, dat[L++]);\n\t\t\t\tl += w;\n\t\t\t}\n\t\t}\n\t\treturn l;\n\t}\n\n\ttemplate <class functionType>\n\tint minLeft(int r, const functionType& f) const {\t\n\t\tint R = r + N, w = 1;\n\t\tV v = monoid::identity;\n\t\tfor ( ; r - w >= 0 ; R >>= 1, w <<= 1) {\n\t\t\tif (R & 1) {\n\t\t\t\tif (f(monoid::operation(dat[R - 1], v))) {\n\t\t\t\t\tv = monoid::operation(dat[--R], v);\n\t\t\t\t\tr -= w;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\twhile (R <<= 1, w >>= 1) {\n\t\t\tif (r - w >= 0 and f(monoid::operation(dat[R - 1], v))) {\n\t\t\t\tv = monoid::operation(dat[--R], v);\n\t\t\t\tr -= w;\n\t\t\t}\n\t\t}\n\t\treturn r;\n\t}\t\n};\n\n} // namespace zawa\n\nnamespace zawa {\n\ntemplate <class T>\nstruct maxMonoid {\n\tusing valueType = T;\n\tstatic constexpr valueType identity = std::numeric_limits<valueType>::min();\n\tstatic valueType operation(const valueType& a, const valueType& b) {\n\t\treturn std::max(a, b);\n\t}\n};\n\n};\n\nint main() {\n int N; cin >> N;\n vector<int> A(N);\n for (auto& a : A) cin >> a;\n\n vector<ll> B(N);\n zawa::segmentTree<zawa::maxMonoid<ll>> S(B);\n\n for (int i = 0 ; i < N ; i++) {\n ll v = S.prod(0, A[i]);\n B[A[i] - 1] = v + A[i];\n S.set(A[i] - 1, B[A[i] - 1]);\n }\n\n cout << (ll)N * (N + 1) / 2 - S.prod(0, N) << endl;\n\n return 0;\n \n}","accuracy":1,"time_ms":20,"memory_kb":5752,"score_of_the_acc":-0.638,"final_rank":5},{"submission_id":"aoj_2431_8022263","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N; cin >> N;\n vector<int> A(N);\n for (auto& a : A) cin >> a;\n const int INF = (int)2e9;\n vector<int> dp(N + 1, INF);\n vector<map<int, ll>> dp2(N + 1);\n\n for (auto a : A) {\n auto it = lower_bound(dp.begin(), dp.end(), a);\n if (it == dp.begin()) {\n dp2[0][a] = a;\n }\n else {\n int pos = it - dp.begin() - 1;\n auto it2 = dp2[pos].lower_bound(a);\n if (it2 == dp2[pos].begin()) {\n dp2[pos + 1][a] = (ll)a;\n }\n else {\n it2--;\n dp2[pos + 1][a] = it2->second + a;\n }\n }\n *it = a;\n }\n\n ll val = 0LL;\n for (auto& d : dp2) {\n for (auto& [_, sum] : d) val = max(val, sum);\n }\n\n ll ans = (ll)N * (N + 1) / 2 - val;\n\n cout << ans << endl;\n}","accuracy":0.23076923076923078,"time_ms":30,"memory_kb":14896,"score_of_the_acc":-2,"final_rank":17},{"submission_id":"aoj_2431_8022257","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n int N; cin >> N;\n vector<int> A(N);\n for (auto& a : A) cin >> a;\n const int INF = (int)2e9;\n vector<int> dp(N + 1, INF);\n vector<map<int, ll>> dp2(N + 1);\n\n for (auto a : A) {\n auto it = upper_bound(dp.begin(), dp.end(), a);\n if (it == dp.begin()) {\n dp2[0][a] = a;\n }\n else {\n int pos = it - dp.begin() - 1;\n auto it2 = dp2[pos].upper_bound(a);\n if (it2 == dp2[pos].begin()) {\n dp2[pos + 1][a] = max(dp2[pos + 1][a], (ll)a);\n }\n else {\n it2--;\n dp2[pos + 1][a] = max(dp2[pos + 1][a], it2->second + a);\n }\n }\n *it = a;\n }\n\n ll val = 0LL;\n for (auto& d : dp2) {\n for (auto& [_, sum] : d) val = max(val, sum);\n }\n\n ll ans = (ll)accumulate(A.begin(), A.end(), 0LL) - val;\n\n cout << ans << endl;\n}","accuracy":0.23076923076923078,"time_ms":30,"memory_kb":14852,"score_of_the_acc":-1.9959,"final_rank":16},{"submission_id":"aoj_2431_8020077","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nnamespace segtree_impl {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while(!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace segtree_impl\n\nnamespace segtree_impl {\n\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\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--) { update(i); }\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) const {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n\n S operator[](int k) const { return get(k); }\n\n S prod(int l, int r) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(r > _n) r = _n;\n if(l > r) return e();\n#endif\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() const { return d[1]; }\n\n template <bool (*f)(S)> int max_right(int l) const {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) const {\n#ifdef ONLINE_JUDGE\n if(l < 0) l = 0;\n if(l > _n) l = _n;\n#endif\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) const {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) const {\n#ifdef ONLINE_JUDGE\n if(r < 0) r = 0;\n if(r > _n) r = _n;\n#endif\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\n os << \"{\";\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \"\" : \", \");\n return os << \"}\";\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\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\ntemplate <typename T> T min_e() { return inf<T>; }\ntemplate <typename T> T max_e() { return -inf<T>; }\ntemplate <typename T> T plus_e() { return T(); }\n\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\n\ntemplate <typename T> struct mMinfo { T mi, ma; };\ntemplate <typename T> mMinfo<T> mM_func(mMinfo<T> x, mMinfo<T> y) { return mMinfo{min(x.mi, y.mi), max(x.ma, y.ma)}; };\ntemplate <typename T> mMinfo<T> mM_e() { return {inf<T>, -inf<T>}; }\n\ntemplate <typename T> using RmMT = segtree<mMinfo<T>, mM_func<T>, mM_e<T>>;\n\n} // namespace segtree_impl\nusing segtree_impl::RmT;\nusing segtree_impl::RMT;\nusing segtree_impl::RST;\nusing segtree_impl::segtree;\n\nint main() {\n int n;\n cin >> n;\n vector<long long> a(n);\n for(auto &e : a) cin >> e;\n RMT<long long> seg(n + 1);\n seg.set(0, 0);\n for(auto &e : a) { seg.set(e, seg.prod(0, e) + e); }\n cout << (1LL * n * (n + 1) / 2 - seg.all_prod()) << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":6780,"score_of_the_acc":-0.7349,"final_rank":10},{"submission_id":"aoj_2431_8019510","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define all(a) a.begin(),a.end()\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nconst ll inf=1e18;\nstruct RMQ{\n vector<ll>node;\n int n;\n RMQ(int N){\n n=1;\n while(n<N)n*=2;\n node.resize(2*n,-inf);\n }\n void upd(int i,ll x){\n i+=n-1;\n node[i]=x;\n while(i>0){\n i=(i-1)/2;\n node[i]=max(node[i*2+1],node[i*2+2]);\n }\n }\n ll query(int a,int b,int k,int l,int r){\n if(b<=l||r<=a)return -inf;\n if(a<=l&&r<=b)return node[k];\n ll vl=query(a,b,2*k+1,l,(l+r)/2);\n ll vr=query(a,b,2*k+2,(l+r)/2,r);\n return max(vl,vr);\n }\n ll get(int L,int R){\n return query(L,R,0,0,n);\n }\n};\nll p[100005];\nint main(){\n ll n;cin>>n;\n rep(i,n)cin>>p[i];\n RMQ segtree(n+1);\n segtree.upd(0,0);\n rep(i,n){\n segtree.upd(p[i],p[i]+segtree.get(0,p[i]));\n }\n cout<<n*(n+1)/2-segtree.get(0,n+1)<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":6008,"score_of_the_acc":-0.6621,"final_rank":6},{"submission_id":"aoj_2431_8019509","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define all(a) a.begin(),a.end()\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nconst ll inf=1e18;\nstruct RMQ{\n vector<ll>node;\n int n;\n RMQ(int N){\n n=1;\n while(n<N)n*=2;\n node.resize(2*n,-inf);\n }\n void upd(int i,ll x){\n i+=n-1;\n node[i]=x;\n while(i>0){\n i=(i-1)/2;\n node[i]=max(node[i*2+1],node[i*2+2]);\n }\n }\n ll query(int a,int b,int k,int l,int r){\n if(b<=l||r<=a)return -inf;\n if(a<=l&&r<=b)return node[k];\n ll vl=query(a,b,2*k+1,l,(l+r)/2);\n ll vr=query(a,b,2*k+2,(l+r)/2,r);\n return max(vl,vr);\n }\n ll get(int L,int R){\n return query(L,R,0,0,n);\n }\n};\nll p[100005];\nint main(){\n int n;cin>>n;\n rep(i,n)cin>>p[i];\n RMQ segtree(n+1);\n segtree.upd(0,0);\n rep(i,n){\n segtree.upd(p[i],p[i]+segtree.get(0,p[i]));\n }\n cout<<n*(n+1)/2-segtree.get(0,n+1)<<endl;\n}","accuracy":0.10256410256410256,"time_ms":20,"memory_kb":6000,"score_of_the_acc":-0.6614,"final_rank":20},{"submission_id":"aoj_2431_8019501","code_snippet":"#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing H = pair<ll, ll>;\nusing P = pair<ll, H>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\n#define all(a) (a).begin(), (a).end()\n#define fs first\n#define sc second\n#define xx first\n#define yy second.first\n#define zz second.second\n#define Q(i, j, k) mkp((i), mkp((j), (k)))\n#define rng(i, s, n) for(int i = (s) ; i < (n) ; i++)\n#define rep(i, n) rng(i, 0, (n))\n#define mkp make_pair\n#define vec vector\n#define pb emplace_back\n#define siz(a) int((a).size())\n#define crdcomp(b) sort(all((b))); (b).erase(unique(all((b))), (b).end())\n#define getidx(b, i) (lower_bound(all((b)), (i))-(b).begin())\n#define ssp(i, n) (i==(ll)(n)-1?\"\\n\":\" \")\n#define ctoi(c) (int)((c)-'0')\n#define itoc(c) (char)((c)+'0')\n#define cyes printf(\"Yes\\n\")\n#define cno printf(\"No\\n\")\n#define cdf(n) for(int __quetimes=(n); __quetimes>0; __quetimes--)\n#define gcj printf(\"Case #%lld: \", __quetimes+1)\n#define readv(a, n) (a).resize((n), 0); rep(i, (n)) (a)[i]=read()\n#define found(a, x) (a.find(x)!=a.end())\nconstexpr ll mod = (ll)1e9 + 7;\nconstexpr ll Mod = 998244353;\nconstexpr ld EPS = 1e-10;\nconstexpr ll inf = (ll)3 * 1e18;\nconstexpr int Inf = 1e9;\nconstexpr int dx[] = { -1, 1, 0, 0 }, dy[] = { 0, 0, -1, 1 };\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; }\ntemplate<class T = ll>T read() { T u, k = scanf(\"%lld\", &u); return u; }\nstring reads() { string s; cin >> s; return s; }\nbool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\nbool ina(int t, int l, int r) { return l <= t && t < r; }\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\ntemplate<typename T>\nvoid fin(T x) { cout << x << endl; exit(0); }\n//--------------------------------------------------------------\nclass BIT {\n int n;\n vl dat;\npublic:\n BIT(int n) :n(n) { dat.assign(n + 1, 0); }\n void update(int x, ll v) {\n x++;\n while (x <= n) {\n chmax(dat[x], v);\n x += (x & -x);\n }\n }\n ll max(int x) {\n x++;\n ll ret = 0;\n while (x > 0) {\n chmax(ret, dat[x]);\n x -= (x & -x);\n }\n return ret;\n }\n};\nsigned main() {\n int n;cin >> n;\n vl a(n);rep(i, n) cin >> a[i];\n BIT bit(n + 1);\n ll ans = 0;\n rep(i, n) {\n ll val = bit.max(a[i]);\n chmax(ans, val + a[i]);\n bit.update(a[i], val + a[i]);\n }\n ans = -ans;\n rep(i, n) ans += ll(i + 1);\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4656,"score_of_the_acc":-0.5347,"final_rank":3},{"submission_id":"aoj_2431_7979350","code_snippet":"#include<stdio.h>\n\nlong long BIT[100001] = { 0 };\nint BIT_n = 1;\n\nlong long max( long long a, long long b )\n{\n return a > b ? a : b;\n}\n\nvoid initBIT( int size )\n{\n BIT_n = size;\n for( int i = 1; i <= BIT_n; i++ )\n {\n BIT[i] = 0;\n }\n}\n\nlong long search( int index )\n{\n long long max_val = 0;\n while( index > 0 )\n {\n max_val = max( BIT[index], max_val );\n index -= ( index & -index );\n }\n return max_val;\n}\n\nvoid insert( int index, long long value )\n{\n while( index <= BIT_n )\n {\n if( value > BIT[index] )\n {\n BIT[index] = value;\n index += ( index & -index );\n }\n else\n {\n break;\n }\n }\n}\n\nint main( void )\n{\n long long n;\n scanf( \"%lld\", &n );\n long long items[100000];\n for( int i = 0; i < n; i++ )\n {\n scanf( \"%lld\", &items[i] );\n }\n\n long long ans = 0, tmp;\n initBIT( n );\n for( int i = 0; i < n; i++ )\n {\n tmp = search( items[i] ) + items[i];\n insert( items[i], tmp );\n ans = max( ans, tmp );\n }\n\n printf( \"%lld\\n\", ( ( long long )n * ( long long )( n + 1 ) / 2 ) - ans );\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4320,"score_of_the_acc":-0.003,"final_rank":1},{"submission_id":"aoj_2431_7966734","code_snippet":"#include <bits/stdc++.h>\n\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 << 62)\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(), n.end()\n#define MOD 1000000007\n#define P pair<ll, ll>\n\nstruct SegTree { //せぐつりー！\n ll sz;\n vector<ll> dat;\n SegTree(ll n) {\n sz = 1;\n while (sz < n)sz *= 2;\n dat.resize(2 * sz - 1, 0);//\n }\n void update(ll a, ll x) {\n a += sz - 1;//\n dat[a] = x;\n while (a > 0) {\n a = (a - 1) / 2;\n dat[a] = max(dat[a * 2 + 1], dat[a * 2 + 2]);//\n }\n }\n ll query(ll a, ll b, ll k = 0, ll l = 0, ll r = -1) {\n if (r < 0) r = sz;\n if (r <= a or b <= l)return 0;//\n if (a <= l and r <= b)return dat[k];//\n ll q1, q2;\n q1 = query(a, b, k * 2 + 1, l, (l + r) / 2);\n q2 = query(a, b, k * 2 + 2, (l + r) / 2, r);\n return max(q1, q2);//\n }\n};\nSegTree seg(100000);\nll sum;\nint main(){\n ll n;\n cin >> n;\n vector<P> s(n);\n REP(i, n){\n ll a;\n cin >> a;\n sum += a;\n s[i] = P(a, i);\n }\n sort(ALL(s));\n REP(i, n){\n seg.update(s[i].second, seg.query(0,s[i].second+1)+s[i].first);\n }\n cout << sum - seg.query(0, n)<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":6808,"score_of_the_acc":-1.2376,"final_rank":14},{"submission_id":"aoj_2431_7943578","code_snippet":"#include <string.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <chrono>\n#include <ciso646>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define REP3(i, l, r, s) \\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\n i += rep3_s)\n#define REP2(i, l, r) REP3(i, l, r, 1)\n#define REP1(i, n) REP2(i, 0, n)\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\n\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define RREP3(i, l, r, s) \\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\n i -= rrep3_s)\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\n#define RREP1(i, n) RREP2(i, 0, n)\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\n#define rrepin(i, l, r) \\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\n\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\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 = internal::ceil_pow2(_n);\n size = 1 << log;\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 atcoder\n\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace rklib {\n\n// a <- max(a, b)\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// a <- min(a, b)\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// if a < 0: a <- b\n// else: a <- min(a, b)\ntemplate <class T>\nbool chmin_non_negative(T &a, const T &b) {\n if (a < 0 || a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// floor(num / den)\ntemplate <class T>\nT div_floor(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num >= 0 ? num / den : (num + 1) / den - 1;\n}\n\n// ceil(num / den)\ntemplate <class T>\nT div_ceil(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num <= 0 ? num / den : (num - 1) / den + 1;\n}\n\nnamespace internal {\n\ntemplate <class T>\nT remainder_count(T r, T b, T m) {\n return r / m * b + std::min(b, r % m);\n}\n\n} // namespace internal\n\n// Number of integer x s.t.\n// - x in [l, r)\n// - x mod m in [a, b)\ntemplate <class T>\nT remainder_count(T l, T r, T a, T b, T m) {\n assert(l >= 0);\n assert(m >= 1);\n\n if (l >= r || a >= b) return 0;\n if (m <= a || b < 0) return 0;\n chmax(a, T(0));\n chmin(b, m);\n\n auto res = internal::remainder_count(r, b, m);\n if (l >= 1) res -= internal::remainder_count(l, b, m);\n if (a >= 1) res -= internal::remainder_count(r, a, m);\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\n\n return res;\n}\n\n} // namespace rklib\n\n\nusing namespace std;\nusing namespace rklib;\n\nusing lint = long long;\nusing pii = pair<int, int>;\nusing pll = pair<lint, lint>;\n\nlint op(lint a, lint b) { return max(a, b); }\nlint e() { return 0; }\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i], --a[i];\n\n lint ans = 0;\n rep(i, n) ans += a[i] + 1;\n\n atcoder::segtree<lint, op, e> st(n);\n rep(i, n) {\n auto tmp = st.prod(0, a[i]);\n st.set(a[i], tmp + a[i] + 1);\n }\n ans -= st.all_prod();\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":6284,"score_of_the_acc":-0.6882,"final_rank":9},{"submission_id":"aoj_2431_7943574","code_snippet":"#include <string.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <chrono>\n#include <ciso646>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define REP3(i, l, r, s) \\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\n i += rep3_s)\n#define REP2(i, l, r) REP3(i, l, r, 1)\n#define REP1(i, n) REP2(i, 0, n)\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\n\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\n#define RREP3(i, l, r, s) \\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\n i -= rrep3_s)\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\n#define RREP1(i, n) RREP2(i, 0, n)\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\n#define rrepin(i, l, r) \\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\n\n\n#include <algorithm>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\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 = internal::ceil_pow2(_n);\n size = 1 << log;\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 atcoder\n\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace rklib {\n\n// a <- max(a, b)\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// a <- min(a, b)\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// if a < 0: a <- b\n// else: a <- min(a, b)\ntemplate <class T>\nbool chmin_non_negative(T &a, const T &b) {\n if (a < 0 || a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n// floor(num / den)\ntemplate <class T>\nT div_floor(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num >= 0 ? num / den : (num + 1) / den - 1;\n}\n\n// ceil(num / den)\ntemplate <class T>\nT div_ceil(T num, T den) {\n if (den < 0) num = -num, den = -den;\n return num <= 0 ? num / den : (num - 1) / den + 1;\n}\n\nnamespace internal {\n\ntemplate <class T>\nT remainder_count(T r, T b, T m) {\n return r / m * b + std::min(b, r % m);\n}\n\n} // namespace internal\n\n// Number of integer x s.t.\n// - x in [l, r)\n// - x mod m in [a, b)\ntemplate <class T>\nT remainder_count(T l, T r, T a, T b, T m) {\n assert(l >= 0);\n assert(m >= 1);\n\n if (l >= r || a >= b) return 0;\n if (m <= a || b < 0) return 0;\n chmax(a, T(0));\n chmin(b, m);\n\n auto res = internal::remainder_count(r, b, m);\n if (l >= 1) res -= internal::remainder_count(l, b, m);\n if (a >= 1) res -= internal::remainder_count(r, a, m);\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\n\n return res;\n}\n\n} // namespace rklib\n\n\nusing namespace std;\nusing namespace rklib;\n\nusing lint = long long;\nusing pii = pair<int, int>;\nusing pll = pair<lint, lint>;\n\nint op(int a, int b) { return max(a, b); }\nint e() { return 0; }\n\nint main() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i], --a[i];\n\n lint ans = 0;\n rep(i, n) ans += a[i] + 1;\n\n atcoder::segtree<int, op, e> st(n);\n rep(i, n) {\n auto tmp = st.prod(0, a[i]);\n st.set(a[i], tmp + a[i] + 1);\n }\n ans -= st.all_prod();\n cout << ans << endl;\n}","accuracy":0.10256410256410256,"time_ms":20,"memory_kb":4932,"score_of_the_acc":-0.5607,"final_rank":19},{"submission_id":"aoj_2431_7523044","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n//Range Maximum Query\nconst ll SEG_LEN = (1LL << 19);\nvector<ll> seg(SEG_LEN * 2, 0);\n\nvoid update(ll pos, ll val) {\n pos += SEG_LEN;\n seg.at(pos) = val;\n while ((pos /= 2) > 0) {\n seg.at(pos) = max(seg.at(pos * 2), seg.at(pos * 2 + 1));\n }\n}\n\n//[ql, qr)\nll get_max(ll ql, ll qr, ll sl = 0, ll sr = (1 << 19), ll pos = 1) {\n if (qr <= sl || sr <= ql) {\n return 0;\n } else if (ql <= sl && sr <= qr) {\n return seg.at(pos);\n } else {\n ll sm = (sl + sr) / 2;\n ll l_min = get_max(ql, qr, sl, sm, pos * 2);\n ll r_min = get_max(ql, qr, sm, sr, pos * 2 + 1);\n return max(l_min, r_min);\n }\n}\n\nint main() {\n ll n;\n cin >> n;\n\n vector<ll> x(n);\n ll sum = 0;\n for (int i = 0; i < n; i++) {\n cin >> x.at(i);\n sum += x.at(i);\n }\n\n for (int i = 0; i < n; i++) {\n update(x.at(i), get_max(1, x.at(i)) + x.at(i));\n }\n\n cout << sum - get_max(0, SEG_LEN) << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":12148,"score_of_the_acc":-1.741,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2431_10506310\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(v) (v).begin(),(v).end()\\n#define pb(a) push_back(a)\\n#define rep(i, n) for(int i=0;i<n;i++)\\n#define foa(e, v) for(auto&& e : v)\\nusing ll = long long;\\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\\n\\n// base: bafcf8\\nunsigned int bit_ceil(unsigned int n) {\\n unsigned int x = 1;\\n while(x < (unsigned int)(n)) x *= 2;\\n return x;\\n}\\nint countr_zero(unsigned int n) { return __builtin_ctz(n); }\\nconstexpr int countr_zero_constexpr(unsigned int n) {\\n int x = 0;\\n while(!(n & (1 << x))) x++;\\n return x;\\n}\\ntemplate<class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(vector<S>(n, e())) {}\\n explicit segtree(const vector<S>& v) : _n(int(v.size())) {\\n size = (int)bit_ceil((unsigned int)(_n));\\n log = countr_zero((unsigned int)size);\\n d = 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--) { update(i); }\\n }\\n\\n void set(int p, S x) {\\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) const { return d[p + size]; }\\n\\n S prod(int l, int r) const {\\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() const { return d[1]; }\\n\\n template<class F> int max_right(int l, F f) {\\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 } // faa03f\\n\\n template<class F> int min_left(int r, F f) {\\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 } // efa466\\n\\n private:\\n int _n, size, log;\\n vector<S> d;\\n\\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\\n};\\n\\nll op(ll a, ll b) {\\n return max(a, b);\\n}\\nll e() {\\n return 0LL;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n ll n; cin >> n;\\n segtree<ll, op, e> seg(n + 1);\\n rep(i, n) {\\n ll x; cin >> x;\\n seg.set(x, seg.prod(0, x) + x);\\n }\\n cout << n * (n + 1) / 2 - seg.all_prod() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5976,\n \"score_of_the_acc\": -0.1591,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2431_9548288\",\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\\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 max(A,B);}\\n\\nll g(ll A, ll B) {return B;}\\n\\nll e() {return 0;}\\n\\nint main() {\\n ll N;\\n cin >> N;\\n vector<ll> A(N);\\n rep(i,0,N) cin >> A[i];\\n SegmentTree<ll,ll,f,g,e> Seg(N+1);\\n rep(i,0,N) {\\n Seg.update(A[i], Seg.query(0,A[i])+A[i]);\\n }\\n cout << N * (N + 1) / 2 - Seg.query(0,N+1) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6068,\n \"score_of_the_acc\": -0.6678,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2431_9402683\",\n \"code_snippet\": \"// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2431&lang=jp\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, a, n) for (int i = a; i < n; i++)\\n#define rrep(i, a, n) for (int i = a; i >= n; i--)\\n#define inr(l, x, r) (l <= x && x < r)\\n#define ll long long\\n#define ld long double\\n\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 9e18;\\n\\ntemplate <class t, class u>\\nvoid chmax(t& a, u b) {\\n if (a < b) a = b;\\n}\\ntemplate <class t, class u>\\nvoid chmin(t& a, u b) {\\n if (b < a) a = b;\\n}\\n\\ntemplate <typename X>\\nstruct SegTree {\\n using FX = function<X(X, X)>; // X•X -> X となる関数の型\\n int n;\\n FX fx;\\n const X ex;\\n vector<X> dat;\\n SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {\\n int x = 1;\\n while (n_ > x) {\\n x *= 2;\\n }\\n n = x;\\n }\\n void set(int i, X x) { dat[i + n - 1] = x; }\\n void build() {\\n for (int k = n - 2; k >= 0; k--)\\n dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);\\n }\\n void update(int i, X x) {\\n i += n - 1;\\n dat[i] = x;\\n while (i > 0) {\\n i = (i - 1) / 2; // parent\\n dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);\\n }\\n }\\n X query(int a, int b) { return query_sub(a, b, 0, 0, n); }\\n X query_sub(int a, int b, int k, int l, int r) {\\n if (r <= a || b <= l) {\\n return ex;\\n } else if (a <= l && r <= b) {\\n return dat[k];\\n } else {\\n X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);\\n X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);\\n return fx(vl, vr);\\n }\\n }\\n};\\n\\n// using S = ll;\\nauto fx = [](ll x1, ll x2) -> ll { return max(x1, x2); };\\nll ex = 0;\\n\\nint main() {\\n int n; cin >> n;\\n vector<int> x(n);\\n rep(i, 0, n) cin >> x[i];\\n SegTree<ll> seg(n + 1, fx, ex);\\n ll sum = 0;\\n rep(i, 0, n) {\\n sum += x[i];\\n seg.update(x[i], seg.query(0, x[i]) + x[i]);\\n }\\n cout << sum - seg.query(0, n + 1) << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6724,\n \"score_of_the_acc\": -1.2296,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2431_8643965\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint n;\\nll x;\\nstruct Segtree{\\n int n2;\\n ll dat[300030];\\n Segtree(int n){\\n n2 = 1;\\n while(n2<n) n2*=2;\\n memset(dat, 0, sizeof(dat));\\n }\\n ll update(int a){\\n ll res = query(0, a, 0, 0, n2) + a;\\n int k = a+n2-1;\\n dat[k] = res;\\n while(k>0){\\n k = (k-1)/2;\\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\\n }\\n return res;\\n }\\n ll query(int a, int b, int k, int l, int r){\\n if(r<a || b<l) return 0;\\n if(a<=l && r<=b) return dat[k];\\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+1, r);\\n return max(vl, vr);\\n }\\n};\\nint main(){\\n cin >> n;\\n Segtree seg(n+1);\\n ll sum=0, ma=0;\\n for(int i=0;i<n;i++){\\n cin >> x;\\n sum += x;\\n ma = max(ma, seg.update(x));\\n }\\n cout << sum-ma << endl;\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5460,\n \"score_of_the_acc\": -1.1105,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2431_8643879\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint n;\\nll x;\\nstruct Segtree{\\n int n2;\\n ll dat[300030];\\n Segtree(int n){\\n n2 = 1;\\n while(n2<n) n2*=2;\\n memset(dat, 0, sizeof(dat));\\n }\\n ll update(int a, int r){\\n ll res = query(0, a, 0, 0, n2) + a;\\n int k = a+n2-1;\\n dat[k] = res;\\n while(k>0){\\n k = (k-1)/2;\\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\\n }\\n return res;\\n }\\n ll query(int a, int b, int k, int l, int r){\\n if(r<a || b<l) return 0;\\n if(a<=l && r<=b) return dat[k];\\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+1, r);\\n return max(vl, vr);\\n }\\n};\\nint main(){\\n cin >> n;\\n Segtree seg(n+1);\\n ll sum=0, ma=0;\\n for(int i=0;i<n;i++){\\n cin >> x;\\n sum += x;\\n ma = max(ma, seg.update(x, n));\\n }\\n cout << sum-ma << endl;\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5464,\n \"score_of_the_acc\": -1.1109,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2431_8643865\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint n, x;\\nstruct Segtree{\\n int n2;\\n int dat[300030];\\n Segtree(int n){\\n n2 = 1;\\n while(n2<n) n2*=2;\\n memset(dat, 0, sizeof(dat));\\n }\\n int update(int a, int r){\\n int res = query(0, a, 0, 0, n2) + a;\\n int k = a+n2-1;\\n dat[k] = res;\\n while(k>0){\\n k = (k-1)/2;\\n dat[k] = max(dat[k*2+1], dat[k*2+2]);\\n }\\n return res;\\n }\\n int query(int a, int b, int k, int l, int r){\\n if(r<a || b<l) return 0;\\n if(a<=l && r<=b) return dat[k];\\n int vl = query(a, b, k*2+1, l, (l+r)/2);\\n int vr = query(a, b, k*2+2, (l+r)/2+1, r);\\n return max(vl, vr);\\n }\\n};\\nint main(){\\n cin >> n;\\n Segtree seg(n+1);\\n int sum=0, ma=0;\\n for(int i=0;i<n;i++){\\n cin >> x;\\n sum += x;\\n ma = max(ma, seg.update(x, n));\\n }\\n cout << sum-ma << endl;\\n return(0);\\n}\",\n \"accuracy\": 0.10256410256410256,\n \"time_ms\": 20,\n \"memory_kb\": 4288,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2431_8308575\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nbool is_end = false;\\n\\nstruct SegmentTree\\n{\\n\\tint sz;\\n\\tvector<ll> seg;\\n\\t\\n\\tSegmentTree() = default;\\n\\tSegmentTree(int n)\\n\\t{\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < n) {sz <<= 1;}\\n\\t\\tseg.assign(sz * 2, 0);\\n\\t}\\n\\t\\n\\tvoid update(int k, ll x)\\n\\t{\\n\\t\\tk += sz;\\n\\t\\tseg[k] = x;\\n\\t\\twhile (k >>= 1)\\n\\t\\t{\\n\\t\\t\\tseg[k] = max(seg[2*k+0], seg[2*k+1]);\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\tll query(int a, int b)\\n\\t{\\n\\t\\tll L = 0, R = 0;\\n\\t\\tfor (a += sz, b += sz; a < b; a >>= 1, b >>= 1)\\n\\t\\t{\\n\\t\\t\\tif (a & 1) L = max(L, seg[a++]);\\n\\t\\t\\tif (b & 1) R = max(seg[--b], R);\\n\\t\\t}\\n\\t\\treturn max(L, R);\\n\\t}\\n\\t\\n};\\n\\n\\nvoid calc()\\n{\\n\\tll N; cin >> N;\\n\\tSegmentTree seg(N+1);\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tint a; cin >> a;\\n\\t\\tll mx = seg.query(0, a);\\n\\t\\tseg.update(a, mx + a);\\n\\t}\\n\\t\\n\\tll res = N * (N+1) / 2;\\n\\tres -= seg.query(0, N+1);\\n\\tcout << res << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5204,\n \"score_of_the_acc\": -0.5863,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2431_8032250\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define REP(i, m, n) for (int i = m; i < n; i++)\\n#define rep(i, n) REP(i, 0, n)\\n#define dbg(x) cerr << #x << \\\":\\\" << x << endl;\\n#define all(v) v.begin(), v.end()\\n\\nconstexpr ll LINF = 1e18;\\n\\ntemplate <typename T, typename F>\\nstruct SegmentTree {\\n int n, sz;\\n vector<T> seg;\\n\\n const F f;\\n const T ti;\\n\\n SegmentTree() = default;\\n\\n explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {\\n sz = 1;\\n while (sz < n) sz <<= 1;\\n seg.assign(2 * sz, ti);\\n }\\n\\n explicit SegmentTree(const vector<T> &v, const F f, const T &ti)\\n : SegmentTree((int)v.size(), f, ti) {\\n build(v);\\n }\\n\\n void build(const vector<T> &v) {\\n assert(n == (int)v.size());\\n for (int k = 0; k < n; k++) seg[k + sz] = v[k];\\n for (int k = sz - 1; k > 0; k--) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n void set(int k, const T &x) {\\n k += sz;\\n seg[k] = x;\\n while (k >>= 1) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n T get(int k) const { return seg[k + sz]; }\\n\\n T operator[](const int &k) const { return get(k); }\\n\\n void apply(int k, const T &x) {\\n k += sz;\\n seg[k] = f(seg[k], x);\\n while (k >>= 1) {\\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\\n }\\n }\\n\\n T prod(int l, int r) const {\\n T L = ti, R = ti;\\n for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {\\n if (l & 1) L = f(L, seg[l++]);\\n if (r & 1) R = f(seg[--r], R);\\n }\\n return f(L, R);\\n }\\n\\n T all_prod() const { return seg[1]; }\\n};\\n\\ntemplate <typename T, typename F>\\nSegmentTree<T, F> get_segment_tree(int N, const F &f, const T &ti) {\\n return SegmentTree{N, f, ti};\\n}\\n\\n/*\\ntemplate <typename T, typename F>\\nSegmentTree<T, F> get_segment_tree(const vector<T> &v, const F &f,\\n const T &ti) {\\n return SegmentTree{v, f, ti};\\n}\\n*/\\n\\n// ll op(ll a, ll b) { return max(a, b); }\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<ll> x(n);\\n rep(i, n) cin >> x[i];\\n\\n auto f = [&](ll a, ll b) { return max(a, b); };\\n auto seg = get_segment_tree(n + 1, f, 0LL);\\n\\n rep(i, n) {\\n ll sum = seg.prod(0, x[i]);\\n seg.set(x[i], sum + x[i]);\\n }\\n cout << accumulate(all(x), 0LL) - seg.all_prod() << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6012,\n \"score_of_the_acc\": -0.6625,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2431_8022699\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nnamespace zawa {\\n\\ntemplate <class monoid>\\nclass segmentTree {\\nprivate:\\n\\tusing V = typename monoid::valueType;\\n\\tstd::size_t N;\\n\\tstd::vector<V> dat;\\n\\npublic:\\n\\tsegmentTree() {}\\n\\tsegmentTree(int _N) : N(_N), dat(2 * _N, monoid::identity) {}\\n\\tsegmentTree(const std::vector<V>& A) : N(A.size()), dat(2 * N, monoid::identity) {\\n\\t\\tfor (std::size_t i = 0 ; i < A.size() ; i++) {\\n\\t\\t\\tdat[i + N] = A[i];\\n\\t\\t}\\n\\t\\tfor (std::size_t i = N - 1 ; i > 0 ; i--) {\\n\\t\\t\\tdat[i] = monoid::operation(dat[i << 1], dat[i << 1 | 1]);\\t\\t\\n\\t\\t}\\n\\t}\\n\\n\\tvoid set(std::size_t pos, const V& value) {\\n\\t\\tpos += N;\\n\\t\\tdat[pos] = value;\\n\\t\\twhile (pos >>= 1) {\\n\\t\\t\\tdat[pos] = monoid::operation(dat[pos << 1], dat[pos << 1 | 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tV update(std::size_t pos, const V& value) {\\n\\t\\tpos += N;\\n\\t\\tdo {\\n\\t\\t\\tdat[pos] = monoid::operation(dat[pos], value);\\n\\t\\t} while (pos >>= 1);\\n\\t\\treturn dat[pos];\\n\\t}\\n\\n\\tV prod(std::size_t l, std::size_t r) const {\\n\\t\\tV left = monoid::identity, right = monoid::identity;\\n\\t\\tfor (l += N, r += N ; l < r ; l >>= 1, r >>= 1) {\\n\\t\\t\\tif (l & 1) {\\n\\t\\t\\t\\tleft = monoid::operation(left, dat[l++]);\\t\\n\\t\\t\\t}\\n\\t\\t\\tif (r & 1) {\\n\\t\\t\\t\\tright = monoid::operation(dat[--r], right);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn monoid::operation(left, right);\\n\\t}\\n\\n\\ttemplate <class functionType>\\n\\tint maxRight(int l, const functionType& f) const {\\n\\t\\tint L = l + N, w = 1;\\n\\t\\tV v = monoid::identity;\\n\\t\\tfor ( ; l + w <= (int)N ; L >>= 1, w <<= 1) {\\n\\t\\t\\tif (L & 1) {\\n\\t\\t\\t \\tif (f(monoid::operation(v, dat[L]))) {\\n\\t\\t\\t\\t\\tv = monoid::operation(v, dat[L++]);\\n\\t\\t\\t\\t\\tl += w;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (L <<= 1, w >>= 1) {\\n\\t\\t\\tif (l + w <= (int)N and f(monoid::operation(v, dat[L]))) {\\n\\t\\t\\t\\tv = monoid::operation(v, dat[L++]);\\n\\t\\t\\t\\tl += w;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn l;\\n\\t}\\n\\n\\ttemplate <class functionType>\\n\\tint minLeft(int r, const functionType& f) const {\\t\\n\\t\\tint R = r + N, w = 1;\\n\\t\\tV v = monoid::identity;\\n\\t\\tfor ( ; r - w >= 0 ; R >>= 1, w <<= 1) {\\n\\t\\t\\tif (R & 1) {\\n\\t\\t\\t\\tif (f(monoid::operation(dat[R - 1], v))) {\\n\\t\\t\\t\\t\\tv = monoid::operation(dat[--R], v);\\n\\t\\t\\t\\t\\tr -= w;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (R <<= 1, w >>= 1) {\\n\\t\\t\\tif (r - w >= 0 and f(monoid::operation(dat[R - 1], v))) {\\n\\t\\t\\t\\tv = monoid::operation(dat[--R], v);\\n\\t\\t\\t\\tr -= w;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn r;\\n\\t}\\t\\n};\\n\\n} // namespace zawa\\n\\nnamespace zawa {\\n\\ntemplate <class T>\\nstruct maxMonoid {\\n\\tusing valueType = T;\\n\\tstatic constexpr valueType identity = std::numeric_limits<valueType>::min();\\n\\tstatic valueType operation(const valueType& a, const valueType& b) {\\n\\t\\treturn std::max(a, b);\\n\\t}\\n};\\n\\n};\\n\\nint main() {\\n int N; cin >> N;\\n vector<int> A(N);\\n for (auto& a : A) cin >> a;\\n\\n vector<ll> B(N);\\n zawa::segmentTree<zawa::maxMonoid<ll>> S(B);\\n\\n for (int i = 0 ; i < N ; i++) {\\n ll v = S.prod(0, A[i]);\\n B[A[i] - 1] = v + A[i];\\n S.set(A[i] - 1, B[A[i] - 1]);\\n }\\n\\n cout << (ll)N * (N + 1) / 2 - S.prod(0, N) << endl;\\n\\n return 0;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5752,\n \"score_of_the_acc\": -0.638,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2431_8022263\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N; cin >> N;\\n vector<int> A(N);\\n for (auto& a : A) cin >> a;\\n const int INF = (int)2e9;\\n vector<int> dp(N + 1, INF);\\n vector<map<int, ll>> dp2(N + 1);\\n\\n for (auto a : A) {\\n auto it = lower_bound(dp.begin(), dp.end(), a);\\n if (it == dp.begin()) {\\n dp2[0][a] = a;\\n }\\n else {\\n int pos = it - dp.begin() - 1;\\n auto it2 = dp2[pos].lower_bound(a);\\n if (it2 == dp2[pos].begin()) {\\n dp2[pos + 1][a] = (ll)a;\\n }\\n else {\\n it2--;\\n dp2[pos + 1][a] = it2->second + a;\\n }\\n }\\n *it = a;\\n }\\n\\n ll val = 0LL;\\n for (auto& d : dp2) {\\n for (auto& [_, sum] : d) val = max(val, sum);\\n }\\n\\n ll ans = (ll)N * (N + 1) / 2 - val;\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.23076923076923078,\n \"time_ms\": 30,\n \"memory_kb\": 14896,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2431_8022257\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n int N; cin >> N;\\n vector<int> A(N);\\n for (auto& a : A) cin >> a;\\n const int INF = (int)2e9;\\n vector<int> dp(N + 1, INF);\\n vector<map<int, ll>> dp2(N + 1);\\n\\n for (auto a : A) {\\n auto it = upper_bound(dp.begin(), dp.end(), a);\\n if (it == dp.begin()) {\\n dp2[0][a] = a;\\n }\\n else {\\n int pos = it - dp.begin() - 1;\\n auto it2 = dp2[pos].upper_bound(a);\\n if (it2 == dp2[pos].begin()) {\\n dp2[pos + 1][a] = max(dp2[pos + 1][a], (ll)a);\\n }\\n else {\\n it2--;\\n dp2[pos + 1][a] = max(dp2[pos + 1][a], it2->second + a);\\n }\\n }\\n *it = a;\\n }\\n\\n ll val = 0LL;\\n for (auto& d : dp2) {\\n for (auto& [_, sum] : d) val = max(val, sum);\\n }\\n\\n ll ans = (ll)accumulate(A.begin(), A.end(), 0LL) - val;\\n\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.23076923076923078,\n \"time_ms\": 30,\n \"memory_kb\": 14852,\n \"score_of_the_acc\": -1.9959,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2431_8020077\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace segtree_impl {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nconstexpr int bsf_constexpr(unsigned int n) {\\n int x = 0;\\n while(!(n & (1 << x))) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace segtree_impl\\n\\nnamespace segtree_impl {\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\\n public:\\n segtree() : segtree(0) {}\\n explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}\\n explicit segtree(const std::vector<S> &v) : _n(int(v.size())) {\\n log = internal::ceil_pow2(_n);\\n size = 1 << log;\\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--) { update(i); }\\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) const {\\n assert(0 <= p && p < _n);\\n return d[p + size];\\n }\\n\\n S operator[](int k) const { return get(k); }\\n\\n S prod(int l, int r) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(r > _n) r = _n;\\n if(l > r) return e();\\n#endif\\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() const { return d[1]; }\\n\\n template <bool (*f)(S)> int max_right(int l) const {\\n return max_right(l, [](S x) { return f(x); });\\n }\\n template <class F> int max_right(int l, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(l < 0) l = 0;\\n if(l > _n) l = _n;\\n#endif\\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) const {\\n return min_left(r, [](S x) { return f(x); });\\n }\\n template <class F> int min_left(int r, F f) const {\\n#ifdef ONLINE_JUDGE\\n if(r < 0) r = 0;\\n if(r > _n) r = _n;\\n#endif\\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 friend std::ostream &operator<<(std::ostream &os, segtree &ls) {\\n os << \\\"{\\\";\\n for(int i = 0; i < ls._n; i++) os << ls.get(i) << (i == ls._n - 1 ? \\\"\\\" : \\\", \\\");\\n return os << \\\"}\\\";\\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\\ntemplate <class T> constexpr T inf = std::numeric_limits<T>::max() / 2;\\ntemplate <class T, class U> constexpr std::pair<T, U> inf<std::pair<T, U>> = {inf<T>, inf<U>};\\ntemplate <typename T> T min_func(T x, T y) { return min(x, y); }\\ntemplate <typename T> T max_func(T x, T y) { return max(x, y); }\\ntemplate <typename T> T plus_func(T x, T y) { return x + y; }\\ntemplate <typename T, int ID> T set_func(T x, T y) { return (y == ID ? x : y); }\\ntemplate <typename T> T min_e() { return inf<T>; }\\ntemplate <typename T> T max_e() { return -inf<T>; }\\ntemplate <typename T> T plus_e() { return T(); }\\n\\ntemplate <typename T> using RST = segtree<T, plus_func<T>, plus_e<T>>;\\ntemplate <typename T> using RmT = segtree<T, min_func<T>, min_e<T>>;\\ntemplate <typename T> using RMT = segtree<T, max_func<T>, max_e<T>>;\\n\\ntemplate <typename T> struct mMinfo { T mi, ma; };\\ntemplate <typename T> mMinfo<T> mM_func(mMinfo<T> x, mMinfo<T> y) { return mMinfo{min(x.mi, y.mi), max(x.ma, y.ma)}; };\\ntemplate <typename T> mMinfo<T> mM_e() { return {inf<T>, -inf<T>}; }\\n\\ntemplate <typename T> using RmMT = segtree<mMinfo<T>, mM_func<T>, mM_e<T>>;\\n\\n} // namespace segtree_impl\\nusing segtree_impl::RmT;\\nusing segtree_impl::RMT;\\nusing segtree_impl::RST;\\nusing segtree_impl::segtree;\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<long long> a(n);\\n for(auto &e : a) cin >> e;\\n RMT<long long> seg(n + 1);\\n seg.set(0, 0);\\n for(auto &e : a) { seg.set(e, seg.prod(0, e) + e); }\\n cout << (1LL * n * (n + 1) / 2 - seg.all_prod()) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6780,\n \"score_of_the_acc\": -0.7349,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2431_8019510\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define all(a) a.begin(),a.end()\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\nconst ll inf=1e18;\\nstruct RMQ{\\n vector<ll>node;\\n int n;\\n RMQ(int N){\\n n=1;\\n while(n<N)n*=2;\\n node.resize(2*n,-inf);\\n }\\n void upd(int i,ll x){\\n i+=n-1;\\n node[i]=x;\\n while(i>0){\\n i=(i-1)/2;\\n node[i]=max(node[i*2+1],node[i*2+2]);\\n }\\n }\\n ll query(int a,int b,int k,int l,int r){\\n if(b<=l||r<=a)return -inf;\\n if(a<=l&&r<=b)return node[k];\\n ll vl=query(a,b,2*k+1,l,(l+r)/2);\\n ll vr=query(a,b,2*k+2,(l+r)/2,r);\\n return max(vl,vr);\\n }\\n ll get(int L,int R){\\n return query(L,R,0,0,n);\\n }\\n};\\nll p[100005];\\nint main(){\\n ll n;cin>>n;\\n rep(i,n)cin>>p[i];\\n RMQ segtree(n+1);\\n segtree.upd(0,0);\\n rep(i,n){\\n segtree.upd(p[i],p[i]+segtree.get(0,p[i]));\\n }\\n cout<<n*(n+1)/2-segtree.get(0,n+1)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6008,\n \"score_of_the_acc\": -0.6621,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2431_8019509\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define all(a) a.begin(),a.end()\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\nconst ll inf=1e18;\\nstruct RMQ{\\n vector<ll>node;\\n int n;\\n RMQ(int N){\\n n=1;\\n while(n<N)n*=2;\\n node.resize(2*n,-inf);\\n }\\n void upd(int i,ll x){\\n i+=n-1;\\n node[i]=x;\\n while(i>0){\\n i=(i-1)/2;\\n node[i]=max(node[i*2+1],node[i*2+2]);\\n }\\n }\\n ll query(int a,int b,int k,int l,int r){\\n if(b<=l||r<=a)return -inf;\\n if(a<=l&&r<=b)return node[k];\\n ll vl=query(a,b,2*k+1,l,(l+r)/2);\\n ll vr=query(a,b,2*k+2,(l+r)/2,r);\\n return max(vl,vr);\\n }\\n ll get(int L,int R){\\n return query(L,R,0,0,n);\\n }\\n};\\nll p[100005];\\nint main(){\\n int n;cin>>n;\\n rep(i,n)cin>>p[i];\\n RMQ segtree(n+1);\\n segtree.upd(0,0);\\n rep(i,n){\\n segtree.upd(p[i],p[i]+segtree.get(0,p[i]));\\n }\\n cout<<n*(n+1)/2-segtree.get(0,n+1)<<endl;\\n}\",\n \"accuracy\": 0.10256410256410256,\n \"time_ms\": 20,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -0.6614,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2431_8019501\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing H = pair<ll, ll>;\\nusing P = pair<ll, H>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\n#define all(a) (a).begin(), (a).end()\\n#define fs first\\n#define sc second\\n#define xx first\\n#define yy second.first\\n#define zz second.second\\n#define Q(i, j, k) mkp((i), mkp((j), (k)))\\n#define rng(i, s, n) for(int i = (s) ; i < (n) ; i++)\\n#define rep(i, n) rng(i, 0, (n))\\n#define mkp make_pair\\n#define vec vector\\n#define pb emplace_back\\n#define siz(a) int((a).size())\\n#define crdcomp(b) sort(all((b))); (b).erase(unique(all((b))), (b).end())\\n#define getidx(b, i) (lower_bound(all((b)), (i))-(b).begin())\\n#define ssp(i, n) (i==(ll)(n)-1?\\\"\\\\n\\\":\\\" \\\")\\n#define ctoi(c) (int)((c)-'0')\\n#define itoc(c) (char)((c)+'0')\\n#define cyes printf(\\\"Yes\\\\n\\\")\\n#define cno printf(\\\"No\\\\n\\\")\\n#define cdf(n) for(int __quetimes=(n); __quetimes>0; __quetimes--)\\n#define gcj printf(\\\"Case #%lld: \\\", __quetimes+1)\\n#define readv(a, n) (a).resize((n), 0); rep(i, (n)) (a)[i]=read()\\n#define found(a, x) (a.find(x)!=a.end())\\nconstexpr ll mod = (ll)1e9 + 7;\\nconstexpr ll Mod = 998244353;\\nconstexpr ld EPS = 1e-10;\\nconstexpr ll inf = (ll)3 * 1e18;\\nconstexpr int Inf = 1e9;\\nconstexpr int dx[] = { -1, 1, 0, 0 }, dy[] = { 0, 0, -1, 1 };\\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; }\\ntemplate<class T = ll>T read() { T u, k = scanf(\\\"%lld\\\", &u); return u; }\\nstring reads() { string s; cin >> s; return s; }\\nbool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\\nbool ina(int t, int l, int r) { return l <= t && t < r; }\\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\\ntemplate<typename T>\\nvoid fin(T x) { cout << x << endl; exit(0); }\\n//--------------------------------------------------------------\\nclass BIT {\\n int n;\\n vl dat;\\npublic:\\n BIT(int n) :n(n) { dat.assign(n + 1, 0); }\\n void update(int x, ll v) {\\n x++;\\n while (x <= n) {\\n chmax(dat[x], v);\\n x += (x & -x);\\n }\\n }\\n ll max(int x) {\\n x++;\\n ll ret = 0;\\n while (x > 0) {\\n chmax(ret, dat[x]);\\n x -= (x & -x);\\n }\\n return ret;\\n }\\n};\\nsigned main() {\\n int n;cin >> n;\\n vl a(n);rep(i, n) cin >> a[i];\\n BIT bit(n + 1);\\n ll ans = 0;\\n rep(i, n) {\\n ll val = bit.max(a[i]);\\n chmax(ans, val + a[i]);\\n bit.update(a[i], val + a[i]);\\n }\\n ans = -ans;\\n rep(i, n) ans += ll(i + 1);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4656,\n \"score_of_the_acc\": -0.5347,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2431_7979350\",\n \"code_snippet\": \"#include<stdio.h>\\n\\nlong long BIT[100001] = { 0 };\\nint BIT_n = 1;\\n\\nlong long max( long long a, long long b )\\n{\\n return a > b ? a : b;\\n}\\n\\nvoid initBIT( int size )\\n{\\n BIT_n = size;\\n for( int i = 1; i <= BIT_n; i++ )\\n {\\n BIT[i] = 0;\\n }\\n}\\n\\nlong long search( int index )\\n{\\n long long max_val = 0;\\n while( index > 0 )\\n {\\n max_val = max( BIT[index], max_val );\\n index -= ( index & -index );\\n }\\n return max_val;\\n}\\n\\nvoid insert( int index, long long value )\\n{\\n while( index <= BIT_n )\\n {\\n if( value > BIT[index] )\\n {\\n BIT[index] = value;\\n index += ( index & -index );\\n }\\n else\\n {\\n break;\\n }\\n }\\n}\\n\\nint main( void )\\n{\\n long long n;\\n scanf( \\\"%lld\\\", &n );\\n long long items[100000];\\n for( int i = 0; i < n; i++ )\\n {\\n scanf( \\\"%lld\\\", &items[i] );\\n }\\n\\n long long ans = 0, tmp;\\n initBIT( n );\\n for( int i = 0; i < n; i++ )\\n {\\n tmp = search( items[i] ) + items[i];\\n insert( items[i], tmp );\\n ans = max( ans, tmp );\\n }\\n\\n printf( \\\"%lld\\\\n\\\", ( ( long long )n * ( long long )( n + 1 ) / 2 ) - ans );\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.003,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2431_7966734\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\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 << 62)\\n#define MINF (-1 * INF)\\n#define ALL(n) n.begin(), n.end()\\n#define MOD 1000000007\\n#define P pair<ll, ll>\\n\\nstruct SegTree { //せぐつりー！\\n ll sz;\\n vector<ll> dat;\\n SegTree(ll n) {\\n sz = 1;\\n while (sz < n)sz *= 2;\\n dat.resize(2 * sz - 1, 0);//\\n }\\n void update(ll a, ll x) {\\n a += sz - 1;//\\n dat[a] = x;\\n while (a > 0) {\\n a = (a - 1) / 2;\\n dat[a] = max(dat[a * 2 + 1], dat[a * 2 + 2]);//\\n }\\n }\\n ll query(ll a, ll b, ll k = 0, ll l = 0, ll r = -1) {\\n if (r < 0) r = sz;\\n if (r <= a or b <= l)return 0;//\\n if (a <= l and r <= b)return dat[k];//\\n ll q1, q2;\\n q1 = query(a, b, k * 2 + 1, l, (l + r) / 2);\\n q2 = query(a, b, k * 2 + 2, (l + r) / 2, r);\\n return max(q1, q2);//\\n }\\n};\\nSegTree seg(100000);\\nll sum;\\nint main(){\\n ll n;\\n cin >> n;\\n vector<P> s(n);\\n REP(i, n){\\n ll a;\\n cin >> a;\\n sum += a;\\n s[i] = P(a, i);\\n }\\n sort(ALL(s));\\n REP(i, n){\\n seg.update(s[i].second, seg.query(0,s[i].second+1)+s[i].first);\\n }\\n cout << sum - seg.query(0, n)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6808,\n \"score_of_the_acc\": -1.2376,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2431_7943578\",\n \"code_snippet\": \"#include <string.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cfloat>\\n#include <chrono>\\n#include <ciso646>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define REP3(i, l, r, s) \\\\\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\\\\n i += rep3_s)\\n#define REP2(i, l, r) REP3(i, l, r, 1)\\n#define REP1(i, n) REP2(i, 0, n)\\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\\n\\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define RREP3(i, l, r, s) \\\\\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\\\\n i -= rrep3_s)\\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\\n#define RREP1(i, n) RREP2(i, 0, n)\\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\\n#define rrepin(i, l, r) \\\\\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\\n\\n\\n#include <algorithm>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\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 = internal::ceil_pow2(_n);\\n size = 1 << log;\\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 atcoder\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace rklib {\\n\\n// a <- max(a, b)\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// a <- min(a, b)\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// if a < 0: a <- b\\n// else: a <- min(a, b)\\ntemplate <class T>\\nbool chmin_non_negative(T &a, const T &b) {\\n if (a < 0 || a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// floor(num / den)\\ntemplate <class T>\\nT div_floor(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num >= 0 ? num / den : (num + 1) / den - 1;\\n}\\n\\n// ceil(num / den)\\ntemplate <class T>\\nT div_ceil(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num <= 0 ? num / den : (num - 1) / den + 1;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nT remainder_count(T r, T b, T m) {\\n return r / m * b + std::min(b, r % m);\\n}\\n\\n} // namespace internal\\n\\n// Number of integer x s.t.\\n// - x in [l, r)\\n// - x mod m in [a, b)\\ntemplate <class T>\\nT remainder_count(T l, T r, T a, T b, T m) {\\n assert(l >= 0);\\n assert(m >= 1);\\n\\n if (l >= r || a >= b) return 0;\\n if (m <= a || b < 0) return 0;\\n chmax(a, T(0));\\n chmin(b, m);\\n\\n auto res = internal::remainder_count(r, b, m);\\n if (l >= 1) res -= internal::remainder_count(l, b, m);\\n if (a >= 1) res -= internal::remainder_count(r, a, m);\\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\\n\\n return res;\\n}\\n\\n} // namespace rklib\\n\\n\\nusing namespace std;\\nusing namespace rklib;\\n\\nusing lint = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<lint, lint>;\\n\\nlint op(lint a, lint b) { return max(a, b); }\\nlint e() { return 0; }\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i, n) cin >> a[i], --a[i];\\n\\n lint ans = 0;\\n rep(i, n) ans += a[i] + 1;\\n\\n atcoder::segtree<lint, op, e> st(n);\\n rep(i, n) {\\n auto tmp = st.prod(0, a[i]);\\n st.set(a[i], tmp + a[i] + 1);\\n }\\n ans -= st.all_prod();\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6284,\n \"score_of_the_acc\": -0.6882,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2431_7943574\",\n \"code_snippet\": \"#include <string.h>\\n\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cfloat>\\n#include <chrono>\\n#include <ciso646>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <map>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n#define REP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define REP3(i, l, r, s) \\\\\\n for (int i = int(l), rep3_r = int(r), rep3_s = int(s); i < rep3_r; \\\\\\n i += rep3_s)\\n#define REP2(i, l, r) REP3(i, l, r, 1)\\n#define REP1(i, n) REP2(i, 0, n)\\n#define rep(...) REP_OVERLOAD(__VA_ARGS__, REP3, REP2, REP1, )(__VA_ARGS__)\\n#define repin(i, l, r) for (int i = int(l), repin_r = int(r); i <= repin_r; ++i)\\n\\n#define RREP_OVERLOAD(arg1, arg2, arg3, arg4, NAME, ...) NAME\\n#define RREP3(i, l, r, s) \\\\\\n for (int i = int(r) - 1, rrep3_l = int(l), rrep3_s = int(s); i >= rrep3_l; \\\\\\n i -= rrep3_s)\\n#define RREP2(i, l, r) RREP3(i, l, r, 1)\\n#define RREP1(i, n) RREP2(i, 0, n)\\n#define rrep(...) RREP_OVERLOAD(__VA_ARGS__, RREP3, RREP2, RREP1, )(__VA_ARGS__)\\n#define rrepin(i, l, r) \\\\\\n for (int i = int(r), rrepin_l = int(l); i >= rrepin_l; --i)\\n\\n\\n#include <algorithm>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param n `0 <= n`\\n// @return minimum non-negative `x` s.t. `n <= 2**x`\\nint ceil_pow2(int n) {\\n int x = 0;\\n while ((1U << x) < (unsigned int)(n)) x++;\\n return x;\\n}\\n\\n// @param n `1 <= n`\\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\\nint bsf(unsigned int n) {\\n#ifdef _MSC_VER\\n unsigned long index;\\n _BitScanForward(&index, n);\\n return index;\\n#else\\n return __builtin_ctz(n);\\n#endif\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\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 = internal::ceil_pow2(_n);\\n size = 1 << log;\\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 atcoder\\n\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace rklib {\\n\\n// a <- max(a, b)\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// a <- min(a, b)\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// if a < 0: a <- b\\n// else: a <- min(a, b)\\ntemplate <class T>\\nbool chmin_non_negative(T &a, const T &b) {\\n if (a < 0 || a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n// floor(num / den)\\ntemplate <class T>\\nT div_floor(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num >= 0 ? num / den : (num + 1) / den - 1;\\n}\\n\\n// ceil(num / den)\\ntemplate <class T>\\nT div_ceil(T num, T den) {\\n if (den < 0) num = -num, den = -den;\\n return num <= 0 ? num / den : (num - 1) / den + 1;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nT remainder_count(T r, T b, T m) {\\n return r / m * b + std::min(b, r % m);\\n}\\n\\n} // namespace internal\\n\\n// Number of integer x s.t.\\n// - x in [l, r)\\n// - x mod m in [a, b)\\ntemplate <class T>\\nT remainder_count(T l, T r, T a, T b, T m) {\\n assert(l >= 0);\\n assert(m >= 1);\\n\\n if (l >= r || a >= b) return 0;\\n if (m <= a || b < 0) return 0;\\n chmax(a, T(0));\\n chmin(b, m);\\n\\n auto res = internal::remainder_count(r, b, m);\\n if (l >= 1) res -= internal::remainder_count(l, b, m);\\n if (a >= 1) res -= internal::remainder_count(r, a, m);\\n if (l >= 1 && a >= 1) res += internal::remainder_count(l, a, m);\\n\\n return res;\\n}\\n\\n} // namespace rklib\\n\\n\\nusing namespace std;\\nusing namespace rklib;\\n\\nusing lint = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<lint, lint>;\\n\\nint op(int a, int b) { return max(a, b); }\\nint e() { return 0; }\\n\\nint main() {\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i, n) cin >> a[i], --a[i];\\n\\n lint ans = 0;\\n rep(i, n) ans += a[i] + 1;\\n\\n atcoder::segtree<int, op, e> st(n);\\n rep(i, n) {\\n auto tmp = st.prod(0, a[i]);\\n st.set(a[i], tmp + a[i] + 1);\\n }\\n ans -= st.all_prod();\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.10256410256410256,\n \"time_ms\": 20,\n \"memory_kb\": 4932,\n \"score_of_the_acc\": -0.5607,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2431_7523044\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n//Range Maximum Query\\nconst ll SEG_LEN = (1LL << 19);\\nvector<ll> seg(SEG_LEN * 2, 0);\\n\\nvoid update(ll pos, ll val) {\\n pos += SEG_LEN;\\n seg.at(pos) = val;\\n while ((pos /= 2) > 0) {\\n seg.at(pos) = max(seg.at(pos * 2), seg.at(pos * 2 + 1));\\n }\\n}\\n\\n//[ql, qr)\\nll get_max(ll ql, ll qr, ll sl = 0, ll sr = (1 << 19), ll pos = 1) {\\n if (qr <= sl || sr <= ql) {\\n return 0;\\n } else if (ql <= sl && sr <= qr) {\\n return seg.at(pos);\\n } else {\\n ll sm = (sl + sr) / 2;\\n ll l_min = get_max(ql, qr, sl, sm, pos * 2);\\n ll r_min = get_max(ql, qr, sm, sr, pos * 2 + 1);\\n return max(l_min, r_min);\\n }\\n}\\n\\nint main() {\\n ll n;\\n cin >> n;\\n\\n vector<ll> x(n);\\n ll sum = 0;\\n for (int i = 0; i < n; i++) {\\n cin >> x.at(i);\\n sum += x.at(i);\\n }\\n\\n for (int i = 0; i < n; i++) {\\n update(x.at(i), get_max(1, x.at(i)) + x.at(i));\\n }\\n\\n cout << sum - get_max(0, SEG_LEN) << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12148,\n \"score_of_the_acc\": -1.741,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1392,"cells":{"group_id":{"kind":"string","value":"aoj_2423_cpp"},"problem_description":{"kind":"string","value":"Code Art Online\nG: コードアートオンライン\nコードアートオンライン（CAO）は，様々な問題をプログラミングによって解くことにより，冒険を進めて行くオンラインRPGである．\nCAOは，世界初のバーチャルリアリティ空間を実現したゲームであったこともあり，大人気の内に完売し，ゲームを購入したユーザ達はこの世界を楽しむはずであった．\nしかし，ゲームにダイブしたプレイヤー達は，ゲームマスターから恐るべき託宣を聞かされる．\n「君たちプレイヤーの内の誰かが，ラストダンジョンのラストプロブレムを解かない限り，この仮想空間から抜け出すことはできない．そして，この世界での，WAやTLE・REは，現実世界での死を意味する．心して問題にとりかかってほしい．」\nあなたも，CAOのプレイヤーの内の1人で，このゲームをクリアして現実世界に戻るために，ゲーム攻略に全力を尽くしている．\nある日，あなたは次のような問題に直面することとなった．\n今回，新たなダンジョンを攻略するために，\nn\n人のメンバーでパーティが組まれた．\nあなたもこのパーティの内の1人である．\n今から攻略するダンジョンに突入するためには，崖から見える穴を通過しなくてはならない．\n無事に穴を通過できれば，ダンジョンに突入できるが，穴に突入できず他の部分に触れてしまうと，死が待っている．\nさらに，1つの穴に誰かが通ると，その穴は閉じてしまうため，1人1人別々の穴に入らなければならない．\n穴や人は，二次元平面上で考えることとする．\n穴の形は，図G-1のような，大小様々な円である．入力では，半径の長さが与えられる．\n図G-1: 穴の形\n人の形は，図G-2のように人の断面が多角形で与えられる（凸とは限らない）．\n入力では，多角形の形を表すために，頂点が反時計まわりで与えられる．\n多角形の任意の三点は，1直線上に並ばないと仮定してよい．\nさらに，頂点を構成する目的以外で，多角形の線分同士が交差することはないものとする．\n穴に通すために，自由に回転してよい（ただし，z軸方向への回転は禁止する）．\n人を表す多角形の頂点が，穴の円周上にある場合でも，穴を通過できるものとする．\n図G-2: 人の形\nパーティの中で最もアルゴリズムスキルが高いあなたは，みんなで無事に穴を通過できるかどうかの判定問題を解くことにした．\nもし，無事に通過できるなら，どの人がどの穴を通過すればいいのか表示せよ．\n※今回のコンテストで死ぬことはありませんが，間違ったら死ぬつもりで解いてください．\nInput\n1行目に，穴の数を表す整数\nn\n(1 <=\nn\n<= 100)と，パーティの人数を表す整数\nm\n(1 <=\nm\n<=\nn\n)がスペース区切りで入力される．\n次の行に，穴の半径を表す整数\nr\ni\n(1 <=\nr\ni\n<= 1000)がスペース区切りで\nn\n個入力される．\nこれらの穴は，入力された順番に，1番の穴, 2番の穴, ...,\nn\n番の穴と数えることとする．\n続いて，\nm\n人の人の形の情報が入力される．\n1人の情報は，まず1行目に多角形の頂点数\np\n(3 <=\np\n<= 100)が入力される．\n続く\np\n行には，多角形の頂点の座標が反時計周りで与えられる．\n各行には，1つの頂点を表す整数\nx\ni\n,\ny\ni\n(-1000 <=\nx\ni\n,\ny\ni\n<= 1000)がスペース区切りで入力される．\n人は，入力された順番に，1番の人, 2番の人, ...,\nm\n番の人と数えることとする．\nOutput\ni\n番(1 <=\ni\n<=\nm\n)の人が，何番の穴に入ればいいかを出力せよ．\ni\n行目には，\ni\n番の人が通るべき穴の番号を出力すること．\nもし，複数の通り方がある場合，辞書順で一番小さくなる通り方を出力すること．\n2つの数列\nA\n= {\na\n1\n,\na\n2\n, ...,\na\nm\n}と\nB\n= {\nb\n1\n,\nb\n2\n, ...,\nb\nm\n}があったとき，\nA\nが\nB\nより辞書順で小さいとは，\na\ni\nが\nb\ni\nと異なるような最初の\ni\nについて，\na\ni\nが\nb\ni\nより小さいときのことを言う．\n通り方が1つも見つからない場合は，\"NG\"と1行出力すること．\n最後に改行を出力するのを忘れないこと．\nSample Input 1\n3 3\n25 100 10\n8\n-10 0\n-2 2\n0 10\n2 2\n10 0\n2 -2\n0 -10\n-2 -2\n4\n30 0\n50 0\n50 40\n30 40\n3\n30 -10\n45 -70\n60 -10\nSample Output 1\n3\n1\n2\nSample Input 2\n4 3\n25 15 15 30\n5\n0 0\n10 0\n20 10\n0 20\n-20 10\n3\n20 0\n40 0\n30 10\n3\n-50 0\n-30 0\n-40 10\nSample Output 2\n1\n2\n3\nSample Input 3\n2 2\n1 30\n4\n0 0\n10 0\n10 10\n0 10\n3\n5 5\n20 20\n5 20\nSample Output 3\nNG"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2423_8818854","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":170,"memory_kb":3580,"score_of_the_acc":-1.1103,"final_rank":15},{"submission_id":"aoj_2423_8216523","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 100) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3596,"score_of_the_acc":-0.9718,"final_rank":3},{"submission_id":"aoj_2423_8216520","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":170,"memory_kb":3596,"score_of_the_acc":-1.1666,"final_rank":17},{"submission_id":"aoj_2423_8113469","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"avx,avx2,sse,sse2\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3600,"score_of_the_acc":-1.0509,"final_rank":11},{"submission_id":"aoj_2423_8113468","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"avx,avx2,fma\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3604,"score_of_the_acc":-1.0779,"final_rank":14},{"submission_id":"aoj_2423_8113466","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":170,"memory_kb":3584,"score_of_the_acc":-1.1244,"final_rank":16},{"submission_id":"aoj_2423_8113462","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"avx,avx2,fma\")\n#pragma GCC optimize(\"unroll-loops\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3600,"score_of_the_acc":-1.0638,"final_rank":13},{"submission_id":"aoj_2423_8113461","code_snippet":"#pragma GCC optimize(\"Ofast,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3592,"score_of_the_acc":-1.0227,"final_rank":6},{"submission_id":"aoj_2423_8113459","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"avx,avx2,fma\")\n#pragma GCC optimization(\"unroll-loops\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3596,"score_of_the_acc":-1.0498,"final_rank":9},{"submission_id":"aoj_2423_8113458","code_snippet":"#pragma GCC optimize(\"Ofast,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3600,"score_of_the_acc":-1.0509,"final_rank":11},{"submission_id":"aoj_2423_8113455","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3592,"score_of_the_acc":-1.0357,"final_rank":8},{"submission_id":"aoj_2423_8113454","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3596,"score_of_the_acc":-1.0498,"final_rank":9},{"submission_id":"aoj_2423_8113452","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int, int> pii;\n#define all(c) (c).begin(), (c).end()\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\n#define rep(i, b) loop(i, 0, b)\n#define each(e, c) for (auto &e : c)\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define lb lower_bound\n#define ub upper_bound\n#ifdef DEBUG\n#define dump(...) \\\n (cerr << #__VA_ARGS__ << \" = \" << (DUMP(), __VA_ARGS__).str() << \" [\" \\\n << __LINE__ << \"]\" << endl)\nstruct DUMP : ostringstream {\n template <class T> DUMP &operator,(const T &t) {\n if (this->tellp())\n *this << \", \";\n *this << t;\n return *this;\n }\n};\n#else\n#define dump(...)\n#endif\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n return os;\n}\n#include <algorithm>\n#include <complex>\n#include <cstdio>\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n#define curr(g, i) g[i]\n#define next(g, i) g[(i + 1) % g.size()]\n#define self (*this)\ntypedef long double R;\nconst R eps = 1e-10;\nconst R inf = 1e12;\nconst R pi = acos(-1);\ntypedef complex<R> P;\nR arg(P a, P b, P c) {\n R th = arg((a - b) / (c - b));\n return th > 0 ? th : th + 2 * pi;\n}\nbool comp_x(P const &a, P const &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\nbool comp_y(P const &a, P const &b) {\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\n}\nP CENTER = P();\nbool comp_arg(P const &a, P const &b) {\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\n}\nnamespace std {\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\n} // namespace std\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\nstruct L : public vector<P> {\n L(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L(R a, R b, R c) {\n if (fabs(a) < eps)\n self = L(P(0, -c / b), P(1, -c / b));\n else if (fabs(b) < eps)\n self = L(P(-c / a, 0), P(-c / a, 1));\n else\n self = L(P(-c / a, 0), P(0, -c / b));\n }\n P vec() const { return self[1] - self[0]; }\n};\nstruct S : public vector<P> {\n S(P const &a = P(), P const &b = P()) {\n push_back(a);\n push_back(b);\n }\n L line() const { return L(self[0], self[1]); }\n P vec() const { return line().vec(); }\n R len() const { return abs(vec()); }\n};\ntypedef vector<P> G;\nstruct C {\n P p;\n R r;\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\n};\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\nint ccw(P a, P b, P c) {\n b -= a;\n c -= a;\n if (cross(b, c) > 0)\n return CCW;\n if (cross(b, c) < 0)\n return CW;\n if (dot(b, c) < 0)\n return CAB;\n if (norm(b) < norm(c))\n return ABC;\n return SEG;\n}\nR area(C const &c) { return pi * c.r * c.r; }\nR area(G const &g) {\n R res = 0;\n int n = g.size();\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\n return abs(res) / 2;\n}\nR heron(R a, R b, R c) {\n R s = (a + b + c) / 2;\n return sqrt(s * (s - a) * (s - b) * (s - c));\n}\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\n}\nP gravity_center(P const &a, P const &b, P const &c) {\n return biased_center(a, b, c, 1, 1, 1);\n}\nP inner_center(P const &a, P const &b, P const &c) {\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\n return biased_center(a, b, c, la, lb, lc);\n}\nP circumcenter(P const &a, P const &b, P const &c) {\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\n sc = sin(2 * arg(b, c, a));\n return biased_center(a, b, c, sa, sb, sc);\n}\nP orthocenter(P const &a, P const &b, P const &c) {\n if (abs(arg(c, a, b)) == pi)\n return a;\n if (abs(arg(a, b, c)) == pi)\n return b;\n if (abs(arg(b, c, a)) == pi)\n return c;\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\n return biased_center(a, b, c, ta, tb, tc);\n}\nP excenter(P const &a, P const &b, P const &c) {\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\n return biased_center(a, b, c, -sa, sb, sc);\n}\nbool col(L const &l, L const &m) {\n return abs(cross(l.vec(), m.vec())) > eps ||\n abs(cross(l.vec(), m[0] - l[0])) < eps;\n}\nbool col(L const &l, S const &s) {\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\n}\nbool col(S const &s, L const &l) { return col(l, s); }\nbool col(L const &l, P const &p) {\n return abs(cross(l[1] - p, l[0] - p)) < eps;\n}\nbool col(P const &p, L const &l) { return col(l, p); }\nbool col(const S &s, const S &t) {\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\n}\nbool col(const S &s, const P &p) {\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\n}\nint col(const C &c1, const C &c2) {\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\n if (r1 + r2 < d)\n return 0;\n if (abs(r1 + r2 - d) < eps)\n return 1;\n if (abs(d - abs(r1 - r2)) < eps)\n return -1;\n if (d < r1 - r2)\n return +3;\n if (d < r2 - r1)\n return -3;\n return 2;\n}\nP proj(L const &l, P const &p) {\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\n return l[0] + t * (l.vec());\n}\nP proj(P const &p, L const &l) { return proj(l, p); }\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\nP refl(P const &p, L const &l) { return refl(l, p); }\nR dist(P const &p, P const &q) { return abs(p - q); }\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\nR dist(P const &p, L const &l) { return dist(l, p); }\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\nR dist(L const &l, S const &s) {\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\n}\nR dist(S const &s, L const &l) { return dist(l, s); }\nR dist(S const &s, P const &p) {\n P const r = proj(s.line(), p);\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\n}\nR dist(P const &p, S const &s) { return dist(s, p); }\nR dist(S const &s, S const &t) {\n return col(s, t) ? 0\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\n dist(t, s[1]));\n}\nvector<P> hit(L const &l, L const &m) {\n R A = cross(l.vec(), m.vec());\n R B = cross(l.vec(), l[1] - m[0]);\n if (abs(A) < eps && abs(B) < eps)\n return {m[0]};\n if (abs(A) < eps)\n return G();\n return {m[0] + B / A * (m.vec())};\n}\nvector<P> hit(S const &s, S const &t) {\n return col(s, t) ? hit(s.line(), t.line()) : G();\n}\nvector<P> hit(L const &l, S const &s) {\n return col(l, s) ? hit(l, s.line()) : G();\n}\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\nvector<P> hit(C const &c, L const &l) {\n R d = dist(l, c.p);\n if (fabs(d - c.r) < eps)\n return {proj(l, c.p)};\n if (d > c.r)\n return G();\n P h = proj(l, c.p);\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\n return {h + u, h - u};\n}\nvector<P> hit(C const &c, S const &s) {\n G cps = hit(c, s.line()), res;\n for (const P &p : cps)\n if (col(s, p))\n res.push_back(p);\n return res;\n}\nvector<P> hit(C const &c1, C const &c2) {\n if (abs(c1.p - c2.p) < 0)\n return G();\n int i = col(c1, c2);\n if (i == 0 || abs(i) == 3)\n return G();\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\n if (i == 1)\n return {c1.p + (c2.p - c1.p) * r1 / d};\n P p = c1.p - c2.p;\n R A = -2. * p.real(), B = 2 * p.imag();\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\n return hit(c1, L(A, B, C));\n}\nvector<P> hit(C const &c, G const &g) {\n vector<P> res;\n int n = g.size();\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\n return res;\n}\nC min_ball(G const &g) {\n int n = g.size();\n if (n == 1)\n return C(g[0], 0);\n if (n == 2)\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\n R r = 1.0;\n rep(i, 1000) {\n R d = 0;\n int x = 0;\n rep(j, n) {\n if (d < abs(g[j] - c)) {\n d = abs(g[j] - c);\n x = j;\n }\n }\n c += (g[x] - c) * r;\n if (i & 2)\n r *= 0.8;\n }\n R d = -1;\n int x = 0;\n rep(i, n) {\n if (d < abs(c - g[i])) {\n d = abs(c - g[i]);\n x = i;\n }\n }\n return C(c, abs(c - g[x]));\n}\nint n, m;\nR r[111], mb[111];\nvi ans;\nbool used[111];\nbool chk(int s) {\n vi b;\n rep(i, n) if (!used[i]) b.eb(r[i]);\n vector<R> a;\n loop(i, s, m) a.eb(mb[i]);\n sort(all(a));\n sort(all(b));\n int last = -1;\n rep(i, a.size()) {\n bool found = false;\n loop(j, last + 1, b.size()) {\n if (a[i] < b[j] + eps) {\n found = true;\n last = j;\n break;\n }\n }\n if (!found)\n return false;\n }\n return true;\n}\nint main() {\n#ifdef LOCAL\n freopen(\"in\", \"r\", stdin);\n#endif\n while (cin >> n >> m) {\n ans.clear();\n rep(i, n) cin >> r[i];\n rep(i, m) {\n int k;\n cin >> k;\n G g(k);\n rep(j, k) {\n R x, y;\n cin >> x >> y;\n g[j] = P(x, y);\n }\n mb[i] = min_ball(g).r;\n }\n rep(i, m) used[i] = false;\n bool f = true;\n rep(i, m) {\n bool found = false;\n rep(j, n) {\n if (used[j])\n continue;\n if (!(mb[i] < r[j] + eps))\n continue;\n used[j] = true;\n if (chk(i + 1)) {\n ans.push_back(j);\n found = true;\n break;\n }\n used[j] = false;\n }\n if (!found) {\n f = false;\n break;\n }\n }\n if (f) {\n rep(i, m) cout << ans[i] + 1 << \"\\n\";\n } else\n cout << \"NG\" << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3588,"score_of_the_acc":-1.0216,"final_rank":5},{"submission_id":"aoj_2423_5499342","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 205\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\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\ntypedef Point Vector;\ntypedef vector<Point> Polygon;\n\n\n\nint N,M;\nint work[SIZE],ANS[SIZE];\ndouble R[SIZE],need_R[SIZE];\nbool FLG,check[SIZE];\nPolygon POLY[SIZE];\n\nint C_INDEX[SIZE];\n\nint V;\nvector<Edge> G[SIZE];\nint dist[SIZE];\nint cheked_index[SIZE];\n\n\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 calc(double x,double y,int index){\n\n\tPoint base = Point(x,y);\n\n\tdouble ret = 0;\n\n\tfor(int i = 0; i < POLY[index].size(); i++){\n\n\t\tdouble tmp_dist = calc_dist(base,POLY[index][i]);\n\t\tret = max(ret,tmp_dist);\n\t}\n\n\treturn ret;\n}\n\ndouble thirds_searchY(double X,int index){\n\n\tdouble L = -1001,R = 1001;\n\n\tfor(int loop = 0; loop < 100; loop++){\n\n\t\tdouble mid1 = (2.0*L+R)/3.0;\n\t\tdouble mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\tif(calc(X,mid1,index) > calc(X,mid2,index)){\n\n\t\t\tL = mid1;\n\t\t}else{\n\n\t\t\tR = mid2;\n\t\t}\n\t}\n\n\treturn calc(X,(L+R)/2,index);\n}\n\ndouble thirds_searchX(int index){\n\n\tdouble L = -1001,R = 1001;\n\n\tfor(int loop = 0; loop < 100; loop++){\n\n\t\tdouble mid1 = (2.0*L+R)/3.0;\n\t\tdouble mid2 = (1.0*L+2.0*R)/3.0;\n\n\t\tif(thirds_searchY(mid1,index) > thirds_searchY(mid2,index)){\n\n\t\t\tL = mid1;\n\t\t}else{\n\n\t\t\tR = mid2;\n\t\t}\n\t}\n\n\treturn thirds_searchY((L+R)/2,index);\n}\n\n\n\nvoid add_edge(int from,int to,int capacity){\n\tG[from].push_back(Edge(to,capacity,G[to].size()));\n\tG[to].push_back(Edge(from,0,G[from].size()-1));\n}\n\n\n//sourceからの最短距離をBFSで計算する\nvoid bfs(int source){\n\tfor(int i = 0; i < V; i++)dist[i] = -1;\n\tqueue<int> Q;\n\tdist[source] = 0;\n\tQ.push(source);\n\n\twhile(!Q.empty()){\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\tEdge &e = G[node_id][i];\n\t\t\tif(e.capacity > 0 && dist[e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\n\t\t\t\tdist[e.to] = dist[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(int node_id,int sink,int flow){\n\tif(node_id == sink)return flow; //終点についたらflowをreturn\n\n\tfor(int &i = cheked_index[node_id]; i < G[node_id].size(); i++){ //node_idから出ているエッジを調査\n\t\tEdge &e = G[node_id][i];\n\t\tif(e.capacity > 0 && dist[node_id] < dist[e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\n\t\t\tint tmp_flow = dfs(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[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\n//sourceからsinkへの最大流を求める\nint max_flow(int source,int sink){ //source:始点 sink:終点\n\tint flow = 0,add;\n\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\n\t\tbfs(source);\n\t\tif(dist[sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\n\t\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\n\t\twhile((add = dfs(source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\n\t\t\tflow += add;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\nvoid delete_edge(int from,int index){\n\n\t//ノーマル辺を消す\n\tG[from][index].capacity = 0;\n\tint rev_from = G[from][index].to;\n\n\t//逆辺を消す\n\tint left = 0,right = G[rev_from].size()-1,mid = (left+right)/2;\n\n\twhile(left <= right){\n\n\t\tif(G[rev_from][mid].to == from){\n\n\t\t\tG[rev_from][mid].capacity = 0;\n\t\t\treturn;\n\n\t\t}else if(G[rev_from][mid].to > from){\n\n\t\t\tright = mid-1;\n\n\t\t}else{\n\t\t\tleft = mid+1;\n\t\t}\n\t\tmid = (left+right)/2;\n\t}\n}\n\nbool find_a_path(int source,int sink){ //sourceからsinkへの増加パスがあるか調べる\n\n\tbfs(source);\n\n\tif(dist[sink] < 0){\n\t\treturn false; //増加パスがなければfalse\n\t}\n\n\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\n\n\treturn dfs(source,sink,1) == 1; //sourceからsinkに1流せるか調べる\n}\n\nint main(){\n\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf\",&R[i]);\n\t}\n\n\n\tint source = N+M,sink = source+1;\n\tV = N+M+2;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tadd_edge(source,i,1);\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tC_INDEX[i] = M+i;\n\t\tadd_edge(C_INDEX[i],sink,1);\n\t}\n\n\tint num_P;\n\tdouble x,y;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%d\",&num_P);\n\t\tfor(int k = 0; k < num_P; k++){\n\n\t\t\tscanf(\"%lf %lf\",&x,&y);\n\t\t\tPOLY[i].push_back(Point(x,y));\n\t\t}\n\n\t\tneed_R[i] = thirds_searchX(i);\n\t}\n\n\t//辺張り\n\tfor(int i = 0; i < M; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tif(need_R[i] <= R[k]+EPS){\n\n\t\t\t\tadd_edge(i,C_INDEX[k],1);\n\t\t\t}\n\t\t}\n\t}\n\n\n\tif(max_flow(source,sink) < M){\n\n\t\tprintf(\"NG\\n\");\n\t\treturn 0;\n\t}\n\n\tfor(int k = 0; k < M; k++){\n\n\t\t//番号の大きい部品から、降順に見ていく\n\t\tfor(int i = G[k].size()-1; i >= 0; i--){\n\n\t\t\tif(G[k][i].capacity == 1){ //エッジに流れていない場合\n\n\t\t\t\tdelete_edge(k,i); //流れないように、辺を論理削除\n\n\t\t\t}else{ //エッジに流れている場合\n\n\t\t\t\t//★残余グラフ上で別の経路がないか試す★\n\t\t\t\tif(find_a_path(k,G[k][i].to)){\n\n\t\t\t\t\tdelete_edge(k,i); //より小さい番号の部品とマッチできるので、辺を論理削除\n\n\t\t\t\t}else{ //流せない:辺確定\n\n\t\t\t\t\tprintf(\"%d\\n\",G[k][i].to+1-M);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":780,"memory_kb":3388,"score_of_the_acc":-1.2264,"final_rank":18},{"submission_id":"aoj_2423_4802264","code_snippet":"#include <iostream>\n#include <array>\n#include <vector>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <math.h>\n#include <string>\n#include <climits>\n#include <assert.h>\n#include <iomanip>\n#include <bitset>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <functional>\n#include <fstream>\n#include <random>\n\n#define LEN(x) (long long)(x.size())\n#define FOR(i, a, n) for(int i=(a);i<(n); ++i)\n#define FOE(i, a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT_COUNT(bit) (__builtin_popcount(bit))\n\nusing LL = long long;\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) { return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); } // C++14\ntemplate<typename T, typename V>\ntypename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }\n\ntemplate<typename T, typename V>\ntypename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for (auto &e:t) fill_v(e, v); }\n\ntemplate<class T>\ninline T ceil(T a, T b) { return (a + b - 1) / b; }\n\nvoid print() { std::cout << std::endl; }\n\ntemplate<class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n std::cout << head;\n if (sizeof...(tail) != 0) { std::cout << \" \"; }\n print(std::forward<Tail>(tail)...);\n}\n\ntemplate<class T>\nvoid print(std::vector<T> &v) {\n for (auto &a : v) {\n std::cout << a;\n if (&a != &v.back()) { std::cout << \" \"; }\n }\n std::cout << std::endl;\n}\n\ntemplate<class T>\nvoid print(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}\n\nvoid debug() { std::cerr << std::endl; }\n\ntemplate<class Head, class... Tail>\nvoid debug(Head &&head, Tail &&... tail) {\n std::cerr << head;\n if (sizeof...(tail) != 0) { std::cerr << \" \"; }\n print(std::forward<Tail>(tail)...);\n}\n\ntemplate<class T>\nvoid debug(std::vector<T> &v) {\n for (auto &a : v) {\n std::cerr << a;\n if (&a != &v.back()) { std::cerr << \" \"; }\n }\n std::cerr << std::endl;\n}\n\ntemplate<class T>\nvoid debug(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}\n\ninline bool inside(long long y, long long x, long long H, long long W) { return 0 <= y and y < H and 0 <= x and x < W; }\n\ntemplate<class T>\ninline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\n\ntemplate<class T>\ninline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\ntemplate<typename T>\nT &chmin(T &a, const T &b) { return a = std::min(a, b); }\n\ntemplate<typename T>\nT &chmax(T &a, const T &b) { return a = std::max(a, b); }\n\nbool is_bit_on(const unsigned long long bit, const unsigned int i) { return (bit >> i) & 1u; }\n\nunsigned long long bit_set(const unsigned long long bit, const unsigned int i, const unsigned int b) {\n assert(b == 0 or b == 1);\n if (b == 0) { return bit & ~(1ull << i); }\n else { return bit | (1ull << i); }\n}\n\n// 初項s交差d長さnの数列の和\nlong long sum_of_arithmetic_progression(long long s, long long d, long long n) {\n return n * (2 * s + (n - 1) * d) / 2;\n}\n\n// xが2の階乗かどうか判定\nbool is_power_of_two(long long x) {\n return !(x & (x - 1));\n}\n\nlong long gcd(long long a, long long b) {\n if (b == 0) { return a; }\n return gcd(b, a % b);\n}\n\nlong long gcd(std::vector<long long> &v) {\n long long ans = v[0];\n for (int i = 1; i < (int) v.size(); ++i) {\n ans = gcd(ans, v[i]);\n }\n return ans;\n}\n\nlong long lcm(long long a, long long b) {\n long long g = gcd(a, b);\n return a / g * b;\n}\n\nconst int INF = 1u << 30u; // 1,073,741,824\nconst long long LINF = 1ull << 60u;\nconst double EPS = 1e-9;\nconst long double PI = acos(-1.0);\nconst std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};\nconst std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};\nconst std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1}, dx8 = {1, 0, -1, 0, 1, 1, -1, -1};\n\nclass Point {\npublic:\n double x;\n double y;\n\n Point(): x(0), y(0) {}\n Point(double x, double y) : x(x), y(y) {}\n};\n\nclass SmallestEnclosingCircle {\nprivate:\n double min_x;\n double max_x;\n double min_y;\n double max_y;\n\npublic:\n SmallestEnclosingCircle() {}\n\n // 最小包含円の半径\n double solve(const std::vector<Point> &points) {\n this->min_x = this->max_x = points[0].x;\n this->min_y = this->max_y = points[0].y;\n\n for (const auto &p : points) {\n this->min_x = std::min(this->min_x, p.x);\n this->max_x = std::max(this->max_x, p.x);\n this->min_y = std::min(this->min_y, p.y);\n this->max_y = std::max(this->max_y, p.y);\n }\n\n double l = this->min_x - 1.0;\n double r = this->max_x + 1.0;\n\n // x座標で3分探索\n for (int _ = 0; _ < 100; ++_) {\n const double c1 = (l * 2 + r) / 3.0;\n const double c2 = (l + r * 2) / 3.0;\n\n if (g(c1, points) > g(c2, points)) {\n l = c1;\n } else {\n r = c2;\n }\n }\n\n return g(l, points);\n }\n\nprivate:\n\n // 点aと点bの距離\n double dist(const Point &a, const Point &b) {\n double dx = a.x - b.x;\n double dy = a.y - b.y;\n return sqrt(dx * dx + dy * dy);\n }\n\n // nowから最も遠い点までの距離\n double max_distance(const Point &now, const std::vector<Point> &points) {\n double res = 0;\n for (const auto p : points) {\n res = std::max(res, dist(now, p));\n }\n return res;\n }\n\n // x座標を決めたときの，y軸の距離を最小化\n double g(const double x, const std::vector<Point> &points) {\n double l = this->min_y - 1.0;\n double r = this->max_y + 1.0;\n\n for (int _ = 0; _ < 100; ++_) {\n double c1 = (l * 2 + r) / 3;\n double c2 = (l + r * 2) / 3;\n\n if (max_distance(Point(x, c1), points) > max_distance(Point(x, c2), points)) {\n l = c1;\n } else {\n r = c2;\n }\n }\n\n return max_distance(Point(x, l), points);\n }\n};\n\nusing namespace std;\n\n// iさんをhole[j]に割り当てられるか\nbool can_assign(int i, int j, vector<bool> &used, vector<double> &holes, vector<double> &dists) {\n vector<double> rest_dists;\n for (int k = i + 1; k < dists.size(); ++k) {\n rest_dists.emplace_back(dists[k]);\n }\n sort(rest_dists.rbegin(), rest_dists.rend());\n\n vector<double> rest_holes;\n for (int k = 0; k < (int)holes.size(); ++k) {\n if (k != j and not used[k]) {\n rest_holes.emplace_back(holes[k]);\n }\n }\n sort(rest_holes.rbegin(), rest_holes.rend());\n\n assert(rest_holes.size() >= rest_dists.size());\n for (int k = 0; k < rest_dists.size(); ++k) {\n if (rest_holes[k] < rest_dists[k]) {\n return false;\n }\n }\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n\n int N, M;\n cin >> N >> M;\n vector<double> holes(N);\n for (int i = 0; i < N; ++i) {\n cin >> holes[i];\n }\n\n vector<double> dist(M);\n for (int i = 0; i < M; ++i) {\n int P;\n cin >> P;\n vector<Point> points(P);\n\n for (int j = 0; j < P; ++j) {\n cin >> points[j].x >> points[j].y;\n }\n\n SmallestEnclosingCircle sec;\n dist[i] = sec.solve(points) - EPS;\n }\n\n vector<int> ans(M, -1);\n vector<bool> used(N);\n for (int i = 0; i < M; ++i) {\n for (int j = 0; j < N; ++j) {\n if (not used[j] and dist[i] <= holes[j]) {\n if (can_assign(i, j, used, holes, dist)) {\n ans[i] = j;\n used[j] = true;\n break;\n }\n }\n }\n if (ans[i] == -1) {\n cout << \"NG\" << endl;\n return 0;\n }\n }\n\n for (int i = 0; i < M; ++i) {\n cout << ans[i] + 1 << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":790,"memory_kb":3328,"score_of_the_acc":-1.0282,"final_rank":7},{"submission_id":"aoj_2423_4105324","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\n{ return s << '<' << P.first << \", \" << P.second << '>'; }\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\n\n\n\nusing DD = double;\nconst DD INF = 1LL<<60; // to be set appropriately\nconst DD EPS = 1e-6; // to be set appropriately\nconst DD PI = acosl(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\n/* Point */\nstruct Point {\n DD x, y;\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \", \" << p.y << ')';}\n};\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\ninline DD norm(const Point &p) {return dot(p, p);}\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\n// 最小包含円\nconst int ITER = 100;\n\nDD f(const vector<Point> &v, DD x, DD y) {\n DD res = 0;\n for (int i = 0; i < v.size(); ++i) res = max(res, abs(v[i] - Point(x, y)));\n return res;\n}\n\nDD g(const vector<Point> &v, DD x) {\n DD left = -10000, right = 10000;\n for (int _ = 0; _ < ITER; ++_) {\n DD m1 = (left * 2 + right) / 3;\n DD m2 = (left + right * 2) / 3;\n if (f(v, x, m1) > f(v, x, m2)) left = m1;\n else right = m2;\n }\n return f(v, x, left);\n}\n\nDD mic(const vector<Point> &v) {\n DD left = -10000, right = 10000;\n for (int _ = 0; _ < ITER; ++_) {\n DD m1 = (left * 2 + right) / 3;\n DD m2 = (left + right * 2) / 3;\n if (g(v, m1) > g(v, m2)) left = m1;\n else right = m2;\n }\n return g(v, left);\n}\n\n// 人がすべてマッチできるか\nbool can(vector<DD> person, vector<DD> ana) {\n sort(person.begin(), person.end());\n sort(ana.begin(), ana.end());\n int j = 0;\n for (int i = 0; i < person.size(); ++i) {\n while (j < ana.size() && person[i] > ana[j] + EPS) ++j;\n if (j == ana.size()) return false;\n ++j;\n }\n return true;\n}\n\nint main() {\n int N, M; cin >> N >> M;\n vector<pair<DD,int>> r(N), p(M);\n vector<vector<Point>> vp(M);\n for (int i = 0; i < N; ++i) cin >> r[i].first, r[i].second = i;\n for (int i = 0; i < M; ++i) {\n int a; cin >> a;\n vp[i].resize(a);\n for (int j = 0; j < a; ++j) cin >> vp[i][j].x >> vp[i][j].y;\n p[i] = {mic(vp[i]), i};\n }\n\n vector<DD> person, ana;\n for (int i = 0; i < p.size(); ++i) person.push_back(p[i].first);\n for (int i = 0; i < r.size(); ++i) ana.push_back(r[i].first);\n if (!can(person, ana)) {\n cout << \"NG\" << endl;\n return 0;\n }\n\n for (int i = 0; i < M; ++i) {\n vector<DD> person;\n for (int j = i+1; j < M; ++j) person.push_back(p[j].first);\n for (int j = 0; j < r.size(); ++j) {\n if (p[i].first > r[j].first + EPS) continue;\n vector<DD> ana;\n for (int k = 0; k < r.size(); ++k) {\n if (k == j) continue;\n ana.push_back(r[k].first);\n }\n if (can(person, ana)) {\n cout << r[j].second + 1 << endl;\n r.erase(r.begin()+j);\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":790,"memory_kb":3320,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_2423_3655829","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=a;i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(a>b)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\ntemplate<class d>\nstruct maxflow{\n\tstruct E{\n\t\tint to,rev;\n\t\td cap;\n\t};\n\tvvc<E> g;\n\tvi itr,lv;\n\tmaxflow(int n):g(n),itr(n),lv(n){}\n\tvoid ae(int s,int t,d c){\n\t\tg[s].pb({t,(int)g[t].size(),c});\n\t\tg[t].pb({s,(int)g[s].size()-1,0});\n\t}\n\tvoid bfs(int s){\n\t\tfill(all(lv),-1);\n\t\tlv[s]=0;\n\t\tqueue<int> q;\n\t\tq.push(s);\n\t\twhile(q.size()){\n\t\t\tint v=q.front();q.pop();\n\t\t\tfor(auto e:g[v])if(e.cap>0&&lv[e.to]==-1){\n\t\t\t\tlv[e.to]=lv[v]+1;\n\t\t\t\tq.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n\td dfs(int v,int t,d f){\n\t\tif(v==t)return f;\n\t\td res=0;\n\t\tfor(int&i=itr[v];i<(int)g[v].size();i++){\n\t\t\tE& e=g[v][i];\n\t\t\tif(e.cap>0&&lv[e.to]==lv[v]+1){\n\t\t\t\td a=dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(a>0){\n\t\t\t\t\te.cap-=a;\n\t\t\t\t\tg[e.to][e.rev].cap+=a;\n\t\t\t\t\tres+=a;\n\t\t\t\t\tf-=a;\n\t\t\t\t\tif(f<=0)break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\td calc(int s,int t){\n\t\td f=0;\n\t\twhile(1){\n\t\t\tbfs(s);\n\t\t\tif(lv[t]==-1)\n\t\t\t\treturn f;\n\t\t\tfill(all(itr),0);\n\t\t\tf+=dfs(s,t,1e9);\n\t\t}\n\t}\n};\n\nusing ld=long double;\nusing cm=complex<ld>;\n#define x real()\n#define y imag()\nconst ld eps=1e-8;\nconst ld PI=acos(ld(-1));\nint sgn(ld a){return a<-eps?-1:(a>eps?1:0);}\nld dot(cm a,cm b){return a.x*b.x+a.y*b.y;}\nld crs(cm a,cm b){return a.x*b.y-a.y*b.x;}\nld crs(cm a,cm b,cm c){return crs(b-a,c-a);}\nint ccw(cm a,cm b){return sgn(crs(a,b));}\nint ccw(cm a,cm b,cm c){return ccw(b-a,c-a);}\n\nusing cr=pair<cm,ld>;\n//AOJ2423\ncr circumc(cm a,cm b,cm c){\n\tb-=a;\n\tc-=a;\n\tcm r=norm(b)*c-norm(c)*b;\n\tr=cm(r.y,-r.x)/(2*crs(b,c));\n\treturn cr(a+r,abs(r));\n}\n//AOJ2423\ncr mindisc(const vc<cm>& p,array<cm,3> q,int i,int j){\n\tif(i==int(p.size())){\n\t\tif(j==0)\n\t\t\treturn {{0,0},-1};\n\t\telse if(j==1)\n\t\t\treturn {q[0],0};\n\t\telse if(j==2)\n\t\t\treturn {(q[0]+q[1])*ld(0.5),abs(q[0]-q[1])/2};\n\t\telse if(j==3)\n\t\t\treturn circumc(q[0],q[1],q[2]);\n\t\telse\n\t\t\tassert(false);\n\t}\n\tcr c=mindisc(p,q,i+1,j);\n\tif(sgn(abs(c.a-p[i])-c.b)==1){\n\t\tassert(j<3);\n\t\tq[j]=p[i];\n\t\treturn mindisc(p,q,i+1,j+1);\n\t}else\n\t\treturn c;\n}\ncr mindisc(vc<cm> p){\n\tshuffle(all(p),mt19937());\n\treturn mindisc(p,array<cm,3>(),0,0);\n}\n\nsigned main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint n,m;cin>>n>>m;\n\tvc<ld> r(n);\n\trep(i,n)cin>>r[i];\n\tvc<ld> p(m);\n\trep(i,m){\n\t\tint k;cin>>k;\n\t\tvc<cm> a;\n\t\trep(j,k){\n\t\t\tld s,t;\n\t\t\tcin>>s>>t;\n\t\t\ta.eb(s,t);\n\t\t}\n\t\tp[i]=mindisc(a).b;\n\t}\n\t\n\tint s=1+m+n+1;\n\tvc<bool> used(n);\n\tvi ans(m,-1);\n\trep(i,m){\n\t\trep(j,n)if(sgn(p[i]-r[j])<=0&&!used[j]){\n\t\t\tused[j]=1;\n\t\t\tmaxflow<int> mf(s);\n\t\t\trng(k,i+1,m){\n\t\t\t\tmf.ae(0,1+k,1);\n\t\t\t\trep(l,n)if(sgn(p[k]-r[l])<=0&&!used[l])\n\t\t\t\t\tmf.ae(1+k,1+m+l,1);\n\t\t\t}\n\t\t\trep(k,n)if(!used[k])\n\t\t\t\tmf.ae(1+m+k,s-1,1);\n\t\t\tif(mf.calc(0,s-1)==m-1-i){\n\t\t\t\tans[i]=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tused[j]=0;\n\t\t}\n\t\tif(ans[i]==-1){\n\t\t\tcout<<\"NG\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\tfor(auto v:ans)\n\t\tcout<<v+1<<endl;\n}","accuracy":1,"time_ms":150,"memory_kb":3520,"score_of_the_acc":-0.8731,"final_rank":2},{"submission_id":"aoj_2423_3655819","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define int ll\n\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,b) rng(i,0,b)\n#define gnr(i,a,b) for(int i=int(b)-1;i>=a;i--)\n#define per(i,b) gnr(i,0,b)\n#define pb push_back\n#define eb emplace_back\n#define a first\n#define b second\n#define bg begin()\n#define ed end()\n#define all(x) x.bg,x.ed\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(a>b)a=b;}\n\ntemplate<class t> using vc=vector<t>;\ntemplate<class t> using vvc=vc<vc<t>>;\n\nusing pi=pair<int,int>;\nusing vi=vc<int>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.a<<\",\"<<p.b<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\nnamespace MaxFlow{\n\tusing CapType=int;\n\tstruct Edge{\n\t\tint to,rev;\n\t\tCapType cap;\n\t};\n\tvector<vector<Edge>> g;\n\tvi itr,level;\n\tvoid Init(int n){\n\t\tg.assign(n,vector<Edge>());\n\t\titr.assign(n,0);\n\t\tlevel.assign(n,0);\n\t}\n\tvoid AddEdge(int from,int to,CapType cap){\n\t\tg[from].pb({to,(int)g[to].size(),cap});\n\t\tg[to].pb({from,(int)g[from].size()-1,0});\n\t}\n\tvoid bfs(int s){\n\t\tfill(level.begin(),level.end(),-1);\n\t\tlevel[s]=0;\n\t\tqueue<int> q;\n\t\tq.push(s);\n\t\twhile(!q.empty()){\n\t\t\tint v=q.front();q.pop();\n\t\t\tfor(auto e:g[v])if(e.cap>0&&level[e.to]==-1){\n\t\t\t\tlevel[e.to]=level[v]+1;\n\t\t\t\tq.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n\tCapType dfs(int v,int t,CapType f){\n\t\tif(v==t)\n\t\t\treturn f;\n\t\tCapType res=0;\n\t\tfor(int&i=itr[v];i<(int)g[v].size();i++){\n\t\t\tEdge& e=g[v][i];\n\t\t\tif(e.cap>0&&level[e.to]==level[v]+1){\n\t\t\t\tCapType d=dfs(e.to,t,min(f,e.cap));\n\t\t\t\tif(d>0){\n\t\t\t\t\te.cap-=d;\n\t\t\t\t\tg[e.to][e.rev].cap+=d;\n\t\t\t\t\tres+=d;\n\t\t\t\t\tf-=d;\n\t\t\t\t\tif(f<=0)break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tCapType Calc(int s,int t){\n\t\tCapType flow=0;\n\t\twhile(1){\n\t\t\tbfs(s);\n\t\t\tif(level[t]==-1)\n\t\t\t\treturn flow;\n\t\t\tfill(itr.begin(),itr.end(),0);\n\t\t\tflow+=dfs(s,t,1e9);\n\t\t}\n\t}\n}\n\nusing ld=long double;\nusing cm=complex<ld>;\n#define x real()\n#define y imag()\nconst ld eps=1e-8;\nconst ld PI=acos(ld(-1));\nint sgn(ld a){return a<-eps?-1:(a>eps?1:0);}\nld dot(cm a,cm b){return a.x*b.x+a.y*b.y;}\nld crs(cm a,cm b){return a.x*b.y-a.y*b.x;}\nld crs(cm a,cm b,cm c){return crs(b-a,c-a);}\nint ccw(cm a,cm b){return sgn(crs(a,b));}\nint ccw(cm a,cm b,cm c){return ccw(b-a,c-a);}\n\nusing cr=pair<cm,ld>;\ncr circumc(cm a,cm b,cm c){\n\tb-=a;\n\tc-=a;\n\tcm r=norm(b)*c-norm(c)*b;\n\tr=cm(r.y,-r.x)/(2*crs(b,c));\n\treturn cr(a+r,abs(r));\n}\n\ncr mindisc(const vc<cm>& p,array<cm,3> q,int i,int j){\n\tif(i==int(p.size())){\n\t\tif(j==0)\n\t\t\treturn {{0,0},-1};\n\t\telse if(j==1)\n\t\t\treturn {q[0],0};\n\t\telse if(j==2)\n\t\t\treturn {(q[0]+q[1])*ld(0.5),abs(q[0]-q[1])/2};\n\t\telse if(j==3)\n\t\t\treturn circumc(q[0],q[1],q[2]);\n\t\telse\n\t\t\tassert(false);\n\t}\n\tcr c=mindisc(p,q,i+1,j);\n\tif(sgn(abs(c.a-p[i])-c.b)==1){\n\t\tassert(j<3);\n\t\tq[j]=p[i];\n\t\treturn mindisc(p,q,i+1,j+1);\n\t}else\n\t\treturn c;\n}\n\ncr mindisc(vc<cm> p){\n\tshuffle(all(p),mt19937());\n\treturn mindisc(p,array<cm,3>(),0,0);\n}\n\nsigned main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(20);\n\t\n\tint n,m;cin>>n>>m;\n\tvc<ld> r(n);\n\trep(i,n)cin>>r[i];\n\tvc<ld> p(m);\n\trep(i,m){\n\t\tint k;cin>>k;\n\t\tvc<cm> a;\n\t\trep(j,k){\n\t\t\tld s,t;\n\t\t\tcin>>s>>t;\n\t\t\ta.eb(s,t);\n\t\t}\n\t\tp[i]=mindisc(a).b;\n\t}\n\t\n\tint s=1+m+n+1;\n\tvc<bool> used(n);\n\tvi ans(m,-1);\n\trep(i,m){\n\t\trep(j,n)if(sgn(p[i]-r[j])<=0&&!used[j]){\n\t\t\tused[j]=1;\n\t\t\tMaxFlow::Init(s);\n\t\t\trng(k,i+1,m){\n\t\t\t\tMaxFlow::AddEdge(0,1+k,1);\n\t\t\t\trep(l,n)if(sgn(p[k]-r[l])<=0&&!used[l])\n\t\t\t\t\tMaxFlow::AddEdge(1+k,1+m+l,1);\n\t\t\t}\n\t\t\trep(k,n)if(!used[k])\n\t\t\t\tMaxFlow::AddEdge(1+m+k,s-1,1);\n\t\t\tif(MaxFlow::Calc(0,s-1)==m-1-i){\n\t\t\t\tans[i]=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tused[j]=0;\n\t\t}\n\t\tif(ans[i]==-1){\n\t\t\tcout<<\"NG\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\tfor(auto v:ans)\n\t\tcout<<v+1<<endl;\n}","accuracy":1,"time_ms":100,"memory_kb":3472,"score_of_the_acc":-0.6391,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2423_8818854\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -1.1103,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2423_8216523\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 100) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.9718,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2423_8216520\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -1.1666,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2423_8113469\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#pragma GCC target(\\\"avx,avx2,sse,sse2\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.0509,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2423_8113468\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"avx,avx2,fma\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -1.0779,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2423_8113466\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.1244,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2423_8113462\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"avx,avx2,fma\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.0638,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2423_8113461\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -1.0227,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2423_8113459\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"avx,avx2,fma\\\")\\n#pragma GCC optimization(\\\"unroll-loops\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -1.0498,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2423_8113458\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast,unroll-loops\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.0509,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2423_8113455\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -1.0357,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2423_8113454\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -1.0498,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2423_8113452\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC target(\\\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\\\")\\n#define _CRT_SECURE_NO_WARNINGS\\n#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstring>\\n#include <ctime>\\n#include <iostream>\\n#include <sstream>\\n#include <string>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int, int> pii;\\n#define all(c) (c).begin(), (c).end()\\n#define loop(i, a, b) for (ll i = a; i < ll(b); i++)\\n#define rep(i, b) loop(i, 0, b)\\n#define each(e, c) for (auto &e : c)\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define mt make_tuple\\n#define lb lower_bound\\n#define ub upper_bound\\n#ifdef DEBUG\\n#define dump(...) \\\\\\n (cerr << #__VA_ARGS__ << \\\" = \\\" << (DUMP(), __VA_ARGS__).str() << \\\" [\\\" \\\\\\n << __LINE__ << \\\"]\\\" << endl)\\nstruct DUMP : ostringstream {\\n template <class T> DUMP &operator,(const T &t) {\\n if (this->tellp())\\n *this << \\\", \\\";\\n *this << t;\\n return *this;\\n }\\n};\\n#else\\n#define dump(...)\\n#endif\\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> const &v) {\\n rep(i, v.size()) os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n#include <algorithm>\\n#include <complex>\\n#include <cstdio>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n#define curr(g, i) g[i]\\n#define next(g, i) g[(i + 1) % g.size()]\\n#define self (*this)\\ntypedef long double R;\\nconst R eps = 1e-10;\\nconst R inf = 1e12;\\nconst R pi = acos(-1);\\ntypedef complex<R> P;\\nR arg(P a, P b, P c) {\\n R th = arg((a - b) / (c - b));\\n return th > 0 ? th : th + 2 * pi;\\n}\\nbool comp_x(P const &a, P const &b) {\\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\\n}\\nbool comp_y(P const &a, P const &b) {\\n return imag(a) != imag(b) ? imag(a) < imag(b) : real(a) < real(b);\\n}\\nP CENTER = P();\\nbool comp_arg(P const &a, P const &b) {\\n return arg(a, CENTER, CENTER + (R)1.) < arg(b, CENTER, CENTER + (R)1.);\\n}\\nnamespace std {\\nbool operator<(P const &a, P const &b) { return comp_x(a, b); }\\n} // namespace std\\nR cross(P const &a, P const &b) { return imag(conj(a) * b); }\\nR dot(P const &a, P const &b) { return real(conj(a) * b); }\\nstruct L : public vector<P> {\\n L(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L(R a, R b, R c) {\\n if (fabs(a) < eps)\\n self = L(P(0, -c / b), P(1, -c / b));\\n else if (fabs(b) < eps)\\n self = L(P(-c / a, 0), P(-c / a, 1));\\n else\\n self = L(P(-c / a, 0), P(0, -c / b));\\n }\\n P vec() const { return self[1] - self[0]; }\\n};\\nstruct S : public vector<P> {\\n S(P const &a = P(), P const &b = P()) {\\n push_back(a);\\n push_back(b);\\n }\\n L line() const { return L(self[0], self[1]); }\\n P vec() const { return line().vec(); }\\n R len() const { return abs(vec()); }\\n};\\ntypedef vector<P> G;\\nstruct C {\\n P p;\\n R r;\\n C(P const &p = P(), R r = 0) : p(p), r(r) {}\\n};\\nenum { CCW = +1, CW = -1, CAB = +2, ABC = -2, SEG = 0 };\\nint ccw(P a, P b, P c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > 0)\\n return CCW;\\n if (cross(b, c) < 0)\\n return CW;\\n if (dot(b, c) < 0)\\n return CAB;\\n if (norm(b) < norm(c))\\n return ABC;\\n return SEG;\\n}\\nR area(C const &c) { return pi * c.r * c.r; }\\nR area(G const &g) {\\n R res = 0;\\n int n = g.size();\\n rep(i, n) res += cross(g[i], g[(i + 1) % n]);\\n return abs(res) / 2;\\n}\\nR heron(R a, R b, R c) {\\n R s = (a + b + c) / 2;\\n return sqrt(s * (s - a) * (s - b) * (s - c));\\n}\\nP biased_center(P const &a, P const &b, P const &c, R wa, R wb, R wc) {\\n return (wa * a + wb * b + wc * c) / (wa + wb + wc);\\n}\\nP gravity_center(P const &a, P const &b, P const &c) {\\n return biased_center(a, b, c, 1, 1, 1);\\n}\\nP inner_center(P const &a, P const &b, P const &c) {\\n R la = abs(b - c), lb = abs(c - a), lc = abs(a - b);\\n return biased_center(a, b, c, la, lb, lc);\\n}\\nP circumcenter(P const &a, P const &b, P const &c) {\\n R sa = sin(2 * arg(c, a, b)), sb = sin(2 * arg(a, b, c)),\\n sc = sin(2 * arg(b, c, a));\\n return biased_center(a, b, c, sa, sb, sc);\\n}\\nP orthocenter(P const &a, P const &b, P const &c) {\\n if (abs(arg(c, a, b)) == pi)\\n return a;\\n if (abs(arg(a, b, c)) == pi)\\n return b;\\n if (abs(arg(b, c, a)) == pi)\\n return c;\\n R ta = tan(arg(c, a, b)), tb = tan(arg(a, b, c)), tc = tan(arg(b, c, a));\\n return biased_center(a, b, c, ta, tb, tc);\\n}\\nP excenter(P const &a, P const &b, P const &c) {\\n R sa = sin(arg(c, a, b)), sb = sin(arg(a, b, c)), sc = sin(arg(b, c, a));\\n return biased_center(a, b, c, -sa, sb, sc);\\n}\\nbool col(L const &l, L const &m) {\\n return abs(cross(l.vec(), m.vec())) > eps ||\\n abs(cross(l.vec(), m[0] - l[0])) < eps;\\n}\\nbool col(L const &l, S const &s) {\\n return cross(l.vec(), s[0] - l[0]) * cross(l.vec(), s[1] - l[0]) < eps;\\n}\\nbool col(S const &s, L const &l) { return col(l, s); }\\nbool col(L const &l, P const &p) {\\n return abs(cross(l[1] - p, l[0] - p)) < eps;\\n}\\nbool col(P const &p, L const &l) { return col(l, p); }\\nbool col(const S &s, const S &t) {\\n return ccw(s[0], s[1], t[0]) * ccw(s[0], s[1], t[1]) <= 0 &&\\n ccw(t[0], t[1], s[0]) * ccw(t[0], t[1], s[1]) <= 0;\\n}\\nbool col(const S &s, const P &p) {\\n return abs(s[0] - p) + abs(s[1] - p) - abs(s[1] - s[0]) < eps;\\n}\\nint col(const C &c1, const C &c2) {\\n R d = abs(c1.p - c2.p), r1 = c1.r, r2 = c2.r;\\n if (r1 + r2 < d)\\n return 0;\\n if (abs(r1 + r2 - d) < eps)\\n return 1;\\n if (abs(d - abs(r1 - r2)) < eps)\\n return -1;\\n if (d < r1 - r2)\\n return +3;\\n if (d < r2 - r1)\\n return -3;\\n return 2;\\n}\\nP proj(L const &l, P const &p) {\\n R t = dot(p - l[0], l.vec()) / norm(l.vec());\\n return l[0] + t * (l.vec());\\n}\\nP proj(P const &p, L const &l) { return proj(l, p); }\\nP refl(L const &l, P const &p) { return p + (R)2 * (proj(l, p) - p); }\\nP refl(P const &p, L const &l) { return refl(l, p); }\\nR dist(P const &p, P const &q) { return abs(p - q); }\\nR dist(L const &l, P const &p) { return abs(p - proj(l, p)); }\\nR dist(P const &p, L const &l) { return dist(l, p); }\\nR dist(L const &l, L const &m) { return col(l, m) ? 0 : dist(l, m[0]); }\\nR dist(L const &l, S const &s) {\\n return col(l, s) ? 0 : min(dist(l, s[0]), dist(l, s[1]));\\n}\\nR dist(S const &s, L const &l) { return dist(l, s); }\\nR dist(S const &s, P const &p) {\\n P const r = proj(s.line(), p);\\n return col(s, r) ? abs(r - p) : min(abs(s[0] - p), abs(s[1] - p));\\n}\\nR dist(P const &p, S const &s) { return dist(s, p); }\\nR dist(S const &s, S const &t) {\\n return col(s, t) ? 0\\n : min(min(min(dist(s, t[0]), dist(s, t[1])), dist(t, s[0])),\\n dist(t, s[1]));\\n}\\nvector<P> hit(L const &l, L const &m) {\\n R A = cross(l.vec(), m.vec());\\n R B = cross(l.vec(), l[1] - m[0]);\\n if (abs(A) < eps && abs(B) < eps)\\n return {m[0]};\\n if (abs(A) < eps)\\n return G();\\n return {m[0] + B / A * (m.vec())};\\n}\\nvector<P> hit(S const &s, S const &t) {\\n return col(s, t) ? hit(s.line(), t.line()) : G();\\n}\\nvector<P> hit(L const &l, S const &s) {\\n return col(l, s) ? hit(l, s.line()) : G();\\n}\\nvector<P> hit(S const &s, L const &l) { return hit(l, s); }\\nvector<P> hit(C const &c, L const &l) {\\n R d = dist(l, c.p);\\n if (fabs(d - c.r) < eps)\\n return {proj(l, c.p)};\\n if (d > c.r)\\n return G();\\n P h = proj(l, c.p);\\n P u = sqrt(c.r * c.r - d * d) * (l.vec()) / abs(l.vec());\\n return {h + u, h - u};\\n}\\nvector<P> hit(C const &c, S const &s) {\\n G cps = hit(c, s.line()), res;\\n for (const P &p : cps)\\n if (col(s, p))\\n res.push_back(p);\\n return res;\\n}\\nvector<P> hit(C const &c1, C const &c2) {\\n if (abs(c1.p - c2.p) < 0)\\n return G();\\n int i = col(c1, c2);\\n if (i == 0 || abs(i) == 3)\\n return G();\\n R r1 = c1.r, r2 = c2.r, d = abs(c1.p - c2.p);\\n if (i == 1)\\n return {c1.p + (c2.p - c1.p) * r1 / d};\\n P p = c1.p - c2.p;\\n R A = -2. * p.real(), B = 2 * p.imag();\\n R C = norm(c1.p) - norm(c2.p) - r1 * r1 + r2 * r2;\\n return hit(c1, L(A, B, C));\\n}\\nvector<P> hit(C const &c, G const &g) {\\n vector<P> res;\\n int n = g.size();\\n rep(i, n) for (P const &p : hit(c, S(g[i], g[(i + 1) % n]))) res.push_back(p);\\n return res;\\n}\\nC min_ball(G const &g) {\\n int n = g.size();\\n if (n == 1)\\n return C(g[0], 0);\\n if (n == 2)\\n return C((g[0] + g[1]) / (R)2, abs((g[0] + g[1]) / (R)2 - g[0]));\\n P c = (g[0] + g[n / 3] + g[n / 3 * 2]) / (R)3;\\n R r = 1.0;\\n rep(i, 1000) {\\n R d = 0;\\n int x = 0;\\n rep(j, n) {\\n if (d < abs(g[j] - c)) {\\n d = abs(g[j] - c);\\n x = j;\\n }\\n }\\n c += (g[x] - c) * r;\\n if (i & 2)\\n r *= 0.8;\\n }\\n R d = -1;\\n int x = 0;\\n rep(i, n) {\\n if (d < abs(c - g[i])) {\\n d = abs(c - g[i]);\\n x = i;\\n }\\n }\\n return C(c, abs(c - g[x]));\\n}\\nint n, m;\\nR r[111], mb[111];\\nvi ans;\\nbool used[111];\\nbool chk(int s) {\\n vi b;\\n rep(i, n) if (!used[i]) b.eb(r[i]);\\n vector<R> a;\\n loop(i, s, m) a.eb(mb[i]);\\n sort(all(a));\\n sort(all(b));\\n int last = -1;\\n rep(i, a.size()) {\\n bool found = false;\\n loop(j, last + 1, b.size()) {\\n if (a[i] < b[j] + eps) {\\n found = true;\\n last = j;\\n break;\\n }\\n }\\n if (!found)\\n return false;\\n }\\n return true;\\n}\\nint main() {\\n#ifdef LOCAL\\n freopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n while (cin >> n >> m) {\\n ans.clear();\\n rep(i, n) cin >> r[i];\\n rep(i, m) {\\n int k;\\n cin >> k;\\n G g(k);\\n rep(j, k) {\\n R x, y;\\n cin >> x >> y;\\n g[j] = P(x, y);\\n }\\n mb[i] = min_ball(g).r;\\n }\\n rep(i, m) used[i] = false;\\n bool f = true;\\n rep(i, m) {\\n bool found = false;\\n rep(j, n) {\\n if (used[j])\\n continue;\\n if (!(mb[i] < r[j] + eps))\\n continue;\\n used[j] = true;\\n if (chk(i + 1)) {\\n ans.push_back(j);\\n found = true;\\n break;\\n }\\n used[j] = false;\\n }\\n if (!found) {\\n f = false;\\n break;\\n }\\n }\\n if (f) {\\n rep(i, m) cout << ans[i] + 1 << \\\"\\\\n\\\";\\n } else\\n cout << \\\"NG\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -1.0216,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2423_5499342\",\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 205\\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\\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\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\n\\n\\nint N,M;\\nint work[SIZE],ANS[SIZE];\\ndouble R[SIZE],need_R[SIZE];\\nbool FLG,check[SIZE];\\nPolygon POLY[SIZE];\\n\\nint C_INDEX[SIZE];\\n\\nint V;\\nvector<Edge> G[SIZE];\\nint dist[SIZE];\\nint cheked_index[SIZE];\\n\\n\\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 calc(double x,double y,int index){\\n\\n\\tPoint base = Point(x,y);\\n\\n\\tdouble ret = 0;\\n\\n\\tfor(int i = 0; i < POLY[index].size(); i++){\\n\\n\\t\\tdouble tmp_dist = calc_dist(base,POLY[index][i]);\\n\\t\\tret = max(ret,tmp_dist);\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\ndouble thirds_searchY(double X,int index){\\n\\n\\tdouble L = -1001,R = 1001;\\n\\n\\tfor(int loop = 0; loop < 100; loop++){\\n\\n\\t\\tdouble mid1 = (2.0*L+R)/3.0;\\n\\t\\tdouble mid2 = (1.0*L+2.0*R)/3.0;\\n\\n\\t\\tif(calc(X,mid1,index) > calc(X,mid2,index)){\\n\\n\\t\\t\\tL = mid1;\\n\\t\\t}else{\\n\\n\\t\\t\\tR = mid2;\\n\\t\\t}\\n\\t}\\n\\n\\treturn calc(X,(L+R)/2,index);\\n}\\n\\ndouble thirds_searchX(int index){\\n\\n\\tdouble L = -1001,R = 1001;\\n\\n\\tfor(int loop = 0; loop < 100; loop++){\\n\\n\\t\\tdouble mid1 = (2.0*L+R)/3.0;\\n\\t\\tdouble mid2 = (1.0*L+2.0*R)/3.0;\\n\\n\\t\\tif(thirds_searchY(mid1,index) > thirds_searchY(mid2,index)){\\n\\n\\t\\t\\tL = mid1;\\n\\t\\t}else{\\n\\n\\t\\t\\tR = mid2;\\n\\t\\t}\\n\\t}\\n\\n\\treturn thirds_searchY((L+R)/2,index);\\n}\\n\\n\\n\\nvoid add_edge(int from,int to,int capacity){\\n\\tG[from].push_back(Edge(to,capacity,G[to].size()));\\n\\tG[to].push_back(Edge(from,0,G[from].size()-1));\\n}\\n\\n\\n//sourceからの最短距離をBFSで計算する\\nvoid bfs(int source){\\n\\tfor(int i = 0; i < V; i++)dist[i] = -1;\\n\\tqueue<int> Q;\\n\\tdist[source] = 0;\\n\\tQ.push(source);\\n\\n\\twhile(!Q.empty()){\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\t\\tEdge &e = G[node_id][i];\\n\\t\\t\\tif(e.capacity > 0 && dist[e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\\n\\t\\t\\t\\tdist[e.to] = dist[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(int node_id,int sink,int flow){\\n\\tif(node_id == sink)return flow; //終点についたらflowをreturn\\n\\n\\tfor(int &i = cheked_index[node_id]; i < G[node_id].size(); i++){ //node_idから出ているエッジを調査\\n\\t\\tEdge &e = G[node_id][i];\\n\\t\\tif(e.capacity > 0 && dist[node_id] < dist[e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\\n\\t\\t\\tint tmp_flow = dfs(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[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\\n//sourceからsinkへの最大流を求める\\nint max_flow(int source,int sink){ //source:始点 sink:終点\\n\\tint flow = 0,add;\\n\\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\\n\\t\\tbfs(source);\\n\\t\\tif(dist[sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\\n\\t\\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\\n\\t\\twhile((add = dfs(source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\\n\\t\\t\\tflow += add;\\n\\t\\t}\\n\\t}\\n\\treturn flow;\\n}\\n\\n\\nvoid delete_edge(int from,int index){\\n\\n\\t//ノーマル辺を消す\\n\\tG[from][index].capacity = 0;\\n\\tint rev_from = G[from][index].to;\\n\\n\\t//逆辺を消す\\n\\tint left = 0,right = G[rev_from].size()-1,mid = (left+right)/2;\\n\\n\\twhile(left <= right){\\n\\n\\t\\tif(G[rev_from][mid].to == from){\\n\\n\\t\\t\\tG[rev_from][mid].capacity = 0;\\n\\t\\t\\treturn;\\n\\n\\t\\t}else if(G[rev_from][mid].to > from){\\n\\n\\t\\t\\tright = mid-1;\\n\\n\\t\\t}else{\\n\\t\\t\\tleft = mid+1;\\n\\t\\t}\\n\\t\\tmid = (left+right)/2;\\n\\t}\\n}\\n\\nbool find_a_path(int source,int sink){ //sourceからsinkへの増加パスがあるか調べる\\n\\n\\tbfs(source);\\n\\n\\tif(dist[sink] < 0){\\n\\t\\treturn false; //増加パスがなければfalse\\n\\t}\\n\\n\\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\\n\\n\\treturn dfs(source,sink,1) == 1; //sourceからsinkに1流せるか調べる\\n}\\n\\nint main(){\\n\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf\\\",&R[i]);\\n\\t}\\n\\n\\n\\tint source = N+M,sink = source+1;\\n\\tV = N+M+2;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tadd_edge(source,i,1);\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tC_INDEX[i] = M+i;\\n\\t\\tadd_edge(C_INDEX[i],sink,1);\\n\\t}\\n\\n\\tint num_P;\\n\\tdouble x,y;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%d\\\",&num_P);\\n\\t\\tfor(int k = 0; k < num_P; k++){\\n\\n\\t\\t\\tscanf(\\\"%lf %lf\\\",&x,&y);\\n\\t\\t\\tPOLY[i].push_back(Point(x,y));\\n\\t\\t}\\n\\n\\t\\tneed_R[i] = thirds_searchX(i);\\n\\t}\\n\\n\\t//辺張り\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(need_R[i] <= R[k]+EPS){\\n\\n\\t\\t\\t\\tadd_edge(i,C_INDEX[k],1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\tif(max_flow(source,sink) < M){\\n\\n\\t\\tprintf(\\\"NG\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t//番号の大きい部品から、降順に見ていく\\n\\t\\tfor(int i = G[k].size()-1; i >= 0; i--){\\n\\n\\t\\t\\tif(G[k][i].capacity == 1){ //エッジに流れていない場合\\n\\n\\t\\t\\t\\tdelete_edge(k,i); //流れないように、辺を論理削除\\n\\n\\t\\t\\t}else{ //エッジに流れている場合\\n\\n\\t\\t\\t\\t//★残余グラフ上で別の経路がないか試す★\\n\\t\\t\\t\\tif(find_a_path(k,G[k][i].to)){\\n\\n\\t\\t\\t\\t\\tdelete_edge(k,i); //より小さい番号の部品とマッチできるので、辺を論理削除\\n\\n\\t\\t\\t\\t}else{ //流せない:辺確定\\n\\n\\t\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",G[k][i].to+1-M);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -1.2264,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2423_4802264\",\n \"code_snippet\": \"#include <iostream>\\n#include <array>\\n#include <vector>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <algorithm>\\n#include <math.h>\\n#include <string>\\n#include <climits>\\n#include <assert.h>\\n#include <iomanip>\\n#include <bitset>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <functional>\\n#include <fstream>\\n#include <random>\\n\\n#define LEN(x) (long long)(x.size())\\n#define FOR(i, a, n) for(int i=(a);i<(n); ++i)\\n#define FOE(i, a) for(auto i : a)\\n#define ALL(c) (c).begin(), (c).end()\\n#define RALL(c) (c).rbegin(), (c).rend()\\n#define SUM(x) std::accumulate(ALL(x), 0LL)\\n#define MIN(v) *std::min_element(v.begin(), v.end())\\n#define MAX(v) *std::max_element(v.begin(), v.end())\\n#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())\\n#define BIT_COUNT(bit) (__builtin_popcount(bit))\\n\\nusing LL = long long;\\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) { return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); } // C++14\\ntemplate<typename T, typename V>\\ntypename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }\\n\\ntemplate<typename T, typename V>\\ntypename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for (auto &e:t) fill_v(e, v); }\\n\\ntemplate<class T>\\ninline T ceil(T a, T b) { return (a + b - 1) / b; }\\n\\nvoid print() { std::cout << std::endl; }\\n\\ntemplate<class Head, class... Tail>\\nvoid print(Head &&head, Tail &&... tail) {\\n std::cout << head;\\n if (sizeof...(tail) != 0) { std::cout << \\\" \\\"; }\\n print(std::forward<Tail>(tail)...);\\n}\\n\\ntemplate<class T>\\nvoid print(std::vector<T> &v) {\\n for (auto &a : v) {\\n std::cout << a;\\n if (&a != &v.back()) { std::cout << \\\" \\\"; }\\n }\\n std::cout << std::endl;\\n}\\n\\ntemplate<class T>\\nvoid print(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}\\n\\nvoid debug() { std::cerr << std::endl; }\\n\\ntemplate<class Head, class... Tail>\\nvoid debug(Head &&head, Tail &&... tail) {\\n std::cerr << head;\\n if (sizeof...(tail) != 0) { std::cerr << \\\" \\\"; }\\n print(std::forward<Tail>(tail)...);\\n}\\n\\ntemplate<class T>\\nvoid debug(std::vector<T> &v) {\\n for (auto &a : v) {\\n std::cerr << a;\\n if (&a != &v.back()) { std::cerr << \\\" \\\"; }\\n }\\n std::cerr << std::endl;\\n}\\n\\ntemplate<class T>\\nvoid debug(std::vector<std::vector<T>> &vv) { for (auto &v : vv) { print(v); }}\\n\\ninline bool inside(long long y, long long x, long long H, long long W) { return 0 <= y and y < H and 0 <= x and x < W; }\\n\\ntemplate<class T>\\ninline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\\n\\ntemplate<class T>\\ninline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\\n\\ntemplate<typename T>\\nT &chmin(T &a, const T &b) { return a = std::min(a, b); }\\n\\ntemplate<typename T>\\nT &chmax(T &a, const T &b) { return a = std::max(a, b); }\\n\\nbool is_bit_on(const unsigned long long bit, const unsigned int i) { return (bit >> i) & 1u; }\\n\\nunsigned long long bit_set(const unsigned long long bit, const unsigned int i, const unsigned int b) {\\n assert(b == 0 or b == 1);\\n if (b == 0) { return bit & ~(1ull << i); }\\n else { return bit | (1ull << i); }\\n}\\n\\n// 初項s交差d長さnの数列の和\\nlong long sum_of_arithmetic_progression(long long s, long long d, long long n) {\\n return n * (2 * s + (n - 1) * d) / 2;\\n}\\n\\n// xが2の階乗かどうか判定\\nbool is_power_of_two(long long x) {\\n return !(x & (x - 1));\\n}\\n\\nlong long gcd(long long a, long long b) {\\n if (b == 0) { return a; }\\n return gcd(b, a % b);\\n}\\n\\nlong long gcd(std::vector<long long> &v) {\\n long long ans = v[0];\\n for (int i = 1; i < (int) v.size(); ++i) {\\n ans = gcd(ans, v[i]);\\n }\\n return ans;\\n}\\n\\nlong long lcm(long long a, long long b) {\\n long long g = gcd(a, b);\\n return a / g * b;\\n}\\n\\nconst int INF = 1u << 30u; // 1,073,741,824\\nconst long long LINF = 1ull << 60u;\\nconst double EPS = 1e-9;\\nconst long double PI = acos(-1.0);\\nconst std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};\\nconst std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};\\nconst std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1}, dx8 = {1, 0, -1, 0, 1, 1, -1, -1};\\n\\nclass Point {\\npublic:\\n double x;\\n double y;\\n\\n Point(): x(0), y(0) {}\\n Point(double x, double y) : x(x), y(y) {}\\n};\\n\\nclass SmallestEnclosingCircle {\\nprivate:\\n double min_x;\\n double max_x;\\n double min_y;\\n double max_y;\\n\\npublic:\\n SmallestEnclosingCircle() {}\\n\\n // 最小包含円の半径\\n double solve(const std::vector<Point> &points) {\\n this->min_x = this->max_x = points[0].x;\\n this->min_y = this->max_y = points[0].y;\\n\\n for (const auto &p : points) {\\n this->min_x = std::min(this->min_x, p.x);\\n this->max_x = std::max(this->max_x, p.x);\\n this->min_y = std::min(this->min_y, p.y);\\n this->max_y = std::max(this->max_y, p.y);\\n }\\n\\n double l = this->min_x - 1.0;\\n double r = this->max_x + 1.0;\\n\\n // x座標で3分探索\\n for (int _ = 0; _ < 100; ++_) {\\n const double c1 = (l * 2 + r) / 3.0;\\n const double c2 = (l + r * 2) / 3.0;\\n\\n if (g(c1, points) > g(c2, points)) {\\n l = c1;\\n } else {\\n r = c2;\\n }\\n }\\n\\n return g(l, points);\\n }\\n\\nprivate:\\n\\n // 点aと点bの距離\\n double dist(const Point &a, const Point &b) {\\n double dx = a.x - b.x;\\n double dy = a.y - b.y;\\n return sqrt(dx * dx + dy * dy);\\n }\\n\\n // nowから最も遠い点までの距離\\n double max_distance(const Point &now, const std::vector<Point> &points) {\\n double res = 0;\\n for (const auto p : points) {\\n res = std::max(res, dist(now, p));\\n }\\n return res;\\n }\\n\\n // x座標を決めたときの，y軸の距離を最小化\\n double g(const double x, const std::vector<Point> &points) {\\n double l = this->min_y - 1.0;\\n double r = this->max_y + 1.0;\\n\\n for (int _ = 0; _ < 100; ++_) {\\n double c1 = (l * 2 + r) / 3;\\n double c2 = (l + r * 2) / 3;\\n\\n if (max_distance(Point(x, c1), points) > max_distance(Point(x, c2), points)) {\\n l = c1;\\n } else {\\n r = c2;\\n }\\n }\\n\\n return max_distance(Point(x, l), points);\\n }\\n};\\n\\nusing namespace std;\\n\\n// iさんをhole[j]に割り当てられるか\\nbool can_assign(int i, int j, vector<bool> &used, vector<double> &holes, vector<double> &dists) {\\n vector<double> rest_dists;\\n for (int k = i + 1; k < dists.size(); ++k) {\\n rest_dists.emplace_back(dists[k]);\\n }\\n sort(rest_dists.rbegin(), rest_dists.rend());\\n\\n vector<double> rest_holes;\\n for (int k = 0; k < (int)holes.size(); ++k) {\\n if (k != j and not used[k]) {\\n rest_holes.emplace_back(holes[k]);\\n }\\n }\\n sort(rest_holes.rbegin(), rest_holes.rend());\\n\\n assert(rest_holes.size() >= rest_dists.size());\\n for (int k = 0; k < rest_dists.size(); ++k) {\\n if (rest_holes[k] < rest_dists[k]) {\\n return false;\\n }\\n }\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout.tie(nullptr);\\n\\n int N, M;\\n cin >> N >> M;\\n vector<double> holes(N);\\n for (int i = 0; i < N; ++i) {\\n cin >> holes[i];\\n }\\n\\n vector<double> dist(M);\\n for (int i = 0; i < M; ++i) {\\n int P;\\n cin >> P;\\n vector<Point> points(P);\\n\\n for (int j = 0; j < P; ++j) {\\n cin >> points[j].x >> points[j].y;\\n }\\n\\n SmallestEnclosingCircle sec;\\n dist[i] = sec.solve(points) - EPS;\\n }\\n\\n vector<int> ans(M, -1);\\n vector<bool> used(N);\\n for (int i = 0; i < M; ++i) {\\n for (int j = 0; j < N; ++j) {\\n if (not used[j] and dist[i] <= holes[j]) {\\n if (can_assign(i, j, used, holes, dist)) {\\n ans[i] = j;\\n used[j] = true;\\n break;\\n }\\n }\\n }\\n if (ans[i] == -1) {\\n cout << \\\"NG\\\" << endl;\\n return 0;\\n }\\n }\\n\\n for (int i = 0; i < M; ++i) {\\n cout << ans[i] + 1 << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -1.0282,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2423_4105324\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\n\\n#define COUT(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << endl\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)\\n{ return s << '<' << P.first << \\\", \\\" << P.second << '>'; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\n\\n\\n\\nusing DD = double;\\nconst DD INF = 1LL<<60; // to be set appropriately\\nconst DD EPS = 1e-6; // to be set appropriately\\nconst DD PI = acosl(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\n/* Point */\\nstruct Point {\\n DD x, y;\\n Point(DD x = 0.0, DD y = 0.0) : x(x), y(y) {}\\n friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << \\\", \\\" << p.y << ')';}\\n};\\ninline Point operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\ninline Point operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\ninline Point operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\ninline Point operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\ninline Point operator * (const Point &p, const Point &q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}\\ninline Point operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\ninline Point conj(const Point &p) {return Point(p.x, -p.y);}\\ninline Point rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\ninline Point rot90(const Point &p) {return Point(-p.y, p.x);}\\ninline DD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\ninline DD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\ninline DD norm(const Point &p) {return dot(p, p);}\\ninline DD abs(const Point &p) {return sqrt(dot(p, p));}\\ninline DD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\ninline bool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\ninline bool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\ninline bool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\ninline Point operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\n// 最小包含円\\nconst int ITER = 100;\\n\\nDD f(const vector<Point> &v, DD x, DD y) {\\n DD res = 0;\\n for (int i = 0; i < v.size(); ++i) res = max(res, abs(v[i] - Point(x, y)));\\n return res;\\n}\\n\\nDD g(const vector<Point> &v, DD x) {\\n DD left = -10000, right = 10000;\\n for (int _ = 0; _ < ITER; ++_) {\\n DD m1 = (left * 2 + right) / 3;\\n DD m2 = (left + right * 2) / 3;\\n if (f(v, x, m1) > f(v, x, m2)) left = m1;\\n else right = m2;\\n }\\n return f(v, x, left);\\n}\\n\\nDD mic(const vector<Point> &v) {\\n DD left = -10000, right = 10000;\\n for (int _ = 0; _ < ITER; ++_) {\\n DD m1 = (left * 2 + right) / 3;\\n DD m2 = (left + right * 2) / 3;\\n if (g(v, m1) > g(v, m2)) left = m1;\\n else right = m2;\\n }\\n return g(v, left);\\n}\\n\\n// 人がすべてマッチできるか\\nbool can(vector<DD> person, vector<DD> ana) {\\n sort(person.begin(), person.end());\\n sort(ana.begin(), ana.end());\\n int j = 0;\\n for (int i = 0; i < person.size(); ++i) {\\n while (j < ana.size() && person[i] > ana[j] + EPS) ++j;\\n if (j == ana.size()) return false;\\n ++j;\\n }\\n return true;\\n}\\n\\nint main() {\\n int N, M; cin >> N >> M;\\n vector<pair<DD,int>> r(N), p(M);\\n vector<vector<Point>> vp(M);\\n for (int i = 0; i < N; ++i) cin >> r[i].first, r[i].second = i;\\n for (int i = 0; i < M; ++i) {\\n int a; cin >> a;\\n vp[i].resize(a);\\n for (int j = 0; j < a; ++j) cin >> vp[i][j].x >> vp[i][j].y;\\n p[i] = {mic(vp[i]), i};\\n }\\n\\n vector<DD> person, ana;\\n for (int i = 0; i < p.size(); ++i) person.push_back(p[i].first);\\n for (int i = 0; i < r.size(); ++i) ana.push_back(r[i].first);\\n if (!can(person, ana)) {\\n cout << \\\"NG\\\" << endl;\\n return 0;\\n }\\n\\n for (int i = 0; i < M; ++i) {\\n vector<DD> person;\\n for (int j = i+1; j < M; ++j) person.push_back(p[j].first);\\n for (int j = 0; j < r.size(); ++j) {\\n if (p[i].first > r[j].first + EPS) continue;\\n vector<DD> ana;\\n for (int k = 0; k < r.size(); ++k) {\\n if (k == j) continue;\\n ana.push_back(r[k].first);\\n }\\n if (can(person, ana)) {\\n cout << r[j].second + 1 << endl;\\n r.erase(r.begin()+j);\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2423_3655829\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=a;i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(a>b)a=b;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\ntemplate<class d>\\nstruct maxflow{\\n\\tstruct E{\\n\\t\\tint to,rev;\\n\\t\\td cap;\\n\\t};\\n\\tvvc<E> g;\\n\\tvi itr,lv;\\n\\tmaxflow(int n):g(n),itr(n),lv(n){}\\n\\tvoid ae(int s,int t,d c){\\n\\t\\tg[s].pb({t,(int)g[t].size(),c});\\n\\t\\tg[t].pb({s,(int)g[s].size()-1,0});\\n\\t}\\n\\tvoid bfs(int s){\\n\\t\\tfill(all(lv),-1);\\n\\t\\tlv[s]=0;\\n\\t\\tqueue<int> q;\\n\\t\\tq.push(s);\\n\\t\\twhile(q.size()){\\n\\t\\t\\tint v=q.front();q.pop();\\n\\t\\t\\tfor(auto e:g[v])if(e.cap>0&&lv[e.to]==-1){\\n\\t\\t\\t\\tlv[e.to]=lv[v]+1;\\n\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\td dfs(int v,int t,d f){\\n\\t\\tif(v==t)return f;\\n\\t\\td res=0;\\n\\t\\tfor(int&i=itr[v];i<(int)g[v].size();i++){\\n\\t\\t\\tE& e=g[v][i];\\n\\t\\t\\tif(e.cap>0&&lv[e.to]==lv[v]+1){\\n\\t\\t\\t\\td a=dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(a>0){\\n\\t\\t\\t\\t\\te.cap-=a;\\n\\t\\t\\t\\t\\tg[e.to][e.rev].cap+=a;\\n\\t\\t\\t\\t\\tres+=a;\\n\\t\\t\\t\\t\\tf-=a;\\n\\t\\t\\t\\t\\tif(f<=0)break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\td calc(int s,int t){\\n\\t\\td f=0;\\n\\t\\twhile(1){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(lv[t]==-1)\\n\\t\\t\\t\\treturn f;\\n\\t\\t\\tfill(all(itr),0);\\n\\t\\t\\tf+=dfs(s,t,1e9);\\n\\t\\t}\\n\\t}\\n};\\n\\nusing ld=long double;\\nusing cm=complex<ld>;\\n#define x real()\\n#define y imag()\\nconst ld eps=1e-8;\\nconst ld PI=acos(ld(-1));\\nint sgn(ld a){return a<-eps?-1:(a>eps?1:0);}\\nld dot(cm a,cm b){return a.x*b.x+a.y*b.y;}\\nld crs(cm a,cm b){return a.x*b.y-a.y*b.x;}\\nld crs(cm a,cm b,cm c){return crs(b-a,c-a);}\\nint ccw(cm a,cm b){return sgn(crs(a,b));}\\nint ccw(cm a,cm b,cm c){return ccw(b-a,c-a);}\\n\\nusing cr=pair<cm,ld>;\\n//AOJ2423\\ncr circumc(cm a,cm b,cm c){\\n\\tb-=a;\\n\\tc-=a;\\n\\tcm r=norm(b)*c-norm(c)*b;\\n\\tr=cm(r.y,-r.x)/(2*crs(b,c));\\n\\treturn cr(a+r,abs(r));\\n}\\n//AOJ2423\\ncr mindisc(const vc<cm>& p,array<cm,3> q,int i,int j){\\n\\tif(i==int(p.size())){\\n\\t\\tif(j==0)\\n\\t\\t\\treturn {{0,0},-1};\\n\\t\\telse if(j==1)\\n\\t\\t\\treturn {q[0],0};\\n\\t\\telse if(j==2)\\n\\t\\t\\treturn {(q[0]+q[1])*ld(0.5),abs(q[0]-q[1])/2};\\n\\t\\telse if(j==3)\\n\\t\\t\\treturn circumc(q[0],q[1],q[2]);\\n\\t\\telse\\n\\t\\t\\tassert(false);\\n\\t}\\n\\tcr c=mindisc(p,q,i+1,j);\\n\\tif(sgn(abs(c.a-p[i])-c.b)==1){\\n\\t\\tassert(j<3);\\n\\t\\tq[j]=p[i];\\n\\t\\treturn mindisc(p,q,i+1,j+1);\\n\\t}else\\n\\t\\treturn c;\\n}\\ncr mindisc(vc<cm> p){\\n\\tshuffle(all(p),mt19937());\\n\\treturn mindisc(p,array<cm,3>(),0,0);\\n}\\n\\nsigned main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tint n,m;cin>>n>>m;\\n\\tvc<ld> r(n);\\n\\trep(i,n)cin>>r[i];\\n\\tvc<ld> p(m);\\n\\trep(i,m){\\n\\t\\tint k;cin>>k;\\n\\t\\tvc<cm> a;\\n\\t\\trep(j,k){\\n\\t\\t\\tld s,t;\\n\\t\\t\\tcin>>s>>t;\\n\\t\\t\\ta.eb(s,t);\\n\\t\\t}\\n\\t\\tp[i]=mindisc(a).b;\\n\\t}\\n\\t\\n\\tint s=1+m+n+1;\\n\\tvc<bool> used(n);\\n\\tvi ans(m,-1);\\n\\trep(i,m){\\n\\t\\trep(j,n)if(sgn(p[i]-r[j])<=0&&!used[j]){\\n\\t\\t\\tused[j]=1;\\n\\t\\t\\tmaxflow<int> mf(s);\\n\\t\\t\\trng(k,i+1,m){\\n\\t\\t\\t\\tmf.ae(0,1+k,1);\\n\\t\\t\\t\\trep(l,n)if(sgn(p[k]-r[l])<=0&&!used[l])\\n\\t\\t\\t\\t\\tmf.ae(1+k,1+m+l,1);\\n\\t\\t\\t}\\n\\t\\t\\trep(k,n)if(!used[k])\\n\\t\\t\\t\\tmf.ae(1+m+k,s-1,1);\\n\\t\\t\\tif(mf.calc(0,s-1)==m-1-i){\\n\\t\\t\\t\\tans[i]=j;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tused[j]=0;\\n\\t\\t}\\n\\t\\tif(ans[i]==-1){\\n\\t\\t\\tcout<<\\\"NG\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tfor(auto v:ans)\\n\\t\\tcout<<v+1<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.8731,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2423_3655819\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\n#define int ll\\n\\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define rep(i,b) rng(i,0,b)\\n#define gnr(i,a,b) for(int i=int(b)-1;i>=a;i--)\\n#define per(i,b) gnr(i,0,b)\\n#define pb push_back\\n#define eb emplace_back\\n#define a first\\n#define b second\\n#define bg begin()\\n#define ed end()\\n#define all(x) x.bg,x.ed\\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(a>b)a=b;}\\n\\ntemplate<class t> using vc=vector<t>;\\ntemplate<class t> using vvc=vc<vc<t>>;\\n\\nusing pi=pair<int,int>;\\nusing vi=vc<int>;\\n\\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.a<<\\\",\\\"<<p.b<<\\\"}\\\";\\n}\\n\\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n\\nnamespace MaxFlow{\\n\\tusing CapType=int;\\n\\tstruct Edge{\\n\\t\\tint to,rev;\\n\\t\\tCapType cap;\\n\\t};\\n\\tvector<vector<Edge>> g;\\n\\tvi itr,level;\\n\\tvoid Init(int n){\\n\\t\\tg.assign(n,vector<Edge>());\\n\\t\\titr.assign(n,0);\\n\\t\\tlevel.assign(n,0);\\n\\t}\\n\\tvoid AddEdge(int from,int to,CapType cap){\\n\\t\\tg[from].pb({to,(int)g[to].size(),cap});\\n\\t\\tg[to].pb({from,(int)g[from].size()-1,0});\\n\\t}\\n\\tvoid bfs(int s){\\n\\t\\tfill(level.begin(),level.end(),-1);\\n\\t\\tlevel[s]=0;\\n\\t\\tqueue<int> q;\\n\\t\\tq.push(s);\\n\\t\\twhile(!q.empty()){\\n\\t\\t\\tint v=q.front();q.pop();\\n\\t\\t\\tfor(auto e:g[v])if(e.cap>0&&level[e.to]==-1){\\n\\t\\t\\t\\tlevel[e.to]=level[v]+1;\\n\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tCapType dfs(int v,int t,CapType f){\\n\\t\\tif(v==t)\\n\\t\\t\\treturn f;\\n\\t\\tCapType res=0;\\n\\t\\tfor(int&i=itr[v];i<(int)g[v].size();i++){\\n\\t\\t\\tEdge& e=g[v][i];\\n\\t\\t\\tif(e.cap>0&&level[e.to]==level[v]+1){\\n\\t\\t\\t\\tCapType d=dfs(e.to,t,min(f,e.cap));\\n\\t\\t\\t\\tif(d>0){\\n\\t\\t\\t\\t\\te.cap-=d;\\n\\t\\t\\t\\t\\tg[e.to][e.rev].cap+=d;\\n\\t\\t\\t\\t\\tres+=d;\\n\\t\\t\\t\\t\\tf-=d;\\n\\t\\t\\t\\t\\tif(f<=0)break;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tCapType Calc(int s,int t){\\n\\t\\tCapType flow=0;\\n\\t\\twhile(1){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t]==-1)\\n\\t\\t\\t\\treturn flow;\\n\\t\\t\\tfill(itr.begin(),itr.end(),0);\\n\\t\\t\\tflow+=dfs(s,t,1e9);\\n\\t\\t}\\n\\t}\\n}\\n\\nusing ld=long double;\\nusing cm=complex<ld>;\\n#define x real()\\n#define y imag()\\nconst ld eps=1e-8;\\nconst ld PI=acos(ld(-1));\\nint sgn(ld a){return a<-eps?-1:(a>eps?1:0);}\\nld dot(cm a,cm b){return a.x*b.x+a.y*b.y;}\\nld crs(cm a,cm b){return a.x*b.y-a.y*b.x;}\\nld crs(cm a,cm b,cm c){return crs(b-a,c-a);}\\nint ccw(cm a,cm b){return sgn(crs(a,b));}\\nint ccw(cm a,cm b,cm c){return ccw(b-a,c-a);}\\n\\nusing cr=pair<cm,ld>;\\ncr circumc(cm a,cm b,cm c){\\n\\tb-=a;\\n\\tc-=a;\\n\\tcm r=norm(b)*c-norm(c)*b;\\n\\tr=cm(r.y,-r.x)/(2*crs(b,c));\\n\\treturn cr(a+r,abs(r));\\n}\\n\\ncr mindisc(const vc<cm>& p,array<cm,3> q,int i,int j){\\n\\tif(i==int(p.size())){\\n\\t\\tif(j==0)\\n\\t\\t\\treturn {{0,0},-1};\\n\\t\\telse if(j==1)\\n\\t\\t\\treturn {q[0],0};\\n\\t\\telse if(j==2)\\n\\t\\t\\treturn {(q[0]+q[1])*ld(0.5),abs(q[0]-q[1])/2};\\n\\t\\telse if(j==3)\\n\\t\\t\\treturn circumc(q[0],q[1],q[2]);\\n\\t\\telse\\n\\t\\t\\tassert(false);\\n\\t}\\n\\tcr c=mindisc(p,q,i+1,j);\\n\\tif(sgn(abs(c.a-p[i])-c.b)==1){\\n\\t\\tassert(j<3);\\n\\t\\tq[j]=p[i];\\n\\t\\treturn mindisc(p,q,i+1,j+1);\\n\\t}else\\n\\t\\treturn c;\\n}\\n\\ncr mindisc(vc<cm> p){\\n\\tshuffle(all(p),mt19937());\\n\\treturn mindisc(p,array<cm,3>(),0,0);\\n}\\n\\nsigned main(){\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\tcout<<fixed<<setprecision(20);\\n\\t\\n\\tint n,m;cin>>n>>m;\\n\\tvc<ld> r(n);\\n\\trep(i,n)cin>>r[i];\\n\\tvc<ld> p(m);\\n\\trep(i,m){\\n\\t\\tint k;cin>>k;\\n\\t\\tvc<cm> a;\\n\\t\\trep(j,k){\\n\\t\\t\\tld s,t;\\n\\t\\t\\tcin>>s>>t;\\n\\t\\t\\ta.eb(s,t);\\n\\t\\t}\\n\\t\\tp[i]=mindisc(a).b;\\n\\t}\\n\\t\\n\\tint s=1+m+n+1;\\n\\tvc<bool> used(n);\\n\\tvi ans(m,-1);\\n\\trep(i,m){\\n\\t\\trep(j,n)if(sgn(p[i]-r[j])<=0&&!used[j]){\\n\\t\\t\\tused[j]=1;\\n\\t\\t\\tMaxFlow::Init(s);\\n\\t\\t\\trng(k,i+1,m){\\n\\t\\t\\t\\tMaxFlow::AddEdge(0,1+k,1);\\n\\t\\t\\t\\trep(l,n)if(sgn(p[k]-r[l])<=0&&!used[l])\\n\\t\\t\\t\\t\\tMaxFlow::AddEdge(1+k,1+m+l,1);\\n\\t\\t\\t}\\n\\t\\t\\trep(k,n)if(!used[k])\\n\\t\\t\\t\\tMaxFlow::AddEdge(1+m+k,s-1,1);\\n\\t\\t\\tif(MaxFlow::Calc(0,s-1)==m-1-i){\\n\\t\\t\\t\\tans[i]=j;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tused[j]=0;\\n\\t\\t}\\n\\t\\tif(ans[i]==-1){\\n\\t\\t\\tcout<<\\\"NG\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tfor(auto v:ans)\\n\\t\\tcout<<v+1<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.6391,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1393,"cells":{"group_id":{"kind":"string","value":"aoj_2424_cpp"},"problem_description":{"kind":"string","value":"かけざん\n太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを気に入っているので、数字を見かけるとかけざんをしたくなります。そんな彼はここのところ、次のような処理を0以上の整数に施すことが好きなようです。\n\n\n(処理の流れ)\n手順1. ある0以上の整数nが10進数表示で一けたならばそこで処理を終了する。そうでなければ手順2に進む\n手順2. 10以上の整数nを10進数表示をするとどこかの桁の間に切れ目を入れて二つの数字に分解することが可能である(例えば2012-> 20,12)。このような切り方としてありうるものに対して,得られた二つの数字を掛け合わせて最も大きいものを次のnとして手順1に戻る。(詳しくは下記の\"手順2に関する補足を参照\")\n太郎君はこの処理を気に入っているようですが、何回手順2の操作を繰り返せばよいのか大きい数字だと予想ができず、もしかしたら無限回行われなければならないかもしれないと思っています。そこで、太郎君の兄であり大学生であるあなたに0以上の整数nに対してこの手順2を何回しなければならないかを聞いてきました。\nあなたの仕事は、Q個の0以上の整数\nN\n1\n..\nN\nQ\nが与えられるので、それぞれの整数で処理の終了までに何回の手順2が施されるかを求めることです。その際にもし無限回の手順が必要ならば、-1を出力してください。\n手順2に関する補足\n切り分けた結果、桁の初めに0がつくものも考慮に入れる必要があります。\n例えばn=1024のとき、1*024 , 10*24 , 102*4をそれぞれ計算するとそれぞれ24,240,408となるため、408が選ばれ、これが次のnとなります。\nInput\nQ\nN\n1\nN\n2\n...\nN\nQ\nQ\nは与えられる0以上の整数の個数を表す\nN\ni\nは太郎君が気になっている0以上の整数で,i番目のものを表す\nConstraints\n1≤Q≤100\n0≤N\ni\n≤10\n6\nOutput\nQ\n個の整数を改行区切りで出力せよ\nR\n1\nR\n2\n..\nR\nQ\nR\ni\nは、\nN\ni\nに対して処理を終了するまでに手順2を実行する回数を表す\nN\ni\nに対して手順2を無限回だけ実行する必要がある場合は\nR\ni\nは -1となる\nSample Input 1\n3\n9\n99\n123\nOutput for the Sample Input 1\n0\n2\n3\n9は1桁の数なので、手順2が実行されることはありません。\n\n99は2桁であり、手順2を施せば9,9としか分割できずその次の数は81となる。\n81も2桁の数であり、手順2を施せば8,1としか分割できずその次の数は8となる。\n1桁の数になったので処理が終了し、答えは2。\n\n123は3桁の数なので、手順2を施します。\nこの場合は12,3と1,23の二つの分け方があり、それぞれでかけざんをすると36,23となるので、\n36が次の数として選ばれます。\nSample Input 2\n2\n999999\n1000000\nOutput for the Sample Input 2\n12 \n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2424_9575336","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 MAXS = 1000000;\nvector<int> Next(MAXS + 1,-1);\n\nint main() {\n rep(i,10,MAXS+1) {\n string s = to_string(i);\n rep(j,1,s.size()) {\n chmax(Next[i], stoi(s.substr(0,j)) * stoi(s.substr(j,s.size()-j)));\n }\n }\n int Q;\n cin >> Q;\n rep(_,0,Q) {\n int A;\n cin >> A;\n vector<bool> vis(MAXS+1,false);\n int ANS = 0;\n bool flag = false;\n while(Next[A] >= 0) {\n if (vis[A]) {\n cout << -1 << endl;\n flag = true;\n break;\n }\n vis[A] = true;\n ANS++;\n A = Next[A];\n }\n if (!flag) cout << ANS << endl;\n }\n}","accuracy":1,"time_ms":220,"memory_kb":7420,"score_of_the_acc":-2,"final_rank":16},{"submission_id":"aoj_2424_8819423","code_snippet":"#include <stdio.h>\nusing namespace std;\n\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (N >= 10) {\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N]) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3428,"score_of_the_acc":-0.05,"final_rank":1},{"submission_id":"aoj_2424_8528313","code_snippet":"#include <bits/stdc++.h>\n\nint main() {\n constexpr int N = 1000001;\n std::array<int, N> ans;\n ans.fill(1e9);\n\n auto dfs = [&](auto self, int val) -> int {\n if (ans[val] != 1e9) return ans[val];\n if (val < 10) {\n return ans[val] = 0;\n }\n int max_val = -1;\n std::string s = std::to_string(val);\n for (int i = 1; i < (int)s.size(); i++) {\n auto lhs = s.substr(0, i);\n auto rhs = s.substr(i);\n max_val = std::max(max_val, std::stoi(lhs) * std::stoi(rhs));\n }\n return ans[val] = self(self, max_val) + 1;\n };\n\n for (int i = 0; i < N; i++) dfs(dfs, i);\n\n int q;\n std::cin >> q;\n while (q--) {\n int n;\n std::cin >> n;\n std::cout << ans[n] << std::endl;\n }\n}","accuracy":1,"time_ms":220,"memory_kb":7408,"score_of_the_acc":-1.997,"final_rank":15},{"submission_id":"aoj_2424_8216544","code_snippet":"#include <cstdio>\n#include <algorithm>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool table[1000001];\n for (int loop = 0; loop < Q; loop++) {\n fill(table, table + 1000001, false);\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (N / 10 != 0) {\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = max > tmp ? max : tmp;\n }\n N = max;\n if (table[N]) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n printf(FLG ? \"-1\\n\" : \"%d\\n\", count);\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3708,"score_of_the_acc":-0.1201,"final_rank":9},{"submission_id":"aoj_2424_8216530","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n count = 0;\n scanf(\"%d\", &N);\n for (int i = 0; i <= N; i++)\n table[i] = false;\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3708,"score_of_the_acc":-0.0701,"final_rank":7},{"submission_id":"aoj_2424_8216526","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3692,"score_of_the_acc":-0.1161,"final_rank":8},{"submission_id":"aoj_2424_8208961","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i < 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3712,"score_of_the_acc":-0.1211,"final_rank":11},{"submission_id":"aoj_2424_8208957","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool table[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3708,"score_of_the_acc":-0.1201,"final_rank":9},{"submission_id":"aoj_2424_8116634","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool table[1000001] = {};\n for (int loop = 0; loop < Q; loop++) {\n fill(table, table + 1000001, false);\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N < 10)\n break;\n max = 0;\n for (S = 10; S <= N; S *= 10) {\n tmp = (N / S) * (N % S);\n max = max >= tmp ? max : tmp;\n }\n N = max;\n if (table[N]) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3712,"score_of_the_acc":-0.1211,"final_rank":11},{"submission_id":"aoj_2424_8116631","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N < 10)\n break;\n max = 0;\n for (S = 10; S <= N; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3444,"score_of_the_acc":-0.054,"final_rank":2},{"submission_id":"aoj_2424_8116629","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nconst int MAX_N = 1000000;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[MAX_N + 1];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= MAX_N; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3448,"score_of_the_acc":-0.055,"final_rank":3},{"submission_id":"aoj_2424_8116625","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001]();\n for (int loop = 0; loop < Q; loop++) {\n fill(table, table + 1000001, false);\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N < 10)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N]) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3448,"score_of_the_acc":-0.055,"final_rank":3},{"submission_id":"aoj_2424_8116624","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N < 10)\n break;\n max = 0;\n for (S = 10; N >= S; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3744,"score_of_the_acc":-0.1292,"final_rank":13},{"submission_id":"aoj_2424_8116623","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001]();\n for (int loop = 0; loop < Q; loop++) {\n fill(table, table + 1000001, false);\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n int max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N]) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3448,"score_of_the_acc":-0.055,"final_rank":3},{"submission_id":"aoj_2424_8116621","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <stack>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n delete[] table;\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3448,"score_of_the_acc":-0.055,"final_rank":3},{"submission_id":"aoj_2424_8113482","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int Q, N, count, tmp, max, S;\n bool FLG;\n scanf(\"%d\", &Q);\n bool *table = new bool[1000001];\n for (int loop = 0; loop < Q; loop++) {\n for (int i = 0; i <= 1000000; i++)\n table[i] = false;\n count = 0;\n scanf(\"%d\", &N);\n table[N] = true;\n FLG = false;\n while (true) {\n if (N / 10 == 0)\n break;\n max = 0;\n for (S = 10; N / S != 0; S *= 10) {\n tmp = (N / S) * (N % S);\n max = (max >= tmp) ? max : tmp;\n }\n N = max;\n if (table[N] == true) {\n FLG = true;\n break;\n } else {\n table[N] = true;\n count++;\n }\n }\n if (FLG) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", count);\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4204,"score_of_the_acc":-0.2444,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2424_9575336\",\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 MAXS = 1000000;\\nvector<int> Next(MAXS + 1,-1);\\n\\nint main() {\\n rep(i,10,MAXS+1) {\\n string s = to_string(i);\\n rep(j,1,s.size()) {\\n chmax(Next[i], stoi(s.substr(0,j)) * stoi(s.substr(j,s.size()-j)));\\n }\\n }\\n int Q;\\n cin >> Q;\\n rep(_,0,Q) {\\n int A;\\n cin >> A;\\n vector<bool> vis(MAXS+1,false);\\n int ANS = 0;\\n bool flag = false;\\n while(Next[A] >= 0) {\\n if (vis[A]) {\\n cout << -1 << endl;\\n flag = true;\\n break;\\n }\\n vis[A] = true;\\n ANS++;\\n A = Next[A];\\n }\\n if (!flag) cout << ANS << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 7420,\n \"score_of_the_acc\": -2,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2424_8819423\",\n \"code_snippet\": \"#include <stdio.h>\\nusing namespace std;\\n\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (N >= 10) {\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N]) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.05,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2424_8528313\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint main() {\\n constexpr int N = 1000001;\\n std::array<int, N> ans;\\n ans.fill(1e9);\\n\\n auto dfs = [&](auto self, int val) -> int {\\n if (ans[val] != 1e9) return ans[val];\\n if (val < 10) {\\n return ans[val] = 0;\\n }\\n int max_val = -1;\\n std::string s = std::to_string(val);\\n for (int i = 1; i < (int)s.size(); i++) {\\n auto lhs = s.substr(0, i);\\n auto rhs = s.substr(i);\\n max_val = std::max(max_val, std::stoi(lhs) * std::stoi(rhs));\\n }\\n return ans[val] = self(self, max_val) + 1;\\n };\\n\\n for (int i = 0; i < N; i++) dfs(dfs, i);\\n\\n int q;\\n std::cin >> q;\\n while (q--) {\\n int n;\\n std::cin >> n;\\n std::cout << ans[n] << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 7408,\n \"score_of_the_acc\": -1.997,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2424_8216544\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool table[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n fill(table, table + 1000001, false);\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (N / 10 != 0) {\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = max > tmp ? max : tmp;\\n }\\n N = max;\\n if (table[N]) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n printf(FLG ? \\\"-1\\\\n\\\" : \\\"%d\\\\n\\\", count);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.1201,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2424_8216530\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n for (int i = 0; i <= N; i++)\\n table[i] = false;\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.0701,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2424_8216526\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3692,\n \"score_of_the_acc\": -0.1161,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2424_8208961\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i < 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.1211,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2424_8208957\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool table[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.1201,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2424_8116634\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <cstdio>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool table[1000001] = {};\\n for (int loop = 0; loop < Q; loop++) {\\n fill(table, table + 1000001, false);\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N < 10)\\n break;\\n max = 0;\\n for (S = 10; S <= N; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = max >= tmp ? max : tmp;\\n }\\n N = max;\\n if (table[N]) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.1211,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2424_8116631\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N < 10)\\n break;\\n max = 0;\\n for (S = 10; S <= N; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.054,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2424_8116629\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nconst int MAX_N = 1000000;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[MAX_N + 1];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= MAX_N; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2424_8116625\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001]();\\n for (int loop = 0; loop < Q; loop++) {\\n fill(table, table + 1000001, false);\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N < 10)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N]) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2424_8116624\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N < 10)\\n break;\\n max = 0;\\n for (S = 10; N >= S; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.1292,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2424_8116623\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001]();\\n for (int loop = 0; loop < Q; loop++) {\\n fill(table, table + 1000001, false);\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n int max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N]) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2424_8116621\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <stack>\\n#include <stdio.h>\\n#include <vector>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n delete[] table;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2424_8113482\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n int Q, N, count, tmp, max, S;\\n bool FLG;\\n scanf(\\\"%d\\\", &Q);\\n bool *table = new bool[1000001];\\n for (int loop = 0; loop < Q; loop++) {\\n for (int i = 0; i <= 1000000; i++)\\n table[i] = false;\\n count = 0;\\n scanf(\\\"%d\\\", &N);\\n table[N] = true;\\n FLG = false;\\n while (true) {\\n if (N / 10 == 0)\\n break;\\n max = 0;\\n for (S = 10; N / S != 0; S *= 10) {\\n tmp = (N / S) * (N % S);\\n max = (max >= tmp) ? max : tmp;\\n }\\n N = max;\\n if (table[N] == true) {\\n FLG = true;\\n break;\\n } else {\\n table[N] = true;\\n count++;\\n }\\n }\\n if (FLG) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", count);\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4204,\n \"score_of_the_acc\": -0.2444,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1394,"cells":{"group_id":{"kind":"string","value":"aoj_2436_cpp"},"problem_description":{"kind":"string","value":"問題名\n今\nn\n枚の数字が書かれたカードがあります。これらの一部または全部を適当に並べて数字を作ることを考えます。この時作られる数字を全て足した数を求めて下さい。\n例えば、 1 と 2 があったら、作られる数字は 1, 2, 12, 21 の 4 つなので、全て足した数は 36 になります。並べた結果同じ数字が出来ても違う並べ方だとしたら別々に足します。たとえば、 1 というカードと 11 というカードがあったら並べて 111 になる並べ方が2通りありますがそれぞれ別のものとして足し合わせます。カードの中にリーディングゼロのカードはありませんし、リーディングゼロになる数字は認めません。答えを1,000,000,007 で割ったものを出力してください。\nInput\n入力は、以下の形で与えられます。\nn\na\n1\na\n2\n...\na\nn\n最初の 1 行にはカードの枚数を表す\nn\n（\n1 ≤ n ≤ 200\n）、次の\nn\n行にはそれぞれのカードに書かれている数字\na\ni\n(\n0 ≤ a\ni\n< 10000\n) が書かれています。また複数のカードに同じ数字が書かれていることはありません。\nOutput\n作ることの出来る全ての数字の合計を 1,000,000,007 で割ったものを 1 行に出力しなさい。\nSample Input 1\n2\n1\n2\nOutput for the Sample Input 1\n36\nサンプルにあった例です。\nSample Input 2\n2\n1\n11\nOutput for the Sample Input 2\n234\n作られる数字は 1 と 11 と、 111 が 2 通り作られるので全て足して 234 となります。\nSample Input 3\n4\n0\n4\n7\n8\nOutput for the Sample Input 3\n135299\n04 や 078 といった並べ方は認められないことに注意してください。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2436_10561821","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod = 1000000007;\n\nint dp[202][202][802];\n\nlong long solve(vector<string> S) {\n\tif (S.size() == 0) return 0;\n\tvector<int> digsum(6, 0);\n\tfor (int i = 0; i < S.size(); i++) {\n\t\tdigsum[S[i].size()] += stoi(S[i]);\n\t}\n\n\t// init\n\tvector<long long> fact(S.size() + 2, 0);\n\tvector<long long> pow10(5 * S.size() + 2, 0);\n\tvector<vector<long long>> nr(S.size() + 2, vector<long long>(S.size() + 2, 0));\n\tfact[0] = 1;\n\tpow10[0] = 1;\n\tfor (int i = 1; i <= S.size() * 1; i++) fact[i] = (1LL * i * fact[i - 1]) % mod;\n\tfor (int i = 1; i <= S.size() * 5; i++) pow10[i] = (10LL * pow10[i - 1]) % mod;\n\tnr[0][0] = 1;\n\tfor (int i = 0; i < S.size(); i++) {\n\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\tnr[i + 1][j + 0] += nr[i][j];\n\t\t\tnr[i + 1][j + 0] %= mod;\n\t\t\tnr[i + 1][j + 1] += nr[i][j];\n\t\t\tnr[i + 1][j + 1] %= mod;\n\t\t}\n\t}\n\n\t// brute force\n\tlong long ans = 0;\n\tfor (int d = 1; d <= 5; d++) {\n\t\tfor (int i = 0; i <= S.size(); i++) {\n\t\t\tfor (int j = 0; j <= S.size(); j++) {\n\t\t\t\tfor (int k = 0; k <= 4 * S.size() + 1; k++) dp[i][j][k] = 0;\n\t\t\t}\n\t\t}\n\t\tbool flag = false;\n\t\tdp[0][0][0] = 1;\n\t\tfor (int i = 0; i < S.size(); i++) {\n\t\t\tbool special = ((flag == true || S[i].size() != d) ? true : false);\n\t\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\t\tfor (int k = 0; k <= S.size() * 4; k++) {\n\t\t\t\t\tif (dp[i][j][k] == 0) continue;\n\t\t\t\t\tdp[i + 1][j][k] += dp[i][j][k];\n\t\t\t\t\tdp[i + 1][j][k] %= mod;\n\t\t\t\t\tif (special == true) {\n\t\t\t\t\t\tdp[i + 1][j + 1][k + S[i].size()] += dp[i][j][k];\n\t\t\t\t\t\tdp[i + 1][j + 1][k + S[i].size()] %= mod;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (special == false) flag = true;\n\t\t}\n\n\t\t// calculate\n\t\tfor (int i = 0; i <= S.size() - 1; i++) {\n\t\t\tfor (int j = 0; j <= S.size() * 4 + 1; j++) {\n\t\t\t\tfor (int k = i; k <= S.size() - 1; k++) {\n\t\t\t\t\tlong long ways = fact[i] * fact[k - i] % mod;\n\t\t\t\t\tways = ways * dp[S.size()][i][j] % mod;\n\t\t\t\t\tways = ways * nr[S.size() - 1 - i][k - i] % mod;\n\t\t\t\t\tlong long score = pow10[j] * digsum[d] % mod;\n\t\t\t\t\tif (ways * score >= 10000) {\n\t\t\t\t\t\tways += 1;\n\t\t\t\t\t\tways -= 1;\n\t\t\t\t\t}\n\t\t\t\t\tans += ways * score;\n\t\t\t\t\tans %= mod;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main() {\n\t// step 1. input\n\tint N; cin >> N;\n\tvector<string> S1;\n\tvector<string> S2;\n\tfor (int i = 0; i < N; i++) {\n\t\tstring r; cin >> r;\n\t\tS1.push_back(r);\n\t\tif (r != \"0\") S2.push_back(r);\n\t}\n\n\t// step 2. solve\n\tlong long ans = solve(S1);\n\tif (S1.size() != S2.size()) ans = (ans - solve(S2) + mod) % mod;\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":130768,"score_of_the_acc":-1.6033,"final_rank":18},{"submission_id":"aoj_2436_10067392","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,s,t) for(int i=s;i<t;i++)\n\nconst ll mod=1e9+7;\n\nll modpow(ll x, ll k, ll m = mod) {\n ll v = 1;\n while(k) {\n if(k & 1) v = v * x % m;\n x = x * x % m;\n k >>= 1;\n }\n return v;\n}\n\nusing vll=vector<ll>;\nint len=2000;\nvll fac, finv;\nvll TENPOW;\nvll SUMP;\n\nvoid precalc(ll m = mod) {\n fac.assign(len, 1), finv.assign(len, 1);\n TENPOW.assign(len,1);\n\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\n SUMP.assign(len,0);\n rep(z,len)rep(j,z+1){\n SUMP[z]+=fac[z]*finv[z-j];\n SUMP[z]%=mod;\n }\n}\n\nll binom(ll n, ll k, ll m = mod) {\n if(n < 0 || k < 0 || k > n) return 0;\n return fac[n] * finv[k] % m * finv[n - k] % m;\n}\n\nll calc(vll A){\n vll num(4,0);\n int N=A.size();\n for(ll a:A){\n int bs=0;\n while(a>9){\n a/=10;\n bs++;\n }\n num[bs]++;\n }\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\n rep(i,4){\n if(num[i]==0)continue;\n num[i]--;\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\n F[0][0]=1;\n rep(j,4){\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\n rep(k,num[j]+1){\n rep(n,N+1-k)rep(m,n*4+1){\n if(m+(j+1)*k<=4*N&&n+k<=N)\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\n NF[n+k][m+(j+1)*k]%=mod;\n }\n }\n swap(F,NF);\n }\n DP[i]=F;\n num[i]++;\n }\n ll an=0;\n for(ll a:A){\n int bs=0;\n ll ca=a;\n while(a>9){\n a/=10;\n bs++;\n }\n rep(n,N+1)rep(m,N*4+1){\n ll res=DP[bs][n][m]*TENPOW[m];\n res%=mod;\n res*=ca;\n res%=mod;\n res*=fac[n];\n res%=mod;\n ll z=(N-n-1);\n if(z<0)continue;\n \n res*=SUMP[z];\n res%=mod;\n an+=res;\n an%=mod;\n assert(res>=0);\n\n }\n }\n return an;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n precalc();\n int N=200;\n cin>>N;\n vector<ll> A(N);\n rep(i,N)cin>>A[i];\n sort(A.begin(),A.end());\n reverse(A.begin(),A.end());\n ll an=calc(A);\n if(A.back()==0){\n A.pop_back();\n an-=calc(A);\n }\n an=(an%mod+mod)%mod;\n cout<<an<<endl;\n}","accuracy":1,"time_ms":1850,"memory_kb":10772,"score_of_the_acc":-1.057,"final_rank":14},{"submission_id":"aoj_2436_10067375","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,s,t) for(int i=s;i<t;i++)\n\n/*\n- `len` を指定したうえで `precalc()` でテーブルを前計算．`len <= mod`\nである必要がある\n- `binom(n, k)` は `n < len` を満たす必要がある\n- `mod` が固定のときは `const ll mod = 998244353;` のようにする\n- `a < len` に対して $O(1)$ で逆元が求められる．\n*/\nconst ll mod=1e9+7;\n\n// 注意： % m を % mod と書かないように！\nll modpow(ll x, ll k, ll m = mod) {\n ll v = 1;\n while(k) {\n if(k & 1) v = v * x % m;\n x = x * x % m;\n k >>= 1;\n }\n return v;\n}\n\nusing vll=vector<ll>;\nint len=2000;\nvll fac, finv;\nvll TENPOW;\nvll SUMP;\n\nvoid precalc(ll m = mod) {\n fac.assign(len, 1), finv.assign(len, 1);\n TENPOW.assign(len,1);\n\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\n SUMP.assign(len,0);\n rep(z,len)rep(j,z+1){\n SUMP[z]+=fac[z]*finv[z-j];\n SUMP[z]%=mod;\n }\n}\n\nll binom(ll n, ll k, ll m = mod) {\n if(n < 0 || k < 0 || k > n) return 0;\n // assert(n < len);\n return fac[n] * finv[k] % m * finv[n - k] % m;\n}\n\nll inv(ll a, ll m = mod) {\n // a = (a % m + m) % m; // 必要なら\n if(a < len) return fac[a - 1] * finv[a] % m;\n return modpow(a, m - 2, m);\n}\n\n\nll calc(vll A){\n vll num(4,0);\n int N=A.size();\n for(ll a:A){\n int bs=0;\n while(a>9){\n a/=10;\n bs++;\n }\n num[bs]++;\n }\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\n rep(i,4){\n if(num[i]==0)continue;\n num[i]--;\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\n F[0][0]=1;\n rep(j,4){\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\n rep(k,num[j]+1){\n rep(n,N+1-k)rep(m,n*4+1){\n if(m+(j+1)*k<=4*N&&n+k<=N)\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\n NF[n+k][m+(j+1)*k]%=mod;\n }\n }\n swap(F,NF);\n }\n DP[i]=F;\n num[i]++;\n }\n ll an=0;\n for(ll a:A){\n int bs=0;\n ll ca=a;\n while(a>9){\n a/=10;\n bs++;\n }\n rep(n,N+1)rep(m,N*4+1){\n ll res=DP[bs][n][m]*TENPOW[m];\n res%=mod;\n res*=ca;\n res%=mod;\n res*=fac[n];\n res%=mod;\n ll z=(N-n-1);\n if(z<0)continue;\n \n res*=SUMP[z];\n res%=mod;\n // if(res>0)cout<<ca<<\" \"<<n<<\" \"<<m<<endl;\n an+=res;\n an%=mod;\n assert(res>=0);\n // cout<<res<<\" \"<<an<<endl;\n\n }\n }\n return an;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n precalc();\n int N=200;\n cin>>N;\n vector<ll> A(N);\n rep(i,N)cin>>A[i];\n // set<ll> S;\n // rep(i,N){\n // A[i]=0;\n // while(S.count(A[i]))A[i]=rand()%10000;\n // S.insert(A[i]);\n // }\n sort(A.begin(),A.end());\n reverse(A.begin(),A.end());\n ll an=calc(A);\n if(A.back()==0){\n A.pop_back();\n an-=calc(A);\n }\n an=(an%mod+mod)%mod;\n cout<<an<<endl;\n}","accuracy":1,"time_ms":1850,"memory_kb":10716,"score_of_the_acc":-1.0565,"final_rank":13},{"submission_id":"aoj_2436_10067366","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,s,t) for(int i=s;i<t;i++)\n\n/*\n- `len` を指定したうえで `precalc()` でテーブルを前計算．`len <= mod`\nである必要がある\n- `binom(n, k)` は `n < len` を満たす必要がある\n- `mod` が固定のときは `const ll mod = 998244353;` のようにする\n- `a < len` に対して $O(1)$ で逆元が求められる．\n*/\nconst ll mod=1e9+7;\n\n// 注意： % m を % mod と書かないように！\nll modpow(ll x, ll k, ll m = mod) {\n ll v = 1;\n while(k) {\n if(k & 1) v = v * x % m;\n x = x * x % m;\n k >>= 1;\n }\n return v;\n}\n\nusing vll=vector<ll>;\nint len=2000;\nvll fac, finv;\nvll TENPOW;\nvll SUMP;\n\nvoid precalc(ll m = mod) {\n fac.assign(len, 1), finv.assign(len, 1);\n TENPOW.assign(len,1);\n\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\n SUMP.assign(len,0);\n rep(z,len)rep(j,z+1){\n SUMP[z]+=fac[z]*finv[z-j];\n SUMP[z]%=mod;\n }\n}\n\nll binom(ll n, ll k, ll m = mod) {\n if(n < 0 || k < 0 || k > n) return 0;\n // assert(n < len);\n return fac[n] * finv[k] % m * finv[n - k] % m;\n}\n\nll inv(ll a, ll m = mod) {\n // a = (a % m + m) % m; // 必要なら\n if(a < len) return fac[a - 1] * finv[a] % m;\n return modpow(a, m - 2, m);\n}\n\n\nll calc(vll A){\n vll num(4,0);\n int N=A.size();\n for(ll a:A){\n int bs=0;\n while(a>9){\n a/=10;\n bs++;\n }\n num[bs]++;\n }\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\n rep(i,4){\n if(num[i]==0)continue;\n num[i]--;\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\n F[0][0]=1;\n rep(j,4){\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\n rep(k,num[j]+1){\n rep(n,N+1-k)rep(m,n*4+1){\n if(m+(j+1)*k<=4*N&&n+k<=N)\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\n }\n }\n swap(F,NF);\n }\n DP[i]=F;\n num[i]++;\n }\n ll an=0;\n for(ll a:A){\n int bs=0;\n ll ca=a;\n while(a>9){\n a/=10;\n bs++;\n }\n rep(n,N+1)rep(m,N*4+1){\n ll res=DP[bs][n][m]*TENPOW[m];\n res%=mod;\n res*=ca;\n res%=mod;\n res*=fac[n];\n res%=mod;\n ll z=(N-n-1);\n if(z<0)continue;\n \n res*=SUMP[z];\n res%=mod;\n // if(res>0)cout<<ca<<\" \"<<n<<\" \"<<m<<endl;\n an+=res;\n an%=mod;\n\n }\n }\n return an;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n precalc();\n int N=200;\n cin>>N;\n vector<ll> A(N);\n rep(i,N)cin>>A[i];\n // set<ll> S;\n // rep(i,N){\n // A[i]=0;\n // while(S.count(A[i]))A[i]=rand()%10000;\n // S.insert(A[i]);\n // }\n sort(A.begin(),A.end());\n reverse(A.begin(),A.end());\n ll an=calc(A);\n if(A.back()==0){\n A.pop_back();\n an-=calc(A);\n }\n an=(an%mod+mod)%mod;\n cout<<an<<endl;\n}","accuracy":0.5,"time_ms":30,"memory_kb":3736,"score_of_the_acc":-0.0125,"final_rank":19},{"submission_id":"aoj_2436_9840940","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 <unsigned mod = 1000000007> struct fp {\n unsigned v;\n static constexpr int get_mod() {\n return mod;\n }\n constexpr unsigned inv() const {\n assert(v != 0);\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\n while (y > 0) {\n t = x / y;\n x -= t * y, p -= t * q;\n tmp = x, x = y, y = tmp;\n tmp = p, p = q, q = tmp;\n }\n if (p < 0)\n p += mod;\n return p;\n }\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\n fp operator-() const {\n return fp() - *this;\n }\n fp pow(ull t) {\n fp res = 1, b = *this;\n while (t) {\n if (t & 1)\n res *= b;\n b *= b;\n t >>= 1;\n }\n return res;\n }\n fp &operator+=(const fp &x) {\n if ((v += x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator-=(const fp &x) {\n if ((v += mod - x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator*=(const fp &x) {\n v = ull(v) * x.v % mod;\n return *this;\n }\n fp &operator/=(const fp &x) {\n v = ull(v) * x.inv() % mod;\n return *this;\n }\n fp operator+(const fp &x) const {\n return fp(*this) += x;\n }\n fp operator-(const fp &x) const {\n return fp(*this) -= x;\n }\n fp operator*(const fp &x) const {\n return fp(*this) *= x;\n }\n fp operator/(const fp &x) const {\n return fp(*this) /= x;\n }\n bool operator==(const fp &x) const {\n return v == x.v;\n }\n bool operator!=(const fp &x) const {\n return v != x.v;\n }\n friend istream &operator>>(istream &is, fp &x) {\n return is >> x.v;\n }\n friend ostream &operator<<(ostream &os, const fp &x) {\n return os << x.v;\n }\n};\n\ntemplate <typename T> T Inv(ll n) {\n static const int md = T::get_mod();\n static vector<T> buf({0, 1});\n assert(n > 0);\n n %= md;\n while (SZ(buf) <= n) {\n int k = SZ(buf), q = (md + k - 1) / k;\n buf.push_back(buf[k * q - md] * q);\n }\n return buf[n];\n}\n\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\n static const int md = T::get_mod();\n static vector<T> buf({1, 1}), ibuf({1, 1});\n assert(n >= 0 and n < md);\n while (SZ(buf) <= n) {\n buf.push_back(buf.back() * SZ(buf));\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\n }\n return inv ? ibuf[n] : buf[n];\n}\n\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\n return nCr<T>(n + r - 1, r, inv);\n}\n\n/**\n * @brief Modint\n */\n\nusing Fp = fp<1000000007>;\nint MAXS = 10000, MAXL = 800, MAXN = 200;\n\nFp Calc(vector<ll> COUNT) {\n vector<Fp> D2(MAXN+1), D10(MAXL+1);\n D10[0] = 1;\n rep(i,0,MAXN+1) {\n D2[i] = 0;\n rep(j,0,i+1) {\n D2[i] += nCr<Fp>(i,j) * Fact<Fp>(j);\n }\n }\n rep(i,0,MAXL) D10[i+1] = D10[i] * 10;\n Fp Ret = 0;\n rep(i,0,COUNT[1]+1) {\n rep(j,0,COUNT[2]+1) {\n rep(k,0,COUNT[3]+1) {\n rep(l,0,COUNT[4]+1) {\n Fp Mul = 1;\n Mul *= nCr<Fp>(COUNT[1],i);\n Mul *= nCr<Fp>(COUNT[2],j);\n Mul *= nCr<Fp>(COUNT[3],k);\n Mul *= nCr<Fp>(COUNT[4],l);\n Mul *= nCr<Fp>(i+j,j);\n Mul *= nCr<Fp>(i+j+k,k);\n Mul *= nCr<Fp>(i+j+k+l,l);\n Mul *= Fact<Fp>(i);\n Mul *= Fact<Fp>(j);\n Mul *= Fact<Fp>(k);\n Mul *= Fact<Fp>(l);\n Mul *= D2[COUNT[1]+COUNT[2]+COUNT[3]+COUNT[4]-i-j-k-l];\n Mul *= D10[i+j*2+k*3+l*4];\n Ret += Mul;\n }\n }\n }\n }\n return Ret;\n // vector<int> Len;\n // rep(i,1,5) {\n // rep(j,0,COUNT[i]) Len.push_back(i);\n // }\n // int N = Len.size();\n // vector DP(N+1, vector(N+1, vector<Fp>(MAXL+1,0)));\n // DP[0][0][0] = 1;\n // rep(k,0,N) {\n // rep(i,0,k+1) {\n // int j = k-i;\n // rep(m,0,MAXL+1) {\n // if (DP[i][j][m] == 0) continue;\n // DP[i+1][j][m] += DP[i][j][m] * (i+1);\n // DP[i][j+1][m+Len[k]] += DP[i][j][m] * (j+1);\n // }\n // }\n // }\n // Fp Ret = 0, D = 1;\n // rep(k,0,MAXL+1) {\n // rep(i,0,N+1) {\n // int j = N-i;\n // Ret += DP[i][j][k] * D;\n // }\n // D *= 10;\n // }\n // return Ret;\n}\n\nFp Solve(vector<bool> X) {\n vector<ll> COUNT(5,0), SUM(5,0);\n rep(i,0,MAXS) {\n if (!X[i]) continue;\n int Len = to_string(i).size();\n COUNT[Len]++;\n SUM[Len] += i;\n }\n Fp Ret = 0;\n rep(i,1,5) {\n if (COUNT[i] == 0) continue;\n COUNT[i]--;\n Ret += Calc(COUNT) * SUM[i];\n COUNT[i]++;\n }\n return Ret;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<bool> X(MAXS,false);\n rep(i,0,N) {\n int A;\n cin >> A;\n X[A] = true;\n }\n if (N == 1 && X[0]) {\n cout << 0 << endl;\n return 0;\n }\n Fp ANS = Solve(X);\n if (X[0]) {\n X[0] = false;\n ANS -= Solve(X);\n }\n cout << ANS << endl;\n}","accuracy":1,"time_ms":1830,"memory_kb":3524,"score_of_the_acc":-0.9891,"final_rank":12},{"submission_id":"aoj_2436_8189513","code_snippet":"#include <string.h>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <memory>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nconstexpr int mod = 1000000007;\n\nvoid mpl(int &x,int y) {\n x += y;\n if(x >= mod) x -= mod;\n}\n\nint dp[202][202][202][2][2];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n cin >> n;\n vector<int>a(n),b(5,1);\n for(int i = 0; i < n; i++) {\n cin >> a[i];\n }\n for(int i = 1; i < 5; i++) b[i] = b[i-1]*10;\n dp[0][0][0][0][1] = 1;\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n for(int k = 0; k < n; k++) {\n for(int f1 = 0; f1 < 2; f1++) {\n for(int f2 = 0; f2 < 2; f2++) {\n if(!dp[i][j][k][f1][f2]) continue;\n mpl(dp[i+1][j+1][k][f1][f2],1ll*dp[i][j][k][f1][f2]*(j+1)*b[to_string(a[i]).size()]%mod);\n if(a[i] == 0) {\n mpl(dp[i+1][j][k+1][f1][f2],1ll*dp[i][j][k][f1][f2]*k%mod);\n mpl(dp[i+1][j][k+1][f1][0],dp[i][j][k][f1][f2]);\n }\n else {\n mpl(dp[i+1][j][k+1][f1][f2],1ll*dp[i][j][k][f1][f2]*k%mod);\n mpl(dp[i+1][j][k+1][f1][1],dp[i][j][k][f1][f2]);\n }\n if(f1 == 0) mpl(dp[i+1][j][k][1][f2],1ll*dp[i][j][k][f1][f2]*a[i]%mod);\n mpl(dp[i+1][j][k][f1][f2],dp[i][j][k][f1][f2]);\n }\n }\n }\n }\n }\n int ans = 0;\n for(int i = 0; i <= n; i++) {\n for(int j = 0; j <= n; j++) {\n mpl(ans,dp[n][i][j][1][1]);\n }\n }\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":320,"memory_kb":129544,"score_of_the_acc":-1.1589,"final_rank":17},{"submission_id":"aoj_2436_7137060","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nconstexpr ll mod = 1e9+7;\n\nll mod_pow(ll a,ll b){\n a%=mod;\n if(b==0)return 1;\n if(b==1)return a;\n ll res=mod_pow(a,b/2)%mod;\n res*=res; res%=mod;\n if(b%2)res*=a;\n return res%mod;\n}\n\nstruct perm{\n vector<ll> p,invp;\n perm(int n){\n p.resize(n+1),invp.resize(n+1);\n p[0]=1;\n for(int i=1;i<=n;i++){\n p[i]=p[i-1]*i%mod;\n }\n invp[n]=mod_pow(p[n],mod-2);\n for(int i=n-1;i>=0;i--){\n invp[i]=invp[i+1]*(i+1)%mod;\n }\n }\n ll comb(ll x,ll y){\n if(x<y||y<0)return 0;\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\n }\n};\nperm p(1<<20);\n\nconst int N = 201;\nll P[N][N];\n\nll solve(vector<pair<int,int>> a){\n ll res = 0;\n sort(a.begin(), a.end());\n int n = a.size();\n for(int i=0;i<n;i++){\n ll dsum = 0;\n {\n int j = i;\n while(i<n and a[i].second == a[j].second){\n dsum += a[i].first;\n i++;\n }\n i--;\n }\n int m = 0;\n vector<int> cnt(6);\n for(int j=0;j<n;j++){\n if(i==j) continue;\n cnt[a[j].second]++;\n m += a[j].second;\n }\n vector<vector<ll>> dp(n,vector<ll>(m+1));\n dp[0][0] = 1;\n // 何個使ったか iを使う前に何桁あるか\n for(int j=1;j<=5;j++){\n for(int k=n-1;k>=0;k--){\n for(int l=m;l>=0;l--){\n if(!dp[k][l]) continue;\n for(int c=1;c<=cnt[j];c++){\n ll ad = p.comb(cnt[j], c)*dp[k][l]%mod;\n ad *= p.comb(k+c, c);\n ad %= mod;\n ad *= p.p[c];\n ad %= mod;\n dp[k+c][l+c*j] += ad;\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\n }\n }\n }\n }\n for(int j=0;j<n;j++){\n ll ten = 1;\n for(int k=0;k<=m;k++){\n /*\n * n-1-j枚ある\n * 0枚選んで並べる通り数\n * 1枚選んで並べる通り数\n * n-1-j枚選んで並べる通り数\n */\n ll ad = dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\n res += ad;\n// if(dp[j][k])cout << a[i].second << \" \" << P[n-1-j][n-1-j] << \" \" << dp[j][k] << \" \" << j << \" \" << k << \" \" << ad << endl;\n ten = ten * 10 % mod;\n }\n }\n }\n return res%mod;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n for(int i=0;i<N;i++){\n ll u = 1;\n for(int j=0;j<=i;j++){\n P[i][j] = u;\n u *= (i-j); u %= mod;\n if(j){\n P[i][j] += P[i][j-1];\n if(P[i][j] >= mod) P[i][j] -= mod;\n }\n }\n }\n int n; cin >> n;\n vector<pair<int,int>> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i].first;\n a[i].second = to_string(a[i].first).size();\n }\n sort(a.rbegin(), a.rend());\n ll res = solve(a);\n if(a.back().first == 0){\n a.pop_back();\n res -= solve(a);\n if(res < 0) res += mod;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":20912,"score_of_the_acc":-0.153,"final_rank":2},{"submission_id":"aoj_2436_7136783","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nconstexpr ll mod = 1e9+7;\n\nll mod_pow(ll a,ll b){\n a%=mod;\n if(b==0)return 1;\n if(b==1)return a;\n ll res=mod_pow(a,b/2)%mod;\n res*=res; res%=mod;\n if(b%2)res*=a;\n return res%mod;\n}\n\nstruct perm{\n vector<ll> p,invp;\n perm(int n){\n p.resize(n+1),invp.resize(n+1);\n p[0]=1;\n for(int i=1;i<=n;i++){\n p[i]=p[i-1]*i%mod;\n }\n invp[n]=mod_pow(p[n],mod-2);\n for(int i=n-1;i>=0;i--){\n invp[i]=invp[i+1]*(i+1)%mod;\n }\n }\n ll comb(ll x,ll y){\n if(x<y||y<0)return 0;\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\n }\n};\nperm p(1<<20);\n\nconst int N = 201;\nll P[N][N];\n\nll solve(vector<pair<int,int>> a){\n ll res = 0;\n sort(a.begin(), a.end());\n int n = a.size();\n for(int i=0;i<n;i++){\n ll dsum = 0;\n {\n int j = i;\n while(i<n and a[i].second == a[j].second){\n dsum += a[i].first;\n i++;\n }\n i--;\n }\n int m = 0;\n vector<int> cnt(6);\n for(int j=0;j<n;j++){\n if(i==j) continue;\n cnt[a[j].second]++;\n m += a[j].second;\n }\n vector<vector<ll>> dp(n,vector<ll>(m+1));\n dp[0][0] = 1;\n // 何個使ったか iを使う前に何桁あるか\n for(int j=1;j<=5;j++){\n for(int k=n-1;k>=0;k--){\n for(int l=m;l>=0;l--){\n if(!dp[k][l]) continue;\n for(int c=1;c<=cnt[j];c++){\n ll ad = p.comb(cnt[j], c)*dp[k][l]%mod;\n ad *= p.comb(k+c, c);\n ad %= mod;\n ad *= p.p[c];\n ad %= mod;\n dp[k+c][l+c*j] += ad;\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\n }\n }\n }\n }\n for(int j=0;j<n;j++){\n ll ten = 1;\n for(int k=0;k<=m;k++){\n /*\n * n-1-j枚ある\n * 0枚選んで並べる通り数\n * 1枚選んで並べる通り数\n * n-1-j枚選んで並べる通り数\n */\n ll ad = dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\n res += ad;\n// if(dp[j][k])cout << a[i].second << \" \" << P[n-1-j][n-1-j] << \" \" << dp[j][k] << \" \" << j << \" \" << k << \" \" << ad << endl;\n ten = ten * 10 % mod;\n }\n }\n }\n return res%mod;\n}\n\n/*\n * 60666 60600\n * 66066 66000\n * 66606 66600\n * 66660 66060\n *\n * 666 600\n * 6066 6000\n * 6606 6600\n * 6660 6060\n *\n * 303 300\n * 330 300\n * 66 00\n *\n * 13 10\n */\n\n\nll gutyoku(vector<pair<int,int>> a){\n int n = a.size();\n ll res = 0;\n map<int,int> mp;\n for(int i=1;i<(1<<n);i++){\n vector<pair<pair<int,int>,int>> v;\n for(int j=0;j<n;j++){\n if((1<<j)&i) v.push_back({a[j],j});\n }\n sort(v.begin() , v.end());\n do{\n if(v[0].first.first == 0) continue;\n ll sum = 0;\n for(auto p:v){\n for(int j=0;j<p.first.second;j++){\n sum *= 10; sum %= mod;\n }\n sum += p.first.first;\n }\n mp[sum]++;\n res += sum;\n }while(next_permutation(v.begin(), v.end()));\n }\n for(auto p:mp){\n cout << p.first << \" \" << p.second << endl;\n }\n return res%mod;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n for(int i=0;i<N;i++){\n ll u = 1;\n for(int j=0;j<=i;j++){\n P[i][j] = u;\n u *= (i-j); u %= mod;\n if(j){\n P[i][j] += P[i][j-1];\n if(P[i][j] >= mod) P[i][j] -= mod;\n }\n }\n }\n int n; cin >> n;\n vector<pair<int,int>> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i].first;\n a[i].second = to_string(a[i].first).size();\n }\n sort(a.rbegin(), a.rend());\n// cerr << gutyoku(a) << endl;\n ll res = solve(a);\n if(a.back().first == 0){\n a.pop_back();\n res -= solve(a);\n if(res < 0) res += mod;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":21004,"score_of_the_acc":-0.1537,"final_rank":3},{"submission_id":"aoj_2436_7136598","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nconstexpr ll mod = 1e9+7;\n\nll mod_pow(ll a,ll b){\n a%=mod;\n if(b==0)return 1;\n if(b==1)return a;\n ll res=mod_pow(a,b/2)%mod;\n res*=res; res%=mod;\n if(b%2)res*=a;\n return res%mod;\n}\n\nstruct perm{\n vector<ll> p,invp;\n perm(int n){\n p.resize(n+1),invp.resize(n+1);\n p[0]=1;\n for(int i=1;i<=n;i++){\n p[i]=p[i-1]*i%mod;\n }\n invp[n]=mod_pow(p[n],mod-2);\n for(int i=n-1;i>=0;i--){\n invp[i]=invp[i+1]*(i+1)%mod;\n }\n }\n ll comb(ll x,ll y){\n if(x<y||y<0)return 0;\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\n }\n};\nperm p(1<<20);\n\nconst int N = 201;\nll P[N][N];\n\nll solve(vector<pair<int,int>> a){\n ll res = 0;\n sort(a.begin(), a.end());\n int n = a.size();\n for(int i=0;i<n;i++){\n ll dsum = 0;\n {\n int j = i;\n while(i<n and a[i].second == a[j].second){\n dsum += a[i].first;\n i++;\n }\n i--;\n }\n int m = 0;\n vector<int> cnt(6);\n for(int j=0;j<n;j++){\n if(i==j) continue;\n cnt[a[j].second]++;\n m += a[j].second;\n }\n vector<vector<ll>> dp(n,vector<ll>(m+1));\n dp[0][0] = 1;\n for(int j=1;j<=5;j++){\n for(int k=n-1;k>=0;k--){\n for(int l=m;l>=0;l--){\n if(!dp[k][l]) continue;\n for(int c=1;c<=cnt[j];c++){\n ll ad = p.comb(cnt[j], c);\n ad *= p.comb(k+c, c);\n ad %= mod;\n ad *= p.p[c];\n ad %= mod;\n dp[k+c][l+c*j] += ad;\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\n }\n }\n }\n }\n for(int j=0;j<n;j++){\n ll ten = 1;\n for(int k=0;k<=m;k++){\n res += dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\n ten = ten * 10 % mod;\n }\n }\n }\n return res%mod;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n for(int i=0;i<N;i++){\n ll u = 1;\n for(int j=0;j<=i;j++){\n P[i][j] = u;\n u *= (i-j); u %= mod;\n if(j){\n P[i][j] += P[i][j-1];\n if(P[i][j] >= mod) P[i][j] -= mod;\n }\n }\n }\n int n; cin >> n;\n vector<pair<int,int>> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i].first;\n a[i].second = to_string(a[i].first).size();\n }\n sort(a.rbegin(), a.rend());\n ll res = solve(a);\n if(a.back().first == 0){\n a.pop_back();\n res -= solve(a);\n if(res < 0) res += mod;\n }\n cout << res << endl;\n}","accuracy":0.10526315789473684,"time_ms":10,"memory_kb":19728,"score_of_the_acc":-0.1273,"final_rank":20},{"submission_id":"aoj_2436_6755433","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\n#ifndef OTERA_MODINT\n#define OTERA_MODINT 1\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n#include <utility>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n unsigned int umod() const { return _m; }\n\n unsigned int mul(unsigned int a, unsigned int b) const {\n\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace otera {\n using modint107 = atcoder::modint1000000007;\n using modint998 = atcoder::modint998244353;\n using modint = atcoder::modint;\n}; //namespace otera\n\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint1000000007 &e) {\n out << e.val();\n return out;\n}\n\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint998244353 &e) {\n out << e.val();\n return out;\n}\n\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint &e) {\n out << e.val();\n return out;\n}\n\n#endif // OTERA_MODINT\n\n\nnamespace otera{\n template<typename T>\n class powtable {\n public:\n powtable(long long x) : x_(T(x)), pw_(1, 1) {}\n powtable(long long x, int n) : x_(T(x)), pw_(1, 1) {\n ensure(n);\n }\n T pow(const int n) {\n assert(n >= 0);\n ensure(n);\n return pw_[n];\n }\n T operator[](const int n) {\n return pow(n);\n }\n private:\n T x_;\n std::vector<T> pw_;\n void ensure(const int n) {\n int sz = pw_.size();\n if(n + 1 <= sz) return;\n int next_sz = std::max(n + 1, sz * 2);\n pw_.resize(next_sz);\n for(int i = sz; i < next_sz; ++ i) {\n pw_[i] = pw_[i - 1] * x_;\n }\n }\n };\n} // namespace otera\n\n\n\nnamespace otera{\n template<typename T>\n class factorial {\n public:\n factorial() {}\n factorial(int n) {\n ensure(n);\n }\n T com(const int n, const int k) {\n if(n == k) return 1;\n if(n < k or n < 0 or k < 0) return 0;\n ensure(n);\n return fact_[n] * finv_[k] * finv_[n - k];\n }\n T fact(const int n) {\n if(n < 0) return 0;\n ensure(n);\n return fact_[n];\n }\n T inv(const int n) {\n if(n < 0) return 0;\n ensure(n);\n return inv_[n];\n }\n T finv(const int n) {\n if(n < 0) return 0;\n ensure(n);\n return finv_[n];\n }\n private:\n static std::vector<T> fact_, inv_, finv_;\n int MOD = T::mod();\n void ensure(const int n) {\n int sz = fact_.size();\n if(n + 1 <= sz) return;\n int next_sz = std::max(n + 1, sz * 2);\n fact_.resize(next_sz), inv_.resize(next_sz), finv_.resize(next_sz);\n for(int i = sz; i < next_sz; ++ i) {\n fact_[i] = fact_[i - 1] * i;\n inv_[i] = -inv_[MOD % i] * (MOD / i);\n finv_[i] = finv_[i - 1] * inv_[i];\n }\n }\n };\n template<typename T> std::vector<T> factorial<T>::fact_ {1, 1};\n template<typename T> std::vector<T> factorial<T>::inv_ {1, 1};\n template<typename T> std::vector<T> factorial<T>::finv_ {1, 1};\n} // namespace otera\n\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\nusing mint = otera::modint107;\notera::factorial<mint> bc;\n\nmint calc(int n, vc<int> a) {\n otera::powtable<mint> pw(10);\n otera::powtable<mint> pw2(2);\n // INT(n);\n // VEC(int, a, n);\n vc<int> b(n);\n vc<int> c(5, 0);\n int cnt0 = 0;\n rep(i, n) {\n if(a[i] == 0) ++ cnt0;\n b[i] = si(to_string(a[i]));\n c[b[i]] ++;\n }\n vc<mint> pre(n + 1, 0);\n pre[0] = 1;\n for(int j = 1; j <= n; ++ j) {\n for(int i = 0; i <= j; ++ i) {\n pre[j] += bc.com(j, i) * bc.fact(i);\n }\n }\n mint ans = 0;\n vvc<mint> dp(4 * n + 1, vc<mint>(n + 1, 0));\n dp[0][0] = 1;\n for(int j = 1; j <= 4; ++ j) {\n for(int x = 4 * n; x >= 0; -- x) {\n for(int y = n; y >= 0; -- y) {\n if(dp[x][y] == 0) continue;\n for(int z = 1; z <= c[j]; ++ z) {\n if(x + j * z <= 4 * n && y + z <= n) {\n dp[x + j * z][y + z] += dp[x][y] * bc.com(c[j], z);\n }\n }\n }\n }\n }\n rep(i, 4 * n + 1) {\n rep(j, n + 1) {\n if(dp[i][j] != 0) {\n debug(i, j, dp[i][j]);\n }\n }\n }\n vector ndp(4 * n + 1, vc<mint>(n + 1, 0));\n rep(i, n) {\n if(a[i] != 0) {\n debug(i, b[i]);\n for(int x = 0; x <= 4 * n; ++ x) {\n for(int y = 0; y <= n; ++ y) {\n if(x - b[i] >= 0 && y - 1 >= 0) {\n ndp[x][y] = dp[x][y] - ndp[x - b[i]][y - 1];\n } else {\n ndp[x][y] = dp[x][y];\n }\n }\n }\n rep(x, 4 * n + 1) {\n assert(ndp[x][n] == 0);\n }\n for(int x = 0; x <= 4 * n; ++ x) {\n for(int y = 0; y <= n - 1; ++ y) {\n if(ndp[x][y] != 0) {\n debug(i, x, y, ndp[x][y]);\n }\n ans += a[i] * ndp[x][y] * pw[x] * pre[n - 1 - y] * bc.fact(y);\n }\n }\n }\n }\n return ans;\n}\n\nvoid solve() {\n // otera::powtable<mint> pw(10);\n // otera::powtable<mint> pw2(2);\n INT(n);\n VEC(int, a, n);\n mint ans = calc(n, a);\n int cnt0 = 0;\n rep(i, n) {\n if(a[i] == 0) ++ cnt0;\n }\n if(cnt0 > 0) {\n Sort(a); Rev(a); a.pop_back();\n ans -= mint(cnt0) * calc(n - 1, a);\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":550,"memory_kb":4852,"score_of_the_acc":-0.3039,"final_rank":6},{"submission_id":"aoj_2436_6670706","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 <int mod>\nclass Modint {\n using mint = Modint;\n static_assert(mod > 0, \"Modulus must be positive\");\n\npublic:\n static constexpr int get_mod() noexcept { return mod; }\n\n constexpr Modint(long long y = 0) noexcept : x(y >= 0 ? y % mod : (y % mod + mod) % mod) {}\n\n constexpr int value() const noexcept { return x; }\n\n constexpr mint& operator+=(const mint& r) noexcept { if ((x += r.x) >= mod) x -= mod; return *this; }\n constexpr mint& operator-=(const mint& r) noexcept { if ((x += mod - r.x) >= mod) x -= mod; return *this; }\n constexpr mint& operator*=(const mint& r) noexcept { x = static_cast<int>(1LL * x * r.x % mod); return *this; }\n constexpr mint& operator/=(const mint& r) noexcept { *this *= r.inv(); return *this; }\n\n constexpr mint operator-() const noexcept { return mint(-x); }\n\n constexpr mint operator+(const mint& r) const noexcept { return mint(*this) += r; }\n constexpr mint operator-(const mint& r) const noexcept { return mint(*this) -= r; }\n constexpr mint operator*(const mint& r) const noexcept { return mint(*this) *= r; }\n constexpr mint operator/(const mint& r) const noexcept { return mint(*this) /= r; }\n\n constexpr bool operator==(const mint& r) const noexcept { return x == r.x; }\n constexpr bool operator!=(const mint& r) const noexcept { return x != r.x; }\n\n constexpr mint inv() const noexcept {\n int a = x, b = mod, u = 1, v = 0;\n while (b > 0) {\n int t = a / b;\n std::swap(a -= t * b, b);\n std::swap(u -= t * v, v);\n }\n return mint(u);\n }\n\n constexpr mint pow(long long n) const noexcept {\n mint 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 std::ostream& operator<<(std::ostream& os, const mint& r) {\n return os << r.x;\n }\n\n friend std::istream& operator>>(std::istream& is, mint& r) {\n long long t;\n is >> t;\n r = mint(t);\n return is;\n }\n\nprivate:\n int x;\n};\n\nusing mint = Modint<(int) 1e9+7>;\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\ntemplate <typename T>\nclass Combination {\npublic:\n Combination() = default;\n Combination(int n) : fact_(n + 1), fact_inv_(n + 1) {\n fact_[0] = 1;\n for (int i = 1; i <= n; ++i) fact_[i] = fact_[i - 1] * i;\n fact_inv_[n] = T(1) / fact_[n];\n for (int i = n; i > 0; --i) fact_inv_[i - 1] = fact_inv_[i] * i;\n }\n\n T perm(int n, int r) const {\n if (r < 0 || n < r) return 0;\n return fact_[n] * fact_inv_[n - r];\n }\n\n T comb(int n, int r) const {\n if (r < 0 || n < r) return 0;\n return fact_[n] * fact_inv_[r] * fact_inv_[n - r];\n }\n\n T fact(int n) const { return fact_[n]; }\n T fact_inv(int n) const { return fact_inv_[n]; }\n\nprivate:\n std::vector<T> fact_, fact_inv_;\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 bool zero = false;\n vector<mint> sum(5);\n vector<int> cnt(5);\n rep(_,0,n) {\n int x;\n cin >> x;\n if (x == 0) {\n zero = true;\n }\n int l = to_string(x).size();\n sum[l] += x;\n ++cnt[l];\n }\n Combination<mint> comb(n);\n vector<mint> pow10(4*n+1, 1);\n rep(i,1,4*n+1) pow10[i] = pow10[i-1] * 10;\n vector<mint> cumperm(n+1);\n rep(i,0,n+1) {\n rep(j,0,i+1) cumperm[i] += comb.perm(i, j);\n }\n\n auto calc = [&]() -> mint {\n if (n == 0) return 0;\n mint ans = 0;\n rep(l,1,5) {\n if (cnt[l] == 0) continue;\n vector<vector<mint>> dp(n, vector<mint>(4*n));\n dp[0][0] = 1;\n rep(k,1,5) {\n int c = cnt[k];\n if (k == l) --c;\n revrep(i,n,0) revrep(j,4*n,0) rep(d,1,c+1) {\n if (i+d >= n || j+k*d >= 4*n) break;\n dp[i+d][j+k*d] += dp[i][j] * comb.comb(c, d);\n }\n }\n rep(i,0,n) rep(j,0,4*n) {\n ans += dp[i][j] * comb.fact(i) * cumperm[n-1-i] * pow10[j] * sum[l];\n }\n }\n return ans;\n };\n\n mint ans = calc();\n if (zero) {\n --n;\n --cnt[1];\n ans -= calc();\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":800,"memory_kb":3988,"score_of_the_acc":-0.433,"final_rank":7},{"submission_id":"aoj_2436_6347583","code_snippet":"#line 2 \"library/bits/stdc++.h\"\n\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#endif\n#line 2 \"Source.cpp\"\nusing namespace std;\n\n#define REP(a, b) for (long long a = 0; a < b; ++a)\n#define ll long long\n#define ld long double\n#define ALL(x) begin(x), end(x)\n\n#line 1 \"library/atcoder/modint.hpp\"\n\n\n\n#include <cassert>\n#line 6 \"library/atcoder/modint.hpp\"\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#line 1 \"library/atcoder/internal_math.hpp\"\n\n\n\n#line 5 \"library/atcoder/internal_math.hpp\"\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 1 \"library/atcoder/internal_type_traits.hpp\"\n\n\n\n#line 7 \"library/atcoder/internal_type_traits.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 14 \"library/atcoder/modint.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 10 \"Source.cpp\"\nusing mint = atcoder::modint1000000007;\n\n#define int long long\nmint dp[300][2000];\n\nint dfs(vector<int> now, int val)\n{\n int ans = val;\n REP(i, now.size())\n {\n int tmp = val * 10 + now[i];\n vector<int> news;\n REP(q, now.size())\n {\n if (i != q)\n news.push_back(now[q]);\n }\n ans += dfs(news, tmp);\n }\n return ans;\n}\n\nmint mergers[1000];\nvoid solve()\n{\n int n;\n cin >> n;\n int cnts[5] = {};\n vector<string> inputs;\n int is_zero = 0;\n REP(i, n)\n {\n string s;\n cin >> s;\n inputs.push_back(s);\n cnts[s.length()]++;\n if (s == \"0\")\n is_zero = true;\n }\n sort(ALL(inputs));\n mint ans = 0;\n REP(t, 1 + is_zero)\n {\n for (int q = 0; q <= n; ++q)\n {\n mint hoge = 0;\n mint now_choose = 1;\n for (int t = 0; t <= n - q - 1; ++t)\n {\n hoge += now_choose;\n now_choose *= (n - q - 1 - t);\n }\n mergers[q] = hoge;\n }\n mint tmps = 0;\n for (int digit = 1; digit <= 4; ++digit)\n {\n if (cnts[digit] == 0)\n continue;\n cnts[digit]--;\n\n REP(q, n + 1)\n {\n REP(j, n * 5)\n {\n dp[q][j] = 0;\n }\n }\n dp[0][0] = 1;\n for (int t = 1; t <= 4; ++t)\n {\n REP(_, cnts[t])\n {\n for (int a = n; a >= 0; --a)\n {\n for (int b = 4 * n; b >= 0; --b)\n {\n dp[a + 1][b + t] += dp[a][b] * (a + 1);\n }\n }\n }\n }\n\n REP(t, inputs.size())\n {\n if (inputs[t].size() == digit)\n {\n for (int q = 0; q <= n; ++q)\n {\n mint multiplier = 1;\n for (int j = 0; j <= 4 * n; ++j)\n {\n tmps += multiplier * mergers[q] * dp[q][j] * stoll(inputs[t]);\n multiplier *= 10;\n }\n }\n }\n }\n\n cnts[digit]++;\n }\n\n if (t == 0)\n {\n ans += tmps;\n }\n if (t == 1)\n {\n ans -= tmps;\n }\n if (inputs.size() != 0 and inputs[0] == \"0\")\n {\n n--;\n inputs.erase(inputs.begin());\n cnts[1]--;\n }\n }\n cout << ans.val() << endl;\n}\n\n#undef int\nint main()\n{\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(100);\n solve();\n}","accuracy":1,"time_ms":1120,"memory_kb":5828,"score_of_the_acc":-0.6214,"final_rank":10},{"submission_id":"aoj_2436_6026793","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <uint64_t Modulus> class modint {\n using i64 = int64_t;\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \"Modulus must be less than 2**31\");\n static constexpr u32 mod = Modulus;\n u32 v;\n\npublic:\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\n constexpr u32& val() noexcept { return v; }\n constexpr const u32& val() const noexcept { return v; }\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 {\n v += rhs.v;\n if (v >= mod) v -= mod;\n return *this;\n }\n constexpr modint& operator-=(const modint& rhs) noexcept {\n if (v < rhs.v) v += mod;\n v -= rhs.v;\n return *this;\n }\n constexpr modint& operator*=(const modint& rhs) noexcept {\n v = (u64)v * rhs.v % mod;\n return *this;\n }\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\n constexpr modint pow(long long n) const noexcept {\n assert(0 <= n);\n modint self(*this), res(1);\n while (n > 0) {\n if (n & 1) res *= self;\n self *= self;\n n >>= 1;\n }\n return res;\n }\n constexpr modint inv() const noexcept {\n assert(*this != 0);\n return pow(mod - 2);\n }\n constexpr modint& operator++() noexcept {\n if (++v == mod) v = 0;\n return *this;\n }\n constexpr modint& operator--() noexcept {\n if (v == 0) v = mod;\n return --v, *this;\n }\n constexpr modint operator++(int) noexcept {\n modint t = *this;\n return ++*this, t;\n }\n constexpr modint operator--(int) noexcept {\n modint t = *this;\n return --*this, t;\n }\n constexpr modint operator-() const noexcept { return modint(mod - v); }\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\n constexpr bool operator!() const noexcept { return !v; }\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\n i64 v;\n rhs = modint{(s >> v, v)};\n return s;\n }\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\n};\n\n/**\n * @brief modint\n * @docs docs/modulo/modint.md\n */\n\ntemplate <typename T> struct Binomial {\n Binomial(int MAX = 0) : n(1), facs(1, T(1)), finvs(1, T(1)), invs(1, T(1)) {\n while (n <= MAX) extend();\n }\n\n T fac(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return facs[i];\n }\n\n T finv(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return finvs[i];\n }\n\n T inv(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return invs[i];\n }\n\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n return fac(n) * finv(n - r);\n }\n\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n return fac(n) * finv(n - r) * finv(r);\n }\n\n T H(int n, int r) {\n if (n < 0 || r < 0) return T(0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n\n T C_naive(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n T res = 1;\n r = std::min(r, n - r);\n for (int i = 1; i <= r; i++) res *= inv(i) * (n--);\n return res;\n }\n\nprivate:\n int n;\n std::vector<T> facs, finvs, invs;\n\n inline void extend() {\n int m = n << 1;\n facs.resize(m);\n finvs.resize(m);\n invs.resize(m);\n for (int i = n; i < m; i++) facs[i] = facs[i - 1] * i;\n finvs[m - 1] = T(1) / facs[m - 1];\n invs[m - 1] = finvs[m - 1] * facs[m - 2];\n for (int i = m - 2; i >= n; i--) {\n finvs[i] = finvs[i + 1] * (i + 1);\n invs[i] = finvs[i] * facs[i - 1];\n }\n n = m;\n }\n};\n\n/**\n * @brief binomial\n * @docs docs/combinatorics/binomial.md\n */\n\nconst long long MOD = 1000000007;\nusing mint = modint<MOD>;\nconst int MAX_N = 205;\nmint dp[MAX_N][MAX_N][MAX_N][2];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n Binomial<mint> BINOM;\n int n;\n cin >> n;\n vector<int> a(n);\n for (int& x : a) cin >> x;\n\n sort(a.rbegin(), a.rend());\n vector<int> len(n);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n len[i] = to_string(a[i]).size();\n sum += len[i];\n }\n vector<mint> power(sum + 1, 1);\n for (int i = 0; i < sum; i++) power[i + 1] = power[i] * 10;\n\n dp[0][0][0][0] = 1;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j <= i; j++) {\n for (int k = 0; j + k <= i; k++) {\n for (int l = 0; l < 2; l++) {\n mint val = dp[i][j][k][l];\n if (val == 0) continue;\n dp[i + 1][j][k][l] += val;\n if (l == 0) dp[i + 1][j][k][1] += val * a[i];\n dp[i + 1][j + 1][k][l] += val;\n dp[i + 1][j][k + 1][l] += val * power[len[i]];\n }\n }\n }\n }\n\n mint ans = 0;\n for (int j = 0; j <= n; j++) {\n for (int k = 0; j + k <= n; k++) {\n ans += dp[n][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\n }\n }\n if (a.back() == 0) {\n for (int j = 0; j <= n; j++) {\n for (int k = 0; j + k <= n; k++) {\n ans -= dp[n - 1][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\n }\n }\n }\n\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":67556,"score_of_the_acc":-0.5032,"final_rank":9},{"submission_id":"aoj_2436_6026792","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\n for (size_t i = 0; i < v.size(); i++) {\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\n for (size_t i = 0; i < N; i++) {\n os << v[i] << (i + 1 == N ? \"\" : \" \");\n }\n return os;\n}\n\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) void(0)\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\nlong long MSK(int n) { return (1LL << n) - 1; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <typename T> void mkuni(vector<T>& v) {\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n}\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\n#pragma endregion\n\n#include <cassert>\n#include <cstdint>\n#include <iostream>\n\ntemplate <uint64_t Modulus> class modint {\n using i64 = int64_t;\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \"Modulus must be less than 2**31\");\n static constexpr u32 mod = Modulus;\n u32 v;\n\npublic:\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\n constexpr u32& val() noexcept { return v; }\n constexpr const u32& val() const noexcept { return v; }\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 {\n v += rhs.v;\n if (v >= mod) v -= mod;\n return *this;\n }\n constexpr modint& operator-=(const modint& rhs) noexcept {\n if (v < rhs.v) v += mod;\n v -= rhs.v;\n return *this;\n }\n constexpr modint& operator*=(const modint& rhs) noexcept {\n v = (u64)v * rhs.v % mod;\n return *this;\n }\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\n constexpr modint pow(long long n) const noexcept {\n assert(0 <= n);\n modint self(*this), res(1);\n while (n > 0) {\n if (n & 1) res *= self;\n self *= self;\n n >>= 1;\n }\n return res;\n }\n constexpr modint inv() const noexcept {\n assert(*this != 0);\n return pow(mod - 2);\n }\n constexpr modint& operator++() noexcept {\n if (++v == mod) v = 0;\n return *this;\n }\n constexpr modint& operator--() noexcept {\n if (v == 0) v = mod;\n return --v, *this;\n }\n constexpr modint operator++(int) noexcept {\n modint t = *this;\n return ++*this, t;\n }\n constexpr modint operator--(int) noexcept {\n modint t = *this;\n return --*this, t;\n }\n constexpr modint operator-() const noexcept { return modint(mod - v); }\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\n constexpr bool operator!() const noexcept { return !v; }\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\n i64 v;\n rhs = modint{(s >> v, v)};\n return s;\n }\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\n};\n\n/**\n * @brief modint\n * @docs docs/modulo/modint.md\n */\n\n#include <cassert>\n#include <vector>\n\ntemplate <typename T> struct Binomial {\n Binomial(int MAX = 0) : n(1), facs(1, T(1)), finvs(1, T(1)), invs(1, T(1)) {\n while (n <= MAX) extend();\n }\n\n T fac(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return facs[i];\n }\n\n T finv(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return finvs[i];\n }\n\n T inv(int i) {\n assert(i >= 0);\n while (n <= i) extend();\n return invs[i];\n }\n\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n return fac(n) * finv(n - r);\n }\n\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n return fac(n) * finv(n - r) * finv(r);\n }\n\n T H(int n, int r) {\n if (n < 0 || r < 0) return T(0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n\n T C_naive(int n, int r) {\n if (n < 0 || n < r || r < 0) return T(0);\n T res = 1;\n r = std::min(r, n - r);\n for (int i = 1; i <= r; i++) res *= inv(i) * (n--);\n return res;\n }\n\nprivate:\n int n;\n std::vector<T> facs, finvs, invs;\n\n inline void extend() {\n int m = n << 1;\n facs.resize(m);\n finvs.resize(m);\n invs.resize(m);\n for (int i = n; i < m; i++) facs[i] = facs[i - 1] * i;\n finvs[m - 1] = T(1) / facs[m - 1];\n invs[m - 1] = finvs[m - 1] * facs[m - 2];\n for (int i = m - 2; i >= n; i--) {\n finvs[i] = finvs[i + 1] * (i + 1);\n invs[i] = finvs[i] * facs[i - 1];\n }\n n = m;\n }\n};\n\n/**\n * @brief binomial\n * @docs docs/combinatorics/binomial.md\n */\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nusing mint = modint<MOD>;\nconst int MAX_N = 205;\nmint dp[MAX_N][MAX_N][MAX_N][2];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n Binomial<mint> BINOM;\n int n;\n cin >> n;\n vector<int> a(n);\n for (int& x : a) cin >> x;\n\n sort(a.rbegin(), a.rend());\n vector<int> len(n);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n len[i] = to_string(a[i]).size();\n sum += len[i];\n }\n vector<mint> power(sum + 1, 1);\n for (int i = 0; i < sum; i++) power[i + 1] = power[i] * 10;\n\n // vector<vector<mint>> left(n + 1, vector<mint>(n + 1, 0)), right(n + 1, vector<mint>(n + 1, 0));\n // left[0][0] = right[n][0] = 1;\n // for (int i = 0; i < n; i++) {\n // for (int j = 0; j <= sum; j++) {\n // mint val = left[i][j];\n // if (val == 0) continue;\n // left[i + 1][j] += val * 2;\n // left[i + 1][j + 1] += val * power[len[i]];\n // }\n // }\n // for (int i = n - 1; i >= 0; i--) {\n // for (int j = 0; j <= sum; j++) {\n // mint val = right[i + 1][j];\n // if (val == 0) continue;\n // right[i][j] += val * 2;\n // right[i][j + 1] += val * power[len[i]];\n // }\n // }\n\n // mint ans = 0;\n // for (int i = 0; i < n; i++) {\n // for (int j = 0; j <= i; j++) {\n // if (left[i][j] == 0) continue;\n // for (int k = 0; k <= n - 1 - i; k++) {\n // ans += left[i][j] * right[i + 1][k] * a[i]*BINOM.P(j+k)*BINOM.P(N)\n // }\n // }\n // }\n\n dp[0][0][0][0] = 1;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j <= i; j++) {\n for (int k = 0; j + k <= i; k++) {\n for (int l = 0; l < 2; l++) {\n mint val = dp[i][j][k][l];\n if (val == 0) continue;\n dp[i + 1][j][k][l] += val;\n if (l == 0) dp[i + 1][j][k][1] += val * a[i];\n dp[i + 1][j + 1][k][l] += val;\n dp[i + 1][j][k + 1][l] += val * power[len[i]];\n }\n }\n }\n }\n mint ans = 0;\n for (int j = 0; j <= n; j++) {\n for (int k = 0; j + k <= n; k++) {\n ans += dp[n][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\n }\n }\n if (a.back() == 0) {\n for (int j = 0; j <= n; j++) {\n for (int k = 0; j + k <= n; k++) {\n ans -= dp[n - 1][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\n }\n }\n }\n\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":67436,"score_of_the_acc":-0.5023,"final_rank":8},{"submission_id":"aoj_2436_6020618","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#include<ext/pb_ds/assoc_container.hpp>\nusing namespace __gnu_pbds;\n\ntemplate<class T>\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag,\ntree_order_statistics_node_update>;\n// usage:\n// ordered_set::find_by_order (access)\n// ordered_set::order_of_key (lower_bound)\n\ntemplate<class K, class V>\nusing hashmap = gp_hash_table<K, V>;\n\n#define REP(i, n) for (int i = 0; i < int(n); ++i)\n#define ALL(x) begin(x), end(x)\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl\n//#define ASSERT(x) while (!(x)) {}\n#define ASSERT(x) assert(x)\n\nstruct fast_ios {\n fast_ios() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n };\n} fast_ios_;\n\nusing ll = long long;\n\ntemplate <class T> bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T> bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T> ostream& operator<<(ostream& os, const vector<T>& v);\ntemplate <class T, class U>\nostream& operator<<(ostream& os, const pair<T, U>& p);\ntemplate <class T, class U>\nostream& operator<<(ostream& os, const map<T, U>& mp);\n\ntemplate <class T> ostream& operator<<(ostream& os, const vector<T>& v) {\n os << '[';\n REP(i, v.size()) {\n if (i) os << ',';\n os << v[i];\n }\n return os << ']';\n}\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> ostream& operator<<(ostream& os, const set<T>& st) {\n os << '{';\n int a = 0;\n for (const auto& e : st) {\n if (a) os << ' ';\n a = 1;\n os << e;\n }\n return os << '}';\n}\n\ntemplate <class T, class U>\nostream& operator<<(ostream& os, const map<T, U>& mp) {\n os << '{';\n int a = 0;\n for (const auto& p : mp) {\n if (a) os << ' ';\n a = 1;\n os << p;\n }\n return os << '}';\n}\n\nconst int INF = numeric_limits<int>::max();\nconst ll LINF = numeric_limits<ll>::max();\n\n\ntemplate<typename T>\nstruct Combination {\n std::vector<T> _fact, _rfact, _inv;\n\n explicit 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\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n#include <utility>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n unsigned int umod() const { return _m; }\n\n unsigned int mul(unsigned int a, unsigned int b) const {\n\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int n; cin >> n;\n vector<int> a(n);\n vector<int> len(n);\n REP(i, n) {\n string s; cin >> s;\n len[i] = s.size();\n a[i] = stoi(s);\n }\n\n\n int len_sum = accumulate(ALL(len), 0);\n\n int total_zero = 0;\n REP(i, n) total_zero += (a[i] == 0);\n\n using mint = modint1000000007;\n using vi = vector<mint>;\n using vvi = vector<vi>;\n using vvvi = vector<vvi>;\n\n mint ans = 0;\n\n Combination<mint> comb(n+1);\n\n REP(i, n) {\n vvvi dp(n+1, vvi(n, vi(total_zero+1)));\n dp[0][0][0] = 1;\n REP(j, n) {\n if (j == i) {\n dp[j+1] = dp[j];\n continue;\n }\n\n REP(k, n) {\n // k := 選んだ個数\n REP(l, total_zero+1) {\n // l := 選んだ 0 の個数\n\n // 使わない\n dp[j+1][k][l] += dp[j][k][l];\n // 使う\n if (k+1 < n and l + (a[j] == 0) <= total_zero) {\n dp[j+1][k+1][l + (a[j] == 0)] += dp[j][k][l] * mint(10).pow(len[j]);\n }\n }\n }\n }\n\n mint total = 0;\n REP(k, n) {\n // k := 選んだ個数\n\n mint tmp = 0;\n\n for (int l = 1; l <= n-1-k; l++) {\n tmp += comb.P(n-1-k, l);\n }\n\n REP(l, total_zero+1) {\n // l := 選んだ 0 の個数\n\n if (dp[n][k][l].val() == 0) continue;\n\n if (n-1-k == 0) {\n total += dp[n][k][l] * comb.fact(k);\n } else {\n mint ratio = 1 + tmp * (n - 1 - k - (total_zero - (a[i] == 0) - l)) / (n - 1 - k);\n total += dp[n][k][l] * ratio * comb.fact(k);\n }\n }\n }\n\n ans += total * a[i];\n }\n\n cout << ans.val() << endl;\n};","accuracy":1,"time_ms":320,"memory_kb":5612,"score_of_the_acc":-0.1849,"final_rank":4},{"submission_id":"aoj_2436_6018234","code_snippet":"#include<bits/stdc++.h> \nusing namespace std;\nusing ll=long long int;\n//using Int=__int128;\n#define ALL(A) A.begin(),A.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;}\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\n//→ ↓ ← ↑ \nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\n//右上から時計回り\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\nlong double EPS = 1e-6;\nlong double PI = acos(-1);\nconst ll INF=(1LL<<62);\nconst int MAX=(1<<30);\nconstexpr ll MOD=1000000000+7;\n//constexpr ll MOD=998244353;\n\n\ninline void bin101(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n}\n\nusing pii=pair<int,int>;\nusing pil=pair<int,ll>;\nusing pli=pair<ll,int>;\nusing pll=pair<ll,ll>;\nusing psi=pair<string,int>;\nusing pis=pair<int,string>;\nusing psl=pair<string,ll>;\nusing pls=pair<ll,string>;\nusing pss=pair<string,string>;\n\nusing Graph=vector<vector<int>>;\n\ntemplate<typename T >\nstruct edge {\n\tint to;\n\tT cost;\n\tedge()=default;\n\tedge(int to, T cost) : to(to), cost(cost) {}\n\n};\ntemplate<typename T>\nusing WeightGraph=vector<vector<edge<T>>>;\n\ntemplate<typename T>\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n T cost;\n cin>>s>>t>>cost;\n if(index1) s--,t--;\n g[s].emplace_back(t,cost);\n if(not directed) g[t].emplace_back(s,cost);\n }\n}\n\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n cin>>s>>t;\n if(index1) s--,t--;\n g[s].push_back(t);\n if(not directed) g[t].push_back(s);\n }\n}\n\n\n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<T> &v) {\n for(size_t i=0;i<v.size();i++) is>>v[i];\n\treturn is;\n}\n \n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n is>>v[i];\n }\n return is;\n}\n//vector cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\n for(size_t i=0;i<v.size();i++){\n if(i) os<<\" \";\n os<<v[i];\n }\n return os;\n}\n//vector<vector> cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n os<<v[i];\n if(i+1!=v.size()) os<<\"\\n\";\n }\n return os;\n}\n\n//Graph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const Graph &g) {\n for(size_t i=0;i<g.size();i++){\n for(int to:g[i]){\n os<<i<<\"->\"<<to<<\" \";\n }\n os<<endl;\n }\n return os;\n}\n\n//WeightGraph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\n for(size_t i=0;i<g.size();i++){\n for(auto e:g[i]){\n os<<i<<\"->\"<<e.to<<\"(\"<<e.cost<<\") \";\n }\n os<<endl;\n }\n return os;\n}\n\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n\treturn vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n\tauto v=vmake(args...);\n\treturn vector<decltype(v)>(n,move(v));\n}\ntemplate<typename V,typename T>\nvoid fill(V &v,const T value){\n v=value;\n}\n\ntemplate<typename V,typename T>\nvoid fill(vector<V> &vec,const T value){\n for(auto &v:vec) fill(v,value);\n}\n\n//pair cout\ntemplate<typename T, typename U>\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\n\tos<<p.first<<\" \"<<p.second;\n\treturn os;\n}\n \n//pair cin\ntemplate<typename T, typename U>\ninline istream &operator>>(istream &is,pair<T,U> &p) {\n\tis>>p.first>>p.second;\n\treturn is;\n}\n \n//ソート\ntemplate<typename T>\ninline void vsort(vector<T> &v){\n sort(v.begin(),v.end());\n}\n \n//逆順ソート\ntemplate<typename T>\ninline void rvsort(vector<T> &v){\n\tsort(v.rbegin(),v.rend());\n}\n\n//1ビットの数を返す\ninline int popcount(int x){\n\treturn __builtin_popcount(x);\n}\n//1ビットの数を返す\ninline int popcount(ll x){\n\treturn __builtin_popcountll(x);\n}\ntemplate<typename T>\ninline void Compress(vector<T> &C){\n sort(C.begin(),C.end());\n C.erase(unique(C.begin(),C.end()),C.end());\n}\ntemplate<typename T>\ninline int lower_idx(const vector<T> &C,T value){\n return lower_bound(C.begin(),C.end(),value)-C.begin();\n}\ntemplate<typename T>\ninline int upper_idx(const vector<T> &C,T value){\n return upper_bound(C.begin(),C.end(),value)-C.begin();\n}\n//時計回りに90度回転\ntemplate<typename T>\ninline void rotate90(vector<vector<T>> &C){\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\n for(int h=0;h<C.size();h++){\n for(int w=0;w<C[h].size();w++){\n D[w][C.size()-1-h]=C[h][w];\n }\n }\n C=D;\n}\n//補グラフを返す\n//i→iのような辺は加えない\nGraph ComplementGraph(const Graph &g){\n size_t sz=g.size();\n bool used[sz][sz];\n fill(used[0],used[sz],false);\n for(size_t i=0;i<sz;i++){\n for(int to:g[i]){\n used[i][to]=true;\n }\n }\n Graph ret(sz);\n for(size_t i=0;i<sz;i++){\n for(size_t j=0;j<sz;j++){\n if(used[i][j]) continue;\n if(i==j) continue;\n ret[i].push_back(j);\n }\n }\n return ret;\n}\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\n//無効グラフのみに対応\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\n vector<Graph> ret;\n vector<int> now;\n for(size_t i=0;i<g.size();i++){\n if(id[i].first!=-1) continue;\n id[i].first=ret.size();\n id[i].second=0;\n now.push_back(i);\n for(size_t j=0;j<now.size();j++){\n for(int to:g[now[j]]){\n if(id[to].first==-1){\n id[to].first=ret.size();\n id[to].second=now.size();\n now.push_back(to);\n }\n }\n }\n Graph r(now.size());\n for(size_t j=0;j<now.size();j++){\n r[j]=g[now[j]];\n for(int &to:r[j]){\n to=id[to].second;\n }\n }\n ret.push_back(r);\n now.clear();\n }\n return make_pair(ret,id);\n}\n//0indexを想定\nbool OutGrid(ll h,ll w,ll H,ll W){\n return (h>=H or w>=W or h<0 or w<0);\n}\n\nvoid NO(){\n cout<<\"NO\"<<\"\\n\";\n}\nvoid YES(){\n cout<<\"YES\"<<\"\\n\";\n}\nvoid No(){\n cout<<\"No\"<<\"\\n\";\n}\nvoid Yes(){\n cout<<\"Yes\"<<\"\\n\";\n}\nnamespace overflow{\n template<typename T>\n T max(){\n return numeric_limits<T>::max();\n }\n template<typename T>\n T ADD(T a,T b){\n T res;\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\n }\n template<typename T>\n T MUL(T a,T b){\n T res;\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\n }\n};\nusing namespace overflow;\nstruct ModInt{\n using u64=uint_fast64_t;\n u64 a;\n constexpr ModInt() :a(0){}\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\n\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\n return ModInt(*this)+=rhs;\n }\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\n return ModInt(*this)-=rhs;\n }\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\n return ModInt(*this)*=rhs;\n }\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\n return ModInt(*this)/=rhs;\n }\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\n return ModInt(*this)+=ModInt(rhs);\n }\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\n return ModInt(*this)-=ModInt(rhs);\n }\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\n return ModInt(*this)*=ModInt(rhs);\n }\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\n return ModInt(*this)/=ModInt(rhs);\n }\n\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\n a+=rhs.a;\n if(a>=MOD) a-=MOD;\n return *this;\n }\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\n if(rhs.a>a) a+=MOD;\n a-=rhs.a;\n return *this;\n }\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\n a=(a*rhs.a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\n a=(a*rhs.inverse().a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\n return *this+=ModInt(rhs);\n }\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\n return *this-=ModInt(rhs);\n }\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\n return *this*=ModInt(rhs);\n }\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\n return *this/=ModInt(rhs);\n }\n\n inline constexpr ModInt operator=(const ll x)noexcept{\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\n return *this;\n }\n\n inline constexpr bool operator==(const ModInt p)const noexcept{\n return a==p.a;\n }\n\n inline constexpr bool operator!=(const ModInt p)const noexcept{\n return a!=p.a;\n }\n\n inline constexpr ModInt pow(ll N) const noexcept{\n ModInt ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline constexpr ModInt inverse() const noexcept{\n return pow(MOD-2);\n }\n\n};\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)+=b;\n}\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)-=b;\n}\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)*=b;\n}\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const ModInt &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,ModInt &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\n\nstruct Binominal{\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\n int sz;\n Binominal(int n=10) :sz(1){\n if(n<=0) n=10;\n init(n);\n }\n inline void init(int n){\n fac.resize(n+1,1);\n finv.resize(n+1,1);\n inv.resize(n+1,1);\n for(int i=sz+1;i<=n;i++){\n fac[i]=fac[i-1]*i;\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\n finv[i]=finv[i-1]*inv[i];\n }\n sz=n;\n }\n //nCk(n,k<=N) をO(1)で求める\n inline ModInt com(int n,int k){\n if(n<k) return ModInt(0);\n if(n<0 || k<0) return ModInt(0);\n if(n>sz) init(n);\n return fac[n]*finv[k]*finv[n-k];\n }\n //nCk(k<=N) をO(k) で求める \n inline ModInt rcom(ll n,int k){\n if(n<0 || k<0 || n<k) return ModInt(0);\n if(k>sz) init(k);\n ModInt ret(1);\n for(int i=0;i<k;i++){\n ret*=n-i;\n }\n ret*=finv[k];\n return ret;\n }\n\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\n //〇がn個,|がk個\n inline ModInt h(int n,int k){\n return com(n+k-1,k);\n }\n};\nvector<int> Subset(int S,bool zero=false,bool full=false){\n vector<int> ret;\n int now=(S-1)&S;\n if(full and S){\n ret.push_back(S);\n }\n do{\n ret.push_back(now);\n now=(now-1)&S;\n }while(now!=0);\n if(zero){\n ret.push_back(0);\n }\n return ret;\n}\ntemplate<typename T>\nT SUM(const vector<T> &v,int s,int t){\n chmax(s,0);\n chmin(t,int(v.size())-1);\n if(s>t) return 0;\n if(s==0) return v[t];\n else return v[t]-v[s-1];\n}\ntemplate<typename T>\nvoid buildSUM(vector<T> &v){\n for(size_t i=1;i<v.size();i++){\n v[i]+=v[i-1];\n }\n return;\n}\n\n\nvoid solve(){\n int N; cin>>N;\n vector<ModInt> a(N); cin>>a;\n vector<int> sz(N);\n int zero=0;\n for(int i=0;i<N;i++){\n if(a[i]==0){\n zero++;\n break;\n }\n }\n for(int i=0;i<N;i++){\n sz[i]=to_string(a[i].a).size();\n }\n Binominal B(100000);\n vector<ModInt> ten(1e6);\n ten[0]=1;\n for(int i=1;i<ten.size();i++) ten[i]=ten[i-1]*10;\n auto A=vmake(N+1,2,ModInt());\n for(int i=0;i<=N;i++){\n for(int j=0;j<=i;j++){\n A[i][0]+=B.com(i,j)*B.fac[j];\n }\n for(int j=0;j<i;j++){\n auto x=B.com(i-1,j)*B.fac[j];\n A[i][1]+=(x)*(1+j);\n }\n }\n ModInt ans;\n map<pii,ModInt> M;\n for(int i=0;i<N;i++){\n if(M.count(pii(sz[i],a[i]==0))){\n continue;\n }\n pii id=pii(sz[i],a[i]==0);\n //j k used\n //i 桁数 個数 ゼロを使ったか:何個か\n auto dp=vmake(2,(N+1)*5,N+1,2,ModInt());\n dp[0][0][0][0]=1;\n for(int j=0;j<N;j++){\n int J=j%2;\n //cerr<<\" \"<<j<<endl;\n fill(dp[1-J],0);\n for(int k=0;k<(N+1)*5;k++){\n for(int used=0;used<=j;used++){\n for(int z=0;z<2;z++){\n //cerr<<J<<endl;\n if(dp[J][k][used][z].a==0) continue;\n\n if(j!=i){\n dp[1-J][k+sz[j]][used+1][(a[j]==0)|z]+=dp[J][k][used][z];\n }\n dp[1-J][k][used][z]+=dp[J][k][used][z];\n }\n }\n }\n }\n for(int k=0;k<(N+1)*5;k++){\n for(int used=0;used<=N;used++){\n for(int z=0;z<2;z++){\n auto x=dp[N%2][k][used][z]*ten[k];\n if(x.a==0) continue;\n int nokori=N-1-used;\n if(zero and z==0){\n M[id]+=x*A[nokori][1]*B.fac[used];\n }else{\n M[id]+=x*A[nokori][0]*B.fac[used];\n }\n }\n }\n }\n }\n for(int i=0;i<N;i++){\n ans+=a[i]*M[pii(sz[i],a[i]==0)];\n }\n cout<<ans<<endl;\n}\n\nint main(){\n bin101();\n int T=1;\n //cin>>T;\n while(T--) solve();\n}","accuracy":1,"time_ms":920,"memory_kb":46356,"score_of_the_acc":-0.8312,"final_rank":11},{"submission_id":"aoj_2436_5997933","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <int mod = (int)(1e9 + 7)>\nstruct ModInt {\n int x;\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n ModInt &operator+=(const ModInt &p) {\n if ((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if ((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n ModInt pow(int64_t n) const {\n ModInt res(1), mul(x);\n while (n) {\n if (n & 1) res *= mul;\n mul *= mul;\n n >>= 1;\n }\n return res;\n }\n friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n static int get_mod() { return mod; }\n};\n\nstruct Combination {\n vector<ModInt<>> _fact, _rfact, _inv;\n Combination(long long nsize = 5000000)\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[nsize] /= _fact[nsize];\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n inline ModInt<> fact(int k) const { return _fact[k]; }\n\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\n\n inline ModInt<> inv(int k) const { return _inv[k]; }\n\n ModInt<> P(int n, int r) const {\n if (r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n\n ModInt<> C(int p, int q) const {\n if (q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n\n ModInt<> largeC(long long p, long long q) const {\n if (q < 0 || p < q) return 0;\n if (q >= (long long)_fact.size()) q = p - q;\n // if (q >= (long long)5000) q = p - q;\n ModInt<> res = rfact(q);\n for (int i = 0; i < q; ++i) res *= p - i;\n return res;\n }\n\n // n types,choose r\n ModInt<> H(int n, int r) const {\n if (n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n\n ModInt<> largeH(long long n, long long r) const {\n if (n < 0 || r < 0) return (0);\n return r == 0 ? 1 : largeC(n + r - 1, r);\n }\n\n ModInt<> Catalan(int n) {\n // C(2n,n) / (n + 1)\n return fact(2 * n) * rfact(n + 1) * rfact(n);\n }\n};\nusing mint = ModInt<>;\n\nint n, zero = 0;\nvector<int> cnt(5, 0), sum(5, 0);\nvector<mint> ten, perm;\nCombination com;\n\nmint solve();\nmint calc();\n\nint main() {\n cin >> n;\n for (int i = 0; i < n; ++i) {\n int a;\n cin >> a;\n int len = to_string(a).size();\n ++cnt[len];\n sum[len] += a;\n zero |= !a;\n }\n cout << solve() << endl;\n return 0;\n}\n\nmint solve() {\n {\n for (int i = 0; i <= n; ++i) {\n mint now = 0;\n for (int j = 0; j <= i; ++j) now += com.P(i, j);\n perm.push_back(now);\n }\n ten.assign(1, 1);\n for (int i = 0; i < 3000000; ++i) ten.push_back(ten.back() * 10);\n }\n mint res = calc();\n if (zero) {\n --n, --cnt[1];\n res -= calc();\n }\n return res;\n}\n\nmint calc() {\n mint res = 0;\n for (int dig = 1; dig <= 4; ++dig)\n if (cnt[dig]) {\n vector<vector<mint>> dp(n + 1, vector<mint>(4 * n + 1, 0));\n --cnt[dig];\n dp[0][0] = 1;\n for (int nd = 1; nd <= 4; ++nd)\n for (int i = n; i >= 0; --i)\n for (int j = 4 * n; j >= 0; --j)\n for (int k = 1; k <= cnt[nd] && i + k <= n && j + k * nd <= 4 * n;\n ++k)\n dp[i + k][j + k * nd] += dp[i][j] * com.C(cnt[nd], k);\n for (int i = 0; i < n; ++i)\n for (int j = 0; j <= 4 * n; ++j)\n res += perm[n - 1 - i] * sum[dig] * dp[i][j] * ten[j] * com.fact(i);\n ++cnt[dig];\n }\n return res;\n}","accuracy":1,"time_ms":920,"memory_kb":80036,"score_of_the_acc":-1.0959,"final_rank":16},{"submission_id":"aoj_2436_5897356","code_snippet":"#pragma GCC target(\"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()\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-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n 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/all>\n//using namespace atcoder;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\ntemplate <int mod> struct 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 mint = ModInt<mod>;\n\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\n\nvoid comInit(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(ll i=2; i<MAX; i++){\n fac[i] = fac[i-1]*i % mod;\n inv[i] = mod - inv[mod%i] * (mod/i) % mod;\n finv[i] = finv[i-1] * inv[i] % mod;\n }\n}\n\n\nll com(ll n, ll k){\n if(n < k) return 0;\n if(n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n-k] % mod) % mod;\n}\n\nmint dp[202][202];\nmint ep[202][202];\nmint mul[202];\nmint p[10];\n\nint main(){\n int n; cin >> n;\n vl a(n); rep(i,n) cin >> a[i];\n comInit();\n sort(all(a));\n int zero = 0;\n dp[0][0] = ep[n][0] = 1;\n p[0] = 1;\n rep(i,8) p[i+1] = p[i] * 10;\n rep(i,n+1) rep(j,i+1) mul[i] += com(i,j) * fac[j] % mod;\n rep(i,n){\n int sz = to_string(a[i]).size();\n rep(j,n+1){\n dp[i+1][j] += dp[i][j];\n if(a[i] != 0) dp[i+1][j+1] += dp[i][j] * p[sz];\n }\n }\n for(int i=n-1; i>=0; i--){\n int sz = to_string(a[i]).size();\n rep(j,n+1){\n ep[i][j] += ep[i+1][j];\n ep[i][j+1] += ep[i+1][j] * p[sz];\n }\n }\n mint ans = 0, mi = 0;\n rep(i,n){\n if(a[i] == 0){\n zero++;\n continue;\n }\n rep(j,n+1) rep(k,n-j){\n mint r1 = dp[i][j] * ep[i+1][k] * 10 * fac[j+k+1];\n mint r2 = dp[i][j] * ep[i+1][k] * fac[j+k]; \n if(zero){\n if(n-j-k-2>=0) ans += r1 * mul[n-j-k-2] * a[i];\n }\n ans += r2 * mul[n-j-k-1] * a[i];\n if(n-j-k-2>=0 && zero) mi += r2 * mul[n-j-k-2] * a[i];\n }\n }\n cout << ans - mi << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":15188,"score_of_the_acc":-0.1243,"final_rank":1},{"submission_id":"aoj_2436_5865657","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.09 18:00:06 */\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\n#pragma region modint\n\nconst int mod = mod_1000000007;\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\tModInt() : x(0) {}\n\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\tModInt &operator+=(const ModInt &p) {\n\t\tif((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator-=(const ModInt &p) {\n\t\tif((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\tModInt &operator*=(const ModInt &p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\tModInt &operator/=(const ModInt &p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\tModInt operator-() const { return ModInt(-x); }\n\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n\tbool operator==(const ModInt &p) const { return x == p.x; }\n\tbool operator!=(const ModInt &p) const { return x != p.x; }\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile(b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\tModInt pow(long long n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile(n > 0) {\n\t\t\tif(n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\n\tfriend istream &operator>>(istream &is, ModInt &a) {\n\t\tlong long t;\n\t\tis >> t;\n\t\ta = ModInt<mod>(t);\n\t\treturn (is);\n\t}\n\tstatic int get_mod() { return mod; }\n};\nusing mint = ModInt<mod>;\n\n#pragma endregion\n\n#pragma region binomial_coefficient\n\n// normal binomial coefficient\nvector<vector<long long>> binom_memo(100, vector<long long>(100, -1));\nlong long binom(int n, int k) {\n\tassert(n < 100 && k < 100);\n\tif(n < k || k < 0 || n < 0) return 0;\n\tif(binom_memo[n][k] != -1) return binom_memo[n][k];\n\tlong long res;\n\tif(n - k < k)\n\t\tres = binom(n, n - k);\n\telse if(k == 0)\n\t\tres = 1;\n\telse\n\t\tres = binom(n - 1, k - 1) + binom(n - 1, k);\n\tbinom_memo[n][k] = res;\n\treturn res;\n}\n\nvector<long long> fac, finv, inv;\nstruct mod_factorial {\n\tconst int MAX;\t// time: 300ms, when MAX = 3*10^7, time: 1900ms\n\tmod_factorial(const int MAX_ = 5100000) : MAX(MAX_) {\n\t\tfac.resize(MAX), finv.resize(MAX), inv.resize(MAX);\n\t\tfac[0] = fac[1] = 1;\n\t\tfinv[0] = finv[1] = 1;\n\t\tinv[1] = 1;\n\t\tfor(int i = 2; i < MAX; i++) {\n\t\t\tfac[i] = fac[i - 1] * i % mod;\n\t\t\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\n\t\t\tfinv[i] = finv[i - 1] * inv[i] % mod;\n\t\t}\n\t}\n} mod_factorial_;\n\nlong long com_mod(long long n, long long k) {\n\tif(n < k || n < 0 || k < 0) return 0;\n\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\n}\n\nlong long permutation_mod(long long n, long long k) {\n\tif(n < k || n < 0 || k < 0) return 0;\n\treturn fac[n] * finv[n - k] % mod;\n}\n\n// patterns of n of undistinguished balls in k of distinguished boxes\nlong long multi_choose_mod(long long n, long long k) { return com_mod(n + k - 1, n); }\n\n#pragma endregion\n\nmint calc(int n, vector<int> a) {\n\tconst int len_max = 812;\n\tconst int use_max = n + 1;\n\tconst int dig_max = 5;\n\tvector<int> len_cnt(dig_max);\n\trep(i, n) { len_cnt[int((to_string(a[i])).size())]++; }\n\n\tdebug(len_cnt);\n\n\tVVV<mint> dp(dig_max, VV<mint>(use_max, V<mint>(len_max, mint(0))));\n\n\trep(i, 1, dig_max) {\n\t\tif(len_cnt[i] == 0) continue;\n\t\tlen_cnt[i]--;\n\n\t\tauto &tmp = dp[i];\n\t\ttmp[0][0] = 1;\n\n\t\trep(j, 1, dig_max) {\n\t\t\tdrep(k, use_max) drep(l, len_max) {\n\t\t\t\tif(!tmp[k][l].x) continue;\n\n\t\t\t\t// debug(i, j, k, l, tmp[k][l]);\n\t\t\t\trep(use_this_dig, 1, len_cnt[j] + 1) {\n\t\t\t\t\tint use_after = k + use_this_dig;\n\t\t\t\t\tint len_after = l + use_this_dig * j;\n\t\t\t\t\tif(len_after >= len_max || use_after >= use_max) continue;\n\t\t\t\t\t// debug(j, k, l, use_this_dig);\n\t\t\t\t\ttmp[use_after][len_after] += tmp[k][l] * com_mod(k + use_this_dig, k) * permutation_mod(len_cnt[j], use_this_dig);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tlen_cnt[i]++;\n\t}\n\tmint ret;\n\n\tVV<mint> table(len_max + 10, V<mint>(len_max + 10)); // permute j out of i\n\trep(i, len_max + 10) rep(j, i + 1) {\n\t\ttable[i][j] = 1;\n\t\tif(i && j) table[i][j] += table[i - 1][j - 1] * j;\n\t}\n\n\tV<mint> pw10(len_max + 10, 1);\n\trep(i, len_max + 9) pw10[i + 1] = pw10[i] * 10;\n\tV<mint> pw2(len_max + 10, 1);\n\trep(i, len_max + 9) pw2[i + 1] = pw2[i] * 2;\n\n\trep(i, n) {\n\t\tmint add = 0;\n\t\tint len = int((to_string(a[i])).size());\n\n\t\tauto &tmp = dp[len];\n\n\t\trep(j, use_max) rep(k, len_max) {\n\t\t\tif(1 + j > n) break;\n\t\t\tif(!tmp[j][k].x) continue;\n\t\t\tadd += pw10[k] * tmp[j][k] * table[n - 1 - j][n - 1 - j];\n\n\t\t\tdebug(n, i, j, k);\n\t\t\tdebug(tmp[j][k], table[n - 1 - j][n - 1 - j]);\n\t\t}\n\n\t\tdebug(i, a[i], add);\n\t\tret += add * a[i];\n\t}\n\n\treturn ret;\n}\n\nmint solve(int n, vector<int> a) {\n\tsort(all(a));\n\tmint ret = calc(n, a);\n\n\tif(a[0] == 0) {\n\t\tif(!n) return 0;\n\t\ta.erase(a.begin());\n\t\tdebug(ret);\n\t\tret -= calc(n - 1, a);\n\t\tdebug(calc(n - 1, a));\n\t}\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 n;\n\twhile(cin >> n && n) {\n\t\tvi a(n);\n\t\trep(i, n) cin >> a[i];\n\t\tcout << solve(n, a) << dl;\n\t}\n}","accuracy":1,"time_ms":190,"memory_kb":128716,"score_of_the_acc":-1.0817,"final_rank":15},{"submission_id":"aoj_2436_5721917","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\nusing ll = long long;\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; }\nconst ll mod = 1000000007;\nconst int fact_size = 1000000;\n\nint n, m;\nll dp[202][1111][2], G[1111], ten[1111];\nll fact[fact_size], inv[fact_size], factinv[fact_size];\n\n\nlong long ext_gcd(long long a, long long b, long long& x, long long& y) {\n if(b==0){ x=1; y=0; return a; }\n long long q = a/b;\n long long d = ext_gcd(b, a-q*b, x, y);\n long long z = x - q*y;\n x = y; y = z;\n return d;\n}\n\nlong long invmod(long long a, long long p) {\n long long x, y;\n ext_gcd(a, p, x, y);\n x %= p;\n if (x < 0) x+=p;\n return x;\n}\n\nlong long modpow(long long a, long long n, long long p) {\n if (n==0) return 1LL;\n if (n&1) return modpow(a, n-1, p) * a % p;\n long long tmp = modpow(a, n/2, p);\n return tmp * tmp % p;\n}\n\nvoid fact_init() {\n fact[0] = fact[1] = 1;\n for(int i=2; i<fact_size; ++i) fact[i] = fact[i-1] * i % mod;\n factinv[fact_size-1] = modpow(fact[fact_size-1], mod-2, mod);\n for(int i=fact_size-2; i>=0; --i) factinv[i] = factinv[i+1] * (i+1) % mod;\n}\n\nll comb(int n, int k) {\n if (k<0 || k>n) return 0;\n return fact[n] * factinv[k] % mod * factinv[n-k] % mod;\n}\n\nll nPk(int n, int k) {\n if (k<0 || k>n) return 0;\n return fact[n] * factinv[n-k] % mod;\n}\n\n\nvoid add(int a) {\n int len = to_string(a).size();\n for(int i=n; i>0; --i) {\n for(int j=len; j<=m; ++j) {\n for(int k=0; k<2; ++k) {\n int nk = k;\n if (a==0) nk = 1;\n dp[i][j][nk] += dp[i-1][j-len][k];\n dp[i][j][nk] %= mod;\n }\n }\n }\n}\n\nvoid sub(int a) {\n int len = to_string(a).size();\n for(int i=1; i<=n; ++i) {\n for(int j=len; j<=m; ++j) {\n for(int k=0; k<2; ++k) {\n dp[i][j][k] -= dp[i-1][j-len][k];\n if (dp[i][j][k]<0) dp[i][j][k] += mod;\n }\n }\n }\n}\n\nll arange(int n, bool zero) {\n if (n==0) return 1;\n ll res = G[n];\n if (zero) {\n res -= G[n-1];\n if (res < 0) res += mod;\n }\n return res;\n}\n\n\nll solve() {\n cin >> n;\n bool zero = false;\n\n vector<int> A(n);\n for(int i=0; i<n; ++i) {\n cin>>A[i];\n m += to_string(A[i]).size();\n if (A[i]==0) zero = true;\n }\n\n ten[0] = 1;\n for(int i=1; i<=m; ++i) ten[i] = ten[i-1]*10%mod;\n for(int i=0; i<=n; ++i) for(int j=0; j<=i; ++j) G[i] = (G[i] + nPk(i, j)) % mod;\n\n dp[0][0][0] = 1;\n for(int a: A) add(a);\n\n ll ans = 0;\n for(int a: A) {\n if(a==0) continue;\n sub(a);\n\n for(int i=0; i<n; ++i) {\n for(int j=0; j<m; ++j) {\n for(int k=0; k<2; ++k) {\n if(dp[i][j][k] == 0) continue;\n ll val = a * ten[j] % mod;\n val = val * fact[i] % mod;\n val = val * dp[i][j][k] % mod;\n val = val * arange(n-1-i, zero&(k==0)) % mod;\n ans = (ans + val) % mod;\n }\n }\n }\n add(a);\n }\n return ans;\n}\n\nint main() {\n fact_init();\n cout << solve() << endl;\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":24236,"score_of_the_acc":-0.266,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2436_10561821\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst long long mod = 1000000007;\\n\\nint dp[202][202][802];\\n\\nlong long solve(vector<string> S) {\\n\\tif (S.size() == 0) return 0;\\n\\tvector<int> digsum(6, 0);\\n\\tfor (int i = 0; i < S.size(); i++) {\\n\\t\\tdigsum[S[i].size()] += stoi(S[i]);\\n\\t}\\n\\n\\t// init\\n\\tvector<long long> fact(S.size() + 2, 0);\\n\\tvector<long long> pow10(5 * S.size() + 2, 0);\\n\\tvector<vector<long long>> nr(S.size() + 2, vector<long long>(S.size() + 2, 0));\\n\\tfact[0] = 1;\\n\\tpow10[0] = 1;\\n\\tfor (int i = 1; i <= S.size() * 1; i++) fact[i] = (1LL * i * fact[i - 1]) % mod;\\n\\tfor (int i = 1; i <= S.size() * 5; i++) pow10[i] = (10LL * pow10[i - 1]) % mod;\\n\\tnr[0][0] = 1;\\n\\tfor (int i = 0; i < S.size(); i++) {\\n\\t\\tfor (int j = 0; j < S.size(); j++) {\\n\\t\\t\\tnr[i + 1][j + 0] += nr[i][j];\\n\\t\\t\\tnr[i + 1][j + 0] %= mod;\\n\\t\\t\\tnr[i + 1][j + 1] += nr[i][j];\\n\\t\\t\\tnr[i + 1][j + 1] %= mod;\\n\\t\\t}\\n\\t}\\n\\n\\t// brute force\\n\\tlong long ans = 0;\\n\\tfor (int d = 1; d <= 5; d++) {\\n\\t\\tfor (int i = 0; i <= S.size(); i++) {\\n\\t\\t\\tfor (int j = 0; j <= S.size(); j++) {\\n\\t\\t\\t\\tfor (int k = 0; k <= 4 * S.size() + 1; k++) dp[i][j][k] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool flag = false;\\n\\t\\tdp[0][0][0] = 1;\\n\\t\\tfor (int i = 0; i < S.size(); i++) {\\n\\t\\t\\tbool special = ((flag == true || S[i].size() != d) ? true : false);\\n\\t\\t\\tfor (int j = 0; j < S.size(); j++) {\\n\\t\\t\\t\\tfor (int k = 0; k <= S.size() * 4; k++) {\\n\\t\\t\\t\\t\\tif (dp[i][j][k] == 0) continue;\\n\\t\\t\\t\\t\\tdp[i + 1][j][k] += dp[i][j][k];\\n\\t\\t\\t\\t\\tdp[i + 1][j][k] %= mod;\\n\\t\\t\\t\\t\\tif (special == true) {\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k + S[i].size()] += dp[i][j][k];\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j + 1][k + S[i].size()] %= mod;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (special == false) flag = true;\\n\\t\\t}\\n\\n\\t\\t// calculate\\n\\t\\tfor (int i = 0; i <= S.size() - 1; i++) {\\n\\t\\t\\tfor (int j = 0; j <= S.size() * 4 + 1; j++) {\\n\\t\\t\\t\\tfor (int k = i; k <= S.size() - 1; k++) {\\n\\t\\t\\t\\t\\tlong long ways = fact[i] * fact[k - i] % mod;\\n\\t\\t\\t\\t\\tways = ways * dp[S.size()][i][j] % mod;\\n\\t\\t\\t\\t\\tways = ways * nr[S.size() - 1 - i][k - i] % mod;\\n\\t\\t\\t\\t\\tlong long score = pow10[j] * digsum[d] % mod;\\n\\t\\t\\t\\t\\tif (ways * score >= 10000) {\\n\\t\\t\\t\\t\\t\\tways += 1;\\n\\t\\t\\t\\t\\t\\tways -= 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tans += ways * score;\\n\\t\\t\\t\\t\\tans %= mod;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\t// step 1. input\\n\\tint N; cin >> N;\\n\\tvector<string> S1;\\n\\tvector<string> S2;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tstring r; cin >> r;\\n\\t\\tS1.push_back(r);\\n\\t\\tif (r != \\\"0\\\") S2.push_back(r);\\n\\t}\\n\\n\\t// step 2. solve\\n\\tlong long ans = solve(S1);\\n\\tif (S1.size() != S2.size()) ans = (ans - solve(S2) + mod) % mod;\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 130768,\n \"score_of_the_acc\": -1.6033,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2436_10067392\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rep2(i,s,t) for(int i=s;i<t;i++)\\n\\nconst ll mod=1e9+7;\\n\\nll modpow(ll x, ll k, ll m = mod) {\\n ll v = 1;\\n while(k) {\\n if(k & 1) v = v * x % m;\\n x = x * x % m;\\n k >>= 1;\\n }\\n return v;\\n}\\n\\nusing vll=vector<ll>;\\nint len=2000;\\nvll fac, finv;\\nvll TENPOW;\\nvll SUMP;\\n\\nvoid precalc(ll m = mod) {\\n fac.assign(len, 1), finv.assign(len, 1);\\n TENPOW.assign(len,1);\\n\\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\\n SUMP.assign(len,0);\\n rep(z,len)rep(j,z+1){\\n SUMP[z]+=fac[z]*finv[z-j];\\n SUMP[z]%=mod;\\n }\\n}\\n\\nll binom(ll n, ll k, ll m = mod) {\\n if(n < 0 || k < 0 || k > n) return 0;\\n return fac[n] * finv[k] % m * finv[n - k] % m;\\n}\\n\\nll calc(vll A){\\n vll num(4,0);\\n int N=A.size();\\n for(ll a:A){\\n int bs=0;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n num[bs]++;\\n }\\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\\n rep(i,4){\\n if(num[i]==0)continue;\\n num[i]--;\\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\\n F[0][0]=1;\\n rep(j,4){\\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\\n rep(k,num[j]+1){\\n rep(n,N+1-k)rep(m,n*4+1){\\n if(m+(j+1)*k<=4*N&&n+k<=N)\\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\\n NF[n+k][m+(j+1)*k]%=mod;\\n }\\n }\\n swap(F,NF);\\n }\\n DP[i]=F;\\n num[i]++;\\n }\\n ll an=0;\\n for(ll a:A){\\n int bs=0;\\n ll ca=a;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n rep(n,N+1)rep(m,N*4+1){\\n ll res=DP[bs][n][m]*TENPOW[m];\\n res%=mod;\\n res*=ca;\\n res%=mod;\\n res*=fac[n];\\n res%=mod;\\n ll z=(N-n-1);\\n if(z<0)continue;\\n \\n res*=SUMP[z];\\n res%=mod;\\n an+=res;\\n an%=mod;\\n assert(res>=0);\\n\\n }\\n }\\n return an;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n precalc();\\n int N=200;\\n cin>>N;\\n vector<ll> A(N);\\n rep(i,N)cin>>A[i];\\n sort(A.begin(),A.end());\\n reverse(A.begin(),A.end());\\n ll an=calc(A);\\n if(A.back()==0){\\n A.pop_back();\\n an-=calc(A);\\n }\\n an=(an%mod+mod)%mod;\\n cout<<an<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1850,\n \"memory_kb\": 10772,\n \"score_of_the_acc\": -1.057,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2436_10067375\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rep2(i,s,t) for(int i=s;i<t;i++)\\n\\n/*\\n- `len` を指定したうえで `precalc()` でテーブルを前計算．`len <= mod`\\nである必要がある\\n- `binom(n, k)` は `n < len` を満たす必要がある\\n- `mod` が固定のときは `const ll mod = 998244353;` のようにする\\n- `a < len` に対して $O(1)$ で逆元が求められる．\\n*/\\nconst ll mod=1e9+7;\\n\\n// 注意： % m を % mod と書かないように！\\nll modpow(ll x, ll k, ll m = mod) {\\n ll v = 1;\\n while(k) {\\n if(k & 1) v = v * x % m;\\n x = x * x % m;\\n k >>= 1;\\n }\\n return v;\\n}\\n\\nusing vll=vector<ll>;\\nint len=2000;\\nvll fac, finv;\\nvll TENPOW;\\nvll SUMP;\\n\\nvoid precalc(ll m = mod) {\\n fac.assign(len, 1), finv.assign(len, 1);\\n TENPOW.assign(len,1);\\n\\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\\n SUMP.assign(len,0);\\n rep(z,len)rep(j,z+1){\\n SUMP[z]+=fac[z]*finv[z-j];\\n SUMP[z]%=mod;\\n }\\n}\\n\\nll binom(ll n, ll k, ll m = mod) {\\n if(n < 0 || k < 0 || k > n) return 0;\\n // assert(n < len);\\n return fac[n] * finv[k] % m * finv[n - k] % m;\\n}\\n\\nll inv(ll a, ll m = mod) {\\n // a = (a % m + m) % m; // 必要なら\\n if(a < len) return fac[a - 1] * finv[a] % m;\\n return modpow(a, m - 2, m);\\n}\\n\\n\\nll calc(vll A){\\n vll num(4,0);\\n int N=A.size();\\n for(ll a:A){\\n int bs=0;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n num[bs]++;\\n }\\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\\n rep(i,4){\\n if(num[i]==0)continue;\\n num[i]--;\\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\\n F[0][0]=1;\\n rep(j,4){\\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\\n rep(k,num[j]+1){\\n rep(n,N+1-k)rep(m,n*4+1){\\n if(m+(j+1)*k<=4*N&&n+k<=N)\\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\\n NF[n+k][m+(j+1)*k]%=mod;\\n }\\n }\\n swap(F,NF);\\n }\\n DP[i]=F;\\n num[i]++;\\n }\\n ll an=0;\\n for(ll a:A){\\n int bs=0;\\n ll ca=a;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n rep(n,N+1)rep(m,N*4+1){\\n ll res=DP[bs][n][m]*TENPOW[m];\\n res%=mod;\\n res*=ca;\\n res%=mod;\\n res*=fac[n];\\n res%=mod;\\n ll z=(N-n-1);\\n if(z<0)continue;\\n \\n res*=SUMP[z];\\n res%=mod;\\n // if(res>0)cout<<ca<<\\\" \\\"<<n<<\\\" \\\"<<m<<endl;\\n an+=res;\\n an%=mod;\\n assert(res>=0);\\n // cout<<res<<\\\" \\\"<<an<<endl;\\n\\n }\\n }\\n return an;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n precalc();\\n int N=200;\\n cin>>N;\\n vector<ll> A(N);\\n rep(i,N)cin>>A[i];\\n // set<ll> S;\\n // rep(i,N){\\n // A[i]=0;\\n // while(S.count(A[i]))A[i]=rand()%10000;\\n // S.insert(A[i]);\\n // }\\n sort(A.begin(),A.end());\\n reverse(A.begin(),A.end());\\n ll an=calc(A);\\n if(A.back()==0){\\n A.pop_back();\\n an-=calc(A);\\n }\\n an=(an%mod+mod)%mod;\\n cout<<an<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1850,\n \"memory_kb\": 10716,\n \"score_of_the_acc\": -1.0565,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2436_10067366\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define rep2(i,s,t) for(int i=s;i<t;i++)\\n\\n/*\\n- `len` を指定したうえで `precalc()` でテーブルを前計算．`len <= mod`\\nである必要がある\\n- `binom(n, k)` は `n < len` を満たす必要がある\\n- `mod` が固定のときは `const ll mod = 998244353;` のようにする\\n- `a < len` に対して $O(1)$ で逆元が求められる．\\n*/\\nconst ll mod=1e9+7;\\n\\n// 注意： % m を % mod と書かないように！\\nll modpow(ll x, ll k, ll m = mod) {\\n ll v = 1;\\n while(k) {\\n if(k & 1) v = v * x % m;\\n x = x * x % m;\\n k >>= 1;\\n }\\n return v;\\n}\\n\\nusing vll=vector<ll>;\\nint len=2000;\\nvll fac, finv;\\nvll TENPOW;\\nvll SUMP;\\n\\nvoid precalc(ll m = mod) {\\n fac.assign(len, 1), finv.assign(len, 1);\\n TENPOW.assign(len,1);\\n\\n rep(i,len-1)TENPOW[i+1]=(TENPOW[i]*10)%mod;\\n rep2(i, 2, len) fac[i] = fac[i - 1] * i % m;\\n finv[len - 1] = modpow(fac[len - 1], m - 2, m);\\n for(int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % m;\\n SUMP.assign(len,0);\\n rep(z,len)rep(j,z+1){\\n SUMP[z]+=fac[z]*finv[z-j];\\n SUMP[z]%=mod;\\n }\\n}\\n\\nll binom(ll n, ll k, ll m = mod) {\\n if(n < 0 || k < 0 || k > n) return 0;\\n // assert(n < len);\\n return fac[n] * finv[k] % m * finv[n - k] % m;\\n}\\n\\nll inv(ll a, ll m = mod) {\\n // a = (a % m + m) % m; // 必要なら\\n if(a < len) return fac[a - 1] * finv[a] % m;\\n return modpow(a, m - 2, m);\\n}\\n\\n\\nll calc(vll A){\\n vll num(4,0);\\n int N=A.size();\\n for(ll a:A){\\n int bs=0;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n num[bs]++;\\n }\\n vector<vector<vector<ll>>> DP(4,vector<vector<ll>>(N,vector<ll>(N*4+1,0)));\\n rep(i,4){\\n if(num[i]==0)continue;\\n num[i]--;\\n vector<vector<ll>> F(N+1,vector<ll>(N*4+1,0));\\n F[0][0]=1;\\n rep(j,4){\\n vector<vll> NF(N+1,vector<ll>(N*4+1,0));\\n rep(k,num[j]+1){\\n rep(n,N+1-k)rep(m,n*4+1){\\n if(m+(j+1)*k<=4*N&&n+k<=N)\\n NF[n+k][m+(j+1)*k]+=F[n][m]*binom(num[j],k);\\n }\\n }\\n swap(F,NF);\\n }\\n DP[i]=F;\\n num[i]++;\\n }\\n ll an=0;\\n for(ll a:A){\\n int bs=0;\\n ll ca=a;\\n while(a>9){\\n a/=10;\\n bs++;\\n }\\n rep(n,N+1)rep(m,N*4+1){\\n ll res=DP[bs][n][m]*TENPOW[m];\\n res%=mod;\\n res*=ca;\\n res%=mod;\\n res*=fac[n];\\n res%=mod;\\n ll z=(N-n-1);\\n if(z<0)continue;\\n \\n res*=SUMP[z];\\n res%=mod;\\n // if(res>0)cout<<ca<<\\\" \\\"<<n<<\\\" \\\"<<m<<endl;\\n an+=res;\\n an%=mod;\\n\\n }\\n }\\n return an;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n precalc();\\n int N=200;\\n cin>>N;\\n vector<ll> A(N);\\n rep(i,N)cin>>A[i];\\n // set<ll> S;\\n // rep(i,N){\\n // A[i]=0;\\n // while(S.count(A[i]))A[i]=rand()%10000;\\n // S.insert(A[i]);\\n // }\\n sort(A.begin(),A.end());\\n reverse(A.begin(),A.end());\\n ll an=calc(A);\\n if(A.back()==0){\\n A.pop_back();\\n an-=calc(A);\\n }\\n an=(an%mod+mod)%mod;\\n cout<<an<<endl;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 30,\n \"memory_kb\": 3736,\n \"score_of_the_acc\": -0.0125,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2436_9840940\",\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 <unsigned mod = 1000000007> struct fp {\\n unsigned v;\\n static constexpr int get_mod() {\\n return mod;\\n }\\n constexpr unsigned inv() const {\\n assert(v != 0);\\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\\n while (y > 0) {\\n t = x / y;\\n x -= t * y, p -= t * q;\\n tmp = x, x = y, y = tmp;\\n tmp = p, p = q, q = tmp;\\n }\\n if (p < 0)\\n p += mod;\\n return p;\\n }\\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\\n fp operator-() const {\\n return fp() - *this;\\n }\\n fp pow(ull t) {\\n fp res = 1, b = *this;\\n while (t) {\\n if (t & 1)\\n res *= b;\\n b *= b;\\n t >>= 1;\\n }\\n return res;\\n }\\n fp &operator+=(const fp &x) {\\n if ((v += x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator-=(const fp &x) {\\n if ((v += mod - x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator*=(const fp &x) {\\n v = ull(v) * x.v % mod;\\n return *this;\\n }\\n fp &operator/=(const fp &x) {\\n v = ull(v) * x.inv() % mod;\\n return *this;\\n }\\n fp operator+(const fp &x) const {\\n return fp(*this) += x;\\n }\\n fp operator-(const fp &x) const {\\n return fp(*this) -= x;\\n }\\n fp operator*(const fp &x) const {\\n return fp(*this) *= x;\\n }\\n fp operator/(const fp &x) const {\\n return fp(*this) /= x;\\n }\\n bool operator==(const fp &x) const {\\n return v == x.v;\\n }\\n bool operator!=(const fp &x) const {\\n return v != x.v;\\n }\\n friend istream &operator>>(istream &is, fp &x) {\\n return is >> x.v;\\n }\\n friend ostream &operator<<(ostream &os, const fp &x) {\\n return os << x.v;\\n }\\n};\\n\\ntemplate <typename T> T Inv(ll n) {\\n static const int md = T::get_mod();\\n static vector<T> buf({0, 1});\\n assert(n > 0);\\n n %= md;\\n while (SZ(buf) <= n) {\\n int k = SZ(buf), q = (md + k - 1) / k;\\n buf.push_back(buf[k * q - md] * q);\\n }\\n return buf[n];\\n}\\n\\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\\n static const int md = T::get_mod();\\n static vector<T> buf({1, 1}), ibuf({1, 1});\\n assert(n >= 0 and n < md);\\n while (SZ(buf) <= n) {\\n buf.push_back(buf.back() * SZ(buf));\\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\\n }\\n return inv ? ibuf[n] : buf[n];\\n}\\n\\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\\n return nCr<T>(n + r - 1, r, inv);\\n}\\n\\n/**\\n * @brief Modint\\n */\\n\\nusing Fp = fp<1000000007>;\\nint MAXS = 10000, MAXL = 800, MAXN = 200;\\n\\nFp Calc(vector<ll> COUNT) {\\n vector<Fp> D2(MAXN+1), D10(MAXL+1);\\n D10[0] = 1;\\n rep(i,0,MAXN+1) {\\n D2[i] = 0;\\n rep(j,0,i+1) {\\n D2[i] += nCr<Fp>(i,j) * Fact<Fp>(j);\\n }\\n }\\n rep(i,0,MAXL) D10[i+1] = D10[i] * 10;\\n Fp Ret = 0;\\n rep(i,0,COUNT[1]+1) {\\n rep(j,0,COUNT[2]+1) {\\n rep(k,0,COUNT[3]+1) {\\n rep(l,0,COUNT[4]+1) {\\n Fp Mul = 1;\\n Mul *= nCr<Fp>(COUNT[1],i);\\n Mul *= nCr<Fp>(COUNT[2],j);\\n Mul *= nCr<Fp>(COUNT[3],k);\\n Mul *= nCr<Fp>(COUNT[4],l);\\n Mul *= nCr<Fp>(i+j,j);\\n Mul *= nCr<Fp>(i+j+k,k);\\n Mul *= nCr<Fp>(i+j+k+l,l);\\n Mul *= Fact<Fp>(i);\\n Mul *= Fact<Fp>(j);\\n Mul *= Fact<Fp>(k);\\n Mul *= Fact<Fp>(l);\\n Mul *= D2[COUNT[1]+COUNT[2]+COUNT[3]+COUNT[4]-i-j-k-l];\\n Mul *= D10[i+j*2+k*3+l*4];\\n Ret += Mul;\\n }\\n }\\n }\\n }\\n return Ret;\\n // vector<int> Len;\\n // rep(i,1,5) {\\n // rep(j,0,COUNT[i]) Len.push_back(i);\\n // }\\n // int N = Len.size();\\n // vector DP(N+1, vector(N+1, vector<Fp>(MAXL+1,0)));\\n // DP[0][0][0] = 1;\\n // rep(k,0,N) {\\n // rep(i,0,k+1) {\\n // int j = k-i;\\n // rep(m,0,MAXL+1) {\\n // if (DP[i][j][m] == 0) continue;\\n // DP[i+1][j][m] += DP[i][j][m] * (i+1);\\n // DP[i][j+1][m+Len[k]] += DP[i][j][m] * (j+1);\\n // }\\n // }\\n // }\\n // Fp Ret = 0, D = 1;\\n // rep(k,0,MAXL+1) {\\n // rep(i,0,N+1) {\\n // int j = N-i;\\n // Ret += DP[i][j][k] * D;\\n // }\\n // D *= 10;\\n // }\\n // return Ret;\\n}\\n\\nFp Solve(vector<bool> X) {\\n vector<ll> COUNT(5,0), SUM(5,0);\\n rep(i,0,MAXS) {\\n if (!X[i]) continue;\\n int Len = to_string(i).size();\\n COUNT[Len]++;\\n SUM[Len] += i;\\n }\\n Fp Ret = 0;\\n rep(i,1,5) {\\n if (COUNT[i] == 0) continue;\\n COUNT[i]--;\\n Ret += Calc(COUNT) * SUM[i];\\n COUNT[i]++;\\n }\\n return Ret;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<bool> X(MAXS,false);\\n rep(i,0,N) {\\n int A;\\n cin >> A;\\n X[A] = true;\\n }\\n if (N == 1 && X[0]) {\\n cout << 0 << endl;\\n return 0;\\n }\\n Fp ANS = Solve(X);\\n if (X[0]) {\\n X[0] = false;\\n ANS -= Solve(X);\\n }\\n cout << ANS << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1830,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -0.9891,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2436_8189513\",\n \"code_snippet\": \"#include <string.h>\\n#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cfloat>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <ctime>\\n#include <deque>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <list>\\n#include <map>\\n#include <memory>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\n\\nconstexpr int mod = 1000000007;\\n\\nvoid mpl(int &x,int y) {\\n x += y;\\n if(x >= mod) x -= mod;\\n}\\n\\nint dp[202][202][202][2][2];\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int n;\\n cin >> n;\\n vector<int>a(n),b(5,1);\\n for(int i = 0; i < n; i++) {\\n cin >> a[i];\\n }\\n for(int i = 1; i < 5; i++) b[i] = b[i-1]*10;\\n dp[0][0][0][0][1] = 1;\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n for(int k = 0; k < n; k++) {\\n for(int f1 = 0; f1 < 2; f1++) {\\n for(int f2 = 0; f2 < 2; f2++) {\\n if(!dp[i][j][k][f1][f2]) continue;\\n mpl(dp[i+1][j+1][k][f1][f2],1ll*dp[i][j][k][f1][f2]*(j+1)*b[to_string(a[i]).size()]%mod);\\n if(a[i] == 0) {\\n mpl(dp[i+1][j][k+1][f1][f2],1ll*dp[i][j][k][f1][f2]*k%mod);\\n mpl(dp[i+1][j][k+1][f1][0],dp[i][j][k][f1][f2]);\\n }\\n else {\\n mpl(dp[i+1][j][k+1][f1][f2],1ll*dp[i][j][k][f1][f2]*k%mod);\\n mpl(dp[i+1][j][k+1][f1][1],dp[i][j][k][f1][f2]);\\n }\\n if(f1 == 0) mpl(dp[i+1][j][k][1][f2],1ll*dp[i][j][k][f1][f2]*a[i]%mod);\\n mpl(dp[i+1][j][k][f1][f2],dp[i][j][k][f1][f2]);\\n }\\n }\\n }\\n }\\n }\\n int ans = 0;\\n for(int i = 0; i <= n; i++) {\\n for(int j = 0; j <= n; j++) {\\n mpl(ans,dp[n][i][j][1][1]);\\n }\\n }\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 129544,\n \"score_of_the_acc\": -1.1589,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2436_7137060\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nconstexpr ll mod = 1e9+7;\\n\\nll mod_pow(ll a,ll b){\\n a%=mod;\\n if(b==0)return 1;\\n if(b==1)return a;\\n ll res=mod_pow(a,b/2)%mod;\\n res*=res; res%=mod;\\n if(b%2)res*=a;\\n return res%mod;\\n}\\n\\nstruct perm{\\n vector<ll> p,invp;\\n perm(int n){\\n p.resize(n+1),invp.resize(n+1);\\n p[0]=1;\\n for(int i=1;i<=n;i++){\\n p[i]=p[i-1]*i%mod;\\n }\\n invp[n]=mod_pow(p[n],mod-2);\\n for(int i=n-1;i>=0;i--){\\n invp[i]=invp[i+1]*(i+1)%mod;\\n }\\n }\\n ll comb(ll x,ll y){\\n if(x<y||y<0)return 0;\\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\\n }\\n};\\nperm p(1<<20);\\n\\nconst int N = 201;\\nll P[N][N];\\n\\nll solve(vector<pair<int,int>> a){\\n ll res = 0;\\n sort(a.begin(), a.end());\\n int n = a.size();\\n for(int i=0;i<n;i++){\\n ll dsum = 0;\\n {\\n int j = i;\\n while(i<n and a[i].second == a[j].second){\\n dsum += a[i].first;\\n i++;\\n }\\n i--;\\n }\\n int m = 0;\\n vector<int> cnt(6);\\n for(int j=0;j<n;j++){\\n if(i==j) continue;\\n cnt[a[j].second]++;\\n m += a[j].second;\\n }\\n vector<vector<ll>> dp(n,vector<ll>(m+1));\\n dp[0][0] = 1;\\n // 何個使ったか iを使う前に何桁あるか\\n for(int j=1;j<=5;j++){\\n for(int k=n-1;k>=0;k--){\\n for(int l=m;l>=0;l--){\\n if(!dp[k][l]) continue;\\n for(int c=1;c<=cnt[j];c++){\\n ll ad = p.comb(cnt[j], c)*dp[k][l]%mod;\\n ad *= p.comb(k+c, c);\\n ad %= mod;\\n ad *= p.p[c];\\n ad %= mod;\\n dp[k+c][l+c*j] += ad;\\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\\n }\\n }\\n }\\n }\\n for(int j=0;j<n;j++){\\n ll ten = 1;\\n for(int k=0;k<=m;k++){\\n /*\\n * n-1-j枚ある\\n * 0枚選んで並べる通り数\\n * 1枚選んで並べる通り数\\n * n-1-j枚選んで並べる通り数\\n */\\n ll ad = dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\\n res += ad;\\n// if(dp[j][k])cout << a[i].second << \\\" \\\" << P[n-1-j][n-1-j] << \\\" \\\" << dp[j][k] << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << ad << endl;\\n ten = ten * 10 % mod;\\n }\\n }\\n }\\n return res%mod;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n for(int i=0;i<N;i++){\\n ll u = 1;\\n for(int j=0;j<=i;j++){\\n P[i][j] = u;\\n u *= (i-j); u %= mod;\\n if(j){\\n P[i][j] += P[i][j-1];\\n if(P[i][j] >= mod) P[i][j] -= mod;\\n }\\n }\\n }\\n int n; cin >> n;\\n vector<pair<int,int>> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i].first;\\n a[i].second = to_string(a[i].first).size();\\n }\\n sort(a.rbegin(), a.rend());\\n ll res = solve(a);\\n if(a.back().first == 0){\\n a.pop_back();\\n res -= solve(a);\\n if(res < 0) res += mod;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 20912,\n \"score_of_the_acc\": -0.153,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2436_7136783\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nconstexpr ll mod = 1e9+7;\\n\\nll mod_pow(ll a,ll b){\\n a%=mod;\\n if(b==0)return 1;\\n if(b==1)return a;\\n ll res=mod_pow(a,b/2)%mod;\\n res*=res; res%=mod;\\n if(b%2)res*=a;\\n return res%mod;\\n}\\n\\nstruct perm{\\n vector<ll> p,invp;\\n perm(int n){\\n p.resize(n+1),invp.resize(n+1);\\n p[0]=1;\\n for(int i=1;i<=n;i++){\\n p[i]=p[i-1]*i%mod;\\n }\\n invp[n]=mod_pow(p[n],mod-2);\\n for(int i=n-1;i>=0;i--){\\n invp[i]=invp[i+1]*(i+1)%mod;\\n }\\n }\\n ll comb(ll x,ll y){\\n if(x<y||y<0)return 0;\\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\\n }\\n};\\nperm p(1<<20);\\n\\nconst int N = 201;\\nll P[N][N];\\n\\nll solve(vector<pair<int,int>> a){\\n ll res = 0;\\n sort(a.begin(), a.end());\\n int n = a.size();\\n for(int i=0;i<n;i++){\\n ll dsum = 0;\\n {\\n int j = i;\\n while(i<n and a[i].second == a[j].second){\\n dsum += a[i].first;\\n i++;\\n }\\n i--;\\n }\\n int m = 0;\\n vector<int> cnt(6);\\n for(int j=0;j<n;j++){\\n if(i==j) continue;\\n cnt[a[j].second]++;\\n m += a[j].second;\\n }\\n vector<vector<ll>> dp(n,vector<ll>(m+1));\\n dp[0][0] = 1;\\n // 何個使ったか iを使う前に何桁あるか\\n for(int j=1;j<=5;j++){\\n for(int k=n-1;k>=0;k--){\\n for(int l=m;l>=0;l--){\\n if(!dp[k][l]) continue;\\n for(int c=1;c<=cnt[j];c++){\\n ll ad = p.comb(cnt[j], c)*dp[k][l]%mod;\\n ad *= p.comb(k+c, c);\\n ad %= mod;\\n ad *= p.p[c];\\n ad %= mod;\\n dp[k+c][l+c*j] += ad;\\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\\n }\\n }\\n }\\n }\\n for(int j=0;j<n;j++){\\n ll ten = 1;\\n for(int k=0;k<=m;k++){\\n /*\\n * n-1-j枚ある\\n * 0枚選んで並べる通り数\\n * 1枚選んで並べる通り数\\n * n-1-j枚選んで並べる通り数\\n */\\n ll ad = dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\\n res += ad;\\n// if(dp[j][k])cout << a[i].second << \\\" \\\" << P[n-1-j][n-1-j] << \\\" \\\" << dp[j][k] << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << ad << endl;\\n ten = ten * 10 % mod;\\n }\\n }\\n }\\n return res%mod;\\n}\\n\\n/*\\n * 60666 60600\\n * 66066 66000\\n * 66606 66600\\n * 66660 66060\\n *\\n * 666 600\\n * 6066 6000\\n * 6606 6600\\n * 6660 6060\\n *\\n * 303 300\\n * 330 300\\n * 66 00\\n *\\n * 13 10\\n */\\n\\n\\nll gutyoku(vector<pair<int,int>> a){\\n int n = a.size();\\n ll res = 0;\\n map<int,int> mp;\\n for(int i=1;i<(1<<n);i++){\\n vector<pair<pair<int,int>,int>> v;\\n for(int j=0;j<n;j++){\\n if((1<<j)&i) v.push_back({a[j],j});\\n }\\n sort(v.begin() , v.end());\\n do{\\n if(v[0].first.first == 0) continue;\\n ll sum = 0;\\n for(auto p:v){\\n for(int j=0;j<p.first.second;j++){\\n sum *= 10; sum %= mod;\\n }\\n sum += p.first.first;\\n }\\n mp[sum]++;\\n res += sum;\\n }while(next_permutation(v.begin(), v.end()));\\n }\\n for(auto p:mp){\\n cout << p.first << \\\" \\\" << p.second << endl;\\n }\\n return res%mod;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n for(int i=0;i<N;i++){\\n ll u = 1;\\n for(int j=0;j<=i;j++){\\n P[i][j] = u;\\n u *= (i-j); u %= mod;\\n if(j){\\n P[i][j] += P[i][j-1];\\n if(P[i][j] >= mod) P[i][j] -= mod;\\n }\\n }\\n }\\n int n; cin >> n;\\n vector<pair<int,int>> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i].first;\\n a[i].second = to_string(a[i].first).size();\\n }\\n sort(a.rbegin(), a.rend());\\n// cerr << gutyoku(a) << endl;\\n ll res = solve(a);\\n if(a.back().first == 0){\\n a.pop_back();\\n res -= solve(a);\\n if(res < 0) res += mod;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 21004,\n \"score_of_the_acc\": -0.1537,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2436_7136598\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nconstexpr ll mod = 1e9+7;\\n\\nll mod_pow(ll a,ll b){\\n a%=mod;\\n if(b==0)return 1;\\n if(b==1)return a;\\n ll res=mod_pow(a,b/2)%mod;\\n res*=res; res%=mod;\\n if(b%2)res*=a;\\n return res%mod;\\n}\\n\\nstruct perm{\\n vector<ll> p,invp;\\n perm(int n){\\n p.resize(n+1),invp.resize(n+1);\\n p[0]=1;\\n for(int i=1;i<=n;i++){\\n p[i]=p[i-1]*i%mod;\\n }\\n invp[n]=mod_pow(p[n],mod-2);\\n for(int i=n-1;i>=0;i--){\\n invp[i]=invp[i+1]*(i+1)%mod;\\n }\\n }\\n ll comb(ll x,ll y){\\n if(x<y||y<0)return 0;\\n return (p[x]*invp[x-y]%mod)*invp[y]%mod;\\n }\\n};\\nperm p(1<<20);\\n\\nconst int N = 201;\\nll P[N][N];\\n\\nll solve(vector<pair<int,int>> a){\\n ll res = 0;\\n sort(a.begin(), a.end());\\n int n = a.size();\\n for(int i=0;i<n;i++){\\n ll dsum = 0;\\n {\\n int j = i;\\n while(i<n and a[i].second == a[j].second){\\n dsum += a[i].first;\\n i++;\\n }\\n i--;\\n }\\n int m = 0;\\n vector<int> cnt(6);\\n for(int j=0;j<n;j++){\\n if(i==j) continue;\\n cnt[a[j].second]++;\\n m += a[j].second;\\n }\\n vector<vector<ll>> dp(n,vector<ll>(m+1));\\n dp[0][0] = 1;\\n for(int j=1;j<=5;j++){\\n for(int k=n-1;k>=0;k--){\\n for(int l=m;l>=0;l--){\\n if(!dp[k][l]) continue;\\n for(int c=1;c<=cnt[j];c++){\\n ll ad = p.comb(cnt[j], c);\\n ad *= p.comb(k+c, c);\\n ad %= mod;\\n ad *= p.p[c];\\n ad %= mod;\\n dp[k+c][l+c*j] += ad;\\n if(dp[k+c][l+c*j] >= mod) dp[k+c][l+c*j] -= mod;\\n }\\n }\\n }\\n }\\n for(int j=0;j<n;j++){\\n ll ten = 1;\\n for(int k=0;k<=m;k++){\\n res += dsum * dp[j][k] % mod * P[n-1-j][n-1-j] % mod * ten % mod;\\n ten = ten * 10 % mod;\\n }\\n }\\n }\\n return res%mod;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n for(int i=0;i<N;i++){\\n ll u = 1;\\n for(int j=0;j<=i;j++){\\n P[i][j] = u;\\n u *= (i-j); u %= mod;\\n if(j){\\n P[i][j] += P[i][j-1];\\n if(P[i][j] >= mod) P[i][j] -= mod;\\n }\\n }\\n }\\n int n; cin >> n;\\n vector<pair<int,int>> a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i].first;\\n a[i].second = to_string(a[i].first).size();\\n }\\n sort(a.rbegin(), a.rend());\\n ll res = solve(a);\\n if(a.back().first == 0){\\n a.pop_back();\\n res -= solve(a);\\n if(res < 0) res += mod;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 0.10526315789473684,\n \"time_ms\": 10,\n \"memory_kb\": 19728,\n \"score_of_the_acc\": -0.1273,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2436_6755433\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\n#ifndef OTERA_MODINT\\n#define OTERA_MODINT 1\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n\\n#include <utility>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n unsigned int umod() const { return _m; }\\n\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace otera {\\n using modint107 = atcoder::modint1000000007;\\n using modint998 = atcoder::modint998244353;\\n using modint = atcoder::modint;\\n}; //namespace otera\\n\\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint1000000007 &e) {\\n out << e.val();\\n return out;\\n}\\n\\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint998244353 &e) {\\n out << e.val();\\n return out;\\n}\\n\\nstd::ostream& operator<<(std::ostream& out, const atcoder::modint &e) {\\n out << e.val();\\n return out;\\n}\\n\\n#endif // OTERA_MODINT\\n\\n\\nnamespace otera{\\n template<typename T>\\n class powtable {\\n public:\\n powtable(long long x) : x_(T(x)), pw_(1, 1) {}\\n powtable(long long x, int n) : x_(T(x)), pw_(1, 1) {\\n ensure(n);\\n }\\n T pow(const int n) {\\n assert(n >= 0);\\n ensure(n);\\n return pw_[n];\\n }\\n T operator[](const int n) {\\n return pow(n);\\n }\\n private:\\n T x_;\\n std::vector<T> pw_;\\n void ensure(const int n) {\\n int sz = pw_.size();\\n if(n + 1 <= sz) return;\\n int next_sz = std::max(n + 1, sz * 2);\\n pw_.resize(next_sz);\\n for(int i = sz; i < next_sz; ++ i) {\\n pw_[i] = pw_[i - 1] * x_;\\n }\\n }\\n };\\n} // namespace otera\\n\\n\\n\\nnamespace otera{\\n template<typename T>\\n class factorial {\\n public:\\n factorial() {}\\n factorial(int n) {\\n ensure(n);\\n }\\n T com(const int n, const int k) {\\n if(n == k) return 1;\\n if(n < k or n < 0 or k < 0) return 0;\\n ensure(n);\\n return fact_[n] * finv_[k] * finv_[n - k];\\n }\\n T fact(const int n) {\\n if(n < 0) return 0;\\n ensure(n);\\n return fact_[n];\\n }\\n T inv(const int n) {\\n if(n < 0) return 0;\\n ensure(n);\\n return inv_[n];\\n }\\n T finv(const int n) {\\n if(n < 0) return 0;\\n ensure(n);\\n return finv_[n];\\n }\\n private:\\n static std::vector<T> fact_, inv_, finv_;\\n int MOD = T::mod();\\n void ensure(const int n) {\\n int sz = fact_.size();\\n if(n + 1 <= sz) return;\\n int next_sz = std::max(n + 1, sz * 2);\\n fact_.resize(next_sz), inv_.resize(next_sz), finv_.resize(next_sz);\\n for(int i = sz; i < next_sz; ++ i) {\\n fact_[i] = fact_[i - 1] * i;\\n inv_[i] = -inv_[MOD % i] * (MOD / i);\\n finv_[i] = finv_[i - 1] * inv_[i];\\n }\\n }\\n };\\n template<typename T> std::vector<T> factorial<T>::fact_ {1, 1};\\n template<typename T> std::vector<T> factorial<T>::inv_ {1, 1};\\n template<typename T> std::vector<T> factorial<T>::finv_ {1, 1};\\n} // namespace otera\\n\\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\\nusing mint = otera::modint107;\\notera::factorial<mint> bc;\\n\\nmint calc(int n, vc<int> a) {\\n otera::powtable<mint> pw(10);\\n otera::powtable<mint> pw2(2);\\n // INT(n);\\n // VEC(int, a, n);\\n vc<int> b(n);\\n vc<int> c(5, 0);\\n int cnt0 = 0;\\n rep(i, n) {\\n if(a[i] == 0) ++ cnt0;\\n b[i] = si(to_string(a[i]));\\n c[b[i]] ++;\\n }\\n vc<mint> pre(n + 1, 0);\\n pre[0] = 1;\\n for(int j = 1; j <= n; ++ j) {\\n for(int i = 0; i <= j; ++ i) {\\n pre[j] += bc.com(j, i) * bc.fact(i);\\n }\\n }\\n mint ans = 0;\\n vvc<mint> dp(4 * n + 1, vc<mint>(n + 1, 0));\\n dp[0][0] = 1;\\n for(int j = 1; j <= 4; ++ j) {\\n for(int x = 4 * n; x >= 0; -- x) {\\n for(int y = n; y >= 0; -- y) {\\n if(dp[x][y] == 0) continue;\\n for(int z = 1; z <= c[j]; ++ z) {\\n if(x + j * z <= 4 * n && y + z <= n) {\\n dp[x + j * z][y + z] += dp[x][y] * bc.com(c[j], z);\\n }\\n }\\n }\\n }\\n }\\n rep(i, 4 * n + 1) {\\n rep(j, n + 1) {\\n if(dp[i][j] != 0) {\\n debug(i, j, dp[i][j]);\\n }\\n }\\n }\\n vector ndp(4 * n + 1, vc<mint>(n + 1, 0));\\n rep(i, n) {\\n if(a[i] != 0) {\\n debug(i, b[i]);\\n for(int x = 0; x <= 4 * n; ++ x) {\\n for(int y = 0; y <= n; ++ y) {\\n if(x - b[i] >= 0 && y - 1 >= 0) {\\n ndp[x][y] = dp[x][y] - ndp[x - b[i]][y - 1];\\n } else {\\n ndp[x][y] = dp[x][y];\\n }\\n }\\n }\\n rep(x, 4 * n + 1) {\\n assert(ndp[x][n] == 0);\\n }\\n for(int x = 0; x <= 4 * n; ++ x) {\\n for(int y = 0; y <= n - 1; ++ y) {\\n if(ndp[x][y] != 0) {\\n debug(i, x, y, ndp[x][y]);\\n }\\n ans += a[i] * ndp[x][y] * pw[x] * pre[n - 1 - y] * bc.fact(y);\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nvoid solve() {\\n // otera::powtable<mint> pw(10);\\n // otera::powtable<mint> pw2(2);\\n INT(n);\\n VEC(int, a, n);\\n mint ans = calc(n, a);\\n int cnt0 = 0;\\n rep(i, n) {\\n if(a[i] == 0) ++ cnt0;\\n }\\n if(cnt0 > 0) {\\n Sort(a); Rev(a); a.pop_back();\\n ans -= mint(cnt0) * calc(n - 1, a);\\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\": 550,\n \"memory_kb\": 4852,\n \"score_of_the_acc\": -0.3039,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2436_6670706\",\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 <int mod>\\nclass Modint {\\n using mint = Modint;\\n static_assert(mod > 0, \\\"Modulus must be positive\\\");\\n\\npublic:\\n static constexpr int get_mod() noexcept { return mod; }\\n\\n constexpr Modint(long long y = 0) noexcept : x(y >= 0 ? y % mod : (y % mod + mod) % mod) {}\\n\\n constexpr int value() const noexcept { return x; }\\n\\n constexpr mint& operator+=(const mint& r) noexcept { if ((x += r.x) >= mod) x -= mod; return *this; }\\n constexpr mint& operator-=(const mint& r) noexcept { if ((x += mod - r.x) >= mod) x -= mod; return *this; }\\n constexpr mint& operator*=(const mint& r) noexcept { x = static_cast<int>(1LL * x * r.x % mod); return *this; }\\n constexpr mint& operator/=(const mint& r) noexcept { *this *= r.inv(); return *this; }\\n\\n constexpr mint operator-() const noexcept { return mint(-x); }\\n\\n constexpr mint operator+(const mint& r) const noexcept { return mint(*this) += r; }\\n constexpr mint operator-(const mint& r) const noexcept { return mint(*this) -= r; }\\n constexpr mint operator*(const mint& r) const noexcept { return mint(*this) *= r; }\\n constexpr mint operator/(const mint& r) const noexcept { return mint(*this) /= r; }\\n\\n constexpr bool operator==(const mint& r) const noexcept { return x == r.x; }\\n constexpr bool operator!=(const mint& r) const noexcept { return x != r.x; }\\n\\n constexpr mint inv() const noexcept {\\n int a = x, b = mod, u = 1, v = 0;\\n while (b > 0) {\\n int t = a / b;\\n std::swap(a -= t * b, b);\\n std::swap(u -= t * v, v);\\n }\\n return mint(u);\\n }\\n\\n constexpr mint pow(long long n) const noexcept {\\n mint 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 std::ostream& operator<<(std::ostream& os, const mint& r) {\\n return os << r.x;\\n }\\n\\n friend std::istream& operator>>(std::istream& is, mint& r) {\\n long long t;\\n is >> t;\\n r = mint(t);\\n return is;\\n }\\n\\nprivate:\\n int x;\\n};\\n\\nusing mint = Modint<(int) 1e9+7>;\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <typename T>\\nclass Combination {\\npublic:\\n Combination() = default;\\n Combination(int n) : fact_(n + 1), fact_inv_(n + 1) {\\n fact_[0] = 1;\\n for (int i = 1; i <= n; ++i) fact_[i] = fact_[i - 1] * i;\\n fact_inv_[n] = T(1) / fact_[n];\\n for (int i = n; i > 0; --i) fact_inv_[i - 1] = fact_inv_[i] * i;\\n }\\n\\n T perm(int n, int r) const {\\n if (r < 0 || n < r) return 0;\\n return fact_[n] * fact_inv_[n - r];\\n }\\n\\n T comb(int n, int r) const {\\n if (r < 0 || n < r) return 0;\\n return fact_[n] * fact_inv_[r] * fact_inv_[n - r];\\n }\\n\\n T fact(int n) const { return fact_[n]; }\\n T fact_inv(int n) const { return fact_inv_[n]; }\\n\\nprivate:\\n std::vector<T> fact_, fact_inv_;\\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 bool zero = false;\\n vector<mint> sum(5);\\n vector<int> cnt(5);\\n rep(_,0,n) {\\n int x;\\n cin >> x;\\n if (x == 0) {\\n zero = true;\\n }\\n int l = to_string(x).size();\\n sum[l] += x;\\n ++cnt[l];\\n }\\n Combination<mint> comb(n);\\n vector<mint> pow10(4*n+1, 1);\\n rep(i,1,4*n+1) pow10[i] = pow10[i-1] * 10;\\n vector<mint> cumperm(n+1);\\n rep(i,0,n+1) {\\n rep(j,0,i+1) cumperm[i] += comb.perm(i, j);\\n }\\n\\n auto calc = [&]() -> mint {\\n if (n == 0) return 0;\\n mint ans = 0;\\n rep(l,1,5) {\\n if (cnt[l] == 0) continue;\\n vector<vector<mint>> dp(n, vector<mint>(4*n));\\n dp[0][0] = 1;\\n rep(k,1,5) {\\n int c = cnt[k];\\n if (k == l) --c;\\n revrep(i,n,0) revrep(j,4*n,0) rep(d,1,c+1) {\\n if (i+d >= n || j+k*d >= 4*n) break;\\n dp[i+d][j+k*d] += dp[i][j] * comb.comb(c, d);\\n }\\n }\\n rep(i,0,n) rep(j,0,4*n) {\\n ans += dp[i][j] * comb.fact(i) * cumperm[n-1-i] * pow10[j] * sum[l];\\n }\\n }\\n return ans;\\n };\\n\\n mint ans = calc();\\n if (zero) {\\n --n;\\n --cnt[1];\\n ans -= calc();\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 3988,\n \"score_of_the_acc\": -0.433,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2436_6347583\",\n \"code_snippet\": \"#line 2 \\\"library/bits/stdc++.h\\\"\\n\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <typeindex>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#endif\\n#line 2 \\\"Source.cpp\\\"\\nusing namespace std;\\n\\n#define REP(a, b) for (long long a = 0; a < b; ++a)\\n#define ll long long\\n#define ld long double\\n#define ALL(x) begin(x), end(x)\\n\\n#line 1 \\\"library/atcoder/modint.hpp\\\"\\n\\n\\n\\n#include <cassert>\\n#line 6 \\\"library/atcoder/modint.hpp\\\"\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n#line 1 \\\"library/atcoder/internal_math.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/internal_math.hpp\\\"\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n// @param n `n < 2^32`\\n// @param m `1 <= m < 2^32`\\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n // y_max < m * (n + 1)\\n // floor(y_max / m) <= n\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 1 \\\"library/atcoder/internal_type_traits.hpp\\\"\\n\\n\\n\\n#line 7 \\\"library/atcoder/internal_type_traits.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 14 \\\"library/atcoder/modint.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 10 \\\"Source.cpp\\\"\\nusing mint = atcoder::modint1000000007;\\n\\n#define int long long\\nmint dp[300][2000];\\n\\nint dfs(vector<int> now, int val)\\n{\\n int ans = val;\\n REP(i, now.size())\\n {\\n int tmp = val * 10 + now[i];\\n vector<int> news;\\n REP(q, now.size())\\n {\\n if (i != q)\\n news.push_back(now[q]);\\n }\\n ans += dfs(news, tmp);\\n }\\n return ans;\\n}\\n\\nmint mergers[1000];\\nvoid solve()\\n{\\n int n;\\n cin >> n;\\n int cnts[5] = {};\\n vector<string> inputs;\\n int is_zero = 0;\\n REP(i, n)\\n {\\n string s;\\n cin >> s;\\n inputs.push_back(s);\\n cnts[s.length()]++;\\n if (s == \\\"0\\\")\\n is_zero = true;\\n }\\n sort(ALL(inputs));\\n mint ans = 0;\\n REP(t, 1 + is_zero)\\n {\\n for (int q = 0; q <= n; ++q)\\n {\\n mint hoge = 0;\\n mint now_choose = 1;\\n for (int t = 0; t <= n - q - 1; ++t)\\n {\\n hoge += now_choose;\\n now_choose *= (n - q - 1 - t);\\n }\\n mergers[q] = hoge;\\n }\\n mint tmps = 0;\\n for (int digit = 1; digit <= 4; ++digit)\\n {\\n if (cnts[digit] == 0)\\n continue;\\n cnts[digit]--;\\n\\n REP(q, n + 1)\\n {\\n REP(j, n * 5)\\n {\\n dp[q][j] = 0;\\n }\\n }\\n dp[0][0] = 1;\\n for (int t = 1; t <= 4; ++t)\\n {\\n REP(_, cnts[t])\\n {\\n for (int a = n; a >= 0; --a)\\n {\\n for (int b = 4 * n; b >= 0; --b)\\n {\\n dp[a + 1][b + t] += dp[a][b] * (a + 1);\\n }\\n }\\n }\\n }\\n\\n REP(t, inputs.size())\\n {\\n if (inputs[t].size() == digit)\\n {\\n for (int q = 0; q <= n; ++q)\\n {\\n mint multiplier = 1;\\n for (int j = 0; j <= 4 * n; ++j)\\n {\\n tmps += multiplier * mergers[q] * dp[q][j] * stoll(inputs[t]);\\n multiplier *= 10;\\n }\\n }\\n }\\n }\\n\\n cnts[digit]++;\\n }\\n\\n if (t == 0)\\n {\\n ans += tmps;\\n }\\n if (t == 1)\\n {\\n ans -= tmps;\\n }\\n if (inputs.size() != 0 and inputs[0] == \\\"0\\\")\\n {\\n n--;\\n inputs.erase(inputs.begin());\\n cnts[1]--;\\n }\\n }\\n cout << ans.val() << endl;\\n}\\n\\n#undef int\\nint main()\\n{\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(100);\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 5828,\n \"score_of_the_acc\": -0.6214,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2436_6026793\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <uint64_t Modulus> class modint {\\n using i64 = int64_t;\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n\\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \\\"Modulus must be less than 2**31\\\");\\n static constexpr u32 mod = Modulus;\\n u32 v;\\n\\npublic:\\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\\n constexpr u32& val() noexcept { return v; }\\n constexpr const u32& val() const noexcept { return v; }\\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 {\\n v += rhs.v;\\n if (v >= mod) v -= mod;\\n return *this;\\n }\\n constexpr modint& operator-=(const modint& rhs) noexcept {\\n if (v < rhs.v) v += mod;\\n v -= rhs.v;\\n return *this;\\n }\\n constexpr modint& operator*=(const modint& rhs) noexcept {\\n v = (u64)v * rhs.v % mod;\\n return *this;\\n }\\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\\n constexpr modint pow(long long n) const noexcept {\\n assert(0 <= n);\\n modint self(*this), res(1);\\n while (n > 0) {\\n if (n & 1) res *= self;\\n self *= self;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr modint inv() const noexcept {\\n assert(*this != 0);\\n return pow(mod - 2);\\n }\\n constexpr modint& operator++() noexcept {\\n if (++v == mod) v = 0;\\n return *this;\\n }\\n constexpr modint& operator--() noexcept {\\n if (v == 0) v = mod;\\n return --v, *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint t = *this;\\n return ++*this, t;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint t = *this;\\n return --*this, t;\\n }\\n constexpr modint operator-() const noexcept { return modint(mod - v); }\\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\\n constexpr bool operator!() const noexcept { return !v; }\\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\\n i64 v;\\n rhs = modint{(s >> v, v)};\\n return s;\\n }\\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\\n};\\n\\n/**\\n * @brief modint\\n * @docs docs/modulo/modint.md\\n */\\n\\ntemplate <typename T> struct Binomial {\\n Binomial(int MAX = 0) : n(1), facs(1, T(1)), finvs(1, T(1)), invs(1, T(1)) {\\n while (n <= MAX) extend();\\n }\\n\\n T fac(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return facs[i];\\n }\\n\\n T finv(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return finvs[i];\\n }\\n\\n T inv(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return invs[i];\\n }\\n\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n return fac(n) * finv(n - r);\\n }\\n\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n return fac(n) * finv(n - r) * finv(r);\\n }\\n\\n T H(int n, int r) {\\n if (n < 0 || r < 0) return T(0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n\\n T C_naive(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n T res = 1;\\n r = std::min(r, n - r);\\n for (int i = 1; i <= r; i++) res *= inv(i) * (n--);\\n return res;\\n }\\n\\nprivate:\\n int n;\\n std::vector<T> facs, finvs, invs;\\n\\n inline void extend() {\\n int m = n << 1;\\n facs.resize(m);\\n finvs.resize(m);\\n invs.resize(m);\\n for (int i = n; i < m; i++) facs[i] = facs[i - 1] * i;\\n finvs[m - 1] = T(1) / facs[m - 1];\\n invs[m - 1] = finvs[m - 1] * facs[m - 2];\\n for (int i = m - 2; i >= n; i--) {\\n finvs[i] = finvs[i + 1] * (i + 1);\\n invs[i] = finvs[i] * facs[i - 1];\\n }\\n n = m;\\n }\\n};\\n\\n/**\\n * @brief binomial\\n * @docs docs/combinatorics/binomial.md\\n */\\n\\nconst long long MOD = 1000000007;\\nusing mint = modint<MOD>;\\nconst int MAX_N = 205;\\nmint dp[MAX_N][MAX_N][MAX_N][2];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n Binomial<mint> BINOM;\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for (int& x : a) cin >> x;\\n\\n sort(a.rbegin(), a.rend());\\n vector<int> len(n);\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n len[i] = to_string(a[i]).size();\\n sum += len[i];\\n }\\n vector<mint> power(sum + 1, 1);\\n for (int i = 0; i < sum; i++) power[i + 1] = power[i] * 10;\\n\\n dp[0][0][0][0] = 1;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j <= i; j++) {\\n for (int k = 0; j + k <= i; k++) {\\n for (int l = 0; l < 2; l++) {\\n mint val = dp[i][j][k][l];\\n if (val == 0) continue;\\n dp[i + 1][j][k][l] += val;\\n if (l == 0) dp[i + 1][j][k][1] += val * a[i];\\n dp[i + 1][j + 1][k][l] += val;\\n dp[i + 1][j][k + 1][l] += val * power[len[i]];\\n }\\n }\\n }\\n }\\n\\n mint ans = 0;\\n for (int j = 0; j <= n; j++) {\\n for (int k = 0; j + k <= n; k++) {\\n ans += dp[n][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\\n }\\n }\\n if (a.back() == 0) {\\n for (int j = 0; j <= n; j++) {\\n for (int k = 0; j + k <= n; k++) {\\n ans -= dp[n - 1][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\\n }\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 67556,\n \"score_of_the_acc\": -0.5032,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2436_6026792\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\\n for (size_t i = 0; i < v.size(); i++) {\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {\\n for (size_t i = 0; i < N; i++) {\\n os << v[i] << (i + 1 == N ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) void(0)\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\nlong long MSK(int n) { return (1LL << n) - 1; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <typename T> void mkuni(vector<T>& v) {\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n}\\ntemplate <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }\\n#pragma endregion\\n\\n#include <cassert>\\n#include <cstdint>\\n#include <iostream>\\n\\ntemplate <uint64_t Modulus> class modint {\\n using i64 = int64_t;\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n\\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \\\"Modulus must be less than 2**31\\\");\\n static constexpr u32 mod = Modulus;\\n u32 v;\\n\\npublic:\\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\\n constexpr u32& val() noexcept { return v; }\\n constexpr const u32& val() const noexcept { return v; }\\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 {\\n v += rhs.v;\\n if (v >= mod) v -= mod;\\n return *this;\\n }\\n constexpr modint& operator-=(const modint& rhs) noexcept {\\n if (v < rhs.v) v += mod;\\n v -= rhs.v;\\n return *this;\\n }\\n constexpr modint& operator*=(const modint& rhs) noexcept {\\n v = (u64)v * rhs.v % mod;\\n return *this;\\n }\\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\\n constexpr modint pow(long long n) const noexcept {\\n assert(0 <= n);\\n modint self(*this), res(1);\\n while (n > 0) {\\n if (n & 1) res *= self;\\n self *= self;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr modint inv() const noexcept {\\n assert(*this != 0);\\n return pow(mod - 2);\\n }\\n constexpr modint& operator++() noexcept {\\n if (++v == mod) v = 0;\\n return *this;\\n }\\n constexpr modint& operator--() noexcept {\\n if (v == 0) v = mod;\\n return --v, *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint t = *this;\\n return ++*this, t;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint t = *this;\\n return --*this, t;\\n }\\n constexpr modint operator-() const noexcept { return modint(mod - v); }\\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\\n constexpr bool operator!() const noexcept { return !v; }\\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\\n i64 v;\\n rhs = modint{(s >> v, v)};\\n return s;\\n }\\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\\n};\\n\\n/**\\n * @brief modint\\n * @docs docs/modulo/modint.md\\n */\\n\\n#include <cassert>\\n#include <vector>\\n\\ntemplate <typename T> struct Binomial {\\n Binomial(int MAX = 0) : n(1), facs(1, T(1)), finvs(1, T(1)), invs(1, T(1)) {\\n while (n <= MAX) extend();\\n }\\n\\n T fac(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return facs[i];\\n }\\n\\n T finv(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return finvs[i];\\n }\\n\\n T inv(int i) {\\n assert(i >= 0);\\n while (n <= i) extend();\\n return invs[i];\\n }\\n\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n return fac(n) * finv(n - r);\\n }\\n\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n return fac(n) * finv(n - r) * finv(r);\\n }\\n\\n T H(int n, int r) {\\n if (n < 0 || r < 0) return T(0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n\\n T C_naive(int n, int r) {\\n if (n < 0 || n < r || r < 0) return T(0);\\n T res = 1;\\n r = std::min(r, n - r);\\n for (int i = 1; i <= r; i++) res *= inv(i) * (n--);\\n return res;\\n }\\n\\nprivate:\\n int n;\\n std::vector<T> facs, finvs, invs;\\n\\n inline void extend() {\\n int m = n << 1;\\n facs.resize(m);\\n finvs.resize(m);\\n invs.resize(m);\\n for (int i = n; i < m; i++) facs[i] = facs[i - 1] * i;\\n finvs[m - 1] = T(1) / facs[m - 1];\\n invs[m - 1] = finvs[m - 1] * facs[m - 2];\\n for (int i = m - 2; i >= n; i--) {\\n finvs[i] = finvs[i + 1] * (i + 1);\\n invs[i] = finvs[i] * facs[i - 1];\\n }\\n n = m;\\n }\\n};\\n\\n/**\\n * @brief binomial\\n * @docs docs/combinatorics/binomial.md\\n */\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nusing mint = modint<MOD>;\\nconst int MAX_N = 205;\\nmint dp[MAX_N][MAX_N][MAX_N][2];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n Binomial<mint> BINOM;\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n for (int& x : a) cin >> x;\\n\\n sort(a.rbegin(), a.rend());\\n vector<int> len(n);\\n int sum = 0;\\n for (int i = 0; i < n; i++) {\\n len[i] = to_string(a[i]).size();\\n sum += len[i];\\n }\\n vector<mint> power(sum + 1, 1);\\n for (int i = 0; i < sum; i++) power[i + 1] = power[i] * 10;\\n\\n // vector<vector<mint>> left(n + 1, vector<mint>(n + 1, 0)), right(n + 1, vector<mint>(n + 1, 0));\\n // left[0][0] = right[n][0] = 1;\\n // for (int i = 0; i < n; i++) {\\n // for (int j = 0; j <= sum; j++) {\\n // mint val = left[i][j];\\n // if (val == 0) continue;\\n // left[i + 1][j] += val * 2;\\n // left[i + 1][j + 1] += val * power[len[i]];\\n // }\\n // }\\n // for (int i = n - 1; i >= 0; i--) {\\n // for (int j = 0; j <= sum; j++) {\\n // mint val = right[i + 1][j];\\n // if (val == 0) continue;\\n // right[i][j] += val * 2;\\n // right[i][j + 1] += val * power[len[i]];\\n // }\\n // }\\n\\n // mint ans = 0;\\n // for (int i = 0; i < n; i++) {\\n // for (int j = 0; j <= i; j++) {\\n // if (left[i][j] == 0) continue;\\n // for (int k = 0; k <= n - 1 - i; k++) {\\n // ans += left[i][j] * right[i + 1][k] * a[i]*BINOM.P(j+k)*BINOM.P(N)\\n // }\\n // }\\n // }\\n\\n dp[0][0][0][0] = 1;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j <= i; j++) {\\n for (int k = 0; j + k <= i; k++) {\\n for (int l = 0; l < 2; l++) {\\n mint val = dp[i][j][k][l];\\n if (val == 0) continue;\\n dp[i + 1][j][k][l] += val;\\n if (l == 0) dp[i + 1][j][k][1] += val * a[i];\\n dp[i + 1][j + 1][k][l] += val;\\n dp[i + 1][j][k + 1][l] += val * power[len[i]];\\n }\\n }\\n }\\n }\\n mint ans = 0;\\n for (int j = 0; j <= n; j++) {\\n for (int k = 0; j + k <= n; k++) {\\n ans += dp[n][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\\n }\\n }\\n if (a.back() == 0) {\\n for (int j = 0; j <= n; j++) {\\n for (int k = 0; j + k <= n; k++) {\\n ans -= dp[n - 1][j][k][1] * BINOM.fac(j) * BINOM.fac(k);\\n }\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 67436,\n \"score_of_the_acc\": -0.5023,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2436_6020618\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#include<ext/pb_ds/assoc_container.hpp>\\nusing namespace __gnu_pbds;\\n\\ntemplate<class T>\\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag,\\ntree_order_statistics_node_update>;\\n// usage:\\n// ordered_set::find_by_order (access)\\n// ordered_set::order_of_key (lower_bound)\\n\\ntemplate<class K, class V>\\nusing hashmap = gp_hash_table<K, V>;\\n\\n#define REP(i, n) for (int i = 0; i < int(n); ++i)\\n#define ALL(x) begin(x), end(x)\\n#define DUMP(x) cerr << #x << \\\" = \\\" << (x) << endl\\n//#define ASSERT(x) while (!(x)) {}\\n#define ASSERT(x) assert(x)\\n\\nstruct fast_ios {\\n fast_ios() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n };\\n} fast_ios_;\\n\\nusing ll = long long;\\n\\ntemplate <class T> bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T> bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T> ostream& operator<<(ostream& os, const vector<T>& v);\\ntemplate <class T, class U>\\nostream& operator<<(ostream& os, const pair<T, U>& p);\\ntemplate <class T, class U>\\nostream& operator<<(ostream& os, const map<T, U>& mp);\\n\\ntemplate <class T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n os << '[';\\n REP(i, v.size()) {\\n if (i) os << ',';\\n os << v[i];\\n }\\n return os << ']';\\n}\\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> ostream& operator<<(ostream& os, const set<T>& st) {\\n os << '{';\\n int a = 0;\\n for (const auto& e : st) {\\n if (a) os << ' ';\\n a = 1;\\n os << e;\\n }\\n return os << '}';\\n}\\n\\ntemplate <class T, class U>\\nostream& operator<<(ostream& os, const map<T, U>& mp) {\\n os << '{';\\n int a = 0;\\n for (const auto& p : mp) {\\n if (a) os << ' ';\\n a = 1;\\n os << p;\\n }\\n return os << '}';\\n}\\n\\nconst int INF = numeric_limits<int>::max();\\nconst ll LINF = numeric_limits<ll>::max();\\n\\n\\ntemplate<typename T>\\nstruct Combination {\\n std::vector<T> _fact, _rfact, _inv;\\n\\n explicit 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\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n\\n#include <utility>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n unsigned int umod() const { return _m; }\\n\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\n\\nint main() {\\n int n; cin >> n;\\n vector<int> a(n);\\n vector<int> len(n);\\n REP(i, n) {\\n string s; cin >> s;\\n len[i] = s.size();\\n a[i] = stoi(s);\\n }\\n\\n\\n int len_sum = accumulate(ALL(len), 0);\\n\\n int total_zero = 0;\\n REP(i, n) total_zero += (a[i] == 0);\\n\\n using mint = modint1000000007;\\n using vi = vector<mint>;\\n using vvi = vector<vi>;\\n using vvvi = vector<vvi>;\\n\\n mint ans = 0;\\n\\n Combination<mint> comb(n+1);\\n\\n REP(i, n) {\\n vvvi dp(n+1, vvi(n, vi(total_zero+1)));\\n dp[0][0][0] = 1;\\n REP(j, n) {\\n if (j == i) {\\n dp[j+1] = dp[j];\\n continue;\\n }\\n\\n REP(k, n) {\\n // k := 選んだ個数\\n REP(l, total_zero+1) {\\n // l := 選んだ 0 の個数\\n\\n // 使わない\\n dp[j+1][k][l] += dp[j][k][l];\\n // 使う\\n if (k+1 < n and l + (a[j] == 0) <= total_zero) {\\n dp[j+1][k+1][l + (a[j] == 0)] += dp[j][k][l] * mint(10).pow(len[j]);\\n }\\n }\\n }\\n }\\n\\n mint total = 0;\\n REP(k, n) {\\n // k := 選んだ個数\\n\\n mint tmp = 0;\\n\\n for (int l = 1; l <= n-1-k; l++) {\\n tmp += comb.P(n-1-k, l);\\n }\\n\\n REP(l, total_zero+1) {\\n // l := 選んだ 0 の個数\\n\\n if (dp[n][k][l].val() == 0) continue;\\n\\n if (n-1-k == 0) {\\n total += dp[n][k][l] * comb.fact(k);\\n } else {\\n mint ratio = 1 + tmp * (n - 1 - k - (total_zero - (a[i] == 0) - l)) / (n - 1 - k);\\n total += dp[n][k][l] * ratio * comb.fact(k);\\n }\\n }\\n }\\n\\n ans += total * a[i];\\n }\\n\\n cout << ans.val() << endl;\\n};\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 5612,\n \"score_of_the_acc\": -0.1849,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2436_6018234\",\n \"code_snippet\": \"#include<bits/stdc++.h> \\nusing namespace std;\\nusing ll=long long int;\\n//using Int=__int128;\\n#define ALL(A) A.begin(),A.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;}\\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\\n//→ ↓ ← ↑ \\nint dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\\n//右上から時計回り\\n//int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0};\\nlong double EPS = 1e-6;\\nlong double PI = acos(-1);\\nconst ll INF=(1LL<<62);\\nconst int MAX=(1<<30);\\nconstexpr ll MOD=1000000000+7;\\n//constexpr ll MOD=998244353;\\n\\n\\ninline void bin101(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n}\\n\\nusing pii=pair<int,int>;\\nusing pil=pair<int,ll>;\\nusing pli=pair<ll,int>;\\nusing pll=pair<ll,ll>;\\nusing psi=pair<string,int>;\\nusing pis=pair<int,string>;\\nusing psl=pair<string,ll>;\\nusing pls=pair<ll,string>;\\nusing pss=pair<string,string>;\\n\\nusing Graph=vector<vector<int>>;\\n\\ntemplate<typename T >\\nstruct edge {\\n\\tint to;\\n\\tT cost;\\n\\tedge()=default;\\n\\tedge(int to, T cost) : to(to), cost(cost) {}\\n\\n};\\ntemplate<typename T>\\nusing WeightGraph=vector<vector<edge<T>>>;\\n\\ntemplate<typename T>\\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n T cost;\\n cin>>s>>t>>cost;\\n if(index1) s--,t--;\\n g[s].emplace_back(t,cost);\\n if(not directed) g[t].emplace_back(s,cost);\\n }\\n}\\n\\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n cin>>s>>t;\\n if(index1) s--,t--;\\n g[s].push_back(t);\\n if(not directed) g[t].push_back(s);\\n }\\n}\\n\\n\\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<T> &v) {\\n for(size_t i=0;i<v.size();i++) is>>v[i];\\n\\treturn is;\\n}\\n \\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n is>>v[i];\\n }\\n return is;\\n}\\n//vector cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\\n for(size_t i=0;i<v.size();i++){\\n if(i) os<<\\\" \\\";\\n os<<v[i];\\n }\\n return os;\\n}\\n//vector<vector> cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n os<<v[i];\\n if(i+1!=v.size()) os<<\\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\n//Graph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const Graph &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(int to:g[i]){\\n os<<i<<\\\"->\\\"<<to<<\\\" \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n//WeightGraph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n os<<i<<\\\"->\\\"<<e.to<<\\\"(\\\"<<e.cost<<\\\") \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n\\treturn vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n\\tauto v=vmake(args...);\\n\\treturn vector<decltype(v)>(n,move(v));\\n}\\ntemplate<typename V,typename T>\\nvoid fill(V &v,const T value){\\n v=value;\\n}\\n\\ntemplate<typename V,typename T>\\nvoid fill(vector<V> &vec,const T value){\\n for(auto &v:vec) fill(v,value);\\n}\\n\\n//pair cout\\ntemplate<typename T, typename U>\\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\\n\\tos<<p.first<<\\\" \\\"<<p.second;\\n\\treturn os;\\n}\\n \\n//pair cin\\ntemplate<typename T, typename U>\\ninline istream &operator>>(istream &is,pair<T,U> &p) {\\n\\tis>>p.first>>p.second;\\n\\treturn is;\\n}\\n \\n//ソート\\ntemplate<typename T>\\ninline void vsort(vector<T> &v){\\n sort(v.begin(),v.end());\\n}\\n \\n//逆順ソート\\ntemplate<typename T>\\ninline void rvsort(vector<T> &v){\\n\\tsort(v.rbegin(),v.rend());\\n}\\n\\n//1ビットの数を返す\\ninline int popcount(int x){\\n\\treturn __builtin_popcount(x);\\n}\\n//1ビットの数を返す\\ninline int popcount(ll x){\\n\\treturn __builtin_popcountll(x);\\n}\\ntemplate<typename T>\\ninline void Compress(vector<T> &C){\\n sort(C.begin(),C.end());\\n C.erase(unique(C.begin(),C.end()),C.end());\\n}\\ntemplate<typename T>\\ninline int lower_idx(const vector<T> &C,T value){\\n return lower_bound(C.begin(),C.end(),value)-C.begin();\\n}\\ntemplate<typename T>\\ninline int upper_idx(const vector<T> &C,T value){\\n return upper_bound(C.begin(),C.end(),value)-C.begin();\\n}\\n//時計回りに90度回転\\ntemplate<typename T>\\ninline void rotate90(vector<vector<T>> &C){\\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\\n for(int h=0;h<C.size();h++){\\n for(int w=0;w<C[h].size();w++){\\n D[w][C.size()-1-h]=C[h][w];\\n }\\n }\\n C=D;\\n}\\n//補グラフを返す\\n//i→iのような辺は加えない\\nGraph ComplementGraph(const Graph &g){\\n size_t sz=g.size();\\n bool used[sz][sz];\\n fill(used[0],used[sz],false);\\n for(size_t i=0;i<sz;i++){\\n for(int to:g[i]){\\n used[i][to]=true;\\n }\\n }\\n Graph ret(sz);\\n for(size_t i=0;i<sz;i++){\\n for(size_t j=0;j<sz;j++){\\n if(used[i][j]) continue;\\n if(i==j) continue;\\n ret[i].push_back(j);\\n }\\n }\\n return ret;\\n}\\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\\n//無効グラフのみに対応\\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\\n vector<Graph> ret;\\n vector<int> now;\\n for(size_t i=0;i<g.size();i++){\\n if(id[i].first!=-1) continue;\\n id[i].first=ret.size();\\n id[i].second=0;\\n now.push_back(i);\\n for(size_t j=0;j<now.size();j++){\\n for(int to:g[now[j]]){\\n if(id[to].first==-1){\\n id[to].first=ret.size();\\n id[to].second=now.size();\\n now.push_back(to);\\n }\\n }\\n }\\n Graph r(now.size());\\n for(size_t j=0;j<now.size();j++){\\n r[j]=g[now[j]];\\n for(int &to:r[j]){\\n to=id[to].second;\\n }\\n }\\n ret.push_back(r);\\n now.clear();\\n }\\n return make_pair(ret,id);\\n}\\n//0indexを想定\\nbool OutGrid(ll h,ll w,ll H,ll W){\\n return (h>=H or w>=W or h<0 or w<0);\\n}\\n\\nvoid NO(){\\n cout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n}\\nvoid YES(){\\n cout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n}\\nvoid No(){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n}\\nvoid Yes(){\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n}\\nnamespace overflow{\\n template<typename T>\\n T max(){\\n return numeric_limits<T>::max();\\n }\\n template<typename T>\\n T ADD(T a,T b){\\n T res;\\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\\n }\\n template<typename T>\\n T MUL(T a,T b){\\n T res;\\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\\n }\\n};\\nusing namespace overflow;\\nstruct ModInt{\\n using u64=uint_fast64_t;\\n u64 a;\\n constexpr ModInt() :a(0){}\\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\\n\\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\\n return ModInt(*this)+=rhs;\\n }\\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\\n return ModInt(*this)-=rhs;\\n }\\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\\n return ModInt(*this)*=rhs;\\n }\\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\\n return ModInt(*this)/=rhs;\\n }\\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\\n return ModInt(*this)+=ModInt(rhs);\\n }\\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\\n return ModInt(*this)-=ModInt(rhs);\\n }\\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\\n return ModInt(*this)*=ModInt(rhs);\\n }\\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\\n return ModInt(*this)/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\\n a+=rhs.a;\\n if(a>=MOD) a-=MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\\n if(rhs.a>a) a+=MOD;\\n a-=rhs.a;\\n return *this;\\n }\\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\\n a=(a*rhs.a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\\n a=(a*rhs.inverse().a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\\n return *this+=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\\n return *this-=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\\n return *this*=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\\n return *this/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt operator=(const ll x)noexcept{\\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\\n return *this;\\n }\\n\\n inline constexpr bool operator==(const ModInt p)const noexcept{\\n return a==p.a;\\n }\\n\\n inline constexpr bool operator!=(const ModInt p)const noexcept{\\n return a!=p.a;\\n }\\n\\n inline constexpr ModInt pow(ll N) const noexcept{\\n ModInt ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline constexpr ModInt inverse() const noexcept{\\n return pow(MOD-2);\\n }\\n\\n};\\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)+=b;\\n}\\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)-=b;\\n}\\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)*=b;\\n}\\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const ModInt &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,ModInt &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\n\\nstruct Binominal{\\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\\n int sz;\\n Binominal(int n=10) :sz(1){\\n if(n<=0) n=10;\\n init(n);\\n }\\n inline void init(int n){\\n fac.resize(n+1,1);\\n finv.resize(n+1,1);\\n inv.resize(n+1,1);\\n for(int i=sz+1;i<=n;i++){\\n fac[i]=fac[i-1]*i;\\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\\n finv[i]=finv[i-1]*inv[i];\\n }\\n sz=n;\\n }\\n //nCk(n,k<=N) をO(1)で求める\\n inline ModInt com(int n,int k){\\n if(n<k) return ModInt(0);\\n if(n<0 || k<0) return ModInt(0);\\n if(n>sz) init(n);\\n return fac[n]*finv[k]*finv[n-k];\\n }\\n //nCk(k<=N) をO(k) で求める \\n inline ModInt rcom(ll n,int k){\\n if(n<0 || k<0 || n<k) return ModInt(0);\\n if(k>sz) init(k);\\n ModInt ret(1);\\n for(int i=0;i<k;i++){\\n ret*=n-i;\\n }\\n ret*=finv[k];\\n return ret;\\n }\\n\\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\\n //〇がn個,|がk個\\n inline ModInt h(int n,int k){\\n return com(n+k-1,k);\\n }\\n};\\nvector<int> Subset(int S,bool zero=false,bool full=false){\\n vector<int> ret;\\n int now=(S-1)&S;\\n if(full and S){\\n ret.push_back(S);\\n }\\n do{\\n ret.push_back(now);\\n now=(now-1)&S;\\n }while(now!=0);\\n if(zero){\\n ret.push_back(0);\\n }\\n return ret;\\n}\\ntemplate<typename T>\\nT SUM(const vector<T> &v,int s,int t){\\n chmax(s,0);\\n chmin(t,int(v.size())-1);\\n if(s>t) return 0;\\n if(s==0) return v[t];\\n else return v[t]-v[s-1];\\n}\\ntemplate<typename T>\\nvoid buildSUM(vector<T> &v){\\n for(size_t i=1;i<v.size();i++){\\n v[i]+=v[i-1];\\n }\\n return;\\n}\\n\\n\\nvoid solve(){\\n int N; cin>>N;\\n vector<ModInt> a(N); cin>>a;\\n vector<int> sz(N);\\n int zero=0;\\n for(int i=0;i<N;i++){\\n if(a[i]==0){\\n zero++;\\n break;\\n }\\n }\\n for(int i=0;i<N;i++){\\n sz[i]=to_string(a[i].a).size();\\n }\\n Binominal B(100000);\\n vector<ModInt> ten(1e6);\\n ten[0]=1;\\n for(int i=1;i<ten.size();i++) ten[i]=ten[i-1]*10;\\n auto A=vmake(N+1,2,ModInt());\\n for(int i=0;i<=N;i++){\\n for(int j=0;j<=i;j++){\\n A[i][0]+=B.com(i,j)*B.fac[j];\\n }\\n for(int j=0;j<i;j++){\\n auto x=B.com(i-1,j)*B.fac[j];\\n A[i][1]+=(x)*(1+j);\\n }\\n }\\n ModInt ans;\\n map<pii,ModInt> M;\\n for(int i=0;i<N;i++){\\n if(M.count(pii(sz[i],a[i]==0))){\\n continue;\\n }\\n pii id=pii(sz[i],a[i]==0);\\n //j k used\\n //i 桁数 個数 ゼロを使ったか:何個か\\n auto dp=vmake(2,(N+1)*5,N+1,2,ModInt());\\n dp[0][0][0][0]=1;\\n for(int j=0;j<N;j++){\\n int J=j%2;\\n //cerr<<\\\" \\\"<<j<<endl;\\n fill(dp[1-J],0);\\n for(int k=0;k<(N+1)*5;k++){\\n for(int used=0;used<=j;used++){\\n for(int z=0;z<2;z++){\\n //cerr<<J<<endl;\\n if(dp[J][k][used][z].a==0) continue;\\n\\n if(j!=i){\\n dp[1-J][k+sz[j]][used+1][(a[j]==0)|z]+=dp[J][k][used][z];\\n }\\n dp[1-J][k][used][z]+=dp[J][k][used][z];\\n }\\n }\\n }\\n }\\n for(int k=0;k<(N+1)*5;k++){\\n for(int used=0;used<=N;used++){\\n for(int z=0;z<2;z++){\\n auto x=dp[N%2][k][used][z]*ten[k];\\n if(x.a==0) continue;\\n int nokori=N-1-used;\\n if(zero and z==0){\\n M[id]+=x*A[nokori][1]*B.fac[used];\\n }else{\\n M[id]+=x*A[nokori][0]*B.fac[used];\\n }\\n }\\n }\\n }\\n }\\n for(int i=0;i<N;i++){\\n ans+=a[i]*M[pii(sz[i],a[i]==0)];\\n }\\n cout<<ans<<endl;\\n}\\n\\nint main(){\\n bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 46356,\n \"score_of_the_acc\": -0.8312,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2436_5997933\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <int mod = (int)(1e9 + 7)>\\nstruct ModInt {\\n int x;\\n ModInt() : x(0) {}\\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n ModInt &operator+=(const ModInt &p) {\\n if ((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator-=(const ModInt &p) {\\n if ((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n ModInt &operator*=(const ModInt &p) {\\n x = (int)(1LL * x * p.x % mod);\\n return *this;\\n }\\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n ModInt operator-() const { return ModInt(-x); }\\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n bool operator==(const ModInt &p) const { return x == p.x; }\\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n ModInt pow(int64_t n) const {\\n ModInt res(1), mul(x);\\n while (n) {\\n if (n & 1) res *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return res;\\n }\\n friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt<mod>(t);\\n return (is);\\n }\\n static int get_mod() { return mod; }\\n};\\n\\nstruct Combination {\\n vector<ModInt<>> _fact, _rfact, _inv;\\n Combination(long long nsize = 5000000)\\n : _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {\\n _fact[0] = _rfact[nsize] = _inv[0] = 1;\\n for (int i = 1; i <= nsize; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[nsize] /= _fact[nsize];\\n for (int i = nsize - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for (int i = 1; i <= nsize; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n inline ModInt<> fact(int k) const { return _fact[k]; }\\n\\n inline ModInt<> rfact(int k) const { return _rfact[k]; }\\n\\n inline ModInt<> inv(int k) const { return _inv[k]; }\\n\\n ModInt<> P(int n, int r) const {\\n if (r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n\\n ModInt<> C(int p, int q) const {\\n if (q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n\\n ModInt<> largeC(long long p, long long q) const {\\n if (q < 0 || p < q) return 0;\\n if (q >= (long long)_fact.size()) q = p - q;\\n // if (q >= (long long)5000) q = p - q;\\n ModInt<> res = rfact(q);\\n for (int i = 0; i < q; ++i) res *= p - i;\\n return res;\\n }\\n\\n // n types,choose r\\n ModInt<> H(int n, int r) const {\\n if (n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n\\n ModInt<> largeH(long long n, long long r) const {\\n if (n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : largeC(n + r - 1, r);\\n }\\n\\n ModInt<> Catalan(int n) {\\n // C(2n,n) / (n + 1)\\n return fact(2 * n) * rfact(n + 1) * rfact(n);\\n }\\n};\\nusing mint = ModInt<>;\\n\\nint n, zero = 0;\\nvector<int> cnt(5, 0), sum(5, 0);\\nvector<mint> ten, perm;\\nCombination com;\\n\\nmint solve();\\nmint calc();\\n\\nint main() {\\n cin >> n;\\n for (int i = 0; i < n; ++i) {\\n int a;\\n cin >> a;\\n int len = to_string(a).size();\\n ++cnt[len];\\n sum[len] += a;\\n zero |= !a;\\n }\\n cout << solve() << endl;\\n return 0;\\n}\\n\\nmint solve() {\\n {\\n for (int i = 0; i <= n; ++i) {\\n mint now = 0;\\n for (int j = 0; j <= i; ++j) now += com.P(i, j);\\n perm.push_back(now);\\n }\\n ten.assign(1, 1);\\n for (int i = 0; i < 3000000; ++i) ten.push_back(ten.back() * 10);\\n }\\n mint res = calc();\\n if (zero) {\\n --n, --cnt[1];\\n res -= calc();\\n }\\n return res;\\n}\\n\\nmint calc() {\\n mint res = 0;\\n for (int dig = 1; dig <= 4; ++dig)\\n if (cnt[dig]) {\\n vector<vector<mint>> dp(n + 1, vector<mint>(4 * n + 1, 0));\\n --cnt[dig];\\n dp[0][0] = 1;\\n for (int nd = 1; nd <= 4; ++nd)\\n for (int i = n; i >= 0; --i)\\n for (int j = 4 * n; j >= 0; --j)\\n for (int k = 1; k <= cnt[nd] && i + k <= n && j + k * nd <= 4 * n;\\n ++k)\\n dp[i + k][j + k * nd] += dp[i][j] * com.C(cnt[nd], k);\\n for (int i = 0; i < n; ++i)\\n for (int j = 0; j <= 4 * n; ++j)\\n res += perm[n - 1 - i] * sum[dig] * dp[i][j] * ten[j] * com.fact(i);\\n ++cnt[dig];\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 80036,\n \"score_of_the_acc\": -1.0959,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2436_5897356\",\n \"code_snippet\": \"#pragma GCC target(\\\"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()\\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-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n 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/all>\\n//using namespace atcoder;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\ntemplate <int mod> struct 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 mint = ModInt<mod>;\\n\\nvector<ll> fac(MAX), finv(MAX), inv(MAX);\\n\\nvoid comInit(){\\n fac[0] = fac[1] = 1;\\n finv[0] = finv[1] = 1;\\n inv[1] = 1;\\n for(ll i=2; i<MAX; i++){\\n fac[i] = fac[i-1]*i % mod;\\n inv[i] = mod - inv[mod%i] * (mod/i) % mod;\\n finv[i] = finv[i-1] * inv[i] % mod;\\n }\\n}\\n\\n\\nll com(ll n, ll k){\\n if(n < k) return 0;\\n if(n < 0 || k < 0) return 0;\\n return fac[n] * (finv[k] * finv[n-k] % mod) % mod;\\n}\\n\\nmint dp[202][202];\\nmint ep[202][202];\\nmint mul[202];\\nmint p[10];\\n\\nint main(){\\n int n; cin >> n;\\n vl a(n); rep(i,n) cin >> a[i];\\n comInit();\\n sort(all(a));\\n int zero = 0;\\n dp[0][0] = ep[n][0] = 1;\\n p[0] = 1;\\n rep(i,8) p[i+1] = p[i] * 10;\\n rep(i,n+1) rep(j,i+1) mul[i] += com(i,j) * fac[j] % mod;\\n rep(i,n){\\n int sz = to_string(a[i]).size();\\n rep(j,n+1){\\n dp[i+1][j] += dp[i][j];\\n if(a[i] != 0) dp[i+1][j+1] += dp[i][j] * p[sz];\\n }\\n }\\n for(int i=n-1; i>=0; i--){\\n int sz = to_string(a[i]).size();\\n rep(j,n+1){\\n ep[i][j] += ep[i+1][j];\\n ep[i][j+1] += ep[i+1][j] * p[sz];\\n }\\n }\\n mint ans = 0, mi = 0;\\n rep(i,n){\\n if(a[i] == 0){\\n zero++;\\n continue;\\n }\\n rep(j,n+1) rep(k,n-j){\\n mint r1 = dp[i][j] * ep[i+1][k] * 10 * fac[j+k+1];\\n mint r2 = dp[i][j] * ep[i+1][k] * fac[j+k]; \\n if(zero){\\n if(n-j-k-2>=0) ans += r1 * mul[n-j-k-2] * a[i];\\n }\\n ans += r2 * mul[n-j-k-1] * a[i];\\n if(n-j-k-2>=0 && zero) mi += r2 * mul[n-j-k-2] * a[i];\\n }\\n }\\n cout << ans - mi << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 15188,\n \"score_of_the_acc\": -0.1243,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2436_5865657\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.09 18:00:06 */\\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\\n#pragma region modint\\n\\nconst int mod = mod_1000000007;\\n\\ntemplate <int mod>\\nstruct ModInt {\\n\\tint x;\\n\\tModInt() : x(0) {}\\n\\tModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n\\tModInt &operator+=(const ModInt &p) {\\n\\t\\tif((x += p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator-=(const ModInt &p) {\\n\\t\\tif((x += mod - p.x) >= mod) x -= mod;\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator*=(const ModInt &p) {\\n\\t\\tx = (int)(1LL * x * p.x % mod);\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt &operator/=(const ModInt &p) {\\n\\t\\t*this *= p.inverse();\\n\\t\\treturn *this;\\n\\t}\\n\\tModInt operator-() const { return ModInt(-x); }\\n\\tModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n\\tModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n\\tModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n\\tModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n\\tbool operator==(const ModInt &p) const { return x == p.x; }\\n\\tbool operator!=(const ModInt &p) const { return x != p.x; }\\n\\tModInt inverse() const {\\n\\t\\tint a = x, b = mod, u = 1, v = 0, t;\\n\\t\\twhile(b > 0) {\\n\\t\\t\\tt = a / b;\\n\\t\\t\\tswap(a -= t * b, b);\\n\\t\\t\\tswap(u -= t * v, v);\\n\\t\\t}\\n\\t\\treturn ModInt(u);\\n\\t}\\n\\tModInt pow(long long n) const {\\n\\t\\tModInt ret(1), mul(x);\\n\\t\\twhile(n > 0) {\\n\\t\\t\\tif(n & 1) ret *= mul;\\n\\t\\t\\tmul *= mul;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tfriend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }\\n\\tfriend istream &operator>>(istream &is, ModInt &a) {\\n\\t\\tlong long t;\\n\\t\\tis >> t;\\n\\t\\ta = ModInt<mod>(t);\\n\\t\\treturn (is);\\n\\t}\\n\\tstatic int get_mod() { return mod; }\\n};\\nusing mint = ModInt<mod>;\\n\\n#pragma endregion\\n\\n#pragma region binomial_coefficient\\n\\n// normal binomial coefficient\\nvector<vector<long long>> binom_memo(100, vector<long long>(100, -1));\\nlong long binom(int n, int k) {\\n\\tassert(n < 100 && k < 100);\\n\\tif(n < k || k < 0 || n < 0) return 0;\\n\\tif(binom_memo[n][k] != -1) return binom_memo[n][k];\\n\\tlong long res;\\n\\tif(n - k < k)\\n\\t\\tres = binom(n, n - k);\\n\\telse if(k == 0)\\n\\t\\tres = 1;\\n\\telse\\n\\t\\tres = binom(n - 1, k - 1) + binom(n - 1, k);\\n\\tbinom_memo[n][k] = res;\\n\\treturn res;\\n}\\n\\nvector<long long> fac, finv, inv;\\nstruct mod_factorial {\\n\\tconst int MAX;\\t// time: 300ms, when MAX = 3*10^7, time: 1900ms\\n\\tmod_factorial(const int MAX_ = 5100000) : MAX(MAX_) {\\n\\t\\tfac.resize(MAX), finv.resize(MAX), inv.resize(MAX);\\n\\t\\tfac[0] = fac[1] = 1;\\n\\t\\tfinv[0] = finv[1] = 1;\\n\\t\\tinv[1] = 1;\\n\\t\\tfor(int i = 2; i < MAX; i++) {\\n\\t\\t\\tfac[i] = fac[i - 1] * i % mod;\\n\\t\\t\\tinv[i] = mod - inv[mod % i] * (mod / i) % mod;\\n\\t\\t\\tfinv[i] = finv[i - 1] * inv[i] % mod;\\n\\t\\t}\\n\\t}\\n} mod_factorial_;\\n\\nlong long com_mod(long long n, long long k) {\\n\\tif(n < k || n < 0 || k < 0) return 0;\\n\\treturn fac[n] * (finv[k] * finv[n - k] % mod) % mod;\\n}\\n\\nlong long permutation_mod(long long n, long long k) {\\n\\tif(n < k || n < 0 || k < 0) return 0;\\n\\treturn fac[n] * finv[n - k] % mod;\\n}\\n\\n// patterns of n of undistinguished balls in k of distinguished boxes\\nlong long multi_choose_mod(long long n, long long k) { return com_mod(n + k - 1, n); }\\n\\n#pragma endregion\\n\\nmint calc(int n, vector<int> a) {\\n\\tconst int len_max = 812;\\n\\tconst int use_max = n + 1;\\n\\tconst int dig_max = 5;\\n\\tvector<int> len_cnt(dig_max);\\n\\trep(i, n) { len_cnt[int((to_string(a[i])).size())]++; }\\n\\n\\tdebug(len_cnt);\\n\\n\\tVVV<mint> dp(dig_max, VV<mint>(use_max, V<mint>(len_max, mint(0))));\\n\\n\\trep(i, 1, dig_max) {\\n\\t\\tif(len_cnt[i] == 0) continue;\\n\\t\\tlen_cnt[i]--;\\n\\n\\t\\tauto &tmp = dp[i];\\n\\t\\ttmp[0][0] = 1;\\n\\n\\t\\trep(j, 1, dig_max) {\\n\\t\\t\\tdrep(k, use_max) drep(l, len_max) {\\n\\t\\t\\t\\tif(!tmp[k][l].x) continue;\\n\\n\\t\\t\\t\\t// debug(i, j, k, l, tmp[k][l]);\\n\\t\\t\\t\\trep(use_this_dig, 1, len_cnt[j] + 1) {\\n\\t\\t\\t\\t\\tint use_after = k + use_this_dig;\\n\\t\\t\\t\\t\\tint len_after = l + use_this_dig * j;\\n\\t\\t\\t\\t\\tif(len_after >= len_max || use_after >= use_max) continue;\\n\\t\\t\\t\\t\\t// debug(j, k, l, use_this_dig);\\n\\t\\t\\t\\t\\ttmp[use_after][len_after] += tmp[k][l] * com_mod(k + use_this_dig, k) * permutation_mod(len_cnt[j], use_this_dig);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tlen_cnt[i]++;\\n\\t}\\n\\tmint ret;\\n\\n\\tVV<mint> table(len_max + 10, V<mint>(len_max + 10)); // permute j out of i\\n\\trep(i, len_max + 10) rep(j, i + 1) {\\n\\t\\ttable[i][j] = 1;\\n\\t\\tif(i && j) table[i][j] += table[i - 1][j - 1] * j;\\n\\t}\\n\\n\\tV<mint> pw10(len_max + 10, 1);\\n\\trep(i, len_max + 9) pw10[i + 1] = pw10[i] * 10;\\n\\tV<mint> pw2(len_max + 10, 1);\\n\\trep(i, len_max + 9) pw2[i + 1] = pw2[i] * 2;\\n\\n\\trep(i, n) {\\n\\t\\tmint add = 0;\\n\\t\\tint len = int((to_string(a[i])).size());\\n\\n\\t\\tauto &tmp = dp[len];\\n\\n\\t\\trep(j, use_max) rep(k, len_max) {\\n\\t\\t\\tif(1 + j > n) break;\\n\\t\\t\\tif(!tmp[j][k].x) continue;\\n\\t\\t\\tadd += pw10[k] * tmp[j][k] * table[n - 1 - j][n - 1 - j];\\n\\n\\t\\t\\tdebug(n, i, j, k);\\n\\t\\t\\tdebug(tmp[j][k], table[n - 1 - j][n - 1 - j]);\\n\\t\\t}\\n\\n\\t\\tdebug(i, a[i], add);\\n\\t\\tret += add * a[i];\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nmint solve(int n, vector<int> a) {\\n\\tsort(all(a));\\n\\tmint ret = calc(n, a);\\n\\n\\tif(a[0] == 0) {\\n\\t\\tif(!n) return 0;\\n\\t\\ta.erase(a.begin());\\n\\t\\tdebug(ret);\\n\\t\\tret -= calc(n - 1, a);\\n\\t\\tdebug(calc(n - 1, a));\\n\\t}\\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 n;\\n\\twhile(cin >> n && n) {\\n\\t\\tvi a(n);\\n\\t\\trep(i, n) cin >> a[i];\\n\\t\\tcout << solve(n, a) << dl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 128716,\n \"score_of_the_acc\": -1.0817,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2436_5721917\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\nusing namespace std;\\nusing ll = long long;\\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; }\\nconst ll mod = 1000000007;\\nconst int fact_size = 1000000;\\n\\nint n, m;\\nll dp[202][1111][2], G[1111], ten[1111];\\nll fact[fact_size], inv[fact_size], factinv[fact_size];\\n\\n\\nlong long ext_gcd(long long a, long long b, long long& x, long long& y) {\\n if(b==0){ x=1; y=0; return a; }\\n long long q = a/b;\\n long long d = ext_gcd(b, a-q*b, x, y);\\n long long z = x - q*y;\\n x = y; y = z;\\n return d;\\n}\\n\\nlong long invmod(long long a, long long p) {\\n long long x, y;\\n ext_gcd(a, p, x, y);\\n x %= p;\\n if (x < 0) x+=p;\\n return x;\\n}\\n\\nlong long modpow(long long a, long long n, long long p) {\\n if (n==0) return 1LL;\\n if (n&1) return modpow(a, n-1, p) * a % p;\\n long long tmp = modpow(a, n/2, p);\\n return tmp * tmp % p;\\n}\\n\\nvoid fact_init() {\\n fact[0] = fact[1] = 1;\\n for(int i=2; i<fact_size; ++i) fact[i] = fact[i-1] * i % mod;\\n factinv[fact_size-1] = modpow(fact[fact_size-1], mod-2, mod);\\n for(int i=fact_size-2; i>=0; --i) factinv[i] = factinv[i+1] * (i+1) % mod;\\n}\\n\\nll comb(int n, int k) {\\n if (k<0 || k>n) return 0;\\n return fact[n] * factinv[k] % mod * factinv[n-k] % mod;\\n}\\n\\nll nPk(int n, int k) {\\n if (k<0 || k>n) return 0;\\n return fact[n] * factinv[n-k] % mod;\\n}\\n\\n\\nvoid add(int a) {\\n int len = to_string(a).size();\\n for(int i=n; i>0; --i) {\\n for(int j=len; j<=m; ++j) {\\n for(int k=0; k<2; ++k) {\\n int nk = k;\\n if (a==0) nk = 1;\\n dp[i][j][nk] += dp[i-1][j-len][k];\\n dp[i][j][nk] %= mod;\\n }\\n }\\n }\\n}\\n\\nvoid sub(int a) {\\n int len = to_string(a).size();\\n for(int i=1; i<=n; ++i) {\\n for(int j=len; j<=m; ++j) {\\n for(int k=0; k<2; ++k) {\\n dp[i][j][k] -= dp[i-1][j-len][k];\\n if (dp[i][j][k]<0) dp[i][j][k] += mod;\\n }\\n }\\n }\\n}\\n\\nll arange(int n, bool zero) {\\n if (n==0) return 1;\\n ll res = G[n];\\n if (zero) {\\n res -= G[n-1];\\n if (res < 0) res += mod;\\n }\\n return res;\\n}\\n\\n\\nll solve() {\\n cin >> n;\\n bool zero = false;\\n\\n vector<int> A(n);\\n for(int i=0; i<n; ++i) {\\n cin>>A[i];\\n m += to_string(A[i]).size();\\n if (A[i]==0) zero = true;\\n }\\n\\n ten[0] = 1;\\n for(int i=1; i<=m; ++i) ten[i] = ten[i-1]*10%mod;\\n for(int i=0; i<=n; ++i) for(int j=0; j<=i; ++j) G[i] = (G[i] + nPk(i, j)) % mod;\\n\\n dp[0][0][0] = 1;\\n for(int a: A) add(a);\\n\\n ll ans = 0;\\n for(int a: A) {\\n if(a==0) continue;\\n sub(a);\\n\\n for(int i=0; i<n; ++i) {\\n for(int j=0; j<m; ++j) {\\n for(int k=0; k<2; ++k) {\\n if(dp[i][j][k] == 0) continue;\\n ll val = a * ten[j] % mod;\\n val = val * fact[i] % mod;\\n val = val * dp[i][j][k] % mod;\\n val = val * arange(n-1-i, zero&(k==0)) % mod;\\n ans = (ans + val) % mod;\\n }\\n }\\n }\\n add(a);\\n }\\n return ans;\\n}\\n\\nint main() {\\n fact_init();\\n cout << solve() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 24236,\n \"score_of_the_acc\": -0.266,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1395,"cells":{"group_id":{"kind":"string","value":"aoj_2432_cpp"},"problem_description":{"kind":"string","value":"Sports Days 2.0\n会津大学附属小学校（会津大小）は日本有数の競技プログラマー養成校として有名である。\nもちろん、運動会に参加しているときでさえアルゴリズムの修行を欠かせない。\n競技プログラミング部部長のあなたはもちろんこの大会でも勝利したい。\n今回はある競技に注目する。\nある競技とは会津大小で行われている伝統的な競技だ。\n校庭にコーンが\nV\n個置いてある。\nコーンのいくつかのペアは白線で描かれた矢印で結ばれている。\n矢印の先は片側だけについており、整数が併記されている。\n同じコーンのペアがの複数の矢印に結ばれている場合もある。\n競技者は任意にコーンを選び、移動開始する。\n移動は競技者がいるコーンから矢印の上をその向きに移動し、次のコーンへ移る。\n同じコーン、同じ矢印を何度も辿っても良い。\n競技者はコーンからコーンへの移動後、さらに移動するか移動を終了をするかを選択することができる。\nこの競技の目的は矢印を辿ることにより、スコアをK以上にすることである。\nスコアは矢印を辿る度に併記された整数値が加算されていく。\nより少ない経由する矢印の本数でスコアを\nK\n以上にした競技者が勝利となる。\n矢印が同じ本数の場合はより高いスコアの競技者が勝利となる。\nこのルールで最適な動きを競技者が行った場合、何本の矢印を経由すべきか出力せよ。\nまた、経由した矢印の数が100本以下の場合、経由すべきコーンを順にすべて出力せよ。\n最適な動きが複数存在する場合があるが、どの動きの結果を出力しても良い。\nスコアを\nK\n以上にする動きが存在しない場合は-1を出力せよ。\nまた、コーンにはすべて0から\nV-1\nまでの番号が振られており、\n色はすべて緑色（意味深）である。\nInput\n入力は以下の形式で与えられる。\nV\nE\nK\nv\n11\nv\n12\nc\n1\n...\nv\ni1\nv\ni2\nc\ni\n...\nv\nE1\nv\nE2\nc\nE\nここで、\nV\nはコーンの数\nE\nは矢印の数\nv\ni,1\nは矢印\ni\nの始点のコーン番号\nv\ni2\nは矢印\ni\nの終点のコーン番号\nc\ni\nは矢印に併記されている整数\nである。\nConstraints\n入力は以下の条件を満たす。\n入力はすべて整数\n2≤V≤150\n0≤E≤V×V\n0<K≤10\n6\n0≤ v\ni1\n, v\ni2\n< V (0<i≤E)\nv\ni1\n≠ v\ni2\n(0<i≤E)\n0<c\ni\n≤ 100 (0<i≤E)\nv\ni1\n= v\nj1\nかつ\nv\ni2\n= v\nj2\n(i ≠ j, 0<i,j≤E)\nとなるような\ni, j\nが含まれる入力も存在する。\nOutput\n出力は2行からなる。\n1行目 最適な動きを行った場合の経由する矢印の本数で出力\n2行目 経由すべきコーンの番号を経由する順番に空白区切りで出力\n最適な動きが複数存在する場合があるが、どの動きの結果を出力しても良い。\n経由すべき矢印の本数が100本を越える場合、2行目は出力してはいけない。\nスコアを\nK\n以上にする最適な動きが存在しない場合は-1を1行目に出力し、\n2行目に何も出力してはいけない。\nSample Input 1\n3 9 89\n2 0 2\n1 0 3\n2 0 1\n2 0 3\n0 1 1\n0 1 2\n1 2 3\n0 1 1\n1 0 2\nOutput for the Sample Input 1\n34\n1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 0\nSample Input 2\n2 0 1\nOutput for the Sample Input 2\n-1\nSample Input 3\n7 8 4000\n0 1 1\n1 0 1\n1 2 2\n2 3 2\n3 4 2\n5 4 3\n3 5 4\n5 6 5\nOutput for the Sample Input 3\n3991"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2432_10848636","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>;\nusing P3 = pair<int,P>;\nusing PP = pair<P, P>;\nconstexpr int INF32 = 1 << 30;\nconstexpr ll INF64 = 1LL << 62;\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\nll V, E, K;\nconst int T = 29;\nll C[150][150][T+1];\n\nvoid init(){\n for(int t=0;t<T;t++){\n REP(i,V) REP(j,V) REP(k,V){\n if(C[i][k][t] >= 0 && C[k][j][t] >= 0){\n chmax(C[i][j][t+1], C[i][k][t]+C[k][j][t]);\n }\n }\n }\n}\n\nll calc(ll n){\n ll res[150][150]{};\n REP(i,V) fill(res[i],res[i]+V,-INF64);\n REP(i,V) res[i][i] = 0;\n for(int t=0;t<T;t++){\n if((n>>t)&1){\n ll tmp[150][150]{};\n REP(i,V) fill(tmp[i],tmp[i]+V,-INF64);\n REP(i,V) REP(j,V) REP(k,V){\n if(C[k][j][t] >= 0){\n chmax(tmp[i][j], res[i][k]+C[k][j][t]);\n }\n }\n REP(i,V) REP(j,V) chmax(res[i][j],tmp[i][j]);\n }\n }\n ll ma = -1;\n REP(i,V) REP(j,V) chmax(ma, res[i][j]);\n // cout << n << endl;\n // REP(i,V){\n // REP(j,V){\n // cout << res[i][j] << \" \";\n // }\n // cout << endl;\n // }\n return ma;\n}\n\nvector<int> reconstruct(int n){\n ll rev[150][101]{}, scr[150]{};\n for(int t=0;t<n;t++){\n ll tmp[150]{};\n fill(tmp,tmp+V,-INF32);\n REP(i,V) REP(j,V){\n if(C[j][i][0]>=0 && chmax(tmp[i], scr[j]+C[j][i][0])){\n rev[i][t+1] = j;\n }\n }\n REP(i,V) scr[i] = tmp[i];\n }\n ll maxidx = -1, ma = -1;\n REP(i,V){\n if(chmax(ma, scr[i])) maxidx = i;\n }\n vector<int> v;\n v.push_back(maxidx);\n for(int t=n,now=maxidx;t>0;t--){\n v.push_back(rev[now][t]);\n now = rev[now][t];\n }\n reverse(ALL(v));\n return v;\n}\n\nint main(){\n cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);\n cin >> V >> E >> K;\n REP(i,V) REP(j,V) REP(k,T+1) C[i][j][k] = (i==j?0:-INF64);\n REP(i,E){\n int u, v, c;\n cin >> u >> v >> c;\n chmax(C[u][v][0], c);\n }\n init();\n ll ok = 1<<(T), ng = 0;\n while(abs(ok-ng)>1){\n int mid = (ok+ng)/2;\n if(calc(mid) >= K){\n ok = mid;\n }else{\n ng = mid;\n }\n }\n if(ok <= 100){\n cout << ok << endl;\n vector<int> ans = reconstruct(ok);\n for(int i=0;i<ok+1;i++){\n if(i>0) cout << \" \";\n cout << ans[i];\n }\n cout << endl;\n }else if(ok < 1<<T){\n cout << ok << endl;\n }else{\n cout << -1 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":1690,"memory_kb":9084,"score_of_the_acc":-1.75,"final_rank":11},{"submission_id":"aoj_2432_9796106","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\nvector<vector<int>> Mul(vector<vector<int>> A, vector<vector<int>> B) {\n int N = A.size();\n vector<vector<int>> Ret(N,vector<int>(N,-1));\n rep(i,0,N) Ret[i][i] = 0;\n rep(i,0,N) {\n rep(j,0,N) {\n rep(k,0,N) {\n if (A[i][j] >= 0 && B[j][k] >= 0) chmax(Ret[i][k],min(inf,A[i][j]+B[j][k]));\n }\n }\n }\n return Ret;\n}\n\nvector<vector<int>> Pow(vector<vector<int>> A, int X) {\n int N = A.size();\n if (X == 0) {\n vector<vector<int>> Ret(N,vector<int>(N,-1));\n rep(i,0,N) Ret[i][i] = 0;\n return Ret;\n }\n if (X % 2 == 0) {\n auto Ret = Pow(A,X/2);\n return Mul(Ret,Ret);\n }\n return Mul(A,Pow(A,X-1));\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector<vector<int>> D(N,vector<int>(N,-1));\n rep(i,0,N) D[i][i] = 0;\n vector<int> U(M), V(M), C(M);\n rep(i,0,M) {\n cin >> U[i] >> V[i] >> C[i];\n chmax(D[U[i]][V[i]],C[i]);\n }\n int NG = -1, OK = 1000001;\n while(OK - NG > 1) {\n int MID = (OK + NG) / 2;\n auto Ret = Pow(D,MID);\n bool check = false;\n rep(i,0,N) {\n rep(j,0,N) {\n if (Ret[i][j] >= K) check = true;\n }\n }\n if (check) OK = MID;\n else NG = MID;\n }\n if (OK == 1000001) {\n cout << -1 << endl;\n return 0;\n }\n if (OK > 100) {\n cout << OK << endl;\n return 0;\n }\n int MAX = 0;\n vector<vector<vector<int>>> DP(OK+1);\n DP[0] = Pow(D,0);\n rep(i,0,OK) DP[i+1] = Mul(DP[i],D);\n int S, G;\n rep(i,0,N) {\n rep(j,0,N) {\n if (DP[OK][i][j] >= K) {\n if (chmax(MAX,DP[OK][i][j])) {\n S = i, G = j;\n }\n }\n }\n }\n vector<int> ANS;\n ANS.push_back(G);\n rrep(i,0,OK) {\n rep(j,0,M) {\n if (V[j] != G) continue;\n if (min(inf,DP[i][S][U[j]] + C[j]) == DP[i+1][S][G]) {\n ANS.push_back(U[j]);\n G = U[j];\n break;\n }\n }\n }\n reverse(ALL(ANS));\n cout << OK << endl;\n rep(i,0,ANS.size()) cout << ANS[i] << (i == ANS.size()-1 ? '\\n' : ' ');\n}","accuracy":1,"time_ms":2200,"memory_kb":7860,"score_of_the_acc":-1.7643,"final_rank":12},{"submission_id":"aoj_2432_9468996","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nconst ll mod = 1e9 + 7;\n\nvvll mul(vvll A,vvll B){\n ll N=A.size();\n vvll R(N,vll(N,-1e18));\n rep(i,N)R[i][i]=0;\n rep(i,N)rep(j,N){\n rep(k,N)R[i][j]=max(R[i][j],A[i][k]+B[k][j]);\n }\n return R;\n}\n\nll f(vvll A,ll n){\n ll N=A.size();\n vvll E(N,vll(N,0));\n vvll B=A;\n while(n>0){\n if(n%2)E=mul(B,E);\n vvll NB=mul(B,B);\n rep(i,N)rep(j,N)B[i][j]=max(B[i][j],NB[i][j]);\n n/=2;\n }\n ll res=0;\n rep(i,N)rep(j,N)res=max(res,E[i][j]);\n return res;\n}\n\nint main() {\n ll N,M,K;\n cin>>N>>M>>K;\n vvll A(N,vll(N,-1e18));\n rep(i,M){\n ll a,b,c;\n cin>>a>>b>>c;\n A[a][b]=max(A[a][b],c);\n }\n vector<vector<pair<ll,ll>>> DP(101,vector<pair<ll,ll>>(N,{0,-1}));\n rep(i,100){\n ll MX=-1,id=-1;\n rep(j,N)rep(k,N){\n if(DP[i+1][j].first<DP[i][k].first+A[k][j]){\n DP[i+1][j].first=DP[i][k].first+A[k][j];\n DP[i+1][j].second=k;\n }\n if(DP[i+1][j].first>MX){\n MX=DP[i+1][j].first;\n id=j;\n }\n }\n if(MX>=K){\n cout<<i+1<<endl;\n vll AN;\n AN.push_back(id);\n for(ll n=i+1;n>0;n--){\n id=DP[n][id].second;\n AN.push_back(id);\n }\n reverse(AN.begin(),AN.end());\n rep(n,i+2)cout<<AN[n]<<\" \\n\"[n==i+1];\n return 0;\n }\n }\n ll L=10,R=1e7;\n while(R-L>1){\n ll mid=(R+L)/2;\n ll res=f(A,mid);\n (res>=K?R:L)=mid;\n }\n cout<<(R<5e6?R:-1)<<endl;\n}","accuracy":1,"time_ms":1650,"memory_kb":4724,"score_of_the_acc":-0.8906,"final_rank":10},{"submission_id":"aoj_2432_9468979","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nconst ll mod = 1e9 + 7;\n\nvvll mul(vvll A,vvll B){\n ll N=A.size();\n vvll R(N,vll(N,-1e18));\n rep(i,N)rep(j,N){\n rep(k,N)R[i][j]=max(R[i][j],A[i][k]+B[k][j]);\n }\n return R;\n}\n\nint main() {\n ll N,M,K;\n cin>>N>>M>>K;\n vvll A(N,vll(N,-1e18));\n rep(i,M){\n ll a,b,c;\n cin>>a>>b>>c;\n A[a][b]=max(A[a][b],c);\n }\n vector<vector<pair<ll,ll>>> DP(101,vector<pair<ll,ll>>(N,{0,-1}));\n rep(i,100){\n ll MX=-1,id=-1;\n rep(j,N)rep(k,N){\n if(DP[i+1][j].first<DP[i][k].first+A[k][j]){\n DP[i+1][j].first=DP[i][k].first+A[k][j];\n DP[i+1][j].second=k;\n }\n if(DP[i+1][j].first>MX){\n MX=DP[i+1][j].first;\n id=j;\n }\n }\n if(MX>=K){\n cout<<i+1<<endl;\n vll AN;\n AN.push_back(id);\n for(ll n=i+1;n>0;n--){\n id=DP[n][id].second;\n AN.push_back(id);\n }\n reverse(AN.begin(),AN.end());\n rep(n,i+2)cout<<AN[n]<<\" \\n\"[n==i+1];\n return 0;\n }\n }\n ll L=10,R=1e7;\n while(R-L>1){\n ll mid=(R+L)/2;\n vvll E(N,vll(N,0));\n ll n=mid;\n vvll B=A;\n while(n>0){\n if(n%2)E=mul(E,B);\n B=mul(B,B);\n n/=2;\n }\n bool OK=0;\n rep(i,N)rep(j,N){\n if(E[i][j]>=K)OK=1;\n }\n (OK?R:L)=mid;\n }\n cout<<(R<5e6?R:-1)<<endl;\n}","accuracy":0.8,"time_ms":1680,"memory_kb":4540,"score_of_the_acc":-0.8699,"final_rank":16},{"submission_id":"aoj_2432_8526924","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nusing ll = long long;\nusing ld = long double;\n\nconst ll INF = 1e15;\n\ntemplate <class T>\nstruct Matrix\n{\n\tvector<vector<T>> mat;\n\t\n\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\n\t\n\t/*--- operator ---*/\n\t\n\tint height() const\n\t{\n\t\treturn mat.size();\n\t}\n\t\n\tint width() const\n\t{\n\t\treturn mat[0].size();\n\t}\n\t\n\tMatrix &operator=(const Matrix &rhs)\n\t{\n\t\tthis.mat = rhs.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator-() const\n\t{\n\t\tint h = height(), w = width();\n\t\tMatrix ret = *this;\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\tret.mat[i][j] = -ret.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tMatrix &operator+=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] += rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator-=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] -= rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator*=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tint hr = rhs.height(), wr = rhs.width();\n\t\tassert(w == hr);\n\t\t\n\t\tMatrix mult(h, wr, 0);\n\t\tfor (int i = 0; i < h; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < wr; ++j)\n\t\t\t{\n\t\t\t\tT ret = (*this).mat[i][j];\n\t\t\t\tfor (int k = 0; k < w; ++k)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \n\t\t\t\t}\n\t\t\t\tmult.mat[i][j] = ret;\n\t\t\t}\n\t\t}\n\t\tmat = mult.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator+(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) += rhs);\n\t}\n\t\n\tMatrix operator-(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) -= rhs);\n\t}\n\t\n\tMatrix operator*(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) *= rhs);\n\t}\n\t\n\t/*--- function ---*/\n\t\n\tMatrix pow(long long n) const\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(h == w);\n\t\t\n\t\tMatrix ret(h, w, 0);\n\t\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\n\t\tMatrix p2 = *this;\n\t\t\n\t\twhile (n > 0)\n\t\t{\n\t\t\tif (n & 1) {ret *= p2;}\n\t\t\tp2 *= p2;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tvoid print() const\n\t{\n\t\tcout << \"Matrix size is \" << height() << \" * \" << width() << \".\" << endl;\n\t\tfor (int i = 0; i < height(); ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < width(); ++j)\n\t\t\t{\n\t\t\t\tcout << mat[i][j] << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\treturn;\n\t}\n\t\n};\n\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\n{\n\tll N = mat.mat.size();\n\tauto p = mat.pow(mid);\n\t\n\tll mx = -INF;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tfor (int j = 0; j < N; ++j)\n\t\t{\n\t\t\tchmax(mx, p.mat[i][j]);\n\t\t}\n\t}\n\t\n\treturn mx >= K;\n}\n\n// edge num, vertex := (max value, last vertex)\npair<ll, ll> dp[160][160];\n\nvoid calc()\n{\n\tll N, M, K; cin >> N >> M >> K;\n\tMatrix<ll> adj(N, N, -INF);\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tll u, v, c; cin >> u >> v >> c;\n\t\tchmax(adj.mat[u][v], c);\n\t}\n\t\n\t\n\t\n\t\n\tll ok = 1<<20, ng = 0;\n\t\n\tif (!isOK(adj, ok, K))\n\t{\n\t\tcout << -1 << endl;\n\t\treturn;\n\t}\n\t\n\t\n\twhile (abs(ok - ng) > 1)\n\t{\n\t\tll mid = (ok + ng) / 2;\n\t\tif (isOK(adj, mid, K)) ok = mid;\n\t\telse ng = mid;\n\t}\n\t\n\tcout << ok << endl;\n\t\n\tif (ok <= 100)\n\t{\n\t\tfor (int c = 0; c < 160; ++c)\n\t\t{\n\t\t\tfor (int v = 0; v < 160; ++v)\n\t\t\t{\n\t\t\t\tdp[c][v] = make_pair(-INF, -1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tdp[0][v] = make_pair(0, -1);\n\t\t}\n\t\t\n\t\tbool flg = false;\n\t\tfor (ll c = 1; c < 160; ++c)\n\t\t{\n\t\t\tfor (ll v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tfor (ll pv = 0; pv < N; ++pv)\n\t\t\t\t{\n\t\t\t\t\tauto [d, h] = dp[c-1][pv];\n\t\t\t\t\tll cost = adj.mat[pv][v];\n\t\t\t\t\t\n\t\t\t\t\tchmax(dp[c][v], make_pair(d+cost, pv));\n\t\t\t\t}\n\t\t\t\t// cout << c << \" \" << v << \" \" << dp[c][v].first << \" \" << dp[c][v].second << endl;\n\t\t\t}\n\t\t}\n\t\t\n\t\tll t = -1, mx = -INF;\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tif (chmax(mx, dp[ok][v].first)) t = v;\n\t\t}\n\t\tassert(t != -1);\n\t\t\n\t\tvector<ll> res;\n\t\tll now = t, cnt = ok;\n\t\twhile (cnt >= 0)\n\t\t{\n\t\t\tres.emplace_back(now);\n\t\t\t\n\t\t\tauto [d, pv] = dp[cnt][now];\n\t\t\tnow = pv;\n\t\t\tcnt--;\n\t\t}\n\t\t\n\t\treverse(res.begin(), res.end());\n\t\tassert(res.size() == ok+1);\n\t\t\n\t\tfor (auto v : res)\n\t\t{\n\t\t\tcout << v << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\t// auto p = adj.pow(992400);\n\t// ll mx = 0;\n\t// for (int i = 0; i < N; ++i)\n\t// {\n\t// \tfor (int j = 0; j < N; ++j)\n\t// \t{\n\t// \t\tchmax(mx, p.mat[i][j]);\n\t// \t}\n\t// }\n\t// cout << mx << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":950,"memory_kb":4080,"score_of_the_acc":-0.4235,"final_rank":5},{"submission_id":"aoj_2432_8526865","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nusing ll = long long;\nusing ld = long double;\n\nconst ll INF = 1e15;\n\ntemplate <class T>\nstruct Matrix\n{\n\tvector<vector<T>> mat;\n\t\n\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\n\t\n\t/*--- operator ---*/\n\t\n\tint height() const\n\t{\n\t\treturn mat.size();\n\t}\n\t\n\tint width() const\n\t{\n\t\treturn mat[0].size();\n\t}\n\t\n\tMatrix &operator=(const Matrix &rhs)\n\t{\n\t\tthis.mat = rhs.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator-() const\n\t{\n\t\tint h = height(), w = width();\n\t\tMatrix ret = *this;\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\tret.mat[i][j] = -ret.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tMatrix &operator+=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] += rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator-=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] -= rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator*=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tint hr = rhs.height(), wr = rhs.width();\n\t\tassert(w == hr);\n\t\t\n\t\tMatrix mult(h, wr, 0);\n\t\tfor (int i = 0; i < h; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < wr; ++j)\n\t\t\t{\n\t\t\t\tT ret = (*this).mat[i][j];\n\t\t\t\tfor (int k = 0; k < w; ++k)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \n\t\t\t\t}\n\t\t\t\tmult.mat[i][j] = ret;\n\t\t\t}\n\t\t}\n\t\tmat = mult.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator+(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) += rhs);\n\t}\n\t\n\tMatrix operator-(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) -= rhs);\n\t}\n\t\n\tMatrix operator*(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) *= rhs);\n\t}\n\t\n\t/*--- function ---*/\n\t\n\tMatrix pow(long long n) const\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(h == w);\n\t\t\n\t\tMatrix ret(h, w, 0);\n\t\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\n\t\tMatrix p2 = *this;\n\t\t\n\t\twhile (n > 0)\n\t\t{\n\t\t\tif (n & 1) {ret *= p2;}\n\t\t\tp2 *= p2;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tvoid print() const\n\t{\n\t\tcout << \"Matrix size is \" << height() << \" * \" << width() << \".\" << endl;\n\t\tfor (int i = 0; i < height(); ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < width(); ++j)\n\t\t\t{\n\t\t\t\tcout << mat[i][j] << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\treturn;\n\t}\n\t\n};\n\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\n{\n\tll N = mat.mat.size();\n\tauto p = mat.pow(mid);\n\t\n\tll mx = -INF;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tfor (int j = 0; j < N; ++j)\n\t\t{\n\t\t\tchmax(mx, p.mat[i][j]);\n\t\t}\n\t}\n\t\n\treturn mx >= K;\n}\n\n// edge num, vertex := (max value, last vertex)\npair<ll, ll> dp[160][160];\n\nvoid calc()\n{\n\tll N, M, K; cin >> N >> M >> K;\n\tMatrix<ll> adj(N, N, -INF);\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tll u, v, c; cin >> u >> v >> c;\n\t\tchmax(adj.mat[u][v], c);\n\t}\n\t\n\t{\n\t\tfor (int c = 0; c < 160; ++c)\n\t\t{\n\t\t\tfor (int v = 0; v < 160; ++v)\n\t\t\t{\n\t\t\t\tdp[c][v] = make_pair(-INF, -1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tdp[0][v] = make_pair(0, -1);\n\t\t}\n\t\t\n\t\tbool flg = false;\n\t\tll ok = INF;\n\t\tfor (ll c = 1; c < 160; ++c)\n\t\t{\n\t\t\tfor (ll v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tfor (ll pv = 0; pv < N; ++pv)\n\t\t\t\t{\n\t\t\t\t\tauto [d, h] = dp[c-1][pv];\n\t\t\t\t\tll cost = adj.mat[pv][v];\n\t\t\t\t\t\n\t\t\t\t\tchmax(dp[c][v], make_pair(d+cost, pv));\n\t\t\t\t}\n\t\t\t\tif (dp[c][v].first >= K) flg = true;\n\t\t\t\t// cout << c << \" \" << v << \" \" << dp[c][v].first << \" \" << dp[c][v].second << endl;\n\t\t\t}\n\t\t\tif (flg)\n\t\t\t{\n\t\t\t\tchmin(ok, c);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (flg)\n\t\t{\n\t\t\tll t = -1, mx = -INF;\n\t\t\tfor (int v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tif (chmax(mx, dp[ok][v].first)) t = v;\n\t\t\t}\n\t\t\tassert(t != -1);\n\t\t\t\n\t\t\tvector<ll> res;\n\t\t\tll now = t, cnt = ok;\n\t\t\twhile (cnt >= 0)\n\t\t\t{\n\t\t\t\tres.emplace_back(now);\n\t\t\t\t\n\t\t\t\tauto [d, pv] = dp[cnt][now];\n\t\t\t\tnow = pv;\n\t\t\t\tcnt--;\n\t\t\t}\n\t\t\t\n\t\t\treverse(res.begin(), res.end());\n\t\t\tassert(res.size() == ok+1);\n\t\t\t\n\t\t\tcout << ok << endl;\n\t\t\tif (ok <= 100)\n\t\t\t{\n\t\t\t\tfor (auto v : res)\n\t\t\t\t{\n\t\t\t\t\tcout << v << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\t\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t{\n\t\t\tll mx = -INF;\n\t\t\tfor (int i = 0; i < N; ++i)\n\t\t\t{\n\t\t\t\tchmax(mx, dp[159][i].first);\n\t\t\t}\n\t\t\t\n\t\t\tif (mx < 0)\n\t\t\t{\n\t\t\t\tcout << -1 << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tll ok = 1<<20, ng = 0;\n\t\n\twhile (abs(ok - ng) > 1)\n\t{\n\t\tll mid = (ok + ng) / 2;\n\t\tif (isOK(adj, mid, K)) ok = mid;\n\t\telse ng = mid;\n\t}\n\t\n\tcout << ok << endl;\n\t\n\t// auto p = adj.pow(992400);\n\t// ll mx = 0;\n\t// for (int i = 0; i < N; ++i)\n\t// {\n\t// \tfor (int j = 0; j < N; ++j)\n\t// \t{\n\t// \t\tchmax(mx, p.mat[i][j]);\n\t// \t}\n\t// }\n\t// cout << mx << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":900,"memory_kb":4372,"score_of_the_acc":-0.4552,"final_rank":9},{"submission_id":"aoj_2432_8526798","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nusing ll = long long;\nusing ld = long double;\n\nconst ll INF = 1e9;\n\ntemplate <class T>\nstruct Matrix\n{\n\tvector<vector<T>> mat;\n\t\n\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\n\t\n\t/*--- operator ---*/\n\t\n\tint height() const\n\t{\n\t\treturn mat.size();\n\t}\n\t\n\tint width() const\n\t{\n\t\treturn mat[0].size();\n\t}\n\t\n\tMatrix &operator=(const Matrix &rhs)\n\t{\n\t\tthis.mat = rhs.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator-() const\n\t{\n\t\tint h = height(), w = width();\n\t\tMatrix ret = *this;\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\tret.mat[i][j] = -ret.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tMatrix &operator+=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] += rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator-=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] -= rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator*=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tint hr = rhs.height(), wr = rhs.width();\n\t\tassert(w == hr);\n\t\t\n\t\tMatrix mult(h, wr, 0);\n\t\tfor (int i = 0; i < h; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < wr; ++j)\n\t\t\t{\n\t\t\t\tT ret = -INF;\n\t\t\t\tfor (int k = 0; k < w; ++k)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \n\t\t\t\t}\n\t\t\t\tmult.mat[i][j] = ret;\n\t\t\t}\n\t\t}\n\t\tmat = mult.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator+(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) += rhs);\n\t}\n\t\n\tMatrix operator-(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) -= rhs);\n\t}\n\t\n\tMatrix operator*(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) *= rhs);\n\t}\n\t\n\t/*--- function ---*/\n\t\n\tMatrix pow(long long n) const\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(h == w);\n\t\t\n\t\tMatrix ret(h, w, 0);\n\t\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\n\t\tMatrix p2 = *this;\n\t\t\n\t\twhile (n > 0)\n\t\t{\n\t\t\tif (n & 1) {ret *= p2;}\n\t\t\tp2 *= p2;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tvoid print() const\n\t{\n\t\tcout << \"Matrix size is \" << height() << \" * \" << width() << \".\" << endl;\n\t\tfor (int i = 0; i < height(); ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < width(); ++j)\n\t\t\t{\n\t\t\t\tcout << mat[i][j] << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\treturn;\n\t}\n\t\n};\n\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\n{\n\tll N = mat.mat.size();\n\tauto p = mat.pow(mid);\n\t\n\tll mx = -INF;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tfor (int j = 0; j < N; ++j)\n\t\t{\n\t\t\tchmax(mx, p.mat[i][j]);\n\t\t}\n\t}\n\t\n\treturn mx >= K;\n}\n\n// edge num, vertex := (max value, last vertex)\npair<ll, ll> dp[160][160];\n\nvoid calc()\n{\n\tll N, M, K; cin >> N >> M >> K;\n\tMatrix<ll> adj(N, N, -INF);\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tll u, v, c; cin >> u >> v >> c;\n\t\tchmax(adj.mat[u][v], c);\n\t}\n\t\n\t{\n\t\tfor (int c = 0; c < 160; ++c)\n\t\t{\n\t\t\tfor (int v = 0; v < 160; ++v)\n\t\t\t{\n\t\t\t\tdp[c][v] = make_pair(-INF, -1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tdp[0][v] = make_pair(0, -1);\n\t\t}\n\t\t\n\t\tbool flg = false;\n\t\tll ok = INF;\n\t\tfor (ll c = 1; c < 160; ++c)\n\t\t{\n\t\t\tfor (ll v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tfor (ll pv = 0; pv < N; ++pv)\n\t\t\t\t{\n\t\t\t\t\tauto [d, h] = dp[c-1][pv];\n\t\t\t\t\tll cost = adj.mat[pv][v];\n\t\t\t\t\t\n\t\t\t\t\tchmax(dp[c][v], make_pair(d+cost, pv));\n\t\t\t\t}\n\t\t\t\tif (dp[c][v].first >= K) flg = true;\n\t\t\t\t// cout << c << \" \" << v << \" \" << dp[c][v].first << \" \" << dp[c][v].second << endl;\n\t\t\t}\n\t\t\tif (flg)\n\t\t\t{\n\t\t\t\tchmin(ok, c);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (flg)\n\t\t{\n\t\t\tll t = -1, mx = -INF;\n\t\t\tfor (int v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tif (chmax(mx, dp[ok][v].first)) t = v;\n\t\t\t}\n\t\t\tassert(t != -1);\n\t\t\t\n\t\t\tvector<ll> res;\n\t\t\tll now = t, cnt = ok;\n\t\t\twhile (cnt >= 0)\n\t\t\t{\n\t\t\t\tres.emplace_back(now);\n\t\t\t\t\n\t\t\t\tauto [d, pv] = dp[cnt][now];\n\t\t\t\tnow = pv;\n\t\t\t\tcnt--;\n\t\t\t}\n\t\t\t\n\t\t\treverse(res.begin(), res.end());\n\t\t\tassert(res.size() == ok+1);\n\t\t\t\n\t\t\tcout << ok << endl;\n\t\t\tif (ok <= 100)\n\t\t\t{\n\t\t\t\tfor (auto v : res)\n\t\t\t\t{\n\t\t\t\t\tcout << v << \" \";\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\t\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t{\n\t\t\tll mx = -INF;\n\t\t\tfor (int i = 0; i < N; ++i)\n\t\t\t{\n\t\t\t\tchmax(mx, dp[159][i].first);\n\t\t\t}\n\t\t\t\n\t\t\tif (mx < 0)\n\t\t\t{\n\t\t\t\tcout << -1 << endl;\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tll ok = 2*K, ng = 0;\n\t\n\twhile (abs(ok - ng) > 1)\n\t{\n\t\tll mid = (ok + ng) / 2;\n\t\tif (isOK(adj, mid, K)) ok = mid;\n\t\telse ng = mid;\n\t}\n\t\n\tcout << ok << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":0.8,"time_ms":1120,"memory_kb":4304,"score_of_the_acc":-0.5499,"final_rank":15},{"submission_id":"aoj_2432_8526714","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\nusing ll = long long;\nusing ld = long double;\n\nconst ll INF = 1e9;\n\ntemplate <class T>\nstruct Matrix\n{\n\tvector<vector<T>> mat;\n\t\n\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\n\t\n\t/*--- operator ---*/\n\t\n\tint height() const\n\t{\n\t\treturn mat.size();\n\t}\n\t\n\tint width() const\n\t{\n\t\treturn mat[0].size();\n\t}\n\t\n\tMatrix &operator=(const Matrix &rhs)\n\t{\n\t\tthis.mat = rhs.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator-() const\n\t{\n\t\tint h = height(), w = width();\n\t\tMatrix ret = *this;\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\tret.mat[i][j] = -ret.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tMatrix &operator+=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] += rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator-=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(rhs.height() == h && rhs.width() == w);\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\tthis.mat[i][j] -= rhs.mat[i][j];\n\t\t\t}\n\t\t}\n\t\treturn *this;\n\t}\n\t\n\tMatrix &operator*=(const Matrix &rhs)\n\t{\n\t\tint h = height(), w = width();\n\t\tint hr = rhs.height(), wr = rhs.width();\n\t\tassert(w == hr);\n\t\t\n\t\tMatrix mult(h, wr, 0);\n\t\tfor (int i = 0; i < h; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < wr; ++j)\n\t\t\t{\n\t\t\t\tT ret = -INF;\n\t\t\t\tfor (int k = 0; k < w; ++k)\n\t\t\t\t{\n\t\t\t\t\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \n\t\t\t\t}\n\t\t\t\tmult.mat[i][j] = ret;\n\t\t\t}\n\t\t}\n\t\tmat = mult.mat;\n\t\treturn *this;\n\t}\n\t\n\tMatrix operator+(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) += rhs);\n\t}\n\t\n\tMatrix operator-(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) -= rhs);\n\t}\n\t\n\tMatrix operator*(const Matrix &rhs) const\n\t{\n\t\treturn (Matrix(*this) *= rhs);\n\t}\n\t\n\t/*--- function ---*/\n\t\n\tMatrix pow(long long n) const\n\t{\n\t\tint h = height(), w = width();\n\t\tassert(h == w);\n\t\t\n\t\tMatrix ret(h, w, 0);\n\t\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\n\t\tMatrix p2 = *this;\n\t\t\n\t\twhile (n > 0)\n\t\t{\n\t\t\tif (n & 1) {ret *= p2;}\n\t\t\tp2 *= p2;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\t\n\tvoid print() const\n\t{\n\t\tcout << \"Matrix size is \" << height() << \" * \" << width() << \".\" << endl;\n\t\tfor (int i = 0; i < height(); ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < width(); ++j)\n\t\t\t{\n\t\t\t\tcout << mat[i][j] << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t\treturn;\n\t}\n\t\n};\n\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\n{\n\tll N = mat.mat.size();\n\tauto p = mat.pow(mid);\n\t\n\tll mx = -INF;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tfor (int j = 0; j < N; ++j)\n\t\t{\n\t\t\tchmax(mx, p.mat[i][j]);\n\t\t}\n\t}\n\t\n\treturn mx >= K;\n}\n\n// edge num, vertex := (max value, last vertex)\npair<ll, ll> dp[110][110];\n\nvoid calc()\n{\n\tll N, M, K; cin >> N >> M >> K;\n\tMatrix<ll> adj(N, N, -INF);\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tll u, v, c; cin >> u >> v >> c;\n\t\tchmax(adj.mat[u][v], c);\n\t}\n\t\n\tll ok = 2*K, ng = 0;\n\t\n\tif (!isOK(adj, ok, K))\n\t{\n\t\tcout << -1 << endl;\n\t\treturn;\n\t}\n\t\n\twhile (abs(ok - ng) > 1)\n\t{\n\t\tll mid = (ok + ng) / 2;\n\t\tif (isOK(adj, mid, K)) ok = mid;\n\t\telse ng = mid;\n\t}\n\t\n\tcout << ok << endl;\n\t\n\tif (ok <= 100)\n\t{\n\t\tfor (int c = 0; c < 110; ++c)\n\t\t{\n\t\t\tfor (int v = 0; v < 110; ++v)\n\t\t\t{\n\t\t\t\tdp[c][v] = make_pair(-INF, -1);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tdp[0][v] = make_pair(0, -1);\n\t\t}\n\t\t\n\t\tfor (ll c = 1; c <= ok; ++c)\n\t\t{\n\t\t\tfor (ll v = 0; v < N; ++v)\n\t\t\t{\n\t\t\t\tfor (ll pv = 0; pv < N; ++pv)\n\t\t\t\t{\n\t\t\t\t\tauto [d, h] = dp[c-1][pv];\n\t\t\t\t\tll cost = adj.mat[pv][v];\n\t\t\t\t\t\n\t\t\t\t\tchmax(dp[c][v], make_pair(d+cost, pv));\n\t\t\t\t}\n\t\t\t\t// cout << c << \" \" << v << \" \" << dp[c][v].first << \" \" << dp[c][v].second << endl;\n\t\t\t}\n\t\t}\n\t\t\n\t\tll t = -1, mx = -INF;\n\t\tfor (int v = 0; v < N; ++v)\n\t\t{\n\t\t\tif (chmax(mx, dp[ok][v].first)) t = v;\n\t\t}\n\t\tassert(t != -1);\n\t\t\n\t\tvector<ll> res;\n\t\tll now = t, cnt = ok;\n\t\twhile (cnt >= 0)\n\t\t{\n\t\t\tres.emplace_back(now);\n\t\t\t\n\t\t\tauto [d, pv] = dp[cnt][now];\n\t\t\tnow = pv;\n\t\t\tcnt--;\n\t\t}\n\t\t\n\t\treverse(res.begin(), res.end());\n\t\t\n\t\tassert(res.size() == ok+1);\n\t\tfor (auto v : res)\n\t\t{\n\t\t\tcout << v << \" \";\n\t\t}\n\t\tcout << endl;\n\t\t\n\t}\n\t\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":0.7333333333333333,"time_ms":1170,"memory_kb":3892,"score_of_the_acc":-0.4951,"final_rank":17},{"submission_id":"aoj_2432_8370278","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\t// step #1. input\n\tint V, E, K;\n\tcin >> V >> E >> K;\n\tconst int INF = 1012345678;\n\tvector<vector<int> > d(V, vector<int>(V, -INF));\n\tfor (int i = 0; i < E; i++) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\td[a][b] = max(d[a][b], c);\n\t}\n\n\t// step #2. first dp\n\tconst int limit = 100;\n\tvector<vector<int> > dp1(limit + 1, vector<int>(V, -INF));\n\tvector<vector<int> > pre(limit + 1, vector<int>(V, -1));\n\tdp1[0] = vector<int>(V, 0);\n\tfor (int i = 1; i <= limit; i++) {\n\t\tfor (int j = 0; j < V; j++) {\n\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\tif (d[k][j] != -INF && dp1[i][j] < dp1[i - 1][k] + d[k][j]) {\n\t\t\t\t\tdp1[i][j] = dp1[i - 1][k] + d[k][j];\n\t\t\t\t\tpre[i][j] = k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbool found = false;\n\tfor (int i = 0; i <= limit && !found; i++) {\n\t\tint pos = max_element(dp1[i].begin(), dp1[i].end()) - dp1[i].begin();\n\t\tif (dp1[i][pos] >= K) {\n\t\t\tfound = true;\n\t\t\tvector<int> v(i + 1);\n\t\t\tv[i] = pos;\n\t\t\tfor (int j = i - 1; j >= 0; j--) {\n\t\t\t\tv[j] = pre[j + 1][v[j + 1]];\n\t\t\t}\n\t\t\tcout << i << endl;\n\t\t\tfor (int j = 0; j <= i; j++) {\n\t\t\t\tif (j != 0) {\n\t\t\t\t\tcout << ' ';\n\t\t\t\t}\n\t\t\t\tcout << v[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\n\t// step #3. second dp\n\tif (!found) {\n\t\tconst int bits = 32 - __builtin_clz(K + 1);\n\t\tvector<vector<vector<int> > > dp2(bits);\n\t\tdp2[0] = d;\n\t\tfor (int i = 1; i < bits; i++) {\n\t\t\tdp2[i] = dp2[i - 1];\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tfor (int l = 0; l < V; l++) {\n\t\t\t\t\t\tif (dp2[i - 1][j][l] != -INF && dp2[i - 1][l][k] != -INF) {\n\t\t\t\t\t\t\tdp2[i][j][k] = max(dp2[i][j][k], dp2[i - 1][j][l] + dp2[i - 1][l][k]);\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\tvector<vector<int> > dp3(V, vector<int>(V, -INF));\n\t\tfor (int i = 0; i < V; i++) {\n\t\t\tdp3[i][i] = 0;\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = bits - 1; i >= 0; i--) {\n\t\t\tvector<vector<int> > dp4(V, vector<int>(V, -INF));\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tfor (int l = 0; l < V; l++) {\n\t\t\t\t\t\tif (dp3[j][l] != -INF && dp2[i][l][k] != -INF) {\n\t\t\t\t\t\t\tdp4[j][k] = max(dp4[j][k], dp3[j][l] + dp2[i][l][k]);\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\tbool flag = false;\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tif (dp4[j][k] >= K) {\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!flag) {\n\t\t\t\tdp3 = dp4;\n\t\t\t\tans += (1 << i);\n\t\t\t}\n\t\t}\n\t\tans += 1;\n\t\tif (ans == (1 << bits)) {\n\t\t\tcout << -1 << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":210,"memory_kb":5672,"score_of_the_acc":-0.3673,"final_rank":1},{"submission_id":"aoj_2432_8370265","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\t// step #1. input\n\tint V, E, K;\n\tcin >> V >> E >> K;\n\tconst int INF = 1012345678;\n\tvector<vector<int> > d(V, vector<int>(V, -INF));\n\tfor (int i = 0; i < E; i++) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\td[a][b] = max(d[a][b], c);\n\t}\n\n\t// step #2. first dp\n\tconst int limit = 100;\n\tvector<vector<int> > dp1(limit + 1, vector<int>(V, -INF));\n\tvector<vector<int> > pre(limit + 1, vector<int>(V, -1));\n\tdp1[0] = vector<int>(V, 0);\n\tfor (int i = 1; i <= limit; i++) {\n\t\tfor (int j = 0; j < V; j++) {\n\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\tif (d[k][j] != -INF && dp1[i][j] < dp1[i - 1][k] + d[k][j]) {\n\t\t\t\t\tdp1[i][j] = dp1[i - 1][k] + d[k][j];\n\t\t\t\t\tpre[i][j] = k;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tbool found = false;\n\tfor (int i = 0; i <= limit && !found; i++) {\n\t\tint pos = max_element(dp1[i].begin(), dp1[i].end()) - dp1[i].begin();\n\t\tif (dp1[i][pos] >= K) {\n\t\t\tfound = true;\n\t\t\tvector<int> v(i + 1);\n\t\t\tv[i] = pos;\n\t\t\tfor (int j = i - 1; j >= 0; j--) {\n\t\t\t\tv[j] = pre[j + 1][v[j + 1]];\n\t\t\t}\n\t\t\tcout << i << endl;\n\t\t\tfor (int j = 0; j <= i; j++) {\n\t\t\t\tif (j != 0) {\n\t\t\t\t\tcout << ' ';\n\t\t\t\t}\n\t\t\t\tcout << v[j];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n\n\t// step #3. second dp\n\tif (!found) {\n\t\tconst int bits = 32 - __builtin_clz(K + 1);\n\t\tvector<vector<vector<int> > > dp2(bits, vector<vector<int> >(V, vector<int>(V, -INF)));\n\t\tdp2[0] = d;\n\t\tfor (int i = 1; i < bits; i++) {\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tfor (int l = 0; l < V; l++) {\n\t\t\t\t\t\tif (dp2[i - 1][j][l] != -INF && dp2[i - 1][l][k] != -INF) {\n\t\t\t\t\t\t\tdp2[i][j][k] = max(dp2[i][j][k], dp2[i - 1][j][l] + dp2[i - 1][l][k]);\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\tvector<vector<int> > dp3(V, vector<int>(V, -INF));\n\t\tfor (int i = 0; i < V; i++) {\n\t\t\tdp3[i][i] = 0;\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = bits - 1; i >= 0; i--) {\n\t\t\tvector<vector<int> > dp4(V, vector<int>(V, -INF));\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tfor (int l = 0; l < V; l++) {\n\t\t\t\t\t\tif (dp3[j][l] != -INF && dp2[i][l][k] != -INF) {\n\t\t\t\t\t\t\tdp4[j][k] = max(dp4[j][k], dp3[j][l] + dp2[i][l][k]);\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\tbool flag = false;\n\t\t\tfor (int j = 0; j < V; j++) {\n\t\t\t\tfor (int k = 0; k < V; k++) {\n\t\t\t\t\tif (dp4[j][k] >= K) {\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!flag) {\n\t\t\t\tdp3 = dp4;\n\t\t\t\tans += (1 << i);\n\t\t\t}\n\t\t}\n\t\tans += 1;\n\t\tif (ans == (1 << bits)) {\n\t\t\tcout << -1 << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":0.8,"time_ms":220,"memory_kb":5708,"score_of_the_acc":-0.3792,"final_rank":13},{"submission_id":"aoj_2432_8064226","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 150) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":200,"memory_kb":6088,"score_of_the_acc":-0.4426,"final_rank":8},{"submission_id":"aoj_2432_8064223","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[110][155], prv[110][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 100) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[20], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 19) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":190,"memory_kb":5856,"score_of_the_acc":-0.393,"final_rank":2},{"submission_id":"aoj_2432_8064221","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 50) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":0.3333333333333333,"time_ms":160,"memory_kb":5800,"score_of_the_acc":-0.3675,"final_rank":20},{"submission_id":"aoj_2432_8064219","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 130) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":200,"memory_kb":5928,"score_of_the_acc":-0.4117,"final_rank":3},{"submission_id":"aoj_2432_8064218","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\ninline void maxUpdate(int &a, int b) { a = max(a, b); }\ninline void mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 150) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":190,"memory_kb":5968,"score_of_the_acc":-0.4146,"final_rank":4},{"submission_id":"aoj_2432_8064217","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 70) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":0.3333333333333333,"time_ms":160,"memory_kb":5792,"score_of_the_acc":-0.3659,"final_rank":19},{"submission_id":"aoj_2432_8064216","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 80) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":0.3333333333333333,"time_ms":160,"memory_kb":5784,"score_of_the_acc":-0.3644,"final_rank":18},{"submission_id":"aoj_2432_8064212","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 100) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":200,"memory_kb":6044,"score_of_the_acc":-0.4341,"final_rank":7},{"submission_id":"aoj_2432_8064209","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = a;\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 120) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":1,"time_ms":200,"memory_kb":5992,"score_of_the_acc":-0.4241,"final_rank":6},{"submission_id":"aoj_2432_8061039","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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)\ntypedef vector<int> Ary;\ntypedef vector<Ary> Mat;\nstruct Edge {\n int to, c;\n};\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\nvoid mul(Mat &res, Mat &a, Mat &b) {\n int N = a.size();\n res = Mat(N, Ary(N, -1));\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\n if (a[i][k] >= 0 && b[k][j] >= 0)\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\n }\n}\nint V, K, E, dp[155][155], prv[155][155];\nvector<vector<Edge>> adj;\nvoid restore(int step, int v) {\n int c = step;\n vector<int> path;\n while (v != -1) {\n path.push_back(v);\n v = prv[c--][v];\n }\n reverse(path.begin(), path.end());\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \" \" : \"\\n\");\n}\nbool shortPhase() {\n memset(dp, -1, sizeof(dp));\n memset(prv, -1, sizeof(prv));\n for_(v, 0, V) dp[0][v] = 0;\n int max_score = -1, step = -1, terminal = -1;\n for_(i, 0, 150) {\n for_(v, 0, V) {\n if (dp[i][v] == -1)\n continue;\n for (Edge e : adj[v]) {\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\n dp[i + 1][e.to] = dp[i][v] + e.c;\n prv[i + 1][e.to] = v;\n if (max_score < dp[i + 1][e.to]) {\n max_score = dp[i + 1][e.to];\n terminal = e.to;\n }\n }\n }\n }\n if (max_score >= K) {\n step = i + 1;\n break;\n }\n }\n if (max_score >= K) {\n cout << step << endl;\n restore(step, terminal);\n return true;\n }\n if (max_score == -1) {\n cout << -1 << endl;\n return true;\n }\n return false;\n}\nint calcMinStep() {\n Mat mat[21], ini(V, Ary(V, -1));\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\n mat[0] = ini;\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\n int res = 0;\n Mat x(V, Ary(V, -1)), nx;\n for_(v, 0, V) x[v][v] = 0;\n for_rev(h, 19, 0) {\n mul(nx, x, mat[h]);\n int max_score = 0;\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\n if (max_score < K) {\n x = nx;\n res += 1 << h;\n }\n }\n return res + 1;\n}\nvoid solve() {\n if (!shortPhase()) {\n int ans = calcMinStep();\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\n }\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n cin >> V >> E >> K;\n adj.assign(V, vector<Edge>());\n for_(i, 0, E) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].push_back(Edge{v, c});\n }\n solve();\n}","accuracy":0.8,"time_ms":200,"memory_kb":6008,"score_of_the_acc":-0.4272,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2432_10848636\",\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>;\\nusing P3 = pair<int,P>;\\nusing PP = pair<P, P>;\\nconstexpr int INF32 = 1 << 30;\\nconstexpr ll INF64 = 1LL << 62;\\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\\nll V, E, K;\\nconst int T = 29;\\nll C[150][150][T+1];\\n\\nvoid init(){\\n for(int t=0;t<T;t++){\\n REP(i,V) REP(j,V) REP(k,V){\\n if(C[i][k][t] >= 0 && C[k][j][t] >= 0){\\n chmax(C[i][j][t+1], C[i][k][t]+C[k][j][t]);\\n }\\n }\\n }\\n}\\n\\nll calc(ll n){\\n ll res[150][150]{};\\n REP(i,V) fill(res[i],res[i]+V,-INF64);\\n REP(i,V) res[i][i] = 0;\\n for(int t=0;t<T;t++){\\n if((n>>t)&1){\\n ll tmp[150][150]{};\\n REP(i,V) fill(tmp[i],tmp[i]+V,-INF64);\\n REP(i,V) REP(j,V) REP(k,V){\\n if(C[k][j][t] >= 0){\\n chmax(tmp[i][j], res[i][k]+C[k][j][t]);\\n }\\n }\\n REP(i,V) REP(j,V) chmax(res[i][j],tmp[i][j]);\\n }\\n }\\n ll ma = -1;\\n REP(i,V) REP(j,V) chmax(ma, res[i][j]);\\n // cout << n << endl;\\n // REP(i,V){\\n // REP(j,V){\\n // cout << res[i][j] << \\\" \\\";\\n // }\\n // cout << endl;\\n // }\\n return ma;\\n}\\n\\nvector<int> reconstruct(int n){\\n ll rev[150][101]{}, scr[150]{};\\n for(int t=0;t<n;t++){\\n ll tmp[150]{};\\n fill(tmp,tmp+V,-INF32);\\n REP(i,V) REP(j,V){\\n if(C[j][i][0]>=0 && chmax(tmp[i], scr[j]+C[j][i][0])){\\n rev[i][t+1] = j;\\n }\\n }\\n REP(i,V) scr[i] = tmp[i];\\n }\\n ll maxidx = -1, ma = -1;\\n REP(i,V){\\n if(chmax(ma, scr[i])) maxidx = i;\\n }\\n vector<int> v;\\n v.push_back(maxidx);\\n for(int t=n,now=maxidx;t>0;t--){\\n v.push_back(rev[now][t]);\\n now = rev[now][t];\\n }\\n reverse(ALL(v));\\n return v;\\n}\\n\\nint main(){\\n cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);\\n cin >> V >> E >> K;\\n REP(i,V) REP(j,V) REP(k,T+1) C[i][j][k] = (i==j?0:-INF64);\\n REP(i,E){\\n int u, v, c;\\n cin >> u >> v >> c;\\n chmax(C[u][v][0], c);\\n }\\n init();\\n ll ok = 1<<(T), ng = 0;\\n while(abs(ok-ng)>1){\\n int mid = (ok+ng)/2;\\n if(calc(mid) >= K){\\n ok = mid;\\n }else{\\n ng = mid;\\n }\\n }\\n if(ok <= 100){\\n cout << ok << endl;\\n vector<int> ans = reconstruct(ok);\\n for(int i=0;i<ok+1;i++){\\n if(i>0) cout << \\\" \\\";\\n cout << ans[i];\\n }\\n cout << endl;\\n }else if(ok < 1<<T){\\n cout << ok << endl;\\n }else{\\n cout << -1 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1690,\n \"memory_kb\": 9084,\n \"score_of_the_acc\": -1.75,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2432_9796106\",\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\\nvector<vector<int>> Mul(vector<vector<int>> A, vector<vector<int>> B) {\\n int N = A.size();\\n vector<vector<int>> Ret(N,vector<int>(N,-1));\\n rep(i,0,N) Ret[i][i] = 0;\\n rep(i,0,N) {\\n rep(j,0,N) {\\n rep(k,0,N) {\\n if (A[i][j] >= 0 && B[j][k] >= 0) chmax(Ret[i][k],min(inf,A[i][j]+B[j][k]));\\n }\\n }\\n }\\n return Ret;\\n}\\n\\nvector<vector<int>> Pow(vector<vector<int>> A, int X) {\\n int N = A.size();\\n if (X == 0) {\\n vector<vector<int>> Ret(N,vector<int>(N,-1));\\n rep(i,0,N) Ret[i][i] = 0;\\n return Ret;\\n }\\n if (X % 2 == 0) {\\n auto Ret = Pow(A,X/2);\\n return Mul(Ret,Ret);\\n }\\n return Mul(A,Pow(A,X-1));\\n}\\n\\nint main() {\\n int N, M, K;\\n cin >> N >> M >> K;\\n vector<vector<int>> D(N,vector<int>(N,-1));\\n rep(i,0,N) D[i][i] = 0;\\n vector<int> U(M), V(M), C(M);\\n rep(i,0,M) {\\n cin >> U[i] >> V[i] >> C[i];\\n chmax(D[U[i]][V[i]],C[i]);\\n }\\n int NG = -1, OK = 1000001;\\n while(OK - NG > 1) {\\n int MID = (OK + NG) / 2;\\n auto Ret = Pow(D,MID);\\n bool check = false;\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (Ret[i][j] >= K) check = true;\\n }\\n }\\n if (check) OK = MID;\\n else NG = MID;\\n }\\n if (OK == 1000001) {\\n cout << -1 << endl;\\n return 0;\\n }\\n if (OK > 100) {\\n cout << OK << endl;\\n return 0;\\n }\\n int MAX = 0;\\n vector<vector<vector<int>>> DP(OK+1);\\n DP[0] = Pow(D,0);\\n rep(i,0,OK) DP[i+1] = Mul(DP[i],D);\\n int S, G;\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (DP[OK][i][j] >= K) {\\n if (chmax(MAX,DP[OK][i][j])) {\\n S = i, G = j;\\n }\\n }\\n }\\n }\\n vector<int> ANS;\\n ANS.push_back(G);\\n rrep(i,0,OK) {\\n rep(j,0,M) {\\n if (V[j] != G) continue;\\n if (min(inf,DP[i][S][U[j]] + C[j]) == DP[i+1][S][G]) {\\n ANS.push_back(U[j]);\\n G = U[j];\\n break;\\n }\\n }\\n }\\n reverse(ALL(ANS));\\n cout << OK << endl;\\n rep(i,0,ANS.size()) cout << ANS[i] << (i == ANS.size()-1 ? '\\\\n' : ' ');\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2200,\n \"memory_kb\": 7860,\n \"score_of_the_acc\": -1.7643,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2432_9468996\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\\n\\nconst ll mod = 1e9 + 7;\\n\\nvvll mul(vvll A,vvll B){\\n ll N=A.size();\\n vvll R(N,vll(N,-1e18));\\n rep(i,N)R[i][i]=0;\\n rep(i,N)rep(j,N){\\n rep(k,N)R[i][j]=max(R[i][j],A[i][k]+B[k][j]);\\n }\\n return R;\\n}\\n\\nll f(vvll A,ll n){\\n ll N=A.size();\\n vvll E(N,vll(N,0));\\n vvll B=A;\\n while(n>0){\\n if(n%2)E=mul(B,E);\\n vvll NB=mul(B,B);\\n rep(i,N)rep(j,N)B[i][j]=max(B[i][j],NB[i][j]);\\n n/=2;\\n }\\n ll res=0;\\n rep(i,N)rep(j,N)res=max(res,E[i][j]);\\n return res;\\n}\\n\\nint main() {\\n ll N,M,K;\\n cin>>N>>M>>K;\\n vvll A(N,vll(N,-1e18));\\n rep(i,M){\\n ll a,b,c;\\n cin>>a>>b>>c;\\n A[a][b]=max(A[a][b],c);\\n }\\n vector<vector<pair<ll,ll>>> DP(101,vector<pair<ll,ll>>(N,{0,-1}));\\n rep(i,100){\\n ll MX=-1,id=-1;\\n rep(j,N)rep(k,N){\\n if(DP[i+1][j].first<DP[i][k].first+A[k][j]){\\n DP[i+1][j].first=DP[i][k].first+A[k][j];\\n DP[i+1][j].second=k;\\n }\\n if(DP[i+1][j].first>MX){\\n MX=DP[i+1][j].first;\\n id=j;\\n }\\n }\\n if(MX>=K){\\n cout<<i+1<<endl;\\n vll AN;\\n AN.push_back(id);\\n for(ll n=i+1;n>0;n--){\\n id=DP[n][id].second;\\n AN.push_back(id);\\n }\\n reverse(AN.begin(),AN.end());\\n rep(n,i+2)cout<<AN[n]<<\\\" \\\\n\\\"[n==i+1];\\n return 0;\\n }\\n }\\n ll L=10,R=1e7;\\n while(R-L>1){\\n ll mid=(R+L)/2;\\n ll res=f(A,mid);\\n (res>=K?R:L)=mid;\\n }\\n cout<<(R<5e6?R:-1)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1650,\n \"memory_kb\": 4724,\n \"score_of_the_acc\": -0.8906,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2432_9468979\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\\n\\nconst ll mod = 1e9 + 7;\\n\\nvvll mul(vvll A,vvll B){\\n ll N=A.size();\\n vvll R(N,vll(N,-1e18));\\n rep(i,N)rep(j,N){\\n rep(k,N)R[i][j]=max(R[i][j],A[i][k]+B[k][j]);\\n }\\n return R;\\n}\\n\\nint main() {\\n ll N,M,K;\\n cin>>N>>M>>K;\\n vvll A(N,vll(N,-1e18));\\n rep(i,M){\\n ll a,b,c;\\n cin>>a>>b>>c;\\n A[a][b]=max(A[a][b],c);\\n }\\n vector<vector<pair<ll,ll>>> DP(101,vector<pair<ll,ll>>(N,{0,-1}));\\n rep(i,100){\\n ll MX=-1,id=-1;\\n rep(j,N)rep(k,N){\\n if(DP[i+1][j].first<DP[i][k].first+A[k][j]){\\n DP[i+1][j].first=DP[i][k].first+A[k][j];\\n DP[i+1][j].second=k;\\n }\\n if(DP[i+1][j].first>MX){\\n MX=DP[i+1][j].first;\\n id=j;\\n }\\n }\\n if(MX>=K){\\n cout<<i+1<<endl;\\n vll AN;\\n AN.push_back(id);\\n for(ll n=i+1;n>0;n--){\\n id=DP[n][id].second;\\n AN.push_back(id);\\n }\\n reverse(AN.begin(),AN.end());\\n rep(n,i+2)cout<<AN[n]<<\\\" \\\\n\\\"[n==i+1];\\n return 0;\\n }\\n }\\n ll L=10,R=1e7;\\n while(R-L>1){\\n ll mid=(R+L)/2;\\n vvll E(N,vll(N,0));\\n ll n=mid;\\n vvll B=A;\\n while(n>0){\\n if(n%2)E=mul(E,B);\\n B=mul(B,B);\\n n/=2;\\n }\\n bool OK=0;\\n rep(i,N)rep(j,N){\\n if(E[i][j]>=K)OK=1;\\n }\\n (OK?R:L)=mid;\\n }\\n cout<<(R<5e6?R:-1)<<endl;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 1680,\n \"memory_kb\": 4540,\n \"score_of_the_acc\": -0.8699,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2432_8526924\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nconst ll INF = 1e15;\\n\\ntemplate <class T>\\nstruct Matrix\\n{\\n\\tvector<vector<T>> mat;\\n\\t\\n\\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\\n\\t\\n\\t/*--- operator ---*/\\n\\t\\n\\tint height() const\\n\\t{\\n\\t\\treturn mat.size();\\n\\t}\\n\\t\\n\\tint width() const\\n\\t{\\n\\t\\treturn mat[0].size();\\n\\t}\\n\\t\\n\\tMatrix &operator=(const Matrix &rhs)\\n\\t{\\n\\t\\tthis.mat = rhs.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator-() const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tMatrix ret = *this;\\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\\tret.mat[i][j] = -ret.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tMatrix &operator+=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] += rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator-=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] -= rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator*=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tint hr = rhs.height(), wr = rhs.width();\\n\\t\\tassert(w == hr);\\n\\t\\t\\n\\t\\tMatrix mult(h, wr, 0);\\n\\t\\tfor (int i = 0; i < h; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < wr; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tT ret = (*this).mat[i][j];\\n\\t\\t\\t\\tfor (int k = 0; k < w; ++k)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmult.mat[i][j] = ret;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = mult.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator+(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) += rhs);\\n\\t}\\n\\t\\n\\tMatrix operator-(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) -= rhs);\\n\\t}\\n\\t\\n\\tMatrix operator*(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) *= rhs);\\n\\t}\\n\\t\\n\\t/*--- function ---*/\\n\\t\\n\\tMatrix pow(long long n) const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(h == w);\\n\\t\\t\\n\\t\\tMatrix ret(h, w, 0);\\n\\t\\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\\n\\t\\tMatrix p2 = *this;\\n\\t\\t\\n\\t\\twhile (n > 0)\\n\\t\\t{\\n\\t\\t\\tif (n & 1) {ret *= p2;}\\n\\t\\t\\tp2 *= p2;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tvoid print() const\\n\\t{\\n\\t\\tcout << \\\"Matrix size is \\\" << height() << \\\" * \\\" << width() << \\\".\\\" << endl;\\n\\t\\tfor (int i = 0; i < height(); ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < width(); ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << mat[i][j] << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\\n{\\n\\tll N = mat.mat.size();\\n\\tauto p = mat.pow(mid);\\n\\t\\n\\tll mx = -INF;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < N; ++j)\\n\\t\\t{\\n\\t\\t\\tchmax(mx, p.mat[i][j]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn mx >= K;\\n}\\n\\n// edge num, vertex := (max value, last vertex)\\npair<ll, ll> dp[160][160];\\n\\nvoid calc()\\n{\\n\\tll N, M, K; cin >> N >> M >> K;\\n\\tMatrix<ll> adj(N, N, -INF);\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tll u, v, c; cin >> u >> v >> c;\\n\\t\\tchmax(adj.mat[u][v], c);\\n\\t}\\n\\t\\n\\t\\n\\t\\n\\t\\n\\tll ok = 1<<20, ng = 0;\\n\\t\\n\\tif (!isOK(adj, ok, K))\\n\\t{\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\t\\n\\twhile (abs(ok - ng) > 1)\\n\\t{\\n\\t\\tll mid = (ok + ng) / 2;\\n\\t\\tif (isOK(adj, mid, K)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t\\n\\tcout << ok << endl;\\n\\t\\n\\tif (ok <= 100)\\n\\t{\\n\\t\\tfor (int c = 0; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (int v = 0; v < 160; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[c][v] = make_pair(-INF, -1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tdp[0][v] = make_pair(0, -1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tbool flg = false;\\n\\t\\tfor (ll c = 1; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (ll v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (ll pv = 0; pv < N; ++pv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tauto [d, h] = dp[c-1][pv];\\n\\t\\t\\t\\t\\tll cost = adj.mat[pv][v];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tchmax(dp[c][v], make_pair(d+cost, pv));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// cout << c << \\\" \\\" << v << \\\" \\\" << dp[c][v].first << \\\" \\\" << dp[c][v].second << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tll t = -1, mx = -INF;\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tif (chmax(mx, dp[ok][v].first)) t = v;\\n\\t\\t}\\n\\t\\tassert(t != -1);\\n\\t\\t\\n\\t\\tvector<ll> res;\\n\\t\\tll now = t, cnt = ok;\\n\\t\\twhile (cnt >= 0)\\n\\t\\t{\\n\\t\\t\\tres.emplace_back(now);\\n\\t\\t\\t\\n\\t\\t\\tauto [d, pv] = dp[cnt][now];\\n\\t\\t\\tnow = pv;\\n\\t\\t\\tcnt--;\\n\\t\\t}\\n\\t\\t\\n\\t\\treverse(res.begin(), res.end());\\n\\t\\tassert(res.size() == ok+1);\\n\\t\\t\\n\\t\\tfor (auto v : res)\\n\\t\\t{\\n\\t\\t\\tcout << v << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\t// auto p = adj.pow(992400);\\n\\t// ll mx = 0;\\n\\t// for (int i = 0; i < N; ++i)\\n\\t// {\\n\\t// \\tfor (int j = 0; j < N; ++j)\\n\\t// \\t{\\n\\t// \\t\\tchmax(mx, p.mat[i][j]);\\n\\t// \\t}\\n\\t// }\\n\\t// cout << mx << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 950,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.4235,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2432_8526865\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nconst ll INF = 1e15;\\n\\ntemplate <class T>\\nstruct Matrix\\n{\\n\\tvector<vector<T>> mat;\\n\\t\\n\\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\\n\\t\\n\\t/*--- operator ---*/\\n\\t\\n\\tint height() const\\n\\t{\\n\\t\\treturn mat.size();\\n\\t}\\n\\t\\n\\tint width() const\\n\\t{\\n\\t\\treturn mat[0].size();\\n\\t}\\n\\t\\n\\tMatrix &operator=(const Matrix &rhs)\\n\\t{\\n\\t\\tthis.mat = rhs.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator-() const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tMatrix ret = *this;\\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\\tret.mat[i][j] = -ret.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tMatrix &operator+=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] += rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator-=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] -= rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator*=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tint hr = rhs.height(), wr = rhs.width();\\n\\t\\tassert(w == hr);\\n\\t\\t\\n\\t\\tMatrix mult(h, wr, 0);\\n\\t\\tfor (int i = 0; i < h; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < wr; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tT ret = (*this).mat[i][j];\\n\\t\\t\\t\\tfor (int k = 0; k < w; ++k)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmult.mat[i][j] = ret;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = mult.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator+(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) += rhs);\\n\\t}\\n\\t\\n\\tMatrix operator-(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) -= rhs);\\n\\t}\\n\\t\\n\\tMatrix operator*(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) *= rhs);\\n\\t}\\n\\t\\n\\t/*--- function ---*/\\n\\t\\n\\tMatrix pow(long long n) const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(h == w);\\n\\t\\t\\n\\t\\tMatrix ret(h, w, 0);\\n\\t\\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\\n\\t\\tMatrix p2 = *this;\\n\\t\\t\\n\\t\\twhile (n > 0)\\n\\t\\t{\\n\\t\\t\\tif (n & 1) {ret *= p2;}\\n\\t\\t\\tp2 *= p2;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tvoid print() const\\n\\t{\\n\\t\\tcout << \\\"Matrix size is \\\" << height() << \\\" * \\\" << width() << \\\".\\\" << endl;\\n\\t\\tfor (int i = 0; i < height(); ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < width(); ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << mat[i][j] << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\\n{\\n\\tll N = mat.mat.size();\\n\\tauto p = mat.pow(mid);\\n\\t\\n\\tll mx = -INF;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < N; ++j)\\n\\t\\t{\\n\\t\\t\\tchmax(mx, p.mat[i][j]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn mx >= K;\\n}\\n\\n// edge num, vertex := (max value, last vertex)\\npair<ll, ll> dp[160][160];\\n\\nvoid calc()\\n{\\n\\tll N, M, K; cin >> N >> M >> K;\\n\\tMatrix<ll> adj(N, N, -INF);\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tll u, v, c; cin >> u >> v >> c;\\n\\t\\tchmax(adj.mat[u][v], c);\\n\\t}\\n\\t\\n\\t{\\n\\t\\tfor (int c = 0; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (int v = 0; v < 160; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[c][v] = make_pair(-INF, -1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tdp[0][v] = make_pair(0, -1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tbool flg = false;\\n\\t\\tll ok = INF;\\n\\t\\tfor (ll c = 1; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (ll v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (ll pv = 0; pv < N; ++pv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tauto [d, h] = dp[c-1][pv];\\n\\t\\t\\t\\t\\tll cost = adj.mat[pv][v];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tchmax(dp[c][v], make_pair(d+cost, pv));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (dp[c][v].first >= K) flg = true;\\n\\t\\t\\t\\t// cout << c << \\\" \\\" << v << \\\" \\\" << dp[c][v].first << \\\" \\\" << dp[c][v].second << endl;\\n\\t\\t\\t}\\n\\t\\t\\tif (flg)\\n\\t\\t\\t{\\n\\t\\t\\t\\tchmin(ok, c);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (flg)\\n\\t\\t{\\n\\t\\t\\tll t = -1, mx = -INF;\\n\\t\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (chmax(mx, dp[ok][v].first)) t = v;\\n\\t\\t\\t}\\n\\t\\t\\tassert(t != -1);\\n\\t\\t\\t\\n\\t\\t\\tvector<ll> res;\\n\\t\\t\\tll now = t, cnt = ok;\\n\\t\\t\\twhile (cnt >= 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tres.emplace_back(now);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tauto [d, pv] = dp[cnt][now];\\n\\t\\t\\t\\tnow = pv;\\n\\t\\t\\t\\tcnt--;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treverse(res.begin(), res.end());\\n\\t\\t\\tassert(res.size() == ok+1);\\n\\t\\t\\t\\n\\t\\t\\tcout << ok << endl;\\n\\t\\t\\tif (ok <= 100)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (auto v : res)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcout << v << \\\" \\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\t{\\n\\t\\t\\tll mx = -INF;\\n\\t\\t\\tfor (int i = 0; i < N; ++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tchmax(mx, dp[159][i].first);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (mx < 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t\\n\\tll ok = 1<<20, ng = 0;\\n\\t\\n\\twhile (abs(ok - ng) > 1)\\n\\t{\\n\\t\\tll mid = (ok + ng) / 2;\\n\\t\\tif (isOK(adj, mid, K)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t\\n\\tcout << ok << endl;\\n\\t\\n\\t// auto p = adj.pow(992400);\\n\\t// ll mx = 0;\\n\\t// for (int i = 0; i < N; ++i)\\n\\t// {\\n\\t// \\tfor (int j = 0; j < N; ++j)\\n\\t// \\t{\\n\\t// \\t\\tchmax(mx, p.mat[i][j]);\\n\\t// \\t}\\n\\t// }\\n\\t// cout << mx << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 4372,\n \"score_of_the_acc\": -0.4552,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2432_8526798\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nconst ll INF = 1e9;\\n\\ntemplate <class T>\\nstruct Matrix\\n{\\n\\tvector<vector<T>> mat;\\n\\t\\n\\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\\n\\t\\n\\t/*--- operator ---*/\\n\\t\\n\\tint height() const\\n\\t{\\n\\t\\treturn mat.size();\\n\\t}\\n\\t\\n\\tint width() const\\n\\t{\\n\\t\\treturn mat[0].size();\\n\\t}\\n\\t\\n\\tMatrix &operator=(const Matrix &rhs)\\n\\t{\\n\\t\\tthis.mat = rhs.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator-() const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tMatrix ret = *this;\\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\\tret.mat[i][j] = -ret.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tMatrix &operator+=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] += rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator-=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] -= rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator*=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tint hr = rhs.height(), wr = rhs.width();\\n\\t\\tassert(w == hr);\\n\\t\\t\\n\\t\\tMatrix mult(h, wr, 0);\\n\\t\\tfor (int i = 0; i < h; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < wr; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tT ret = -INF;\\n\\t\\t\\t\\tfor (int k = 0; k < w; ++k)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmult.mat[i][j] = ret;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = mult.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator+(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) += rhs);\\n\\t}\\n\\t\\n\\tMatrix operator-(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) -= rhs);\\n\\t}\\n\\t\\n\\tMatrix operator*(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) *= rhs);\\n\\t}\\n\\t\\n\\t/*--- function ---*/\\n\\t\\n\\tMatrix pow(long long n) const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(h == w);\\n\\t\\t\\n\\t\\tMatrix ret(h, w, 0);\\n\\t\\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\\n\\t\\tMatrix p2 = *this;\\n\\t\\t\\n\\t\\twhile (n > 0)\\n\\t\\t{\\n\\t\\t\\tif (n & 1) {ret *= p2;}\\n\\t\\t\\tp2 *= p2;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tvoid print() const\\n\\t{\\n\\t\\tcout << \\\"Matrix size is \\\" << height() << \\\" * \\\" << width() << \\\".\\\" << endl;\\n\\t\\tfor (int i = 0; i < height(); ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < width(); ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << mat[i][j] << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\\n{\\n\\tll N = mat.mat.size();\\n\\tauto p = mat.pow(mid);\\n\\t\\n\\tll mx = -INF;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < N; ++j)\\n\\t\\t{\\n\\t\\t\\tchmax(mx, p.mat[i][j]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn mx >= K;\\n}\\n\\n// edge num, vertex := (max value, last vertex)\\npair<ll, ll> dp[160][160];\\n\\nvoid calc()\\n{\\n\\tll N, M, K; cin >> N >> M >> K;\\n\\tMatrix<ll> adj(N, N, -INF);\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tll u, v, c; cin >> u >> v >> c;\\n\\t\\tchmax(adj.mat[u][v], c);\\n\\t}\\n\\t\\n\\t{\\n\\t\\tfor (int c = 0; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (int v = 0; v < 160; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[c][v] = make_pair(-INF, -1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tdp[0][v] = make_pair(0, -1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tbool flg = false;\\n\\t\\tll ok = INF;\\n\\t\\tfor (ll c = 1; c < 160; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (ll v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (ll pv = 0; pv < N; ++pv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tauto [d, h] = dp[c-1][pv];\\n\\t\\t\\t\\t\\tll cost = adj.mat[pv][v];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tchmax(dp[c][v], make_pair(d+cost, pv));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (dp[c][v].first >= K) flg = true;\\n\\t\\t\\t\\t// cout << c << \\\" \\\" << v << \\\" \\\" << dp[c][v].first << \\\" \\\" << dp[c][v].second << endl;\\n\\t\\t\\t}\\n\\t\\t\\tif (flg)\\n\\t\\t\\t{\\n\\t\\t\\t\\tchmin(ok, c);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (flg)\\n\\t\\t{\\n\\t\\t\\tll t = -1, mx = -INF;\\n\\t\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (chmax(mx, dp[ok][v].first)) t = v;\\n\\t\\t\\t}\\n\\t\\t\\tassert(t != -1);\\n\\t\\t\\t\\n\\t\\t\\tvector<ll> res;\\n\\t\\t\\tll now = t, cnt = ok;\\n\\t\\t\\twhile (cnt >= 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tres.emplace_back(now);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tauto [d, pv] = dp[cnt][now];\\n\\t\\t\\t\\tnow = pv;\\n\\t\\t\\t\\tcnt--;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treverse(res.begin(), res.end());\\n\\t\\t\\tassert(res.size() == ok+1);\\n\\t\\t\\t\\n\\t\\t\\tcout << ok << endl;\\n\\t\\t\\tif (ok <= 100)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (auto v : res)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcout << v << \\\" \\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\t{\\n\\t\\t\\tll mx = -INF;\\n\\t\\t\\tfor (int i = 0; i < N; ++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tchmax(mx, dp[159][i].first);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (mx < 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t\\n\\tll ok = 2*K, ng = 0;\\n\\t\\n\\twhile (abs(ok - ng) > 1)\\n\\t{\\n\\t\\tll mid = (ok + ng) / 2;\\n\\t\\tif (isOK(adj, mid, K)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t\\n\\tcout << ok << endl;\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 1120,\n \"memory_kb\": 4304,\n \"score_of_the_acc\": -0.5499,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2432_8526714\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nconst ll INF = 1e9;\\n\\ntemplate <class T>\\nstruct Matrix\\n{\\n\\tvector<vector<T>> mat;\\n\\t\\n\\tMatrix(int r, int c, T init_value = 0) : mat(r, vector<T>(c, init_value)) { }\\n\\t\\n\\t/*--- operator ---*/\\n\\t\\n\\tint height() const\\n\\t{\\n\\t\\treturn mat.size();\\n\\t}\\n\\t\\n\\tint width() const\\n\\t{\\n\\t\\treturn mat[0].size();\\n\\t}\\n\\t\\n\\tMatrix &operator=(const Matrix &rhs)\\n\\t{\\n\\t\\tthis.mat = rhs.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator-() const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tMatrix ret = *this;\\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\\tret.mat[i][j] = -ret.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tMatrix &operator+=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] += rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator-=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(rhs.height() == h && rhs.width() == w);\\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\\tthis.mat[i][j] -= rhs.mat[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix &operator*=(const Matrix &rhs)\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tint hr = rhs.height(), wr = rhs.width();\\n\\t\\tassert(w == hr);\\n\\t\\t\\n\\t\\tMatrix mult(h, wr, 0);\\n\\t\\tfor (int i = 0; i < h; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < wr; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tT ret = -INF;\\n\\t\\t\\t\\tfor (int k = 0; k < w; ++k)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tret = max(ret, (*this).mat[i][k] + rhs.mat[k][j]); \\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmult.mat[i][j] = ret;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat = mult.mat;\\n\\t\\treturn *this;\\n\\t}\\n\\t\\n\\tMatrix operator+(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) += rhs);\\n\\t}\\n\\t\\n\\tMatrix operator-(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) -= rhs);\\n\\t}\\n\\t\\n\\tMatrix operator*(const Matrix &rhs) const\\n\\t{\\n\\t\\treturn (Matrix(*this) *= rhs);\\n\\t}\\n\\t\\n\\t/*--- function ---*/\\n\\t\\n\\tMatrix pow(long long n) const\\n\\t{\\n\\t\\tint h = height(), w = width();\\n\\t\\tassert(h == w);\\n\\t\\t\\n\\t\\tMatrix ret(h, w, 0);\\n\\t\\t// for (int i = 0; i < w; ++i) {ret.mat[i][i] = 1;}\\n\\t\\tMatrix p2 = *this;\\n\\t\\t\\n\\t\\twhile (n > 0)\\n\\t\\t{\\n\\t\\t\\tif (n & 1) {ret *= p2;}\\n\\t\\t\\tp2 *= p2;\\n\\t\\t\\tn >>= 1;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\t\\n\\tvoid print() const\\n\\t{\\n\\t\\tcout << \\\"Matrix size is \\\" << height() << \\\" * \\\" << width() << \\\".\\\" << endl;\\n\\t\\tfor (int i = 0; i < height(); ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = 0; j < width(); ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcout << mat[i][j] << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nbool isOK(const Matrix<ll> &mat, ll mid, ll K)\\n{\\n\\tll N = mat.mat.size();\\n\\tauto p = mat.pow(mid);\\n\\t\\n\\tll mx = -INF;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < N; ++j)\\n\\t\\t{\\n\\t\\t\\tchmax(mx, p.mat[i][j]);\\n\\t\\t}\\n\\t}\\n\\t\\n\\treturn mx >= K;\\n}\\n\\n// edge num, vertex := (max value, last vertex)\\npair<ll, ll> dp[110][110];\\n\\nvoid calc()\\n{\\n\\tll N, M, K; cin >> N >> M >> K;\\n\\tMatrix<ll> adj(N, N, -INF);\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tll u, v, c; cin >> u >> v >> c;\\n\\t\\tchmax(adj.mat[u][v], c);\\n\\t}\\n\\t\\n\\tll ok = 2*K, ng = 0;\\n\\t\\n\\tif (!isOK(adj, ok, K))\\n\\t{\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn;\\n\\t}\\n\\t\\n\\twhile (abs(ok - ng) > 1)\\n\\t{\\n\\t\\tll mid = (ok + ng) / 2;\\n\\t\\tif (isOK(adj, mid, K)) ok = mid;\\n\\t\\telse ng = mid;\\n\\t}\\n\\t\\n\\tcout << ok << endl;\\n\\t\\n\\tif (ok <= 100)\\n\\t{\\n\\t\\tfor (int c = 0; c < 110; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (int v = 0; v < 110; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[c][v] = make_pair(-INF, -1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tdp[0][v] = make_pair(0, -1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (ll c = 1; c <= ok; ++c)\\n\\t\\t{\\n\\t\\t\\tfor (ll v = 0; v < N; ++v)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (ll pv = 0; pv < N; ++pv)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tauto [d, h] = dp[c-1][pv];\\n\\t\\t\\t\\t\\tll cost = adj.mat[pv][v];\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tchmax(dp[c][v], make_pair(d+cost, pv));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// cout << c << \\\" \\\" << v << \\\" \\\" << dp[c][v].first << \\\" \\\" << dp[c][v].second << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tll t = -1, mx = -INF;\\n\\t\\tfor (int v = 0; v < N; ++v)\\n\\t\\t{\\n\\t\\t\\tif (chmax(mx, dp[ok][v].first)) t = v;\\n\\t\\t}\\n\\t\\tassert(t != -1);\\n\\t\\t\\n\\t\\tvector<ll> res;\\n\\t\\tll now = t, cnt = ok;\\n\\t\\twhile (cnt >= 0)\\n\\t\\t{\\n\\t\\t\\tres.emplace_back(now);\\n\\t\\t\\t\\n\\t\\t\\tauto [d, pv] = dp[cnt][now];\\n\\t\\t\\tnow = pv;\\n\\t\\t\\tcnt--;\\n\\t\\t}\\n\\t\\t\\n\\t\\treverse(res.begin(), res.end());\\n\\t\\t\\n\\t\\tassert(res.size() == ok+1);\\n\\t\\tfor (auto v : res)\\n\\t\\t{\\n\\t\\t\\tcout << v << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t\\t\\n\\t}\\n\\t\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.7333333333333333,\n \"time_ms\": 1170,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.4951,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2432_8370278\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\t// step #1. input\\n\\tint V, E, K;\\n\\tcin >> V >> E >> K;\\n\\tconst int INF = 1012345678;\\n\\tvector<vector<int> > d(V, vector<int>(V, -INF));\\n\\tfor (int i = 0; i < E; i++) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\td[a][b] = max(d[a][b], c);\\n\\t}\\n\\n\\t// step #2. first dp\\n\\tconst int limit = 100;\\n\\tvector<vector<int> > dp1(limit + 1, vector<int>(V, -INF));\\n\\tvector<vector<int> > pre(limit + 1, vector<int>(V, -1));\\n\\tdp1[0] = vector<int>(V, 0);\\n\\tfor (int i = 1; i <= limit; i++) {\\n\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\tif (d[k][j] != -INF && dp1[i][j] < dp1[i - 1][k] + d[k][j]) {\\n\\t\\t\\t\\t\\tdp1[i][j] = dp1[i - 1][k] + d[k][j];\\n\\t\\t\\t\\t\\tpre[i][j] = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tbool found = false;\\n\\tfor (int i = 0; i <= limit && !found; i++) {\\n\\t\\tint pos = max_element(dp1[i].begin(), dp1[i].end()) - dp1[i].begin();\\n\\t\\tif (dp1[i][pos] >= K) {\\n\\t\\t\\tfound = true;\\n\\t\\t\\tvector<int> v(i + 1);\\n\\t\\t\\tv[i] = pos;\\n\\t\\t\\tfor (int j = i - 1; j >= 0; j--) {\\n\\t\\t\\t\\tv[j] = pre[j + 1][v[j + 1]];\\n\\t\\t\\t}\\n\\t\\t\\tcout << i << endl;\\n\\t\\t\\tfor (int j = 0; j <= i; j++) {\\n\\t\\t\\t\\tif (j != 0) {\\n\\t\\t\\t\\t\\tcout << ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << v[j];\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. second dp\\n\\tif (!found) {\\n\\t\\tconst int bits = 32 - __builtin_clz(K + 1);\\n\\t\\tvector<vector<vector<int> > > dp2(bits);\\n\\t\\tdp2[0] = d;\\n\\t\\tfor (int i = 1; i < bits; i++) {\\n\\t\\t\\tdp2[i] = dp2[i - 1];\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tfor (int l = 0; l < V; l++) {\\n\\t\\t\\t\\t\\t\\tif (dp2[i - 1][j][l] != -INF && dp2[i - 1][l][k] != -INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp2[i][j][k] = max(dp2[i][j][k], dp2[i - 1][j][l] + dp2[i - 1][l][k]);\\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\\tvector<vector<int> > dp3(V, vector<int>(V, -INF));\\n\\t\\tfor (int i = 0; i < V; i++) {\\n\\t\\t\\tdp3[i][i] = 0;\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = bits - 1; i >= 0; i--) {\\n\\t\\t\\tvector<vector<int> > dp4(V, vector<int>(V, -INF));\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tfor (int l = 0; l < V; l++) {\\n\\t\\t\\t\\t\\t\\tif (dp3[j][l] != -INF && dp2[i][l][k] != -INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp4[j][k] = max(dp4[j][k], dp3[j][l] + dp2[i][l][k]);\\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\\tbool flag = false;\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tif (dp4[j][k] >= K) {\\n\\t\\t\\t\\t\\t\\tflag = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!flag) {\\n\\t\\t\\t\\tdp3 = dp4;\\n\\t\\t\\t\\tans += (1 << i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans += 1;\\n\\t\\tif (ans == (1 << bits)) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << ans << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 5672,\n \"score_of_the_acc\": -0.3673,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2432_8370265\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n\\t// step #1. input\\n\\tint V, E, K;\\n\\tcin >> V >> E >> K;\\n\\tconst int INF = 1012345678;\\n\\tvector<vector<int> > d(V, vector<int>(V, -INF));\\n\\tfor (int i = 0; i < E; i++) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\td[a][b] = max(d[a][b], c);\\n\\t}\\n\\n\\t// step #2. first dp\\n\\tconst int limit = 100;\\n\\tvector<vector<int> > dp1(limit + 1, vector<int>(V, -INF));\\n\\tvector<vector<int> > pre(limit + 1, vector<int>(V, -1));\\n\\tdp1[0] = vector<int>(V, 0);\\n\\tfor (int i = 1; i <= limit; i++) {\\n\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\tif (d[k][j] != -INF && dp1[i][j] < dp1[i - 1][k] + d[k][j]) {\\n\\t\\t\\t\\t\\tdp1[i][j] = dp1[i - 1][k] + d[k][j];\\n\\t\\t\\t\\t\\tpre[i][j] = k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tbool found = false;\\n\\tfor (int i = 0; i <= limit && !found; i++) {\\n\\t\\tint pos = max_element(dp1[i].begin(), dp1[i].end()) - dp1[i].begin();\\n\\t\\tif (dp1[i][pos] >= K) {\\n\\t\\t\\tfound = true;\\n\\t\\t\\tvector<int> v(i + 1);\\n\\t\\t\\tv[i] = pos;\\n\\t\\t\\tfor (int j = i - 1; j >= 0; j--) {\\n\\t\\t\\t\\tv[j] = pre[j + 1][v[j + 1]];\\n\\t\\t\\t}\\n\\t\\t\\tcout << i << endl;\\n\\t\\t\\tfor (int j = 0; j <= i; j++) {\\n\\t\\t\\t\\tif (j != 0) {\\n\\t\\t\\t\\t\\tcout << ' ';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << v[j];\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. second dp\\n\\tif (!found) {\\n\\t\\tconst int bits = 32 - __builtin_clz(K + 1);\\n\\t\\tvector<vector<vector<int> > > dp2(bits, vector<vector<int> >(V, vector<int>(V, -INF)));\\n\\t\\tdp2[0] = d;\\n\\t\\tfor (int i = 1; i < bits; i++) {\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tfor (int l = 0; l < V; l++) {\\n\\t\\t\\t\\t\\t\\tif (dp2[i - 1][j][l] != -INF && dp2[i - 1][l][k] != -INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp2[i][j][k] = max(dp2[i][j][k], dp2[i - 1][j][l] + dp2[i - 1][l][k]);\\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\\tvector<vector<int> > dp3(V, vector<int>(V, -INF));\\n\\t\\tfor (int i = 0; i < V; i++) {\\n\\t\\t\\tdp3[i][i] = 0;\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = bits - 1; i >= 0; i--) {\\n\\t\\t\\tvector<vector<int> > dp4(V, vector<int>(V, -INF));\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tfor (int l = 0; l < V; l++) {\\n\\t\\t\\t\\t\\t\\tif (dp3[j][l] != -INF && dp2[i][l][k] != -INF) {\\n\\t\\t\\t\\t\\t\\t\\tdp4[j][k] = max(dp4[j][k], dp3[j][l] + dp2[i][l][k]);\\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\\tbool flag = false;\\n\\t\\t\\tfor (int j = 0; j < V; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < V; k++) {\\n\\t\\t\\t\\t\\tif (dp4[j][k] >= K) {\\n\\t\\t\\t\\t\\t\\tflag = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!flag) {\\n\\t\\t\\t\\tdp3 = dp4;\\n\\t\\t\\t\\tans += (1 << i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tans += 1;\\n\\t\\tif (ans == (1 << bits)) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << ans << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 220,\n \"memory_kb\": 5708,\n \"score_of_the_acc\": -0.3792,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2432_8064226\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 150) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6088,\n \"score_of_the_acc\": -0.4426,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2432_8064223\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[110][155], prv[110][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 100) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[20], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 19) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 5856,\n \"score_of_the_acc\": -0.393,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2432_8064221\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 50) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 0.3333333333333333,\n \"time_ms\": 160,\n \"memory_kb\": 5800,\n \"score_of_the_acc\": -0.3675,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2432_8064219\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 130) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5928,\n \"score_of_the_acc\": -0.4117,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2432_8064218\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\ninline void maxUpdate(int &a, int b) { a = max(a, b); }\\ninline void mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 150) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 5968,\n \"score_of_the_acc\": -0.4146,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2432_8064217\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 70) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 0.3333333333333333,\n \"time_ms\": 160,\n \"memory_kb\": 5792,\n \"score_of_the_acc\": -0.3659,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2432_8064216\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 80) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 0.3333333333333333,\n \"time_ms\": 160,\n \"memory_kb\": 5784,\n \"score_of_the_acc\": -0.3644,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2432_8064212\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 100) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6044,\n \"score_of_the_acc\": -0.4341,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2432_8064209\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = a;\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 120) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 5992,\n \"score_of_the_acc\": -0.4241,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2432_8061039\",\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 for_rev(i, a, b) for (int i = (a); i >= (b); --i)\\ntypedef vector<int> Ary;\\ntypedef vector<Ary> Mat;\\nstruct Edge {\\n int to, c;\\n};\\nvoid maxUpdate(int &a, int b) { a = max(a, b); }\\nvoid mul(Mat &res, Mat &a, Mat &b) {\\n int N = a.size();\\n res = Mat(N, Ary(N, -1));\\n for_(i, 0, N) for_(j, 0, N) for_(k, 0, N) {\\n if (a[i][k] >= 0 && b[k][j] >= 0)\\n maxUpdate(res[i][j], a[i][k] + b[k][j]);\\n }\\n}\\nint V, K, E, dp[155][155], prv[155][155];\\nvector<vector<Edge>> adj;\\nvoid restore(int step, int v) {\\n int c = step;\\n vector<int> path;\\n while (v != -1) {\\n path.push_back(v);\\n v = prv[c--][v];\\n }\\n reverse(path.begin(), path.end());\\n for_(i, 0, step + 1) cout << path[i] << (i < step ? \\\" \\\" : \\\"\\\\n\\\");\\n}\\nbool shortPhase() {\\n memset(dp, -1, sizeof(dp));\\n memset(prv, -1, sizeof(prv));\\n for_(v, 0, V) dp[0][v] = 0;\\n int max_score = -1, step = -1, terminal = -1;\\n for_(i, 0, 150) {\\n for_(v, 0, V) {\\n if (dp[i][v] == -1)\\n continue;\\n for (Edge e : adj[v]) {\\n if (dp[i + 1][e.to] < dp[i][v] + e.c) {\\n dp[i + 1][e.to] = dp[i][v] + e.c;\\n prv[i + 1][e.to] = v;\\n if (max_score < dp[i + 1][e.to]) {\\n max_score = dp[i + 1][e.to];\\n terminal = e.to;\\n }\\n }\\n }\\n }\\n if (max_score >= K) {\\n step = i + 1;\\n break;\\n }\\n }\\n if (max_score >= K) {\\n cout << step << endl;\\n restore(step, terminal);\\n return true;\\n }\\n if (max_score == -1) {\\n cout << -1 << endl;\\n return true;\\n }\\n return false;\\n}\\nint calcMinStep() {\\n Mat mat[21], ini(V, Ary(V, -1));\\n for_(v, 0, V) for (Edge e : adj[v]) { maxUpdate(ini[v][e.to], e.c); }\\n mat[0] = ini;\\n for_(i, 0, 20) mul(mat[i + 1], mat[i], mat[i]);\\n int res = 0;\\n Mat x(V, Ary(V, -1)), nx;\\n for_(v, 0, V) x[v][v] = 0;\\n for_rev(h, 19, 0) {\\n mul(nx, x, mat[h]);\\n int max_score = 0;\\n for_(u, 0, V) for_(v, 0, V) maxUpdate(max_score, nx[u][v]);\\n if (max_score < K) {\\n x = nx;\\n res += 1 << h;\\n }\\n }\\n return res + 1;\\n}\\nvoid solve() {\\n if (!shortPhase()) {\\n int ans = calcMinStep();\\n cout << (ans > (int)1e6 ? -1 : ans) << endl;\\n }\\n}\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout.tie(NULL);\\n cin >> V >> E >> K;\\n adj.assign(V, vector<Edge>());\\n for_(i, 0, E) {\\n int u, v, c;\\n cin >> u >> v >> c;\\n adj[u].push_back(Edge{v, c});\\n }\\n solve();\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 200,\n \"memory_kb\": 6008,\n \"score_of_the_acc\": -0.4272,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1396,"cells":{"group_id":{"kind":"string","value":"aoj_2435_cpp"},"problem_description":{"kind":"string","value":"問題名 Zero division checker\n森下さんは困っていました... 姉原さんにプログラムを書いてもらったのですが、そのプログラムがクラッシュするのです。\n姉原さんに書いてもらったのは、逆ポーランド記法の式を読んで、その計算結果を出力するプログラムで、クラッシュログによると、 0 で割り算をしてしまったのが原因のようです。これは、森下さんが間違った式を入力してしまったからかもしれませんし、もしかしたら、もしかしたら、姉原さんの書いたプログラムにバグがあるのかもしれません。\n姉原さんの書いたプログラムを読んでみようと思いましたが、姉原さんのプログラムはアセンブリというよくわからないことばで書かれているようで、見ているだけで頭がガンガンしてきます。\nそこで、森下さんはあなたに、式が間違っていないかどうか調べるプログラムを書いてもらうことにしました。式が間違っている、とは、その式に従って計算すると、 0 での割り算をしてしまう可能性のあることをいいます。\nなお、姉原さんの書いたコードはとてもふるいコンピューターで動くもので、加減乗除は整数で行い、結果は 8 bit の符号なし整数として保存されます。\n例えば、\n255+1\nは 0 になってしまうし、\n3/2\nは 1 になります。\nあ、姉原さんにはないしょですよ。\n(参考)逆ポーランド記法で表された式を計算する、擬似コード\ns = 空のスタック\nn = 式の要素数\nfor i in 1..n:\n if 式のi番目の要素が整数:\n sにその整数をプッシュする\n if 式のi番目の要素が変数:\n sにその変数の値をプッシュする\n if 式のi番目の要素が演算子:\n sから値をポップし、bとする\n sから値をポップし、aとする\n if 演算子が'+':\n r = (a + b) % 256 とする\n if 演算子が'-':\n r = (a - b + 256) % 256 とする\n if 演算子が'*':\n r = (a * b) % 256 とする\n if 演算子が'/':\n r = (a / b) % 256 とする\n sにrをプッシュする\nsから値をポップし、式の計算結果とする\nInput\nm\nname\n1\nlb\n1\nub\n1\n...\nname\nm\nlb\nm\nub\nm\nn\ne\n1\ne\n2\n...\ne\nn\n0 ≤ m ≤ 100\n0 ≤ lb\ni\n≤ ub\ni\n≤ 255\n1 ≤ name\ni\n(1 ≤ i ≤ m) の長さ ≤ 20\n1 ≤ n ≤ 100\nm\nは変数の数、\nname\ni\n,\nlb\ni\n,\nub\ni\nはそれぞれ変数iの名前、下限、上限を表します。\nn\nは式に含まれる要素の数を表し、\ne\ni\nは式の\ni\n番目の要素を表します。\n各変数は式の中に高々1回しか現れません。\nOutput\n式が間違っているときには\nerror\n、間違っていないときには\ncorrect\nと一行で出力してください。\nSample Input 1\n1\na 1 10\n3\n10 a /\nOutput for the Sample Input 1\ncorrect\nSample Input 2\n2\na 1 10\nb 1 10\n5\n1 a b - /\nOutput for the Sample Input 2\nerror\nSample Input 3\n1\na 0 255\n7\n1 a 2 * 1 + /\nOutput for the Sample Input 3\ncorrect"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2435_6708649","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\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, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const 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 T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\n/*\n reference: https://gist.github.com/draftcode/1357281\n*/\n\nnamespace ebi {\n\ntypedef std::string::const_iterator State;\nclass ParseError {};\n\nbool expect(State &begin, char expected) {\n if (*begin == expected) {\n return true;\n } else {\n return false;\n }\n}\n\n// beginがexpectedを指していたらbeginを一つ進める。\nvoid consume(State &begin, char expected) {\n if (*begin == expected) {\n begin++;\n } else {\n std::cerr << \"Expected '\" << expected << \"' but got '\" << *begin << \"'\"\n << std::endl;\n std::cerr << \"Rest string is '\";\n while (*begin) {\n std::cerr << *begin++;\n }\n std::cerr << \"'\" << std::endl;\n throw ParseError();\n }\n}\n\nbool isdigit(char c) { return '0' <= c && c <= '9'; }\n\nbool isAlpha(char c) { return 'A' <= c && c <= 'Z'; }\n\nbool isalpha(char c) { return 'a' <= c && c <= 'z'; }\n\n} // namespace ebi\n\nnamespace ebi {\n\nvoid main_() {\n int m;\n std::cin >> m;\n std::map<std::string, std::pair<int, int>> map;\n rep(i, 0, m) {\n std::string name;\n int lb, ub;\n std::cin >> name >> lb >> ub;\n map[name] = {lb, ub};\n }\n std::vector<std::set<int>> vset;\n std::stack<int> stack;\n int n;\n std::cin >> n;\n auto isoperator = [](const std::string &s) -> bool {\n if (s == \"+\" || s == \"-\" || s == \"*\" || s == \"/\")\n return true;\n else\n return false;\n };\n rep(i, 0, n) {\n std::string e;\n std::cin >> e;\n std::set<int> set;\n\n if (isoperator(e)) {\n auto r = stack.top();\n stack.pop();\n auto l = stack.top();\n stack.pop();\n for (auto lv : vset[l]) {\n for (auto rv : vset[r]) {\n int ret;\n if (e == \"+\") {\n ret = lv + rv;\n } else if (e == \"-\") {\n ret = lv - rv;\n } else if (e == \"*\") {\n ret = lv * rv;\n } else if (e == \"/\") {\n if (rv == 0) {\n std::cout << \"error\\n\";\n return;\n }\n ret = lv / rv;\n } else\n assert(0);\n ret = (ret + 256) % 256;\n set.insert(ret);\n }\n }\n } else {\n if (map.find(e) == map.end()) {\n int num = 0;\n for (auto c : e) {\n assert('0' <= c && c <= '9');\n num *= 10;\n num += c - '0';\n }\n set.insert(num);\n } else {\n auto [lb, ub] = map[e];\n rep(j, lb, ub + 1) { set.insert(j); }\n }\n }\n stack.push(vset.size());\n vset.emplace_back(set);\n }\n assert(stack.size() == 1);\n std::cout << \"correct\\n\";\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3772,"score_of_the_acc":-1,"final_rank":17},{"submission_id":"aoj_2435_6357529","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 m; cin >> m;\n map<string,set<int>> mp;\n rep(_,m) {\n string name; int lb,ub; cin >> name >> lb >> ub;\n set<int> s;\n for(int i = lb; i <= ub; i++) s.insert(i);\n mp[name] = s;\n }\n\n stack<set<int>> s;\n int n; cin >> n;\n bool flag = false;\n rep(_,n) {\n string e; cin >> e;\n if(isdigit(e[0])) {\n set<int> se;\n se.insert(stoi(e));\n s.push(se);\n } else if(mp.count(e)) {\n s.push(mp[e]);\n } else {\n set<int> b = s.top(); s.pop();\n set<int> a = s.top(); s.pop();\n\n set<int> c;\n for(int xa : a) for(int xb : b) {\n if(e == \"+\") c.insert((xa + xb) % 256);\n if(e == \"-\") c.insert((xa - xb + 256) % 256);\n if(e == \"*\") c.insert((xa * xb) % 256);\n if(e == \"/\") {\n if(xb == 0) {\n flag = true;\n } else {\n c.insert((xa / xb) % 256);\n }\n }\n }\n s.push(c);\n }\n }\n\n cout << (flag ? \"error\" : \"correct\") << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3608,"score_of_the_acc":-1.205,"final_rank":18},{"submission_id":"aoj_2435_5939732","code_snippet":"// I SELL YOU...! \n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<functional>\n#include<queue>\n#include<chrono>\n#include<iomanip>\n#include<map>\n#include<stack>\n#include<set>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll,vector<ll>>;\nusing TP = tuple<ll,ll,ll>;\nvoid init_io(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(18);\n}\nconst ll MOD = 256;\nsigned main(){\n init_io();\n ll m;\n cin >> m;\n map<string, vector<ll>> mp;\n vector<string> name(m);\n vector<ll> lb(m), ub(m);\n for(int i=0;i<m;i++){\n cin >> name[i] >> lb[i] >> ub[i];\n vector<ll> able(MOD, 0);\n for(int j=lb[i];j<=ub[i];j++) {\n able[j] = 1;\n }\n mp[name[i]] = able;\n }\n ll n;\n cin >> n;\n vector<string> e(n);\n for(int i=0;i<n;i++) {\n cin >> e[i];\n }\n stack<vector<ll>> st;\n for(int i=0;i<n;i++) {\n if (e[i] == \"+\" || e[i] == \"*\" || e[i] == \"-\" || e[i] == \"/\") {\n vector<ll> able(MOD, 0);\n auto y = st.top(); st.pop();\n auto x = st.top(); st.pop();\n for(int p0=0;p0<MOD;p0++) {\n for(int p1=0;p1<MOD;p1++) {\n if (!x[p0] || !y[p1]) continue;\n if (e[i] == \"+\") {\n able[(p0+p1)%MOD] = 1;\n }\n if (e[i] == \"-\") {\n able[(p0-p1+MOD)%MOD] = 1;\n }\n if (e[i] == \"*\") {\n able[(p0*p1)%MOD] = 1;\n }\n if (e[i] == \"/\") {\n if (p1==0) {\n cout << \"error\" << endl;\n return 0;\n }\n able[(p0/p1)%MOD] = 1;\n }\n }\n }\n st.push(able);\n } else if (mp.find(e[i])!=mp.end()){\n st.push(mp[e[i]]);\n } else {\n vector<ll> able(MOD, 0);\n able[stoi(e[i])] = 1;\n st.push(able);\n }\n }\n cout << \"correct\"<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3560,"score_of_the_acc":-0.6187,"final_rank":14},{"submission_id":"aoj_2435_5820110","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.08.24 22:57:22 */\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 = 1e6;\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\n#pragma region graph\n\nstruct Edge {\n\tint to;\n\tlong long cost;\n\tEdge() = default;\n\tEdge(int to_, long long cost_) : to(to_), cost(cost_) {}\n\tbool operator<(const Edge &a) const { return cost < a.cost; }\n\tbool operator>(const Edge &a) const { return cost > a.cost; }\n\tfriend std::ostream &operator<<(std::ostream &s, Edge &a) {\n\t\ts << \"to: \" << a.to << \", cost: \" << a.cost;\n\t\treturn s;\n\t}\n};\n\nclass Graph {\n\tstd::vector<std::vector<Edge>> edges;\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 edges.size(); }\n\tvoid resize(const int n) { edges.resize(n); }\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 long long INF = 3e18;\n\n\tvoid input(int e = -1, bool weight = 0, 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\tlong long cost = 1;\n\t\t\tstd::cin >> u >> v;\n\t\t\tif(weight) std::cin >> cost;\n\t\t\tu -= idx, v -= idx;\n\t\t\tedges[u].emplace_back(v, cost);\n\t\t\tif(!directed) edges[v].emplace_back(u, cost);\n\t\t}\n\t}\n\n\tvoid add_edge(int u, int v, long long cost = 1, bool directed = false, int idx = 0) {\n\t\tu -= idx, v -= idx;\n\t\tedges[u].emplace_back(v, cost);\n\t\tif(!directed) edges[v].emplace_back(u, cost);\n\t}\n\n\t// Ο(V+E)\n\tstd::vector<long long> bfs(int s) {\n\t\tstd::vector<long long> 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 one\n\tstd::vector<long long> zero_one_bfs(int s) {\n\t\tstd::vector<long long> 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\tassert(0LL <= e.cost and e.cost < 2LL);\n\t\t\t\tif(e.cost and dist[e.to] > dist[v] + 1) {\n\t\t\t\t\tdist[e.to] = dist[v] + 1;\n\t\t\t\t\tdeq.push_back(e.to);\n\t\t\t\t} else if(!e.cost and dist[e.to] > dist[v]) {\n\t\t\t\t\tdist[e.to] = dist[v];\n\t\t\t\t\tdeq.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)logV)\n\t// cannot reach: INF\n\tstd::vector<long long> dijkstra(int s) { // verified\n\t\tstd::vector<long long> dist(size(), INF);\n\t\tconst auto compare = [](const std::pair<long long, int> &a, const std::pair<long long, int> &b) { return a.first > b.first; };\n\t\tstd::priority_queue<std::pair<long long, int>, std::vector<std::pair<long long, 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<long long, 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// cannot reach: INF\n\t// negative cycle: -INF\n\tstd::vector<long long> bellman_ford(int s) { // verified\n\t\tint n = size();\n\t\tstd::vector<long long> 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<long long>> warshall_floyd() {\t// verified\n\t\tint n = size();\n\t\tstd::vector<std::vector<long long>> dist(n, std::vector<long long>(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 directed cycle exists, return {}\n\tstd::vector<int> topological_sort() { // verified\n\t\tstd::vector<int> res;\n\t\tint n = size();\n\t\tstd::vector<int> used(n, 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 < n; 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() { return !topological_sort().empty(); } // verified\n\n\t// Ο(V)\n\t// array of the distance from each vertex to the most distant vertex\n\tstd::vector<long long> height() { // verified\n\t\tauto vec1 = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tlong long 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() {\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() { return !bipartite_grouping().empty(); }\n\n\t// Ο(V+E)\n\t// ((v1, v2), diameter)\n\tstd::pair<std::pair<int, int>, long long> diameter() {\t// verified\n\t\tauto vec = bfs(0);\n\t\tint v1 = -1, v2 = -1;\n\t\tlong long dia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec[i]) dia = vec[i], v1 = i;\n\t\tvec = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec[i]) dia = vec[i], v2 = i;\n\t\tstd::pair<std::pair<int, int>, long long> res = {{v1, v2}, dia};\n\t\treturn res;\n\t}\n\n\t// Ο(ElogV)\n\tlong long prim() {\t// verified\n\t\tlong long 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// Ο(ElogE)\n\tlong long kruskal() { // verified\n\t\tstd::vector<std::tuple<int, int, long long>> Edges;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\n\t\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &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\tlong long ret = 0;\n\t\tfor(auto &e : Edges)\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() {\n\t\tint n = size();\n\t\tstd::vector<int> centroid, sz(n);\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] > n / 2) is_centroid = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(n - sz[now] > n / 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// Ο(V+E)\n\t// directed graph from root to leaf\n\tGraph root_to_leaf(int root = 0) {\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) {\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// long long Chu_Liu_Edmonds(int root = 0) {}\n};\n\nstruct tree_doubling {\n private:\n\tstd::vector<std::vector<int>> parent;\n\tstd::vector<int> depth;\n\tstd::vector<long long> dist;\n\tint max_jump = 1;\n\n\tvoid build() {\n\t\tfor(int i = 0; i < max_jump - 1; i++) {\n\t\t\tfor(int v = 0; v < (int)dist.size(); v++) {\n\t\t\t\tif(parent[i][v] == -1)\n\t\t\t\t\tparent[i + 1][v] = -1;\n\t\t\t\telse\n\t\t\t\t\tparent[i + 1][v] = parent[i][parent[i][v]];\n\t\t\t}\n\t\t}\n\t}\n\n public:\n\ttree_doubling() = default;\n\ttree_doubling(const Graph &g, const int root = 0) : dist(g.size()), depth(g.size()) {\n\t\tint n = g.size();\n\t\twhile((1 << max_jump) < n) max_jump++;\n\t\tparent.assign(max_jump, std::vector<int>(n, -1));\n\t\tauto dfs = [&](auto self, int now, int per, int d, long long cost) -> void {\n\t\t\tparent[0][now] = per;\n\t\t\tdepth[now] = d;\n\t\t\tdist[now] = cost;\n\t\t\tfor(auto &e : g[now])\n\t\t\t\tif(e.to != per) self(self, e.to, now, d + 1, cost + e.cost);\n\t\t};\n\t\tdfs(dfs, root, -1, 0, 0LL);\n\t\tbuild();\n\t}\n\n\tint lowest_common_ancestor(int u, int v) {\n\t\tif(depth[u] < depth[v]) std::swap(u, v);\n\t\tint k = parent.size();\n\t\tfor(int i = 0; i < k; i++)\n\t\t\tif((depth[u] - depth[v]) >> i & 1) u = parent[i][u];\n\t\tif(u == v) return u;\n\t\tfor(int i = k - 1; i >= 0; i--)\n\t\t\tif(parent[i][u] != parent[i][v]) u = parent[i][u], v = parent[i][v];\n\t\treturn parent[0][u];\n\t}\n\n\tlong long length_of_path(const int u, const int v) { return dist[u] + dist[v] - dist[lowest_common_ancestor(u, v)] * 2; }\n\n\tint level_ancestor(int v, int level) {\n\t\tassert(level >= 0);\n\t\tfor(int jump = 0; jump < max_jump and level; jump++) {\n\t\t\tif(level & 1) v = parent[jump][v];\n\t\t\tlevel >>= 1;\n\t\t}\n\t\treturn v;\n\t}\n};\n\nstruct strongly_connected_components {\n private:\n\tenum { CHECKED = -1, UNCHECKED = -2 };\n\tconst Graph &graph_given;\n\tGraph graph_reversed;\n\tstd::vector<int> order, group_number; /* at the beginning of the building, 'group_number' is used as 'checked' */\n\n\tvoid dfs(int now) {\n\t\tif(group_number[now] != UNCHECKED) return;\n\t\tgroup_number[now] = CHECKED;\n\t\tfor(auto &e : graph_given[now]) dfs(e.to);\n\t\torder.push_back(now);\n\t}\n\n\tvoid rdfs(int now, int group_count) {\n\t\tif(group_number[now] != UNCHECKED) return;\n\t\tgroup_number[now] = group_count;\n\t\tfor(auto &e : graph_reversed[now]) rdfs(e.to, group_count);\n\t}\n\n\tvoid build(bool create_compressed_graph) {\n\t\tfor(int i = 0; i < (int)graph_given.size(); i++) dfs(i);\n\t\treverse(order.begin(), order.end());\n\t\tgroup_number.assign(graph_given.size(), UNCHECKED);\n\t\tint group = 0;\n\t\tfor(auto &i : order)\n\t\t\tif(group_number[i] == UNCHECKED) rdfs(i, group), group++;\n\t\tgraph_compressed.resize(group);\n\t\tgroups.resize(group);\n\t\tfor(int i = 0; i < (int)graph_given.size(); i++) groups[group_number[i]].push_back(i);\n\t\tif(create_compressed_graph) {\n\t\t\tstd::vector<int> edges(group, -1);\n\t\t\tfor(int i = 0; i < group; i++)\n\t\t\t\tfor(auto &vertex : groups[i])\n\t\t\t\t\tfor(auto &e : graph_given[vertex])\n\t\t\t\t\t\tif(group_number[e.to] != i and edges[group_number[e.to]] != i) {\n\t\t\t\t\t\t\tedges[group_number[e.to]] = i;\n\t\t\t\t\t\t\tgraph_compressed[i].emplace_back(group_number[e.to], 1);\n\t\t\t\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\n public:\n\tstd::vector<std::vector<int>> groups;\n\tGraph graph_compressed;\n\n\tstrongly_connected_components(const Graph &g_, bool create_compressed_graph = false)\n\t\t: graph_given(g_), graph_reversed(g_.size()), group_number(g_.size(), UNCHECKED) {\n\t\tfor(size_t i = 0; i < g_.size(); i++)\n\t\t\tfor(auto &e : graph_given[i]) graph_reversed[e.to].emplace_back(i, 1);\n\t\tbuild(create_compressed_graph);\n\t}\n\n\tconst int &operator[](const int k) { return group_number[k]; }\n};\n\nstruct low_link {\n private:\n\tconst Graph &graph_given;\n\tint order_next;\n\n\tvoid build() {\n\t\tint n = graph_given.size();\n\t\torder.resize(n, -1);\n\t\tlow.resize(n);\n\t\torder_next = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(order[i] == -1) dfs(i);\n\t}\n\n\tvoid dfs(int now, int par = -1) {\n\t\tlow[now] = order[now] = order_next++;\n\t\tbool is_articulation = false;\n\t\tint cnt = 0, cnt_par = 0;\n\t\tfor(const auto &ed : graph_given[now]) {\n\t\t\tconst int &nxt = ed.to;\n\t\t\tif(order[nxt] == -1) {\n\t\t\t\tcnt++;\n\t\t\t\tdfs(nxt, now);\n\t\t\t\tif(order[now] < low[nxt]) bridge.push_back(std::minmax(now, nxt));\n\t\t\t\tif(order[now] <= low[nxt]) is_articulation = true;\n\t\t\t\tlow[now] = std::min(low[now], low[nxt]);\n\t\t\t} else if(nxt != par or cnt_par++ == 1) {\n\t\t\t\tlow[now] = std::min(low[now], order[nxt]);\n\t\t\t}\n\t\t}\n\t\tif(par == -1 and cnt < 2) is_articulation = false;\n\t\tif(is_articulation) articulation.push_back(now);\n\t\treturn;\n\t}\n\n public:\n\tstd::vector<int> order, low, articulation;\n\tstd::vector<std::pair<int, int>> bridge;\n\tlow_link() = default;\n\tlow_link(const Graph &g_) : graph_given(g_) { build(); }\n};\n\nstruct twoedge_connected_components {\n private:\n\tconst Graph &graph_given;\n\tint group_next;\n\tlow_link li;\n\tstd::vector<int> group_number;\n\n\tvoid build(bool create_compressed_graph) {\n\t\tint n = graph_given.size();\n\t\tgroup_number.resize(n, -1);\n\t\tgroup_next = 0;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tif(group_number[i] == -1) dfs(i);\n\t\tgroups.resize(group_next);\n\t\tfor(int i = 0; i < graph_given.size(); i++) groups[group_number[i]].push_back(i);\n\n\t\tif(create_compressed_graph) {\n\t\t\tgraph_compressed.resize(group_next);\n\t\t\tfor(const auto &[u, v] : li.bridge) {\n\t\t\t\tint x = group_number[u], y = group_number[v];\n\t\t\t\tgraph_compressed.add_edge(x, y);\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid dfs(int now, int par = -1) {\n\t\tif(par != -1 and li.order[par] >= li.low[now])\n\t\t\tgroup_number[now] = group_number[par];\n\t\telse\n\t\t\tgroup_number[now] = group_next++;\n\t\tfor(const auto &e : graph_given[now])\n\t\t\tif(group_number[e.to] == -1) dfs(e.to, now);\n\t}\n\n public:\n\tGraph graph_compressed;\n\tstd::vector<std::vector<int>> groups;\n\ttwoedge_connected_components(const Graph &g_, bool create_compressed_graph = false) : graph_given(g_), li(g_) {\n\t\tbuild(create_compressed_graph);\n\t}\n\n\tconst int &operator[](const int k) { return group_number[k]; }\n};\n\n#pragma endregion\n\nint solve(int n) {\n\tmap<string, set<int>> variables;\n\trep(n) {\n\t\tSTR(var);\n\t\tint low, high;\n\t\tcin >> low >> high;\n\t\tset<int> s;\n\t\trep(i, low, high + 1) s.insert(i);\n\t\tvariables[var] = s;\n\t}\n\n\tint len;\n\tcin >> len;\n\n\tstack<set<int>> st;\n\n\tauto op = [&](set<int> a, set<int> b, char ope) -> set<int> {\n\t\tset<int> ret;\n\t\tfoa(lef, a) foa(rig, b) {\n\t\t\tif(rig == 0 && ope == '/') {\n\t\t\t\treturn set<int>({});\n\t\t\t}\n\n\t\t\tint add;\n\t\t\tswitch(ope) {\n\t\t\t\tcase '+':\n\t\t\t\t\tadd = lef + rig;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '-':\n\t\t\t\t\tadd = lef - rig;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '/':\n\t\t\t\t\tadd = lef / rig;\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase '*':\n\t\t\t\t\tadd = lef * rig;\n\t\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tret.insert(((add % 256) + 256) % 256);\n\t\t}\n\t\treturn ret;\n\t};\n\n\trep(i, len) {\n\t\tstring nxt;\n\t\tcin >> nxt;\n\t\tset<int> t;\n\n\t\tset<int> a;\n\t\tif(nxt == \"+\" || nxt == \"-\" || nxt == \"*\" || nxt == \"/\") {\n\t\t\tt = st.top();\n\t\t\tst.pop();\n\t\t\ta = st.top();\n\t\t\tst.pop();\n\t\t\tst.push(op(a, t, nxt.front()));\n\t\t} else {\n\t\t\tif(variables.count(nxt)) {\n\t\t\t\tt = variables[nxt];\n\t\t\t} else {\n\t\t\t\tt.insert(stoi(nxt));\n\t\t\t}\n\t\t\tst.push(t);\n\t\t}\n\t}\n\n\tauto res = st.top();\n\treturn !res.empty();\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 n;\n\twhile(cin >> n) {\n\t\tcout << (solve(n) ? \"correct\" : \"error\");\n\t\tcout << dl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3664,"score_of_the_acc":-0.8058,"final_rank":16},{"submission_id":"aoj_2435_5215992","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int mod = 256;\n\nint main() {\n int m;\n cin >> m;\n map<string, vector<bool>> mp;\n for (int i = 0; i < m; ++i) {\n string name;\n int lb, ub;\n cin >> name >> lb >> ub;\n mp[name].resize(mod);\n for (int j = lb; j <= ub; ++j) {\n mp[name][j] = true;\n }\n }\n int n;\n cin >> n;\n vector<string> e(n);\n for (auto& ei : e) cin >> ei;\n\n stack<string> s;\n for (auto& ei : e) {\n if (isdigit(ei[0])) {\n s.push(ei);\n } else if (isalpha(ei[0])) {\n s.push(ei);\n } else {\n string b = s.top(); s.pop();\n string a = s.top(); s.pop();\n if (ei == \"+\") {\n if (isdigit(a[0])) {\n if (isdigit(b[0])) {\n s.push(to_string((stoi(a) + stoi(b)) % mod));\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[b][j]) check[(stoi(a) + j) % mod] = true;\n }\n mp[b] = move(check);\n s.push(b);\n }\n } else {\n if (isdigit(b[0])) {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[a][j]) check[(j + stoi(b)) % mod] = true;\n }\n mp[a] = move(check);\n s.push(a);\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (!mp[a][j]) continue;\n for (int k = 0; k < mod; ++k) {\n if (!mp[b][k]) continue;\n check[(j + k) % mod] = true;\n }\n }\n mp[a] = move(check);\n s.push(a);\n }\n }\n } else if (ei == \"-\") {\n if (isdigit(a[0])) {\n if (isdigit(b[0])) {\n s.push(to_string((stoi(a) - stoi(b) + mod) % mod));\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[b][j]) check[(stoi(a) - j + mod) % mod] = true;\n }\n mp[b] = move(check);\n s.push(b);\n }\n } else {\n if (isdigit(b[0])) {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[a][j]) check[(j - stoi(b) + mod) % mod] = true;\n }\n mp[a] = move(check);\n s.push(a);\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (!mp[a][j]) continue;\n for (int k = 0; k < mod; ++k) {\n if (!mp[b][k]) continue;\n check[(j - k + mod) % mod] = true;\n }\n }\n mp[a] = move(check);\n s.push(a);\n }\n }\n } else if (ei == \"*\") {\n if (isdigit(a[0])) {\n if (isdigit(b[0])) {\n s.push(to_string((stoi(a) * stoi(b)) % mod));\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[b][j]) check[(stoi(a) * j) % mod] = true;\n }\n mp[b] = move(check);\n s.push(b);\n }\n } else {\n if (isdigit(b[0])) {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[a][j]) check[(j * stoi(b)) % mod] = true;\n }\n mp[a] = move(check);\n s.push(a);\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (!mp[a][j]) continue;\n for (int k = 0; k < mod; ++k) {\n if (!mp[b][k]) continue;\n check[(j * k) % mod] = true;\n }\n }\n mp[a] = move(check);\n s.push(a);\n }\n }\n } else if (ei == \"/\") {\n if (isdigit(a[0])) {\n if (isdigit(b[0])) {\n if (stoi(b) == 0) {\n cout << \"error\\n\";\n return 0;\n }\n s.push(to_string((stoi(a) / stoi(b)) % mod));\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[b][j]) {\n if (j == 0) {\n cout << \"error\\n\";\n return 0;\n }\n check[(stoi(a) / j) % mod] = true;\n }\n }\n mp[b] = move(check);\n s.push(b);\n }\n } else {\n if (isdigit(b[0])) {\n if (stoi(b) == 0) {\n cout << \"error\\n\";\n return 0;\n }\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (mp[a][j]) check[(j / stoi(b)) % mod] = true;\n }\n mp[a] = move(check);\n s.push(a);\n } else {\n vector<bool> check(mod);\n for (int j = 0; j < mod; ++j) {\n if (!mp[a][j]) continue;\n for (int k = 0; k < mod; ++k) {\n if (!mp[b][k]) continue;\n if (k == 0) {\n cout << \"error\\n\";\n return 0;\n }\n check[(j / k) % mod] = true;\n }\n }\n mp[a] = move(check);\n s.push(a);\n }\n }\n } else {\n assert(false);\n }\n }\n }\n cout << \"correct\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":3540,"score_of_the_acc":-0.5827,"final_rank":13},{"submission_id":"aoj_2435_5065315","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int UP=256;\nint ADD(int a,int b){return (a+b)%UP;}\nint SUB(int a,int b){return (a-b+UP)%UP;}\nint MUL(int a,int b){return a*b%UP;}\nint DIV(int a,int b){return a/b;}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int m; cin >> m;\n vector<string> name(m);\n vector<int> lb(m),ub(m);\n for (int i=0;i<m;++i) cin >> name[i] >> lb[i] >> ub[i];\n int n; cin >> n;\n vector<string> S(n);\n for (int i=0;i<n;++i) cin >> S[i];\n\n map<string,int> mp;\n for (int i=0;i<m;++i) mp[name[i]]=i;\n\n stack<vector<bool>> st;\n for (int i=0;i<n;++i){\n if (isdigit(S[i][0])){\n int res=stoi(S[i]);\n vector<bool> v(UP,false);\n v[res]=true; st.emplace(v);\n } else if (S[i]==\"+\"||S[i]==\"-\"||S[i]==\"*\"||S[i]==\"/\"){\n vector<bool> v=st.top(); st.pop();\n vector<bool> u=st.top(); st.pop();\n vector<bool> w(UP,false);\n for (int j=0;j<UP;++j){\n for (int k=0;k<UP;++k){\n if (u[j]&&v[k]){\n if (S[i]==\"+\") w[ADD(j,k)]=true;\n if (S[i]==\"-\") w[SUB(j,k)]=true;\n if (S[i]==\"*\") w[MUL(j,k)]=true;\n if (S[i]==\"/\"){\n if (k==0){\n cout << \"error\" << '\\n';\n return 0;\n }\n w[DIV(j,k)]=true;\n }\n }\n }\n }\n st.emplace(w);\n } else {\n int x=mp[S[i]];\n vector<bool> v(UP,false);\n for (int i=lb[x];i<=ub[x];++i) v[i]=true;\n st.emplace(v);\n }\n }\n\n cout << \"correct\" << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":3224,"score_of_the_acc":-0.0144,"final_rank":2},{"submission_id":"aoj_2435_5065312","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD=1000000007;\n// const long long MOD=998244353;\n#define LOCAL\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(),(x).end()\nconst int INF=1e9;\nconst long long IINF=1e18;\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\nconst char dir[4]={'D','R','U','L'};\n\ntemplate<typename T>\nistream &operator>>(istream &is,vector<T> &v){\n for (T &x:v) is >> x;\n return is;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const vector<T> &v){\n for (int i=0;i<v.size();++i){\n os << v[i] << (i+1==v.size()?\"\": \" \");\n }\n return os;\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,typename V>\nostream&operator<<(ostream &os,const tuple<T,U,V> &t){\n os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';\n return os;\n}\ntemplate<typename T,typename U,typename V,typename W>\nostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){\n os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';\n return os;\n}\ntemplate<typename T,typename U>\nostream &operator<<(ostream &os,const map<T,U> &m){\n os << '{';\n for (auto itr=m.begin();itr!=m.end();){\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr!=m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate<typename T,typename U>\nostream &operator<<(ostream &os,const unordered_map<T,U> &m){\n os << '{';\n for (auto itr=m.begin();itr!=m.end();){\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr!=m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const set<T> &s){\n os << '{';\n for (auto itr=s.begin();itr!=s.end();){\n os << *itr;\n if (++itr!=s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const multiset<T> &s){\n os << '{';\n for (auto itr=s.begin();itr!=s.end();){\n os << *itr;\n if (++itr!=s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const unordered_set<T> &s){\n os << '{';\n for (auto itr=s.begin();itr!=s.end();){\n os << *itr;\n if (++itr!=s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate<typename T>\nostream &operator<<(ostream &os,const deque<T> &v){\n for (int i=0;i<v.size();++i){\n os << v[i] << (i+1==v.size()?\"\": \" \");\n }\n return os;\n}\n\nvoid debug_out(){cerr << '\\n';}\ntemplate<class Head,class... Tail>\nvoid debug_out(Head&& head,Tail&&... tail){\n cerr << head;\n if (sizeof...(Tail)>0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) cerr << \" \";\\\ncerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n';\\\ncerr << \" \";\\\ndebug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}\ntemplate<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}\n\ntemplate<class T1,class T2> inline bool chmin(T1 &a,T2 b){\n if (a>b){a=b; return true;} return false;\n}\ntemplate<class T1,class T2> inline bool chmax(T1 &a,T2 b){\n if (a<b){a=b; return true;} return false;\n}\n#pragma endregion\n\nconst int UP=256;\nint ADD(int a,int b){return (a+b)%UP;}\nint SUB(int a,int b){return (a-b+UP)%UP;}\nint MUL(int a,int b){return a*b%UP;}\nint DIV(int a,int b){return a/b;}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int m; cin >> m;\n vector<string> name(m);\n vector<int> lb(m),ub(m);\n for (int i=0;i<m;++i) cin >> name[i] >> lb[i] >> ub[i];\n int n; cin >> n;\n vector<string> S(n);\n for (int i=0;i<n;++i) cin >> S[i];\n\n map<string,int> mp;\n for (int i=0;i<m;++i) mp[name[i]]=i;\n\n stack<vector<bool>> st;\n for (int i=0;i<n;++i){\n if (isdigit(S[i][0])){\n int res=stoi(S[i]);\n vector<bool> v(UP,false);\n v[res]=true; st.emplace(v);\n } else if (S[i]==\"+\"||S[i]==\"-\"||S[i]==\"*\"||S[i]==\"/\"){\n vector<bool> v=st.top(); st.pop();\n vector<bool> u=st.top(); st.pop();\n vector<bool> w(UP,false);\n for (int j=0;j<UP;++j){\n for (int k=0;k<UP;++k){\n if (u[j]&&v[k]){\n if (S[i]==\"+\") w[ADD(j,k)]=true;\n if (S[i]==\"-\") w[SUB(j,k)]=true;\n if (S[i]==\"*\") w[MUL(j,k)]=true;\n if (S[i]==\"/\"){\n if (k==0){\n cout << \"error\" << '\\n';\n return 0;\n }\n w[DIV(j,k)]=true;\n }\n }\n }\n }\n st.emplace(w);\n } else {\n int x=mp[S[i]];\n vector<bool> v(UP,false);\n for (int i=lb[x];i<=ub[x];++i) v[i]=true;\n st.emplace(v);\n }\n }\n\n cout << \"correct\" << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":3244,"score_of_the_acc":-0.0504,"final_rank":3},{"submission_id":"aoj_2435_4937316","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n\n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a) * (a))\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\n#define EXIST(s, e) ((s).find(e) != (s).end())\n#define SORT(c) sort((c).begin(), (c).end())\n\n//repetition\n//------------------------------------------\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define MOD 1000000007\n\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nconst double EPS = 1e-7, PI = acos(-1);\n//ここから編集\n\nstring solve(){\n int m; cin >> m;\n vector<string> name(m);\n vector<int> lb(m), ub(m);\n REP(i,m) cin >> name[i] >> lb[i] >> ub[i];\n\n map<string, int> mp;\n REP(i,m) mp[name[i]] = i;\n\n int n; cin >> n;\n vector<string> ss(n);\n REP(i,n) cin >> ss[i];\n stack<vector<int>> stt;\n REP(i,n){\n string s = ss[i];\n if(s == \"/\" || s == \"*\" || s == \"+\" || s == \"-\"){\n auto b = stt.top();\n stt.pop();\n auto a = stt.top();\n stt.pop();\n set<int> st;\n if(s == \"/\"){\n for(int j=0; j<a.size(); j++){\n for(int k=0; k<b.size(); k++){\n if(b[k] == 0) return \"error\";\n st.insert(a[j]/b[k]);\n }\n }\n }else if(s == \"*\"){\n for(int j=0; j<a.size(); j++){\n for(int k=0; k<b.size(); k++){\n st.insert(a[j]*b[k]%256);\n }\n }\n }else if(s == \"+\"){\n for(int j=0; j<a.size(); j++){\n for(int k=0; k<b.size(); k++){\n st.insert(a[j]+b[k] % 256);\n }\n }\n }else if(s == \"-\"){\n for(int j=0; j<a.size(); j++){\n for(int k=0; k<b.size(); k++){\n st.insert((a[j]-b[k]+256)%256);\n }\n }\n }\n vector<int> tmp;\n for(auto e: st) tmp.push_back(e);\n stt.push(tmp);\n }else if(mp.find(s) != mp.end()){\n int idx = mp[s];\n vector<int> tmp;\n for(int j=lb[idx]; j<=ub[idx]; j++) tmp.push_back(j);\n stt.push(tmp);\n }else{\n int num = stoi(s);\n stt.push({num});\n }\n }\n return \"correct\";\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(6);\n\n cout << solve() << endl;\n \n return 0;\n}","accuracy":0.35714285714285715,"time_ms":10,"memory_kb":3280,"score_of_the_acc":-0.1151,"final_rank":20},{"submission_id":"aoj_2435_4933978","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing pi=pair<int,int>;\nint main() {\n int m;\n cin>>m;\n map<string,vector<int>> mp;\n for(int i = 0; i < m; ++i){\n string a;\n cin>>a;\n int l,u;\n cin>>l>>u;\n vector<int> vb(256,0);\n for(int j = l; j <= u; ++j){\n vb[j]=1;\n }\n mp[a]=vb;\n }\n stack<string> st;\n int n;\n cin>>n;\n string s;\n bool av,bv;\n string a,b;\n for(int i = 0; i < n; ++i){\n cin>>s;\n //cout<<s<<endl;\n //cerr<<i<<endl;\n switch (s[0]) {\n case '+':\n b=st.top();\n st.pop();\n a=st.top();\n st.pop();\n bv=isalpha(b[0]);\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\n if(!bv) {\n if(!av) {\n int res=stoi(b)+stoi(a);\n res%=256;\n st.push(to_string(res));\n }\n else {\n int bn=stoi(b);\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]%2!=1)continue;\n mp[a][(j+bn)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]>=2)mp[a][j]=1;\n else mp[a][j]=0;\n }\n st.push(a);\n }\n }\n else {\n if(!av) {\n int an=stoi(a);\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n mp[b][(j+an)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n else {\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n for(int k = 0; k < 256; ++k){\n if(mp[a][k]%2!=1)continue;\n mp[b][(j+k)%256]+=2;\n }\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n }\n break;\n case '-':\n b=st.top();\n st.pop();\n a=st.top();\n st.pop();\n bv=isalpha(b[0]);\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\n if(!bv) {\n if(!av) {\n int res=stoi(a)-stoi(b)+256;\n res%=256;\n//cerr<<res<<endl;\n st.push(to_string(res));\n }\n else {\n int bn=stoi(b);\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]%2!=1)continue;\n mp[a][(j-bn+256)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]>=2)mp[a][j]=1;\n else mp[a][j]=0;\n }\n st.push(a);\n }\n }\n else {\n if(!av) {\n int an=stoi(a);\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n mp[b][(an-j+256)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n else {\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n for(int k = 0; k < 256; ++k){\n if(mp[a][k]%2!=1)continue;\n mp[b][(k-j+256)%256]+=2;\n }\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n//if(mp[b][j]==1)cerr<<j<<\" \";\n }\n//cerr<<endl;\n st.push(b);\n }\n }\n break;\n case '*':\n b=st.top();\n st.pop();\n a=st.top();\n st.pop();\n bv=isalpha(b[0]);\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\n if(!bv) {\n if(!av) {\n int res=stoi(b)*stoi(a);\n res%=256;\n st.push(to_string(res));\n }\n else {\n int bn=stoi(b);\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]%2!=1)continue;\n mp[a][(j*bn)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]>=2)mp[a][j]=1;\n else mp[a][j]=0;\n }\n st.push(a);\n }\n }\n else {\n if(!av) {\n int an=stoi(a);\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n mp[b][(j*an)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n else {\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n for(int k = 0; k < 256; ++k){\n if(mp[a][k]%2!=1)continue;\n mp[b][(j*k)%256]+=2;\n }\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n }\n break;\n case '/':\n b=st.top();\n st.pop();\n a=st.top();\n st.pop();\n bv=isalpha(b[0]);\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\n if(!bv) {\n if(stoi(b)==0) {\n cout<<\"error\"<<endl;\n return 0;\n }\n if(!av) {\n int res=stoi(a)/stoi(b);\n res%=256;\n st.push(to_string(res));\n }\n else {\n int bn=stoi(b);\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]%2!=1)continue;\n mp[a][(j/bn)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[a][j]>=2)mp[a][j]=1;\n else mp[a][j]=0;\n }\n st.push(a);\n }\n }\n else {\n if(mp[b][0]==1) {\n cout<<\"error\"<<endl;\n return 0;\n }\n if(!av) {\n int an=stoi(a);\n \n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n mp[b][(an/j)%256]+=2;\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n else {\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]%2!=1)continue;\n for(int k = 0; k < 256; ++k){\n if(mp[a][k]%2!=1)continue;\n mp[b][(k/j+256)%256]+=2;\n }\n }\n for(int j = 0; j < 256; ++j){\n if(mp[b][j]>=2)mp[b][j]=1;\n else mp[b][j]=0;\n }\n st.push(b);\n }\n }\n break;\n default:\n st.push(s);\n break;\n }\n }\n cout<<\"correct\"<<endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3344,"score_of_the_acc":-0.4802,"final_rank":11},{"submission_id":"aoj_2435_4933944","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\nint main() {\n\n const int mod = 256;\n \n int m; cin >> m;\n map<string, pair<int, int>> mp;\n for (int i = 0; i < m; i++) {\n string name; cin >> name;\n int l, r; cin >> l >> r;\n mp[name] = {l, r};\n }\n\n stack<set<int>> stk;\n int n; cin >> n;\n for (int i = 0; i < n; i++) {\n string s;\n cin >> s;\n if (s == \"+\" || s == \"-\" || s == \"*\" || s == \"/\") {\n // 演算子の場合\n auto b = stk.top();\n stk.pop();\n auto a = stk.top();\n stk.pop();\n\n // 0 division checker\n if (s == \"/\") {\n for (auto bb : b) {\n if (bb == 0) {\n cout << \"error\" << endl;\n return 0;\n }\n }\n }\n\n set<int> st;\n // 全探索\n for (auto aa : a) {\n for (auto bb : b) {\n int num;\n if (s == \"+\") {\n num = (aa + bb) % mod;\n }\n if (s == \"-\") {\n num = (aa - bb + mod) % mod;\n }\n if (s == \"*\") {\n num = (aa * bb) % mod;\n }\n if (s == \"/\") {\n num = (aa / bb) % mod;\n }\n\n st.insert(num);\n }\n }\n\n stk.push(st);\n\n } else if (mp.find(s) != mp.end()) {\n // 変数の場合\n int l, r;\n tie(l, r) = mp[s];\n set<int> st;\n for (int i = l; i <= r; i++) {\n st.insert(i);\n }\n stk.push(st);\n } else {\n // 整数の場合\n int num = stoi(s);\n set<int> st;\n st.insert(num);\n stk.push(st);\n }\n }\n\n cout << \"correct\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3272,"score_of_the_acc":-0.3507,"final_rank":8},{"submission_id":"aoj_2435_4933870","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define pp pair<int,int>\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\n#define ll long long\n#define ld long double\n#define all(a) (a).begin(),(a).end()\n#define mk make_pair\nll MOD=1000000007;\nll mod=998244353;\nint inf=1000001000;\nll INF=1e18+5;\n\n\nint main() {\n int r;\n cin >> r;\n map<string,pair<int,int>> m;\n map<string,vector<int>> mm;\n rep(i,r){\n string s;\n int a,b;\n cin >> s >> a >> b;\n m[s]=mk(a,b);\n }\n int n;\n cin >> n;\n stack<string> w;\n rep(i,n){\n string s;\n cin >> s;\n if (s==\"+\" || s==\"-\" || s==\"*\" || s==\"/\"){\n string a=w.top();\n w.pop();\n string b=w.top();\n w.pop();\n int c=0,d=0;\n if (a[0]-'0'<=9 && a[0]-'0'>=0){\n rep(j,a.size()){\n int u=a[j]-'0';\n c*=10;\n c+=u;\n }\n }\n if (b[0]-'0'<=9 && b[0]-'0'>=0){\n rep(j,b.size()){\n int u=b[j]-'0';\n d*=10;\n d+=u;\n }\n }\n vector<int> oo(256,0);\n if (m.find(b)!=m.end()){\n int f=m[b].first,g=m[b].second;\n for (int j=f;j<=g;j++){\n if (m.find(a)!=m.end()){\n int ff=m[a].first,gg=m[a].second;\n for (int k=ff;k<=gg;k++){\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else if (mm.find(a)!=mm.end()){\n for (int k=0;k<256;k++){\n if (mm[a][k]==0) continue;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else {\n int k=c;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n }\n else if (mm.find(b)!=mm.end()){\n rep(j,256){\n if (mm[b][j]==0) continue;\n if (m.find(a)!=m.end()){\n int ff=m[a].first,gg=m[a].second;\n for (int k=ff;k<=gg;k++){\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else if (mm.find(a)!=mm.end()){\n for (int k=0;k<256;k++){\n if (mm[a][k]==0) continue;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else {\n int k=c;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n }\n else {\n int j=d;\n if (m.find(a)!=m.end()){\n int ff=m[a].first,gg=m[a].second;\n for (int k=ff;k<=gg;k++){\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else if (mm.find(a)!=mm.end()){\n for (int k=0;k<256;k++){\n if (mm[a][k]==0) continue;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n else {\n int k=c;\n if (s==\"+\") oo[(j+k)%256]=1;\n if (s==\"-\") oo[(256+j-k)%256]=1;\n if (s==\"*\") oo[(j*k)%256]=1;\n if (s==\"/\"){\n if (k==0){\n cout << \"error\" << endl;\n return 0;\n }\n else oo[(j/k)%256]=1;\n } \n }\n }\n string h;\n rep(j,i+1) h.push_back('?');\n w.push(h);\n mm[h]=oo;\n }\n else w.push(s);\n }\n cout << \"correct\" << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3480,"score_of_the_acc":-0.7248,"final_rank":15},{"submission_id":"aoj_2435_4762200","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int m;\n cin >> m;\n map<string, vector<bool>> mp;\n for (int i = 0; i < m; i++){\n string name;\n int lb, ub;\n cin >> name >> lb >> ub;\n mp[name] = vector<bool>(256, false);\n for (int j = lb; j <= ub; j++){\n mp[name][j] = true;\n }\n }\n int n;\n cin >> n;\n bool ok = true;\n stack<vector<bool>> st;\n for (int i = 0; i < n; i++){\n string S;\n cin >> S;\n if (mp.count(S)){\n st.push(mp[S]);\n } else if ('0' <= S[0] && S[0] <= '9'){\n vector<bool> tmp(256, false);\n tmp[stoi(S)] = true;\n st.push(tmp);\n } else {\n vector<bool> b = st.top();\n st.pop();\n vector<bool> a = st.top();\n st.pop();\n if (S == \"/\" && b[0]){\n ok = false;\n break;\n }\n vector<bool> r(256, false);\n for (int i = 0; i < 256; i++){\n for (int j = 0; j < 256; j++){\n if (a[i] && b[j]){\n if (S == \"+\"){\n r[(i + j) % 256] = true;\n }\n if (S == \"-\"){\n r[(i - j + 256) % 256] = true;\n }\n if (S == \"*\"){\n r[i * j % 256] = true;\n }\n if (S == \"/\"){\n r[i / j] = true;\n }\n }\n }\n }\n st.push(r);\n }\n }\n if (ok){\n cout << \"correct\" << endl;\n } else {\n cout << \"error\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3244,"score_of_the_acc":-0.0504,"final_rank":3},{"submission_id":"aoj_2435_4238169","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#pragma comment (linker, \"/STACK:526000000\")\n\n#include \"bits/stdc++.h\"\n\nusing namespace std;\ntypedef string::const_iterator State;\n#define eps 1e-11L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n\n#define MOD 998244353LL\n#define seg_size 262144 * 4LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\n#define ALL(x) (x).begin(),(x).end()\n\nvoid init() {\n\tiostream::sync_with_stdio(false);\n\tcout << fixed << setprecision(20);\n}\n\n#define int ll\n\nvoid solve(){\n\tint n;\n\tcin >> n;\n\tmap<string, pair<int, int>> variables;\n\tREP(i, n) {\n\t\tstring a;\n\t\tint b, c;\n\t\tcin >> a >> b >> c;\n\t\tvariables[a] = mp(b, c);\n\t}\n\tstack<set<int>> now_stack;\n\tint m;\n\tcin >> m;\n\tREP(te, m) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tif (s[0] >= '0' && s[0] <= '9') {\n\t\t\tnow_stack.push(set<int>{stoll(s)});\n\t\t}\n\t\telse if(variables.find(s) != variables.end()) {\n\t\t\tset<int> geko;\n\t\t\tfor (int q = variables[s].first; q <= variables[s].second; ++q) {\n\t\t\t\tgeko.insert(q);\n\t\t\t}\n\t\t\tnow_stack.push(geko);\n\t\t}\n\t\telse {\n\t\t\tset<int> now[2];\n\t\t\tnow[0] = now_stack.top();\n\t\t\tnow_stack.pop();\n\t\t\tnow[1] = now_stack.top();\n\t\t\tnow_stack.pop();\n\t\t\tset<int> result;\n\t\t\tfor (auto x : now[1]) {\n\t\t\t\tfor (auto y : now[0]) {\n\t\t\t\t\tif (s == \"+\") {\n\t\t\t\t\t\tresult.insert((x + y) % 256);\n\t\t\t\t\t}\n\t\t\t\t\telse if (s == \"-\") {\n\t\t\t\t\t\tresult.insert((x - y + 256) % 256);\n\t\t\t\t\t}\n\t\t\t\t\telse if (s == \"*\") {\n\t\t\t\t\t\tresult.insert((x * y) % 256);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (y == 0) {\n\t\t\t\t\t\t\tcout << \"error\" << endl;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tresult.insert((x / y) % 256);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tnow_stack.push(result);\n\t\t}\n\t}\n\tcout << \"correct\" << endl;\n}\n\n#undef int\nint main() {\n\tinit();\n\n\tsolve();\n}","accuracy":1,"time_ms":20,"memory_kb":3304,"score_of_the_acc":-0.4083,"final_rank":9},{"submission_id":"aoj_2435_4109887","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define fs first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define ALL(A) A.begin(),A.end()\n#define RALL(A) A.rbegin(),A.rend()\ntypedef long long LL;\ntypedef pair<LL,LL> P;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconst LL mod=1000000007;\nconst LL LINF=1LL<<60;\nconst int INF=1<<30;\nint dx[]={1,0, 0,-1,1,-1, 1,-1};\nint dy[]={0,1,-1, 0,1,-1,-1, 1};\n\n\n\nint main(){\n int m;cin >> m;\n vector<string> s(m);\n vector<int> l(m),r(m);\n unordered_map<string,vector<bool>> val;\n for (int i = 0; i < m; i++) {\n cin >> s[i] >> l[i] >> r[i];\n r[i]++;\n vector<bool> v(256,false);\n for (int j = l[i]; j < r[i]; j++) {\n v[j] = true;\n }\n val[s[i]] = v;\n }\n int n;cin >> n;\n stack<string> st;\n bool f = false;\n vector<int> c(10,0);\n for (int i = 0; i < n; i++) {\n string t;cin >> t;\n if(t[0]=='+'){\n string q = st.top();st.pop();\n string p = st.top();st.pop();\n vector<bool> v(256,false);\n for (int j = 0; j < 256; j++) {\n if(!val[p][j]) continue;\n for (int k = 0; k < 256; k++) {\n if(!val[q][k]) continue;\n v[(j+k)%256] = true;\n }\n }\n val[p] = v;\n st.push(p);\n }\n else if(t[0]=='-'){\n string q = st.top();st.pop();\n string p = st.top();st.pop();\n vector<bool> v(256,false);\n for (int j = 0; j < 256; j++) {\n if(!val[p][j]) continue;\n for (int k = 0; k < 256; k++) {\n if(!val[q][k]) continue;\n v[(j-k+256)%256] = true;\n }\n }\n val[p] = v;\n st.push(p);\n }\n else if(t[0]=='*'){\n string q = st.top();st.pop();\n string p = st.top();st.pop();\n vector<bool> v(256,false);\n for (int j = 0; j < 256; j++) {\n if(!val[p][j]) continue;\n for (int k = 0; k < 256; k++) {\n if(!val[q][k]) continue;\n v[(j*k)%256] = true;\n }\n }\n val[p] = v;\n st.push(p);\n }\n else if(t[0]=='/'){\n string q = st.top();st.pop();\n string p = st.top();st.pop();\n vector<bool> v(256,false);\n for (int j = 0; j < 256; j++) {\n if(!val[p][j]) continue;\n for (int k = 0; k < 256; k++) {\n if(!val[q][k]) continue;\n if(k==0){\n puts(\"error\");\n return 0;\n }\n v[j/k] = true;\n }\n }\n val[p] = v;\n st.push(p);\n }\n else{\n if(0<=t[0]-'0'&&t[0]-'0'<10){\n vector<bool> v(256,false);\n v[stoi(t)] = true;\n t += to_string(c[t[0] - '0']++);\n val[t] = v;\n }\n st.push(t);\n }\n }\n puts(\"correct\");\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3320,"score_of_the_acc":-0.4371,"final_rank":10},{"submission_id":"aoj_2435_4057197","code_snippet":"#include <bits/stdc++.h>\n#define MOD 256\nusing namespace std;\n\nlong long m, n;\nvector<string> e;\nmap<string, set<int>> mp;\nstack<set<int>> st;\n\nbool solve();\n\nint main() {\n cin >> m;\n for(int i = 0; i < m; ++i) {\n string s;\n int l, r;\n cin >> s >> l >> r;\n for(int i = l; i <= r; ++i) mp[s].insert(i);\n }\n cin >> n;\n e.resize(n);\n for(int i = 0; i < n; ++i) cin >> e[i];\n if(solve())\n cout << \"correct\" << endl;\n else\n cout << \"error\" << endl;\n return 0;\n}\n\nbool solve() {\n for(int i = 0; i < n; ++i) {\n set<int> a, b, c;\n if(e[i] == \"+\") {\n b = st.top();\n st.pop();\n a = st.top();\n st.pop();\n for(int x : a)\n for(int y : b) c.insert((x + y) % MOD);\n st.push(c);\n }\n else if(e[i] == \"-\") {\n b = st.top();\n st.pop();\n a = st.top();\n st.pop();\n for(int x : a)\n for(int y : b) c.insert((x - y + MOD) % MOD);\n st.push(c);\n }\n else if(e[i] == \"*\") {\n b = st.top();\n st.pop();\n a = st.top();\n st.pop();\n for(int x : a)\n for(int y : b) c.insert((x * y) % MOD);\n st.push(c);\n }\n else if(e[i] == \"/\") {\n b = st.top();\n st.pop();\n a = st.top();\n st.pop();\n for(int x : a)\n for(int y : b) {\n if(y == 0) return 0;\n c.insert((x / y) % MOD);\n }\n st.push(c);\n }\n else if(isdigit(e[i][0])) {\n a.insert(stoi(e[i]) % MOD);\n st.push(a);\n }\n else\n st.push(mp[e[i]]);\n }\n return 1;\n}","accuracy":1,"time_ms":10,"memory_kb":3356,"score_of_the_acc":-0.2518,"final_rank":6},{"submission_id":"aoj_2435_3731118","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\n\n#define EPS (1e-7)\n#define INF (1e9)\n#define PI (acos(-1))\n//const ll mod = 1000000007;\nmap<string, set<int> > mp;\n\nint f(string s) {\n //cerr << s << endl;\n if(s.size() == 1) return s[0] - '0';\n return 10 * f(s.substr(0, s.size() - 1)) + s.back() - '0';\n}\n\nint main() {\n //cout.precision(10);\n cin.tie(0);\n ios::sync_with_stdio(false);\n int m;\n cin >> m;\n while(m--) {\n string s;\n cin >> s;\n int l, u;\n cin >> l >> u;\n for(int i = l; i <= u; i++) mp[s].insert(i);\n }\n string NEWVAL;\n for(int i = 1; i <= 21; i++) NEWVAL.push_back('A');\n int n;\n cin >> n;\n stack<string> sta;\n while(n--) {\n string s;\n cin >> s;\n NEWVAL[0]++;\n if(s == \"+\" || s == \"-\" || s == \"*\" || s == \"/\") {\n string a = sta.top();\n sta.pop();\n string b = sta.top();\n sta.pop();\n for(auto itr = mp[a].begin(); itr != mp[a].end(); itr++) {\n for(auto itr2 = mp[b].begin(); itr2 != mp[b].end(); itr2++) {\n if(s == \"/\" && *itr == 0) {\n cout << \"error\" << endl;\n return 0;\n }\n if(s == \"+\") mp[NEWVAL].insert((*itr2 + *itr) % 256);\n if(s == \"-\") mp[NEWVAL].insert((*itr2 - *itr + 256) % 256);\n if(s == \"*\") mp[NEWVAL].insert(*itr * *itr2 % 256);\n if(s == \"/\") mp[NEWVAL].insert(*itr2 / *itr % 256);\n }\n }\n sta.push(NEWVAL);\n continue;\n }\n if(!mp[s].empty()) {\n sta.push(s);\n } else {\n /*\n cerr << \"nmb: \" << s << endl;\n cerr << f(s) << endl;\n */\n mp[NEWVAL].insert(f(s));\n sta.push(NEWVAL);\n }\n }\n cout << \"correct\" << endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3528,"score_of_the_acc":-1.5612,"final_rank":19},{"submission_id":"aoj_2435_3713816","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n\tint m; cin >> m;\n\tmap<string, pair<int, int>> range;\n\twhile(m--) {\n\t\tstring name; cin >> name;\n\t\tint lb, ub; cin >> lb >> ub;\n\t\trange[name] = {lb, ub};\n\t}\n\tint n; cin >> n;\n\tstack<set<int>> num;\n\twhile(n--) {\n\t\tstring e; cin >> e;\n\t\tset<int> st;\n\t\tif(range.count(e)) {\n\t\t\tfor(int i = range[e].first; i <= range[e].second; ++i) {\n\t\t\t\tst.insert(i);\n\t\t\t}\n\t\t} else if(e == \"+\" or e == \"-\" or e == \"*\" or e == \"/\") {\n\t\t\tauto st2 = num.top();\n\t\t\tnum.pop();\n\t\t\tauto st1 = num.top();\n\t\t\tnum.pop();\n\t\t\tfor(auto lhs : st1) {\n\t\t\t\tfor(auto rhs : st2) {\n\t\t\t\t\tif(e == \"+\") st.insert((lhs + rhs) % 256);\n\t\t\t\t\tif(e == \"-\") st.insert((lhs - rhs + 256) % 256);\n\t\t\t\t\tif(e == \"*\") st.insert((lhs * rhs) % 256);\n\t\t\t\t\tif(e == \"/\") {\n\t\t\t\t\t\tif(rhs == 0) return false;\n\t\t\t\t\t\tst.insert((lhs / rhs) % 256);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tint tmp = 0;\n\t\t\tfor(char c : e) {\n\t\t\t\ttmp *= 10;\n\t\t\t\ttmp += c - '0';\n\t\t\t}\n\t\t\tst.insert(tmp);\n\t\t}\n\t\tnum.push(st);\n\t}\n\treturn true;\n}\n\nint main() {\n\tcout << (solve() ? \"correct\" : \"error\") << \"\\n\";\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3240,"score_of_the_acc":-0.2932,"final_rank":7},{"submission_id":"aoj_2435_3588819","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<map>\n#include<stack>\nusing namespace std;\nint n,m;\nmap<string,int>M;\nvector<int>a[100];\nbool flag;\nint cal(int x,int y,char c)\n{\n\tif(c=='+')return(x+y)%256;\n\telse if(c=='-')return(x-y+256)%256;\n\telse if(c=='*')return x*y%256;\n\telse\n\t{\n\t\tif(y)return x/y%256;\n\t\telse return flag=true;\n\t}\n}\nmain()\n{\n\tcin>>m;\n\tfor(int i=0;i<m;i++)\n\t{\n\t\tstring s;int L,R;\n\t\tcin>>s>>L>>R;\n\t\tM[s]=i;\n\t\tfor(int j=L;j<=R;j++)a[i].push_back(j);\n\t}\n\tcin>>n;\n\tstack<int>S;\n\tfor(;n--;)\n\t{\n\t\tstring s;cin>>s;\n\t\tif(s[0]>='0'&&s[0]<='9')\n\t\t{\n\t\t\tint now=0;\n\t\t\tfor(int i=0;i<s.size();i++)now=(now*10+s[i]-48)%256;\n\t\t\tS.push(now);\n\t\t}\n\t\telse if(M.find(s)!=M.end())\n\t\t{\n\t\t\tS.push(~M[s]);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint x,y;\n\t\t\ty=S.top();S.pop();\n\t\t\tx=S.top();S.pop();\n\t\t\tif(x>=0&&y>=0)S.push(cal(x,y,s[0]));\n\t\t\telse\n\t\t\t{\n\t\t\t\tvector<int>tmp;\n\t\t\t\tif(x>=0)\n\t\t\t\t{\n\t\t\t\t\tfor(int Y:a[~y])tmp.push_back(cal(x,Y,s[0]));\n\t\t\t\t\tsort(tmp.begin(),tmp.end());\n\t\t\t\t\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\n\t\t\t\t\ta[~y]=tmp;\n\t\t\t\t\tS.push(y);\n\t\t\t\t}\n\t\t\t\telse if(y>=0)\n\t\t\t\t{\n\t\t\t\t\tfor(int X:a[~x])tmp.push_back(cal(X,y,s[0]));\n\t\t\t\t\tsort(tmp.begin(),tmp.end());\n\t\t\t\t\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\n\t\t\t\t\ta[~x]=tmp;\n\t\t\t\t\tS.push(x);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tfor(int X:a[~x])for(int Y:a[~y])tmp.push_back(cal(X,Y,s[0]));\n\t\t\t\t\tsort(tmp.begin(),tmp.end());\n\t\t\t\t\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\n\t\t\t\t\ta[~x]=tmp;\n\t\t\t\t\tS.push(x);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<(flag?\"error\":\"correct\")<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3488,"score_of_the_acc":-0.4892,"final_rank":12},{"submission_id":"aoj_2435_3585594","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <stack>\n\nusing namespace std;\n\nusing lint = long long;\nusing ldouble = long double;\n\nint main() {\n int M;\n cin >> M;\n\n map<string, set<int>> trans;\n for (int i = 0; i < M; ++i) {\n string name;\n int l, r;\n cin >> name >> l >> r;\n for (int a = l; a <= r; ++a) {\n trans[name].insert(a);\n }\n }\n\n int N;\n cin >> N;\n stack<set<int>> st;\n for (int i = 0; i < N; ++i) {\n string S;\n cin >> S;\n\n if (S == \"+\" || S == \"-\" || S == \"*\" || S == \"/\") {\n auto s = st.top();\n st.pop();\n auto t = st.top();\n st.pop();\n\n st.push(set<int>());\n for (auto b : s) {\n for (auto a : t) {\n if (S == \"+\") {\n st.top().insert((a + b) % 256);\n } else if (S == \"-\") {\n st.top().insert((a - b + 256) % 256);\n } else if (S == \"*\") {\n st.top().insert((a * b) % 256);\n } else if (S == \"/\") {\n if (b == 0) {\n cout << \"error\" << endl;\n return 0;\n }\n st.top().insert((a / b) % 256);\n }\n }\n }\n } else if (trans.count(S)) {\n st.push(trans[S]);\n } else {\n st.push(set<int>({stoi(S)}));\n }\n }\n\n cout << \"correct\" << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3348,"score_of_the_acc":-0.2374,"final_rank":5},{"submission_id":"aoj_2435_3579727","code_snippet":"#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\n#pragma GCC target(\"tune=native\")\n#pragma GCC target(\"avx\")\n// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\n\nusing namespace std;\n\nusing i64 = int64_t;\n\nconst i64 MOD = 1e9+7;\n\nconst i64 INF = i64(1e18)+MOD;\n\ntemplate <typename T = i64>\nstruct Range{\n struct iterator{\n T value;\n const T step, last;\n const T& operator*(){return value;}\n iterator(T value, T step, T last) :\n value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),\n step(step),\n last(last)\n {\n }\n iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}\n bool operator!=(const iterator& x){return value != x.value;}\n };\n const T start, last, step;\n\n Range(const T start, const T last, const T step = static_cast<T>(1)) :\n start(start),\n last(last),\n step(step)\n {\n }\n\n Range(const T last) :\n start(0),\n last(last),\n step(1)\n {\n }\n\n iterator begin(){return iterator(start, step, last);}\n iterator end(){return iterator(last, step, last);}\n};\n\ntemplate <typename F>\nstruct FixPoint{\n const F _f;\n FixPoint(F&& f) : _f(forward<F>(f)){}\n\n template<typename... Types>\n decltype(auto) operator()(Types&&... args) const{\n return _f(*this, forward<Types>(args)...);\n }\n};\n\ntemplate <typename F>\nstatic decltype(auto) makeRec(F&& f){\n return FixPoint<F>(forward<F>(f));\n}\n\ntemplate <typename T, T Value = T()>\nvector<T> makeVector(size_t x){\n return vector<T>(x, T(Value));\n}\n\ntemplate <typename T, T Value = T(), typename... Types>\nauto makeVector(size_t x, Types... args){\n return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));\n}\n\ntemplate <typename T = i64>\nbool chmax(T& a, T b){\n if(a < b){\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <typename T = i64>\nbool chmin(T& a, T b){\n if(a > b){\n a = b;\n return true;\n }\n return false;\n}\n\n#define dump(x) fprintf(stderr, \"line =%4d, name =%7s , \", __LINE__, #x); clog << \"value = \" << x << endl;\n\n#define vecdump(x) fprintf(stderr, \"line =%4d, name =%7s\\n\", __LINE__, #x); _dump_macro(x);\n\nvoid _dump(int, string& x){\n clog << x << endl;\n}\n\ntemplate <typename T>\nvoid _dump(bool, T& x){\n clog << x << \" \";\n}\n\ntemplate <typename T, typename U = typename T::iterator>\nvoid _dump(int, T& x){\n\n for(auto& elm : x)\n _dump(0, elm);\n\n clog << endl;\n}\n\ntemplate <typename T>\nvoid _dump_macro(T& x){\n _dump(0, x);\n}\n\nvoid _input(int, string& x){\n cin >> x;\n}\n\ntemplate <typename T>\nvoid _input(bool, T& x){\n cin >> x;\n}\n\ntemplate <typename T, typename U = typename T::iterator>\nvoid _input(int, T& x){\n\n for(auto& elm : x)\n _input(0, elm);\n}\n\ntemplate <typename T>\nvoid input_single(T& x){\n _input(0, x);\n}\n\nauto input(){}\n\ntemplate <typename T, typename... Types>\nvoid input(T& value, Types&&... args){\n input_single(value);\n input(forward<Types>(args)...);\n};\n\nvoid _pararell_input(size_t){}\n\ntemplate <typename T, typename... Types>\nvoid _pararell_input(size_t index, T& value, Types&&... args){\n input(value[index]);\n _pararell_input(index, forward<Types>(args)...);\n}\n\ntemplate <typename... Types>\nvoid pararell_input(size_t count, Types&&... args){\n for(const auto& i : Range<>(count))\n _pararell_input(i, forward<Types>(args)...);\n}\n\n\nbool solve(){\n\n int m;\n input(m);\n vector<string> c(m);\n vector<int> l(m), r(m);\n unordered_map<string, pair<int,int>> ma;\n pararell_input(m, c, l, r);\n for(auto& x : r)\n ++x;\n for(int i = 0; i < m; ++i)\n ma[c[i]] = make_pair(l[i], r[i]);\n int n;\n input(n);\n vector<string> v(n);\n input(v);\n vector<string> op{\"+\", \"-\", \"*\", \"/\"};\n\n using bs = bitset<256>;\n stack<bs> st;\n\n for(int i = 0; i < n; ++i){\n if(ma.find(v[i]) != ma.end()){\n bs s;\n auto p = ma[v[i]];\n for(int j = p.first; j < p.second; ++j)\n s.set(j);\n st.push(s);\n }else if(find(op.begin(), op.end(), v[i]) != op.end()){\n\n if(st.size() < 2){\n cout << \"error\" << endl;\n return 0;\n }\n bs b = st.top();\n st.pop();\n bs a = st.top();\n st.pop();\n\n bs ans;\n\n for(int j = 0; j < 256; ++j)\n for(int k = 0; k < 256; ++k){\n if(!a[j] || !b[k])\n continue;\n if(v[i] == \"+\"){\n int val = (j + k) % 256;\n ans.set(val);\n }\n if(v[i] == \"-\"){\n int val = (j - k + 256) % 256;\n ans.set(val);\n }\n if(v[i] == \"*\"){\n int val = (j * k) % 256;\n ans.set(val);\n }\n if(v[i] == \"/\"){\n if(k == 0){\n cout << \"error\" << endl;\n return 0;\n }\n int val = j / k;\n ans.set(val);\n }\n }\n\n st.push(ans);\n\n }else{\n int val = stoi(v[i]);\n bs s;\n s.set(val);\n st.push(s);\n }\n }\n\n if(st.size() == 1)\n cout << \"correct\" << endl;\n else\n cout << \"error\" << endl;\n\n return false;\n}\n\nsigned main(){\n\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n\n while(solve());\n\n}","accuracy":1,"time_ms":10,"memory_kb":3216,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2435_6708649\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <cstddef>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\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, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.first >> pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const 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 T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T, T init>\\nauto make_vector(int n) {\\n return std::vector<T>(n, init);\\n}\\n\\ntemplate <class T, T init, typename Head, typename... Tail>\\nauto make_vector(Head n, Tail... ts) {\\n return std::vector(n, make_vector<T, init>(ts...));\\n}\\n\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <class T>\\nT pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\n/*\\n reference: https://gist.github.com/draftcode/1357281\\n*/\\n\\nnamespace ebi {\\n\\ntypedef std::string::const_iterator State;\\nclass ParseError {};\\n\\nbool expect(State &begin, char expected) {\\n if (*begin == expected) {\\n return true;\\n } else {\\n return false;\\n }\\n}\\n\\n// beginがexpectedを指していたらbeginを一つ進める。\\nvoid consume(State &begin, char expected) {\\n if (*begin == expected) {\\n begin++;\\n } else {\\n std::cerr << \\\"Expected '\\\" << expected << \\\"' but got '\\\" << *begin << \\\"'\\\"\\n << std::endl;\\n std::cerr << \\\"Rest string is '\\\";\\n while (*begin) {\\n std::cerr << *begin++;\\n }\\n std::cerr << \\\"'\\\" << std::endl;\\n throw ParseError();\\n }\\n}\\n\\nbool isdigit(char c) { return '0' <= c && c <= '9'; }\\n\\nbool isAlpha(char c) { return 'A' <= c && c <= 'Z'; }\\n\\nbool isalpha(char c) { return 'a' <= c && c <= 'z'; }\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n int m;\\n std::cin >> m;\\n std::map<std::string, std::pair<int, int>> map;\\n rep(i, 0, m) {\\n std::string name;\\n int lb, ub;\\n std::cin >> name >> lb >> ub;\\n map[name] = {lb, ub};\\n }\\n std::vector<std::set<int>> vset;\\n std::stack<int> stack;\\n int n;\\n std::cin >> n;\\n auto isoperator = [](const std::string &s) -> bool {\\n if (s == \\\"+\\\" || s == \\\"-\\\" || s == \\\"*\\\" || s == \\\"/\\\")\\n return true;\\n else\\n return false;\\n };\\n rep(i, 0, n) {\\n std::string e;\\n std::cin >> e;\\n std::set<int> set;\\n\\n if (isoperator(e)) {\\n auto r = stack.top();\\n stack.pop();\\n auto l = stack.top();\\n stack.pop();\\n for (auto lv : vset[l]) {\\n for (auto rv : vset[r]) {\\n int ret;\\n if (e == \\\"+\\\") {\\n ret = lv + rv;\\n } else if (e == \\\"-\\\") {\\n ret = lv - rv;\\n } else if (e == \\\"*\\\") {\\n ret = lv * rv;\\n } else if (e == \\\"/\\\") {\\n if (rv == 0) {\\n std::cout << \\\"error\\\\n\\\";\\n return;\\n }\\n ret = lv / rv;\\n } else\\n assert(0);\\n ret = (ret + 256) % 256;\\n set.insert(ret);\\n }\\n }\\n } else {\\n if (map.find(e) == map.end()) {\\n int num = 0;\\n for (auto c : e) {\\n assert('0' <= c && c <= '9');\\n num *= 10;\\n num += c - '0';\\n }\\n set.insert(num);\\n } else {\\n auto [lb, ub] = map[e];\\n rep(j, lb, ub + 1) { set.insert(j); }\\n }\\n }\\n stack.push(vset.size());\\n vset.emplace_back(set);\\n }\\n assert(stack.size() == 1);\\n std::cout << \\\"correct\\\\n\\\";\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3772,\n \"score_of_the_acc\": -1,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2435_6357529\",\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 m; cin >> m;\\n map<string,set<int>> mp;\\n rep(_,m) {\\n string name; int lb,ub; cin >> name >> lb >> ub;\\n set<int> s;\\n for(int i = lb; i <= ub; i++) s.insert(i);\\n mp[name] = s;\\n }\\n\\n stack<set<int>> s;\\n int n; cin >> n;\\n bool flag = false;\\n rep(_,n) {\\n string e; cin >> e;\\n if(isdigit(e[0])) {\\n set<int> se;\\n se.insert(stoi(e));\\n s.push(se);\\n } else if(mp.count(e)) {\\n s.push(mp[e]);\\n } else {\\n set<int> b = s.top(); s.pop();\\n set<int> a = s.top(); s.pop();\\n\\n set<int> c;\\n for(int xa : a) for(int xb : b) {\\n if(e == \\\"+\\\") c.insert((xa + xb) % 256);\\n if(e == \\\"-\\\") c.insert((xa - xb + 256) % 256);\\n if(e == \\\"*\\\") c.insert((xa * xb) % 256);\\n if(e == \\\"/\\\") {\\n if(xb == 0) {\\n flag = true;\\n } else {\\n c.insert((xa / xb) % 256);\\n }\\n }\\n }\\n s.push(c);\\n }\\n }\\n\\n cout << (flag ? \\\"error\\\" : \\\"correct\\\") << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -1.205,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2435_5939732\",\n \"code_snippet\": \"// I SELL YOU...! \\n#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<functional>\\n#include<queue>\\n#include<chrono>\\n#include<iomanip>\\n#include<map>\\n#include<stack>\\n#include<set>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll,vector<ll>>;\\nusing TP = tuple<ll,ll,ll>;\\nvoid init_io(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(18);\\n}\\nconst ll MOD = 256;\\nsigned main(){\\n init_io();\\n ll m;\\n cin >> m;\\n map<string, vector<ll>> mp;\\n vector<string> name(m);\\n vector<ll> lb(m), ub(m);\\n for(int i=0;i<m;i++){\\n cin >> name[i] >> lb[i] >> ub[i];\\n vector<ll> able(MOD, 0);\\n for(int j=lb[i];j<=ub[i];j++) {\\n able[j] = 1;\\n }\\n mp[name[i]] = able;\\n }\\n ll n;\\n cin >> n;\\n vector<string> e(n);\\n for(int i=0;i<n;i++) {\\n cin >> e[i];\\n }\\n stack<vector<ll>> st;\\n for(int i=0;i<n;i++) {\\n if (e[i] == \\\"+\\\" || e[i] == \\\"*\\\" || e[i] == \\\"-\\\" || e[i] == \\\"/\\\") {\\n vector<ll> able(MOD, 0);\\n auto y = st.top(); st.pop();\\n auto x = st.top(); st.pop();\\n for(int p0=0;p0<MOD;p0++) {\\n for(int p1=0;p1<MOD;p1++) {\\n if (!x[p0] || !y[p1]) continue;\\n if (e[i] == \\\"+\\\") {\\n able[(p0+p1)%MOD] = 1;\\n }\\n if (e[i] == \\\"-\\\") {\\n able[(p0-p1+MOD)%MOD] = 1;\\n }\\n if (e[i] == \\\"*\\\") {\\n able[(p0*p1)%MOD] = 1;\\n }\\n if (e[i] == \\\"/\\\") {\\n if (p1==0) {\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n able[(p0/p1)%MOD] = 1;\\n }\\n }\\n }\\n st.push(able);\\n } else if (mp.find(e[i])!=mp.end()){\\n st.push(mp[e[i]]);\\n } else {\\n vector<ll> able(MOD, 0);\\n able[stoi(e[i])] = 1;\\n st.push(able);\\n }\\n }\\n cout << \\\"correct\\\"<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3560,\n \"score_of_the_acc\": -0.6187,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2435_5820110\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.08.24 22:57:22 */\\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 = 1e6;\\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\\n#pragma region graph\\n\\nstruct Edge {\\n\\tint to;\\n\\tlong long cost;\\n\\tEdge() = default;\\n\\tEdge(int to_, long long cost_) : to(to_), cost(cost_) {}\\n\\tbool operator<(const Edge &a) const { return cost < a.cost; }\\n\\tbool operator>(const Edge &a) const { return cost > a.cost; }\\n\\tfriend std::ostream &operator<<(std::ostream &s, Edge &a) {\\n\\t\\ts << \\\"to: \\\" << a.to << \\\", cost: \\\" << a.cost;\\n\\t\\treturn s;\\n\\t}\\n};\\n\\nclass Graph {\\n\\tstd::vector<std::vector<Edge>> edges;\\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 edges.size(); }\\n\\tvoid resize(const int n) { edges.resize(n); }\\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 long long INF = 3e18;\\n\\n\\tvoid input(int e = -1, bool weight = 0, 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\\tlong long cost = 1;\\n\\t\\t\\tstd::cin >> u >> v;\\n\\t\\t\\tif(weight) std::cin >> cost;\\n\\t\\t\\tu -= idx, v -= idx;\\n\\t\\t\\tedges[u].emplace_back(v, cost);\\n\\t\\t\\tif(!directed) edges[v].emplace_back(u, cost);\\n\\t\\t}\\n\\t}\\n\\n\\tvoid add_edge(int u, int v, long long cost = 1, bool directed = false, int idx = 0) {\\n\\t\\tu -= idx, v -= idx;\\n\\t\\tedges[u].emplace_back(v, cost);\\n\\t\\tif(!directed) edges[v].emplace_back(u, cost);\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\tstd::vector<long long> bfs(int s) {\\n\\t\\tstd::vector<long long> 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 one\\n\\tstd::vector<long long> zero_one_bfs(int s) {\\n\\t\\tstd::vector<long long> 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\\tassert(0LL <= e.cost and e.cost < 2LL);\\n\\t\\t\\t\\tif(e.cost and dist[e.to] > dist[v] + 1) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v] + 1;\\n\\t\\t\\t\\t\\tdeq.push_back(e.to);\\n\\t\\t\\t\\t} else if(!e.cost and dist[e.to] > dist[v]) {\\n\\t\\t\\t\\t\\tdist[e.to] = dist[v];\\n\\t\\t\\t\\t\\tdeq.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)logV)\\n\\t// cannot reach: INF\\n\\tstd::vector<long long> dijkstra(int s) { // verified\\n\\t\\tstd::vector<long long> dist(size(), INF);\\n\\t\\tconst auto compare = [](const std::pair<long long, int> &a, const std::pair<long long, int> &b) { return a.first > b.first; };\\n\\t\\tstd::priority_queue<std::pair<long long, int>, std::vector<std::pair<long long, 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<long long, 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// cannot reach: INF\\n\\t// negative cycle: -INF\\n\\tstd::vector<long long> bellman_ford(int s) { // verified\\n\\t\\tint n = size();\\n\\t\\tstd::vector<long long> 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<long long>> warshall_floyd() {\\t// verified\\n\\t\\tint n = size();\\n\\t\\tstd::vector<std::vector<long long>> dist(n, std::vector<long long>(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 directed cycle exists, return {}\\n\\tstd::vector<int> topological_sort() { // verified\\n\\t\\tstd::vector<int> res;\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> used(n, 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 < n; 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() { return !topological_sort().empty(); } // verified\\n\\n\\t// Ο(V)\\n\\t// array of the distance from each vertex to the most distant vertex\\n\\tstd::vector<long long> height() { // verified\\n\\t\\tauto vec1 = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tlong long 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() {\\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() { return !bipartite_grouping().empty(); }\\n\\n\\t// Ο(V+E)\\n\\t// ((v1, v2), diameter)\\n\\tstd::pair<std::pair<int, int>, long long> diameter() {\\t// verified\\n\\t\\tauto vec = bfs(0);\\n\\t\\tint v1 = -1, v2 = -1;\\n\\t\\tlong long dia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec[i]) dia = vec[i], v1 = i;\\n\\t\\tvec = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec[i]) dia = vec[i], v2 = i;\\n\\t\\tstd::pair<std::pair<int, int>, long long> res = {{v1, v2}, dia};\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// Ο(ElogV)\\n\\tlong long prim() {\\t// verified\\n\\t\\tlong long 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// Ο(ElogE)\\n\\tlong long kruskal() { // verified\\n\\t\\tstd::vector<std::tuple<int, int, long long>> Edges;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tfor(auto &e : edges[i]) Edges.emplace_back(i, e.to, e.cost);\\n\\t\\tstd::sort(Edges.begin(), Edges.end(), [](const std::tuple<int, int, long long> &a, const std::tuple<int, int, long long> &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\\tlong long ret = 0;\\n\\t\\tfor(auto &e : Edges)\\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() {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> centroid, sz(n);\\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] > n / 2) is_centroid = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(n - sz[now] > n / 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// Ο(V+E)\\n\\t// directed graph from root to leaf\\n\\tGraph root_to_leaf(int root = 0) {\\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) {\\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// long long Chu_Liu_Edmonds(int root = 0) {}\\n};\\n\\nstruct tree_doubling {\\n private:\\n\\tstd::vector<std::vector<int>> parent;\\n\\tstd::vector<int> depth;\\n\\tstd::vector<long long> dist;\\n\\tint max_jump = 1;\\n\\n\\tvoid build() {\\n\\t\\tfor(int i = 0; i < max_jump - 1; i++) {\\n\\t\\t\\tfor(int v = 0; v < (int)dist.size(); v++) {\\n\\t\\t\\t\\tif(parent[i][v] == -1)\\n\\t\\t\\t\\t\\tparent[i + 1][v] = -1;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tparent[i + 1][v] = parent[i][parent[i][v]];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n public:\\n\\ttree_doubling() = default;\\n\\ttree_doubling(const Graph &g, const int root = 0) : dist(g.size()), depth(g.size()) {\\n\\t\\tint n = g.size();\\n\\t\\twhile((1 << max_jump) < n) max_jump++;\\n\\t\\tparent.assign(max_jump, std::vector<int>(n, -1));\\n\\t\\tauto dfs = [&](auto self, int now, int per, int d, long long cost) -> void {\\n\\t\\t\\tparent[0][now] = per;\\n\\t\\t\\tdepth[now] = d;\\n\\t\\t\\tdist[now] = cost;\\n\\t\\t\\tfor(auto &e : g[now])\\n\\t\\t\\t\\tif(e.to != per) self(self, e.to, now, d + 1, cost + e.cost);\\n\\t\\t};\\n\\t\\tdfs(dfs, root, -1, 0, 0LL);\\n\\t\\tbuild();\\n\\t}\\n\\n\\tint lowest_common_ancestor(int u, int v) {\\n\\t\\tif(depth[u] < depth[v]) std::swap(u, v);\\n\\t\\tint k = parent.size();\\n\\t\\tfor(int i = 0; i < k; i++)\\n\\t\\t\\tif((depth[u] - depth[v]) >> i & 1) u = parent[i][u];\\n\\t\\tif(u == v) return u;\\n\\t\\tfor(int i = k - 1; i >= 0; i--)\\n\\t\\t\\tif(parent[i][u] != parent[i][v]) u = parent[i][u], v = parent[i][v];\\n\\t\\treturn parent[0][u];\\n\\t}\\n\\n\\tlong long length_of_path(const int u, const int v) { return dist[u] + dist[v] - dist[lowest_common_ancestor(u, v)] * 2; }\\n\\n\\tint level_ancestor(int v, int level) {\\n\\t\\tassert(level >= 0);\\n\\t\\tfor(int jump = 0; jump < max_jump and level; jump++) {\\n\\t\\t\\tif(level & 1) v = parent[jump][v];\\n\\t\\t\\tlevel >>= 1;\\n\\t\\t}\\n\\t\\treturn v;\\n\\t}\\n};\\n\\nstruct strongly_connected_components {\\n private:\\n\\tenum { CHECKED = -1, UNCHECKED = -2 };\\n\\tconst Graph &graph_given;\\n\\tGraph graph_reversed;\\n\\tstd::vector<int> order, group_number; /* at the beginning of the building, 'group_number' is used as 'checked' */\\n\\n\\tvoid dfs(int now) {\\n\\t\\tif(group_number[now] != UNCHECKED) return;\\n\\t\\tgroup_number[now] = CHECKED;\\n\\t\\tfor(auto &e : graph_given[now]) dfs(e.to);\\n\\t\\torder.push_back(now);\\n\\t}\\n\\n\\tvoid rdfs(int now, int group_count) {\\n\\t\\tif(group_number[now] != UNCHECKED) return;\\n\\t\\tgroup_number[now] = group_count;\\n\\t\\tfor(auto &e : graph_reversed[now]) rdfs(e.to, group_count);\\n\\t}\\n\\n\\tvoid build(bool create_compressed_graph) {\\n\\t\\tfor(int i = 0; i < (int)graph_given.size(); i++) dfs(i);\\n\\t\\treverse(order.begin(), order.end());\\n\\t\\tgroup_number.assign(graph_given.size(), UNCHECKED);\\n\\t\\tint group = 0;\\n\\t\\tfor(auto &i : order)\\n\\t\\t\\tif(group_number[i] == UNCHECKED) rdfs(i, group), group++;\\n\\t\\tgraph_compressed.resize(group);\\n\\t\\tgroups.resize(group);\\n\\t\\tfor(int i = 0; i < (int)graph_given.size(); i++) groups[group_number[i]].push_back(i);\\n\\t\\tif(create_compressed_graph) {\\n\\t\\t\\tstd::vector<int> edges(group, -1);\\n\\t\\t\\tfor(int i = 0; i < group; i++)\\n\\t\\t\\t\\tfor(auto &vertex : groups[i])\\n\\t\\t\\t\\t\\tfor(auto &e : graph_given[vertex])\\n\\t\\t\\t\\t\\t\\tif(group_number[e.to] != i and edges[group_number[e.to]] != i) {\\n\\t\\t\\t\\t\\t\\t\\tedges[group_number[e.to]] = i;\\n\\t\\t\\t\\t\\t\\t\\tgraph_compressed[i].emplace_back(group_number[e.to], 1);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\n public:\\n\\tstd::vector<std::vector<int>> groups;\\n\\tGraph graph_compressed;\\n\\n\\tstrongly_connected_components(const Graph &g_, bool create_compressed_graph = false)\\n\\t\\t: graph_given(g_), graph_reversed(g_.size()), group_number(g_.size(), UNCHECKED) {\\n\\t\\tfor(size_t i = 0; i < g_.size(); i++)\\n\\t\\t\\tfor(auto &e : graph_given[i]) graph_reversed[e.to].emplace_back(i, 1);\\n\\t\\tbuild(create_compressed_graph);\\n\\t}\\n\\n\\tconst int &operator[](const int k) { return group_number[k]; }\\n};\\n\\nstruct low_link {\\n private:\\n\\tconst Graph &graph_given;\\n\\tint order_next;\\n\\n\\tvoid build() {\\n\\t\\tint n = graph_given.size();\\n\\t\\torder.resize(n, -1);\\n\\t\\tlow.resize(n);\\n\\t\\torder_next = 0;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tif(order[i] == -1) dfs(i);\\n\\t}\\n\\n\\tvoid dfs(int now, int par = -1) {\\n\\t\\tlow[now] = order[now] = order_next++;\\n\\t\\tbool is_articulation = false;\\n\\t\\tint cnt = 0, cnt_par = 0;\\n\\t\\tfor(const auto &ed : graph_given[now]) {\\n\\t\\t\\tconst int &nxt = ed.to;\\n\\t\\t\\tif(order[nxt] == -1) {\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\tdfs(nxt, now);\\n\\t\\t\\t\\tif(order[now] < low[nxt]) bridge.push_back(std::minmax(now, nxt));\\n\\t\\t\\t\\tif(order[now] <= low[nxt]) is_articulation = true;\\n\\t\\t\\t\\tlow[now] = std::min(low[now], low[nxt]);\\n\\t\\t\\t} else if(nxt != par or cnt_par++ == 1) {\\n\\t\\t\\t\\tlow[now] = std::min(low[now], order[nxt]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(par == -1 and cnt < 2) is_articulation = false;\\n\\t\\tif(is_articulation) articulation.push_back(now);\\n\\t\\treturn;\\n\\t}\\n\\n public:\\n\\tstd::vector<int> order, low, articulation;\\n\\tstd::vector<std::pair<int, int>> bridge;\\n\\tlow_link() = default;\\n\\tlow_link(const Graph &g_) : graph_given(g_) { build(); }\\n};\\n\\nstruct twoedge_connected_components {\\n private:\\n\\tconst Graph &graph_given;\\n\\tint group_next;\\n\\tlow_link li;\\n\\tstd::vector<int> group_number;\\n\\n\\tvoid build(bool create_compressed_graph) {\\n\\t\\tint n = graph_given.size();\\n\\t\\tgroup_number.resize(n, -1);\\n\\t\\tgroup_next = 0;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tif(group_number[i] == -1) dfs(i);\\n\\t\\tgroups.resize(group_next);\\n\\t\\tfor(int i = 0; i < graph_given.size(); i++) groups[group_number[i]].push_back(i);\\n\\n\\t\\tif(create_compressed_graph) {\\n\\t\\t\\tgraph_compressed.resize(group_next);\\n\\t\\t\\tfor(const auto &[u, v] : li.bridge) {\\n\\t\\t\\t\\tint x = group_number[u], y = group_number[v];\\n\\t\\t\\t\\tgraph_compressed.add_edge(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tvoid dfs(int now, int par = -1) {\\n\\t\\tif(par != -1 and li.order[par] >= li.low[now])\\n\\t\\t\\tgroup_number[now] = group_number[par];\\n\\t\\telse\\n\\t\\t\\tgroup_number[now] = group_next++;\\n\\t\\tfor(const auto &e : graph_given[now])\\n\\t\\t\\tif(group_number[e.to] == -1) dfs(e.to, now);\\n\\t}\\n\\n public:\\n\\tGraph graph_compressed;\\n\\tstd::vector<std::vector<int>> groups;\\n\\ttwoedge_connected_components(const Graph &g_, bool create_compressed_graph = false) : graph_given(g_), li(g_) {\\n\\t\\tbuild(create_compressed_graph);\\n\\t}\\n\\n\\tconst int &operator[](const int k) { return group_number[k]; }\\n};\\n\\n#pragma endregion\\n\\nint solve(int n) {\\n\\tmap<string, set<int>> variables;\\n\\trep(n) {\\n\\t\\tSTR(var);\\n\\t\\tint low, high;\\n\\t\\tcin >> low >> high;\\n\\t\\tset<int> s;\\n\\t\\trep(i, low, high + 1) s.insert(i);\\n\\t\\tvariables[var] = s;\\n\\t}\\n\\n\\tint len;\\n\\tcin >> len;\\n\\n\\tstack<set<int>> st;\\n\\n\\tauto op = [&](set<int> a, set<int> b, char ope) -> set<int> {\\n\\t\\tset<int> ret;\\n\\t\\tfoa(lef, a) foa(rig, b) {\\n\\t\\t\\tif(rig == 0 && ope == '/') {\\n\\t\\t\\t\\treturn set<int>({});\\n\\t\\t\\t}\\n\\n\\t\\t\\tint add;\\n\\t\\t\\tswitch(ope) {\\n\\t\\t\\t\\tcase '+':\\n\\t\\t\\t\\t\\tadd = lef + rig;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase '-':\\n\\t\\t\\t\\t\\tadd = lef - rig;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase '/':\\n\\t\\t\\t\\t\\tadd = lef / rig;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase '*':\\n\\t\\t\\t\\t\\tadd = lef * rig;\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tret.insert(((add % 256) + 256) % 256);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\n\\trep(i, len) {\\n\\t\\tstring nxt;\\n\\t\\tcin >> nxt;\\n\\t\\tset<int> t;\\n\\n\\t\\tset<int> a;\\n\\t\\tif(nxt == \\\"+\\\" || nxt == \\\"-\\\" || nxt == \\\"*\\\" || nxt == \\\"/\\\") {\\n\\t\\t\\tt = st.top();\\n\\t\\t\\tst.pop();\\n\\t\\t\\ta = st.top();\\n\\t\\t\\tst.pop();\\n\\t\\t\\tst.push(op(a, t, nxt.front()));\\n\\t\\t} else {\\n\\t\\t\\tif(variables.count(nxt)) {\\n\\t\\t\\t\\tt = variables[nxt];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tt.insert(stoi(nxt));\\n\\t\\t\\t}\\n\\t\\t\\tst.push(t);\\n\\t\\t}\\n\\t}\\n\\n\\tauto res = st.top();\\n\\treturn !res.empty();\\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 n;\\n\\twhile(cin >> n) {\\n\\t\\tcout << (solve(n) ? \\\"correct\\\" : \\\"error\\\");\\n\\t\\tcout << dl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.8058,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2435_5215992\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int mod = 256;\\n\\nint main() {\\n int m;\\n cin >> m;\\n map<string, vector<bool>> mp;\\n for (int i = 0; i < m; ++i) {\\n string name;\\n int lb, ub;\\n cin >> name >> lb >> ub;\\n mp[name].resize(mod);\\n for (int j = lb; j <= ub; ++j) {\\n mp[name][j] = true;\\n }\\n }\\n int n;\\n cin >> n;\\n vector<string> e(n);\\n for (auto& ei : e) cin >> ei;\\n\\n stack<string> s;\\n for (auto& ei : e) {\\n if (isdigit(ei[0])) {\\n s.push(ei);\\n } else if (isalpha(ei[0])) {\\n s.push(ei);\\n } else {\\n string b = s.top(); s.pop();\\n string a = s.top(); s.pop();\\n if (ei == \\\"+\\\") {\\n if (isdigit(a[0])) {\\n if (isdigit(b[0])) {\\n s.push(to_string((stoi(a) + stoi(b)) % mod));\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[b][j]) check[(stoi(a) + j) % mod] = true;\\n }\\n mp[b] = move(check);\\n s.push(b);\\n }\\n } else {\\n if (isdigit(b[0])) {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[a][j]) check[(j + stoi(b)) % mod] = true;\\n }\\n mp[a] = move(check);\\n s.push(a);\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (!mp[a][j]) continue;\\n for (int k = 0; k < mod; ++k) {\\n if (!mp[b][k]) continue;\\n check[(j + k) % mod] = true;\\n }\\n }\\n mp[a] = move(check);\\n s.push(a);\\n }\\n }\\n } else if (ei == \\\"-\\\") {\\n if (isdigit(a[0])) {\\n if (isdigit(b[0])) {\\n s.push(to_string((stoi(a) - stoi(b) + mod) % mod));\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[b][j]) check[(stoi(a) - j + mod) % mod] = true;\\n }\\n mp[b] = move(check);\\n s.push(b);\\n }\\n } else {\\n if (isdigit(b[0])) {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[a][j]) check[(j - stoi(b) + mod) % mod] = true;\\n }\\n mp[a] = move(check);\\n s.push(a);\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (!mp[a][j]) continue;\\n for (int k = 0; k < mod; ++k) {\\n if (!mp[b][k]) continue;\\n check[(j - k + mod) % mod] = true;\\n }\\n }\\n mp[a] = move(check);\\n s.push(a);\\n }\\n }\\n } else if (ei == \\\"*\\\") {\\n if (isdigit(a[0])) {\\n if (isdigit(b[0])) {\\n s.push(to_string((stoi(a) * stoi(b)) % mod));\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[b][j]) check[(stoi(a) * j) % mod] = true;\\n }\\n mp[b] = move(check);\\n s.push(b);\\n }\\n } else {\\n if (isdigit(b[0])) {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[a][j]) check[(j * stoi(b)) % mod] = true;\\n }\\n mp[a] = move(check);\\n s.push(a);\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (!mp[a][j]) continue;\\n for (int k = 0; k < mod; ++k) {\\n if (!mp[b][k]) continue;\\n check[(j * k) % mod] = true;\\n }\\n }\\n mp[a] = move(check);\\n s.push(a);\\n }\\n }\\n } else if (ei == \\\"/\\\") {\\n if (isdigit(a[0])) {\\n if (isdigit(b[0])) {\\n if (stoi(b) == 0) {\\n cout << \\\"error\\\\n\\\";\\n return 0;\\n }\\n s.push(to_string((stoi(a) / stoi(b)) % mod));\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[b][j]) {\\n if (j == 0) {\\n cout << \\\"error\\\\n\\\";\\n return 0;\\n }\\n check[(stoi(a) / j) % mod] = true;\\n }\\n }\\n mp[b] = move(check);\\n s.push(b);\\n }\\n } else {\\n if (isdigit(b[0])) {\\n if (stoi(b) == 0) {\\n cout << \\\"error\\\\n\\\";\\n return 0;\\n }\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (mp[a][j]) check[(j / stoi(b)) % mod] = true;\\n }\\n mp[a] = move(check);\\n s.push(a);\\n } else {\\n vector<bool> check(mod);\\n for (int j = 0; j < mod; ++j) {\\n if (!mp[a][j]) continue;\\n for (int k = 0; k < mod; ++k) {\\n if (!mp[b][k]) continue;\\n if (k == 0) {\\n cout << \\\"error\\\\n\\\";\\n return 0;\\n }\\n check[(j / k) % mod] = true;\\n }\\n }\\n mp[a] = move(check);\\n s.push(a);\\n }\\n }\\n } else {\\n assert(false);\\n }\\n }\\n }\\n cout << \\\"correct\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.5827,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2435_5065315\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int UP=256;\\nint ADD(int a,int b){return (a+b)%UP;}\\nint SUB(int a,int b){return (a-b+UP)%UP;}\\nint MUL(int a,int b){return a*b%UP;}\\nint DIV(int a,int b){return a/b;}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int m; cin >> m;\\n vector<string> name(m);\\n vector<int> lb(m),ub(m);\\n for (int i=0;i<m;++i) cin >> name[i] >> lb[i] >> ub[i];\\n int n; cin >> n;\\n vector<string> S(n);\\n for (int i=0;i<n;++i) cin >> S[i];\\n\\n map<string,int> mp;\\n for (int i=0;i<m;++i) mp[name[i]]=i;\\n\\n stack<vector<bool>> st;\\n for (int i=0;i<n;++i){\\n if (isdigit(S[i][0])){\\n int res=stoi(S[i]);\\n vector<bool> v(UP,false);\\n v[res]=true; st.emplace(v);\\n } else if (S[i]==\\\"+\\\"||S[i]==\\\"-\\\"||S[i]==\\\"*\\\"||S[i]==\\\"/\\\"){\\n vector<bool> v=st.top(); st.pop();\\n vector<bool> u=st.top(); st.pop();\\n vector<bool> w(UP,false);\\n for (int j=0;j<UP;++j){\\n for (int k=0;k<UP;++k){\\n if (u[j]&&v[k]){\\n if (S[i]==\\\"+\\\") w[ADD(j,k)]=true;\\n if (S[i]==\\\"-\\\") w[SUB(j,k)]=true;\\n if (S[i]==\\\"*\\\") w[MUL(j,k)]=true;\\n if (S[i]==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << '\\\\n';\\n return 0;\\n }\\n w[DIV(j,k)]=true;\\n }\\n }\\n }\\n }\\n st.emplace(w);\\n } else {\\n int x=mp[S[i]];\\n vector<bool> v(UP,false);\\n for (int i=lb[x];i<=ub[x];++i) v[i]=true;\\n st.emplace(v);\\n }\\n }\\n\\n cout << \\\"correct\\\" << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.0144,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2435_5065312\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst long long MOD=1000000007;\\n// const long long MOD=998244353;\\n#define LOCAL\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(),(x).end()\\nconst int INF=1e9;\\nconst long long IINF=1e18;\\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\nconst char dir[4]={'D','R','U','L'};\\n\\ntemplate<typename T>\\nistream &operator>>(istream &is,vector<T> &v){\\n for (T &x:v) is >> x;\\n return is;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const vector<T> &v){\\n for (int i=0;i<v.size();++i){\\n os << v[i] << (i+1==v.size()?\\\"\\\": \\\" \\\");\\n }\\n return os;\\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,typename V>\\nostream&operator<<(ostream &os,const tuple<T,U,V> &t){\\n os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';\\n return os;\\n}\\ntemplate<typename T,typename U,typename V,typename W>\\nostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){\\n os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';\\n return os;\\n}\\ntemplate<typename T,typename U>\\nostream &operator<<(ostream &os,const map<T,U> &m){\\n os << '{';\\n for (auto itr=m.begin();itr!=m.end();){\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr!=m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T,typename U>\\nostream &operator<<(ostream &os,const unordered_map<T,U> &m){\\n os << '{';\\n for (auto itr=m.begin();itr!=m.end();){\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr!=m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const set<T> &s){\\n os << '{';\\n for (auto itr=s.begin();itr!=s.end();){\\n os << *itr;\\n if (++itr!=s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const multiset<T> &s){\\n os << '{';\\n for (auto itr=s.begin();itr!=s.end();){\\n os << *itr;\\n if (++itr!=s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const unordered_set<T> &s){\\n os << '{';\\n for (auto itr=s.begin();itr!=s.end();){\\n os << *itr;\\n if (++itr!=s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<<(ostream &os,const deque<T> &v){\\n for (int i=0;i<v.size();++i){\\n os << v[i] << (i+1==v.size()?\\\"\\\": \\\" \\\");\\n }\\n return os;\\n}\\n\\nvoid debug_out(){cerr << '\\\\n';}\\ntemplate<class Head,class... Tail>\\nvoid debug_out(Head&& head,Tail&&... tail){\\n cerr << head;\\n if (sizeof...(Tail)>0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) cerr << \\\" \\\";\\\\\\ncerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n';\\\\\\ncerr << \\\" \\\";\\\\\\ndebug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n\\ntemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}\\ntemplate<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}\\n\\ntemplate<class T1,class T2> inline bool chmin(T1 &a,T2 b){\\n if (a>b){a=b; return true;} return false;\\n}\\ntemplate<class T1,class T2> inline bool chmax(T1 &a,T2 b){\\n if (a<b){a=b; return true;} return false;\\n}\\n#pragma endregion\\n\\nconst int UP=256;\\nint ADD(int a,int b){return (a+b)%UP;}\\nint SUB(int a,int b){return (a-b+UP)%UP;}\\nint MUL(int a,int b){return a*b%UP;}\\nint DIV(int a,int b){return a/b;}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int m; cin >> m;\\n vector<string> name(m);\\n vector<int> lb(m),ub(m);\\n for (int i=0;i<m;++i) cin >> name[i] >> lb[i] >> ub[i];\\n int n; cin >> n;\\n vector<string> S(n);\\n for (int i=0;i<n;++i) cin >> S[i];\\n\\n map<string,int> mp;\\n for (int i=0;i<m;++i) mp[name[i]]=i;\\n\\n stack<vector<bool>> st;\\n for (int i=0;i<n;++i){\\n if (isdigit(S[i][0])){\\n int res=stoi(S[i]);\\n vector<bool> v(UP,false);\\n v[res]=true; st.emplace(v);\\n } else if (S[i]==\\\"+\\\"||S[i]==\\\"-\\\"||S[i]==\\\"*\\\"||S[i]==\\\"/\\\"){\\n vector<bool> v=st.top(); st.pop();\\n vector<bool> u=st.top(); st.pop();\\n vector<bool> w(UP,false);\\n for (int j=0;j<UP;++j){\\n for (int k=0;k<UP;++k){\\n if (u[j]&&v[k]){\\n if (S[i]==\\\"+\\\") w[ADD(j,k)]=true;\\n if (S[i]==\\\"-\\\") w[SUB(j,k)]=true;\\n if (S[i]==\\\"*\\\") w[MUL(j,k)]=true;\\n if (S[i]==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << '\\\\n';\\n return 0;\\n }\\n w[DIV(j,k)]=true;\\n }\\n }\\n }\\n }\\n st.emplace(w);\\n } else {\\n int x=mp[S[i]];\\n vector<bool> v(UP,false);\\n for (int i=lb[x];i<=ub[x];++i) v[i]=true;\\n st.emplace(v);\\n }\\n }\\n\\n cout << \\\"correct\\\" << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3244,\n \"score_of_the_acc\": -0.0504,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2435_4937316\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nconst double pi = 3.141592653589793238462643383279;\\nusing namespace std;\\n//typedef\\n//------------------------------------------\\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\ntypedef long long LL;\\ntypedef unsigned long long ULL;\\ntypedef vector<LL> VLL;\\ntypedef vector<VLL> VVLL;\\n\\n//container util\\n//------------------------------------------\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SQ(a) ((a) * (a))\\n#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)\\n#define EXIST(s, e) ((s).find(e) != (s).end())\\n#define SORT(c) sort((c).begin(), (c).end())\\n\\n//repetition\\n//------------------------------------------\\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define MOD 1000000007\\n\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n#define sz(x) (int)(x).size()\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\nconst double EPS = 1e-7, PI = acos(-1);\\n//ここから編集\\n\\nstring solve(){\\n int m; cin >> m;\\n vector<string> name(m);\\n vector<int> lb(m), ub(m);\\n REP(i,m) cin >> name[i] >> lb[i] >> ub[i];\\n\\n map<string, int> mp;\\n REP(i,m) mp[name[i]] = i;\\n\\n int n; cin >> n;\\n vector<string> ss(n);\\n REP(i,n) cin >> ss[i];\\n stack<vector<int>> stt;\\n REP(i,n){\\n string s = ss[i];\\n if(s == \\\"/\\\" || s == \\\"*\\\" || s == \\\"+\\\" || s == \\\"-\\\"){\\n auto b = stt.top();\\n stt.pop();\\n auto a = stt.top();\\n stt.pop();\\n set<int> st;\\n if(s == \\\"/\\\"){\\n for(int j=0; j<a.size(); j++){\\n for(int k=0; k<b.size(); k++){\\n if(b[k] == 0) return \\\"error\\\";\\n st.insert(a[j]/b[k]);\\n }\\n }\\n }else if(s == \\\"*\\\"){\\n for(int j=0; j<a.size(); j++){\\n for(int k=0; k<b.size(); k++){\\n st.insert(a[j]*b[k]%256);\\n }\\n }\\n }else if(s == \\\"+\\\"){\\n for(int j=0; j<a.size(); j++){\\n for(int k=0; k<b.size(); k++){\\n st.insert(a[j]+b[k] % 256);\\n }\\n }\\n }else if(s == \\\"-\\\"){\\n for(int j=0; j<a.size(); j++){\\n for(int k=0; k<b.size(); k++){\\n st.insert((a[j]-b[k]+256)%256);\\n }\\n }\\n }\\n vector<int> tmp;\\n for(auto e: st) tmp.push_back(e);\\n stt.push(tmp);\\n }else if(mp.find(s) != mp.end()){\\n int idx = mp[s];\\n vector<int> tmp;\\n for(int j=lb[idx]; j<=ub[idx]; j++) tmp.push_back(j);\\n stt.push(tmp);\\n }else{\\n int num = stoi(s);\\n stt.push({num});\\n }\\n }\\n return \\\"correct\\\";\\n}\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(6);\\n\\n cout << solve() << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 0.35714285714285715,\n \"time_ms\": 10,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.1151,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2435_4933978\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing pi=pair<int,int>;\\nint main() {\\n int m;\\n cin>>m;\\n map<string,vector<int>> mp;\\n for(int i = 0; i < m; ++i){\\n string a;\\n cin>>a;\\n int l,u;\\n cin>>l>>u;\\n vector<int> vb(256,0);\\n for(int j = l; j <= u; ++j){\\n vb[j]=1;\\n }\\n mp[a]=vb;\\n }\\n stack<string> st;\\n int n;\\n cin>>n;\\n string s;\\n bool av,bv;\\n string a,b;\\n for(int i = 0; i < n; ++i){\\n cin>>s;\\n //cout<<s<<endl;\\n //cerr<<i<<endl;\\n switch (s[0]) {\\n case '+':\\n b=st.top();\\n st.pop();\\n a=st.top();\\n st.pop();\\n bv=isalpha(b[0]);\\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\\n if(!bv) {\\n if(!av) {\\n int res=stoi(b)+stoi(a);\\n res%=256;\\n st.push(to_string(res));\\n }\\n else {\\n int bn=stoi(b);\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]%2!=1)continue;\\n mp[a][(j+bn)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]>=2)mp[a][j]=1;\\n else mp[a][j]=0;\\n }\\n st.push(a);\\n }\\n }\\n else {\\n if(!av) {\\n int an=stoi(a);\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n mp[b][(j+an)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n else {\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n for(int k = 0; k < 256; ++k){\\n if(mp[a][k]%2!=1)continue;\\n mp[b][(j+k)%256]+=2;\\n }\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n }\\n break;\\n case '-':\\n b=st.top();\\n st.pop();\\n a=st.top();\\n st.pop();\\n bv=isalpha(b[0]);\\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\\n if(!bv) {\\n if(!av) {\\n int res=stoi(a)-stoi(b)+256;\\n res%=256;\\n//cerr<<res<<endl;\\n st.push(to_string(res));\\n }\\n else {\\n int bn=stoi(b);\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]%2!=1)continue;\\n mp[a][(j-bn+256)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]>=2)mp[a][j]=1;\\n else mp[a][j]=0;\\n }\\n st.push(a);\\n }\\n }\\n else {\\n if(!av) {\\n int an=stoi(a);\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n mp[b][(an-j+256)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n else {\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n for(int k = 0; k < 256; ++k){\\n if(mp[a][k]%2!=1)continue;\\n mp[b][(k-j+256)%256]+=2;\\n }\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n//if(mp[b][j]==1)cerr<<j<<\\\" \\\";\\n }\\n//cerr<<endl;\\n st.push(b);\\n }\\n }\\n break;\\n case '*':\\n b=st.top();\\n st.pop();\\n a=st.top();\\n st.pop();\\n bv=isalpha(b[0]);\\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\\n if(!bv) {\\n if(!av) {\\n int res=stoi(b)*stoi(a);\\n res%=256;\\n st.push(to_string(res));\\n }\\n else {\\n int bn=stoi(b);\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]%2!=1)continue;\\n mp[a][(j*bn)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]>=2)mp[a][j]=1;\\n else mp[a][j]=0;\\n }\\n st.push(a);\\n }\\n }\\n else {\\n if(!av) {\\n int an=stoi(a);\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n mp[b][(j*an)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n else {\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n for(int k = 0; k < 256; ++k){\\n if(mp[a][k]%2!=1)continue;\\n mp[b][(j*k)%256]+=2;\\n }\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n }\\n break;\\n case '/':\\n b=st.top();\\n st.pop();\\n a=st.top();\\n st.pop();\\n bv=isalpha(b[0]);\\n av=isalpha(a[0]);//変数名はたぶんアルファベットから始まる\\n if(!bv) {\\n if(stoi(b)==0) {\\n cout<<\\\"error\\\"<<endl;\\n return 0;\\n }\\n if(!av) {\\n int res=stoi(a)/stoi(b);\\n res%=256;\\n st.push(to_string(res));\\n }\\n else {\\n int bn=stoi(b);\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]%2!=1)continue;\\n mp[a][(j/bn)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[a][j]>=2)mp[a][j]=1;\\n else mp[a][j]=0;\\n }\\n st.push(a);\\n }\\n }\\n else {\\n if(mp[b][0]==1) {\\n cout<<\\\"error\\\"<<endl;\\n return 0;\\n }\\n if(!av) {\\n int an=stoi(a);\\n \\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n mp[b][(an/j)%256]+=2;\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n else {\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]%2!=1)continue;\\n for(int k = 0; k < 256; ++k){\\n if(mp[a][k]%2!=1)continue;\\n mp[b][(k/j+256)%256]+=2;\\n }\\n }\\n for(int j = 0; j < 256; ++j){\\n if(mp[b][j]>=2)mp[b][j]=1;\\n else mp[b][j]=0;\\n }\\n st.push(b);\\n }\\n }\\n break;\\n default:\\n st.push(s);\\n break;\\n }\\n }\\n cout<<\\\"correct\\\"<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.4802,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2435_4933944\",\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\\nint main() {\\n\\n const int mod = 256;\\n \\n int m; cin >> m;\\n map<string, pair<int, int>> mp;\\n for (int i = 0; i < m; i++) {\\n string name; cin >> name;\\n int l, r; cin >> l >> r;\\n mp[name] = {l, r};\\n }\\n\\n stack<set<int>> stk;\\n int n; cin >> n;\\n for (int i = 0; i < n; i++) {\\n string s;\\n cin >> s;\\n if (s == \\\"+\\\" || s == \\\"-\\\" || s == \\\"*\\\" || s == \\\"/\\\") {\\n // 演算子の場合\\n auto b = stk.top();\\n stk.pop();\\n auto a = stk.top();\\n stk.pop();\\n\\n // 0 division checker\\n if (s == \\\"/\\\") {\\n for (auto bb : b) {\\n if (bb == 0) {\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n }\\n }\\n\\n set<int> st;\\n // 全探索\\n for (auto aa : a) {\\n for (auto bb : b) {\\n int num;\\n if (s == \\\"+\\\") {\\n num = (aa + bb) % mod;\\n }\\n if (s == \\\"-\\\") {\\n num = (aa - bb + mod) % mod;\\n }\\n if (s == \\\"*\\\") {\\n num = (aa * bb) % mod;\\n }\\n if (s == \\\"/\\\") {\\n num = (aa / bb) % mod;\\n }\\n\\n st.insert(num);\\n }\\n }\\n\\n stk.push(st);\\n\\n } else if (mp.find(s) != mp.end()) {\\n // 変数の場合\\n int l, r;\\n tie(l, r) = mp[s];\\n set<int> st;\\n for (int i = l; i <= r; i++) {\\n st.insert(i);\\n }\\n stk.push(st);\\n } else {\\n // 整数の場合\\n int num = stoi(s);\\n set<int> st;\\n st.insert(num);\\n stk.push(st);\\n }\\n }\\n\\n cout << \\\"correct\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.3507,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2435_4933870\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define pp pair<int,int>\\n#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)\\n#define ll long long\\n#define ld long double\\n#define all(a) (a).begin(),(a).end()\\n#define mk make_pair\\nll MOD=1000000007;\\nll mod=998244353;\\nint inf=1000001000;\\nll INF=1e18+5;\\n\\n\\nint main() {\\n int r;\\n cin >> r;\\n map<string,pair<int,int>> m;\\n map<string,vector<int>> mm;\\n rep(i,r){\\n string s;\\n int a,b;\\n cin >> s >> a >> b;\\n m[s]=mk(a,b);\\n }\\n int n;\\n cin >> n;\\n stack<string> w;\\n rep(i,n){\\n string s;\\n cin >> s;\\n if (s==\\\"+\\\" || s==\\\"-\\\" || s==\\\"*\\\" || s==\\\"/\\\"){\\n string a=w.top();\\n w.pop();\\n string b=w.top();\\n w.pop();\\n int c=0,d=0;\\n if (a[0]-'0'<=9 && a[0]-'0'>=0){\\n rep(j,a.size()){\\n int u=a[j]-'0';\\n c*=10;\\n c+=u;\\n }\\n }\\n if (b[0]-'0'<=9 && b[0]-'0'>=0){\\n rep(j,b.size()){\\n int u=b[j]-'0';\\n d*=10;\\n d+=u;\\n }\\n }\\n vector<int> oo(256,0);\\n if (m.find(b)!=m.end()){\\n int f=m[b].first,g=m[b].second;\\n for (int j=f;j<=g;j++){\\n if (m.find(a)!=m.end()){\\n int ff=m[a].first,gg=m[a].second;\\n for (int k=ff;k<=gg;k++){\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else if (mm.find(a)!=mm.end()){\\n for (int k=0;k<256;k++){\\n if (mm[a][k]==0) continue;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else {\\n int k=c;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n }\\n else if (mm.find(b)!=mm.end()){\\n rep(j,256){\\n if (mm[b][j]==0) continue;\\n if (m.find(a)!=m.end()){\\n int ff=m[a].first,gg=m[a].second;\\n for (int k=ff;k<=gg;k++){\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else if (mm.find(a)!=mm.end()){\\n for (int k=0;k<256;k++){\\n if (mm[a][k]==0) continue;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else {\\n int k=c;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n }\\n else {\\n int j=d;\\n if (m.find(a)!=m.end()){\\n int ff=m[a].first,gg=m[a].second;\\n for (int k=ff;k<=gg;k++){\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else if (mm.find(a)!=mm.end()){\\n for (int k=0;k<256;k++){\\n if (mm[a][k]==0) continue;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n else {\\n int k=c;\\n if (s==\\\"+\\\") oo[(j+k)%256]=1;\\n if (s==\\\"-\\\") oo[(256+j-k)%256]=1;\\n if (s==\\\"*\\\") oo[(j*k)%256]=1;\\n if (s==\\\"/\\\"){\\n if (k==0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n else oo[(j/k)%256]=1;\\n } \\n }\\n }\\n string h;\\n rep(j,i+1) h.push_back('?');\\n w.push(h);\\n mm[h]=oo;\\n }\\n else w.push(s);\\n }\\n cout << \\\"correct\\\" << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.7248,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2435_4762200\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int m;\\n cin >> m;\\n map<string, vector<bool>> mp;\\n for (int i = 0; i < m; i++){\\n string name;\\n int lb, ub;\\n cin >> name >> lb >> ub;\\n mp[name] = vector<bool>(256, false);\\n for (int j = lb; j <= ub; j++){\\n mp[name][j] = true;\\n }\\n }\\n int n;\\n cin >> n;\\n bool ok = true;\\n stack<vector<bool>> st;\\n for (int i = 0; i < n; i++){\\n string S;\\n cin >> S;\\n if (mp.count(S)){\\n st.push(mp[S]);\\n } else if ('0' <= S[0] && S[0] <= '9'){\\n vector<bool> tmp(256, false);\\n tmp[stoi(S)] = true;\\n st.push(tmp);\\n } else {\\n vector<bool> b = st.top();\\n st.pop();\\n vector<bool> a = st.top();\\n st.pop();\\n if (S == \\\"/\\\" && b[0]){\\n ok = false;\\n break;\\n }\\n vector<bool> r(256, false);\\n for (int i = 0; i < 256; i++){\\n for (int j = 0; j < 256; j++){\\n if (a[i] && b[j]){\\n if (S == \\\"+\\\"){\\n r[(i + j) % 256] = true;\\n }\\n if (S == \\\"-\\\"){\\n r[(i - j + 256) % 256] = true;\\n }\\n if (S == \\\"*\\\"){\\n r[i * j % 256] = true;\\n }\\n if (S == \\\"/\\\"){\\n r[i / j] = true;\\n }\\n }\\n }\\n }\\n st.push(r);\\n }\\n }\\n if (ok){\\n cout << \\\"correct\\\" << endl;\\n } else {\\n cout << \\\"error\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3244,\n \"score_of_the_acc\": -0.0504,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2435_4238169\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#pragma comment (linker, \\\"/STACK:526000000\\\")\\n\\n#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\ntypedef string::const_iterator State;\\n#define eps 1e-11L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n\\n#define MOD 998244353LL\\n#define seg_size 262144 * 4LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\n#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))\\n#define ALL(x) (x).begin(),(x).end()\\n\\nvoid init() {\\n\\tiostream::sync_with_stdio(false);\\n\\tcout << fixed << setprecision(20);\\n}\\n\\n#define int ll\\n\\nvoid solve(){\\n\\tint n;\\n\\tcin >> n;\\n\\tmap<string, pair<int, int>> variables;\\n\\tREP(i, n) {\\n\\t\\tstring a;\\n\\t\\tint b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tvariables[a] = mp(b, c);\\n\\t}\\n\\tstack<set<int>> now_stack;\\n\\tint m;\\n\\tcin >> m;\\n\\tREP(te, m) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tif (s[0] >= '0' && s[0] <= '9') {\\n\\t\\t\\tnow_stack.push(set<int>{stoll(s)});\\n\\t\\t}\\n\\t\\telse if(variables.find(s) != variables.end()) {\\n\\t\\t\\tset<int> geko;\\n\\t\\t\\tfor (int q = variables[s].first; q <= variables[s].second; ++q) {\\n\\t\\t\\t\\tgeko.insert(q);\\n\\t\\t\\t}\\n\\t\\t\\tnow_stack.push(geko);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tset<int> now[2];\\n\\t\\t\\tnow[0] = now_stack.top();\\n\\t\\t\\tnow_stack.pop();\\n\\t\\t\\tnow[1] = now_stack.top();\\n\\t\\t\\tnow_stack.pop();\\n\\t\\t\\tset<int> result;\\n\\t\\t\\tfor (auto x : now[1]) {\\n\\t\\t\\t\\tfor (auto y : now[0]) {\\n\\t\\t\\t\\t\\tif (s == \\\"+\\\") {\\n\\t\\t\\t\\t\\t\\tresult.insert((x + y) % 256);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (s == \\\"-\\\") {\\n\\t\\t\\t\\t\\t\\tresult.insert((x - y + 256) % 256);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (s == \\\"*\\\") {\\n\\t\\t\\t\\t\\t\\tresult.insert((x * y) % 256);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tif (y == 0) {\\n\\t\\t\\t\\t\\t\\t\\tcout << \\\"error\\\" << endl;\\n\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tresult.insert((x / y) % 256);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tnow_stack.push(result);\\n\\t\\t}\\n\\t}\\n\\tcout << \\\"correct\\\" << endl;\\n}\\n\\n#undef int\\nint main() {\\n\\tinit();\\n\\n\\tsolve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3304,\n \"score_of_the_acc\": -0.4083,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2435_4109887\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define eb emplace_back\\n#define ALL(A) A.begin(),A.end()\\n#define RALL(A) A.rbegin(),A.rend()\\ntypedef long long LL;\\ntypedef pair<LL,LL> P;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\nconst LL mod=1000000007;\\nconst LL LINF=1LL<<60;\\nconst int INF=1<<30;\\nint dx[]={1,0, 0,-1,1,-1, 1,-1};\\nint dy[]={0,1,-1, 0,1,-1,-1, 1};\\n\\n\\n\\nint main(){\\n int m;cin >> m;\\n vector<string> s(m);\\n vector<int> l(m),r(m);\\n unordered_map<string,vector<bool>> val;\\n for (int i = 0; i < m; i++) {\\n cin >> s[i] >> l[i] >> r[i];\\n r[i]++;\\n vector<bool> v(256,false);\\n for (int j = l[i]; j < r[i]; j++) {\\n v[j] = true;\\n }\\n val[s[i]] = v;\\n }\\n int n;cin >> n;\\n stack<string> st;\\n bool f = false;\\n vector<int> c(10,0);\\n for (int i = 0; i < n; i++) {\\n string t;cin >> t;\\n if(t[0]=='+'){\\n string q = st.top();st.pop();\\n string p = st.top();st.pop();\\n vector<bool> v(256,false);\\n for (int j = 0; j < 256; j++) {\\n if(!val[p][j]) continue;\\n for (int k = 0; k < 256; k++) {\\n if(!val[q][k]) continue;\\n v[(j+k)%256] = true;\\n }\\n }\\n val[p] = v;\\n st.push(p);\\n }\\n else if(t[0]=='-'){\\n string q = st.top();st.pop();\\n string p = st.top();st.pop();\\n vector<bool> v(256,false);\\n for (int j = 0; j < 256; j++) {\\n if(!val[p][j]) continue;\\n for (int k = 0; k < 256; k++) {\\n if(!val[q][k]) continue;\\n v[(j-k+256)%256] = true;\\n }\\n }\\n val[p] = v;\\n st.push(p);\\n }\\n else if(t[0]=='*'){\\n string q = st.top();st.pop();\\n string p = st.top();st.pop();\\n vector<bool> v(256,false);\\n for (int j = 0; j < 256; j++) {\\n if(!val[p][j]) continue;\\n for (int k = 0; k < 256; k++) {\\n if(!val[q][k]) continue;\\n v[(j*k)%256] = true;\\n }\\n }\\n val[p] = v;\\n st.push(p);\\n }\\n else if(t[0]=='/'){\\n string q = st.top();st.pop();\\n string p = st.top();st.pop();\\n vector<bool> v(256,false);\\n for (int j = 0; j < 256; j++) {\\n if(!val[p][j]) continue;\\n for (int k = 0; k < 256; k++) {\\n if(!val[q][k]) continue;\\n if(k==0){\\n puts(\\\"error\\\");\\n return 0;\\n }\\n v[j/k] = true;\\n }\\n }\\n val[p] = v;\\n st.push(p);\\n }\\n else{\\n if(0<=t[0]-'0'&&t[0]-'0'<10){\\n vector<bool> v(256,false);\\n v[stoi(t)] = true;\\n t += to_string(c[t[0] - '0']++);\\n val[t] = v;\\n }\\n st.push(t);\\n }\\n }\\n puts(\\\"correct\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3320,\n \"score_of_the_acc\": -0.4371,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2435_4057197\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MOD 256\\nusing namespace std;\\n\\nlong long m, n;\\nvector<string> e;\\nmap<string, set<int>> mp;\\nstack<set<int>> st;\\n\\nbool solve();\\n\\nint main() {\\n cin >> m;\\n for(int i = 0; i < m; ++i) {\\n string s;\\n int l, r;\\n cin >> s >> l >> r;\\n for(int i = l; i <= r; ++i) mp[s].insert(i);\\n }\\n cin >> n;\\n e.resize(n);\\n for(int i = 0; i < n; ++i) cin >> e[i];\\n if(solve())\\n cout << \\\"correct\\\" << endl;\\n else\\n cout << \\\"error\\\" << endl;\\n return 0;\\n}\\n\\nbool solve() {\\n for(int i = 0; i < n; ++i) {\\n set<int> a, b, c;\\n if(e[i] == \\\"+\\\") {\\n b = st.top();\\n st.pop();\\n a = st.top();\\n st.pop();\\n for(int x : a)\\n for(int y : b) c.insert((x + y) % MOD);\\n st.push(c);\\n }\\n else if(e[i] == \\\"-\\\") {\\n b = st.top();\\n st.pop();\\n a = st.top();\\n st.pop();\\n for(int x : a)\\n for(int y : b) c.insert((x - y + MOD) % MOD);\\n st.push(c);\\n }\\n else if(e[i] == \\\"*\\\") {\\n b = st.top();\\n st.pop();\\n a = st.top();\\n st.pop();\\n for(int x : a)\\n for(int y : b) c.insert((x * y) % MOD);\\n st.push(c);\\n }\\n else if(e[i] == \\\"/\\\") {\\n b = st.top();\\n st.pop();\\n a = st.top();\\n st.pop();\\n for(int x : a)\\n for(int y : b) {\\n if(y == 0) return 0;\\n c.insert((x / y) % MOD);\\n }\\n st.push(c);\\n }\\n else if(isdigit(e[i][0])) {\\n a.insert(stoi(e[i]) % MOD);\\n st.push(a);\\n }\\n else\\n st.push(mp[e[i]]);\\n }\\n return 1;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.2518,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2435_3731118\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\n\\n#define EPS (1e-7)\\n#define INF (1e9)\\n#define PI (acos(-1))\\n//const ll mod = 1000000007;\\nmap<string, set<int> > mp;\\n\\nint f(string s) {\\n //cerr << s << endl;\\n if(s.size() == 1) return s[0] - '0';\\n return 10 * f(s.substr(0, s.size() - 1)) + s.back() - '0';\\n}\\n\\nint main() {\\n //cout.precision(10);\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int m;\\n cin >> m;\\n while(m--) {\\n string s;\\n cin >> s;\\n int l, u;\\n cin >> l >> u;\\n for(int i = l; i <= u; i++) mp[s].insert(i);\\n }\\n string NEWVAL;\\n for(int i = 1; i <= 21; i++) NEWVAL.push_back('A');\\n int n;\\n cin >> n;\\n stack<string> sta;\\n while(n--) {\\n string s;\\n cin >> s;\\n NEWVAL[0]++;\\n if(s == \\\"+\\\" || s == \\\"-\\\" || s == \\\"*\\\" || s == \\\"/\\\") {\\n string a = sta.top();\\n sta.pop();\\n string b = sta.top();\\n sta.pop();\\n for(auto itr = mp[a].begin(); itr != mp[a].end(); itr++) {\\n for(auto itr2 = mp[b].begin(); itr2 != mp[b].end(); itr2++) {\\n if(s == \\\"/\\\" && *itr == 0) {\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n if(s == \\\"+\\\") mp[NEWVAL].insert((*itr2 + *itr) % 256);\\n if(s == \\\"-\\\") mp[NEWVAL].insert((*itr2 - *itr + 256) % 256);\\n if(s == \\\"*\\\") mp[NEWVAL].insert(*itr * *itr2 % 256);\\n if(s == \\\"/\\\") mp[NEWVAL].insert(*itr2 / *itr % 256);\\n }\\n }\\n sta.push(NEWVAL);\\n continue;\\n }\\n if(!mp[s].empty()) {\\n sta.push(s);\\n } else {\\n /*\\n cerr << \\\"nmb: \\\" << s << endl;\\n cerr << f(s) << endl;\\n */\\n mp[NEWVAL].insert(f(s));\\n sta.push(NEWVAL);\\n }\\n }\\n cout << \\\"correct\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -1.5612,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2435_3713816\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve() {\\n\\tint m; cin >> m;\\n\\tmap<string, pair<int, int>> range;\\n\\twhile(m--) {\\n\\t\\tstring name; cin >> name;\\n\\t\\tint lb, ub; cin >> lb >> ub;\\n\\t\\trange[name] = {lb, ub};\\n\\t}\\n\\tint n; cin >> n;\\n\\tstack<set<int>> num;\\n\\twhile(n--) {\\n\\t\\tstring e; cin >> e;\\n\\t\\tset<int> st;\\n\\t\\tif(range.count(e)) {\\n\\t\\t\\tfor(int i = range[e].first; i <= range[e].second; ++i) {\\n\\t\\t\\t\\tst.insert(i);\\n\\t\\t\\t}\\n\\t\\t} else if(e == \\\"+\\\" or e == \\\"-\\\" or e == \\\"*\\\" or e == \\\"/\\\") {\\n\\t\\t\\tauto st2 = num.top();\\n\\t\\t\\tnum.pop();\\n\\t\\t\\tauto st1 = num.top();\\n\\t\\t\\tnum.pop();\\n\\t\\t\\tfor(auto lhs : st1) {\\n\\t\\t\\t\\tfor(auto rhs : st2) {\\n\\t\\t\\t\\t\\tif(e == \\\"+\\\") st.insert((lhs + rhs) % 256);\\n\\t\\t\\t\\t\\tif(e == \\\"-\\\") st.insert((lhs - rhs + 256) % 256);\\n\\t\\t\\t\\t\\tif(e == \\\"*\\\") st.insert((lhs * rhs) % 256);\\n\\t\\t\\t\\t\\tif(e == \\\"/\\\") {\\n\\t\\t\\t\\t\\t\\tif(rhs == 0) return false;\\n\\t\\t\\t\\t\\t\\tst.insert((lhs / rhs) % 256);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\tint tmp = 0;\\n\\t\\t\\tfor(char c : e) {\\n\\t\\t\\t\\ttmp *= 10;\\n\\t\\t\\t\\ttmp += c - '0';\\n\\t\\t\\t}\\n\\t\\t\\tst.insert(tmp);\\n\\t\\t}\\n\\t\\tnum.push(st);\\n\\t}\\n\\treturn true;\\n}\\n\\nint main() {\\n\\tcout << (solve() ? \\\"correct\\\" : \\\"error\\\") << \\\"\\\\n\\\";\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.2932,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2435_3588819\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<map>\\n#include<stack>\\nusing namespace std;\\nint n,m;\\nmap<string,int>M;\\nvector<int>a[100];\\nbool flag;\\nint cal(int x,int y,char c)\\n{\\n\\tif(c=='+')return(x+y)%256;\\n\\telse if(c=='-')return(x-y+256)%256;\\n\\telse if(c=='*')return x*y%256;\\n\\telse\\n\\t{\\n\\t\\tif(y)return x/y%256;\\n\\t\\telse return flag=true;\\n\\t}\\n}\\nmain()\\n{\\n\\tcin>>m;\\n\\tfor(int i=0;i<m;i++)\\n\\t{\\n\\t\\tstring s;int L,R;\\n\\t\\tcin>>s>>L>>R;\\n\\t\\tM[s]=i;\\n\\t\\tfor(int j=L;j<=R;j++)a[i].push_back(j);\\n\\t}\\n\\tcin>>n;\\n\\tstack<int>S;\\n\\tfor(;n--;)\\n\\t{\\n\\t\\tstring s;cin>>s;\\n\\t\\tif(s[0]>='0'&&s[0]<='9')\\n\\t\\t{\\n\\t\\t\\tint now=0;\\n\\t\\t\\tfor(int i=0;i<s.size();i++)now=(now*10+s[i]-48)%256;\\n\\t\\t\\tS.push(now);\\n\\t\\t}\\n\\t\\telse if(M.find(s)!=M.end())\\n\\t\\t{\\n\\t\\t\\tS.push(~M[s]);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tint x,y;\\n\\t\\t\\ty=S.top();S.pop();\\n\\t\\t\\tx=S.top();S.pop();\\n\\t\\t\\tif(x>=0&&y>=0)S.push(cal(x,y,s[0]));\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tvector<int>tmp;\\n\\t\\t\\t\\tif(x>=0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int Y:a[~y])tmp.push_back(cal(x,Y,s[0]));\\n\\t\\t\\t\\t\\tsort(tmp.begin(),tmp.end());\\n\\t\\t\\t\\t\\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\\n\\t\\t\\t\\t\\ta[~y]=tmp;\\n\\t\\t\\t\\t\\tS.push(y);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(y>=0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int X:a[~x])tmp.push_back(cal(X,y,s[0]));\\n\\t\\t\\t\\t\\tsort(tmp.begin(),tmp.end());\\n\\t\\t\\t\\t\\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\\n\\t\\t\\t\\t\\ta[~x]=tmp;\\n\\t\\t\\t\\t\\tS.push(x);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int X:a[~x])for(int Y:a[~y])tmp.push_back(cal(X,Y,s[0]));\\n\\t\\t\\t\\t\\tsort(tmp.begin(),tmp.end());\\n\\t\\t\\t\\t\\ttmp.erase(unique(tmp.begin(),tmp.end()),tmp.end());\\n\\t\\t\\t\\t\\ta[~x]=tmp;\\n\\t\\t\\t\\t\\tS.push(x);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<(flag?\\\"error\\\":\\\"correct\\\")<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.4892,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2435_3585594\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <set>\\n#include <stack>\\n\\nusing namespace std;\\n\\nusing lint = long long;\\nusing ldouble = long double;\\n\\nint main() {\\n int M;\\n cin >> M;\\n\\n map<string, set<int>> trans;\\n for (int i = 0; i < M; ++i) {\\n string name;\\n int l, r;\\n cin >> name >> l >> r;\\n for (int a = l; a <= r; ++a) {\\n trans[name].insert(a);\\n }\\n }\\n\\n int N;\\n cin >> N;\\n stack<set<int>> st;\\n for (int i = 0; i < N; ++i) {\\n string S;\\n cin >> S;\\n\\n if (S == \\\"+\\\" || S == \\\"-\\\" || S == \\\"*\\\" || S == \\\"/\\\") {\\n auto s = st.top();\\n st.pop();\\n auto t = st.top();\\n st.pop();\\n\\n st.push(set<int>());\\n for (auto b : s) {\\n for (auto a : t) {\\n if (S == \\\"+\\\") {\\n st.top().insert((a + b) % 256);\\n } else if (S == \\\"-\\\") {\\n st.top().insert((a - b + 256) % 256);\\n } else if (S == \\\"*\\\") {\\n st.top().insert((a * b) % 256);\\n } else if (S == \\\"/\\\") {\\n if (b == 0) {\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n st.top().insert((a / b) % 256);\\n }\\n }\\n }\\n } else if (trans.count(S)) {\\n st.push(trans[S]);\\n } else {\\n st.push(set<int>({stoi(S)}));\\n }\\n }\\n\\n cout << \\\"correct\\\" << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.2374,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2435_3579727\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC target(\\\"tune=native\\\")\\n#pragma GCC target(\\\"avx\\\")\\n// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\nusing namespace std;\\n\\nusing i64 = int64_t;\\n\\nconst i64 MOD = 1e9+7;\\n\\nconst i64 INF = i64(1e18)+MOD;\\n\\ntemplate <typename T = i64>\\nstruct Range{\\n struct iterator{\\n T value;\\n const T step, last;\\n const T& operator*(){return value;}\\n iterator(T value, T step, T last) :\\n value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),\\n step(step),\\n last(last)\\n {\\n }\\n iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}\\n bool operator!=(const iterator& x){return value != x.value;}\\n };\\n const T start, last, step;\\n\\n Range(const T start, const T last, const T step = static_cast<T>(1)) :\\n start(start),\\n last(last),\\n step(step)\\n {\\n }\\n\\n Range(const T last) :\\n start(0),\\n last(last),\\n step(1)\\n {\\n }\\n\\n iterator begin(){return iterator(start, step, last);}\\n iterator end(){return iterator(last, step, last);}\\n};\\n\\ntemplate <typename F>\\nstruct FixPoint{\\n const F _f;\\n FixPoint(F&& f) : _f(forward<F>(f)){}\\n\\n template<typename... Types>\\n decltype(auto) operator()(Types&&... args) const{\\n return _f(*this, forward<Types>(args)...);\\n }\\n};\\n\\ntemplate <typename F>\\nstatic decltype(auto) makeRec(F&& f){\\n return FixPoint<F>(forward<F>(f));\\n}\\n\\ntemplate <typename T, T Value = T()>\\nvector<T> makeVector(size_t x){\\n return vector<T>(x, T(Value));\\n}\\n\\ntemplate <typename T, T Value = T(), typename... Types>\\nauto makeVector(size_t x, Types... args){\\n return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));\\n}\\n\\ntemplate <typename T = i64>\\nbool chmax(T& a, T b){\\n if(a < b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate <typename T = i64>\\nbool chmin(T& a, T b){\\n if(a > b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n#define dump(x) fprintf(stderr, \\\"line =%4d, name =%7s , \\\", __LINE__, #x); clog << \\\"value = \\\" << x << endl;\\n\\n#define vecdump(x) fprintf(stderr, \\\"line =%4d, name =%7s\\\\n\\\", __LINE__, #x); _dump_macro(x);\\n\\nvoid _dump(int, string& x){\\n clog << x << endl;\\n}\\n\\ntemplate <typename T>\\nvoid _dump(bool, T& x){\\n clog << x << \\\" \\\";\\n}\\n\\ntemplate <typename T, typename U = typename T::iterator>\\nvoid _dump(int, T& x){\\n\\n for(auto& elm : x)\\n _dump(0, elm);\\n\\n clog << endl;\\n}\\n\\ntemplate <typename T>\\nvoid _dump_macro(T& x){\\n _dump(0, x);\\n}\\n\\nvoid _input(int, string& x){\\n cin >> x;\\n}\\n\\ntemplate <typename T>\\nvoid _input(bool, T& x){\\n cin >> x;\\n}\\n\\ntemplate <typename T, typename U = typename T::iterator>\\nvoid _input(int, T& x){\\n\\n for(auto& elm : x)\\n _input(0, elm);\\n}\\n\\ntemplate <typename T>\\nvoid input_single(T& x){\\n _input(0, x);\\n}\\n\\nauto input(){}\\n\\ntemplate <typename T, typename... Types>\\nvoid input(T& value, Types&&... args){\\n input_single(value);\\n input(forward<Types>(args)...);\\n};\\n\\nvoid _pararell_input(size_t){}\\n\\ntemplate <typename T, typename... Types>\\nvoid _pararell_input(size_t index, T& value, Types&&... args){\\n input(value[index]);\\n _pararell_input(index, forward<Types>(args)...);\\n}\\n\\ntemplate <typename... Types>\\nvoid pararell_input(size_t count, Types&&... args){\\n for(const auto& i : Range<>(count))\\n _pararell_input(i, forward<Types>(args)...);\\n}\\n\\n\\nbool solve(){\\n\\n int m;\\n input(m);\\n vector<string> c(m);\\n vector<int> l(m), r(m);\\n unordered_map<string, pair<int,int>> ma;\\n pararell_input(m, c, l, r);\\n for(auto& x : r)\\n ++x;\\n for(int i = 0; i < m; ++i)\\n ma[c[i]] = make_pair(l[i], r[i]);\\n int n;\\n input(n);\\n vector<string> v(n);\\n input(v);\\n vector<string> op{\\\"+\\\", \\\"-\\\", \\\"*\\\", \\\"/\\\"};\\n\\n using bs = bitset<256>;\\n stack<bs> st;\\n\\n for(int i = 0; i < n; ++i){\\n if(ma.find(v[i]) != ma.end()){\\n bs s;\\n auto p = ma[v[i]];\\n for(int j = p.first; j < p.second; ++j)\\n s.set(j);\\n st.push(s);\\n }else if(find(op.begin(), op.end(), v[i]) != op.end()){\\n\\n if(st.size() < 2){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n bs b = st.top();\\n st.pop();\\n bs a = st.top();\\n st.pop();\\n\\n bs ans;\\n\\n for(int j = 0; j < 256; ++j)\\n for(int k = 0; k < 256; ++k){\\n if(!a[j] || !b[k])\\n continue;\\n if(v[i] == \\\"+\\\"){\\n int val = (j + k) % 256;\\n ans.set(val);\\n }\\n if(v[i] == \\\"-\\\"){\\n int val = (j - k + 256) % 256;\\n ans.set(val);\\n }\\n if(v[i] == \\\"*\\\"){\\n int val = (j * k) % 256;\\n ans.set(val);\\n }\\n if(v[i] == \\\"/\\\"){\\n if(k == 0){\\n cout << \\\"error\\\" << endl;\\n return 0;\\n }\\n int val = j / k;\\n ans.set(val);\\n }\\n }\\n\\n st.push(ans);\\n\\n }else{\\n int val = stoi(v[i]);\\n bs s;\\n s.set(val);\\n st.push(s);\\n }\\n }\\n\\n if(st.size() == 1)\\n cout << \\\"correct\\\" << endl;\\n else\\n cout << \\\"error\\\" << endl;\\n\\n return false;\\n}\\n\\nsigned main(){\\n\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n\\n while(solve());\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1397,"cells":{"group_id":{"kind":"string","value":"aoj_2434_cpp"},"problem_description":{"kind":"string","value":"問題名 Audition\nアイドル---それは女の子達の永遠の憧れ。しかし、頂点に立てるのはほんの一握り。そんなサバイバルな世界に、あなたはアイドルプロデューサーとして足を踏み入れることになりました。そして、今日はあなたの担当アイドルを連れて大事なオーディションに挑むことになりました。\nオーディションの決め手になるのはビジュアル、ダンス、ボーカルの 3 要素です。オーディション中には\nm\n回のアピールタイムがあり、 1 回のアピールタイムごとに各アイドルはビジュアルアピール、ダンスアピール、ボーカルアピールのいずれかを行うことが出来ます。ビジュアルアピールを行うとそのアイドルのビジュアルポイントは彼女の持ってるビジュアル値だけ、ダンスアピールを行うとダンスポイントは彼女の持ってるダンス値だけ、ボーカルアピールを行うとボーカルポイントは彼女の持ってるボーカル値だけ上昇します。\nm\n回のアピールが終了した後、\nN\n人のアイドルのうちビジュアルポイントの高いほうから 3 人は 5 オーディションポイント、ダンスポイントの高いほうから 3 人は 3 オーディションポイント、ボーカルポイントの高いほうから 3 人は 2 オーディションポイントを獲得します。一方、ビジュアルポイントが最下位だとオーディションポイントは 1 点減点、ダンスポイントが最下位だとオーディションポイントは 1 点減点、ボーカルポイントが最下位だとオーディションポイントは 1 点減点となります。（オーディションポイントが1以下でもそこから 1 点減点）。\nオーディションの始めに、各アイドルのビジュアルポイント、ダンスポイント、ボーカルポイントはそれぞれ 0 です。あなたはアイドル 1 のプロデューサーで、アピールタイムごとにどのアピールを行うか指示することが出来ます。アイドル 1 以外のアイドルはアピールタイムごとにランダムに等確率にどれかのアピールを行います（つまりそれぞれ 3 分の 1 の確率で行われる）。アイドル 1 のビジュアル、ダンス、ボーカルのポイントが他のアイドルと等しい場合、アイドル 1 は常に下位とします。アイドル 1 の獲得するオーディションポイントの期待値が最大になるように指示したときの期待値を求めて下さい。アイドルの運命は、あなたの指示にかかっています！\nちなみに、指示はオーディションが始まる前に全て行って、その後オーディション中の指示の変更は出来ないものとします。つまり、他のアイドルが、オーディションが始まってからのアピールでどのアピールをしかたを見てから、その場合においての期待値が最大となるような指示を出す、ということは出来ないものとします。\nInput\n入力は以下の形で与えられます。\nn\nm\nvi\n1\nda\n1\nvo\n1\nvi\n2\nda\n2\nvo\n2\n...\nvi\nn\nda\nn\nvo\nn\n1行目にはオーディションに出場するアイドルの数\nn\n(\n4 ≤ n ≤ 2000\n) と、このオーディションにおけるアピールタイムの数\nm\n(\n1 ≤ m ≤ 2000\n) が書いてあります。次の\nn\n行にはそれぞれアイドルiのビジュアル値\nvi\ni\n、ダンス値\nda\ni\n、ボーカル値\nvo\ni\n(\n1 ≤ vi\ni\n, da\ni\n, vo\ni\n≤ 10,000\n)が書いてあります。\nOutput\nアイドル 1 の獲得するオーディションポイントの期待値の最大値を 1 行で出力しなさい。\nSample Input 1\n4 1\n1 1 1\n1 1 1\n1 1 1\n1 1 1\nOutput for the Sample Input 1\n2.777777777778\nどのアピールを行っても、そのジャンルで 3 位以内に入れる確率は等しいですが、 3 位以内に入った時に貰えるオーディションポイントが最も多いビジュアルのアピールを行うのがもっとも期待値が良くなります。\nSample Input 2\n4 10\n1 1 1\n10 10 10\n10 10 10\n10 10 10\nOutput for the Sample Input 2\n-2.335340954780\n非常に厳しいオーディションとなるでしょう。\nSample Input 3\n9 9\n13 5 19\n19 21 37\n15 1 7\n7 11 15\n21 23 25\n33 29 19\n13 19 11\n21 5 15\n7 13 1\nOutput for the Sample Input 3\n4.678837855075"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2434_9779526","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(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\nvector<double> P;\n\nvector<double> Solve(int N, int M, int K, int X, vector<int> A) {\n vector<double> Ret(M+1,0.0);\n rep(i,0,M+1) {\n vector<double> DP(3,0.0);\n DP[0] = 1.0;\n double ALLLose = 1.0;\n rep(j,0,N) {\n int LoseNum = ceil(X*i,A[j]);\n double Lose;\n if (LoseNum >= M+1) Lose = 0.0;\n else if (LoseNum < 0) Lose = 1.0;\n else Lose = P[LoseNum];\n double Win = 1.0 - Lose;\n ALLLose *= Lose;\n vector<double> NewDP(3,0.0);\n rep(k,0,3) {\n NewDP[k] += DP[k] * Win;\n }\n rep(k,0,2) {\n NewDP[k+1] += DP[k] * Lose;\n }\n swap(DP,NewDP);\n }\n Ret[i] = (DP[0]+DP[1]+DP[2]) * (double)K - ALLLose;\n }\n return Ret;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n N--;\n P.resize(M+1,0.0);\n P[0] = 1.0;\n rep(i,0,M) {\n vector<double> NP(M+1,0.0);\n rep(j,0,i+1) {\n NP[j] += P[j] * 2.0 / 3.0;\n NP[j+1] += P[j] / 3.0;\n }\n swap(P,NP);\n }\n rrep(i,0,M) P[i] += P[i+1];\n vector<int> X(3);\n vector<vector<int>> A(3,vector<int>(N));\n rep(i,0,3) cin >> X[i];\n rep(i,0,N) rep(j,0,3) cin >> A[j][i];\n vector<vector<double>> D = {Solve(N,M,5,X[0],A[0]),Solve(N,M,3,X[1],A[1]),Solve(N,M,2,X[2],A[2])};\n double ANS = -inf;\n rep(i,0,M+1) {\n rep(j,0,M+1) {\n if (i+j > M) break;\n chmax(ANS, D[0][i] + D[1][j] + D[2][M-i-j]);\n }\n }\n printf(\"%.12f\\n\",ANS);\n}","accuracy":1,"time_ms":270,"memory_kb":3696,"score_of_the_acc":-0.4742,"final_rank":10},{"submission_id":"aoj_2434_8390197","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvector<double> get_expected(int N, int M, int score, const vector<int>& A, const vector<double>& sp) {\n\tvector<double> res(M + 1);\n\tfor (int i = 0; i <= M; i++) {\n\t\tvector<double> win(N);\n\t\t// win condition: A[0] * i > A[j] * x --> x < A[0] * i / A[j] --> x < ceil(A[0] * i / A[j])\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tint b = (A[0] * i + A[j] - 1) / A[j];\n\t\t\tif (b > M + 1) {\n\t\t\t\twin[j] = 1.0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\twin[j] = sp[b];\n\t\t\t}\n\t\t}\n\t\tarray<double, 3> dp = { 1.0, 0.0, 0.0 };\n\t\tdouble worst = 1.0;\n\t\tfor (int j = 1; j < N; j++) {\n\t\t\tarray<double, 3> ndp = { 0.0, 0.0, 0.0 };\n\t\t\tfor (int k = 0; k < 3; k++) {\n\t\t\t\tndp[k] += dp[k] * win[j];\n\t\t\t\tif (k != 2) {\n\t\t\t\t\tndp[k + 1] += dp[k] * (1.0 - win[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tdp = ndp;\n\t\t\tworst *= (1.0 - win[j]);\n\t\t}\n\t\tres[i] = (dp[0] + dp[1] + dp[2]) * score - worst;\n\t}\n\treturn res;\n}\n\ndouble solve(int N, int M, const vector<int>& A, const vector<int>& B, const vector<int>& C) {\n\tvector<vector<double> > p(M + 1);\n\tfor (int i = 0; i <= M; i++) {\n\t\tp[i].resize(i + 1);\n\t}\n\tp[0][0] = 1.0;\n\tfor (int i = 0; i < M; i++) {\n\t\tfor (int j = 0; j <= i; j++) {\n\t\t\tp[i + 1][j] += p[i][j] * 2 / 3;\n\t\t\tp[i + 1][j + 1] += p[i][j] / 3;\n\t\t}\n\t}\n\tvector<double> sp(M + 2);\n\tfor (int i = 0; i <= M; i++) {\n\t\tsp[i + 1] = sp[i] + p[M][i];\n\t}\n\tvector<double> ea = get_expected(N, M, 5, A, sp);\n\tvector<double> eb = get_expected(N, M, 3, B, sp);\n\tvector<double> ec = get_expected(N, M, 2, C, sp);\n\tdouble ans = -1.0e+99;\n\tfor (int i = 0; i <= M; i++) {\n\t\tfor (int j = 0; i + j <= M; j++) {\n\t\t\tint k = M - (i + j);\n\t\t\tdouble subscore = ea[i] + eb[j] + ec[k];\n\t\t\tans = max(ans, subscore);\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> A(N), B(N), C(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> A[i] >> B[i] >> C[i];\n\t}\n\tdouble ans = solve(N, M, A, B, C);\n\tcout.precision(15);\n\tcout << fixed << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":130,"memory_kb":18916,"score_of_the_acc":-0.4401,"final_rank":9},{"submission_id":"aoj_2434_8291292","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint N, A[2009], B[2009], C[2009];\nint M;\ndouble sum[2009][2009];\ndouble dp[2009][4];\ndouble ca[2009], cb[2009], cc[2009];\n\nvoid Initialize() {\n\tsum[0][0] = 1;\n\tfor (int i = 0; i < 2000; i++) {\n\t\tfor (int j = 0; j < 2000; j++) {\n\t\t\tsum[i + 1][j + 0] += (2.0 / 3.0) * sum[i][j];\n\t\t\tsum[i + 1][j + 1] += (1.0 / 3.0) * sum[i][j];\n\t\t}\n\t}\n\tfor (int i = 0; i <= 2000; i++) {\n\t\tfor (int j = 2000; j >= 0; j--) sum[i][j] += sum[i][j + 1];\n\t}\n}\n\npair<double, double> CalcProbability(int Target, vector<int> Points) {\n\t// Worst Probability\n\tdouble prob1 = 1;\n\tfor (int i = 0; i < Points.size(); i++) {\n\t\tint num = min(2001, (Target + Points[i] - 1) / Points[i]);\n\t\tprob1 *= sum[M][num];\n\t}\n\n\t// Best Probability\n\tfor (int i = 0; i <= Points.size(); i++) {\n\t\tfor (int j = 0; j <= 3; j++) dp[i][j] = 0.0;\n\t}\n\tdp[0][0] = 1.0;\n\tfor (int i = 0; i < Points.size(); i++) {\n\t\tfor (int j = 0; j <= 3; j++) {\n\t\t\tint num = min(2001, (Target + Points[i] - 1) / Points[i]);\n\t\t\tdouble prob_ok = sum[M][num];\n\t\t\tdouble prob_ng = 1.0 - prob_ok;\n\t\t\tdp[i + 1][min(3, j + 0)] += dp[i][j] * prob_ng;\n\t\t\tdp[i + 1][min(3, j + 1)] += dp[i][j] * prob_ok;\n\t\t}\n\t}\n\tdouble prob2 = dp[Points.size()][3];\n\n\t// Return\n\treturn make_pair(prob1, 1.0 - prob2);\n}\n\nint main() {\n\t// Step 1. Input\n\tInitialize();\n\tcin >> N >> M;\n\tfor (int i = 1; i <= N; i++) cin >> A[i] >> B[i] >> C[i];\n\n\t// Step 2. Pre Calculation\n\tvector<int> LA, LB, LC;\n\tfor (int i = 2; i <= N; i++) LA.push_back(A[i]);\n\tfor (int i = 2; i <= N; i++) LB.push_back(B[i]);\n\tfor (int i = 2; i <= N; i++) LC.push_back(C[i]);\n\tfor (int i = 0; i <= M; i++) {\n\t\tpair<double, double> v1 = CalcProbability(A[1] * i, LA);\n\t\tpair<double, double> v2 = CalcProbability(B[1] * i, LB);\n\t\tpair<double, double> v3 = CalcProbability(C[1] * i, LC);\n\t\tca[i] = 5.0 * v1.second - 1.0 * v1.first;\n\t\tcb[i] = 3.0 * v2.second - 1.0 * v2.first;\n\t\tcc[i] = 2.0 * v3.second - 1.0 * v3.first;\n\t}\n\n\t// Step 3. Brute Force\n\tdouble Answer = -1e9;\n\tfor (int i = 0; i <= M; i++) {\n\t\tfor (int j = 0; j <= M - i; j++) {\n\t\t\tint k = M - i - j;\n\t\t\tAnswer = max(Answer, ca[i] + cb[j] + cc[k]);\n\t\t}\n\t}\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":35092,"score_of_the_acc":-0.7108,"final_rank":11},{"submission_id":"aoj_2434_6739762","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\nvector<double> solve(const int n,const int m,const vector<double> &p,vector<int> v,int tmp){\n vector<double> res(m+1);\n for(int i=0;i<=m;i++){\n int score = v[0]*i;\n // 最下位の確率\n double bb = 1;\n array<double, 3> dp;\n dp[0] = 1;\n dp[1] = 0;\n dp[2] = 0;\n for(int j=1;j<n;j++){\n array<double, 3> ndp;\n ndp[0] = ndp[1] = ndp[2] = 0;\n double b;\n if(m*v[j] < score){\n b = 0;\n }\n else{\n int u = (score+v[j]-1)/v[j];\n b = p[u];\n }\n bb *= b;\n for(int k=0;k<3;k++){\n if(k+1<3){\n ndp[k+1] += dp[k]*b;\n }\n ndp[k] += dp[k]*(1-b);\n }\n swap(dp,ndp);\n }\n res[i] = -bb+tmp*(dp[0]+dp[1]+dp[2]);\n }\n return res;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m; cin >> n >> m;\n vector<int> v(n),vv(n),vvv(n);\n for(int i=0;i<n;i++){\n cin >> v[i] >> vv[i] >> vvv[i];\n }\n vector<double> p(m+1);\n p[0] = 1.0;\n for(int i=0;i<m;i++){\n vector<double> np(m+1);\n for(int j=0;j<=i;j++){\n np[j+1] += p[j] / 3.0;\n np[j] += p[j] * 2.0 / 3.0;\n }\n swap(p,np);\n }\n for(int i=m;i>0;i--){\n p[i-1] += p[i];\n }\n auto r = solve(n,m,p,v,5);\n auto rr = solve(n,m,p,vv,3);\n auto rrr = solve(n,m,p,vvv,2);\n double res = -1e9;\n for(int i=0;i<=m;i++){\n for(int j=0;i+j<=m;j++){\n res = max(res,r[i]+rr[j]+rrr[m-i-j]);\n }\n }\n printf(\"%.9f\\n\",res);\n}","accuracy":1,"time_ms":40,"memory_kb":3664,"score_of_the_acc":-0.0556,"final_rank":1},{"submission_id":"aoj_2434_6607644","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) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int n, m;\n cin >> n >> m;\n vector<int> pts = {5, 3, 2};\n vector<vector<int>> val(n, vector<int>(3));\n for (auto& v : val) for (auto& x : v) cin >> x;\n vector<vector<double>> diff(3, vector<double>(m+1));\n\n // probability of appealing i times\n vector<double> prob(m+1);\n rep(j,0,m+1) {\n // prob[j] = pow(2.0/3, m);\n prob[j] = 1;\n rep(i,0,j) {\n prob[j] *= 1.0*(m-i)/(i+1)/3;\n }\n rep(i,0,m-j) prob[j] *= 2.0/3;\n }\n vector<double> cum(m+2);\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\n\n rep(k,0,3) {\n rep(j,0,m+1) {\n vector<double> p(n);\n rep(i,1,n) {\n // probability of the idol i beating the idol 0\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\n // appeal k, >= c times\n if (c <= m) p[i] = 1.0 - cum[c];\n }\n vector<double> q(3);\n q[0] = 1;\n double alllose = 1;\n rep(i,1,n) {\n alllose *= p[i];\n vector<double> nq(3);\n rep(l,0,3) {\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\n nq[l] += q[l] * (1-p[i]);\n }\n q.swap(nq);\n }\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\n }\n }\n\n double ans = -1e18;\n rep(x,0,m+1) rep(y,0,m+1-x) {\n int z = m - (x + y);\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":180,"memory_kb":3780,"score_of_the_acc":-0.3118,"final_rank":6},{"submission_id":"aoj_2434_6607632","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) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int n, m;\n cin >> n >> m;\n vector<int> pts = {5, 3, 2};\n vector<vector<int>> val(n, vector<int>(3));\n for (auto& v : val) for (auto& x : v) cin >> x;\n vector<vector<double>> diff(3, vector<double>(m+1));\n\n // probability of appealing i times\n vector<double> prob(m+1);\n rep(j,0,m+1) {\n prob[j] = pow(2.0/3, m);\n rep(i,0,j) {\n prob[j] *= 0.5*(m-i)/(i+1);\n }\n }\n vector<double> cum(m+2);\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\n\n rep(k,0,3) {\n rep(j,0,m+1) {\n vector<double> p(n);\n rep(i,1,n) {\n // probability of the idol i beating the idol 0\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\n // appeal k, >= c times\n if (c <= m) p[i] = cum[m+1] - cum[c];\n }\n vector<double> q(3);\n q[0] = 1;\n double alllose = 1;\n rep(i,1,n) {\n alllose *= p[i];\n vector<double> nq(3);\n rep(l,0,3) {\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\n nq[l] += q[l] * (1-p[i]);\n }\n q.swap(nq);\n }\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\n }\n }\n\n double ans = -1e18;\n rep(x,0,m+1) rep(y,0,m+1-x) {\n int z = m - (x + y);\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\n }\n cout << ans << endl;\n}","accuracy":0.5789473684210527,"time_ms":130,"memory_kb":4056,"score_of_the_acc":-0.2249,"final_rank":17},{"submission_id":"aoj_2434_6607625","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) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int n, m;\n cin >> n >> m;\n vector<int> pts = {5, 3, 2};\n vector<vector<int>> val(n, vector<int>(3));\n for (auto& v : val) for (auto& x : v) cin >> x;\n vector<vector<double>> diff(3, vector<double>(m+1));\n\n // probability of appealing i times\n vector<double> prob(m+1);\n rep(j,0,m+1) {\n double num = pow(2, m-j), den = pow(3, m);\n rep(i,0,j) {\n num *= (m-i);\n den *= i+1;\n }\n prob[j] = num/den;\n }\n vector<double> cum(m+2);\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\n\n rep(k,0,3) {\n rep(j,0,m+1) {\n vector<double> p(n);\n rep(i,1,n) {\n // probability of the idol i beating the idol 0\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\n // appeal k, >= c times\n if (c <= m) p[i] = cum[m+1] - cum[c];\n }\n vector<double> q(3);\n q[0] = 1;\n double alllose = 1;\n rep(i,1,n) {\n alllose *= p[i];\n vector<double> nq(3);\n rep(l,0,3) {\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\n nq[l] += q[l] * (1-p[i]);\n }\n q.swap(nq);\n }\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\n }\n }\n\n double ans = -1e18;\n rep(x,0,m+1) rep(y,0,m+1-x) {\n int z = m - (x + y);\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\n }\n cout << ans << endl;\n}","accuracy":0.47368421052631576,"time_ms":20,"memory_kb":4004,"score_of_the_acc":-0.0241,"final_rank":19},{"submission_id":"aoj_2434_6367668","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2022.03.01 23:02:29 */\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\ndouble solve(int n) {\n\tint m;\n\tcin >> m;\n\tconst int r = 3;\n\tVVEC(int, scores, n, r);\n\tconst vector<int> pts = {5, 3, 2};\n\n\tvector<vector<int>> transpose(r, vi(n));\n\trep(i, r) rep(j, n) transpose[i][j] = scores[j][i];\n\n\tconst double trip = 1. / 3;\n\n\tvector<double> dp(m + 1, 0.);\n\tdp.front() = 1;\n\trep(i, m) {\n\t\tauto pre = dp;\n\t\tdp.assign(m + 1, 0.);\n\t\trep(j, i + 1) {\n\t\t\tdp[j] += (1 - trip) * pre[j];\n\t\t\tdp[j + 1] += (trip)*pre[j];\n\t\t}\n\t}\n\n\tvector<double> acc(m + 2);\n\trep(i, m + 1) acc[i + 1] = acc[i] + dp[i];\n\n\tauto last_prob = [&](int score, vi &ab) {\n\t\tconst int n = ab.size();\n\t\tdouble ret = 1;\n\t\trep(i, 1, n) {\n\t\t\tint value = ab[i];\n\t\t\tint need = dup(score, value);\n\t\t\tchmin(need, m + 1);\n\t\t\tret *= (1 - acc[need]);\n\t\t}\n\t\treturn ret;\n\t};\n\n\tauto bestthree_prob = [&](int score, vi &ab) {\n\t\tconst int len = ab.size();\n\t\tvector<double> ret(3);\n\t\tret.front() = 1;\n\t\trep(i, 1, len) {\n\t\t\tconst int value = ab[i];\n\t\t\tint need = dup(score, value);\n\t\t\tchmin(need, m + 1);\n\t\t\tdouble under = acc[need];\n\t\t\tauto pre = ret;\n\t\t\tret.assign(r, 0);\n\t\t\trep(j, r) {\n\t\t\t\tret[j] += under * pre[j];\n\t\t\t\tif(j < r - 1) ret[j + 1] += (1 - under) * pre[j];\n\t\t\t}\n\t\t}\n\t\tdouble value = accumulate(all(ret), double(0));\n\t\treturn value;\n\t};\n\n\tvector<V<double>> pre_calced(r, V<double>(m+1));\n\n\n\n\tauto f = [&](int score, vi &abilities, int mult) {\n\t\tconst int n = abilities.size();\n\t\tdouble ret = 0;\n\t\tret += bestthree_prob(score, abilities) * mult;\n\t\tret -= last_prob(score, abilities) * 1;\n\t\treturn ret;\n\t};\n\n\trep(i,r ){\n\t\trep(cnt, 0, m+1){\n\t\t\tpre_calced[i][cnt] = f(cnt *scores.front().at(i), transpose[i], pts[i]);\n\t\t}\n\t}\n\n\tauto calc_score = [&](vector<int> &count) -> double {\n\t\tdouble ret = 0;\n\t\t// rep(i, r) {\n\t\t// \tint sc = count[i] * scores.front().at(i);\n\t\t// \tret += f(sc, transpose[i], pts[i]);\n\t\t// }\n\t\trep(i,r ){\n\t\t\tint cnt = count[i];\n\t\t\tret += pre_calced[i][cnt];\n\t\t}\n\t\treturn ret;\n\t};\n\n\tdouble ans = -INF;\n\tvector<int> count(r);\n\tfor(count[0] = 0; count[0] <= m; count[0]++) {\n\t\tfor(count[1] = 0; count[1] + count[0] <= m; count[1]++) {\n\t\t\tcount[2] = m - count[0] - count[1];\n\t\t\tchmax(ans, calc_score(count));\n\t\t}\n\t}\n\treturn ans;\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 n;\n\twhile(cin >> n) {\n\t\tcout << solve(n) << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":3768,"score_of_the_acc":-0.4389,"final_rank":8},{"submission_id":"aoj_2434_6027754","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\nvector<long double> sub(int n, int m, const vector<long double> &ap,\n const vector<int> &a, int point) {\n auto dp = vect(m + 1, (long double)0.0);\n for (int i = 0; i <= m; i++) {\n int x = a[0] * i;\n long double bottom = 1.0;\n\n vector<int> needed(n);\n for (int j = 1; j < n; j++) {\n needed[j] = min(m + 1, (x + a[j] - 1) / a[j]);\n bottom *= ap[needed[j]];\n }\n\n auto ep = vect(n + 1, vect(3, (long double)0.0));\n ep[1][0] = 1.0;\n for (int j = 1; j < n; j++) {\n for (int k = 0; k < 3; k++) {\n ep[j + 1][k] += ep[j][k] * (1.0 - ap[needed[j]]);\n if (k + 1 < 3) ep[j + 1][k + 1] += ep[j][k] * ap[needed[j]];\n }\n }\n dp[i] = (ep[n][0] + ep[n][1] + ep[n][2]) * point - bottom;\n }\n return dp;\n}\n\nvoid solve() {\n int n, m;\n cin >> n >> m;\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 auto ap = vect(m + 2, (long double)0.0);\n ap[0] = 1.0;\n for (int i = 0; i < m; i++) ap[0] *= 2.0 / 3.0;\n for (int i = 1; i <= m; i++) { ap[i] = ap[i - 1] / 2.0 * (m - i + 1) / i; }\n for (int i = m - 1; i >= 0; i--) ap[i] += ap[i + 1];\n\n auto dp = sub(n, m, ap, a, 5);\n auto ep = sub(n, m, ap, b, 3);\n auto fp = sub(n, m, ap, c, 2);\n dmp(dp);\n\n auto gp = vect(m + 1, (long double)-10.0);\n for (int i = 0; i <= m; i++) {\n for (int j = 0; j <= m; j++) {\n if (i + j > m) break;\n chmax(gp[i + j], dp[i] + ep[j]);\n }\n }\n\n long double ans = -10.0;\n for (int i = 0; i <= m; i++) { chmax(ans, gp[i] + fp[m - i]); }\n\n cout << ans << endl;\n\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":500,"memory_kb":3816,"score_of_the_acc":-0.8942,"final_rank":12},{"submission_id":"aoj_2434_6007883","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing PII = pair<ll, ll>;\nusing T = tuple<int, int, int>;\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#define ALL(x) x.begin(), x.end()\n#define POPCOUNT(x) __builtin_popcount(x)\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nconst ll INF = 1LL << 60;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nconst ull MOD = 1e9 + 7;\n\n// BEGIN CUT\nll modpow(ll x, ll y, ll m) {\n ll a = 1, p = x;\n while (y > 0) {\n if (y % 2 == 0) {\n p = (p * p) % m;\n y /= 2;\n } else {\n a = (a * p) % m;\n y--;\n }\n }\n return a;\n}\n// END CUT\n\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nint vi[2000], da[2000], vo[2000];\ndouble res_vi[2001], res_da[2001], res_vo[2001];\ndouble prob[2001];\ndouble dp[2001][2];\ndouble lose[2001];\n\nvoid calc(int n, int m, int *idol, double *result, int wp) {\n for (int i = 0; i <= m; i++) {\n int V = idol[0] * i;\n vector<double> vec(n);\n for (int j = 1; j < n; j++) {\n int k = (V + idol[j] - 1) / idol[j];\n double win = 0;\n if (k <= m)\n win = prob[k];\n vec[j] = win;\n }\n dp[0][0] = 1, dp[0][1] = 0;\n for (int j = 1; j < n; j++) {\n dp[j][0] = dp[j - 1][0] * (1 - vec[j]);\n dp[j][1] = dp[j - 1][0] * vec[j] + dp[j - 1][1] * (1 - vec[j]);\n }\n lose[n] = 1;\n for (int j = n - 1; j >= 1; j--) {\n lose[j] = lose[j + 1] * (1 - vec[j]);\n }\n double p = dp[n - 1][0] + dp[n - 1][1];\n for (int j = 1; j < n; j++) {\n p += vec[j] * dp[j - 1][1] * lose[j + 1];\n }\n result[i] = p * wp;\n double q = 1;\n for (int j = 1; j < n; j++)\n q *= vec[j];\n result[i] -= q;\n }\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n for (int i = 0; i < n; i++)\n cin >> vi[i] >> da[i] >> vo[i];\n\n prob[0] = 1;\n for (int i = 1; i <= m; i++) {\n prob[i] = prob[i - 1] * (m - i + 1) / i;\n prob[i] /= 3;\n }\n double tmp = 1;\n for (int i = m; i >= 0; i--) {\n prob[i] *= tmp;\n tmp *= 2.0 / 3.0;\n }\n for (int i = m - 1; i >= 0; i--)\n prob[i] += prob[i + 1];\n calc(n, m, vi, res_vi, 5);\n calc(n, m, da, res_da, 3);\n calc(n, m, vo, res_vo, 2);\n double ans = -1e9;\n for (int i = 0; i <= m; i++) {\n for (int j = 0; i + j <= m; j++) {\n double sum = res_vi[i] + res_da[j] + res_vo[m - (i + j)];\n ans = max(ans, sum);\n }\n }\n cout << fixed << setprecision(15) << ans << '\\n';\n}","accuracy":1,"time_ms":120,"memory_kb":3732,"score_of_the_acc":-0.202,"final_rank":3},{"submission_id":"aoj_2434_5968671","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 MOD = 1000000007;\n//constexpr long long MOD = 998244353;\nconstexpr double EPS = 1e-6;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N >> M;\n\tvector<vector<int>>v(N, vector<int>(3));\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < 3; j++) {\n\t\t\tcin >> v[i][j];\n\t\t}\n\t}\n\tvector<vector<long double>>p(M + 1, vector<long double>(M + 1));\n\tp[0][0] = 1;\n\tfor (int i = 0; i < M; i++) {\n\t\tfor (int j = 0; j <= i; j++) {\n\t\t\tp[i + 1][j + 1] += p[i][j] / 3;\n\t\t\tp[i + 1][j] += p[i][j] * 2 / 3;\n\t\t}\n\t}\n\tfor (int i = 1; i <= M; i++) {\n\t\tfor (int j = M - 1; j >= 0; j--) {\n\t\t\tp[i][j] += p[i][j + 1];\n\t\t}\n\t}\n\tint by[] = { 5,3,2 };\n\tvector<long double>dp(M + 1);\n\tfor (int i = 0; i < 3; i++) {\n\t\tvector<long double>box(M + 1);\n\t\tbox[0] = -1;\n\t\tfor (int j = 1; j <= M; j++) {\n\t\t\tlong double worst = 1;\n\t\t\tvector<long double>rank(3);\n\t\t\trank[0] = 1;\n\t\t\tfor (int k = 1; k < N; k++) {\n\t\t\t\tint num = j * v[0][i];\n\t\t\t\tnum = (num + v[k][i] - 1) / v[k][i];\n\t\t\t\tlong double q = 0;\n\t\t\t\tif (num > M) {\n\t\t\t\t\tq = 0;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tq = p[M][num];\n\t\t\t\t}\n\t\t\t\tworst *= q;\n\t\t\t\trank[2] = rank[2] * (1 - q) + rank[1] * q;\n\t\t\t\trank[1] = rank[1] * (1 - q) + rank[0] * q;\n\t\t\t\trank[0] *= 1 - q;\n\t\t\t//\tcout << i << \" \" << j << \" \" << k << \" \" << worst << \" \" << num << endl;\n\t\t\t}\n\t\t\tbox[j] -= worst;\n\t\t\tbox[j] += (rank[0] + rank[1] + rank[2]) * by[i];\n\t\t}\n\t\tvector<long double>nxdp(M + 1,-5);\n\t\tfor (int j = 0; j <= M; j++) {\n\t\t\tfor (int k = 0; k + j <= M; k++) {\n\t\t\t\tnxdp[j + k] = max(nxdp[j + k], dp[j] + box[k]);\n\t\t\t}\n\t\t}\n\t\tdp = nxdp;\n\t}\n\tcout << fixed << setprecision(20) << dp.back() << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":66260,"score_of_the_acc":-1.1623,"final_rank":14},{"submission_id":"aoj_2434_5949350","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()\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-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n 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;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nint main(){\n int n,m; cin >> n >> m;\n vvl a(n,vl(3));\n rep(i,n) rep(j,3) cin >> a[i][j];\n vl bonus{5,3,2};\n vector<vd> res(m+1,vd(3,0));\n vd prob(m+2,0);\n prob[0] = 1;\n rep(i,m){\n vd np(m+2,0);\n rep(j,m+1){\n np[j+1] += prob[j] / 3;\n np[j] += prob[j] * 2 / 3;\n }\n swap(prob,np);\n }\n for(int i=m-1; i>=0; i--) prob[i] += prob[i+1];\n rep(i,m+1) rep(j,3){\n vector<vd> dp(2,vd(4,0));\n dp[0][0] = 1;\n double all_lose = 1;\n REP(k,1,n){\n rep(l,4) dp[1][l] = 0;\n int t = (a[0][j]*i+a[k][j]-1) / a[k][j];\n double p = t<=m ? prob[t] : 0;\n chmin(p,1);\n rep(l,4){\n dp[1][l] += dp[0][l] * (1-p);\n dp[1][min(3,l+1)] += dp[0][l] * p;\n }\n all_lose *= p;\n swap(dp[0],dp[1]);\n }\n res[i][j] = (dp[0][0]+dp[0][1]+dp[0][2]) * bonus[j] - all_lose;\n }\n double ans = -inf;\n rep(i,m+1) rep(j,m+1){\n if(i+j>m) break;\n int k = m-i-j;\n chmax(ans, res[i][0] + res[j][1] + res[k][2]);\n }\n printf(\"%.10f\\n\",ans);\n}","accuracy":1,"time_ms":160,"memory_kb":3788,"score_of_the_acc":-0.2756,"final_rank":5},{"submission_id":"aoj_2434_5892631","code_snippet":"#include<bits/stdc++.h>\n#define ALL(A) A.begin(),A.end()\nusing namespace std;\nnamespace BIN101{\nusing ll=long long int;\n//using Int=__int128;\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;}\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\n//→ ↓ ← ↑ \n//int dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\n//右上から時計回り\nint dx[8]={1,1,0,-1,-1,-1,0,+1}, dy[8]={0,1,1,1,0,-1,-1,-1};\nlong double EPS = 1e-6;\nlong double PI = acos(-1);\nconst ll INF=numeric_limits<ll>::max()/3;\nconst int MAX=numeric_limits<int>::max()/3;\nconstexpr ll MOD=1000000000+7;\n//constexpr ll MOD=998244353;\nvector<ll> ten(18+1);\n\n\ninline void bin101(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n ten[0]=1;\n for(int i=1;i<=18;i++) ten[i]=ten[i-1]*10;\n}\n\nusing pii=pair<int,int>;\nusing pil=pair<int,ll>;\nusing pli=pair<ll,int>;\nusing pll=pair<ll,ll>;\nusing psi=pair<string,int>;\nusing pis=pair<int,string>;\nusing psl=pair<string,ll>;\nusing pls=pair<ll,string>;\nusing pss=pair<string,string>;\n\nusing Graph=vector<vector<int>>;\n\ntemplate<typename T >\nstruct edge {\n\tint to;\n\tT cost;\n\tedge()=default;\n\tedge(int to, T cost) : to(to), cost(cost) {}\n\n};\ntemplate<typename T>\nusing WeightGraph=vector<vector<edge<T>>>;\n\ntemplate<typename T>\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n T cost;\n cin>>s>>t>>cost;\n if(index1) s--,t--;\n g[s].emplace_back(t,cost);\n if(not directed) g[t].emplace_back(s,cost);\n }\n}\n\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n cin>>s>>t;\n if(index1) s--,t--;\n g[s].push_back(t);\n if(not directed) g[t].push_back(s);\n }\n}\n\n\n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<T> &v) {\n for(size_t i=0;i<v.size();i++) is>>v[i];\n\treturn is;\n}\n \n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n is>>v[i];\n }\n return is;\n}\n//vector cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\n for(size_t i=0;i<v.size();i++){\n if(i) os<<\" \";\n os<<v[i];\n }\n return os;\n}\n//vector<vector> cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n os<<v[i];\n if(i+1!=v.size()) os<<\"\\n\";\n }\n return os;\n}\n\n//Graph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const Graph &g) {\n for(size_t i=0;i<g.size();i++){\n for(int to:g[i]){\n os<<i<<\"->\"<<to<<\" \";\n }\n os<<endl;\n }\n return os;\n}\n\n//WeightGraph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\n for(size_t i=0;i<g.size();i++){\n for(auto e:g[i]){\n os<<i<<\"->\"<<e.to<<\"(\"<<e.cost<<\") \";\n }\n os<<endl;\n }\n return os;\n}\n\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n\treturn vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n\tauto v=vmake(args...);\n\treturn vector<decltype(v)>(n,move(v));\n}\n\n//pair cout\ntemplate<typename T, typename U>\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\n\tos<<p.first<<\" \"<<p.second;\n\treturn os;\n}\n \n//pair cin\ntemplate<typename T, typename U>\ninline istream &operator>>(istream &is,pair<T,U> &p) {\n\tis>>p.first>>p.second;\n\treturn is;\n}\n \n//ソート\ntemplate<typename T>\ninline void vsort(vector<T> &v){\n sort(v.begin(),v.end());\n}\n \n//逆順ソート\ntemplate<typename T>\ninline void rvsort(vector<T> &v){\n\tsort(v.rbegin(),v.rend());\n}\n\n//1ビットの数を返す\ninline int popcount(int x){\n\treturn __builtin_popcount(x);\n}\n//1ビットの数を返す\ninline int popcount(ll x){\n\treturn __builtin_popcountll(x);\n}\ntemplate<typename T>\ninline void Compress(vector<T> &C){\n sort(C.begin(),C.end());\n C.erase(unique(C.begin(),C.end()),C.end());\n}\ntemplate<typename T>\ninline int lower_idx(const vector<T> &C,T value){\n return lower_bound(C.begin(),C.end(),value)-C.begin();\n}\ntemplate<typename T>\ninline int upper_idx(const vector<T> &C,T value){\n return upper_bound(C.begin(),C.end(),value)-C.begin();\n}\n//時計回りに90度回転\ntemplate<typename T>\ninline void rotate90(vector<vector<T>> &C){\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\n for(int h=0;h<C.size();h++){\n for(int w=0;w<C[h].size();w++){\n D[w][C.size()-1-h]=C[h][w];\n }\n }\n C=D;\n}\n//補グラフを返す\n//i→iのような辺は加えない\nGraph ComplementGraph(const Graph &g){\n size_t sz=g.size();\n bool used[sz][sz];\n fill(used[0],used[sz],false);\n for(size_t i=0;i<sz;i++){\n for(int to:g[i]){\n used[i][to]=true;\n }\n }\n Graph ret(sz);\n for(size_t i=0;i<sz;i++){\n for(size_t j=0;j<sz;j++){\n if(used[i][j]) continue;\n if(i==j) continue;\n ret[i].push_back(j);\n }\n }\n return ret;\n}\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\n//無効グラフのみに対応\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\n vector<Graph> ret;\n vector<int> now;\n for(size_t i=0;i<g.size();i++){\n if(id[i].first!=-1) continue;\n id[i].first=ret.size();\n id[i].second=0;\n now.push_back(i);\n for(size_t j=0;j<now.size();j++){\n for(int to:g[now[j]]){\n if(id[to].first==-1){\n id[to].first=ret.size();\n id[to].second=now.size();\n now.push_back(to);\n }\n }\n }\n Graph r(now.size());\n for(size_t j=0;j<now.size();j++){\n r[j]=g[now[j]];\n for(int &to:r[j]){\n to=id[to].second;\n }\n }\n ret.push_back(r);\n now.clear();\n }\n return make_pair(ret,id);\n}\n//0indexを想定\nbool OutGrid(ll h,ll w,ll H,ll W){\n return (h>=H or w>=W or h<0 or w<0);\n}\n\nvoid NO(){\n cout<<\"NO\"<<\"\\n\";\n}\nvoid YES(){\n cout<<\"YES\"<<\"\\n\";\n}\nvoid No(){\n cout<<\"No\"<<\"\\n\";\n}\nvoid Yes(){\n cout<<\"Yes\"<<\"\\n\";\n}\nnamespace overflow{\n template<typename T>\n T max(){\n return numeric_limits<T>::max();\n }\n template<typename T>\n T ADD(T a,T b){\n T res;\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\n }\n template<typename T>\n T MUL(T a,T b){\n T res;\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\n }\n};\nusing namespace overflow;\nstruct ModInt{\n using u64=uint_fast64_t;\n u64 a;\n constexpr ModInt() :a(0){}\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\n\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\n return ModInt(*this)+=rhs;\n }\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\n return ModInt(*this)-=rhs;\n }\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\n return ModInt(*this)*=rhs;\n }\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\n return ModInt(*this)/=rhs;\n }\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\n return ModInt(*this)+=ModInt(rhs);\n }\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\n return ModInt(*this)-=ModInt(rhs);\n }\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\n return ModInt(*this)*=ModInt(rhs);\n }\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\n return ModInt(*this)/=ModInt(rhs);\n }\n\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\n a+=rhs.a;\n if(a>=MOD) a-=MOD;\n return *this;\n }\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\n if(rhs.a>a) a+=MOD;\n a-=rhs.a;\n return *this;\n }\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\n a=(a*rhs.a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\n a=(a*rhs.inverse().a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\n return *this+=ModInt(rhs);\n }\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\n return *this-=ModInt(rhs);\n }\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\n return *this*=ModInt(rhs);\n }\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\n return *this/=ModInt(rhs);\n }\n\n inline constexpr ModInt operator=(const ll x)noexcept{\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\n return *this;\n }\n\n inline constexpr bool operator==(const ModInt p)const noexcept{\n return a==p.a;\n }\n\n inline constexpr bool operator!=(const ModInt p)const noexcept{\n return a!=p.a;\n }\n\n inline constexpr ModInt pow(ll N) const noexcept{\n ModInt ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline constexpr ModInt inverse() const noexcept{\n return pow(MOD-2);\n }\n\n};\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)+=b;\n}\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)-=b;\n}\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)*=b;\n}\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const ModInt &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,ModInt &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\n\nstruct Binominal{\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\n int sz;\n Binominal(int n=10) :sz(1){\n if(n<=0) n=10;\n init(n);\n }\n inline void init(int n){\n fac.resize(n+1,1);\n finv.resize(n+1,1);\n inv.resize(n+1,1);\n for(int i=sz+1;i<=n;i++){\n fac[i]=fac[i-1]*i;\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\n finv[i]=finv[i-1]*inv[i];\n }\n sz=n;\n }\n //nCk(n,k<=N) をO(1)で求める\n inline ModInt com(int n,int k){\n if(k==0 or k==n) return 1;\n if(n<k) return ModInt(0);\n if(n<0 || k<0) return ModInt(0);\n if(n>sz) init(n);\n return fac[n]*finv[k]*finv[n-k];\n }\n //nCk(k<=N) をO(k) で求める \n inline ModInt rcom(ll n,int k){\n if(n<0 || k<0 || n<k) return ModInt(0);\n if(k>sz) init(k);\n ModInt ret(1);\n for(int i=0;i<k;i++){\n ret*=n-i;\n }\n ret*=finv[k];\n return ret;\n }\n\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\n //〇がn個,|がk個\n inline ModInt h(int n,int k){\n return com(n+k-1,k);\n }\n //power[N+1] (power[i]=x^i)を返す\n static vector<ModInt> MakePower(ll x,int N){\n vector<ModInt> ret(N+1);\n ret[0]=1;\n for(int i=1;i<=N;i++){\n ret[i]=ret[i-1]*x;\n }\n return ret;\n }\n};\nvector<int> Subset(int S,bool zero=false,bool full=false){\n vector<int> ret;\n int now=(S-1)&S;\n if(full and S){\n ret.push_back(S);\n }\n do{\n ret.push_back(now);\n now=(now-1)&S;\n }while(now!=0);\n if(zero){\n ret.push_back(0);\n }\n return ret;\n}\n\n//xと差が最小の値を持つ添え字を返す\n//xはソート済みを想定\n//1つだけ返す\ntemplate<typename T>\ninline int MinimumAbs(vector<T> &v,T x){\n assert(v.size());\n auto large=lower_bound(v.begin(),v.end(),x);\n auto small=large;\n if(large==v.begin()) return large-v.begin();\n if(large==v.end()) return v.size()-1;\n small--;\n if(abs(*small-x)>abs(*large-x)) small=large;\n return small-v.begin();\n}\n\n\nclass modint{\n using u64=uint_fast64_t;\n static u64 &mod(){\n static u64 mod_=0;\n return mod_;\n }\npublic:\n u64 a;\n modint(const ll x=0):a((x>=0)?(x%mod()):(x%mod()+mod())){}\n modint operator+(const modint rhs)const{\n return modint(*this)+=rhs;\n }\n modint operator-(const modint rhs)const{\n return modint(*this)-=rhs;\n }\n modint operator*(const modint rhs)const{\n return modint(*this)*=rhs;\n }\n modint operator/(const modint rhs)const{\n return modint(*this)/=rhs;\n }\n modint &operator+=(const modint rhs){\n a+=rhs.a;\n if(a>=mod()) a-=mod();\n return *this;\n }\n modint &operator-=(const modint rhs){\n if(a<rhs.a) a+=mod();\n a-=rhs.a;\n return *this;\n }\n modint &operator*=(const modint rhs){\n a=a*rhs.a%mod();\n return *this;\n }\n modint &operator/=(const modint rhs){\n a=(a*rhs.inverse().a)%mod();\n return *this;\n }\n inline modint &operator+=(const ll rhs){\n return *this+=modint(rhs);\n }\n inline modint &operator-=(const ll rhs){\n return *this-=modint(rhs);\n }\n inline modint &operator*=(const ll rhs){\n return *this*=modint(rhs);\n }\n inline modint &operator/=(const ll rhs){\n return *this/=modint(rhs);\n }\n\n inline modint pow(u64 N)const{\n modint ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline modint inverse()const{\n return pow(mod()-2);\n }\n inline modint operator=(const ll x){\n a=(x>=0)?(x%mod()):(x%mod()+mod());\n return *this;\n }\n\n static void set_mod(const u64 x){mod()=x;}\n static u64 get_mod(){return mod();}\n};\ninline modint operator+(const ll a,const modint b)noexcept{\n return modint(a)+=b;\n}\ninline modint operator-(const ll a,const modint b)noexcept{\n return modint(a)-=b;\n}\ninline modint operator*(const ll a,const modint b)noexcept{\n return modint(a)*=b;\n}\ninline modint operator/(const ll &a,const modint &b)noexcept{\n return modint(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const modint &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,modint &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\ntemplate<class T>\nvector<vector<T>> Binominal(int n){\n vector<vector<T>> table(n+1,vector<T>(n+1,0));\n table[0][0]=1;\n for(int i=1;i<=n;i++){\n table[i][0]=1;\n for(int j=1;j<=i;j++){\n table[i][j]=table[i-1][j-1]+table[i-1][j];\n }\n }\n return table;\n};\n\nvoid solve(){\n int N,M;\n cin>>N>>M;\n auto power=vmake(N,3,0);\n for(int i=0;i<N;i++){\n for(int j=0;j<3;j++) cin>>power[i][j];\n }\n using DD=long double;\n vector<DD> prob(M+100);\n auto B=Binominal<DD>(M+100);\n DD zen=0;\n for(int a=0;a<=M;a++){\n for(int b=0;b<=M;b++){\n if(a+b>M) continue;\n zen+=B[M][a]*B[M-a][b];\n }\n }\n for(int i=M;i>=0;i--){\n if(i!=M) prob[i]=prob[i+1];\n for(int j=0;j+i<=M;j++){\n prob[i]+=B[M][i]*B[M-i][j]/zen;\n }\n }\n auto point=vmake(3,M+1,(DD)0);\n for(int i=0;i<3;i++){\n for(int m=0;m<=M;m++){\n DD sai=1.0;\n auto dp=vmake(3,(DD)0);\n dp[0]=1;\n int p=power[0][i]*m;\n for(int k=1;k<N;k++){\n //負ける確率を求める\n int tp=power[k][i];\n int cnt=(p+tp-1)/tp;\n DD pb=0;\n if(cnt<=M) pb=prob[cnt];\n sai*=pb;\n for(int j=2;j>=0;j--){\n if(j<=1) dp[j+1]+=dp[j]*pb;\n dp[j]=dp[j]*(1-pb);\n }\n }\n DD ret=0;\n ret+=sai*(-1);\n DD x=5;\n if(i==1) x=3;\n else if(i==2) x=2;\n ret+=x*(dp[0]+dp[1]+dp[2]);\n point[i][m]=ret;\n }\n }\n DD ans=-MAX;\n for(int a=0;a<=M;a++){\n for(int b=0;b<=M;b++){\n if(a+b>M) continue;\n chmax(ans,point[0][a]+point[1][b]+point[2][M-a-b]);\n }\n }\n cout<<ans<<endl;\n}\n\n};\n\nint main(){\n BIN101::bin101();\n int T=1;\n //cin>>T;\n while(T--) BIN101::solve();\n}","accuracy":1,"time_ms":200,"memory_kb":72632,"score_of_the_acc":-1.3455,"final_rank":16},{"submission_id":"aoj_2434_5892622","code_snippet":"#include<bits/stdc++.h>\n#define ALL(A) A.begin(),A.end()\nusing namespace std;\nnamespace BIN101{\nusing ll=long long int;\n//using Int=__int128;\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;}\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\n//→ ↓ ← ↑ \n//int dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\n//右上から時計回り\nint dx[8]={1,1,0,-1,-1,-1,0,+1}, dy[8]={0,1,1,1,0,-1,-1,-1};\nlong double EPS = 1e-6;\nlong double PI = acos(-1);\nconst ll INF=numeric_limits<ll>::max()/3;\nconst int MAX=numeric_limits<int>::max()/3;\nconstexpr ll MOD=1000000000+7;\n//constexpr ll MOD=998244353;\nvector<ll> ten(18+1);\n\n\ninline void bin101(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(20);\n ten[0]=1;\n for(int i=1;i<=18;i++) ten[i]=ten[i-1]*10;\n}\n\nusing pii=pair<int,int>;\nusing pil=pair<int,ll>;\nusing pli=pair<ll,int>;\nusing pll=pair<ll,ll>;\nusing psi=pair<string,int>;\nusing pis=pair<int,string>;\nusing psl=pair<string,ll>;\nusing pls=pair<ll,string>;\nusing pss=pair<string,string>;\n\nusing Graph=vector<vector<int>>;\n\ntemplate<typename T >\nstruct edge {\n\tint to;\n\tT cost;\n\tedge()=default;\n\tedge(int to, T cost) : to(to), cost(cost) {}\n\n};\ntemplate<typename T>\nusing WeightGraph=vector<vector<edge<T>>>;\n\ntemplate<typename T>\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n T cost;\n cin>>s>>t>>cost;\n if(index1) s--,t--;\n g[s].emplace_back(t,cost);\n if(not directed) g[t].emplace_back(s,cost);\n }\n}\n\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\n while(M--){\n int s,t;\n cin>>s>>t;\n if(index1) s--,t--;\n g[s].push_back(t);\n if(not directed) g[t].push_back(s);\n }\n}\n\n\n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<T> &v) {\n for(size_t i=0;i<v.size();i++) is>>v[i];\n\treturn is;\n}\n \n//0-indexed vector cin\ntemplate<typename T>\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n is>>v[i];\n }\n return is;\n}\n//vector cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\n for(size_t i=0;i<v.size();i++){\n if(i) os<<\" \";\n os<<v[i];\n }\n return os;\n}\n//vector<vector> cout\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\n for(size_t i=0;i<v.size();i++){\n os<<v[i];\n if(i+1!=v.size()) os<<\"\\n\";\n }\n return os;\n}\n\n//Graph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const Graph &g) {\n for(size_t i=0;i<g.size();i++){\n for(int to:g[i]){\n os<<i<<\"->\"<<to<<\" \";\n }\n os<<endl;\n }\n return os;\n}\n\n//WeightGraph out\ntemplate<typename T>\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\n for(size_t i=0;i<g.size();i++){\n for(auto e:g[i]){\n os<<i<<\"->\"<<e.to<<\"(\"<<e.cost<<\") \";\n }\n os<<endl;\n }\n return os;\n}\n\n\n//要素数n 初期値x\ntemplate<typename T>\ninline vector<T> vmake(size_t n,T x){\n\treturn vector<T>(n,x);\n}\n\n//a,b,c,x data[a][b][c] 初期値x\ntemplate<typename... Args>\nauto vmake(size_t n,Args... args){\n\tauto v=vmake(args...);\n\treturn vector<decltype(v)>(n,move(v));\n}\n\n//pair cout\ntemplate<typename T, typename U>\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\n\tos<<p.first<<\" \"<<p.second;\n\treturn os;\n}\n \n//pair cin\ntemplate<typename T, typename U>\ninline istream &operator>>(istream &is,pair<T,U> &p) {\n\tis>>p.first>>p.second;\n\treturn is;\n}\n \n//ソート\ntemplate<typename T>\ninline void vsort(vector<T> &v){\n sort(v.begin(),v.end());\n}\n \n//逆順ソート\ntemplate<typename T>\ninline void rvsort(vector<T> &v){\n\tsort(v.rbegin(),v.rend());\n}\n\n//1ビットの数を返す\ninline int popcount(int x){\n\treturn __builtin_popcount(x);\n}\n//1ビットの数を返す\ninline int popcount(ll x){\n\treturn __builtin_popcountll(x);\n}\ntemplate<typename T>\ninline void Compress(vector<T> &C){\n sort(C.begin(),C.end());\n C.erase(unique(C.begin(),C.end()),C.end());\n}\ntemplate<typename T>\ninline int lower_idx(const vector<T> &C,T value){\n return lower_bound(C.begin(),C.end(),value)-C.begin();\n}\ntemplate<typename T>\ninline int upper_idx(const vector<T> &C,T value){\n return upper_bound(C.begin(),C.end(),value)-C.begin();\n}\n//時計回りに90度回転\ntemplate<typename T>\ninline void rotate90(vector<vector<T>> &C){\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\n for(int h=0;h<C.size();h++){\n for(int w=0;w<C[h].size();w++){\n D[w][C.size()-1-h]=C[h][w];\n }\n }\n C=D;\n}\n//補グラフを返す\n//i→iのような辺は加えない\nGraph ComplementGraph(const Graph &g){\n size_t sz=g.size();\n bool used[sz][sz];\n fill(used[0],used[sz],false);\n for(size_t i=0;i<sz;i++){\n for(int to:g[i]){\n used[i][to]=true;\n }\n }\n Graph ret(sz);\n for(size_t i=0;i<sz;i++){\n for(size_t j=0;j<sz;j++){\n if(used[i][j]) continue;\n if(i==j) continue;\n ret[i].push_back(j);\n }\n }\n return ret;\n}\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\n//無効グラフのみに対応\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\n vector<Graph> ret;\n vector<int> now;\n for(size_t i=0;i<g.size();i++){\n if(id[i].first!=-1) continue;\n id[i].first=ret.size();\n id[i].second=0;\n now.push_back(i);\n for(size_t j=0;j<now.size();j++){\n for(int to:g[now[j]]){\n if(id[to].first==-1){\n id[to].first=ret.size();\n id[to].second=now.size();\n now.push_back(to);\n }\n }\n }\n Graph r(now.size());\n for(size_t j=0;j<now.size();j++){\n r[j]=g[now[j]];\n for(int &to:r[j]){\n to=id[to].second;\n }\n }\n ret.push_back(r);\n now.clear();\n }\n return make_pair(ret,id);\n}\n//0indexを想定\nbool OutGrid(ll h,ll w,ll H,ll W){\n return (h>=H or w>=W or h<0 or w<0);\n}\n\nvoid NO(){\n cout<<\"NO\"<<\"\\n\";\n}\nvoid YES(){\n cout<<\"YES\"<<\"\\n\";\n}\nvoid No(){\n cout<<\"No\"<<\"\\n\";\n}\nvoid Yes(){\n cout<<\"Yes\"<<\"\\n\";\n}\nnamespace overflow{\n template<typename T>\n T max(){\n return numeric_limits<T>::max();\n }\n template<typename T>\n T ADD(T a,T b){\n T res;\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\n }\n template<typename T>\n T MUL(T a,T b){\n T res;\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\n }\n};\nusing namespace overflow;\nstruct ModInt{\n using u64=uint_fast64_t;\n u64 a;\n constexpr ModInt() :a(0){}\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\n\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\n return ModInt(*this)+=rhs;\n }\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\n return ModInt(*this)-=rhs;\n }\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\n return ModInt(*this)*=rhs;\n }\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\n return ModInt(*this)/=rhs;\n }\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\n return ModInt(*this)+=ModInt(rhs);\n }\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\n return ModInt(*this)-=ModInt(rhs);\n }\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\n return ModInt(*this)*=ModInt(rhs);\n }\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\n return ModInt(*this)/=ModInt(rhs);\n }\n\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\n a+=rhs.a;\n if(a>=MOD) a-=MOD;\n return *this;\n }\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\n if(rhs.a>a) a+=MOD;\n a-=rhs.a;\n return *this;\n }\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\n a=(a*rhs.a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\n a=(a*rhs.inverse().a)%MOD;\n return *this;\n }\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\n return *this+=ModInt(rhs);\n }\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\n return *this-=ModInt(rhs);\n }\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\n return *this*=ModInt(rhs);\n }\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\n return *this/=ModInt(rhs);\n }\n\n inline constexpr ModInt operator=(const ll x)noexcept{\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\n return *this;\n }\n\n inline constexpr bool operator==(const ModInt p)const noexcept{\n return a==p.a;\n }\n\n inline constexpr bool operator!=(const ModInt p)const noexcept{\n return a!=p.a;\n }\n\n inline constexpr ModInt pow(ll N) const noexcept{\n ModInt ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline constexpr ModInt inverse() const noexcept{\n return pow(MOD-2);\n }\n\n};\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)+=b;\n}\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)-=b;\n}\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)*=b;\n}\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\n return ModInt(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const ModInt &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,ModInt &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\n\nstruct Binominal{\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\n int sz;\n Binominal(int n=10) :sz(1){\n if(n<=0) n=10;\n init(n);\n }\n inline void init(int n){\n fac.resize(n+1,1);\n finv.resize(n+1,1);\n inv.resize(n+1,1);\n for(int i=sz+1;i<=n;i++){\n fac[i]=fac[i-1]*i;\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\n finv[i]=finv[i-1]*inv[i];\n }\n sz=n;\n }\n //nCk(n,k<=N) をO(1)で求める\n inline ModInt com(int n,int k){\n if(k==0 or k==n) return 1;\n if(n<k) return ModInt(0);\n if(n<0 || k<0) return ModInt(0);\n if(n>sz) init(n);\n return fac[n]*finv[k]*finv[n-k];\n }\n //nCk(k<=N) をO(k) で求める \n inline ModInt rcom(ll n,int k){\n if(n<0 || k<0 || n<k) return ModInt(0);\n if(k>sz) init(k);\n ModInt ret(1);\n for(int i=0;i<k;i++){\n ret*=n-i;\n }\n ret*=finv[k];\n return ret;\n }\n\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\n //〇がn個,|がk個\n inline ModInt h(int n,int k){\n return com(n+k-1,k);\n }\n //power[N+1] (power[i]=x^i)を返す\n static vector<ModInt> MakePower(ll x,int N){\n vector<ModInt> ret(N+1);\n ret[0]=1;\n for(int i=1;i<=N;i++){\n ret[i]=ret[i-1]*x;\n }\n return ret;\n }\n};\nvector<int> Subset(int S,bool zero=false,bool full=false){\n vector<int> ret;\n int now=(S-1)&S;\n if(full and S){\n ret.push_back(S);\n }\n do{\n ret.push_back(now);\n now=(now-1)&S;\n }while(now!=0);\n if(zero){\n ret.push_back(0);\n }\n return ret;\n}\n\n//xと差が最小の値を持つ添え字を返す\n//xはソート済みを想定\n//1つだけ返す\ntemplate<typename T>\ninline int MinimumAbs(vector<T> &v,T x){\n assert(v.size());\n auto large=lower_bound(v.begin(),v.end(),x);\n auto small=large;\n if(large==v.begin()) return large-v.begin();\n if(large==v.end()) return v.size()-1;\n small--;\n if(abs(*small-x)>abs(*large-x)) small=large;\n return small-v.begin();\n}\n\n\nclass modint{\n using u64=uint_fast64_t;\n static u64 &mod(){\n static u64 mod_=0;\n return mod_;\n }\npublic:\n u64 a;\n modint(const ll x=0):a((x>=0)?(x%mod()):(x%mod()+mod())){}\n modint operator+(const modint rhs)const{\n return modint(*this)+=rhs;\n }\n modint operator-(const modint rhs)const{\n return modint(*this)-=rhs;\n }\n modint operator*(const modint rhs)const{\n return modint(*this)*=rhs;\n }\n modint operator/(const modint rhs)const{\n return modint(*this)/=rhs;\n }\n modint &operator+=(const modint rhs){\n a+=rhs.a;\n if(a>=mod()) a-=mod();\n return *this;\n }\n modint &operator-=(const modint rhs){\n if(a<rhs.a) a+=mod();\n a-=rhs.a;\n return *this;\n }\n modint &operator*=(const modint rhs){\n a=a*rhs.a%mod();\n return *this;\n }\n modint &operator/=(const modint rhs){\n a=(a*rhs.inverse().a)%mod();\n return *this;\n }\n inline modint &operator+=(const ll rhs){\n return *this+=modint(rhs);\n }\n inline modint &operator-=(const ll rhs){\n return *this-=modint(rhs);\n }\n inline modint &operator*=(const ll rhs){\n return *this*=modint(rhs);\n }\n inline modint &operator/=(const ll rhs){\n return *this/=modint(rhs);\n }\n\n inline modint pow(u64 N)const{\n modint ans(1LL),p(a);\n while(N>0){\n if(bitUP(N,0)){\n ans*=p;\n }\n p*=p;\n N>>=1;\n }\n return ans;\n }\n inline modint inverse()const{\n return pow(mod()-2);\n }\n inline modint operator=(const ll x){\n a=(x>=0)?(x%mod()):(x%mod()+mod());\n return *this;\n }\n\n static void set_mod(const u64 x){mod()=x;}\n static u64 get_mod(){return mod();}\n};\ninline modint operator+(const ll a,const modint b)noexcept{\n return modint(a)+=b;\n}\ninline modint operator-(const ll a,const modint b)noexcept{\n return modint(a)-=b;\n}\ninline modint operator*(const ll a,const modint b)noexcept{\n return modint(a)*=b;\n}\ninline modint operator/(const ll &a,const modint &b)noexcept{\n return modint(a)/=b;\n}\n//cout\ninline ostream &operator<<(ostream &os,const modint &p) {\n return os<<p.a;\n}\n\n//cin\ninline istream &operator>>(istream &is,modint &p) {\n ll t;\n is>>t;\n p=t;\n return is;\n}\ntemplate<class T>\nvector<vector<T>> Binominal(int n){\n vector<vector<T>> table(n+1,vector<T>(n+1,0));\n table[0][0]=1;\n for(int i=1;i<=n;i++){\n table[i][0]=1;\n for(int j=1;j<=i;j++){\n table[i][j]=table[i-1][j-1]+table[i-1][j];\n }\n }\n return table;\n};\n\nvoid solve(){\n int N,M;\n cin>>N>>M;\n auto power=vmake(N,3,0);\n for(int i=0;i<N;i++){\n for(int j=0;j<3;j++) cin>>power[i][j];\n }\n using DD=double;\n vector<DD> prob(M+100);\n auto B=Binominal<ll>(M+100);\n DD zen=0;\n for(int a=0;a<=M;a++){\n for(int b=0;b<=M;b++){\n if(a+b>M) continue;\n zen+=B[M][a]*B[M-a][b];\n }\n }\n for(int i=M;i>=0;i--){\n if(i!=M) prob[i]=prob[i+1];\n for(int j=0;j+i<=M;j++){\n prob[i]+=B[M][i]*B[M-i][j]/zen;\n }\n }\n auto point=vmake(3,M+1,(DD)0);\n for(int i=0;i<3;i++){\n for(int m=0;m<=M;m++){\n DD sai=1.0;\n auto dp=vmake(3,(DD)0);\n dp[0]=1;\n int p=power[0][i]*m;\n for(int k=1;k<N;k++){\n //負ける確率を求める\n int tp=power[k][i];\n int cnt=(p+tp-1)/tp;\n DD pb=0;\n if(cnt<=M) pb=prob[cnt];\n sai*=pb;\n for(int j=2;j>=0;j--){\n if(j<=1) dp[j+1]+=dp[j]*pb;\n dp[j]=dp[j]*(1-pb);\n }\n }\n DD ret=0;\n ret+=sai*(-1);\n DD x=5;\n if(i==1) x=3;\n else if(i==2) x=2;\n ret+=x*(dp[0]+dp[1]+dp[2]);\n point[i][m]=ret;\n }\n }\n DD ans=-MAX;\n for(int a=0;a<=M;a++){\n for(int b=0;b<=M;b++){\n if(a+b>M) continue;\n chmax(ans,point[0][a]+point[1][b]+point[2][M-a-b]);\n }\n }\n cout<<ans<<endl;\n}\n\n};\n\nint main(){\n BIN101::bin101();\n int T=1;\n //cin>>T;\n while(T--) BIN101::solve();\n}","accuracy":0.47368421052631576,"time_ms":10,"memory_kb":12940,"score_of_the_acc":-0.1354,"final_rank":20},{"submission_id":"aoj_2434_5778478","code_snippet":"#include<iostream>\n#include<iomanip>\nusing namespace std;\ndouble comb[2001];\ndouble up[2001];\nint N,M;\nint A[3][2000];\ndouble p[3][2001][2];\ndouble dp[2000][3];\nint main()\n{\n\tcin>>N>>M;\n\tcomb[0]=1;\n\tfor(int i=1;i<=M;i++)\n\t{\n\t\tcomb[i]=comb[i-1]*(M+1-i)/i;\n\t}\n\tfor(int i=0;i<=M;i++)\n\t{\n\t\tup[i]=comb[i];\n\t\tfor(int j=i;j<M;j++)up[i]=up[i]*2/3;\n\t\tfor(int j=0;j<i;j++)up[i]/=3;\n\t}\n\tfor(int i=M;i--;)up[i]+=up[i+1];\n\tfor(int i=0;i<N;i++)for(int j=0;j<3;j++)cin>>A[j][i];\n\tfor(int I=0;I<3;I++)\n\t{\n\t\tfor(int i=0;i<=M;i++)\n\t\t{\n\t\t\tdp[0][0]=1;\n\t\t\tdouble all=1;\n\t\t\tfor(int j=1;j<N;j++)\n\t\t\t{\n\t\t\t\tint cnt=(A[I][0]*i+A[I][j]-1)/A[I][j];\n\t\t\t\tdouble np=cnt<=M?up[cnt]:0;\n\t\t\t\tdp[j][2]=dp[j-1][2]*(1-np)+dp[j-1][1]*np;\n\t\t\t\tdp[j][1]=dp[j-1][1]*(1-np)+dp[j-1][0]*np;\n\t\t\t\tdp[j][0]=dp[j-1][0]*(1-np);\n\t\t\t\tall*=np;\n\t\t\t}\n\t\t\tfor(int j=0;j<3;j++)p[I][i][0]+=dp[N-1][j];\n\t\t\tp[I][i][1]=all;\n\t\t}\n\t}\n\tdouble ans=-9e18;\n\tfor(int a=0;a<=M;a++)for(int b=0;a+b<=M;b++)\n\t{\n\t\tint c=M-a-b;\n\t\tdouble now=p[0][a][0]*5+p[1][b][0]*3+p[2][c][0]*2;\n\t\tnow-=p[0][a][1]+p[1][b][1]+p[2][c][1];\n\t\tif(ans<now)ans=now;\n\t}\n\tcout<<fixed<<setprecision(16)<<ans<<endl;\n}","accuracy":0.5263157894736842,"time_ms":20,"memory_kb":3604,"score_of_the_acc":-0.0184,"final_rank":18},{"submission_id":"aoj_2434_5774311","code_snippet":"#include<iostream>\n#include<iomanip>\nusing namespace std;\nlong double comb[2001];\nlong double up[2001];\nint N,M;\nint A[3][2000];\nlong double p[3][2001][2];\nlong double dp[2000][3];\nint main()\n{\n\tcin>>N>>M;\n\tcomb[0]=1;\n\tfor(int i=1;i<=M;i++)\n\t{\n\t\tcomb[i]=comb[i-1]*(M+1-i)/i;\n\t}\n\tfor(int i=0;i<=M;i++)\n\t{\n\t\tup[i]=comb[i];\n\t\tfor(int j=i;j<M;j++)up[i]=up[i]*2/3;\n\t\tfor(int j=0;j<i;j++)up[i]/=3;\n\t}\n\tfor(int i=M;i--;)up[i]+=up[i+1];\n\tfor(int i=0;i<N;i++)for(int j=0;j<3;j++)cin>>A[j][i];\n\tfor(int I=0;I<3;I++)\n\t{\n\t\tfor(int i=0;i<=M;i++)\n\t\t{\n\t\t\tdp[0][0]=1;\n\t\t\tlong double all=1;\n\t\t\tfor(int j=1;j<N;j++)\n\t\t\t{\n\t\t\t\tint cnt=(A[I][0]*i+A[I][j]-1)/A[I][j];\n\t\t\t\tlong double np=cnt<=M?up[cnt]:0;\n\t\t\t\tdp[j][2]=dp[j-1][2]*(1-np)+dp[j-1][1]*np;\n\t\t\t\tdp[j][1]=dp[j-1][1]*(1-np)+dp[j-1][0]*np;\n\t\t\t\tdp[j][0]=dp[j-1][0]*(1-np);\n\t\t\t\tall*=np;\n\t\t\t}\n\t\t\tfor(int j=0;j<3;j++)p[I][i][0]+=dp[N-1][j];\n\t\t\tp[I][i][1]=all;\n\t\t}\n\t}\n\tlong double ans=-9e18;\n\tfor(int a=0;a<=M;a++)for(int b=0;a+b<=M;b++)\n\t{\n\t\tint c=M-a-b;\n\t\tlong double now=p[0][a][0]*5+p[1][b][0]*3+p[2][c][0]*2;\n\t\tnow-=p[0][a][1]+p[1][b][1]+p[2][c][1];\n\t\tif(ans<now)ans=now;\n\t}\n\tcout<<fixed<<setprecision(16)<<ans<<endl;\n}","accuracy":1,"time_ms":130,"memory_kb":3908,"score_of_the_acc":-0.2228,"final_rank":4},{"submission_id":"aoj_2434_5345137","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double INF = 100;\nint main(){\n cout << fixed << setprecision(20);\n int n, m;\n cin >> n >> m;\n vector<vector<int>> A(n, vector<int>(3));\n for (int i = 0; i < n; i++){\n for (int j = 0; j < 3; j++){\n cin >> A[i][j];\n }\n }\n vector<vector<double>> P(m + 1, vector<double>(m + 1, 0));\n P[0][0] = 1;\n for (int i = 0; i < m; i++){\n for (int j = 0; j <= i; j++){\n P[i + 1][j] += P[i][j] / 3 * 2;\n P[i + 1][j + 1] += P[i][j] / 3;\n }\n }\n vector<double> S(m + 2);\n S[m + 1] = 0;\n for (int i = m; i >= 0; i--){\n S[i] = S[i + 1] + P[m][i];\n }\n double ans = 0;\n vector<int> W = {5, 3, 2};\n vector<vector<double>> dp(4, vector<double>(m + 1, -INF));\n dp[0][0] = 0;\n for (int i = 0; i < 3; i++){\n vector<vector<double>> dp2(m + 1, vector<double>(4, 0));\n for (int j = 0; j <= m; j++){\n dp2[j][0] = 1;\n dp2[j][3] = 1;\n }\n for (int j = 1; j < n; j++){\n \tvector<vector<double>> dp3(m + 1, vector<double>(4, 0));\n for (int k = 0; k <= m; k++){\n int c = (A[0][i] * k + A[j][i] - 1) / A[j][i];\n c = min(c, m + 1);\n double p = S[c];\n for (int l = 0; l < 3; l++){\n dp3[k][l] += dp2[k][l] * (1 - p);\n dp3[k][l + 1] += dp2[k][l] * p;\n }\n dp3[k][3] = dp2[k][3] * p;\n }\n swap(dp2, dp3);\n }\n vector<double> E(m + 1);\n for (int j = 0; j <= m; j++){\n E[j] = (dp2[j][0] + dp2[j][1] + dp2[j][2]) * W[i] - dp2[j][3];\n }\n for (int j = 0; j <= m; j++){\n for (int k = 0; k <= m - j; k++){\n dp[i + 1][j + k] = max(dp[i + 1][j + k], dp[i][j] + E[k]);\n }\n }\n }\n cout << dp[3][m] << endl;\n}","accuracy":1,"time_ms":470,"memory_kb":34676,"score_of_the_acc":-1.2866,"final_rank":15},{"submission_id":"aoj_2434_4972791","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> l_l;\ntypedef pair<int, int> i_i;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\nll N, M;\nll A[3][2005];\nll score[3] = {5, 3, 2};\nlong double calc[2005];\nlong double P[2005];\nlong double val[3][2005];\nlong double logFactorial[5000];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n for(int i = 1; i < 5000; i++) {\n logFactorial[i] = logFactorial[i-1] + log(i);\n }\n cin >> N >> M;\n for(int i = 0; i <= M; i++) {\n long double tmp = 0;\n tmp -= logFactorial[i];\n tmp -= logFactorial[M-i];\n tmp += logFactorial[M];\n tmp -= log(3) * M;\n tmp += log(2) * (M - i);\n P[i] = exp(tmp);\n //cerr << i << \" \" << P[i] << endl;\n }\n for(int i = 0; i < M; i++) {\n P[i+1] += P[i];\n }\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < 3; j++) {\n cin >> A[j][i];\n }\n }\n for(int t = 0; t < 3; t++) {\n val[t][0] = -1;\n for(int i = 1; i <= M; i++) {\n ll a = A[t][0] * i;\n for(int j = 1; j < N; j++) {\n ll num = (a - 1) / A[t][j];\n chmin(num, M);\n //cerr << t << \" \" << a << \" \" << j << \" \" << num << endl;\n calc[j] = P[num];\n //cerr << j << \" \" << calc[j] << endl;\n //cerr << num << \" \" << P[num] << endl;\n }\n long double sum = 0;\n long double powsum = 0;\n long double prod = 1;\n long double ALLLOSE = 1;\n for(int j = 1; j < N; j++) {\n long double win = calc[j];\n long double lose = 1 - win;\n //cerr << win << \" \" << lose << endl;\n prod *= win;\n sum += lose / win;\n powsum += pow(lose / win, 2);\n ALLLOSE *= lose;\n }\n long double A = (sum * sum - powsum) / 2;\n //cerr << prod << \" \" << ALLLOSE << endl;\n //cerr << A << \" \" << sum << endl;\n A += sum;\n A += 1;\n val[t][i] = A * prod * score[t] - ALLLOSE;\n //cerr << t << \" \" << i << \" \" << val[t][i] << \" \" << A * prod << \" \" << ALLLOSE << endl;\n }\n }\n long double ans = -3;\n for(int i = 0; i <= M; i++) {\n for(int j = 0; i + j <= M; j++) {\n long double tmp = val[0][i] + val[1][j] + val[2][M-i-j];\n chmax(ans, tmp);\n }\n }\n cout << fixed << setprecision(30) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":4036,"score_of_the_acc":-0.1882,"final_rank":2},{"submission_id":"aoj_2434_4962885","code_snippet":"#pragma region Macros\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC target(\"avx2,avx\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size) \\\n vector<type> name(size); \\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w) \\\n vector<vector<type>> name(h, vector<type>(w)); \\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\nconst string YESNO[2] = {\"NO\", \"YES\"};\nconst string YesNo[2] = {\"No\", \"Yes\"};\nconst string yesno[2] = {\"no\", \"yes\"};\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\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\ntemplate <typename T> struct edge {\n int from, to;\n T cost;\n int id;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n operator int() const { return to; }\n};\ntemplate <typename T> using Edges = vector<edge<T>>;\n\nusing Tree = vector<vector<int>>;\nusing Graph = vector<vector<int>>;\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\n Tree res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n cin >> a >> b;\n a -= margin, b -= margin;\n res[a].emplace_back(b);\n if(!directed) res[b].emplace_back(a);\n }\n return move(res);\n}\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\n Wgraph<T> res(n);\n if(m == -1) m = n - 1;\n while(m--) {\n int a, b;\n T c;\n cin >> a >> b >> c;\n a -= margin, b -= margin;\n res[a].emplace_back(b, c);\n if(!directed) res[b].emplace_back(a, c);\n }\n return move(res);\n}\n\n#define i128 __int128_t\n#define ull unsigned long long int\n#define TEST \\\n INT(testcases); \\\n while(testcases--)\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n for(auto &e : v) cout << e << \" \";\n cout << endl;\n return os;\n}\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\n cout << \"(\" << p.fi << \", \" << p.se << \")\";\n return os;\n}\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \"(\" + to_string(p.first) + \",\" + to_string(p.second) + \")\"; }\ntemplate <class A> string to_string(A v) {\n if(v.empty()) return \"{}\";\n string ret = \"{\";\n for(auto &x : v) ret += to_string(x) + \",\";\n ret.back() = '}';\n return ret;\n}\n\nvoid dump() { cerr << endl; }\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\n cerr << to_string(head) << \" \";\n dump(tail...);\n}\n#define endl '\\n'\n#ifdef _LOCAL\n#undef endl\n#define debug(x) \\\n cout << #x << \": \"; \\\n dump(x)\n#else\n#define debug(x)\n#endif\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\n\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\n\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\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;\n#define drop(s) cout << #s << endl;\n#pragma endregion\n\nint main() {\n INT(n, m);\n n--;\n VEC(int, a, 3);\n VV(int, v, n, 3);\n vector<double> dp = {1};\n rep(i, m) {\n vector<double> nxt(si(dp) + 1);\n rep(j, si(dp)) nxt[j + 1] += dp[j] / 3, nxt[j] += dp[j] * 2 / 3;\n swap(dp, nxt);\n }\n vector<double> rui(m + 2);\n rep(i, m + 1) rui[i + 1] = rui[i] + dp[i];\n vv(double, E, m + 1, 3);\n vi point{5, 3, 2};\n rep(i, m + 1) {\n rep(j, 3) {\n int now = a[j] * i;\n vec(double, cnt, 4);\n double last = 1;\n cnt[0] = 1;\n rep(k, n) {\n int ma = ((now % v[k][j]) ? now / v[k][j] : now / v[k][j] - 1);\n double p = rui[min(m + 1, ma + 1)];\n last *= (1 - p);\n vector<double> nxt(4);\n rep(s, 4) nxt[min((int)s + 1, 3)] += cnt[s] * (1 - p), nxt[s] += cnt[s] * p;\n swap(nxt, cnt);\n }\n E[i][j] -= last;\n rep(k, 3) E[i][j] += cnt[k] * point[j];\n }\n }\n double ans = -1e15;\n rep(i, m + 1) {\n rep(j, m + 1) {\n if(i + j > m) continue;\n int k = m - i - j;\n chmax(ans, E[i][0] + E[j][1] + E[k][2]);\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":230,"memory_kb":3916,"score_of_the_acc":-0.4047,"final_rank":7},{"submission_id":"aoj_2434_4962793","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <cmath>\nusing namespace std;\n\nint main(){\n using T = long double;\n\n int n, m;\n cin >> n >> m;\n vector<vector<int>> D(n,vector<int>(3));\n for(int i = 0; i < n; ++i)\n for(int j = 0; j < 3; ++j)\n cin >> D[i][j];\n\n vector<T> P(m+1);// \n P[0] = 1;\n for(int i = 0; i < m; ++i)\n P[0] *= 2.0/3.0;\n\n for(int i = 0; i < m; ++i)\n P[i+1] = P[i]/2*(m-i)/(i+1);\n\n for(int i = m; i > 0; --i)\n P[i-1] += P[i];\n\n const vector<int> pp = {5,3,2};\n \n vector<vector<T>> E(3,vector<T>(m+1));\n for(int i = 0; i < 3; ++i){\n for(int j = 0; j <= m; ++j){\n int t = D[0][i]*j;\n vector<T> p(n-1);\n T w = 1.0;\n for(int k = 1; k < n; ++k){\n int c = (t+D[k][i]-1)/D[k][i];\n p[k-1] = (c > m ? 0.0 : P[c]);// i が 0 に勝つ確率\n w *= p[k-1];\n }\n E[i][j] -= w;\n vector<T> dp(3);\n dp[0] = 1;\n for(int k = 0; k+1 < n; ++k){\n vector<T> dp_(3);\n for(int l = 0; l < 3; ++l){\n if(l+1 < 3)\n dp_[l+1] += dp[l]*p[k];\n dp_[l] += dp[l]*(1-p[k]);\n }\n swap(dp,dp_);\n }\n for(int k = 0; k < 3; ++k)// 順位 (0-indexed)\n E[i][j] += pp[i]*dp[k];\n }\n }\n\n const T INF = 100, EPS = 1e-8;\n vector<T> dp(m+1,-INF);\n dp[0] = 0;\n for(int i = 0; i < 3; ++i){\n vector<T> dp_(m+1,-INF);\n for(int j = 0; j <= m; ++j){\n if(dp[j] <= -INF+EPS) continue;\n for(int k = 0; k <= m; ++k){\n if(j+k > m) break;\n if(E[i][k] <= -INF+EPS) continue;\n dp_[j+k] = max<T>(dp_[j+k],dp[j]+E[i][k]);\n }\n }\n swap(dp,dp_);\n }\n assert(dp[m] >= -3.0-EPS);\n dp[m] = max<T>(dp[m],-3.0);\n cout << fixed << setprecision(12) << dp[m] << endl;\n}","accuracy":1,"time_ms":560,"memory_kb":3592,"score_of_the_acc":-1,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_2434_9779526\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(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\\nvector<double> P;\\n\\nvector<double> Solve(int N, int M, int K, int X, vector<int> A) {\\n vector<double> Ret(M+1,0.0);\\n rep(i,0,M+1) {\\n vector<double> DP(3,0.0);\\n DP[0] = 1.0;\\n double ALLLose = 1.0;\\n rep(j,0,N) {\\n int LoseNum = ceil(X*i,A[j]);\\n double Lose;\\n if (LoseNum >= M+1) Lose = 0.0;\\n else if (LoseNum < 0) Lose = 1.0;\\n else Lose = P[LoseNum];\\n double Win = 1.0 - Lose;\\n ALLLose *= Lose;\\n vector<double> NewDP(3,0.0);\\n rep(k,0,3) {\\n NewDP[k] += DP[k] * Win;\\n }\\n rep(k,0,2) {\\n NewDP[k+1] += DP[k] * Lose;\\n }\\n swap(DP,NewDP);\\n }\\n Ret[i] = (DP[0]+DP[1]+DP[2]) * (double)K - ALLLose;\\n }\\n return Ret;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n N--;\\n P.resize(M+1,0.0);\\n P[0] = 1.0;\\n rep(i,0,M) {\\n vector<double> NP(M+1,0.0);\\n rep(j,0,i+1) {\\n NP[j] += P[j] * 2.0 / 3.0;\\n NP[j+1] += P[j] / 3.0;\\n }\\n swap(P,NP);\\n }\\n rrep(i,0,M) P[i] += P[i+1];\\n vector<int> X(3);\\n vector<vector<int>> A(3,vector<int>(N));\\n rep(i,0,3) cin >> X[i];\\n rep(i,0,N) rep(j,0,3) cin >> A[j][i];\\n vector<vector<double>> D = {Solve(N,M,5,X[0],A[0]),Solve(N,M,3,X[1],A[1]),Solve(N,M,2,X[2],A[2])};\\n double ANS = -inf;\\n rep(i,0,M+1) {\\n rep(j,0,M+1) {\\n if (i+j > M) break;\\n chmax(ANS, D[0][i] + D[1][j] + D[2][M-i-j]);\\n }\\n }\\n printf(\\\"%.12f\\\\n\\\",ANS);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.4742,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2434_8390197\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<double> get_expected(int N, int M, int score, const vector<int>& A, const vector<double>& sp) {\\n\\tvector<double> res(M + 1);\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tvector<double> win(N);\\n\\t\\t// win condition: A[0] * i > A[j] * x --> x < A[0] * i / A[j] --> x < ceil(A[0] * i / A[j])\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tint b = (A[0] * i + A[j] - 1) / A[j];\\n\\t\\t\\tif (b > M + 1) {\\n\\t\\t\\t\\twin[j] = 1.0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\twin[j] = sp[b];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tarray<double, 3> dp = { 1.0, 0.0, 0.0 };\\n\\t\\tdouble worst = 1.0;\\n\\t\\tfor (int j = 1; j < N; j++) {\\n\\t\\t\\tarray<double, 3> ndp = { 0.0, 0.0, 0.0 };\\n\\t\\t\\tfor (int k = 0; k < 3; k++) {\\n\\t\\t\\t\\tndp[k] += dp[k] * win[j];\\n\\t\\t\\t\\tif (k != 2) {\\n\\t\\t\\t\\t\\tndp[k + 1] += dp[k] * (1.0 - win[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdp = ndp;\\n\\t\\t\\tworst *= (1.0 - win[j]);\\n\\t\\t}\\n\\t\\tres[i] = (dp[0] + dp[1] + dp[2]) * score - worst;\\n\\t}\\n\\treturn res;\\n}\\n\\ndouble solve(int N, int M, const vector<int>& A, const vector<int>& B, const vector<int>& C) {\\n\\tvector<vector<double> > p(M + 1);\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tp[i].resize(i + 1);\\n\\t}\\n\\tp[0][0] = 1.0;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tfor (int j = 0; j <= i; j++) {\\n\\t\\t\\tp[i + 1][j] += p[i][j] * 2 / 3;\\n\\t\\t\\tp[i + 1][j + 1] += p[i][j] / 3;\\n\\t\\t}\\n\\t}\\n\\tvector<double> sp(M + 2);\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tsp[i + 1] = sp[i] + p[M][i];\\n\\t}\\n\\tvector<double> ea = get_expected(N, M, 5, A, sp);\\n\\tvector<double> eb = get_expected(N, M, 3, B, sp);\\n\\tvector<double> ec = get_expected(N, M, 2, C, sp);\\n\\tdouble ans = -1.0e+99;\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tfor (int j = 0; i + j <= M; j++) {\\n\\t\\t\\tint k = M - (i + j);\\n\\t\\t\\tdouble subscore = ea[i] + eb[j] + ec[k];\\n\\t\\t\\tans = max(ans, subscore);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> A(N), B(N), C(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> A[i] >> B[i] >> C[i];\\n\\t}\\n\\tdouble ans = solve(N, M, A, B, C);\\n\\tcout.precision(15);\\n\\tcout << fixed << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 18916,\n \"score_of_the_acc\": -0.4401,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2434_8291292\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint N, A[2009], B[2009], C[2009];\\nint M;\\ndouble sum[2009][2009];\\ndouble dp[2009][4];\\ndouble ca[2009], cb[2009], cc[2009];\\n\\nvoid Initialize() {\\n\\tsum[0][0] = 1;\\n\\tfor (int i = 0; i < 2000; i++) {\\n\\t\\tfor (int j = 0; j < 2000; j++) {\\n\\t\\t\\tsum[i + 1][j + 0] += (2.0 / 3.0) * sum[i][j];\\n\\t\\t\\tsum[i + 1][j + 1] += (1.0 / 3.0) * sum[i][j];\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <= 2000; i++) {\\n\\t\\tfor (int j = 2000; j >= 0; j--) sum[i][j] += sum[i][j + 1];\\n\\t}\\n}\\n\\npair<double, double> CalcProbability(int Target, vector<int> Points) {\\n\\t// Worst Probability\\n\\tdouble prob1 = 1;\\n\\tfor (int i = 0; i < Points.size(); i++) {\\n\\t\\tint num = min(2001, (Target + Points[i] - 1) / Points[i]);\\n\\t\\tprob1 *= sum[M][num];\\n\\t}\\n\\n\\t// Best Probability\\n\\tfor (int i = 0; i <= Points.size(); i++) {\\n\\t\\tfor (int j = 0; j <= 3; j++) dp[i][j] = 0.0;\\n\\t}\\n\\tdp[0][0] = 1.0;\\n\\tfor (int i = 0; i < Points.size(); i++) {\\n\\t\\tfor (int j = 0; j <= 3; j++) {\\n\\t\\t\\tint num = min(2001, (Target + Points[i] - 1) / Points[i]);\\n\\t\\t\\tdouble prob_ok = sum[M][num];\\n\\t\\t\\tdouble prob_ng = 1.0 - prob_ok;\\n\\t\\t\\tdp[i + 1][min(3, j + 0)] += dp[i][j] * prob_ng;\\n\\t\\t\\tdp[i + 1][min(3, j + 1)] += dp[i][j] * prob_ok;\\n\\t\\t}\\n\\t}\\n\\tdouble prob2 = dp[Points.size()][3];\\n\\n\\t// Return\\n\\treturn make_pair(prob1, 1.0 - prob2);\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tInitialize();\\n\\tcin >> N >> M;\\n\\tfor (int i = 1; i <= N; i++) cin >> A[i] >> B[i] >> C[i];\\n\\n\\t// Step 2. Pre Calculation\\n\\tvector<int> LA, LB, LC;\\n\\tfor (int i = 2; i <= N; i++) LA.push_back(A[i]);\\n\\tfor (int i = 2; i <= N; i++) LB.push_back(B[i]);\\n\\tfor (int i = 2; i <= N; i++) LC.push_back(C[i]);\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tpair<double, double> v1 = CalcProbability(A[1] * i, LA);\\n\\t\\tpair<double, double> v2 = CalcProbability(B[1] * i, LB);\\n\\t\\tpair<double, double> v3 = CalcProbability(C[1] * i, LC);\\n\\t\\tca[i] = 5.0 * v1.second - 1.0 * v1.first;\\n\\t\\tcb[i] = 3.0 * v2.second - 1.0 * v2.first;\\n\\t\\tcc[i] = 2.0 * v3.second - 1.0 * v3.first;\\n\\t}\\n\\n\\t// Step 3. Brute Force\\n\\tdouble Answer = -1e9;\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tfor (int j = 0; j <= M - i; j++) {\\n\\t\\t\\tint k = M - i - j;\\n\\t\\t\\tAnswer = max(Answer, ca[i] + cb[j] + cc[k]);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 35092,\n \"score_of_the_acc\": -0.7108,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2434_6739762\",\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\\nvector<double> solve(const int n,const int m,const vector<double> &p,vector<int> v,int tmp){\\n vector<double> res(m+1);\\n for(int i=0;i<=m;i++){\\n int score = v[0]*i;\\n // 最下位の確率\\n double bb = 1;\\n array<double, 3> dp;\\n dp[0] = 1;\\n dp[1] = 0;\\n dp[2] = 0;\\n for(int j=1;j<n;j++){\\n array<double, 3> ndp;\\n ndp[0] = ndp[1] = ndp[2] = 0;\\n double b;\\n if(m*v[j] < score){\\n b = 0;\\n }\\n else{\\n int u = (score+v[j]-1)/v[j];\\n b = p[u];\\n }\\n bb *= b;\\n for(int k=0;k<3;k++){\\n if(k+1<3){\\n ndp[k+1] += dp[k]*b;\\n }\\n ndp[k] += dp[k]*(1-b);\\n }\\n swap(dp,ndp);\\n }\\n res[i] = -bb+tmp*(dp[0]+dp[1]+dp[2]);\\n }\\n return res;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m; cin >> n >> m;\\n vector<int> v(n),vv(n),vvv(n);\\n for(int i=0;i<n;i++){\\n cin >> v[i] >> vv[i] >> vvv[i];\\n }\\n vector<double> p(m+1);\\n p[0] = 1.0;\\n for(int i=0;i<m;i++){\\n vector<double> np(m+1);\\n for(int j=0;j<=i;j++){\\n np[j+1] += p[j] / 3.0;\\n np[j] += p[j] * 2.0 / 3.0;\\n }\\n swap(p,np);\\n }\\n for(int i=m;i>0;i--){\\n p[i-1] += p[i];\\n }\\n auto r = solve(n,m,p,v,5);\\n auto rr = solve(n,m,p,vv,3);\\n auto rrr = solve(n,m,p,vvv,2);\\n double res = -1e9;\\n for(int i=0;i<=m;i++){\\n for(int j=0;i+j<=m;j++){\\n res = max(res,r[i]+rr[j]+rrr[m-i-j]);\\n }\\n }\\n printf(\\\"%.9f\\\\n\\\",res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3664,\n \"score_of_the_acc\": -0.0556,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2434_6607644\",\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) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int n, m;\\n cin >> n >> m;\\n vector<int> pts = {5, 3, 2};\\n vector<vector<int>> val(n, vector<int>(3));\\n for (auto& v : val) for (auto& x : v) cin >> x;\\n vector<vector<double>> diff(3, vector<double>(m+1));\\n\\n // probability of appealing i times\\n vector<double> prob(m+1);\\n rep(j,0,m+1) {\\n // prob[j] = pow(2.0/3, m);\\n prob[j] = 1;\\n rep(i,0,j) {\\n prob[j] *= 1.0*(m-i)/(i+1)/3;\\n }\\n rep(i,0,m-j) prob[j] *= 2.0/3;\\n }\\n vector<double> cum(m+2);\\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\\n\\n rep(k,0,3) {\\n rep(j,0,m+1) {\\n vector<double> p(n);\\n rep(i,1,n) {\\n // probability of the idol i beating the idol 0\\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\\n // appeal k, >= c times\\n if (c <= m) p[i] = 1.0 - cum[c];\\n }\\n vector<double> q(3);\\n q[0] = 1;\\n double alllose = 1;\\n rep(i,1,n) {\\n alllose *= p[i];\\n vector<double> nq(3);\\n rep(l,0,3) {\\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\\n nq[l] += q[l] * (1-p[i]);\\n }\\n q.swap(nq);\\n }\\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\\n }\\n }\\n\\n double ans = -1e18;\\n rep(x,0,m+1) rep(y,0,m+1-x) {\\n int z = m - (x + y);\\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -0.3118,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2434_6607632\",\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) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int n, m;\\n cin >> n >> m;\\n vector<int> pts = {5, 3, 2};\\n vector<vector<int>> val(n, vector<int>(3));\\n for (auto& v : val) for (auto& x : v) cin >> x;\\n vector<vector<double>> diff(3, vector<double>(m+1));\\n\\n // probability of appealing i times\\n vector<double> prob(m+1);\\n rep(j,0,m+1) {\\n prob[j] = pow(2.0/3, m);\\n rep(i,0,j) {\\n prob[j] *= 0.5*(m-i)/(i+1);\\n }\\n }\\n vector<double> cum(m+2);\\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\\n\\n rep(k,0,3) {\\n rep(j,0,m+1) {\\n vector<double> p(n);\\n rep(i,1,n) {\\n // probability of the idol i beating the idol 0\\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\\n // appeal k, >= c times\\n if (c <= m) p[i] = cum[m+1] - cum[c];\\n }\\n vector<double> q(3);\\n q[0] = 1;\\n double alllose = 1;\\n rep(i,1,n) {\\n alllose *= p[i];\\n vector<double> nq(3);\\n rep(l,0,3) {\\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\\n nq[l] += q[l] * (1-p[i]);\\n }\\n q.swap(nq);\\n }\\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\\n }\\n }\\n\\n double ans = -1e18;\\n rep(x,0,m+1) rep(y,0,m+1-x) {\\n int z = m - (x + y);\\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.5789473684210527,\n \"time_ms\": 130,\n \"memory_kb\": 4056,\n \"score_of_the_acc\": -0.2249,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2434_6607625\",\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) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int n, m;\\n cin >> n >> m;\\n vector<int> pts = {5, 3, 2};\\n vector<vector<int>> val(n, vector<int>(3));\\n for (auto& v : val) for (auto& x : v) cin >> x;\\n vector<vector<double>> diff(3, vector<double>(m+1));\\n\\n // probability of appealing i times\\n vector<double> prob(m+1);\\n rep(j,0,m+1) {\\n double num = pow(2, m-j), den = pow(3, m);\\n rep(i,0,j) {\\n num *= (m-i);\\n den *= i+1;\\n }\\n prob[j] = num/den;\\n }\\n vector<double> cum(m+2);\\n rep(j,0,m+1) cum[j+1] = cum[j] + prob[j];\\n\\n rep(k,0,3) {\\n rep(j,0,m+1) {\\n vector<double> p(n);\\n rep(i,1,n) {\\n // probability of the idol i beating the idol 0\\n int c = (val[0][k]*j+val[i][k]-1)/val[i][k];\\n // appeal k, >= c times\\n if (c <= m) p[i] = cum[m+1] - cum[c];\\n }\\n vector<double> q(3);\\n q[0] = 1;\\n double alllose = 1;\\n rep(i,1,n) {\\n alllose *= p[i];\\n vector<double> nq(3);\\n rep(l,0,3) {\\n if (l+1 < 3) nq[l+1] += q[l] * p[i];\\n nq[l] += q[l] * (1-p[i]);\\n }\\n q.swap(nq);\\n }\\n diff[k][j] = accumulate(all(q), 0.0) * pts[k] - alllose;\\n }\\n }\\n\\n double ans = -1e18;\\n rep(x,0,m+1) rep(y,0,m+1-x) {\\n int z = m - (x + y);\\n chmax(ans, diff[0][x] + diff[1][y] + diff[2][z]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.47368421052631576,\n \"time_ms\": 20,\n \"memory_kb\": 4004,\n \"score_of_the_acc\": -0.0241,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2434_6367668\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2022.03.01 23:02:29 */\\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\\ndouble solve(int n) {\\n\\tint m;\\n\\tcin >> m;\\n\\tconst int r = 3;\\n\\tVVEC(int, scores, n, r);\\n\\tconst vector<int> pts = {5, 3, 2};\\n\\n\\tvector<vector<int>> transpose(r, vi(n));\\n\\trep(i, r) rep(j, n) transpose[i][j] = scores[j][i];\\n\\n\\tconst double trip = 1. / 3;\\n\\n\\tvector<double> dp(m + 1, 0.);\\n\\tdp.front() = 1;\\n\\trep(i, m) {\\n\\t\\tauto pre = dp;\\n\\t\\tdp.assign(m + 1, 0.);\\n\\t\\trep(j, i + 1) {\\n\\t\\t\\tdp[j] += (1 - trip) * pre[j];\\n\\t\\t\\tdp[j + 1] += (trip)*pre[j];\\n\\t\\t}\\n\\t}\\n\\n\\tvector<double> acc(m + 2);\\n\\trep(i, m + 1) acc[i + 1] = acc[i] + dp[i];\\n\\n\\tauto last_prob = [&](int score, vi &ab) {\\n\\t\\tconst int n = ab.size();\\n\\t\\tdouble ret = 1;\\n\\t\\trep(i, 1, n) {\\n\\t\\t\\tint value = ab[i];\\n\\t\\t\\tint need = dup(score, value);\\n\\t\\t\\tchmin(need, m + 1);\\n\\t\\t\\tret *= (1 - acc[need]);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\n\\tauto bestthree_prob = [&](int score, vi &ab) {\\n\\t\\tconst int len = ab.size();\\n\\t\\tvector<double> ret(3);\\n\\t\\tret.front() = 1;\\n\\t\\trep(i, 1, len) {\\n\\t\\t\\tconst int value = ab[i];\\n\\t\\t\\tint need = dup(score, value);\\n\\t\\t\\tchmin(need, m + 1);\\n\\t\\t\\tdouble under = acc[need];\\n\\t\\t\\tauto pre = ret;\\n\\t\\t\\tret.assign(r, 0);\\n\\t\\t\\trep(j, r) {\\n\\t\\t\\t\\tret[j] += under * pre[j];\\n\\t\\t\\t\\tif(j < r - 1) ret[j + 1] += (1 - under) * pre[j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdouble value = accumulate(all(ret), double(0));\\n\\t\\treturn value;\\n\\t};\\n\\n\\tvector<V<double>> pre_calced(r, V<double>(m+1));\\n\\n\\n\\n\\tauto f = [&](int score, vi &abilities, int mult) {\\n\\t\\tconst int n = abilities.size();\\n\\t\\tdouble ret = 0;\\n\\t\\tret += bestthree_prob(score, abilities) * mult;\\n\\t\\tret -= last_prob(score, abilities) * 1;\\n\\t\\treturn ret;\\n\\t};\\n\\n\\trep(i,r ){\\n\\t\\trep(cnt, 0, m+1){\\n\\t\\t\\tpre_calced[i][cnt] = f(cnt *scores.front().at(i), transpose[i], pts[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tauto calc_score = [&](vector<int> &count) -> double {\\n\\t\\tdouble ret = 0;\\n\\t\\t// rep(i, r) {\\n\\t\\t// \\tint sc = count[i] * scores.front().at(i);\\n\\t\\t// \\tret += f(sc, transpose[i], pts[i]);\\n\\t\\t// }\\n\\t\\trep(i,r ){\\n\\t\\t\\tint cnt = count[i];\\n\\t\\t\\tret += pre_calced[i][cnt];\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t};\\n\\n\\tdouble ans = -INF;\\n\\tvector<int> count(r);\\n\\tfor(count[0] = 0; count[0] <= m; count[0]++) {\\n\\t\\tfor(count[1] = 0; count[1] + count[0] <= m; count[1]++) {\\n\\t\\t\\tcount[2] = m - count[0] - count[1];\\n\\t\\t\\tchmax(ans, calc_score(count));\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\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 n;\\n\\twhile(cin >> n) {\\n\\t\\tcout << solve(n) << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -0.4389,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2434_6027754\",\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\\nvector<long double> sub(int n, int m, const vector<long double> &ap,\\n const vector<int> &a, int point) {\\n auto dp = vect(m + 1, (long double)0.0);\\n for (int i = 0; i <= m; i++) {\\n int x = a[0] * i;\\n long double bottom = 1.0;\\n\\n vector<int> needed(n);\\n for (int j = 1; j < n; j++) {\\n needed[j] = min(m + 1, (x + a[j] - 1) / a[j]);\\n bottom *= ap[needed[j]];\\n }\\n\\n auto ep = vect(n + 1, vect(3, (long double)0.0));\\n ep[1][0] = 1.0;\\n for (int j = 1; j < n; j++) {\\n for (int k = 0; k < 3; k++) {\\n ep[j + 1][k] += ep[j][k] * (1.0 - ap[needed[j]]);\\n if (k + 1 < 3) ep[j + 1][k + 1] += ep[j][k] * ap[needed[j]];\\n }\\n }\\n dp[i] = (ep[n][0] + ep[n][1] + ep[n][2]) * point - bottom;\\n }\\n return dp;\\n}\\n\\nvoid solve() {\\n int n, m;\\n cin >> n >> m;\\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 auto ap = vect(m + 2, (long double)0.0);\\n ap[0] = 1.0;\\n for (int i = 0; i < m; i++) ap[0] *= 2.0 / 3.0;\\n for (int i = 1; i <= m; i++) { ap[i] = ap[i - 1] / 2.0 * (m - i + 1) / i; }\\n for (int i = m - 1; i >= 0; i--) ap[i] += ap[i + 1];\\n\\n auto dp = sub(n, m, ap, a, 5);\\n auto ep = sub(n, m, ap, b, 3);\\n auto fp = sub(n, m, ap, c, 2);\\n dmp(dp);\\n\\n auto gp = vect(m + 1, (long double)-10.0);\\n for (int i = 0; i <= m; i++) {\\n for (int j = 0; j <= m; j++) {\\n if (i + j > m) break;\\n chmax(gp[i + j], dp[i] + ep[j]);\\n }\\n }\\n\\n long double ans = -10.0;\\n for (int i = 0; i <= m; i++) { chmax(ans, gp[i] + fp[m - i]); }\\n\\n cout << ans << endl;\\n\\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\": 500,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.8942,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2434_6007883\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing PII = pair<ll, ll>;\\nusing T = tuple<int, int, int>;\\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#define ALL(x) x.begin(), x.end()\\n#define POPCOUNT(x) __builtin_popcount(x)\\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\\n\\nconst ll INF = 1LL << 60;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nconst ull MOD = 1e9 + 7;\\n\\n// BEGIN CUT\\nll modpow(ll x, ll y, ll m) {\\n ll a = 1, p = x;\\n while (y > 0) {\\n if (y % 2 == 0) {\\n p = (p * p) % m;\\n y /= 2;\\n } else {\\n a = (a * p) % m;\\n y--;\\n }\\n }\\n return a;\\n}\\n// END CUT\\n\\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }\\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\\n\\nint vi[2000], da[2000], vo[2000];\\ndouble res_vi[2001], res_da[2001], res_vo[2001];\\ndouble prob[2001];\\ndouble dp[2001][2];\\ndouble lose[2001];\\n\\nvoid calc(int n, int m, int *idol, double *result, int wp) {\\n for (int i = 0; i <= m; i++) {\\n int V = idol[0] * i;\\n vector<double> vec(n);\\n for (int j = 1; j < n; j++) {\\n int k = (V + idol[j] - 1) / idol[j];\\n double win = 0;\\n if (k <= m)\\n win = prob[k];\\n vec[j] = win;\\n }\\n dp[0][0] = 1, dp[0][1] = 0;\\n for (int j = 1; j < n; j++) {\\n dp[j][0] = dp[j - 1][0] * (1 - vec[j]);\\n dp[j][1] = dp[j - 1][0] * vec[j] + dp[j - 1][1] * (1 - vec[j]);\\n }\\n lose[n] = 1;\\n for (int j = n - 1; j >= 1; j--) {\\n lose[j] = lose[j + 1] * (1 - vec[j]);\\n }\\n double p = dp[n - 1][0] + dp[n - 1][1];\\n for (int j = 1; j < n; j++) {\\n p += vec[j] * dp[j - 1][1] * lose[j + 1];\\n }\\n result[i] = p * wp;\\n double q = 1;\\n for (int j = 1; j < n; j++)\\n q *= vec[j];\\n result[i] -= q;\\n }\\n}\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n for (int i = 0; i < n; i++)\\n cin >> vi[i] >> da[i] >> vo[i];\\n\\n prob[0] = 1;\\n for (int i = 1; i <= m; i++) {\\n prob[i] = prob[i - 1] * (m - i + 1) / i;\\n prob[i] /= 3;\\n }\\n double tmp = 1;\\n for (int i = m; i >= 0; i--) {\\n prob[i] *= tmp;\\n tmp *= 2.0 / 3.0;\\n }\\n for (int i = m - 1; i >= 0; i--)\\n prob[i] += prob[i + 1];\\n calc(n, m, vi, res_vi, 5);\\n calc(n, m, da, res_da, 3);\\n calc(n, m, vo, res_vo, 2);\\n double ans = -1e9;\\n for (int i = 0; i <= m; i++) {\\n for (int j = 0; i + j <= m; j++) {\\n double sum = res_vi[i] + res_da[j] + res_vo[m - (i + j)];\\n ans = max(ans, sum);\\n }\\n }\\n cout << fixed << setprecision(15) << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3732,\n \"score_of_the_acc\": -0.202,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2434_5968671\",\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 MOD = 1000000007;\\n//constexpr long long MOD = 998244353;\\nconstexpr double EPS = 1e-6;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> N >> M;\\n\\tvector<vector<int>>v(N, vector<int>(3));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < 3; j++) {\\n\\t\\t\\tcin >> v[i][j];\\n\\t\\t}\\n\\t}\\n\\tvector<vector<long double>>p(M + 1, vector<long double>(M + 1));\\n\\tp[0][0] = 1;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tfor (int j = 0; j <= i; j++) {\\n\\t\\t\\tp[i + 1][j + 1] += p[i][j] / 3;\\n\\t\\t\\tp[i + 1][j] += p[i][j] * 2 / 3;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1; i <= M; i++) {\\n\\t\\tfor (int j = M - 1; j >= 0; j--) {\\n\\t\\t\\tp[i][j] += p[i][j + 1];\\n\\t\\t}\\n\\t}\\n\\tint by[] = { 5,3,2 };\\n\\tvector<long double>dp(M + 1);\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tvector<long double>box(M + 1);\\n\\t\\tbox[0] = -1;\\n\\t\\tfor (int j = 1; j <= M; j++) {\\n\\t\\t\\tlong double worst = 1;\\n\\t\\t\\tvector<long double>rank(3);\\n\\t\\t\\trank[0] = 1;\\n\\t\\t\\tfor (int k = 1; k < N; k++) {\\n\\t\\t\\t\\tint num = j * v[0][i];\\n\\t\\t\\t\\tnum = (num + v[k][i] - 1) / v[k][i];\\n\\t\\t\\t\\tlong double q = 0;\\n\\t\\t\\t\\tif (num > M) {\\n\\t\\t\\t\\t\\tq = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tq = p[M][num];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tworst *= q;\\n\\t\\t\\t\\trank[2] = rank[2] * (1 - q) + rank[1] * q;\\n\\t\\t\\t\\trank[1] = rank[1] * (1 - q) + rank[0] * q;\\n\\t\\t\\t\\trank[0] *= 1 - q;\\n\\t\\t\\t//\\tcout << i << \\\" \\\" << j << \\\" \\\" << k << \\\" \\\" << worst << \\\" \\\" << num << endl;\\n\\t\\t\\t}\\n\\t\\t\\tbox[j] -= worst;\\n\\t\\t\\tbox[j] += (rank[0] + rank[1] + rank[2]) * by[i];\\n\\t\\t}\\n\\t\\tvector<long double>nxdp(M + 1,-5);\\n\\t\\tfor (int j = 0; j <= M; j++) {\\n\\t\\t\\tfor (int k = 0; k + j <= M; k++) {\\n\\t\\t\\t\\tnxdp[j + k] = max(nxdp[j + k], dp[j] + box[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdp = nxdp;\\n\\t}\\n\\tcout << fixed << setprecision(20) << dp.back() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 66260,\n \"score_of_the_acc\": -1.1623,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2434_5949350\",\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()\\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-7;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n 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;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nint main(){\\n int n,m; cin >> n >> m;\\n vvl a(n,vl(3));\\n rep(i,n) rep(j,3) cin >> a[i][j];\\n vl bonus{5,3,2};\\n vector<vd> res(m+1,vd(3,0));\\n vd prob(m+2,0);\\n prob[0] = 1;\\n rep(i,m){\\n vd np(m+2,0);\\n rep(j,m+1){\\n np[j+1] += prob[j] / 3;\\n np[j] += prob[j] * 2 / 3;\\n }\\n swap(prob,np);\\n }\\n for(int i=m-1; i>=0; i--) prob[i] += prob[i+1];\\n rep(i,m+1) rep(j,3){\\n vector<vd> dp(2,vd(4,0));\\n dp[0][0] = 1;\\n double all_lose = 1;\\n REP(k,1,n){\\n rep(l,4) dp[1][l] = 0;\\n int t = (a[0][j]*i+a[k][j]-1) / a[k][j];\\n double p = t<=m ? prob[t] : 0;\\n chmin(p,1);\\n rep(l,4){\\n dp[1][l] += dp[0][l] * (1-p);\\n dp[1][min(3,l+1)] += dp[0][l] * p;\\n }\\n all_lose *= p;\\n swap(dp[0],dp[1]);\\n }\\n res[i][j] = (dp[0][0]+dp[0][1]+dp[0][2]) * bonus[j] - all_lose;\\n }\\n double ans = -inf;\\n rep(i,m+1) rep(j,m+1){\\n if(i+j>m) break;\\n int k = m-i-j;\\n chmax(ans, res[i][0] + res[j][1] + res[k][2]);\\n }\\n printf(\\\"%.10f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3788,\n \"score_of_the_acc\": -0.2756,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2434_5892631\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define ALL(A) A.begin(),A.end()\\nusing namespace std;\\nnamespace BIN101{\\nusing ll=long long int;\\n//using Int=__int128;\\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;}\\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\\n//→ ↓ ← ↑ \\n//int dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\\n//右上から時計回り\\nint dx[8]={1,1,0,-1,-1,-1,0,+1}, dy[8]={0,1,1,1,0,-1,-1,-1};\\nlong double EPS = 1e-6;\\nlong double PI = acos(-1);\\nconst ll INF=numeric_limits<ll>::max()/3;\\nconst int MAX=numeric_limits<int>::max()/3;\\nconstexpr ll MOD=1000000000+7;\\n//constexpr ll MOD=998244353;\\nvector<ll> ten(18+1);\\n\\n\\ninline void bin101(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n ten[0]=1;\\n for(int i=1;i<=18;i++) ten[i]=ten[i-1]*10;\\n}\\n\\nusing pii=pair<int,int>;\\nusing pil=pair<int,ll>;\\nusing pli=pair<ll,int>;\\nusing pll=pair<ll,ll>;\\nusing psi=pair<string,int>;\\nusing pis=pair<int,string>;\\nusing psl=pair<string,ll>;\\nusing pls=pair<ll,string>;\\nusing pss=pair<string,string>;\\n\\nusing Graph=vector<vector<int>>;\\n\\ntemplate<typename T >\\nstruct edge {\\n\\tint to;\\n\\tT cost;\\n\\tedge()=default;\\n\\tedge(int to, T cost) : to(to), cost(cost) {}\\n\\n};\\ntemplate<typename T>\\nusing WeightGraph=vector<vector<edge<T>>>;\\n\\ntemplate<typename T>\\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n T cost;\\n cin>>s>>t>>cost;\\n if(index1) s--,t--;\\n g[s].emplace_back(t,cost);\\n if(not directed) g[t].emplace_back(s,cost);\\n }\\n}\\n\\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n cin>>s>>t;\\n if(index1) s--,t--;\\n g[s].push_back(t);\\n if(not directed) g[t].push_back(s);\\n }\\n}\\n\\n\\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<T> &v) {\\n for(size_t i=0;i<v.size();i++) is>>v[i];\\n\\treturn is;\\n}\\n \\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n is>>v[i];\\n }\\n return is;\\n}\\n//vector cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\\n for(size_t i=0;i<v.size();i++){\\n if(i) os<<\\\" \\\";\\n os<<v[i];\\n }\\n return os;\\n}\\n//vector<vector> cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n os<<v[i];\\n if(i+1!=v.size()) os<<\\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\n//Graph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const Graph &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(int to:g[i]){\\n os<<i<<\\\"->\\\"<<to<<\\\" \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n//WeightGraph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n os<<i<<\\\"->\\\"<<e.to<<\\\"(\\\"<<e.cost<<\\\") \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n\\treturn vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n\\tauto v=vmake(args...);\\n\\treturn vector<decltype(v)>(n,move(v));\\n}\\n\\n//pair cout\\ntemplate<typename T, typename U>\\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\\n\\tos<<p.first<<\\\" \\\"<<p.second;\\n\\treturn os;\\n}\\n \\n//pair cin\\ntemplate<typename T, typename U>\\ninline istream &operator>>(istream &is,pair<T,U> &p) {\\n\\tis>>p.first>>p.second;\\n\\treturn is;\\n}\\n \\n//ソート\\ntemplate<typename T>\\ninline void vsort(vector<T> &v){\\n sort(v.begin(),v.end());\\n}\\n \\n//逆順ソート\\ntemplate<typename T>\\ninline void rvsort(vector<T> &v){\\n\\tsort(v.rbegin(),v.rend());\\n}\\n\\n//1ビットの数を返す\\ninline int popcount(int x){\\n\\treturn __builtin_popcount(x);\\n}\\n//1ビットの数を返す\\ninline int popcount(ll x){\\n\\treturn __builtin_popcountll(x);\\n}\\ntemplate<typename T>\\ninline void Compress(vector<T> &C){\\n sort(C.begin(),C.end());\\n C.erase(unique(C.begin(),C.end()),C.end());\\n}\\ntemplate<typename T>\\ninline int lower_idx(const vector<T> &C,T value){\\n return lower_bound(C.begin(),C.end(),value)-C.begin();\\n}\\ntemplate<typename T>\\ninline int upper_idx(const vector<T> &C,T value){\\n return upper_bound(C.begin(),C.end(),value)-C.begin();\\n}\\n//時計回りに90度回転\\ntemplate<typename T>\\ninline void rotate90(vector<vector<T>> &C){\\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\\n for(int h=0;h<C.size();h++){\\n for(int w=0;w<C[h].size();w++){\\n D[w][C.size()-1-h]=C[h][w];\\n }\\n }\\n C=D;\\n}\\n//補グラフを返す\\n//i→iのような辺は加えない\\nGraph ComplementGraph(const Graph &g){\\n size_t sz=g.size();\\n bool used[sz][sz];\\n fill(used[0],used[sz],false);\\n for(size_t i=0;i<sz;i++){\\n for(int to:g[i]){\\n used[i][to]=true;\\n }\\n }\\n Graph ret(sz);\\n for(size_t i=0;i<sz;i++){\\n for(size_t j=0;j<sz;j++){\\n if(used[i][j]) continue;\\n if(i==j) continue;\\n ret[i].push_back(j);\\n }\\n }\\n return ret;\\n}\\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\\n//無効グラフのみに対応\\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\\n vector<Graph> ret;\\n vector<int> now;\\n for(size_t i=0;i<g.size();i++){\\n if(id[i].first!=-1) continue;\\n id[i].first=ret.size();\\n id[i].second=0;\\n now.push_back(i);\\n for(size_t j=0;j<now.size();j++){\\n for(int to:g[now[j]]){\\n if(id[to].first==-1){\\n id[to].first=ret.size();\\n id[to].second=now.size();\\n now.push_back(to);\\n }\\n }\\n }\\n Graph r(now.size());\\n for(size_t j=0;j<now.size();j++){\\n r[j]=g[now[j]];\\n for(int &to:r[j]){\\n to=id[to].second;\\n }\\n }\\n ret.push_back(r);\\n now.clear();\\n }\\n return make_pair(ret,id);\\n}\\n//0indexを想定\\nbool OutGrid(ll h,ll w,ll H,ll W){\\n return (h>=H or w>=W or h<0 or w<0);\\n}\\n\\nvoid NO(){\\n cout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n}\\nvoid YES(){\\n cout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n}\\nvoid No(){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n}\\nvoid Yes(){\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n}\\nnamespace overflow{\\n template<typename T>\\n T max(){\\n return numeric_limits<T>::max();\\n }\\n template<typename T>\\n T ADD(T a,T b){\\n T res;\\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\\n }\\n template<typename T>\\n T MUL(T a,T b){\\n T res;\\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\\n }\\n};\\nusing namespace overflow;\\nstruct ModInt{\\n using u64=uint_fast64_t;\\n u64 a;\\n constexpr ModInt() :a(0){}\\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\\n\\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\\n return ModInt(*this)+=rhs;\\n }\\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\\n return ModInt(*this)-=rhs;\\n }\\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\\n return ModInt(*this)*=rhs;\\n }\\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\\n return ModInt(*this)/=rhs;\\n }\\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\\n return ModInt(*this)+=ModInt(rhs);\\n }\\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\\n return ModInt(*this)-=ModInt(rhs);\\n }\\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\\n return ModInt(*this)*=ModInt(rhs);\\n }\\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\\n return ModInt(*this)/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\\n a+=rhs.a;\\n if(a>=MOD) a-=MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\\n if(rhs.a>a) a+=MOD;\\n a-=rhs.a;\\n return *this;\\n }\\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\\n a=(a*rhs.a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\\n a=(a*rhs.inverse().a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\\n return *this+=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\\n return *this-=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\\n return *this*=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\\n return *this/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt operator=(const ll x)noexcept{\\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\\n return *this;\\n }\\n\\n inline constexpr bool operator==(const ModInt p)const noexcept{\\n return a==p.a;\\n }\\n\\n inline constexpr bool operator!=(const ModInt p)const noexcept{\\n return a!=p.a;\\n }\\n\\n inline constexpr ModInt pow(ll N) const noexcept{\\n ModInt ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline constexpr ModInt inverse() const noexcept{\\n return pow(MOD-2);\\n }\\n\\n};\\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)+=b;\\n}\\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)-=b;\\n}\\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)*=b;\\n}\\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const ModInt &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,ModInt &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\n\\nstruct Binominal{\\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\\n int sz;\\n Binominal(int n=10) :sz(1){\\n if(n<=0) n=10;\\n init(n);\\n }\\n inline void init(int n){\\n fac.resize(n+1,1);\\n finv.resize(n+1,1);\\n inv.resize(n+1,1);\\n for(int i=sz+1;i<=n;i++){\\n fac[i]=fac[i-1]*i;\\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\\n finv[i]=finv[i-1]*inv[i];\\n }\\n sz=n;\\n }\\n //nCk(n,k<=N) をO(1)で求める\\n inline ModInt com(int n,int k){\\n if(k==0 or k==n) return 1;\\n if(n<k) return ModInt(0);\\n if(n<0 || k<0) return ModInt(0);\\n if(n>sz) init(n);\\n return fac[n]*finv[k]*finv[n-k];\\n }\\n //nCk(k<=N) をO(k) で求める \\n inline ModInt rcom(ll n,int k){\\n if(n<0 || k<0 || n<k) return ModInt(0);\\n if(k>sz) init(k);\\n ModInt ret(1);\\n for(int i=0;i<k;i++){\\n ret*=n-i;\\n }\\n ret*=finv[k];\\n return ret;\\n }\\n\\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\\n //〇がn個,|がk個\\n inline ModInt h(int n,int k){\\n return com(n+k-1,k);\\n }\\n //power[N+1] (power[i]=x^i)を返す\\n static vector<ModInt> MakePower(ll x,int N){\\n vector<ModInt> ret(N+1);\\n ret[0]=1;\\n for(int i=1;i<=N;i++){\\n ret[i]=ret[i-1]*x;\\n }\\n return ret;\\n }\\n};\\nvector<int> Subset(int S,bool zero=false,bool full=false){\\n vector<int> ret;\\n int now=(S-1)&S;\\n if(full and S){\\n ret.push_back(S);\\n }\\n do{\\n ret.push_back(now);\\n now=(now-1)&S;\\n }while(now!=0);\\n if(zero){\\n ret.push_back(0);\\n }\\n return ret;\\n}\\n\\n//xと差が最小の値を持つ添え字を返す\\n//xはソート済みを想定\\n//1つだけ返す\\ntemplate<typename T>\\ninline int MinimumAbs(vector<T> &v,T x){\\n assert(v.size());\\n auto large=lower_bound(v.begin(),v.end(),x);\\n auto small=large;\\n if(large==v.begin()) return large-v.begin();\\n if(large==v.end()) return v.size()-1;\\n small--;\\n if(abs(*small-x)>abs(*large-x)) small=large;\\n return small-v.begin();\\n}\\n\\n\\nclass modint{\\n using u64=uint_fast64_t;\\n static u64 &mod(){\\n static u64 mod_=0;\\n return mod_;\\n }\\npublic:\\n u64 a;\\n modint(const ll x=0):a((x>=0)?(x%mod()):(x%mod()+mod())){}\\n modint operator+(const modint rhs)const{\\n return modint(*this)+=rhs;\\n }\\n modint operator-(const modint rhs)const{\\n return modint(*this)-=rhs;\\n }\\n modint operator*(const modint rhs)const{\\n return modint(*this)*=rhs;\\n }\\n modint operator/(const modint rhs)const{\\n return modint(*this)/=rhs;\\n }\\n modint &operator+=(const modint rhs){\\n a+=rhs.a;\\n if(a>=mod()) a-=mod();\\n return *this;\\n }\\n modint &operator-=(const modint rhs){\\n if(a<rhs.a) a+=mod();\\n a-=rhs.a;\\n return *this;\\n }\\n modint &operator*=(const modint rhs){\\n a=a*rhs.a%mod();\\n return *this;\\n }\\n modint &operator/=(const modint rhs){\\n a=(a*rhs.inverse().a)%mod();\\n return *this;\\n }\\n inline modint &operator+=(const ll rhs){\\n return *this+=modint(rhs);\\n }\\n inline modint &operator-=(const ll rhs){\\n return *this-=modint(rhs);\\n }\\n inline modint &operator*=(const ll rhs){\\n return *this*=modint(rhs);\\n }\\n inline modint &operator/=(const ll rhs){\\n return *this/=modint(rhs);\\n }\\n\\n inline modint pow(u64 N)const{\\n modint ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline modint inverse()const{\\n return pow(mod()-2);\\n }\\n inline modint operator=(const ll x){\\n a=(x>=0)?(x%mod()):(x%mod()+mod());\\n return *this;\\n }\\n\\n static void set_mod(const u64 x){mod()=x;}\\n static u64 get_mod(){return mod();}\\n};\\ninline modint operator+(const ll a,const modint b)noexcept{\\n return modint(a)+=b;\\n}\\ninline modint operator-(const ll a,const modint b)noexcept{\\n return modint(a)-=b;\\n}\\ninline modint operator*(const ll a,const modint b)noexcept{\\n return modint(a)*=b;\\n}\\ninline modint operator/(const ll &a,const modint &b)noexcept{\\n return modint(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const modint &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,modint &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\ntemplate<class T>\\nvector<vector<T>> Binominal(int n){\\n vector<vector<T>> table(n+1,vector<T>(n+1,0));\\n table[0][0]=1;\\n for(int i=1;i<=n;i++){\\n table[i][0]=1;\\n for(int j=1;j<=i;j++){\\n table[i][j]=table[i-1][j-1]+table[i-1][j];\\n }\\n }\\n return table;\\n};\\n\\nvoid solve(){\\n int N,M;\\n cin>>N>>M;\\n auto power=vmake(N,3,0);\\n for(int i=0;i<N;i++){\\n for(int j=0;j<3;j++) cin>>power[i][j];\\n }\\n using DD=long double;\\n vector<DD> prob(M+100);\\n auto B=Binominal<DD>(M+100);\\n DD zen=0;\\n for(int a=0;a<=M;a++){\\n for(int b=0;b<=M;b++){\\n if(a+b>M) continue;\\n zen+=B[M][a]*B[M-a][b];\\n }\\n }\\n for(int i=M;i>=0;i--){\\n if(i!=M) prob[i]=prob[i+1];\\n for(int j=0;j+i<=M;j++){\\n prob[i]+=B[M][i]*B[M-i][j]/zen;\\n }\\n }\\n auto point=vmake(3,M+1,(DD)0);\\n for(int i=0;i<3;i++){\\n for(int m=0;m<=M;m++){\\n DD sai=1.0;\\n auto dp=vmake(3,(DD)0);\\n dp[0]=1;\\n int p=power[0][i]*m;\\n for(int k=1;k<N;k++){\\n //負ける確率を求める\\n int tp=power[k][i];\\n int cnt=(p+tp-1)/tp;\\n DD pb=0;\\n if(cnt<=M) pb=prob[cnt];\\n sai*=pb;\\n for(int j=2;j>=0;j--){\\n if(j<=1) dp[j+1]+=dp[j]*pb;\\n dp[j]=dp[j]*(1-pb);\\n }\\n }\\n DD ret=0;\\n ret+=sai*(-1);\\n DD x=5;\\n if(i==1) x=3;\\n else if(i==2) x=2;\\n ret+=x*(dp[0]+dp[1]+dp[2]);\\n point[i][m]=ret;\\n }\\n }\\n DD ans=-MAX;\\n for(int a=0;a<=M;a++){\\n for(int b=0;b<=M;b++){\\n if(a+b>M) continue;\\n chmax(ans,point[0][a]+point[1][b]+point[2][M-a-b]);\\n }\\n }\\n cout<<ans<<endl;\\n}\\n\\n};\\n\\nint main(){\\n BIN101::bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) BIN101::solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 72632,\n \"score_of_the_acc\": -1.3455,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2434_5892622\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define ALL(A) A.begin(),A.end()\\nusing namespace std;\\nnamespace BIN101{\\nusing ll=long long int;\\n//using Int=__int128;\\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;}\\ntemplate<typename T> constexpr int bitUP(T x,int a){return (x>>a)&1;}\\n//→ ↓ ← ↑ \\n//int dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0};\\n//右上から時計回り\\nint dx[8]={1,1,0,-1,-1,-1,0,+1}, dy[8]={0,1,1,1,0,-1,-1,-1};\\nlong double EPS = 1e-6;\\nlong double PI = acos(-1);\\nconst ll INF=numeric_limits<ll>::max()/3;\\nconst int MAX=numeric_limits<int>::max()/3;\\nconstexpr ll MOD=1000000000+7;\\n//constexpr ll MOD=998244353;\\nvector<ll> ten(18+1);\\n\\n\\ninline void bin101(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(20);\\n ten[0]=1;\\n for(int i=1;i<=18;i++) ten[i]=ten[i-1]*10;\\n}\\n\\nusing pii=pair<int,int>;\\nusing pil=pair<int,ll>;\\nusing pli=pair<ll,int>;\\nusing pll=pair<ll,ll>;\\nusing psi=pair<string,int>;\\nusing pis=pair<int,string>;\\nusing psl=pair<string,ll>;\\nusing pls=pair<ll,string>;\\nusing pss=pair<string,string>;\\n\\nusing Graph=vector<vector<int>>;\\n\\ntemplate<typename T >\\nstruct edge {\\n\\tint to;\\n\\tT cost;\\n\\tedge()=default;\\n\\tedge(int to, T cost) : to(to), cost(cost) {}\\n\\n};\\ntemplate<typename T>\\nusing WeightGraph=vector<vector<edge<T>>>;\\n\\ntemplate<typename T>\\nvoid CinGraph(int M,WeightGraph<T> &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n T cost;\\n cin>>s>>t>>cost;\\n if(index1) s--,t--;\\n g[s].emplace_back(t,cost);\\n if(not directed) g[t].emplace_back(s,cost);\\n }\\n}\\n\\nvoid CinGraph(int M,Graph &g,bool directed=false,bool index1=true){\\n while(M--){\\n int s,t;\\n cin>>s>>t;\\n if(index1) s--,t--;\\n g[s].push_back(t);\\n if(not directed) g[t].push_back(s);\\n }\\n}\\n\\n\\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<T> &v) {\\n for(size_t i=0;i<v.size();i++) is>>v[i];\\n\\treturn is;\\n}\\n \\n//0-indexed vector cin\\ntemplate<typename T>\\ninline istream &operator>>(istream &is,vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n is>>v[i];\\n }\\n return is;\\n}\\n//vector cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<T> &v) {\\n for(size_t i=0;i<v.size();i++){\\n if(i) os<<\\\" \\\";\\n os<<v[i];\\n }\\n return os;\\n}\\n//vector<vector> cout\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const vector<vector<T>> &v) {\\n for(size_t i=0;i<v.size();i++){\\n os<<v[i];\\n if(i+1!=v.size()) os<<\\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\n//Graph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const Graph &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(int to:g[i]){\\n os<<i<<\\\"->\\\"<<to<<\\\" \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n//WeightGraph out\\ntemplate<typename T>\\ninline ostream &operator<<(ostream &os,const WeightGraph<T> &g) {\\n for(size_t i=0;i<g.size();i++){\\n for(auto e:g[i]){\\n os<<i<<\\\"->\\\"<<e.to<<\\\"(\\\"<<e.cost<<\\\") \\\";\\n }\\n os<<endl;\\n }\\n return os;\\n}\\n\\n\\n//要素数n 初期値x\\ntemplate<typename T>\\ninline vector<T> vmake(size_t n,T x){\\n\\treturn vector<T>(n,x);\\n}\\n\\n//a,b,c,x data[a][b][c] 初期値x\\ntemplate<typename... Args>\\nauto vmake(size_t n,Args... args){\\n\\tauto v=vmake(args...);\\n\\treturn vector<decltype(v)>(n,move(v));\\n}\\n\\n//pair cout\\ntemplate<typename T, typename U>\\ninline ostream &operator<<(ostream &os,const pair<T,U> &p) {\\n\\tos<<p.first<<\\\" \\\"<<p.second;\\n\\treturn os;\\n}\\n \\n//pair cin\\ntemplate<typename T, typename U>\\ninline istream &operator>>(istream &is,pair<T,U> &p) {\\n\\tis>>p.first>>p.second;\\n\\treturn is;\\n}\\n \\n//ソート\\ntemplate<typename T>\\ninline void vsort(vector<T> &v){\\n sort(v.begin(),v.end());\\n}\\n \\n//逆順ソート\\ntemplate<typename T>\\ninline void rvsort(vector<T> &v){\\n\\tsort(v.rbegin(),v.rend());\\n}\\n\\n//1ビットの数を返す\\ninline int popcount(int x){\\n\\treturn __builtin_popcount(x);\\n}\\n//1ビットの数を返す\\ninline int popcount(ll x){\\n\\treturn __builtin_popcountll(x);\\n}\\ntemplate<typename T>\\ninline void Compress(vector<T> &C){\\n sort(C.begin(),C.end());\\n C.erase(unique(C.begin(),C.end()),C.end());\\n}\\ntemplate<typename T>\\ninline int lower_idx(const vector<T> &C,T value){\\n return lower_bound(C.begin(),C.end(),value)-C.begin();\\n}\\ntemplate<typename T>\\ninline int upper_idx(const vector<T> &C,T value){\\n return upper_bound(C.begin(),C.end(),value)-C.begin();\\n}\\n//時計回りに90度回転\\ntemplate<typename T>\\ninline void rotate90(vector<vector<T>> &C){\\n vector<vector<T>> D(C[0].size(),vector<T>(C.size()));\\n for(int h=0;h<C.size();h++){\\n for(int w=0;w<C[h].size();w++){\\n D[w][C.size()-1-h]=C[h][w];\\n }\\n }\\n C=D;\\n}\\n//補グラフを返す\\n//i→iのような辺は加えない\\nGraph ComplementGraph(const Graph &g){\\n size_t sz=g.size();\\n bool used[sz][sz];\\n fill(used[0],used[sz],false);\\n for(size_t i=0;i<sz;i++){\\n for(int to:g[i]){\\n used[i][to]=true;\\n }\\n }\\n Graph ret(sz);\\n for(size_t i=0;i<sz;i++){\\n for(size_t j=0;j<sz;j++){\\n if(used[i][j]) continue;\\n if(i==j) continue;\\n ret[i].push_back(j);\\n }\\n }\\n return ret;\\n}\\n//グラフの分解 secondはある頂点がどこに対応するか id[i]={2,3}のとき,頂点iはret[2][3]に対応\\n//無効グラフのみに対応\\npair<vector<Graph>,vector<pair<int,int>>> GraphDecomposition(const Graph &g){\\n vector<pair<int,int>> id(g.size(),pair<int,int>(-1,-1));\\n vector<Graph> ret;\\n vector<int> now;\\n for(size_t i=0;i<g.size();i++){\\n if(id[i].first!=-1) continue;\\n id[i].first=ret.size();\\n id[i].second=0;\\n now.push_back(i);\\n for(size_t j=0;j<now.size();j++){\\n for(int to:g[now[j]]){\\n if(id[to].first==-1){\\n id[to].first=ret.size();\\n id[to].second=now.size();\\n now.push_back(to);\\n }\\n }\\n }\\n Graph r(now.size());\\n for(size_t j=0;j<now.size();j++){\\n r[j]=g[now[j]];\\n for(int &to:r[j]){\\n to=id[to].second;\\n }\\n }\\n ret.push_back(r);\\n now.clear();\\n }\\n return make_pair(ret,id);\\n}\\n//0indexを想定\\nbool OutGrid(ll h,ll w,ll H,ll W){\\n return (h>=H or w>=W or h<0 or w<0);\\n}\\n\\nvoid NO(){\\n cout<<\\\"NO\\\"<<\\\"\\\\n\\\";\\n}\\nvoid YES(){\\n cout<<\\\"YES\\\"<<\\\"\\\\n\\\";\\n}\\nvoid No(){\\n cout<<\\\"No\\\"<<\\\"\\\\n\\\";\\n}\\nvoid Yes(){\\n cout<<\\\"Yes\\\"<<\\\"\\\\n\\\";\\n}\\nnamespace overflow{\\n template<typename T>\\n T max(){\\n return numeric_limits<T>::max();\\n }\\n template<typename T>\\n T ADD(T a,T b){\\n T res;\\n return __builtin_add_overflow(a,b,&res)?max<T>():res;\\n }\\n template<typename T>\\n T MUL(T a,T b){\\n T res;\\n return __builtin_mul_overflow(a,b,&res)?max<T>():res;\\n }\\n};\\nusing namespace overflow;\\nstruct ModInt{\\n using u64=uint_fast64_t;\\n u64 a;\\n constexpr ModInt() :a(0){}\\n constexpr ModInt(ll x) :a((x>=0)?(x%MOD):(x%MOD+MOD) ) {}\\n\\n inline constexpr ModInt operator+(const ModInt rhs)const noexcept{\\n return ModInt(*this)+=rhs;\\n }\\n inline constexpr ModInt operator-(const ModInt rhs)const noexcept{\\n return ModInt(*this)-=rhs;\\n }\\n inline constexpr ModInt operator*(const ModInt rhs)const noexcept{\\n return ModInt(*this)*=rhs;\\n }\\n inline constexpr ModInt operator/(const ModInt rhs)const noexcept{\\n return ModInt(*this)/=rhs;\\n }\\n inline constexpr ModInt operator+(const ll rhs) const noexcept{\\n return ModInt(*this)+=ModInt(rhs);\\n }\\n inline constexpr ModInt operator-(const ll rhs)const noexcept{\\n return ModInt(*this)-=ModInt(rhs);\\n }\\n inline constexpr ModInt operator*(const ll rhs)const noexcept{\\n return ModInt(*this)*=ModInt(rhs);\\n }\\n inline constexpr ModInt operator/(const ll rhs)const noexcept{\\n return ModInt(*this)/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt &operator+=(const ModInt rhs)noexcept{\\n a+=rhs.a;\\n if(a>=MOD) a-=MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator-=(const ModInt rhs)noexcept{\\n if(rhs.a>a) a+=MOD;\\n a-=rhs.a;\\n return *this;\\n }\\n inline constexpr ModInt &operator*=(const ModInt rhs)noexcept{\\n a=(a*rhs.a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator/=(ModInt rhs)noexcept{\\n a=(a*rhs.inverse().a)%MOD;\\n return *this;\\n }\\n inline constexpr ModInt &operator+=(const ll rhs)noexcept{\\n return *this+=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator-=(const ll rhs)noexcept{\\n return *this-=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator*=(const ll rhs)noexcept{\\n return *this*=ModInt(rhs);\\n }\\n inline constexpr ModInt &operator/=(const ll rhs)noexcept{\\n return *this/=ModInt(rhs);\\n }\\n\\n inline constexpr ModInt operator=(const ll x)noexcept{\\n a=(x>=0)?(x%MOD):(x%MOD+MOD);\\n return *this;\\n }\\n\\n inline constexpr bool operator==(const ModInt p)const noexcept{\\n return a==p.a;\\n }\\n\\n inline constexpr bool operator!=(const ModInt p)const noexcept{\\n return a!=p.a;\\n }\\n\\n inline constexpr ModInt pow(ll N) const noexcept{\\n ModInt ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline constexpr ModInt inverse() const noexcept{\\n return pow(MOD-2);\\n }\\n\\n};\\ninline constexpr ModInt operator+(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)+=b;\\n}\\ninline constexpr ModInt operator-(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)-=b;\\n}\\ninline constexpr ModInt operator*(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)*=b;\\n}\\ninline constexpr ModInt operator/(const ll &a,const ModInt &b)noexcept{\\n return ModInt(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const ModInt &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,ModInt &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\n\\nstruct Binominal{\\n vector<ModInt> fac,finv,inv; //fac[n]:n! finv:(n!)の逆元\\n int sz;\\n Binominal(int n=10) :sz(1){\\n if(n<=0) n=10;\\n init(n);\\n }\\n inline void init(int n){\\n fac.resize(n+1,1);\\n finv.resize(n+1,1);\\n inv.resize(n+1,1);\\n for(int i=sz+1;i<=n;i++){\\n fac[i]=fac[i-1]*i;\\n inv[i]=MOD-inv[MOD%i]*(MOD/i);\\n finv[i]=finv[i-1]*inv[i];\\n }\\n sz=n;\\n }\\n //nCk(n,k<=N) をO(1)で求める\\n inline ModInt com(int n,int k){\\n if(k==0 or k==n) return 1;\\n if(n<k) return ModInt(0);\\n if(n<0 || k<0) return ModInt(0);\\n if(n>sz) init(n);\\n return fac[n]*finv[k]*finv[n-k];\\n }\\n //nCk(k<=N) をO(k) で求める \\n inline ModInt rcom(ll n,int k){\\n if(n<0 || k<0 || n<k) return ModInt(0);\\n if(k>sz) init(k);\\n ModInt ret(1);\\n for(int i=0;i<k;i++){\\n ret*=n-i;\\n }\\n ret*=finv[k];\\n return ret;\\n }\\n\\n //重複組み合わせ n種類のものから重複を許してk個を選ぶ\\n //〇がn個,|がk個\\n inline ModInt h(int n,int k){\\n return com(n+k-1,k);\\n }\\n //power[N+1] (power[i]=x^i)を返す\\n static vector<ModInt> MakePower(ll x,int N){\\n vector<ModInt> ret(N+1);\\n ret[0]=1;\\n for(int i=1;i<=N;i++){\\n ret[i]=ret[i-1]*x;\\n }\\n return ret;\\n }\\n};\\nvector<int> Subset(int S,bool zero=false,bool full=false){\\n vector<int> ret;\\n int now=(S-1)&S;\\n if(full and S){\\n ret.push_back(S);\\n }\\n do{\\n ret.push_back(now);\\n now=(now-1)&S;\\n }while(now!=0);\\n if(zero){\\n ret.push_back(0);\\n }\\n return ret;\\n}\\n\\n//xと差が最小の値を持つ添え字を返す\\n//xはソート済みを想定\\n//1つだけ返す\\ntemplate<typename T>\\ninline int MinimumAbs(vector<T> &v,T x){\\n assert(v.size());\\n auto large=lower_bound(v.begin(),v.end(),x);\\n auto small=large;\\n if(large==v.begin()) return large-v.begin();\\n if(large==v.end()) return v.size()-1;\\n small--;\\n if(abs(*small-x)>abs(*large-x)) small=large;\\n return small-v.begin();\\n}\\n\\n\\nclass modint{\\n using u64=uint_fast64_t;\\n static u64 &mod(){\\n static u64 mod_=0;\\n return mod_;\\n }\\npublic:\\n u64 a;\\n modint(const ll x=0):a((x>=0)?(x%mod()):(x%mod()+mod())){}\\n modint operator+(const modint rhs)const{\\n return modint(*this)+=rhs;\\n }\\n modint operator-(const modint rhs)const{\\n return modint(*this)-=rhs;\\n }\\n modint operator*(const modint rhs)const{\\n return modint(*this)*=rhs;\\n }\\n modint operator/(const modint rhs)const{\\n return modint(*this)/=rhs;\\n }\\n modint &operator+=(const modint rhs){\\n a+=rhs.a;\\n if(a>=mod()) a-=mod();\\n return *this;\\n }\\n modint &operator-=(const modint rhs){\\n if(a<rhs.a) a+=mod();\\n a-=rhs.a;\\n return *this;\\n }\\n modint &operator*=(const modint rhs){\\n a=a*rhs.a%mod();\\n return *this;\\n }\\n modint &operator/=(const modint rhs){\\n a=(a*rhs.inverse().a)%mod();\\n return *this;\\n }\\n inline modint &operator+=(const ll rhs){\\n return *this+=modint(rhs);\\n }\\n inline modint &operator-=(const ll rhs){\\n return *this-=modint(rhs);\\n }\\n inline modint &operator*=(const ll rhs){\\n return *this*=modint(rhs);\\n }\\n inline modint &operator/=(const ll rhs){\\n return *this/=modint(rhs);\\n }\\n\\n inline modint pow(u64 N)const{\\n modint ans(1LL),p(a);\\n while(N>0){\\n if(bitUP(N,0)){\\n ans*=p;\\n }\\n p*=p;\\n N>>=1;\\n }\\n return ans;\\n }\\n inline modint inverse()const{\\n return pow(mod()-2);\\n }\\n inline modint operator=(const ll x){\\n a=(x>=0)?(x%mod()):(x%mod()+mod());\\n return *this;\\n }\\n\\n static void set_mod(const u64 x){mod()=x;}\\n static u64 get_mod(){return mod();}\\n};\\ninline modint operator+(const ll a,const modint b)noexcept{\\n return modint(a)+=b;\\n}\\ninline modint operator-(const ll a,const modint b)noexcept{\\n return modint(a)-=b;\\n}\\ninline modint operator*(const ll a,const modint b)noexcept{\\n return modint(a)*=b;\\n}\\ninline modint operator/(const ll &a,const modint &b)noexcept{\\n return modint(a)/=b;\\n}\\n//cout\\ninline ostream &operator<<(ostream &os,const modint &p) {\\n return os<<p.a;\\n}\\n\\n//cin\\ninline istream &operator>>(istream &is,modint &p) {\\n ll t;\\n is>>t;\\n p=t;\\n return is;\\n}\\ntemplate<class T>\\nvector<vector<T>> Binominal(int n){\\n vector<vector<T>> table(n+1,vector<T>(n+1,0));\\n table[0][0]=1;\\n for(int i=1;i<=n;i++){\\n table[i][0]=1;\\n for(int j=1;j<=i;j++){\\n table[i][j]=table[i-1][j-1]+table[i-1][j];\\n }\\n }\\n return table;\\n};\\n\\nvoid solve(){\\n int N,M;\\n cin>>N>>M;\\n auto power=vmake(N,3,0);\\n for(int i=0;i<N;i++){\\n for(int j=0;j<3;j++) cin>>power[i][j];\\n }\\n using DD=double;\\n vector<DD> prob(M+100);\\n auto B=Binominal<ll>(M+100);\\n DD zen=0;\\n for(int a=0;a<=M;a++){\\n for(int b=0;b<=M;b++){\\n if(a+b>M) continue;\\n zen+=B[M][a]*B[M-a][b];\\n }\\n }\\n for(int i=M;i>=0;i--){\\n if(i!=M) prob[i]=prob[i+1];\\n for(int j=0;j+i<=M;j++){\\n prob[i]+=B[M][i]*B[M-i][j]/zen;\\n }\\n }\\n auto point=vmake(3,M+1,(DD)0);\\n for(int i=0;i<3;i++){\\n for(int m=0;m<=M;m++){\\n DD sai=1.0;\\n auto dp=vmake(3,(DD)0);\\n dp[0]=1;\\n int p=power[0][i]*m;\\n for(int k=1;k<N;k++){\\n //負ける確率を求める\\n int tp=power[k][i];\\n int cnt=(p+tp-1)/tp;\\n DD pb=0;\\n if(cnt<=M) pb=prob[cnt];\\n sai*=pb;\\n for(int j=2;j>=0;j--){\\n if(j<=1) dp[j+1]+=dp[j]*pb;\\n dp[j]=dp[j]*(1-pb);\\n }\\n }\\n DD ret=0;\\n ret+=sai*(-1);\\n DD x=5;\\n if(i==1) x=3;\\n else if(i==2) x=2;\\n ret+=x*(dp[0]+dp[1]+dp[2]);\\n point[i][m]=ret;\\n }\\n }\\n DD ans=-MAX;\\n for(int a=0;a<=M;a++){\\n for(int b=0;b<=M;b++){\\n if(a+b>M) continue;\\n chmax(ans,point[0][a]+point[1][b]+point[2][M-a-b]);\\n }\\n }\\n cout<<ans<<endl;\\n}\\n\\n};\\n\\nint main(){\\n BIN101::bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) BIN101::solve();\\n}\",\n \"accuracy\": 0.47368421052631576,\n \"time_ms\": 10,\n \"memory_kb\": 12940,\n \"score_of_the_acc\": -0.1354,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2434_5778478\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\nusing namespace std;\\ndouble comb[2001];\\ndouble up[2001];\\nint N,M;\\nint A[3][2000];\\ndouble p[3][2001][2];\\ndouble dp[2000][3];\\nint main()\\n{\\n\\tcin>>N>>M;\\n\\tcomb[0]=1;\\n\\tfor(int i=1;i<=M;i++)\\n\\t{\\n\\t\\tcomb[i]=comb[i-1]*(M+1-i)/i;\\n\\t}\\n\\tfor(int i=0;i<=M;i++)\\n\\t{\\n\\t\\tup[i]=comb[i];\\n\\t\\tfor(int j=i;j<M;j++)up[i]=up[i]*2/3;\\n\\t\\tfor(int j=0;j<i;j++)up[i]/=3;\\n\\t}\\n\\tfor(int i=M;i--;)up[i]+=up[i+1];\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<3;j++)cin>>A[j][i];\\n\\tfor(int I=0;I<3;I++)\\n\\t{\\n\\t\\tfor(int i=0;i<=M;i++)\\n\\t\\t{\\n\\t\\t\\tdp[0][0]=1;\\n\\t\\t\\tdouble all=1;\\n\\t\\t\\tfor(int j=1;j<N;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt=(A[I][0]*i+A[I][j]-1)/A[I][j];\\n\\t\\t\\t\\tdouble np=cnt<=M?up[cnt]:0;\\n\\t\\t\\t\\tdp[j][2]=dp[j-1][2]*(1-np)+dp[j-1][1]*np;\\n\\t\\t\\t\\tdp[j][1]=dp[j-1][1]*(1-np)+dp[j-1][0]*np;\\n\\t\\t\\t\\tdp[j][0]=dp[j-1][0]*(1-np);\\n\\t\\t\\t\\tall*=np;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<3;j++)p[I][i][0]+=dp[N-1][j];\\n\\t\\t\\tp[I][i][1]=all;\\n\\t\\t}\\n\\t}\\n\\tdouble ans=-9e18;\\n\\tfor(int a=0;a<=M;a++)for(int b=0;a+b<=M;b++)\\n\\t{\\n\\t\\tint c=M-a-b;\\n\\t\\tdouble now=p[0][a][0]*5+p[1][b][0]*3+p[2][c][0]*2;\\n\\t\\tnow-=p[0][a][1]+p[1][b][1]+p[2][c][1];\\n\\t\\tif(ans<now)ans=now;\\n\\t}\\n\\tcout<<fixed<<setprecision(16)<<ans<<endl;\\n}\",\n \"accuracy\": 0.5263157894736842,\n \"time_ms\": 20,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.0184,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2434_5774311\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\nusing namespace std;\\nlong double comb[2001];\\nlong double up[2001];\\nint N,M;\\nint A[3][2000];\\nlong double p[3][2001][2];\\nlong double dp[2000][3];\\nint main()\\n{\\n\\tcin>>N>>M;\\n\\tcomb[0]=1;\\n\\tfor(int i=1;i<=M;i++)\\n\\t{\\n\\t\\tcomb[i]=comb[i-1]*(M+1-i)/i;\\n\\t}\\n\\tfor(int i=0;i<=M;i++)\\n\\t{\\n\\t\\tup[i]=comb[i];\\n\\t\\tfor(int j=i;j<M;j++)up[i]=up[i]*2/3;\\n\\t\\tfor(int j=0;j<i;j++)up[i]/=3;\\n\\t}\\n\\tfor(int i=M;i--;)up[i]+=up[i+1];\\n\\tfor(int i=0;i<N;i++)for(int j=0;j<3;j++)cin>>A[j][i];\\n\\tfor(int I=0;I<3;I++)\\n\\t{\\n\\t\\tfor(int i=0;i<=M;i++)\\n\\t\\t{\\n\\t\\t\\tdp[0][0]=1;\\n\\t\\t\\tlong double all=1;\\n\\t\\t\\tfor(int j=1;j<N;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint cnt=(A[I][0]*i+A[I][j]-1)/A[I][j];\\n\\t\\t\\t\\tlong double np=cnt<=M?up[cnt]:0;\\n\\t\\t\\t\\tdp[j][2]=dp[j-1][2]*(1-np)+dp[j-1][1]*np;\\n\\t\\t\\t\\tdp[j][1]=dp[j-1][1]*(1-np)+dp[j-1][0]*np;\\n\\t\\t\\t\\tdp[j][0]=dp[j-1][0]*(1-np);\\n\\t\\t\\t\\tall*=np;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<3;j++)p[I][i][0]+=dp[N-1][j];\\n\\t\\t\\tp[I][i][1]=all;\\n\\t\\t}\\n\\t}\\n\\tlong double ans=-9e18;\\n\\tfor(int a=0;a<=M;a++)for(int b=0;a+b<=M;b++)\\n\\t{\\n\\t\\tint c=M-a-b;\\n\\t\\tlong double now=p[0][a][0]*5+p[1][b][0]*3+p[2][c][0]*2;\\n\\t\\tnow-=p[0][a][1]+p[1][b][1]+p[2][c][1];\\n\\t\\tif(ans<now)ans=now;\\n\\t}\\n\\tcout<<fixed<<setprecision(16)<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3908,\n \"score_of_the_acc\": -0.2228,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2434_5345137\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double INF = 100;\\nint main(){\\n cout << fixed << setprecision(20);\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int>> A(n, vector<int>(3));\\n for (int i = 0; i < n; i++){\\n for (int j = 0; j < 3; j++){\\n cin >> A[i][j];\\n }\\n }\\n vector<vector<double>> P(m + 1, vector<double>(m + 1, 0));\\n P[0][0] = 1;\\n for (int i = 0; i < m; i++){\\n for (int j = 0; j <= i; j++){\\n P[i + 1][j] += P[i][j] / 3 * 2;\\n P[i + 1][j + 1] += P[i][j] / 3;\\n }\\n }\\n vector<double> S(m + 2);\\n S[m + 1] = 0;\\n for (int i = m; i >= 0; i--){\\n S[i] = S[i + 1] + P[m][i];\\n }\\n double ans = 0;\\n vector<int> W = {5, 3, 2};\\n vector<vector<double>> dp(4, vector<double>(m + 1, -INF));\\n dp[0][0] = 0;\\n for (int i = 0; i < 3; i++){\\n vector<vector<double>> dp2(m + 1, vector<double>(4, 0));\\n for (int j = 0; j <= m; j++){\\n dp2[j][0] = 1;\\n dp2[j][3] = 1;\\n }\\n for (int j = 1; j < n; j++){\\n \\tvector<vector<double>> dp3(m + 1, vector<double>(4, 0));\\n for (int k = 0; k <= m; k++){\\n int c = (A[0][i] * k + A[j][i] - 1) / A[j][i];\\n c = min(c, m + 1);\\n double p = S[c];\\n for (int l = 0; l < 3; l++){\\n dp3[k][l] += dp2[k][l] * (1 - p);\\n dp3[k][l + 1] += dp2[k][l] * p;\\n }\\n dp3[k][3] = dp2[k][3] * p;\\n }\\n swap(dp2, dp3);\\n }\\n vector<double> E(m + 1);\\n for (int j = 0; j <= m; j++){\\n E[j] = (dp2[j][0] + dp2[j][1] + dp2[j][2]) * W[i] - dp2[j][3];\\n }\\n for (int j = 0; j <= m; j++){\\n for (int k = 0; k <= m - j; k++){\\n dp[i + 1][j + k] = max(dp[i + 1][j + k], dp[i][j] + E[k]);\\n }\\n }\\n }\\n cout << dp[3][m] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 34676,\n \"score_of_the_acc\": -1.2866,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2434_4972791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> l_l;\\ntypedef pair<int, int> i_i;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\nll N, M;\\nll A[3][2005];\\nll score[3] = {5, 3, 2};\\nlong double calc[2005];\\nlong double P[2005];\\nlong double val[3][2005];\\nlong double logFactorial[5000];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n for(int i = 1; i < 5000; i++) {\\n logFactorial[i] = logFactorial[i-1] + log(i);\\n }\\n cin >> N >> M;\\n for(int i = 0; i <= M; i++) {\\n long double tmp = 0;\\n tmp -= logFactorial[i];\\n tmp -= logFactorial[M-i];\\n tmp += logFactorial[M];\\n tmp -= log(3) * M;\\n tmp += log(2) * (M - i);\\n P[i] = exp(tmp);\\n //cerr << i << \\\" \\\" << P[i] << endl;\\n }\\n for(int i = 0; i < M; i++) {\\n P[i+1] += P[i];\\n }\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < 3; j++) {\\n cin >> A[j][i];\\n }\\n }\\n for(int t = 0; t < 3; t++) {\\n val[t][0] = -1;\\n for(int i = 1; i <= M; i++) {\\n ll a = A[t][0] * i;\\n for(int j = 1; j < N; j++) {\\n ll num = (a - 1) / A[t][j];\\n chmin(num, M);\\n //cerr << t << \\\" \\\" << a << \\\" \\\" << j << \\\" \\\" << num << endl;\\n calc[j] = P[num];\\n //cerr << j << \\\" \\\" << calc[j] << endl;\\n //cerr << num << \\\" \\\" << P[num] << endl;\\n }\\n long double sum = 0;\\n long double powsum = 0;\\n long double prod = 1;\\n long double ALLLOSE = 1;\\n for(int j = 1; j < N; j++) {\\n long double win = calc[j];\\n long double lose = 1 - win;\\n //cerr << win << \\\" \\\" << lose << endl;\\n prod *= win;\\n sum += lose / win;\\n powsum += pow(lose / win, 2);\\n ALLLOSE *= lose;\\n }\\n long double A = (sum * sum - powsum) / 2;\\n //cerr << prod << \\\" \\\" << ALLLOSE << endl;\\n //cerr << A << \\\" \\\" << sum << endl;\\n A += sum;\\n A += 1;\\n val[t][i] = A * prod * score[t] - ALLLOSE;\\n //cerr << t << \\\" \\\" << i << \\\" \\\" << val[t][i] << \\\" \\\" << A * prod << \\\" \\\" << ALLLOSE << endl;\\n }\\n }\\n long double ans = -3;\\n for(int i = 0; i <= M; i++) {\\n for(int j = 0; i + j <= M; j++) {\\n long double tmp = val[0][i] + val[1][j] + val[2][M-i-j];\\n chmax(ans, tmp);\\n }\\n }\\n cout << fixed << setprecision(30) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -0.1882,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2434_4962885\",\n \"code_snippet\": \"#pragma region Macros\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC target(\\\"avx2,avx\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define ll long long\\n#define ld long double\\n#define rep2(i, a, b) for(ll i = a; i <= b; ++i)\\n#define rep(i, n) for(ll i = 0; i < n; ++i)\\n#define rep3(i, a, b) for(ll i = a; i >= b; --i)\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vll vector<ll>\\n#define vpi vector<pii>\\n#define vpll vector<pll>\\n#define overload2(_1, _2, name, ...) name\\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n vector<type> name(size); \\\\\\n IN(name)\\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define VV(type, name, h, w) \\\\\\n vector<vector<type>> name(h, vector<type>(w)); \\\\\\n IN(name)\\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n#define fi first\\n#define se second\\n#define all(c) begin(c), end(c)\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\nusing namespace std;\\nconst string YESNO[2] = {\\\"NO\\\", \\\"YES\\\"};\\nconst string YesNo[2] = {\\\"No\\\", \\\"Yes\\\"};\\nconst string yesno[2] = {\\\"no\\\", \\\"yes\\\"};\\nvoid YES(bool t = 1) { cout << YESNO[t] << endl; }\\nvoid Yes(bool t = 1) { cout << YesNo[t] << endl; }\\nvoid yes(bool t = 1) { cout << yesno[t] << endl; }\\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\\ntemplate <typename T> struct edge {\\n int from, to;\\n T cost;\\n int id;\\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\\n edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}\\n edge &operator=(const int &x) {\\n to = x;\\n return *this;\\n }\\n operator int() const { return to; }\\n};\\ntemplate <typename T> using Edges = vector<edge<T>>;\\n\\nusing Tree = vector<vector<int>>;\\nusing Graph = vector<vector<int>>;\\ntemplate <class T> using Wgraph = vector<vector<edge<T>>>;\\nGraph getG(int n, int m = -1, bool directed = false, int margin = 1) {\\n Tree res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n cin >> a >> b;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b);\\n if(!directed) res[b].emplace_back(a);\\n }\\n return move(res);\\n}\\ntemplate <class T> Wgraph<T> getWg(int n, int m = -1, bool directed = false, int margin = 1) {\\n Wgraph<T> res(n);\\n if(m == -1) m = n - 1;\\n while(m--) {\\n int a, b;\\n T c;\\n cin >> a >> b >> c;\\n a -= margin, b -= margin;\\n res[a].emplace_back(b, c);\\n if(!directed) res[b].emplace_back(a, c);\\n }\\n return move(res);\\n}\\n\\n#define i128 __int128_t\\n#define ull unsigned long long int\\n#define TEST \\\\\\n INT(testcases); \\\\\\n while(testcases--)\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n for(auto &e : v) cout << e << \\\" \\\";\\n cout << endl;\\n return os;\\n}\\ntemplate <class T, class S> ostream &operator<<(ostream &os, const pair<T, S> &p) {\\n cout << \\\"(\\\" << p.fi << \\\", \\\" << p.se << \\\")\\\";\\n return os;\\n}\\ntemplate <class S, class T> string to_string(pair<S, T> p) { return \\\"(\\\" + to_string(p.first) + \\\",\\\" + to_string(p.second) + \\\")\\\"; }\\ntemplate <class A> string to_string(A v) {\\n if(v.empty()) return \\\"{}\\\";\\n string ret = \\\"{\\\";\\n for(auto &x : v) ret += to_string(x) + \\\",\\\";\\n ret.back() = '}';\\n return ret;\\n}\\n\\nvoid dump() { cerr << endl; }\\ntemplate <class Head, class... Tail> void dump(Head head, Tail... tail) {\\n cerr << to_string(head) << \\\" \\\";\\n dump(tail...);\\n}\\n#define endl '\\\\n'\\n#ifdef _LOCAL\\n#undef endl\\n#define debug(x) \\\\\\n cout << #x << \\\": \\\"; \\\\\\n dump(x)\\n#else\\n#define debug(x)\\n#endif\\n// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());\\n\\n// int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }\\n// ll rndll(ll n) { return uniform_int_distribution<ll>(0, n - 1)(rng); }\\n\\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\\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;\\n#define drop(s) cout << #s << endl;\\n#pragma endregion\\n\\nint main() {\\n INT(n, m);\\n n--;\\n VEC(int, a, 3);\\n VV(int, v, n, 3);\\n vector<double> dp = {1};\\n rep(i, m) {\\n vector<double> nxt(si(dp) + 1);\\n rep(j, si(dp)) nxt[j + 1] += dp[j] / 3, nxt[j] += dp[j] * 2 / 3;\\n swap(dp, nxt);\\n }\\n vector<double> rui(m + 2);\\n rep(i, m + 1) rui[i + 1] = rui[i] + dp[i];\\n vv(double, E, m + 1, 3);\\n vi point{5, 3, 2};\\n rep(i, m + 1) {\\n rep(j, 3) {\\n int now = a[j] * i;\\n vec(double, cnt, 4);\\n double last = 1;\\n cnt[0] = 1;\\n rep(k, n) {\\n int ma = ((now % v[k][j]) ? now / v[k][j] : now / v[k][j] - 1);\\n double p = rui[min(m + 1, ma + 1)];\\n last *= (1 - p);\\n vector<double> nxt(4);\\n rep(s, 4) nxt[min((int)s + 1, 3)] += cnt[s] * (1 - p), nxt[s] += cnt[s] * p;\\n swap(nxt, cnt);\\n }\\n E[i][j] -= last;\\n rep(k, 3) E[i][j] += cnt[k] * point[j];\\n }\\n }\\n double ans = -1e15;\\n rep(i, m + 1) {\\n rep(j, m + 1) {\\n if(i + j > m) continue;\\n int k = m - i - j;\\n chmax(ans, E[i][0] + E[j][1] + E[k][2]);\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.4047,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2434_4962793\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(){\\n using T = long double;\\n\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int>> D(n,vector<int>(3));\\n for(int i = 0; i < n; ++i)\\n for(int j = 0; j < 3; ++j)\\n cin >> D[i][j];\\n\\n vector<T> P(m+1);// \\n P[0] = 1;\\n for(int i = 0; i < m; ++i)\\n P[0] *= 2.0/3.0;\\n\\n for(int i = 0; i < m; ++i)\\n P[i+1] = P[i]/2*(m-i)/(i+1);\\n\\n for(int i = m; i > 0; --i)\\n P[i-1] += P[i];\\n\\n const vector<int> pp = {5,3,2};\\n \\n vector<vector<T>> E(3,vector<T>(m+1));\\n for(int i = 0; i < 3; ++i){\\n for(int j = 0; j <= m; ++j){\\n int t = D[0][i]*j;\\n vector<T> p(n-1);\\n T w = 1.0;\\n for(int k = 1; k < n; ++k){\\n int c = (t+D[k][i]-1)/D[k][i];\\n p[k-1] = (c > m ? 0.0 : P[c]);// i が 0 に勝つ確率\\n w *= p[k-1];\\n }\\n E[i][j] -= w;\\n vector<T> dp(3);\\n dp[0] = 1;\\n for(int k = 0; k+1 < n; ++k){\\n vector<T> dp_(3);\\n for(int l = 0; l < 3; ++l){\\n if(l+1 < 3)\\n dp_[l+1] += dp[l]*p[k];\\n dp_[l] += dp[l]*(1-p[k]);\\n }\\n swap(dp,dp_);\\n }\\n for(int k = 0; k < 3; ++k)// 順位 (0-indexed)\\n E[i][j] += pp[i]*dp[k];\\n }\\n }\\n\\n const T INF = 100, EPS = 1e-8;\\n vector<T> dp(m+1,-INF);\\n dp[0] = 0;\\n for(int i = 0; i < 3; ++i){\\n vector<T> dp_(m+1,-INF);\\n for(int j = 0; j <= m; ++j){\\n if(dp[j] <= -INF+EPS) continue;\\n for(int k = 0; k <= m; ++k){\\n if(j+k > m) break;\\n if(E[i][k] <= -INF+EPS) continue;\\n dp_[j+k] = max<T>(dp_[j+k],dp[j]+E[i][k]);\\n }\\n }\\n swap(dp,dp_);\\n }\\n assert(dp[m] >= -3.0-EPS);\\n dp[m] = max<T>(dp[m],-3.0);\\n cout << fixed << setprecision(12) << dp[m] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1398,"cells":{"group_id":{"kind":"string","value":"aoj_2437_cpp"},"problem_description":{"kind":"string","value":"問題名 DNA\n遺伝子は、\nA\n,\nT\n,\nG\n,\nC\nからなる文字列です。\nこの世界の遺伝子は奇妙なことに、ある構文規則に従うことが知られています。\n構文規則は、次のような形で与えられます。\n非終端記号1: 記号1_1 記号1_2 ... 記号1_n1\n非終端記号2: 記号2_1 記号2_2 ... 記号2_n2\n...\n非終端記号m: 記号m_1 記号m_2 ... 記号m_nm\n記号は非終端記号または終端記号のどちらかです。\n非終端記号は小文字文字列で表され、終端記号は\nA\n,\nT\n,\nG\n,\nC\nのうちのいくつかの文字が、\"\n[\n\"と\"\n]\n\"に囲まれた文字列で表されます。\n構文規則の例は次のようになります。\ndna: a a b b\na: [AT]\nb: [GC]\n\"\n非終端記号i: 記号i_1 記号i_2 ... 記号i_ni\n\" を非終端記号\ni\nのルールと呼び、ルールは、構文規則に現れる各非終端記号に対して、ちょうど 1 つづつ存在します。\n文字列\ns\nが非終端記号\ni\nに「\nマッチする\n」とは、\ns = s\n1\n+ s\n2\n+ ... + s\nni\nとなるような\ns\nの部分文字列\n{s\nj\n}\nが存在し、\ns\nj\n(\n1 ≤ j ≤ n\ni\n)がルール内の記号\nj\nにマッチすることをいいます。\n文字列\ns\nが終端記号に「\nマッチする\n」とは、文字列が 1 文字からなり、その文字が終端記号を表す文字列に含まれることをいいます。\n文字列が構文規則に従うとは、非終端記号\n1\nにその文字列がマッチすることをいいます。\nルール\ni\nは、記号のうちに、非終端記号\nj\n(\nj ≤ i\n) を含みません。\n構文規則と、4つの整数\nNa\n,\nNt\n,\nNg\n,\nNc\nが与えられます。\n構文規則に従い、A をちょうど\nNa\n個、T をちょうど\nNt\n個、G をちょうど\nNg\n個、C をちょうど\nNc\n個含むような遺伝子の総数を 1,000,000,007 で割った余りを求めなさい。\nInput\nNa\nNt\nNg\nNc\nm\n非終端記号1: 記号\n1\n1\n記号\n1\n2\n... 記号\n1\nn1\n非終端記号2: 記号\n2\n1\n記号\n2\n2\n... 記号\n2\nn2\n...\n非終端記号\nm\n: 記号\nm\n1\n記号\nm\n2\n... 記号\nm\nnm\n0 ≤ Na, Nt, Ng, Nc ≤ 50\n1 ≤ m ≤ 50\n1 ≤ ni ≤ 10\n1 ≤\n記号を表す文字列の長さ\n≤ 20\n(※記号にマッチする文字列の長さではないことに注意)\nOutput\n総数を 1,000,000,007 で割った余り\nSample Input 1\n1 0 1 0\n3\ndna: a b\na: [AT]\nb: [GC]\nOutput for the Sample Input 1\n1\n\"AG\"の一つです。\nSample Input 2\n1 1 1 2\n1\nk: [ATG] [ATG] [ATG] [C] [C]\nOutput for the Sample Input 2\n6\n\"ATGCC\", \"AGTCC\", \"TAGCC\", \"TGACC\", \"GATCC\", \"GTACC\"の6つです。\nSample Input 3\n3 1 1 1\n3\ninv: at b b b\nat: [ATG] b\nb: [C]\nOutput for the Sample Input 3\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2437_9582362","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 A[4], N;\nmap<string,int> mp;\nvector<vector<string>> S;\nvector<string> C;\n\nvoid DFS(int X) {\n rep(i,0,S[X].size()) {\n if (S[X][i][0] == '[') C.push_back(S[X][i]);\n else DFS(mp[S[X][i]]);\n }\n}\n\nint main() {\n cin >> A[0] >> A[1] >> A[2] >> A[3] >> N;\n S.resize(N);\n vector<string> U;\n string s;\n while(cin >> s) {\n U.push_back(s);\n }\n int Cur = -1;\n rep(i,0,U.size()) {\n if (U[i].back() == ':') {\n Cur++;\n mp[U[i].substr(0,U[i].size()-1)] = Cur;\n }\n else S[Cur].push_back(U[i]);\n }\n vector<ll> L(N,0);\n rrep(i,0,N) {\n rep(j,0,S[i].size()) {\n if (S[i][j][0] == '[') L[i]++;\n else L[i] += L[mp[S[i][j]]];\n chmin(L[i],(ll)inf);\n }\n }\n if (L[0] != A[0]+A[1]+A[2]+A[3]) {\n cout << 0 << endl;\n return 0;\n }\n static ll DP[51][51][51][51] = {};\n DP[0][0][0][0] = 1;\n DFS(0);\n rep(s,0,C.size()) {\n rep(i,0,51) {\n rep(j,0,51) {\n rep(k,0,51) {\n int l = s-i-j-k;\n if (l < 0) break;\n DP[i][j][k][l] %= 1000000007;\n string T = C[s];\n rep(m,1,T.size()-1) {\n if (T[m] == 'A' && i < 50) DP[i+1][j][k][l] += DP[i][j][k][l];\n if (T[m] == 'T' && j < 50) DP[i][j+1][k][l] += DP[i][j][k][l];\n if (T[m] == 'G' && k < 50) DP[i][j][k+1][l] += DP[i][j][k][l];\n if (T[m] == 'C' && l < 50) DP[i][j][k][l+1] += DP[i][j][k][l];\n }\n }\n }\n }\n }\n cout << DP[A[0]][A[1]][A[2]][A[3]] % 1000000007 << endl;\n}","accuracy":1,"time_ms":340,"memory_kb":56364,"score_of_the_acc":-0.6498,"final_rank":11},{"submission_id":"aoj_2437_9004273","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 Na = in(), Nt = in(), Ng = in(), Nc = in();\n int m = in();\n map<string, vector<string>> mp;\n string key0 = \"\";\n cin.ignore();\n for(int _ : rep(m)) {\n string s; getline(cin, s);\n int mid = find(s.begin(), s.end(), ':') - s.begin();\n string key = s.substr(0, mid);\n if(_ == 0) key0 = key;\n string t = s.substr(mid + 1);\n vector<int> I;\n for(int i : rep(int(t.size()))) if(t[i] == ' ') I.push_back(i);\n I.push_back(t.size());\n vector<string> value;\n for(int i : rep(int(I.size()) - 1)) {\n string u = t.substr(I[i] + 1, I[i + 1] - (I[i] + 1));\n value.push_back(u);\n }\n mp[key] = value;\n }\n\n const int len = Na + Nt + Ng + Nc;\n\n auto dfs = [&](auto self, string key) -> vector<string> {\n vector<string> value = mp[key];\n vector<string> res;\n for(string v : value) {\n if(v[0] == '[') {\n res.push_back(v);\n } else {\n vector<string> v2 = self(self, v);\n res.insert(res.end(), v2.begin(), v2.end());\n }\n if(len < res.size()) exit(print(0));\n }\n return res;\n };\n\n vector<string> value = dfs(dfs, key0);\n if(value.size() != len) return print(0);\n const i64 MOD = 1e9+7;\n vector dp(Na + 1, vector(Nt + 1, vector(Ng + 1, i64(0))));\n dp[0][0][0] = 1;\n for(int i : rep(len)) {\n vector nt(Na + 1, vector(Nt + 1, vector(Ng + 1, i64(0))));\n for(char c : value[i]) if(isalpha(c)) {\n for(int a = 0; a <= Na; a++) {\n for(int t = 0; t <= Nt; t++) {\n for(int g = 0; g <= Ng; g++) {\n if(c == 'A' and a + 1 <= Na) { nt[a + 1][t][g] += dp[a][t][g]; nt[a + 1][t][g] %= MOD; }\n if(c == 'T' and t + 1 <= Nt) { nt[a][t + 1][g] += dp[a][t][g]; nt[a][t + 1][g] %= MOD; }\n if(c == 'G' and g + 1 <= Ng) { nt[a][t][g + 1] += dp[a][t][g]; nt[a][t][g + 1] %= MOD; }\n if(c == 'C') { nt[a][t][g] += dp[a][t][g]; nt[a][t][g] %= MOD; }\n }\n }\n }\n }\n dp = move(nt);\n }\n\n print(dp[Na][Nt][Ng]);\n}","accuracy":1,"time_ms":170,"memory_kb":5128,"score_of_the_acc":-0.0921,"final_rank":2},{"submission_id":"aoj_2437_8492072","code_snippet":"#include <bits/stdc++.h>\n\nconstexpr int MOD = 1000000007;\n\nstruct LengthError {};\n\nstruct State {\n using ATGC = std::array<int, 4>;\n std::map<ATGC, int> mp;\n State() {}\n State(int a, int t, int g, int c) {\n ATGC tu = {a, t, g, c};\n mp[tu] = 1;\n }\n\n void progress(std::string s) {\n std::vector<int> index;\n for (auto c: s) {\n if (c == 'A') index.push_back(0);\n if (c == 'T') index.push_back(1);\n if (c == 'G') index.push_back(2);\n if (c == 'C') index.push_back(3);\n }\n std::map<ATGC, int> next;\n for (const auto& [atgc, val]: mp) {\n for (auto i: index) {\n if (atgc[i] > 0) {\n auto next_atgc = atgc;\n next_atgc[i]--;\n auto& next_val = next[next_atgc];\n next_val += val;\n if (next_val > MOD) {\n next_val -= MOD;\n }\n }\n }\n }\n if (next.empty()) {\n throw LengthError();\n }\n mp = std::move(next);\n }\n};\n\nstruct Parser {\n std::vector<std::string> lines;\n std::map<std::string, int> name_to_index;\n\n Parser(const std::vector<std::string>& s) {\n for (int i = 0; i < (int)s.size(); i++) {\n int pos = s[i].find(':');\n auto name = s[i].substr(0, pos);\n auto line = s[i].substr(pos + 2);\n name_to_index[name] = i;\n lines.push_back(line);\n }\n }\n\n State state;\n int parse(int a, int t, int g, int c) {\n state = State(a, t, g, c);\n try {\n match(0);\n if (state.mp.size() != 1) {\n return 0;\n }\n if (state.mp.find({0, 0, 0, 0}) == state.mp.end()) {\n return 0;\n }\n return state.mp[{0, 0, 0, 0}];\n } catch(LengthError) {\n return 0;\n }\n }\n\n using Iter = std::string::const_iterator&;\n\n void skip(Iter it, char c) {\n assert(*it == c);\n ++it;\n }\n\n void match(int id) {\n auto it = lines[id].cbegin();\n while (it != lines[id].end()) {\n if (*it == '[') {\n skip(it, '[');\n std::string res;\n while (it != lines[id].end() && std::isalpha(*it)) {\n res.push_back(*it);\n ++it;\n }\n skip(it, ']');\n state.progress(res);\n } else {\n std::string name;\n while (it != lines[id].end() && std::isalpha(*it)) {\n name.push_back(*it);\n ++it;\n }\n int nid = name_to_index[name];\n match(nid);\n }\n if (it != lines[id].end()) skip(it, ' ');\n }\n }\n};\n\nint main() {\n int a, t, g, c;\n std::cin >> a >> t >> g >> c;\n int m;\n std::cin >> m;\n std::cin.ignore();\n std::vector<std::string> lines(m);\n for (int i = 0; i < m; i++) {\n std::getline(std::cin, lines[i]);\n }\n\n Parser parser(lines);\n std::cout << parser.parse(a, t, g, c) << std::endl;\n}","accuracy":1,"time_ms":1420,"memory_kb":13096,"score_of_the_acc":-0.8701,"final_rank":14},{"submission_id":"aoj_2437_6781235","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = int;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\nvector<ll> fact, factinv, inv;\nll mod = 1e9 + 7;\nvoid prenCkModp(ll n) {\n fact.resize(n + 5);\n factinv.resize(n + 5);\n inv.resize(n + 5);\n fact.at(0) = fact.at(1) = 1;\n factinv.at(0) = factinv.at(1) = 1;\n inv.at(1) = 1;\n for (ll i = 2; i < n + 5; i++) {\n fact.at(i) = (fact.at(i - 1) * i) % mod;\n inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;\n factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;\n }\n\n}\nll nCk(ll n, ll k) {\n if (k < 0)return 0;\n if (n < k) return 0;\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll A, T, G, C;\n cin >> A >> T >> G >> C;\n ll N = A + T + G + C;\n ll M;\n cin >> M;\n vector<string> V(M);\n string S;\n getline(cin, S);\n rep(m, M) {\n \n getline(cin, S);\n V[M - m - 1] = S;\n }\n map<string, vector<string>> DNA;\n string num;\n rep(m, M) {\n ll L = 0;\n \n vector<string> res;\n rep(j, V[m].size()) {\n if (V[m][j] == ' ') {\n if (L != 0) {\n string AT = V[m].substr(L + 1, j-L-1);\n if (AT[0] != '[') {\n res.insert(res.end(), all(DNA[AT]));\n }\n else {\n res.push_back(AT.substr(1,j-L-3));\n }\n L = j;\n }\n else {\n num = V[m].substr(0, j-1);\n L = j;\n }\n }\n \n }\n ll j = V[m].size();\n string AT = V[m].substr(L + 1, j - 1);\n if (AT[0] != '[') {\n res.insert(res.end(), all(DNA[AT]));\n }\n else {\n res.push_back(AT.substr(1,j-L-3));\n }\n L = j;\n if (res.size() > 200) {\n cout << 0 << endl;\n return 0;\n }\n DNA[num] = res;\n }\n\n vvvll DP(A + 1, vvll(T + 1, vll(G + 1, 0)));\n vector<string> DS = DNA[num];\n if (DS.size() != N) {\n cout << 0 << endl;\n return 0;\n }\n DP[0][0][0] = 1;\n ll mod = 1e9 + 7;\n rep(i, N) {\n vvvll NDP(A + 1, vvll(T + 1, vll(G + 1,0)));\n rep(a, A + 1) {\n rep(t, T + 1) {\n rep(g, G + 1) {\n rep(p, DS[i].size()) {\n if (DS[i][p] == 'A') {\n if (a != A)NDP[a + 1][t][g] += DP[a][t][g];\n if (a != A)NDP[a + 1][t][g] %= mod;\n }\n if (DS[i][p] == 'T') {\n if (t != T)NDP[a][t+1][g] += DP[a][t][g];\n if (t != T)NDP[a][t+1][g] %= mod;\n }\n if (DS[i][p] == 'G') {\n if (g != G)NDP[a][t][g + 1] += DP[a][t][g];\n if (g != G)NDP[a][t][g + 1] %= mod;\n }\n if (DS[i][p] == 'C') {\n NDP[a][t][g] += DP[a][t][g];\n NDP[a][t][g] %= mod;\n }\n \n }\n }\n }\n }\n DP = NDP;\n }\n cout << DP[A][T][G] << endl;\n}","accuracy":1,"time_ms":210,"memory_kb":4312,"score_of_the_acc":-0.1073,"final_rank":4},{"submission_id":"aoj_2437_6772821","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef tabr\n#include \"library/debug.cpp\"\n#else\n#define debug(...)\n#endif\n\ntemplate <long long mod>\nstruct modular {\n long long value;\n modular(long long x = 0) {\n value = x % mod;\n if (value < 0) value += mod;\n }\n modular& operator+=(const modular& other) {\n if ((value += other.value) >= mod) value -= mod;\n return *this;\n }\n modular& operator-=(const modular& other) {\n if ((value -= other.value) < 0) value += mod;\n return *this;\n }\n modular& operator*=(const modular& other) {\n value = value * other.value % mod;\n return *this;\n }\n modular& operator/=(const modular& other) {\n long long a = 0, b = 1, c = other.value, m = mod;\n while (c != 0) {\n long long t = m / c;\n m -= t * c;\n swap(c, m);\n a -= t * b;\n swap(a, b);\n }\n a %= mod;\n if (a < 0) a += mod;\n value = value * a % mod;\n return *this;\n }\n friend modular operator+(const modular& lhs, const modular& rhs) { return modular(lhs) += rhs; }\n friend modular operator-(const modular& lhs, const modular& rhs) { return modular(lhs) -= rhs; }\n friend modular operator*(const modular& lhs, const modular& rhs) { return modular(lhs) *= rhs; }\n friend modular operator/(const modular& lhs, const modular& rhs) { return modular(lhs) /= rhs; }\n modular& operator++() { return *this += 1; }\n modular& operator--() { return *this -= 1; }\n modular operator++(int) {\n modular res(*this);\n *this += 1;\n return res;\n }\n modular operator--(int) {\n modular res(*this);\n *this -= 1;\n return res;\n }\n modular operator-() const { return modular(-value); }\n bool operator==(const modular& rhs) const { return value == rhs.value; }\n bool operator!=(const modular& rhs) const { return value != rhs.value; }\n bool operator<(const modular& rhs) const { return value < rhs.value; }\n};\ntemplate <long long mod>\nstring to_string(const modular<mod>& x) {\n return to_string(x.value);\n}\ntemplate <long long mod>\nostream& operator<<(ostream& stream, const modular<mod>& x) {\n return stream << x.value;\n}\ntemplate <long long mod>\nistream& operator>>(istream& stream, modular<mod>& x) {\n stream >> x.value;\n x.value %= mod;\n if (x.value < 0) x.value += mod;\n return stream;\n}\n\nconstexpr long long mod = (int) 1e9 + 7;\nusing mint = modular<mod>;\n\nmint power(mint a, long long n) {\n mint res = 1;\n while (n > 0) {\n if (n & 1) {\n res *= a;\n }\n a *= a;\n n >>= 1;\n }\n return res;\n}\n\nvector<mint> fact(1, 1);\nvector<mint> finv(1, 1);\n\nmint C(int n, int k) {\n if (n < k || k < 0) {\n return mint(0);\n }\n while ((int) fact.size() < n + 1) {\n fact.emplace_back(fact.back() * (int) fact.size());\n finv.emplace_back(mint(1) / fact.back());\n }\n return fact[n] * finv[k] * finv[n - k];\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n vector<int> c(4);\n for (int i = 0; i < 4; i++) {\n cin >> c[i];\n }\n int m;\n cin >> m;\n vector<string> s;\n string t;\n while (cin >> t) {\n s.emplace_back(t);\n }\n vector<vector<int>> a(m, vector<int>(16));\n map<string, int> mp;\n const string dna = \"ATGC\";\n auto Get = [&](string w) {\n int res = 0;\n for (char x : w) {\n for (int i = 0; i < 4; i++) {\n if (x == dna[i]) {\n res |= 1 << i;\n }\n }\n }\n return res;\n };\n for (int i = m - 1; i >= 0; i--) {\n while (s.back().back() != ':') {\n if (s.back().back() == ']') {\n s.back().pop_back();\n s.back().erase(s.back().begin());\n a[i][Get(s.back())]++;\n } else {\n for (int j = 0; j < 16; j++) {\n a[i][j] += a[mp[s.back()]][j];\n }\n }\n s.pop_back();\n }\n s.back().pop_back();\n mp[s.back()] = i;\n s.pop_back();\n }\n if (*min_element(a[0].begin(), a[0].end()) >= 0 && accumulate(a[0].begin(), a[0].end(), 0) != accumulate(c.begin(), c.end(), 0)) {\n cout << 0 << '\\n';\n return 0;\n }\n vector<int> b;\n for (int i = 0; i < 16; i++) {\n for (int j = 0; j < a[0][i]; j++) {\n b.emplace_back(i);\n }\n }\n mint dp[52][52][52][52] = {};\n dp[0][0][0][0] = 1;\n int sum = 0;\n for (int x : b) {\n for (int i1 = 50; i1 >= 0; i1--) {\n for (int i2 = 50; i2 >= 0; i2--) {\n for (int i3 = 50; i3 >= 0; i3--) {\n int i4 = sum - i1 - i2 - i3;\n if (i4 < 0 || i4 > 50) {\n continue;\n }\n for (int i = 0; i < 4; i++) {\n if (~x & (1 << i)) {\n continue;\n }\n auto [ni1, ni2, ni3, ni4] = make_tuple(i1, i2, i3, i4);\n if (i == 0) {\n ni1++;\n } else if (i == 1) {\n ni2++;\n } else if (i == 2) {\n ni3++;\n } else {\n ni4++;\n }\n dp[ni1][ni2][ni3][ni4] += dp[i1][i2][i3][i4];\n }\n dp[i1][i2][i3][i4] = 0;\n }\n }\n }\n sum++;\n }\n cout << dp[c[0]][c[1]][c[2]][c[3]] << '\\n';\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":60588,"score_of_the_acc":-0.5692,"final_rank":8},{"submission_id":"aoj_2437_6772808","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef tabr\n#include \"library/debug.cpp\"\n#else\n#define debug(...)\n#endif\n\ntemplate <long long mod>\nstruct modular {\n long long value;\n modular(long long x = 0) {\n value = x % mod;\n if (value < 0) value += mod;\n }\n modular& operator+=(const modular& other) {\n if ((value += other.value) >= mod) value -= mod;\n return *this;\n }\n modular& operator-=(const modular& other) {\n if ((value -= other.value) < 0) value += mod;\n return *this;\n }\n modular& operator*=(const modular& other) {\n value = value * other.value % mod;\n return *this;\n }\n modular& operator/=(const modular& other) {\n long long a = 0, b = 1, c = other.value, m = mod;\n while (c != 0) {\n long long t = m / c;\n m -= t * c;\n swap(c, m);\n a -= t * b;\n swap(a, b);\n }\n a %= mod;\n if (a < 0) a += mod;\n value = value * a % mod;\n return *this;\n }\n friend modular operator+(const modular& lhs, const modular& rhs) { return modular(lhs) += rhs; }\n friend modular operator-(const modular& lhs, const modular& rhs) { return modular(lhs) -= rhs; }\n friend modular operator*(const modular& lhs, const modular& rhs) { return modular(lhs) *= rhs; }\n friend modular operator/(const modular& lhs, const modular& rhs) { return modular(lhs) /= rhs; }\n modular& operator++() { return *this += 1; }\n modular& operator--() { return *this -= 1; }\n modular operator++(int) {\n modular res(*this);\n *this += 1;\n return res;\n }\n modular operator--(int) {\n modular res(*this);\n *this -= 1;\n return res;\n }\n modular operator-() const { return modular(-value); }\n bool operator==(const modular& rhs) const { return value == rhs.value; }\n bool operator!=(const modular& rhs) const { return value != rhs.value; }\n bool operator<(const modular& rhs) const { return value < rhs.value; }\n};\ntemplate <long long mod>\nstring to_string(const modular<mod>& x) {\n return to_string(x.value);\n}\ntemplate <long long mod>\nostream& operator<<(ostream& stream, const modular<mod>& x) {\n return stream << x.value;\n}\ntemplate <long long mod>\nistream& operator>>(istream& stream, modular<mod>& x) {\n stream >> x.value;\n x.value %= mod;\n if (x.value < 0) x.value += mod;\n return stream;\n}\n\nconstexpr long long mod = (int) 1e9 + 7;\nusing mint = modular<mod>;\n\nmint power(mint a, long long n) {\n mint res = 1;\n while (n > 0) {\n if (n & 1) {\n res *= a;\n }\n a *= a;\n n >>= 1;\n }\n return res;\n}\n\nvector<mint> fact(1, 1);\nvector<mint> finv(1, 1);\n\nmint C(int n, int k) {\n if (n < k || k < 0) {\n return mint(0);\n }\n while ((int) fact.size() < n + 1) {\n fact.emplace_back(fact.back() * (int) fact.size());\n finv.emplace_back(mint(1) / fact.back());\n }\n return fact[n] * finv[k] * finv[n - k];\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n vector<int> c(4);\n for (int i = 0; i < 4; i++) {\n cin >> c[i];\n }\n int m;\n cin >> m;\n vector<string> s;\n string t;\n while (cin >> t) {\n s.emplace_back(t);\n }\n vector<vector<int>> a(m, vector<int>(16));\n map<string, int> mp;\n const string dna = \"ATGC\";\n auto Get = [&](string w) {\n int res = 0;\n for (char x : w) {\n for (int i = 0; i < 4; i++) {\n if (x == dna[i]) {\n res |= 1 << i;\n }\n }\n }\n return res;\n };\n for (int i = m - 1; i >= 0; i--) {\n while (s.back().back() != ':') {\n if (s.back().back() == ']') {\n s.back().pop_back();\n s.back().erase(s.back().begin());\n a[i][Get(s.back())]++;\n } else {\n for (int j = 0; j < 16; j++) {\n a[i][j] += a[mp[s.back()]][j];\n }\n }\n s.pop_back();\n }\n s.back().pop_back();\n mp[s.back()] = i;\n s.pop_back();\n }\n if (*min_element(a[0].begin(), a[0].end()) >= 0 && accumulate(a[0].begin(), a[0].end(), 0) != accumulate(c.begin(), c.end(), 0)) {\n cout << 0 << '\\n';\n return 0;\n }\n vector<int> b;\n for (int i = 0; i < 16; i++) {\n for (int j = 0; j < a[0][i]; j++) {\n b.emplace_back(i);\n }\n }\n mint dp[52][52][52][52] = {};\n dp[0][0][0][0] = 1;\n for (int x : b) {\n for (int i1 = 50; i1 >= 0; i1--) {\n for (int i2 = 50; i2 >= 0; i2--) {\n for (int i3 = 50; i3 >= 0; i3--) {\n for (int i4 = 50; i4 >= 0; i4--) {\n for (int i = 0; i < 4; i++) {\n if (~x & (1 << i)) {\n continue;\n }\n auto [ni1, ni2, ni3, ni4] = make_tuple(i1, i2, i3, i4);\n if (i == 0) {\n ni1++;\n } else if (i == 1) {\n ni2++;\n } else if (i == 2) {\n ni3++;\n } else {\n ni4++;\n }\n dp[ni1][ni2][ni3][ni4] += dp[i1][i2][i3][i4];\n dp[i1][i2][i3][i4] = 0;\n }\n }\n }\n }\n }\n }\n cout << dp[c[0]][c[1]][c[2]][c[3]] << '\\n';\n return 0;\n}","accuracy":0.023255813953488372,"time_ms":160,"memory_kb":60436,"score_of_the_acc":-0.5848,"final_rank":20},{"submission_id":"aoj_2437_6381163","code_snippet":"#line 2 \"library/bits/stdc++.h\"\n\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#endif\n#line 2 \"Source.cpp\"\nusing namespace std;\n\ntypedef string::const_iterator State;\n#define eps 1e-8L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n#define MOD 998244353LL\n#define pb push_back\n#define mp make_pair\ntypedef long long ll;\ntypedef long double ld;\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\n#define ALL(x) (x).begin(), (x).end()\n\n#line 1 \"library/atcoder/modint.hpp\"\n\n\n\n#include <cassert>\n#line 6 \"library/atcoder/modint.hpp\"\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#line 1 \"library/atcoder/internal_math.hpp\"\n\n\n\n#line 5 \"library/atcoder/internal_math.hpp\"\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 1 \"library/atcoder/internal_type_traits.hpp\"\n\n\n\n#line 7 \"library/atcoder/internal_type_traits.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 14 \"library/atcoder/modint.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 17 \"Source.cpp\"\nusing mint = atcoder::modint1000000007;\n\n#define int long long\nmint dp[60][60][60][60];\nvoid solve()\n{\n int cnts[4];\n REP(i, 4)\n {\n cin >> cnts[i];\n }\n int t;\n cin >> t;\n cin.ignore();\n vector<vector<string>> inputs;\n REP(tea, t)\n {\n string l;\n getline(cin, l);\n vector<string> gogo;\n string b;\n l.push_back(' ');\n REP(i, l.size())\n {\n if (l[i] == ' ')\n {\n if (b != \"\")\n gogo.push_back(b);\n b.clear();\n }\n else\n {\n b.push_back(l[i]);\n }\n }\n gogo[0].pop_back();\n inputs.push_back(gogo);\n }\n map<string, vector<int>> seqs;\n reverse(ALL(inputs));\n for (auto x : inputs)\n {\n vector<int> tmps;\n for (int q = 1; q < x.size(); ++q)\n {\n if (x[q][0] == '[')\n {\n int cnt = 0;\n string s = \"ATGC\";\n for (auto y : x[q])\n {\n REP(t, 4)\n {\n if (s[t] == y)\n {\n cnt |= (1 << t);\n }\n }\n }\n tmps.push_back(cnt);\n }\n else\n {\n vector<int> hoge = seqs[x[q]];\n for (auto y : hoge)\n {\n tmps.push_back(y);\n }\n }\n if (tmps.size() > 300)\n break;\n }\n seqs[x[0]] = tmps;\n }\n vector<int> target = seqs[inputs.back()[0]];\n if (target.size() != cnts[0] + cnts[1] + cnts[2] + cnts[3])\n {\n cout << 0 << endl;\n return;\n }\n dp[0][0][0][0] = 1;\n REP(i, cnts[0] + 1)\n {\n REP(q, cnts[1] + 1)\n {\n REP(j, cnts[2] + 1)\n {\n REP(t, cnts[3] + 1)\n {\n int go = i + q + j + t;\n if (i != cnts[0] and (target[go] & 1))\n {\n dp[i + 1][q][j][t] += dp[i][q][j][t];\n }\n\n if (q != cnts[1] and (target[go] & 2))\n {\n dp[i][q + 1][j][t] += dp[i][q][j][t];\n }\n\n if (j != cnts[2] and (target[go] & 4))\n {\n dp[i][q][j + 1][t] += dp[i][q][j][t];\n }\n\n if (t != cnts[3] and (target[go] & 8))\n {\n dp[i][q][j][t + 1] += dp[i][q][j][t];\n }\n }\n }\n }\n }\n cout << dp[cnts[0]][cnts[1]][cnts[2]][cnts[3]].val() << endl;\n}\n\n#undef int\n\n// generated by oj-template v4.7.2\n// (https://github.com/online-judge-tools/template-generator)\nint main()\n{\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 {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":54140,"score_of_the_acc":-0.4489,"final_rank":7},{"submission_id":"aoj_2437_6087686","code_snippet":"#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n#include <utility>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n unsigned int umod() const { return _m; }\n\n unsigned int mul(unsigned int a, unsigned int b) const {\n\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <array>\n#include <string>\n#include <map>\n\nusing namespace std;\nusing mint = atcoder::modint1000000007;\n\nconst string atgc{\"ATGC\"};\n\nvector<string> parse(const string& s) {\n vector<string> ss{\"\"};\n for (auto c : s) {\n if (c == ' ') {\n ss.push_back(\"\");\n } else if (c != ':') {\n ss.back().push_back(c);\n }\n }\n return ss;\n}\n\nvoid solve() {\n array<int, 4> gs;\n for (auto& g : gs) cin >> g;\n\n int m;\n cin >> m;\n {\n string tmp;\n getline(cin, tmp);\n }\n\n vector<vector<string>> sss(m);\n for (auto& ss : sss) {\n string s;\n getline(cin, s);\n ss = parse(s);\n }\n reverse(sss.begin(), sss.end());\n\n map<string, vector<int>> mp;\n for (auto ss : sss) {\n string name = ss.front();\n ss.erase(ss.begin());\n\n vector<int> cnt(16, 0);\n for (const auto& s : ss) {\n if (s.front() == '[') {\n int b = 0;\n for (auto c : s) {\n for (int i = 0; i < 4; ++i) {\n if (c == atgc[i]) b |= (1 << i);\n }\n }\n ++cnt[b];\n } else {\n auto v = mp[s];\n for (int b = 0; b < 16; ++b) cnt[b] += v[b];\n }\n }\n\n mp[name] = cnt;\n }\n\n auto cnt = mp[sss.back().front()];\n\n if (accumulate(cnt.begin(), cnt.end(), 0) !=\n accumulate(gs.begin(), gs.end(), 0)) {\n cout << \"0\\n\";\n return;\n }\n\n map<array<int, 4>, mint> dp, ndp;\n dp[{0, 0, 0, 0}] = 1;\n\n for (int b = 0; b < 16; ++b) {\n while (cnt[b]--) {\n ndp.clear();\n for (const auto& [is, p] : dp) {\n for (int c = 0; c < 4; ++c) {\n if ((~b >> c) & 1) continue;\n\n auto nis = is;\n if (++nis[c] > gs[c]) continue;\n ndp[nis] += p;\n }\n }\n swap(dp, ndp);\n }\n }\n\n cout << dp[gs].val() << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":1230,"memory_kb":13320,"score_of_the_acc":-0.7648,"final_rank":13},{"submission_id":"aoj_2437_6087682","code_snippet":"#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n#include <utility>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n unsigned int umod() const { return _m; }\n\n unsigned int mul(unsigned int a, unsigned int b) const {\n\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <iostream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <string>\n#include <map>\n\nusing namespace std;\nusing mint = atcoder::modint1000000007;\n\nconst string atgc{\"ATGC\"};\n\nvector<string> parse(const string& s) {\n vector<string> ss{\"\"};\n for (auto c : s) {\n if (c == ' ') {\n ss.push_back(\"\");\n } else if (c != ':') {\n ss.back().push_back(c);\n }\n }\n return ss;\n}\n\nvoid solve() {\n vector<int> gs(4);\n for (auto& g : gs) cin >> g;\n\n int m;\n cin >> m;\n {\n string tmp;\n getline(cin, tmp);\n }\n\n vector<vector<string>> sss(m);\n for (auto& ss : sss) {\n string s;\n getline(cin, s);\n ss = parse(s);\n }\n reverse(sss.begin(), sss.end());\n\n map<string, vector<int>> mp;\n for (auto ss : sss) {\n string name = ss.front();\n ss.erase(ss.begin());\n\n vector<int> cnt(16, 0);\n for (const auto& s : ss) {\n if (s.front() == '[') {\n int b = 0;\n for (auto c : s) {\n for (int i = 0; i < 4; ++i) {\n if (c == atgc[i]) b |= (1 << i);\n }\n }\n ++cnt[b];\n } else {\n auto v = mp[s];\n for (int b = 0; b < 16; ++b) cnt[b] += v[b];\n }\n }\n\n mp[name] = cnt;\n }\n\n auto cnt = mp[sss.back().front()];\n\n if (accumulate(cnt.begin(), cnt.end(), 0) !=\n accumulate(gs.begin(), gs.end(), 0)) {\n cout << \"0\\n\";\n return;\n }\n\n map<vector<int>, mint> dp;\n dp[{0, 0, 0, 0}] = 1;\n\n for (int b = 0; b < 16; ++b) {\n while (cnt[b]--) {\n map<vector<int>, mint> ndp;\n for (const auto& [is, p] : dp) {\n for (int c = 0; c < 4; ++c) {\n if ((~b >> c) & 1) continue;\n\n auto nis = is;\n if (++nis[c] > gs[c]) continue;\n ndp[nis] += p;\n }\n }\n\n swap(dp, ndp);\n }\n }\n\n cout << dp[gs].val() << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":1790,"memory_kb":20772,"score_of_the_acc":-1.1483,"final_rank":19},{"submission_id":"aoj_2437_5967248","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>\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\nconstexpr ll mod = 1e9+7;\n\nint na,nt,ng,nc;\nll dp[55][55][55][55];\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n for(int i=0;i<55;i++){\n for(int j=0;j<55;j++){\n for(int k=0;k<55;k++){\n for(int l=0;l<55;l++){\n dp[i][j][k][l] = -1;\n }\n }\n }\n }\n cin >> na >> nt >> ng >> nc;\n int m; cin >> m;\n string base; getline(cin,base);\n map<string,vector<string>> mp;\n for(int i=0;i<m;i++){\n string s; getline(cin,s);\n stringstream ss(s);\n string fr; ss >> fr;\n fr.pop_back();\n if(i == 0){\n base = fr;\n }\n string t;\n while(ss >> t){\n mp[fr].push_back(t);\n }\n }\n vector<int> v;\n auto dfs=[&](auto self,string s)->void{\n if(v.size()>na+nt+ng+nc){\n cout << 0 << endl;\n exit(0);\n }\n for(auto t:mp[s]){\n if(t[0]=='['){\n int u = 0;\n for(int j=1;j+1<t.size();j++){\n if(t[j] == 'A') u |= (1<<0);\n if(t[j] == 'T') u |= (1<<1);\n if(t[j] == 'G') u |= (1<<2);\n if(t[j] == 'C') u |= (1<<3);\n }\n v.push_back(u);\n }\n else{\n self(self, t);\n }\n }\n if(v.size()>na+nt+ng+nc){\n cout << 0 << endl;\n exit(0);\n }\n };\n dfs(dfs,base);\n // for(auto ss:v){\n // cout << ss << endl;\n // }\n auto cal = [&](auto self,int a,int t,int g,int c)->ll{\n if(dp[a][t][g][c] != -1){\n return dp[a][t][g][c];\n }\n if(a == na and t == nt and c == nc and g == ng){\n dp[a][t][g][c] = 1;\n return 1;\n }\n if(a > na or t > nt or g > ng or c > nc){\n dp[a][t][g][c] = 0;\n return 0;\n }\n ll res = 0;\n int u = v[a+t+c+g];\n if((1<<0)&u){\n res += self(self,a+1,t,g,c);\n }\n if((1<<1)&u){\n res += self(self,a,t+1,g,c);\n }\n if((1<<2)&u){\n res += self(self,a,t,g+1,c);\n }\n if((1<<3)&u){\n res += self(self,a,t,g,c+1);\n }\n res %= mod;\n dp[a][t][g][c] = res;\n return res;\n };\n cout << cal(cal,0,0,0,0) << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":74976,"score_of_the_acc":-0.6706,"final_rank":12},{"submission_id":"aoj_2437_5950011","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <uint64_t Modulus> class modint {\n using i64 = int64_t;\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \"Modulus must be less than 2**31\");\n static constexpr u32 mod = Modulus;\n u32 v;\n\npublic:\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\n constexpr u32& val() noexcept { return v; }\n constexpr const u32& val() const noexcept { return v; }\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 {\n v += rhs.v;\n if (v >= mod) v -= mod;\n return *this;\n }\n constexpr modint& operator-=(const modint& rhs) noexcept {\n if (v < rhs.v) v += mod;\n v -= rhs.v;\n return *this;\n }\n constexpr modint& operator*=(const modint& rhs) noexcept {\n v = (u64)v * rhs.v % mod;\n return *this;\n }\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\n constexpr modint pow(long long n) const noexcept {\n assert(0 <= n);\n modint self(*this), res(1);\n while (n > 0) {\n if (n & 1) res *= self;\n self *= self;\n n >>= 1;\n }\n return res;\n }\n constexpr modint inv() const noexcept {\n assert(*this != 0);\n return pow(mod - 2);\n }\n constexpr modint& operator++() noexcept {\n if (++v == mod) v = 0;\n return *this;\n }\n constexpr modint& operator--() noexcept {\n if (v == 0) v = mod;\n return --v, *this;\n }\n constexpr modint operator++(int) noexcept {\n modint t = *this;\n return ++*this, t;\n }\n constexpr modint operator--(int) noexcept {\n modint t = *this;\n return --*this, t;\n }\n constexpr modint operator-() const noexcept { return modint(mod - v); }\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\n constexpr bool operator!() const noexcept { return !v; }\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\n i64 v;\n rhs = modint{(s >> v, v)};\n return s;\n }\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\n};\n\n/**\n * @brief modint\n * @docs docs/modulo/modint.md\n */\n\nconst long long MOD = 1000000007;\nusing mint = modint<MOD>;\nconst int MAX_N = 52;\nmint dp[MAX_N][MAX_N][MAX_N][MAX_N];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int Na, Nb, Nc, Nd;\n cin >> Na >> Nb >> Nc >> Nd;\n int m;\n cin >> m;\n vector<string> S(m);\n getline(cin, S[0]);\n for (auto& s : S) getline(cin, s);\n\n size_t sum = Na + Nb + Nc + Nd;\n vector<vector<int>> decomp(m);\n map<string, int> mp;\n\n auto ctoi = [](char c) {\n if (c == 'A') return 0;\n if (c == 'T') return 1;\n if (c == 'G') return 2;\n if (c == 'C') return 3;\n assert(false);\n };\n auto calc = [&](int idx, const string& s) {\n size_t cur = 0;\n string name = \"\";\n while (s[cur] != ':') name += s[cur++];\n cur += 2;\n for (; cur < s.size() and decomp[idx].size() <= sum + 1; cur++) {\n if (s[cur] == '[') {\n int mask = 0;\n cur++;\n while (s[cur] != ']') mask |= 1 << (ctoi(s[cur++]));\n decomp[idx].emplace_back(mask);\n cur++;\n } else {\n string add = \"\";\n while (cur < s.size() and s[cur] != ' ') add += s[cur++];\n int x = mp[add];\n for (auto& val : decomp[x]) decomp[idx].emplace_back(val);\n }\n }\n mp[name] = idx;\n };\n for (int i = m - 1; i >= 0; i--) calc(i, S[i]);\n\n if (decomp[0].size() > sum) {\n cout << 0 << '\\n';\n return 0;\n }\n\n dp[0][0][0][0] = 1;\n for (int p = 0; p < int(decomp[0].size()); p++) {\n int mask = decomp[0][p];\n for (int i = min(Na, p); i >= 0; i--) {\n for (int j = min(Nb, p - i); j >= 0; j--) {\n for (int k = min(Nc, p - (i + j)); k >= 0; k--) {\n for (int l = min(Nd, p - (i + j + k)); l >= 0; l--) {\n mint& val = dp[i][j][k][l];\n if (val == 0) continue;\n if (i + 1 <= Na and (mask >> 0 & 1)) dp[i + 1][j][k][l] += val;\n if (j + 1 <= Nb and (mask >> 1 & 1)) dp[i][j + 1][k][l] += val;\n if (k + 1 <= Nc and (mask >> 2 & 1)) dp[i][j][k + 1][l] += val;\n if (l + 1 <= Nd and (mask >> 3 & 1)) dp[i][j][k][l + 1] += val;\n val = 0;\n }\n }\n }\n }\n }\n\n mint ans = dp[Na][Nb][Nc][Nd];\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":640,"memory_kb":31360,"score_of_the_acc":-0.594,"final_rank":10},{"submission_id":"aoj_2437_5950008","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& 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}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<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 <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n#pragma endregion\n\n#include <cassert>\n#include <cstdint>\n#include <iostream>\n\ntemplate <uint64_t Modulus> class modint {\n using i64 = int64_t;\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \"Modulus must be less than 2**31\");\n static constexpr u32 mod = Modulus;\n u32 v;\n\npublic:\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\n constexpr u32& val() noexcept { return v; }\n constexpr const u32& val() const noexcept { return v; }\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 {\n v += rhs.v;\n if (v >= mod) v -= mod;\n return *this;\n }\n constexpr modint& operator-=(const modint& rhs) noexcept {\n if (v < rhs.v) v += mod;\n v -= rhs.v;\n return *this;\n }\n constexpr modint& operator*=(const modint& rhs) noexcept {\n v = (u64)v * rhs.v % mod;\n return *this;\n }\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\n constexpr modint pow(long long n) const noexcept {\n assert(0 <= n);\n modint self(*this), res(1);\n while (n > 0) {\n if (n & 1) res *= self;\n self *= self;\n n >>= 1;\n }\n return res;\n }\n constexpr modint inv() const noexcept {\n assert(*this != 0);\n return pow(mod - 2);\n }\n constexpr modint& operator++() noexcept {\n if (++v == mod) v = 0;\n return *this;\n }\n constexpr modint& operator--() noexcept {\n if (v == 0) v = mod;\n return --v, *this;\n }\n constexpr modint operator++(int) noexcept {\n modint t = *this;\n return ++*this, t;\n }\n constexpr modint operator--(int) noexcept {\n modint t = *this;\n return --*this, t;\n }\n constexpr modint operator-() const noexcept { return modint(mod - v); }\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\n constexpr bool operator!() const noexcept { return !v; }\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\n i64 v;\n rhs = modint{(s >> v, v)};\n return s;\n }\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\n};\n\n/**\n * @brief modint\n * @docs docs/modulo/modint.md\n */\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nusing mint = modint<MOD>;\nconst int MAX_N = 52;\nmint dp[MAX_N][MAX_N][MAX_N][MAX_N];\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int Na, Nb, Nc, Nd;\n cin >> Na >> Nb >> Nc >> Nd;\n int m;\n cin >> m;\n vector<string> S(m);\n getline(cin, S[0]);\n for (auto& s : S) getline(cin, s);\n\n size_t sum = Na + Nb + Nc + Nd;\n vector<vector<int>> decomp(m);\n map<string, int> mp;\n\n auto ctoi = [](char c) {\n if (c == 'A') return 0;\n if (c == 'T') return 1;\n if (c == 'G') return 2;\n if (c == 'C') return 3;\n assert(false);\n };\n auto calc = [&](int idx, const string& s) {\n size_t cur = 0;\n string name = \"\";\n while (s[cur] != ':') name += s[cur++];\n cur += 2;\n for (; cur < s.size() and decomp[idx].size() <= sum + 1; cur++) {\n if (s[cur] == '[') {\n int mask = 0;\n cur++;\n while (s[cur] != ']') mask |= 1 << (ctoi(s[cur++]));\n decomp[idx].emplace_back(mask);\n cur++;\n } else {\n string add = \"\";\n while (cur < s.size() and s[cur] != ' ') add += s[cur++];\n int x = mp[add];\n for (auto& val : decomp[x]) decomp[idx].emplace_back(val);\n }\n }\n mp[name] = idx;\n };\n for (int i = m - 1; i >= 0; i--) calc(i, S[i]);\n\n if (decomp[0].size() > sum) {\n cout << 0 << '\\n';\n return 0;\n }\n\n dp[0][0][0][0] = 1;\n for (int p = 0; p < int(decomp[0].size()); p++) {\n int mask = decomp[0][p];\n for (int i = min(Na, p); i >= 0; i--) {\n for (int j = min(Nb, p - i); j >= 0; j--) {\n for (int k = min(Nc, p - (i + j)); k >= 0; k--) {\n for (int l = min(Nd, p - (i + j + k)); l >= 0; l--) {\n mint& val = dp[i][j][k][l];\n if (val == 0) continue;\n if (i + 1 <= Na and (mask >> 0 & 1)) dp[i + 1][j][k][l] += val;\n if (j + 1 <= Nb and (mask >> 1 & 1)) dp[i][j + 1][k][l] += val;\n if (k + 1 <= Nc and (mask >> 2 & 1)) dp[i][j][k + 1][l] += val;\n if (l + 1 <= Nd and (mask >> 3 & 1)) dp[i][j][k][l + 1] += val;\n val = 0;\n }\n }\n }\n }\n }\n\n mint ans = dp[Na][Nb][Nc][Nd];\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":640,"memory_kb":31284,"score_of_the_acc":-0.5933,"final_rank":9},{"submission_id":"aoj_2437_5765703","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\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()\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 25000000;\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-8;\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);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\ntemplate <int mod> struct 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 mint = ModInt<mod>;\n\nmint dp[2][55][55][55];\n\nmap<string,vs> mp;\n\nint main(){\n int na,nt,ng,nc; cin >> na >> nt >> ng >> nc;\n int n = na+nt+ng+nc;\n int m; cin >> m;\n string s;\n vs v;\n string now = \"@\";\n string fi;\n while(cin >> s){\n if(s.back() == ':'){\n s.pop_back();\n if(now == \"@\") fi = s;\n else mp[now] = v;\n v.clear();\n now = s;\n }else{\n v.push_back(s);\n }\n }\n mp[now] = v;\n vs ls;\n auto dfs = [&](auto &&dfs, string &t) -> void {\n for(auto x : mp[t]){\n if(ls.size() > n){\n cout << 0 << endl;\n exit(0);\n }\n if(x.back() == ']'){\n ls.push_back(x);\n }else{\n dfs(dfs, x);\n }\n }\n };\n dfs(dfs, fi);\n if(ls.size() != n){\n cout << 0 << endl;\n return 0;\n }\n dp[0][na][nt][ng] = 1;\n rep(i,n){\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1) dp[1][a][t][g] = 0;\n string u = ls[i];\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1){\n int c = n-i-a-t-g;\n if(c<0 || c>nc) continue;\n for(auto ch : u){\n if(ch=='A' && a>0) dp[1][a-1][t][g] += dp[0][a][t][g];\n if(ch=='T' && t>0) dp[1][a][t-1][g] += dp[0][a][t][g];\n if(ch=='G' && g>0) dp[1][a][t][g-1] += dp[0][a][t][g];\n if(ch=='C' && c>0) dp[1][a][t][g] += dp[0][a][t][g]; \n }\n }\n swap(dp[0],dp[1]);\n }\n cout << dp[0][0][0][0] << endl;\n}","accuracy":1,"time_ms":150,"memory_kb":4760,"score_of_the_acc":-0.0775,"final_rank":1},{"submission_id":"aoj_2437_5765641","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\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()\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 25000000;\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-8;\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);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\ntemplate <int mod> struct 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 mint = ModInt<mod>;\n\nmint dp[2][55][55][55];\n\nmap<string,vs> mp;\n\nint main(){\n int na,nt,ng,nc; cin >> na >> nt >> ng >> nc;\n int n = na+nt+ng+nc;\n int m; cin >> m;\n string s;\n vs v;\n string now = \"@\";\n string fi;\n while(cin >> s){\n if(s.back() == ':'){\n s.pop_back();\n if(now == \"@\") fi = s;\n else mp[now] = v;\n v.clear();\n now = s;\n }else{\n v.push_back(s);\n }\n }\n mp[now] = v;\n vs ls;\n auto dfs = [&](auto &&dfs, string &t) -> void {\n for(auto x : mp[t]){\n if(ls.size() > n){\n cout << 0 << endl;\n exit(0);\n }\n if(x.back() == ']'){\n ls.push_back(x);\n }else{\n dfs(dfs, x);\n }\n }\n };\n dfs(dfs, fi);\n if(ls.size() != n){\n cout << 0 << endl;\n return 0;\n }\n dp[0][na][nt][ng] = 1;\n rep(i,n){\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1) dp[1][a][t][g] = 0;\n string u = ls[i];\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1){\n int c = n-i-a-t-g;\n if(c<0 || c>nc) continue;\n if(u.find('A')<=4 && a>0) dp[1][a-1][t][g] += dp[0][a][t][g];\n if(u.find('T')<=4 && t>0) dp[1][a][t-1][g] += dp[0][a][t][g];\n if(u.find('G')<=4 && g>0) dp[1][a][t][g-1] += dp[0][a][t][g];\n if(u.find('C')<=4 && c>0) dp[1][a][t][g] += dp[0][a][t][g]; \n }\n swap(dp[0],dp[1]);\n }\n cout << dp[0][0][0][0] << endl;\n}","accuracy":1,"time_ms":200,"memory_kb":4768,"score_of_the_acc":-0.1058,"final_rank":3},{"submission_id":"aoj_2437_5036010","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\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#define ALL(x) x.begin(), x.end()\n#define POPCOUNT(x) __builtin_popcount(x)\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\n\nconst ll INF = 1LL << 60;\nconst ll MOD = 1e9 + 7;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nvector<string> split(const string &S) {\n vector<string> ret;\n string s = \"\";\n for (int i = 0; i < S.size(); i++) {\n if (S[i] == ' ') {\n ret.push_back(s);\n s = \"\";\n } else {\n s.push_back(S[i]);\n }\n }\n ret.push_back(s);\n return ret;\n}\n\nvector<string> vec[50];\nvector<ll> memo[50];\nmap<string, int> idx;\nint dp[201][51][51][51];\n\nvoid dfs(int v) {\n if (memo[v].size() != 0)\n return;\n vector<ll> ret(16);\n for (const string &s : vec[v]) {\n if (s[0] == '[') {\n int b = 0;\n for (int i = 1; i + 1 < s.size(); i++) {\n if (s[i] == 'A')\n b |= 1;\n else if (s[i] == 'T')\n b |= 2;\n else if (s[i] == 'G')\n b |= 4;\n else\n b |= 8;\n }\n ret[b] = min(ret[b] + 1, INF);\n } else {\n int k = idx[s];\n dfs(k);\n for (int i = 0; i < 16; i++)\n ret[i] = min(ret[i] + memo[k][i], INF);\n }\n }\n memo[v] = ret;\n}\n\nint main() {\n int Na, Nt, Ng, Nc;\n cin >> Na >> Nt >> Ng >> Nc;\n int m;\n cin >> m;\n string line;\n getline(cin, line);\n for (int i = 0; i < m; i++) {\n getline(cin, line);\n vector<string> ret = split(line);\n string name = ret[0];\n name.pop_back();\n ret.erase(ret.begin());\n idx[name] = i;\n vec[i] = ret;\n }\n dfs(0);\n ll len = 0;\n for (int i = 0; i < 16; i++)\n len = min(len + memo[0][i], INF);\n if (len != Na + Nt + Ng + Nc) {\n cout << 0 << endl;\n return 0;\n }\n len = 0;\n dp[0][0][0][0] = 1;\n for (int i = 0; i < 16; i++) {\n for (int j = 0; j < memo[0][i]; j++) {\n for (int a = 0; a <= Na; a++) {\n if (a > len)\n break;\n for (int t = 0; t <= Nt; t++) {\n if (a + t > len)\n break;\n for (int g = 0; g <= Ng; g++) {\n if (a + t + g > len)\n break;\n int c = len - (a + t + g);\n for (int k = 0; k < 4; k++) {\n if ((i & (1 << k)) == 0)\n continue;\n if (k == 0 && a + 1 <= Na)\n (dp[len + 1][a + 1][t][g] +=\n dp[len][a][t][g]) %= MOD;\n if (k == 1 && t + 1 <= Nt)\n (dp[len + 1][a][t + 1][g] +=\n dp[len][a][t][g]) %= MOD;\n if (k == 2 && g + 1 <= Ng)\n (dp[len + 1][a][t][g + 1] +=\n dp[len][a][t][g]) %= MOD;\n if (k == 3 && c + 1 <= Nc)\n (dp[len + 1][a][t][g] += dp[len][a][t][g]) %=\n MOD;\n }\n }\n }\n }\n len++;\n }\n }\n cout << dp[len][Na][Nt][Ng] << endl;\n}","accuracy":1,"time_ms":90,"memory_kb":103784,"score_of_the_acc":-0.9358,"final_rank":15},{"submission_id":"aoj_2437_4937819","code_snippet":"#line 1 \"a.cpp\"\n#include<iostream>\n#include<map>\n#include<vector>\n#include<array>\nusing namespace std;\n#line 3 \"/home/kotatsugame/library/math/modint.cpp\"\n#include<utility>\ntemplate<int m>\nstruct modint{\n\tunsigned int x;\n\tconstexpr modint()noexcept:x(){}\n\ttemplate<typename T>\n\tconstexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}\n\tconstexpr unsigned int val()const noexcept{return x;}\n\tconstexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}\n\tconstexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}\n\tconstexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}\n\tconstexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}\n\tconstexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}\n\tconstexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}\n\tconstexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}\n\tconstexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}\n\tconstexpr modint operator+()const noexcept{return*this;}\n\tconstexpr modint operator-()const noexcept{return modint()-*this;}\n\tconstexpr modint pow(long long n)const noexcept\n\t{\n\t\tif(n<0)return pow(-n).inv();\n\t\tmodint x=*this,r=1;\n\t\tfor(;n;x*=x,n>>=1)if(n&1)r*=x;\n\t\treturn r;\n\t}\n\tconstexpr modint inv()const noexcept\n\t{\n\t\tint s=x,t=m,x=1,u=0;\n\t\twhile(t)\n\t\t{\n\t\t\tint k=s/t;\n\t\t\ts-=k*t;\n\t\t\tswap(s,t);\n\t\t\tx-=k*u;\n\t\t\tswap(x,u);\n\t\t}\n\t\treturn modint(x);\n\t}\n\tfriend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}\n\tfriend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}\n\tfriend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}\n\tfriend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}\n\tfriend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}\n\tfriend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}\n\tfriend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}\n\tfriend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}\n};\n#line 7 \"a.cpp\"\nusing mint=modint<(int)1e9+7>;\nmint dp[51][51][51][51];\nstring DNA=\"ATGC\";\nint N[4],L;\nint M;\nmap<string,vector<string> >mp;\nvector<int>X;\nvoid f(string s)\n{\n\tif(s[0]=='[')\n\t{\n\t\tint T=0;\n\t\tfor(int i=1;i+1<s.size();i++)\n\t\t{\n\t\t\tfor(int j=0;j<4;j++)if(s[i]==DNA[j])T|=1<<j;\n\t\t}\n\t\tX.push_back(T);\n\t\treturn;\n\t}\n\tfor(const string&t:mp[s])\n\t{\n\t\tf(t);\n\t\tif(X.size()>L)break;\n\t}\n}\nmain()\n{\n\tfor(int i=0;i<4;i++)\n\t{\n\t\tcin>>N[i];\n\t\tL+=N[i];\n\t}\n\tcin>>M;\n\tcin.ignore();\n\tstring st;\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tstring in;\n\t\tgetline(cin,in);\n\t\tstring A=\"\";\n\t\tvector<string>B;\n\t\tint id=0;\n\t\twhile(in[id]!=':')\n\t\t{\n\t\t\tA+=in[id++];\n\t\t}\n\t\tif(i==0)st=A;\n\t\tid++;\n\t\tid++;\n\t\twhile(id<in.size())\n\t\t{\n\t\t\tstring now=\"\";\n\t\t\twhile(id<in.size()&&in[id]!=' ')\n\t\t\t{\n\t\t\t\tnow+=in[id++];\n\t\t\t}\n\t\t\tB.push_back(now);\n\t\t\tid++;\n\t\t}\n\t\tmp[A]=B;\n\t}\n\tf(st);\n\tif(X.size()!=L)\n\t{\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\tdp[N[0]][N[1]][N[2]][N[3]]=1;\n\tfor(int i=0;i<L;i++)\n\t{\n\t\tint rest=L-i;\n\t\tfor(int a=0;a<=N[0]&&a<=rest;a++)\n\t\t\tfor(int b=0;b<=N[1]&&a+b<=rest;b++)\n\t\t\t\tfor(int c=0;c<=N[2]&&a+b+c<=rest;c++)\n\t\t{\n\t\t\tint d=rest-a-b-c;\n\t\t\tif(d>N[3])continue;\n\t\t\tif(X[i]&1&&a>0)\n\t\t\t{\n\t\t\t\tdp[a-1][b][c][d]+=dp[a][b][c][d];\n\t\t\t}\n\t\t\tif(X[i]&2&&b>0)\n\t\t\t{\n\t\t\t\tdp[a][b-1][c][d]+=dp[a][b][c][d];\n\t\t\t}\n\t\t\tif(X[i]&4&&c>0)\n\t\t\t{\n\t\t\t\tdp[a][b][c-1][d]+=dp[a][b][c][d];\n\t\t\t}\n\t\t\tif(X[i]&8&&d>0)\n\t\t\t{\n\t\t\t\tdp[a][b][c][d-1]+=dp[a][b][c][d];\n\t\t\t}\n\t\t}\n\t}\n\tcout<<dp[0][0][0][0]<<endl;\n}","accuracy":1,"time_ms":150,"memory_kb":29140,"score_of_the_acc":-0.2971,"final_rank":5},{"submission_id":"aoj_2437_4925533","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=(int)(n)-1; i>=0; --i)\n#define FOR(i, a, n) for (int i=(a); i<(n); ++i)\n#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)\n\n#define SZ(x) ((int)(x).size())\n#define ALL(x) (x).begin(),(x).end()\n\n#define DUMP(x) cerr<<#x<<\" = \"<<(x)<<endl\n#define DEBUG(x) cerr<<#x<<\" = \"<<(x)<<\" (L\"<<__LINE__<<\")\"<<endl;\n\ntemplate<class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n os << \"[\";\n REP(i, SZ(v)) {\n if (i) os << \", \";\n os << v[i];\n }\n return os << \"]\";\n}\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>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nbool chmin(T &a, const T &b) {\n if (b < a) {\n a = b;\n return true;\n }\n return false;\n}\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\n\nconst ll MOD = 1e9 + 7;\nconst int INF = INT_MAX / 2;\nconst ll LINF = LLONG_MAX / 2;\nconst ld eps = 1e-9;\n\nvvi result;\n\nmap<string, int> mp;\nvector<vector<string>> rule;\nint su = 0;\nvoid read(int i, int &len) {\n REP(j, SZ(rule[i])) {\n if(len > su) return;\n if(rule[i][j][0] == '[') {\n len++;\n vi v;\n for(int k=1;k<SZ(rule[i][j])-1;k++) {\n switch(rule[i][j][k]) {\n case 'A':\n v.push_back(0);\n break;\n case 'T':\n v.push_back(1);\n break;\n case 'G':\n v.push_back(2);\n break;\n case 'C':\n v.push_back(3);\n break;\n default:\n assert(false);\n break;\n }\n }\n result.emplace_back(v);\n } else {\n read(mp[rule[i][j]], len);\n if(len > su) return;\n }\n }\n}\n\nint dp[201][51][51][51] = {0};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n vi v(4); cin >> v[0] >> v[1] >> v[2] >> v[3];\n su = accumulate(ALL(v), 0);\n int m; cin >> m;\n cin.ignore();\n REP(i, m) {\n string tmp;\n getline(cin, tmp);\n\n string s = \"\";\n int pos = 0;\n bool init = true;\n while(pos < SZ(tmp)) {\n while(pos < SZ(tmp) && tmp[pos] != ' ') {\n s += tmp[pos];\n pos++;\n }\n\n if(init) {\n init = false;\n s.pop_back();\n mp[s] = i;\n rule.emplace_back(vector<string>());\n } else {\n rule[i].emplace_back(s);\n }\n s = \"\";\n pos++;\n }\n }\n\n int len = 0;\n read(0, len);\n if(len != su) {\n cout << 0 << endl;\n return 0;\n }\n\n dp[0][0][0][0] = 1;\n\n int dj[4] = {1, 0, 0, 0};\n int dk[4] = {0, 1, 0, 0};\n int dl[4] = {0, 0, 1, 0};\n\n REP(i, su) {\n REP(j, v[0]+1) {\n REP(k, v[1]+1) {\n REP(l, v[2]+1) {\n for(auto &e: result[i]) {\n int nj = j + dj[e];\n int nk = k + dk[e];\n int nl = l + dl[e];\n\n if(nj <= v[0] && nk <= v[1] && nl <= v[2]) {\n dp[i+1][nj][nk][nl] = (dp[i+1][nj][nk][nl] + dp[i][j][k][l]) % MOD;\n }\n }\n }\n }\n }\n }\n\n cout << dp[su][v[0]][v[1]][v[2]] << endl;\n\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":105248,"score_of_the_acc":-1.0168,"final_rank":16},{"submission_id":"aoj_2437_4921223","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing P = pair<int,int>;\nusing PP = pair<P,P>;\n\nconstexpr ll MOD = 1000000007;\nconstexpr char DNA[] = \"ATGC\";\n\nint n[4], m, L = 0;\nmap<string,vector<string> > syn;\nvector<int> ls;\n\n// 構文解析\nvoid parse(string s){\n string label = \"\";\n auto itr = s.begin();\n while(*itr != ':'){\n label.push_back(*itr);\n itr++;\n }\n itr++;\n while(itr != s.end()){\n string t = \"\";\n itr++;\n while(itr != s.end() && *itr != ' '){\n t.push_back(*itr);\n itr++;\n }\n syn[label].push_back(t);\n }\n}\n\nbool dfs(string& label){\n for(auto &s : syn[label]){\n if(s[0] == '['){\n int x = 0;\n for(int i=1;i<int(s.size()-1);i++){\n for(int j=0;j<4;j++){\n if(s[i] == DNA[j]) x |= 1<<j;\n }\n }\n ls.push_back(x);\n if(ls.size() > L) return false;\n }else{\n if(!dfs(s)){\n return false;\n }\n }\n }\n return true;\n}\n\nll dp[2][52][52][52][52]{}; // i文字目(%2)まで見て各文字が[a][t][g][c]の通り\n\nint main(){\n for(int i=0;i<4;i++){\n cin >> n[i];\n L += n[i];\n }\n cin >> m;\n vector<string> s(m);\n string tmp;\n getline(cin, tmp);\n for(int i=0;i<m;i++){\n getline(cin, s[i]);\n parse(s[i]);\n }\n\n // 構文木からi文字目の終端記号を求める\n string start = s[0].substr(0,s[0].find(':'));\n if(!dfs(start) || ls.size() != L){\n cout << 0 << endl;\n }else{\n dp[0][0][0][0][0] = 1;\n for(int i=0;i<L;i++){\n for(int a=0;a<=min(i,n[0]);a++){\n for(int t=0;t<=min(i-a,n[1]);t++){\n for(int g=0;g<=min(i-a-t,n[2]);g++){\n int c = i-a-t-g;\n if(c > n[3]) continue;\n if((ls[i])&1){\n dp[(i&1)^1][a+1][t][g][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a+1][t][g][c] %= MOD;;\n }\n if((ls[i]>>1)&1){\n dp[(i&1)^1][a][t+1][g][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t+1][g][c] %= MOD;\n }\n if((ls[i]>>2)&1){\n dp[(i&1)^1][a][t][g+1][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t][g+1][c] %= MOD;\n }\n if((ls[i]>>3)&1){\n dp[(i&1)^1][a][t][g][c+1] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t][g][c+1] %= MOD;\n }\n }\n }\n }\n }\n cout << dp[L&1][n[0]][n[1]][n[2]][n[3]] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":115224,"score_of_the_acc":-1.118,"final_rank":18},{"submission_id":"aoj_2437_4921222","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing P = pair<int,int>;\nusing PP = pair<P,P>;\n\nconstexpr ll MOD = 1000000007;\nconstexpr char DNA[] = \"ATGC\";\n\nint n[4], m, L = 0;\nmap<string,vector<string> > syn;\nvector<int> ls;\n\n// 構文解析\nvoid parse(string s){\n string label = \"\";\n auto itr = s.begin();\n while(*itr != ':'){\n label.push_back(*itr);\n itr++;\n }\n itr++;\n while(itr != s.end()){\n string t = \"\";\n itr++;\n while(itr != s.end() && *itr != ' '){\n t.push_back(*itr);\n itr++;\n }\n syn[label].push_back(t);\n }\n}\n\nbool dfs(string& label){\n for(auto &s : syn[label]){\n if(s[0] == '['){\n int x = 0;\n for(int i=1;i<int(s.size()-1);i++){\n for(int j=0;j<4;j++){\n if(s[i] == DNA[j]) x |= 1<<j;\n }\n }\n ls.push_back(x);\n if(ls.size() > L) return false;\n }else{\n if(!dfs(s)){\n return false;\n }\n }\n }\n return true;\n}\n\nll dp[2][52][52][52][52]{}; // i文字目(%2)まで見て各文字が[a][t][g][c]の通り\n\nint main(){\n for(int i=0;i<4;i++){\n cin >> n[i];\n L += n[i];\n }\n cin >> m;\n vector<string> s(m);\n string tmp;\n getline(cin, tmp);\n for(int i=0;i<m;i++){\n getline(cin, s[i]);\n parse(s[i]);\n }\n\n // 構文木からi文字目の終端記号を求める\n string start = s[0].substr(0,s[0].find(':'));\n if(!dfs(start) || ls.size() != L){\n cout << 0 << endl;\n }else{\n dp[0][0][0][0][0] = 1;\n for(int i=0;i<L;i++){\n for(int a=0;a<=min(i,n[0]);a++){\n for(int t=0;t<=min(i-a,n[1]);t++){\n for(int g=0;g<=min(i-a-t,n[2]);g++){\n int c = i-a-t-g;\n if(c > n[3]) continue;\n if((ls[i])&1){\n dp[(i&1)^1][a+1][t][g][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a+1][t][g][c] %= MOD;;\n }\n if((ls[i]>>1)&1){\n dp[(i&1)^1][a][t+1][g][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t+1][g][c] %= MOD;\n }\n if((ls[i]>>2)&1){\n dp[(i&1)^1][a][t][g+1][c] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t][g+1][c] %= MOD;\n }\n if((ls[i]>>3)&1){\n dp[(i&1)^1][a][t][g][c+1] += dp[i&1][a][t][g][c];\n dp[(i&1)^1][a][t][g][c+1] %= MOD;\n }\n }\n }\n }\n // for(int a=0;a<=n[0];a++){\n // for(int t=0;t<=n[1];t++){\n // for(int g=0;g<=n[2];g++){\n // int c = i-a-t-g;\n // dp[i&1][a][t][g][c] = 0;\n // dp[(i&1)^1][a][t][g][c] %= MOD;\n \n // }\n // }\n // }\n }\n cout << dp[L&1][n[0]][n[1]][n[2]][n[3]] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":115300,"score_of_the_acc":-1.1073,"final_rank":17},{"submission_id":"aoj_2437_4898238","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-9;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nint box[256];\nvector<vector<int>>num;\nvector<string>s(N);\nvector<string>name;\nvector<vector<string>>to;\nmap<string, int>mp;\n\nint dp[52][52][52][52];\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tbox['A'] = 1;\n\tbox['T'] = 2;\n\tbox['G'] = 4;\n\tbox['C'] = 8;\n\tint a, b, c, d;\n\tcin >> a >> b >> c >> d;\n\tcin >> N;\n\tnum.resize(N);\n\ts.resize(N);\n\tcin.ignore();\n\tfor (auto &i : s)getline(cin, i);\n\tfor (auto i : s) {\n\t\tstring t;\n\t\tvector<string>u;\n\t\tfor (auto j : i) {\n\t\t\tif (j == ':')continue;\n\t\t\tif (j == ' ') {\n\t\t\t\tif (name.size() == to.size()) {\n\t\t\t\t\tmp[t] = M++;\n\t\t\t\t\tname.push_back(t);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tu.push_back(t);\n\t\t\t\t}\n\t\t\t\tt.clear();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tt.push_back(j);\n\t\t}\n\t\tu.push_back(t);\n\t\tto.push_back(u);\n\t}\n\tfor (int i = N - 1; i >= 0; i--) {\n\t\tfor (auto j : to[i]) {\n\t\t\tif (j[0] == '[') {\n\t\t\t\tint b = 0;\n\t\t\t\tfor (int k = 1; k < j.size() - 1; k++)b += box[j[k]];\n\t\t\t\tnum[i].push_back(b);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfor (auto k : num[mp[j]]) {\n\t\t\t\t\tnum[i].push_back(k);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (num[i].size() > 200)num[i].resize(201);\n\t}\n\tdp[0][0][0][0] = 1;\n\tif (num[0].size() != a + b + c + d) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tfor (int sum = 0; sum <= num[0].size(); sum++) {\n\t\tfor (int i = 0; i <= a; i++) {\n\t\t\tfor (int j = 0; j <= b && i + j <= sum; j++) {\n\t\t\t\tfor (int k = 0; k <= c && i + j + k <= sum; k++) {\n\t\t\t\t\tint l = sum - i - j - k;\n\t\t\t\t\tif (l<0 || l>d)continue;\n\t\t\t\t\tif ((num[0][sum] >> 0) & 1) {\n\t\t\t\t\t\tdp[i + 1][j][k][l] += dp[i][j][k][l];\n\t\t\t\t\t\tdp[i + 1][j][k][l] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t\tif ((num[0][sum] >> 1) & 1) {\n\t\t\t\t\t\tdp[i][j + 1][k][l] += dp[i][j][k][l];\n\t\t\t\t\t\tdp[i][j + 1][k][l] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t\tif ((num[0][sum] >> 2) & 1) {\n\t\t\t\t\t\tdp[i][j][k + 1][l] += dp[i][j][k][l];\n\t\t\t\t\t\tdp[i][j][k + 1][l] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t\tif ((num[0][sum] >> 3) & 1) {\n\t\t\t\t\t\tdp[i][j][k][l + 1] += dp[i][j][k][l];\n\t\t\t\t\t\tdp[i][j][k][l + 1] %= MOD;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << dp[a][b][c][d] << endl;\n}","accuracy":1,"time_ms":140,"memory_kb":31400,"score_of_the_acc":-0.3119,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2437_9582362\",\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 A[4], N;\\nmap<string,int> mp;\\nvector<vector<string>> S;\\nvector<string> C;\\n\\nvoid DFS(int X) {\\n rep(i,0,S[X].size()) {\\n if (S[X][i][0] == '[') C.push_back(S[X][i]);\\n else DFS(mp[S[X][i]]);\\n }\\n}\\n\\nint main() {\\n cin >> A[0] >> A[1] >> A[2] >> A[3] >> N;\\n S.resize(N);\\n vector<string> U;\\n string s;\\n while(cin >> s) {\\n U.push_back(s);\\n }\\n int Cur = -1;\\n rep(i,0,U.size()) {\\n if (U[i].back() == ':') {\\n Cur++;\\n mp[U[i].substr(0,U[i].size()-1)] = Cur;\\n }\\n else S[Cur].push_back(U[i]);\\n }\\n vector<ll> L(N,0);\\n rrep(i,0,N) {\\n rep(j,0,S[i].size()) {\\n if (S[i][j][0] == '[') L[i]++;\\n else L[i] += L[mp[S[i][j]]];\\n chmin(L[i],(ll)inf);\\n }\\n }\\n if (L[0] != A[0]+A[1]+A[2]+A[3]) {\\n cout << 0 << endl;\\n return 0;\\n }\\n static ll DP[51][51][51][51] = {};\\n DP[0][0][0][0] = 1;\\n DFS(0);\\n rep(s,0,C.size()) {\\n rep(i,0,51) {\\n rep(j,0,51) {\\n rep(k,0,51) {\\n int l = s-i-j-k;\\n if (l < 0) break;\\n DP[i][j][k][l] %= 1000000007;\\n string T = C[s];\\n rep(m,1,T.size()-1) {\\n if (T[m] == 'A' && i < 50) DP[i+1][j][k][l] += DP[i][j][k][l];\\n if (T[m] == 'T' && j < 50) DP[i][j+1][k][l] += DP[i][j][k][l];\\n if (T[m] == 'G' && k < 50) DP[i][j][k+1][l] += DP[i][j][k][l];\\n if (T[m] == 'C' && l < 50) DP[i][j][k][l+1] += DP[i][j][k][l];\\n }\\n }\\n }\\n }\\n }\\n cout << DP[A[0]][A[1]][A[2]][A[3]] % 1000000007 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 56364,\n \"score_of_the_acc\": -0.6498,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2437_9004273\",\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 Na = in(), Nt = in(), Ng = in(), Nc = in();\\n int m = in();\\n map<string, vector<string>> mp;\\n string key0 = \\\"\\\";\\n cin.ignore();\\n for(int _ : rep(m)) {\\n string s; getline(cin, s);\\n int mid = find(s.begin(), s.end(), ':') - s.begin();\\n string key = s.substr(0, mid);\\n if(_ == 0) key0 = key;\\n string t = s.substr(mid + 1);\\n vector<int> I;\\n for(int i : rep(int(t.size()))) if(t[i] == ' ') I.push_back(i);\\n I.push_back(t.size());\\n vector<string> value;\\n for(int i : rep(int(I.size()) - 1)) {\\n string u = t.substr(I[i] + 1, I[i + 1] - (I[i] + 1));\\n value.push_back(u);\\n }\\n mp[key] = value;\\n }\\n\\n const int len = Na + Nt + Ng + Nc;\\n\\n auto dfs = [&](auto self, string key) -> vector<string> {\\n vector<string> value = mp[key];\\n vector<string> res;\\n for(string v : value) {\\n if(v[0] == '[') {\\n res.push_back(v);\\n } else {\\n vector<string> v2 = self(self, v);\\n res.insert(res.end(), v2.begin(), v2.end());\\n }\\n if(len < res.size()) exit(print(0));\\n }\\n return res;\\n };\\n\\n vector<string> value = dfs(dfs, key0);\\n if(value.size() != len) return print(0);\\n const i64 MOD = 1e9+7;\\n vector dp(Na + 1, vector(Nt + 1, vector(Ng + 1, i64(0))));\\n dp[0][0][0] = 1;\\n for(int i : rep(len)) {\\n vector nt(Na + 1, vector(Nt + 1, vector(Ng + 1, i64(0))));\\n for(char c : value[i]) if(isalpha(c)) {\\n for(int a = 0; a <= Na; a++) {\\n for(int t = 0; t <= Nt; t++) {\\n for(int g = 0; g <= Ng; g++) {\\n if(c == 'A' and a + 1 <= Na) { nt[a + 1][t][g] += dp[a][t][g]; nt[a + 1][t][g] %= MOD; }\\n if(c == 'T' and t + 1 <= Nt) { nt[a][t + 1][g] += dp[a][t][g]; nt[a][t + 1][g] %= MOD; }\\n if(c == 'G' and g + 1 <= Ng) { nt[a][t][g + 1] += dp[a][t][g]; nt[a][t][g + 1] %= MOD; }\\n if(c == 'C') { nt[a][t][g] += dp[a][t][g]; nt[a][t][g] %= MOD; }\\n }\\n }\\n }\\n }\\n dp = move(nt);\\n }\\n\\n print(dp[Na][Nt][Ng]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 5128,\n \"score_of_the_acc\": -0.0921,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2437_8492072\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconstexpr int MOD = 1000000007;\\n\\nstruct LengthError {};\\n\\nstruct State {\\n using ATGC = std::array<int, 4>;\\n std::map<ATGC, int> mp;\\n State() {}\\n State(int a, int t, int g, int c) {\\n ATGC tu = {a, t, g, c};\\n mp[tu] = 1;\\n }\\n\\n void progress(std::string s) {\\n std::vector<int> index;\\n for (auto c: s) {\\n if (c == 'A') index.push_back(0);\\n if (c == 'T') index.push_back(1);\\n if (c == 'G') index.push_back(2);\\n if (c == 'C') index.push_back(3);\\n }\\n std::map<ATGC, int> next;\\n for (const auto& [atgc, val]: mp) {\\n for (auto i: index) {\\n if (atgc[i] > 0) {\\n auto next_atgc = atgc;\\n next_atgc[i]--;\\n auto& next_val = next[next_atgc];\\n next_val += val;\\n if (next_val > MOD) {\\n next_val -= MOD;\\n }\\n }\\n }\\n }\\n if (next.empty()) {\\n throw LengthError();\\n }\\n mp = std::move(next);\\n }\\n};\\n\\nstruct Parser {\\n std::vector<std::string> lines;\\n std::map<std::string, int> name_to_index;\\n\\n Parser(const std::vector<std::string>& s) {\\n for (int i = 0; i < (int)s.size(); i++) {\\n int pos = s[i].find(':');\\n auto name = s[i].substr(0, pos);\\n auto line = s[i].substr(pos + 2);\\n name_to_index[name] = i;\\n lines.push_back(line);\\n }\\n }\\n\\n State state;\\n int parse(int a, int t, int g, int c) {\\n state = State(a, t, g, c);\\n try {\\n match(0);\\n if (state.mp.size() != 1) {\\n return 0;\\n }\\n if (state.mp.find({0, 0, 0, 0}) == state.mp.end()) {\\n return 0;\\n }\\n return state.mp[{0, 0, 0, 0}];\\n } catch(LengthError) {\\n return 0;\\n }\\n }\\n\\n using Iter = std::string::const_iterator&;\\n\\n void skip(Iter it, char c) {\\n assert(*it == c);\\n ++it;\\n }\\n\\n void match(int id) {\\n auto it = lines[id].cbegin();\\n while (it != lines[id].end()) {\\n if (*it == '[') {\\n skip(it, '[');\\n std::string res;\\n while (it != lines[id].end() && std::isalpha(*it)) {\\n res.push_back(*it);\\n ++it;\\n }\\n skip(it, ']');\\n state.progress(res);\\n } else {\\n std::string name;\\n while (it != lines[id].end() && std::isalpha(*it)) {\\n name.push_back(*it);\\n ++it;\\n }\\n int nid = name_to_index[name];\\n match(nid);\\n }\\n if (it != lines[id].end()) skip(it, ' ');\\n }\\n }\\n};\\n\\nint main() {\\n int a, t, g, c;\\n std::cin >> a >> t >> g >> c;\\n int m;\\n std::cin >> m;\\n std::cin.ignore();\\n std::vector<std::string> lines(m);\\n for (int i = 0; i < m; i++) {\\n std::getline(std::cin, lines[i]);\\n }\\n\\n Parser parser(lines);\\n std::cout << parser.parse(a, t, g, c) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1420,\n \"memory_kb\": 13096,\n \"score_of_the_acc\": -0.8701,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2437_6781235\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = int;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vvvvvll = vector<vvvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\n\\nvector<ll> fact, factinv, inv;\\nll mod = 1e9 + 7;\\nvoid prenCkModp(ll n) {\\n fact.resize(n + 5);\\n factinv.resize(n + 5);\\n inv.resize(n + 5);\\n fact.at(0) = fact.at(1) = 1;\\n factinv.at(0) = factinv.at(1) = 1;\\n inv.at(1) = 1;\\n for (ll i = 2; i < n + 5; i++) {\\n fact.at(i) = (fact.at(i - 1) * i) % mod;\\n inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;\\n factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;\\n }\\n\\n}\\nll nCk(ll n, ll k) {\\n if (k < 0)return 0;\\n if (n < k) return 0;\\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\\n}\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll A, T, G, C;\\n cin >> A >> T >> G >> C;\\n ll N = A + T + G + C;\\n ll M;\\n cin >> M;\\n vector<string> V(M);\\n string S;\\n getline(cin, S);\\n rep(m, M) {\\n \\n getline(cin, S);\\n V[M - m - 1] = S;\\n }\\n map<string, vector<string>> DNA;\\n string num;\\n rep(m, M) {\\n ll L = 0;\\n \\n vector<string> res;\\n rep(j, V[m].size()) {\\n if (V[m][j] == ' ') {\\n if (L != 0) {\\n string AT = V[m].substr(L + 1, j-L-1);\\n if (AT[0] != '[') {\\n res.insert(res.end(), all(DNA[AT]));\\n }\\n else {\\n res.push_back(AT.substr(1,j-L-3));\\n }\\n L = j;\\n }\\n else {\\n num = V[m].substr(0, j-1);\\n L = j;\\n }\\n }\\n \\n }\\n ll j = V[m].size();\\n string AT = V[m].substr(L + 1, j - 1);\\n if (AT[0] != '[') {\\n res.insert(res.end(), all(DNA[AT]));\\n }\\n else {\\n res.push_back(AT.substr(1,j-L-3));\\n }\\n L = j;\\n if (res.size() > 200) {\\n cout << 0 << endl;\\n return 0;\\n }\\n DNA[num] = res;\\n }\\n\\n vvvll DP(A + 1, vvll(T + 1, vll(G + 1, 0)));\\n vector<string> DS = DNA[num];\\n if (DS.size() != N) {\\n cout << 0 << endl;\\n return 0;\\n }\\n DP[0][0][0] = 1;\\n ll mod = 1e9 + 7;\\n rep(i, N) {\\n vvvll NDP(A + 1, vvll(T + 1, vll(G + 1,0)));\\n rep(a, A + 1) {\\n rep(t, T + 1) {\\n rep(g, G + 1) {\\n rep(p, DS[i].size()) {\\n if (DS[i][p] == 'A') {\\n if (a != A)NDP[a + 1][t][g] += DP[a][t][g];\\n if (a != A)NDP[a + 1][t][g] %= mod;\\n }\\n if (DS[i][p] == 'T') {\\n if (t != T)NDP[a][t+1][g] += DP[a][t][g];\\n if (t != T)NDP[a][t+1][g] %= mod;\\n }\\n if (DS[i][p] == 'G') {\\n if (g != G)NDP[a][t][g + 1] += DP[a][t][g];\\n if (g != G)NDP[a][t][g + 1] %= mod;\\n }\\n if (DS[i][p] == 'C') {\\n NDP[a][t][g] += DP[a][t][g];\\n NDP[a][t][g] %= mod;\\n }\\n \\n }\\n }\\n }\\n }\\n DP = NDP;\\n }\\n cout << DP[A][T][G] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.1073,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2437_6772821\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef tabr\\n#include \\\"library/debug.cpp\\\"\\n#else\\n#define debug(...)\\n#endif\\n\\ntemplate <long long mod>\\nstruct modular {\\n long long value;\\n modular(long long x = 0) {\\n value = x % mod;\\n if (value < 0) value += mod;\\n }\\n modular& operator+=(const modular& other) {\\n if ((value += other.value) >= mod) value -= mod;\\n return *this;\\n }\\n modular& operator-=(const modular& other) {\\n if ((value -= other.value) < 0) value += mod;\\n return *this;\\n }\\n modular& operator*=(const modular& other) {\\n value = value * other.value % mod;\\n return *this;\\n }\\n modular& operator/=(const modular& other) {\\n long long a = 0, b = 1, c = other.value, m = mod;\\n while (c != 0) {\\n long long t = m / c;\\n m -= t * c;\\n swap(c, m);\\n a -= t * b;\\n swap(a, b);\\n }\\n a %= mod;\\n if (a < 0) a += mod;\\n value = value * a % mod;\\n return *this;\\n }\\n friend modular operator+(const modular& lhs, const modular& rhs) { return modular(lhs) += rhs; }\\n friend modular operator-(const modular& lhs, const modular& rhs) { return modular(lhs) -= rhs; }\\n friend modular operator*(const modular& lhs, const modular& rhs) { return modular(lhs) *= rhs; }\\n friend modular operator/(const modular& lhs, const modular& rhs) { return modular(lhs) /= rhs; }\\n modular& operator++() { return *this += 1; }\\n modular& operator--() { return *this -= 1; }\\n modular operator++(int) {\\n modular res(*this);\\n *this += 1;\\n return res;\\n }\\n modular operator--(int) {\\n modular res(*this);\\n *this -= 1;\\n return res;\\n }\\n modular operator-() const { return modular(-value); }\\n bool operator==(const modular& rhs) const { return value == rhs.value; }\\n bool operator!=(const modular& rhs) const { return value != rhs.value; }\\n bool operator<(const modular& rhs) const { return value < rhs.value; }\\n};\\ntemplate <long long mod>\\nstring to_string(const modular<mod>& x) {\\n return to_string(x.value);\\n}\\ntemplate <long long mod>\\nostream& operator<<(ostream& stream, const modular<mod>& x) {\\n return stream << x.value;\\n}\\ntemplate <long long mod>\\nistream& operator>>(istream& stream, modular<mod>& x) {\\n stream >> x.value;\\n x.value %= mod;\\n if (x.value < 0) x.value += mod;\\n return stream;\\n}\\n\\nconstexpr long long mod = (int) 1e9 + 7;\\nusing mint = modular<mod>;\\n\\nmint power(mint a, long long n) {\\n mint res = 1;\\n while (n > 0) {\\n if (n & 1) {\\n res *= a;\\n }\\n a *= a;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\nvector<mint> fact(1, 1);\\nvector<mint> finv(1, 1);\\n\\nmint C(int n, int k) {\\n if (n < k || k < 0) {\\n return mint(0);\\n }\\n while ((int) fact.size() < n + 1) {\\n fact.emplace_back(fact.back() * (int) fact.size());\\n finv.emplace_back(mint(1) / fact.back());\\n }\\n return fact[n] * finv[k] * finv[n - k];\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n vector<int> c(4);\\n for (int i = 0; i < 4; i++) {\\n cin >> c[i];\\n }\\n int m;\\n cin >> m;\\n vector<string> s;\\n string t;\\n while (cin >> t) {\\n s.emplace_back(t);\\n }\\n vector<vector<int>> a(m, vector<int>(16));\\n map<string, int> mp;\\n const string dna = \\\"ATGC\\\";\\n auto Get = [&](string w) {\\n int res = 0;\\n for (char x : w) {\\n for (int i = 0; i < 4; i++) {\\n if (x == dna[i]) {\\n res |= 1 << i;\\n }\\n }\\n }\\n return res;\\n };\\n for (int i = m - 1; i >= 0; i--) {\\n while (s.back().back() != ':') {\\n if (s.back().back() == ']') {\\n s.back().pop_back();\\n s.back().erase(s.back().begin());\\n a[i][Get(s.back())]++;\\n } else {\\n for (int j = 0; j < 16; j++) {\\n a[i][j] += a[mp[s.back()]][j];\\n }\\n }\\n s.pop_back();\\n }\\n s.back().pop_back();\\n mp[s.back()] = i;\\n s.pop_back();\\n }\\n if (*min_element(a[0].begin(), a[0].end()) >= 0 && accumulate(a[0].begin(), a[0].end(), 0) != accumulate(c.begin(), c.end(), 0)) {\\n cout << 0 << '\\\\n';\\n return 0;\\n }\\n vector<int> b;\\n for (int i = 0; i < 16; i++) {\\n for (int j = 0; j < a[0][i]; j++) {\\n b.emplace_back(i);\\n }\\n }\\n mint dp[52][52][52][52] = {};\\n dp[0][0][0][0] = 1;\\n int sum = 0;\\n for (int x : b) {\\n for (int i1 = 50; i1 >= 0; i1--) {\\n for (int i2 = 50; i2 >= 0; i2--) {\\n for (int i3 = 50; i3 >= 0; i3--) {\\n int i4 = sum - i1 - i2 - i3;\\n if (i4 < 0 || i4 > 50) {\\n continue;\\n }\\n for (int i = 0; i < 4; i++) {\\n if (~x & (1 << i)) {\\n continue;\\n }\\n auto [ni1, ni2, ni3, ni4] = make_tuple(i1, i2, i3, i4);\\n if (i == 0) {\\n ni1++;\\n } else if (i == 1) {\\n ni2++;\\n } else if (i == 2) {\\n ni3++;\\n } else {\\n ni4++;\\n }\\n dp[ni1][ni2][ni3][ni4] += dp[i1][i2][i3][i4];\\n }\\n dp[i1][i2][i3][i4] = 0;\\n }\\n }\\n }\\n sum++;\\n }\\n cout << dp[c[0]][c[1]][c[2]][c[3]] << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 60588,\n \"score_of_the_acc\": -0.5692,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2437_6772808\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef tabr\\n#include \\\"library/debug.cpp\\\"\\n#else\\n#define debug(...)\\n#endif\\n\\ntemplate <long long mod>\\nstruct modular {\\n long long value;\\n modular(long long x = 0) {\\n value = x % mod;\\n if (value < 0) value += mod;\\n }\\n modular& operator+=(const modular& other) {\\n if ((value += other.value) >= mod) value -= mod;\\n return *this;\\n }\\n modular& operator-=(const modular& other) {\\n if ((value -= other.value) < 0) value += mod;\\n return *this;\\n }\\n modular& operator*=(const modular& other) {\\n value = value * other.value % mod;\\n return *this;\\n }\\n modular& operator/=(const modular& other) {\\n long long a = 0, b = 1, c = other.value, m = mod;\\n while (c != 0) {\\n long long t = m / c;\\n m -= t * c;\\n swap(c, m);\\n a -= t * b;\\n swap(a, b);\\n }\\n a %= mod;\\n if (a < 0) a += mod;\\n value = value * a % mod;\\n return *this;\\n }\\n friend modular operator+(const modular& lhs, const modular& rhs) { return modular(lhs) += rhs; }\\n friend modular operator-(const modular& lhs, const modular& rhs) { return modular(lhs) -= rhs; }\\n friend modular operator*(const modular& lhs, const modular& rhs) { return modular(lhs) *= rhs; }\\n friend modular operator/(const modular& lhs, const modular& rhs) { return modular(lhs) /= rhs; }\\n modular& operator++() { return *this += 1; }\\n modular& operator--() { return *this -= 1; }\\n modular operator++(int) {\\n modular res(*this);\\n *this += 1;\\n return res;\\n }\\n modular operator--(int) {\\n modular res(*this);\\n *this -= 1;\\n return res;\\n }\\n modular operator-() const { return modular(-value); }\\n bool operator==(const modular& rhs) const { return value == rhs.value; }\\n bool operator!=(const modular& rhs) const { return value != rhs.value; }\\n bool operator<(const modular& rhs) const { return value < rhs.value; }\\n};\\ntemplate <long long mod>\\nstring to_string(const modular<mod>& x) {\\n return to_string(x.value);\\n}\\ntemplate <long long mod>\\nostream& operator<<(ostream& stream, const modular<mod>& x) {\\n return stream << x.value;\\n}\\ntemplate <long long mod>\\nistream& operator>>(istream& stream, modular<mod>& x) {\\n stream >> x.value;\\n x.value %= mod;\\n if (x.value < 0) x.value += mod;\\n return stream;\\n}\\n\\nconstexpr long long mod = (int) 1e9 + 7;\\nusing mint = modular<mod>;\\n\\nmint power(mint a, long long n) {\\n mint res = 1;\\n while (n > 0) {\\n if (n & 1) {\\n res *= a;\\n }\\n a *= a;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\nvector<mint> fact(1, 1);\\nvector<mint> finv(1, 1);\\n\\nmint C(int n, int k) {\\n if (n < k || k < 0) {\\n return mint(0);\\n }\\n while ((int) fact.size() < n + 1) {\\n fact.emplace_back(fact.back() * (int) fact.size());\\n finv.emplace_back(mint(1) / fact.back());\\n }\\n return fact[n] * finv[k] * finv[n - k];\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n vector<int> c(4);\\n for (int i = 0; i < 4; i++) {\\n cin >> c[i];\\n }\\n int m;\\n cin >> m;\\n vector<string> s;\\n string t;\\n while (cin >> t) {\\n s.emplace_back(t);\\n }\\n vector<vector<int>> a(m, vector<int>(16));\\n map<string, int> mp;\\n const string dna = \\\"ATGC\\\";\\n auto Get = [&](string w) {\\n int res = 0;\\n for (char x : w) {\\n for (int i = 0; i < 4; i++) {\\n if (x == dna[i]) {\\n res |= 1 << i;\\n }\\n }\\n }\\n return res;\\n };\\n for (int i = m - 1; i >= 0; i--) {\\n while (s.back().back() != ':') {\\n if (s.back().back() == ']') {\\n s.back().pop_back();\\n s.back().erase(s.back().begin());\\n a[i][Get(s.back())]++;\\n } else {\\n for (int j = 0; j < 16; j++) {\\n a[i][j] += a[mp[s.back()]][j];\\n }\\n }\\n s.pop_back();\\n }\\n s.back().pop_back();\\n mp[s.back()] = i;\\n s.pop_back();\\n }\\n if (*min_element(a[0].begin(), a[0].end()) >= 0 && accumulate(a[0].begin(), a[0].end(), 0) != accumulate(c.begin(), c.end(), 0)) {\\n cout << 0 << '\\\\n';\\n return 0;\\n }\\n vector<int> b;\\n for (int i = 0; i < 16; i++) {\\n for (int j = 0; j < a[0][i]; j++) {\\n b.emplace_back(i);\\n }\\n }\\n mint dp[52][52][52][52] = {};\\n dp[0][0][0][0] = 1;\\n for (int x : b) {\\n for (int i1 = 50; i1 >= 0; i1--) {\\n for (int i2 = 50; i2 >= 0; i2--) {\\n for (int i3 = 50; i3 >= 0; i3--) {\\n for (int i4 = 50; i4 >= 0; i4--) {\\n for (int i = 0; i < 4; i++) {\\n if (~x & (1 << i)) {\\n continue;\\n }\\n auto [ni1, ni2, ni3, ni4] = make_tuple(i1, i2, i3, i4);\\n if (i == 0) {\\n ni1++;\\n } else if (i == 1) {\\n ni2++;\\n } else if (i == 2) {\\n ni3++;\\n } else {\\n ni4++;\\n }\\n dp[ni1][ni2][ni3][ni4] += dp[i1][i2][i3][i4];\\n dp[i1][i2][i3][i4] = 0;\\n }\\n }\\n }\\n }\\n }\\n }\\n cout << dp[c[0]][c[1]][c[2]][c[3]] << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.023255813953488372,\n \"time_ms\": 160,\n \"memory_kb\": 60436,\n \"score_of_the_acc\": -0.5848,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2437_6381163\",\n \"code_snippet\": \"#line 2 \\\"library/bits/stdc++.h\\\"\\n\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <typeindex>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#endif\\n#line 2 \\\"Source.cpp\\\"\\nusing namespace std;\\n\\ntypedef string::const_iterator State;\\n#define eps 1e-8L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n#define MOD 998244353LL\\n#define pb push_back\\n#define mp make_pair\\ntypedef long long ll;\\ntypedef long double ld;\\n#define REP(a, b) for (long long(a) = 0; (a) < (b); ++(a))\\n#define ALL(x) (x).begin(), (x).end()\\n\\n#line 1 \\\"library/atcoder/modint.hpp\\\"\\n\\n\\n\\n#include <cassert>\\n#line 6 \\\"library/atcoder/modint.hpp\\\"\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n#line 1 \\\"library/atcoder/internal_math.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/internal_math.hpp\\\"\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast modular multiplication by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m < 2^31`\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n// @param n `n < 2^32`\\n// @param m `1 <= m < 2^32`\\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n // y_max < m * (n + 1)\\n // floor(y_max / m) <= n\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 1 \\\"library/atcoder/internal_type_traits.hpp\\\"\\n\\n\\n\\n#line 7 \\\"library/atcoder/internal_type_traits.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 14 \\\"library/atcoder/modint.hpp\\\"\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#line 17 \\\"Source.cpp\\\"\\nusing mint = atcoder::modint1000000007;\\n\\n#define int long long\\nmint dp[60][60][60][60];\\nvoid solve()\\n{\\n int cnts[4];\\n REP(i, 4)\\n {\\n cin >> cnts[i];\\n }\\n int t;\\n cin >> t;\\n cin.ignore();\\n vector<vector<string>> inputs;\\n REP(tea, t)\\n {\\n string l;\\n getline(cin, l);\\n vector<string> gogo;\\n string b;\\n l.push_back(' ');\\n REP(i, l.size())\\n {\\n if (l[i] == ' ')\\n {\\n if (b != \\\"\\\")\\n gogo.push_back(b);\\n b.clear();\\n }\\n else\\n {\\n b.push_back(l[i]);\\n }\\n }\\n gogo[0].pop_back();\\n inputs.push_back(gogo);\\n }\\n map<string, vector<int>> seqs;\\n reverse(ALL(inputs));\\n for (auto x : inputs)\\n {\\n vector<int> tmps;\\n for (int q = 1; q < x.size(); ++q)\\n {\\n if (x[q][0] == '[')\\n {\\n int cnt = 0;\\n string s = \\\"ATGC\\\";\\n for (auto y : x[q])\\n {\\n REP(t, 4)\\n {\\n if (s[t] == y)\\n {\\n cnt |= (1 << t);\\n }\\n }\\n }\\n tmps.push_back(cnt);\\n }\\n else\\n {\\n vector<int> hoge = seqs[x[q]];\\n for (auto y : hoge)\\n {\\n tmps.push_back(y);\\n }\\n }\\n if (tmps.size() > 300)\\n break;\\n }\\n seqs[x[0]] = tmps;\\n }\\n vector<int> target = seqs[inputs.back()[0]];\\n if (target.size() != cnts[0] + cnts[1] + cnts[2] + cnts[3])\\n {\\n cout << 0 << endl;\\n return;\\n }\\n dp[0][0][0][0] = 1;\\n REP(i, cnts[0] + 1)\\n {\\n REP(q, cnts[1] + 1)\\n {\\n REP(j, cnts[2] + 1)\\n {\\n REP(t, cnts[3] + 1)\\n {\\n int go = i + q + j + t;\\n if (i != cnts[0] and (target[go] & 1))\\n {\\n dp[i + 1][q][j][t] += dp[i][q][j][t];\\n }\\n\\n if (q != cnts[1] and (target[go] & 2))\\n {\\n dp[i][q + 1][j][t] += dp[i][q][j][t];\\n }\\n\\n if (j != cnts[2] and (target[go] & 4))\\n {\\n dp[i][q][j + 1][t] += dp[i][q][j][t];\\n }\\n\\n if (t != cnts[3] and (target[go] & 8))\\n {\\n dp[i][q][j][t + 1] += dp[i][q][j][t];\\n }\\n }\\n }\\n }\\n }\\n cout << dp[cnts[0]][cnts[1]][cnts[2]][cnts[3]].val() << endl;\\n}\\n\\n#undef int\\n\\n// generated by oj-template v4.7.2\\n// (https://github.com/online-judge-tools/template-generator)\\nint main()\\n{\\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 {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 54140,\n \"score_of_the_acc\": -0.4489,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2437_6087686\",\n \"code_snippet\": \"#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n\\n#include <utility>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n unsigned int umod() const { return _m; }\\n\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <iostream>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <array>\\n#include <string>\\n#include <map>\\n\\nusing namespace std;\\nusing mint = atcoder::modint1000000007;\\n\\nconst string atgc{\\\"ATGC\\\"};\\n\\nvector<string> parse(const string& s) {\\n vector<string> ss{\\\"\\\"};\\n for (auto c : s) {\\n if (c == ' ') {\\n ss.push_back(\\\"\\\");\\n } else if (c != ':') {\\n ss.back().push_back(c);\\n }\\n }\\n return ss;\\n}\\n\\nvoid solve() {\\n array<int, 4> gs;\\n for (auto& g : gs) cin >> g;\\n\\n int m;\\n cin >> m;\\n {\\n string tmp;\\n getline(cin, tmp);\\n }\\n\\n vector<vector<string>> sss(m);\\n for (auto& ss : sss) {\\n string s;\\n getline(cin, s);\\n ss = parse(s);\\n }\\n reverse(sss.begin(), sss.end());\\n\\n map<string, vector<int>> mp;\\n for (auto ss : sss) {\\n string name = ss.front();\\n ss.erase(ss.begin());\\n\\n vector<int> cnt(16, 0);\\n for (const auto& s : ss) {\\n if (s.front() == '[') {\\n int b = 0;\\n for (auto c : s) {\\n for (int i = 0; i < 4; ++i) {\\n if (c == atgc[i]) b |= (1 << i);\\n }\\n }\\n ++cnt[b];\\n } else {\\n auto v = mp[s];\\n for (int b = 0; b < 16; ++b) cnt[b] += v[b];\\n }\\n }\\n\\n mp[name] = cnt;\\n }\\n\\n auto cnt = mp[sss.back().front()];\\n\\n if (accumulate(cnt.begin(), cnt.end(), 0) !=\\n accumulate(gs.begin(), gs.end(), 0)) {\\n cout << \\\"0\\\\n\\\";\\n return;\\n }\\n\\n map<array<int, 4>, mint> dp, ndp;\\n dp[{0, 0, 0, 0}] = 1;\\n\\n for (int b = 0; b < 16; ++b) {\\n while (cnt[b]--) {\\n ndp.clear();\\n for (const auto& [is, p] : dp) {\\n for (int c = 0; c < 4; ++c) {\\n if ((~b >> c) & 1) continue;\\n\\n auto nis = is;\\n if (++nis[c] > gs[c]) continue;\\n ndp[nis] += p;\\n }\\n }\\n swap(dp, ndp);\\n }\\n }\\n\\n cout << dp[gs].val() << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1230,\n \"memory_kb\": 13320,\n \"score_of_the_acc\": -0.7648,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2437_6087682\",\n \"code_snippet\": \"#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\n\\n#include <utility>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n unsigned int umod() const { return _m; }\\n\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n constexpr long long bases[3] = {2, 7, 61};\\n for (long long a : bases) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\nunsigned long long floor_sum_unsigned(unsigned long long n,\\n unsigned long long m,\\n unsigned long long a,\\n unsigned long long b) {\\n unsigned long long ans = 0;\\n while (true) {\\n if (a >= m) {\\n ans += n * (n - 1) / 2 * (a / m);\\n a %= m;\\n }\\n if (b >= m) {\\n ans += n * (b / m);\\n b %= m;\\n }\\n\\n unsigned long long y_max = a * n + b;\\n if (y_max < m) break;\\n n = (unsigned long long)(y_max / m);\\n b = (unsigned long long)(y_max % m);\\n std::swap(m, a);\\n }\\n return ans;\\n}\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <iostream>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <string>\\n#include <map>\\n\\nusing namespace std;\\nusing mint = atcoder::modint1000000007;\\n\\nconst string atgc{\\\"ATGC\\\"};\\n\\nvector<string> parse(const string& s) {\\n vector<string> ss{\\\"\\\"};\\n for (auto c : s) {\\n if (c == ' ') {\\n ss.push_back(\\\"\\\");\\n } else if (c != ':') {\\n ss.back().push_back(c);\\n }\\n }\\n return ss;\\n}\\n\\nvoid solve() {\\n vector<int> gs(4);\\n for (auto& g : gs) cin >> g;\\n\\n int m;\\n cin >> m;\\n {\\n string tmp;\\n getline(cin, tmp);\\n }\\n\\n vector<vector<string>> sss(m);\\n for (auto& ss : sss) {\\n string s;\\n getline(cin, s);\\n ss = parse(s);\\n }\\n reverse(sss.begin(), sss.end());\\n\\n map<string, vector<int>> mp;\\n for (auto ss : sss) {\\n string name = ss.front();\\n ss.erase(ss.begin());\\n\\n vector<int> cnt(16, 0);\\n for (const auto& s : ss) {\\n if (s.front() == '[') {\\n int b = 0;\\n for (auto c : s) {\\n for (int i = 0; i < 4; ++i) {\\n if (c == atgc[i]) b |= (1 << i);\\n }\\n }\\n ++cnt[b];\\n } else {\\n auto v = mp[s];\\n for (int b = 0; b < 16; ++b) cnt[b] += v[b];\\n }\\n }\\n\\n mp[name] = cnt;\\n }\\n\\n auto cnt = mp[sss.back().front()];\\n\\n if (accumulate(cnt.begin(), cnt.end(), 0) !=\\n accumulate(gs.begin(), gs.end(), 0)) {\\n cout << \\\"0\\\\n\\\";\\n return;\\n }\\n\\n map<vector<int>, mint> dp;\\n dp[{0, 0, 0, 0}] = 1;\\n\\n for (int b = 0; b < 16; ++b) {\\n while (cnt[b]--) {\\n map<vector<int>, mint> ndp;\\n for (const auto& [is, p] : dp) {\\n for (int c = 0; c < 4; ++c) {\\n if ((~b >> c) & 1) continue;\\n\\n auto nis = is;\\n if (++nis[c] > gs[c]) continue;\\n ndp[nis] += p;\\n }\\n }\\n\\n swap(dp, ndp);\\n }\\n }\\n\\n cout << dp[gs].val() << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 20772,\n \"score_of_the_acc\": -1.1483,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2437_5967248\",\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>\\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\\nconstexpr ll mod = 1e9+7;\\n\\nint na,nt,ng,nc;\\nll dp[55][55][55][55];\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n for(int i=0;i<55;i++){\\n for(int j=0;j<55;j++){\\n for(int k=0;k<55;k++){\\n for(int l=0;l<55;l++){\\n dp[i][j][k][l] = -1;\\n }\\n }\\n }\\n }\\n cin >> na >> nt >> ng >> nc;\\n int m; cin >> m;\\n string base; getline(cin,base);\\n map<string,vector<string>> mp;\\n for(int i=0;i<m;i++){\\n string s; getline(cin,s);\\n stringstream ss(s);\\n string fr; ss >> fr;\\n fr.pop_back();\\n if(i == 0){\\n base = fr;\\n }\\n string t;\\n while(ss >> t){\\n mp[fr].push_back(t);\\n }\\n }\\n vector<int> v;\\n auto dfs=[&](auto self,string s)->void{\\n if(v.size()>na+nt+ng+nc){\\n cout << 0 << endl;\\n exit(0);\\n }\\n for(auto t:mp[s]){\\n if(t[0]=='['){\\n int u = 0;\\n for(int j=1;j+1<t.size();j++){\\n if(t[j] == 'A') u |= (1<<0);\\n if(t[j] == 'T') u |= (1<<1);\\n if(t[j] == 'G') u |= (1<<2);\\n if(t[j] == 'C') u |= (1<<3);\\n }\\n v.push_back(u);\\n }\\n else{\\n self(self, t);\\n }\\n }\\n if(v.size()>na+nt+ng+nc){\\n cout << 0 << endl;\\n exit(0);\\n }\\n };\\n dfs(dfs,base);\\n // for(auto ss:v){\\n // cout << ss << endl;\\n // }\\n auto cal = [&](auto self,int a,int t,int g,int c)->ll{\\n if(dp[a][t][g][c] != -1){\\n return dp[a][t][g][c];\\n }\\n if(a == na and t == nt and c == nc and g == ng){\\n dp[a][t][g][c] = 1;\\n return 1;\\n }\\n if(a > na or t > nt or g > ng or c > nc){\\n dp[a][t][g][c] = 0;\\n return 0;\\n }\\n ll res = 0;\\n int u = v[a+t+c+g];\\n if((1<<0)&u){\\n res += self(self,a+1,t,g,c);\\n }\\n if((1<<1)&u){\\n res += self(self,a,t+1,g,c);\\n }\\n if((1<<2)&u){\\n res += self(self,a,t,g+1,c);\\n }\\n if((1<<3)&u){\\n res += self(self,a,t,g,c+1);\\n }\\n res %= mod;\\n dp[a][t][g][c] = res;\\n return res;\\n };\\n cout << cal(cal,0,0,0,0) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 74976,\n \"score_of_the_acc\": -0.6706,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2437_5950011\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <uint64_t Modulus> class modint {\\n using i64 = int64_t;\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n\\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \\\"Modulus must be less than 2**31\\\");\\n static constexpr u32 mod = Modulus;\\n u32 v;\\n\\npublic:\\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\\n constexpr u32& val() noexcept { return v; }\\n constexpr const u32& val() const noexcept { return v; }\\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 {\\n v += rhs.v;\\n if (v >= mod) v -= mod;\\n return *this;\\n }\\n constexpr modint& operator-=(const modint& rhs) noexcept {\\n if (v < rhs.v) v += mod;\\n v -= rhs.v;\\n return *this;\\n }\\n constexpr modint& operator*=(const modint& rhs) noexcept {\\n v = (u64)v * rhs.v % mod;\\n return *this;\\n }\\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\\n constexpr modint pow(long long n) const noexcept {\\n assert(0 <= n);\\n modint self(*this), res(1);\\n while (n > 0) {\\n if (n & 1) res *= self;\\n self *= self;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr modint inv() const noexcept {\\n assert(*this != 0);\\n return pow(mod - 2);\\n }\\n constexpr modint& operator++() noexcept {\\n if (++v == mod) v = 0;\\n return *this;\\n }\\n constexpr modint& operator--() noexcept {\\n if (v == 0) v = mod;\\n return --v, *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint t = *this;\\n return ++*this, t;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint t = *this;\\n return --*this, t;\\n }\\n constexpr modint operator-() const noexcept { return modint(mod - v); }\\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\\n constexpr bool operator!() const noexcept { return !v; }\\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\\n i64 v;\\n rhs = modint{(s >> v, v)};\\n return s;\\n }\\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\\n};\\n\\n/**\\n * @brief modint\\n * @docs docs/modulo/modint.md\\n */\\n\\nconst long long MOD = 1000000007;\\nusing mint = modint<MOD>;\\nconst int MAX_N = 52;\\nmint dp[MAX_N][MAX_N][MAX_N][MAX_N];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int Na, Nb, Nc, Nd;\\n cin >> Na >> Nb >> Nc >> Nd;\\n int m;\\n cin >> m;\\n vector<string> S(m);\\n getline(cin, S[0]);\\n for (auto& s : S) getline(cin, s);\\n\\n size_t sum = Na + Nb + Nc + Nd;\\n vector<vector<int>> decomp(m);\\n map<string, int> mp;\\n\\n auto ctoi = [](char c) {\\n if (c == 'A') return 0;\\n if (c == 'T') return 1;\\n if (c == 'G') return 2;\\n if (c == 'C') return 3;\\n assert(false);\\n };\\n auto calc = [&](int idx, const string& s) {\\n size_t cur = 0;\\n string name = \\\"\\\";\\n while (s[cur] != ':') name += s[cur++];\\n cur += 2;\\n for (; cur < s.size() and decomp[idx].size() <= sum + 1; cur++) {\\n if (s[cur] == '[') {\\n int mask = 0;\\n cur++;\\n while (s[cur] != ']') mask |= 1 << (ctoi(s[cur++]));\\n decomp[idx].emplace_back(mask);\\n cur++;\\n } else {\\n string add = \\\"\\\";\\n while (cur < s.size() and s[cur] != ' ') add += s[cur++];\\n int x = mp[add];\\n for (auto& val : decomp[x]) decomp[idx].emplace_back(val);\\n }\\n }\\n mp[name] = idx;\\n };\\n for (int i = m - 1; i >= 0; i--) calc(i, S[i]);\\n\\n if (decomp[0].size() > sum) {\\n cout << 0 << '\\\\n';\\n return 0;\\n }\\n\\n dp[0][0][0][0] = 1;\\n for (int p = 0; p < int(decomp[0].size()); p++) {\\n int mask = decomp[0][p];\\n for (int i = min(Na, p); i >= 0; i--) {\\n for (int j = min(Nb, p - i); j >= 0; j--) {\\n for (int k = min(Nc, p - (i + j)); k >= 0; k--) {\\n for (int l = min(Nd, p - (i + j + k)); l >= 0; l--) {\\n mint& val = dp[i][j][k][l];\\n if (val == 0) continue;\\n if (i + 1 <= Na and (mask >> 0 & 1)) dp[i + 1][j][k][l] += val;\\n if (j + 1 <= Nb and (mask >> 1 & 1)) dp[i][j + 1][k][l] += val;\\n if (k + 1 <= Nc and (mask >> 2 & 1)) dp[i][j][k + 1][l] += val;\\n if (l + 1 <= Nd and (mask >> 3 & 1)) dp[i][j][k][l + 1] += val;\\n val = 0;\\n }\\n }\\n }\\n }\\n }\\n\\n mint ans = dp[Na][Nb][Nc][Nd];\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 31360,\n \"score_of_the_acc\": -0.594,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2437_5950008\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& 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}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<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 <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n#pragma endregion\\n\\n#include <cassert>\\n#include <cstdint>\\n#include <iostream>\\n\\ntemplate <uint64_t Modulus> class modint {\\n using i64 = int64_t;\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n\\n static_assert(Modulus < static_cast<uint32_t>(1) << 31, \\\"Modulus must be less than 2**31\\\");\\n static constexpr u32 mod = Modulus;\\n u32 v;\\n\\npublic:\\n constexpr modint(const i64 x = 0) noexcept : v(x < 0 ? mod - 1 - (-(x + 1) % mod) : x % mod) {}\\n constexpr u32& val() noexcept { return v; }\\n constexpr const u32& val() const noexcept { return v; }\\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 {\\n v += rhs.v;\\n if (v >= mod) v -= mod;\\n return *this;\\n }\\n constexpr modint& operator-=(const modint& rhs) noexcept {\\n if (v < rhs.v) v += mod;\\n v -= rhs.v;\\n return *this;\\n }\\n constexpr modint& operator*=(const modint& rhs) noexcept {\\n v = (u64)v * rhs.v % mod;\\n return *this;\\n }\\n constexpr modint& operator/=(const modint& rhs) noexcept { return *this *= rhs.inv(); }\\n constexpr modint pow(long long n) const noexcept {\\n assert(0 <= n);\\n modint self(*this), res(1);\\n while (n > 0) {\\n if (n & 1) res *= self;\\n self *= self;\\n n >>= 1;\\n }\\n return res;\\n }\\n constexpr modint inv() const noexcept {\\n assert(*this != 0);\\n return pow(mod - 2);\\n }\\n constexpr modint& operator++() noexcept {\\n if (++v == mod) v = 0;\\n return *this;\\n }\\n constexpr modint& operator--() noexcept {\\n if (v == 0) v = mod;\\n return --v, *this;\\n }\\n constexpr modint operator++(int) noexcept {\\n modint t = *this;\\n return ++*this, t;\\n }\\n constexpr modint operator--(int) noexcept {\\n modint t = *this;\\n return --*this, t;\\n }\\n constexpr modint operator-() const noexcept { return modint(mod - v); }\\n template <class T> friend constexpr modint operator+(T x, modint y) noexcept { return modint(x) + y; }\\n template <class T> friend constexpr modint operator-(T x, modint y) noexcept { return modint(x) - y; }\\n template <class T> friend constexpr modint operator*(T x, modint y) noexcept { return modint(x) * y; }\\n template <class T> friend constexpr modint operator/(T x, modint y) noexcept { return modint(x) / y; }\\n constexpr bool operator==(const modint& rhs) const noexcept { return v == rhs.v; }\\n constexpr bool operator!=(const modint& rhs) const noexcept { return v != rhs.v; }\\n constexpr bool operator!() const noexcept { return !v; }\\n friend std::istream& operator>>(std::istream& s, modint& rhs) noexcept {\\n i64 v;\\n rhs = modint{(s >> v, v)};\\n return s;\\n }\\n friend std::ostream& operator<<(std::ostream& s, const modint& rhs) noexcept { return s << rhs.v; }\\n};\\n\\n/**\\n * @brief modint\\n * @docs docs/modulo/modint.md\\n */\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nusing mint = modint<MOD>;\\nconst int MAX_N = 52;\\nmint dp[MAX_N][MAX_N][MAX_N][MAX_N];\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int Na, Nb, Nc, Nd;\\n cin >> Na >> Nb >> Nc >> Nd;\\n int m;\\n cin >> m;\\n vector<string> S(m);\\n getline(cin, S[0]);\\n for (auto& s : S) getline(cin, s);\\n\\n size_t sum = Na + Nb + Nc + Nd;\\n vector<vector<int>> decomp(m);\\n map<string, int> mp;\\n\\n auto ctoi = [](char c) {\\n if (c == 'A') return 0;\\n if (c == 'T') return 1;\\n if (c == 'G') return 2;\\n if (c == 'C') return 3;\\n assert(false);\\n };\\n auto calc = [&](int idx, const string& s) {\\n size_t cur = 0;\\n string name = \\\"\\\";\\n while (s[cur] != ':') name += s[cur++];\\n cur += 2;\\n for (; cur < s.size() and decomp[idx].size() <= sum + 1; cur++) {\\n if (s[cur] == '[') {\\n int mask = 0;\\n cur++;\\n while (s[cur] != ']') mask |= 1 << (ctoi(s[cur++]));\\n decomp[idx].emplace_back(mask);\\n cur++;\\n } else {\\n string add = \\\"\\\";\\n while (cur < s.size() and s[cur] != ' ') add += s[cur++];\\n int x = mp[add];\\n for (auto& val : decomp[x]) decomp[idx].emplace_back(val);\\n }\\n }\\n mp[name] = idx;\\n };\\n for (int i = m - 1; i >= 0; i--) calc(i, S[i]);\\n\\n if (decomp[0].size() > sum) {\\n cout << 0 << '\\\\n';\\n return 0;\\n }\\n\\n dp[0][0][0][0] = 1;\\n for (int p = 0; p < int(decomp[0].size()); p++) {\\n int mask = decomp[0][p];\\n for (int i = min(Na, p); i >= 0; i--) {\\n for (int j = min(Nb, p - i); j >= 0; j--) {\\n for (int k = min(Nc, p - (i + j)); k >= 0; k--) {\\n for (int l = min(Nd, p - (i + j + k)); l >= 0; l--) {\\n mint& val = dp[i][j][k][l];\\n if (val == 0) continue;\\n if (i + 1 <= Na and (mask >> 0 & 1)) dp[i + 1][j][k][l] += val;\\n if (j + 1 <= Nb and (mask >> 1 & 1)) dp[i][j + 1][k][l] += val;\\n if (k + 1 <= Nc and (mask >> 2 & 1)) dp[i][j][k + 1][l] += val;\\n if (l + 1 <= Nd and (mask >> 3 & 1)) dp[i][j][k][l + 1] += val;\\n val = 0;\\n }\\n }\\n }\\n }\\n }\\n\\n mint ans = dp[Na][Nb][Nc][Nd];\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 640,\n \"memory_kb\": 31284,\n \"score_of_the_acc\": -0.5933,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2437_5765703\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\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()\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 25000000;\\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-8;\\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);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\ntemplate <int mod> struct 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 mint = ModInt<mod>;\\n\\nmint dp[2][55][55][55];\\n\\nmap<string,vs> mp;\\n\\nint main(){\\n int na,nt,ng,nc; cin >> na >> nt >> ng >> nc;\\n int n = na+nt+ng+nc;\\n int m; cin >> m;\\n string s;\\n vs v;\\n string now = \\\"@\\\";\\n string fi;\\n while(cin >> s){\\n if(s.back() == ':'){\\n s.pop_back();\\n if(now == \\\"@\\\") fi = s;\\n else mp[now] = v;\\n v.clear();\\n now = s;\\n }else{\\n v.push_back(s);\\n }\\n }\\n mp[now] = v;\\n vs ls;\\n auto dfs = [&](auto &&dfs, string &t) -> void {\\n for(auto x : mp[t]){\\n if(ls.size() > n){\\n cout << 0 << endl;\\n exit(0);\\n }\\n if(x.back() == ']'){\\n ls.push_back(x);\\n }else{\\n dfs(dfs, x);\\n }\\n }\\n };\\n dfs(dfs, fi);\\n if(ls.size() != n){\\n cout << 0 << endl;\\n return 0;\\n }\\n dp[0][na][nt][ng] = 1;\\n rep(i,n){\\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1) dp[1][a][t][g] = 0;\\n string u = ls[i];\\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1){\\n int c = n-i-a-t-g;\\n if(c<0 || c>nc) continue;\\n for(auto ch : u){\\n if(ch=='A' && a>0) dp[1][a-1][t][g] += dp[0][a][t][g];\\n if(ch=='T' && t>0) dp[1][a][t-1][g] += dp[0][a][t][g];\\n if(ch=='G' && g>0) dp[1][a][t][g-1] += dp[0][a][t][g];\\n if(ch=='C' && c>0) dp[1][a][t][g] += dp[0][a][t][g]; \\n }\\n }\\n swap(dp[0],dp[1]);\\n }\\n cout << dp[0][0][0][0] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 4760,\n \"score_of_the_acc\": -0.0775,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2437_5765641\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n//#include <atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\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()\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 25000000;\\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-8;\\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);}\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\ntemplate <int mod> struct 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 mint = ModInt<mod>;\\n\\nmint dp[2][55][55][55];\\n\\nmap<string,vs> mp;\\n\\nint main(){\\n int na,nt,ng,nc; cin >> na >> nt >> ng >> nc;\\n int n = na+nt+ng+nc;\\n int m; cin >> m;\\n string s;\\n vs v;\\n string now = \\\"@\\\";\\n string fi;\\n while(cin >> s){\\n if(s.back() == ':'){\\n s.pop_back();\\n if(now == \\\"@\\\") fi = s;\\n else mp[now] = v;\\n v.clear();\\n now = s;\\n }else{\\n v.push_back(s);\\n }\\n }\\n mp[now] = v;\\n vs ls;\\n auto dfs = [&](auto &&dfs, string &t) -> void {\\n for(auto x : mp[t]){\\n if(ls.size() > n){\\n cout << 0 << endl;\\n exit(0);\\n }\\n if(x.back() == ']'){\\n ls.push_back(x);\\n }else{\\n dfs(dfs, x);\\n }\\n }\\n };\\n dfs(dfs, fi);\\n if(ls.size() != n){\\n cout << 0 << endl;\\n return 0;\\n }\\n dp[0][na][nt][ng] = 1;\\n rep(i,n){\\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1) dp[1][a][t][g] = 0;\\n string u = ls[i];\\n rep(a,na+1) rep(t,nt+1) rep(g,ng+1){\\n int c = n-i-a-t-g;\\n if(c<0 || c>nc) continue;\\n if(u.find('A')<=4 && a>0) dp[1][a-1][t][g] += dp[0][a][t][g];\\n if(u.find('T')<=4 && t>0) dp[1][a][t-1][g] += dp[0][a][t][g];\\n if(u.find('G')<=4 && g>0) dp[1][a][t][g-1] += dp[0][a][t][g];\\n if(u.find('C')<=4 && c>0) dp[1][a][t][g] += dp[0][a][t][g]; \\n }\\n swap(dp[0],dp[1]);\\n }\\n cout << dp[0][0][0][0] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 4768,\n \"score_of_the_acc\": -0.1058,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2437_5036010\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\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#define ALL(x) x.begin(), x.end()\\n#define POPCOUNT(x) __builtin_popcount(x)\\ntemplate <typename T> void chmin(T &a, const T &b) { a = min(a, b); }\\ntemplate <typename T> void chmax(T &a, const T &b) { a = max(a, b); }\\n\\nconst ll INF = 1LL << 60;\\nconst ll MOD = 1e9 + 7;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nvector<string> split(const string &S) {\\n vector<string> ret;\\n string s = \\\"\\\";\\n for (int i = 0; i < S.size(); i++) {\\n if (S[i] == ' ') {\\n ret.push_back(s);\\n s = \\\"\\\";\\n } else {\\n s.push_back(S[i]);\\n }\\n }\\n ret.push_back(s);\\n return ret;\\n}\\n\\nvector<string> vec[50];\\nvector<ll> memo[50];\\nmap<string, int> idx;\\nint dp[201][51][51][51];\\n\\nvoid dfs(int v) {\\n if (memo[v].size() != 0)\\n return;\\n vector<ll> ret(16);\\n for (const string &s : vec[v]) {\\n if (s[0] == '[') {\\n int b = 0;\\n for (int i = 1; i + 1 < s.size(); i++) {\\n if (s[i] == 'A')\\n b |= 1;\\n else if (s[i] == 'T')\\n b |= 2;\\n else if (s[i] == 'G')\\n b |= 4;\\n else\\n b |= 8;\\n }\\n ret[b] = min(ret[b] + 1, INF);\\n } else {\\n int k = idx[s];\\n dfs(k);\\n for (int i = 0; i < 16; i++)\\n ret[i] = min(ret[i] + memo[k][i], INF);\\n }\\n }\\n memo[v] = ret;\\n}\\n\\nint main() {\\n int Na, Nt, Ng, Nc;\\n cin >> Na >> Nt >> Ng >> Nc;\\n int m;\\n cin >> m;\\n string line;\\n getline(cin, line);\\n for (int i = 0; i < m; i++) {\\n getline(cin, line);\\n vector<string> ret = split(line);\\n string name = ret[0];\\n name.pop_back();\\n ret.erase(ret.begin());\\n idx[name] = i;\\n vec[i] = ret;\\n }\\n dfs(0);\\n ll len = 0;\\n for (int i = 0; i < 16; i++)\\n len = min(len + memo[0][i], INF);\\n if (len != Na + Nt + Ng + Nc) {\\n cout << 0 << endl;\\n return 0;\\n }\\n len = 0;\\n dp[0][0][0][0] = 1;\\n for (int i = 0; i < 16; i++) {\\n for (int j = 0; j < memo[0][i]; j++) {\\n for (int a = 0; a <= Na; a++) {\\n if (a > len)\\n break;\\n for (int t = 0; t <= Nt; t++) {\\n if (a + t > len)\\n break;\\n for (int g = 0; g <= Ng; g++) {\\n if (a + t + g > len)\\n break;\\n int c = len - (a + t + g);\\n for (int k = 0; k < 4; k++) {\\n if ((i & (1 << k)) == 0)\\n continue;\\n if (k == 0 && a + 1 <= Na)\\n (dp[len + 1][a + 1][t][g] +=\\n dp[len][a][t][g]) %= MOD;\\n if (k == 1 && t + 1 <= Nt)\\n (dp[len + 1][a][t + 1][g] +=\\n dp[len][a][t][g]) %= MOD;\\n if (k == 2 && g + 1 <= Ng)\\n (dp[len + 1][a][t][g + 1] +=\\n dp[len][a][t][g]) %= MOD;\\n if (k == 3 && c + 1 <= Nc)\\n (dp[len + 1][a][t][g] += dp[len][a][t][g]) %=\\n MOD;\\n }\\n }\\n }\\n }\\n len++;\\n }\\n }\\n cout << dp[len][Na][Nt][Ng] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 103784,\n \"score_of_the_acc\": -0.9358,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2437_4937819\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n#include<iostream>\\n#include<map>\\n#include<vector>\\n#include<array>\\nusing namespace std;\\n#line 3 \\\"/home/kotatsugame/library/math/modint.cpp\\\"\\n#include<utility>\\ntemplate<int m>\\nstruct modint{\\n\\tunsigned int x;\\n\\tconstexpr modint()noexcept:x(){}\\n\\ttemplate<typename T>\\n\\tconstexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}\\n\\tconstexpr unsigned int val()const noexcept{return x;}\\n\\tconstexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}\\n\\tconstexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}\\n\\tconstexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}\\n\\tconstexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}\\n\\tconstexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}\\n\\tconstexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}\\n\\tconstexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}\\n\\tconstexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}\\n\\tconstexpr modint operator+()const noexcept{return*this;}\\n\\tconstexpr modint operator-()const noexcept{return modint()-*this;}\\n\\tconstexpr modint pow(long long n)const noexcept\\n\\t{\\n\\t\\tif(n<0)return pow(-n).inv();\\n\\t\\tmodint x=*this,r=1;\\n\\t\\tfor(;n;x*=x,n>>=1)if(n&1)r*=x;\\n\\t\\treturn r;\\n\\t}\\n\\tconstexpr modint inv()const noexcept\\n\\t{\\n\\t\\tint s=x,t=m,x=1,u=0;\\n\\t\\twhile(t)\\n\\t\\t{\\n\\t\\t\\tint k=s/t;\\n\\t\\t\\ts-=k*t;\\n\\t\\t\\tswap(s,t);\\n\\t\\t\\tx-=k*u;\\n\\t\\t\\tswap(x,u);\\n\\t\\t}\\n\\t\\treturn modint(x);\\n\\t}\\n\\tfriend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}\\n\\tfriend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}\\n\\tfriend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}\\n\\tfriend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}\\n\\tfriend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}\\n\\tfriend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}\\n\\tfriend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}\\n\\tfriend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}\\n};\\n#line 7 \\\"a.cpp\\\"\\nusing mint=modint<(int)1e9+7>;\\nmint dp[51][51][51][51];\\nstring DNA=\\\"ATGC\\\";\\nint N[4],L;\\nint M;\\nmap<string,vector<string> >mp;\\nvector<int>X;\\nvoid f(string s)\\n{\\n\\tif(s[0]=='[')\\n\\t{\\n\\t\\tint T=0;\\n\\t\\tfor(int i=1;i+1<s.size();i++)\\n\\t\\t{\\n\\t\\t\\tfor(int j=0;j<4;j++)if(s[i]==DNA[j])T|=1<<j;\\n\\t\\t}\\n\\t\\tX.push_back(T);\\n\\t\\treturn;\\n\\t}\\n\\tfor(const string&t:mp[s])\\n\\t{\\n\\t\\tf(t);\\n\\t\\tif(X.size()>L)break;\\n\\t}\\n}\\nmain()\\n{\\n\\tfor(int i=0;i<4;i++)\\n\\t{\\n\\t\\tcin>>N[i];\\n\\t\\tL+=N[i];\\n\\t}\\n\\tcin>>M;\\n\\tcin.ignore();\\n\\tstring st;\\n\\tfor(int i=0;i<M;i++)\\n\\t{\\n\\t\\tstring in;\\n\\t\\tgetline(cin,in);\\n\\t\\tstring A=\\\"\\\";\\n\\t\\tvector<string>B;\\n\\t\\tint id=0;\\n\\t\\twhile(in[id]!=':')\\n\\t\\t{\\n\\t\\t\\tA+=in[id++];\\n\\t\\t}\\n\\t\\tif(i==0)st=A;\\n\\t\\tid++;\\n\\t\\tid++;\\n\\t\\twhile(id<in.size())\\n\\t\\t{\\n\\t\\t\\tstring now=\\\"\\\";\\n\\t\\t\\twhile(id<in.size()&&in[id]!=' ')\\n\\t\\t\\t{\\n\\t\\t\\t\\tnow+=in[id++];\\n\\t\\t\\t}\\n\\t\\t\\tB.push_back(now);\\n\\t\\t\\tid++;\\n\\t\\t}\\n\\t\\tmp[A]=B;\\n\\t}\\n\\tf(st);\\n\\tif(X.size()!=L)\\n\\t{\\n\\t\\tcout<<0<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tdp[N[0]][N[1]][N[2]][N[3]]=1;\\n\\tfor(int i=0;i<L;i++)\\n\\t{\\n\\t\\tint rest=L-i;\\n\\t\\tfor(int a=0;a<=N[0]&&a<=rest;a++)\\n\\t\\t\\tfor(int b=0;b<=N[1]&&a+b<=rest;b++)\\n\\t\\t\\t\\tfor(int c=0;c<=N[2]&&a+b+c<=rest;c++)\\n\\t\\t{\\n\\t\\t\\tint d=rest-a-b-c;\\n\\t\\t\\tif(d>N[3])continue;\\n\\t\\t\\tif(X[i]&1&&a>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[a-1][b][c][d]+=dp[a][b][c][d];\\n\\t\\t\\t}\\n\\t\\t\\tif(X[i]&2&&b>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[a][b-1][c][d]+=dp[a][b][c][d];\\n\\t\\t\\t}\\n\\t\\t\\tif(X[i]&4&&c>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[a][b][c-1][d]+=dp[a][b][c][d];\\n\\t\\t\\t}\\n\\t\\t\\tif(X[i]&8&&d>0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[a][b][c][d-1]+=dp[a][b][c][d];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<dp[0][0][0][0]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 29140,\n \"score_of_the_acc\": -0.2971,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2437_4925533\",\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=(int)(n)-1; i>=0; --i)\\n#define FOR(i, a, n) for (int i=(a); i<(n); ++i)\\n#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)\\n\\n#define SZ(x) ((int)(x).size())\\n#define ALL(x) (x).begin(),(x).end()\\n\\n#define DUMP(x) cerr<<#x<<\\\" = \\\"<<(x)<<endl\\n#define DEBUG(x) cerr<<#x<<\\\" = \\\"<<(x)<<\\\" (L\\\"<<__LINE__<<\\\")\\\"<<endl;\\n\\ntemplate<class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n os << \\\"[\\\";\\n REP(i, SZ(v)) {\\n if (i) os << \\\", \\\";\\n os << v[i];\\n }\\n return os << \\\"]\\\";\\n}\\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>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\nbool chmin(T &a, const T &b) {\\n if (b < a) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vi = vector<int>;\\nusing vll = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvll = vector<vll>;\\n\\nconst ll MOD = 1e9 + 7;\\nconst int INF = INT_MAX / 2;\\nconst ll LINF = LLONG_MAX / 2;\\nconst ld eps = 1e-9;\\n\\nvvi result;\\n\\nmap<string, int> mp;\\nvector<vector<string>> rule;\\nint su = 0;\\nvoid read(int i, int &len) {\\n REP(j, SZ(rule[i])) {\\n if(len > su) return;\\n if(rule[i][j][0] == '[') {\\n len++;\\n vi v;\\n for(int k=1;k<SZ(rule[i][j])-1;k++) {\\n switch(rule[i][j][k]) {\\n case 'A':\\n v.push_back(0);\\n break;\\n case 'T':\\n v.push_back(1);\\n break;\\n case 'G':\\n v.push_back(2);\\n break;\\n case 'C':\\n v.push_back(3);\\n break;\\n default:\\n assert(false);\\n break;\\n }\\n }\\n result.emplace_back(v);\\n } else {\\n read(mp[rule[i][j]], len);\\n if(len > su) return;\\n }\\n }\\n}\\n\\nint dp[201][51][51][51] = {0};\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n vi v(4); cin >> v[0] >> v[1] >> v[2] >> v[3];\\n su = accumulate(ALL(v), 0);\\n int m; cin >> m;\\n cin.ignore();\\n REP(i, m) {\\n string tmp;\\n getline(cin, tmp);\\n\\n string s = \\\"\\\";\\n int pos = 0;\\n bool init = true;\\n while(pos < SZ(tmp)) {\\n while(pos < SZ(tmp) && tmp[pos] != ' ') {\\n s += tmp[pos];\\n pos++;\\n }\\n\\n if(init) {\\n init = false;\\n s.pop_back();\\n mp[s] = i;\\n rule.emplace_back(vector<string>());\\n } else {\\n rule[i].emplace_back(s);\\n }\\n s = \\\"\\\";\\n pos++;\\n }\\n }\\n\\n int len = 0;\\n read(0, len);\\n if(len != su) {\\n cout << 0 << endl;\\n return 0;\\n }\\n\\n dp[0][0][0][0] = 1;\\n\\n int dj[4] = {1, 0, 0, 0};\\n int dk[4] = {0, 1, 0, 0};\\n int dl[4] = {0, 0, 1, 0};\\n\\n REP(i, su) {\\n REP(j, v[0]+1) {\\n REP(k, v[1]+1) {\\n REP(l, v[2]+1) {\\n for(auto &e: result[i]) {\\n int nj = j + dj[e];\\n int nk = k + dk[e];\\n int nl = l + dl[e];\\n\\n if(nj <= v[0] && nk <= v[1] && nl <= v[2]) {\\n dp[i+1][nj][nk][nl] = (dp[i+1][nj][nk][nl] + dp[i][j][k][l]) % MOD;\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n cout << dp[su][v[0]][v[1]][v[2]] << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 105248,\n \"score_of_the_acc\": -1.0168,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2437_4921223\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing P = pair<int,int>;\\nusing PP = pair<P,P>;\\n\\nconstexpr ll MOD = 1000000007;\\nconstexpr char DNA[] = \\\"ATGC\\\";\\n\\nint n[4], m, L = 0;\\nmap<string,vector<string> > syn;\\nvector<int> ls;\\n\\n// 構文解析\\nvoid parse(string s){\\n string label = \\\"\\\";\\n auto itr = s.begin();\\n while(*itr != ':'){\\n label.push_back(*itr);\\n itr++;\\n }\\n itr++;\\n while(itr != s.end()){\\n string t = \\\"\\\";\\n itr++;\\n while(itr != s.end() && *itr != ' '){\\n t.push_back(*itr);\\n itr++;\\n }\\n syn[label].push_back(t);\\n }\\n}\\n\\nbool dfs(string& label){\\n for(auto &s : syn[label]){\\n if(s[0] == '['){\\n int x = 0;\\n for(int i=1;i<int(s.size()-1);i++){\\n for(int j=0;j<4;j++){\\n if(s[i] == DNA[j]) x |= 1<<j;\\n }\\n }\\n ls.push_back(x);\\n if(ls.size() > L) return false;\\n }else{\\n if(!dfs(s)){\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nll dp[2][52][52][52][52]{}; // i文字目(%2)まで見て各文字が[a][t][g][c]の通り\\n\\nint main(){\\n for(int i=0;i<4;i++){\\n cin >> n[i];\\n L += n[i];\\n }\\n cin >> m;\\n vector<string> s(m);\\n string tmp;\\n getline(cin, tmp);\\n for(int i=0;i<m;i++){\\n getline(cin, s[i]);\\n parse(s[i]);\\n }\\n\\n // 構文木からi文字目の終端記号を求める\\n string start = s[0].substr(0,s[0].find(':'));\\n if(!dfs(start) || ls.size() != L){\\n cout << 0 << endl;\\n }else{\\n dp[0][0][0][0][0] = 1;\\n for(int i=0;i<L;i++){\\n for(int a=0;a<=min(i,n[0]);a++){\\n for(int t=0;t<=min(i-a,n[1]);t++){\\n for(int g=0;g<=min(i-a-t,n[2]);g++){\\n int c = i-a-t-g;\\n if(c > n[3]) continue;\\n if((ls[i])&1){\\n dp[(i&1)^1][a+1][t][g][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a+1][t][g][c] %= MOD;;\\n }\\n if((ls[i]>>1)&1){\\n dp[(i&1)^1][a][t+1][g][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t+1][g][c] %= MOD;\\n }\\n if((ls[i]>>2)&1){\\n dp[(i&1)^1][a][t][g+1][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t][g+1][c] %= MOD;\\n }\\n if((ls[i]>>3)&1){\\n dp[(i&1)^1][a][t][g][c+1] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t][g][c+1] %= MOD;\\n }\\n }\\n }\\n }\\n }\\n cout << dp[L&1][n[0]][n[1]][n[2]][n[3]] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 115224,\n \"score_of_the_acc\": -1.118,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2437_4921222\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing P = pair<int,int>;\\nusing PP = pair<P,P>;\\n\\nconstexpr ll MOD = 1000000007;\\nconstexpr char DNA[] = \\\"ATGC\\\";\\n\\nint n[4], m, L = 0;\\nmap<string,vector<string> > syn;\\nvector<int> ls;\\n\\n// 構文解析\\nvoid parse(string s){\\n string label = \\\"\\\";\\n auto itr = s.begin();\\n while(*itr != ':'){\\n label.push_back(*itr);\\n itr++;\\n }\\n itr++;\\n while(itr != s.end()){\\n string t = \\\"\\\";\\n itr++;\\n while(itr != s.end() && *itr != ' '){\\n t.push_back(*itr);\\n itr++;\\n }\\n syn[label].push_back(t);\\n }\\n}\\n\\nbool dfs(string& label){\\n for(auto &s : syn[label]){\\n if(s[0] == '['){\\n int x = 0;\\n for(int i=1;i<int(s.size()-1);i++){\\n for(int j=0;j<4;j++){\\n if(s[i] == DNA[j]) x |= 1<<j;\\n }\\n }\\n ls.push_back(x);\\n if(ls.size() > L) return false;\\n }else{\\n if(!dfs(s)){\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nll dp[2][52][52][52][52]{}; // i文字目(%2)まで見て各文字が[a][t][g][c]の通り\\n\\nint main(){\\n for(int i=0;i<4;i++){\\n cin >> n[i];\\n L += n[i];\\n }\\n cin >> m;\\n vector<string> s(m);\\n string tmp;\\n getline(cin, tmp);\\n for(int i=0;i<m;i++){\\n getline(cin, s[i]);\\n parse(s[i]);\\n }\\n\\n // 構文木からi文字目の終端記号を求める\\n string start = s[0].substr(0,s[0].find(':'));\\n if(!dfs(start) || ls.size() != L){\\n cout << 0 << endl;\\n }else{\\n dp[0][0][0][0][0] = 1;\\n for(int i=0;i<L;i++){\\n for(int a=0;a<=min(i,n[0]);a++){\\n for(int t=0;t<=min(i-a,n[1]);t++){\\n for(int g=0;g<=min(i-a-t,n[2]);g++){\\n int c = i-a-t-g;\\n if(c > n[3]) continue;\\n if((ls[i])&1){\\n dp[(i&1)^1][a+1][t][g][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a+1][t][g][c] %= MOD;;\\n }\\n if((ls[i]>>1)&1){\\n dp[(i&1)^1][a][t+1][g][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t+1][g][c] %= MOD;\\n }\\n if((ls[i]>>2)&1){\\n dp[(i&1)^1][a][t][g+1][c] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t][g+1][c] %= MOD;\\n }\\n if((ls[i]>>3)&1){\\n dp[(i&1)^1][a][t][g][c+1] += dp[i&1][a][t][g][c];\\n dp[(i&1)^1][a][t][g][c+1] %= MOD;\\n }\\n }\\n }\\n }\\n // for(int a=0;a<=n[0];a++){\\n // for(int t=0;t<=n[1];t++){\\n // for(int g=0;g<=n[2];g++){\\n // int c = i-a-t-g;\\n // dp[i&1][a][t][g][c] = 0;\\n // dp[(i&1)^1][a][t][g][c] %= MOD;\\n \\n // }\\n // }\\n // }\\n }\\n cout << dp[L&1][n[0]][n[1]][n[2]][n[3]] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 115300,\n \"score_of_the_acc\": -1.1073,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2437_4898238\",\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-9;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nint box[256];\\nvector<vector<int>>num;\\nvector<string>s(N);\\nvector<string>name;\\nvector<vector<string>>to;\\nmap<string, int>mp;\\n\\nint dp[52][52][52][52];\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tbox['A'] = 1;\\n\\tbox['T'] = 2;\\n\\tbox['G'] = 4;\\n\\tbox['C'] = 8;\\n\\tint a, b, c, d;\\n\\tcin >> a >> b >> c >> d;\\n\\tcin >> N;\\n\\tnum.resize(N);\\n\\ts.resize(N);\\n\\tcin.ignore();\\n\\tfor (auto &i : s)getline(cin, i);\\n\\tfor (auto i : s) {\\n\\t\\tstring t;\\n\\t\\tvector<string>u;\\n\\t\\tfor (auto j : i) {\\n\\t\\t\\tif (j == ':')continue;\\n\\t\\t\\tif (j == ' ') {\\n\\t\\t\\t\\tif (name.size() == to.size()) {\\n\\t\\t\\t\\t\\tmp[t] = M++;\\n\\t\\t\\t\\t\\tname.push_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tu.push_back(t);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tt.clear();\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tt.push_back(j);\\n\\t\\t}\\n\\t\\tu.push_back(t);\\n\\t\\tto.push_back(u);\\n\\t}\\n\\tfor (int i = N - 1; i >= 0; i--) {\\n\\t\\tfor (auto j : to[i]) {\\n\\t\\t\\tif (j[0] == '[') {\\n\\t\\t\\t\\tint b = 0;\\n\\t\\t\\t\\tfor (int k = 1; k < j.size() - 1; k++)b += box[j[k]];\\n\\t\\t\\t\\tnum[i].push_back(b);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tfor (auto k : num[mp[j]]) {\\n\\t\\t\\t\\t\\tnum[i].push_back(k);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (num[i].size() > 200)num[i].resize(201);\\n\\t}\\n\\tdp[0][0][0][0] = 1;\\n\\tif (num[0].size() != a + b + c + d) {\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tfor (int sum = 0; sum <= num[0].size(); sum++) {\\n\\t\\tfor (int i = 0; i <= a; i++) {\\n\\t\\t\\tfor (int j = 0; j <= b && i + j <= sum; j++) {\\n\\t\\t\\t\\tfor (int k = 0; k <= c && i + j + k <= sum; k++) {\\n\\t\\t\\t\\t\\tint l = sum - i - j - k;\\n\\t\\t\\t\\t\\tif (l<0 || l>d)continue;\\n\\t\\t\\t\\t\\tif ((num[0][sum] >> 0) & 1) {\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j][k][l] += dp[i][j][k][l];\\n\\t\\t\\t\\t\\t\\tdp[i + 1][j][k][l] %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif ((num[0][sum] >> 1) & 1) {\\n\\t\\t\\t\\t\\t\\tdp[i][j + 1][k][l] += dp[i][j][k][l];\\n\\t\\t\\t\\t\\t\\tdp[i][j + 1][k][l] %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif ((num[0][sum] >> 2) & 1) {\\n\\t\\t\\t\\t\\t\\tdp[i][j][k + 1][l] += dp[i][j][k][l];\\n\\t\\t\\t\\t\\t\\tdp[i][j][k + 1][l] %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif ((num[0][sum] >> 3) & 1) {\\n\\t\\t\\t\\t\\t\\tdp[i][j][k][l + 1] += dp[i][j][k][l];\\n\\t\\t\\t\\t\\t\\tdp[i][j][k][l + 1] %= MOD;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dp[a][b][c][d] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 31400,\n \"score_of_the_acc\": -0.3119,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1399,"cells":{"group_id":{"kind":"string","value":"aoj_2441_cpp"},"problem_description":{"kind":"string","value":"FizzBuzz\nFizzBuzzとは、1以上の整数を順に、以下のルールに従って発言していくゲームである。\n3で割り切れる時には「Fizz」\n5で割り切れる時には「Buzz」\n3と5の両方で割り切れる時には「FizzBuzz」\nそれ以外の時はその数字\nゲームの進行状況の例を以下に示す。\n1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, 16, …\n得られた発言を1つの文字列に結合し得られた文字列をFizzBuzz Stringと呼ぶ。インデックスsが与えられるので、FizzBuzz Stringのs文字目から20文字を出力せよ。但し、インデックスは1から始まるものとし、得られた文字列の長さは十分に大きい（s+20以上）としてよい。\nInput\n入力は以下の形式で与えられる\ns\nConstraints\ns\nは整数である\n1 ≤\ns\n≤ 10\n18\nOutput\nFizzBuzz Stringのs文字目から20文字を1行に出力せよ\nSample Input 1\n1\nOutput for the Sample Input 1\n12Fizz4BuzzFizz78Fiz\nSample Input 2\n20\nOutput for the Sample Input 2\nzzBuzz11Fizz1314Fizz\nSample Input 3\n10000000000\nOutput for the Sample Input 3\n93FizzBuzz1418650796"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2441_2971948","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <sstream>\nusing namespace std;\n\n// calc digit-dp\n// dp[(桁)][(num of leading-zero)][smaller][15 で割ったあまり] :＝ 個数\nlong long dp[21][21][3][16];\nlong long calc(long long num) {\n memset(dp, 0, sizeof(dp));\n dp[0][0][0][0] = 1;\n stringstream ss; ss << num;\n string str = ss.str(); ss >> str;\n for (int i = 0; i <= str.size(); ++i) {\n\tfor (int j = 0; j <= i; ++j) {\n\t for (int mod = 0; mod < 15; ++mod) {\n\t\t//cout << i << \", \" << j << \", \" << mod << \": \" << dp[i][j][0][mod] << \", \" << dp[i][j][1][mod] << endl;\n\t }\n\t}\n\n\tif (i == str.size()) break;\n\tint cur = (int)(str[i] - '0');\n\tfor (int mod = 0; mod < 15; ++mod) {\n\t // (leading zero = i, exact(0)) ->\n\t if (cur == 0) dp[i+1][i+1][0][mod*10%15] += dp[i][i][0][mod];\n\t else dp[i+1][i+1][1][mod*10%15] += dp[i][i][0][mod];\n\t if (cur != 0) dp[i+1][i][0][(mod*10+cur)%15] += dp[i][i][0][mod];\n\t for (int c = 1; c < cur; ++c) {\n\t\tdp[i+1][i][1][(mod*10+c)%15] += dp[i][i][0][mod];\n\t }\n\n\t // (leading zero = i, smaller(1)) ->\n\t dp[i+1][i+1][1][mod*10%15] += dp[i][i][1][mod];\n\t for (int c = 1; c < 10; ++c) {\n\t\tdp[i+1][i][1][(mod*10+c)%15] += dp[i][i][1][mod];\n\t }\n\n\t // (leading zero < i, exact(0)) ->\n\t for (int j = 0; j < i; ++j) {\n\t\tdp[i+1][j][0][(mod*10+cur)%15] += dp[i][j][0][mod];\n\t\tfor (int c = 0; c < cur; ++c) {\n\t\t dp[i+1][j][1][(mod*10+c)%15] += dp[i][j][0][mod];\n\t\t}\n\t }\n\n\t // (leading zero < i, smaller(1)) ->\n\t for (int j = 0; j < i; ++j) {\n\t\tfor (int c = 0; c < 10; ++c) {\n\t\t dp[i+1][j][1][(mod*10+c)%15] += dp[i][j][1][mod];\n\t\t}\n\t }\n\t}\n }\n\n // num\n long long res = 0;\n for (int j = 0; j < str.size(); ++j) {\n\tfor (int mod = 0; mod < 15; ++mod) {\n\t if (mod % 3 == 0) continue;\n\t if (mod % 5 == 0) continue;\n\t long long num = dp[str.size()][j][0][mod] + dp[str.size()][j][1][mod];\n\t res += num * ((long long)str.size() - j);\n\t}\n }\n\n // fizzbuzz\n long long fizzbuzz = (num/3) * 4 + (num/5) * 4;\n\n return res + fizzbuzz;\n}\n\nint main() {\n /*\n calc(2036);\n \n for (int i = 0; i <= 1000; ++i) {\n\t\tcout << i << \": \" << calc(i) << endl;\n }\n */\n \n long long s; cin >> s;\n // 1 から x までの文字列の総数が s 未満となる最大の x を求める\n long long low = 0, high = 1LL<<58;\n while (high - low > 1) {\n\tlong long mid = (high + low) / 2;\n\tlong long all = calc(mid);\n\tif (all >= s) high = mid;\n\telse low = mid;\n }\n\n long long rem = s - calc(low) - 1;\n stringstream ss;\n for (long long i = high; i < high + 20; ++i) {\n\tif (i % 15 == 0) ss << \"FizzBuzz\";\n\telse if (i % 3 == 0) ss << \"Fizz\";\n\telse if (i % 5 == 0) ss << \"Buzz\";\n\telse ss << i;\n }\n string res = ss.str();\n cout << res.substr(rem, 20) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3364,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2441_1631357","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,19,21,23,17,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\telse if (a == 2107639015) { zure = 7; }\n\telse if (a == 10000000000) { zure = 7; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":11400,"score_of_the_acc":-2,"final_rank":2},{"submission_id":"aoj_2441_1631353","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,19,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\telse if (a == 2107639015) { zure = 7; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.5882352941176471,"time_ms":70,"memory_kb":11400,"score_of_the_acc":-1.8571,"final_rank":3},{"submission_id":"aoj_2441_1631349","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,15,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\telse if (a == 2107639015) { zure = 7; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.5588235294117647,"time_ms":60,"memory_kb":11300,"score_of_the_acc":-1.7018,"final_rank":4},{"submission_id":"aoj_2441_1631347","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\telse if (a == 2107639015) { zure = 7; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.5588235294117647,"time_ms":60,"memory_kb":11400,"score_of_the_acc":-1.7143,"final_rank":5},{"submission_id":"aoj_2441_1631346","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.4117647058823529,"time_ms":60,"memory_kb":11400,"score_of_the_acc":-1.7143,"final_rank":6},{"submission_id":"aoj_2441_1631344","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,10,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.17647058823529413,"time_ms":60,"memory_kb":11296,"score_of_the_acc":-1.7013,"final_rank":12},{"submission_id":"aoj_2441_1631343","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,3,6,6,6,6,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.35294117647058826,"time_ms":60,"memory_kb":11368,"score_of_the_acc":-1.7103,"final_rank":7},{"submission_id":"aoj_2441_1631340","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 29; }\n\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.2647058823529412,"time_ms":60,"memory_kb":11400,"score_of_the_acc":-1.7143,"final_rank":8},{"submission_id":"aoj_2441_1631337","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 32421014018) { zure = 6; }\n\telse if (a == 74717179160750) { zure = 13; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.20588235294117646,"time_ms":60,"memory_kb":11220,"score_of_the_acc":-1.6919,"final_rank":9},{"submission_id":"aoj_2441_1631331","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,30 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 6; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.20588235294117646,"time_ms":60,"memory_kb":11356,"score_of_the_acc":-1.7088,"final_rank":10},{"submission_id":"aoj_2441_1631327","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,3,10,15,18,21,23,25,27,28,30 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 6; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.17647058823529413,"time_ms":60,"memory_kb":11312,"score_of_the_acc":-1.7033,"final_rank":13},{"submission_id":"aoj_2441_1631324","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 4,6,8,10,11,12,13,14,15,16,17,18,19,20,21,23,25,27,28,30 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 6; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.17647058823529413,"time_ms":60,"memory_kb":11236,"score_of_the_acc":-1.6939,"final_rank":11},{"submission_id":"aoj_2441_1631323","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 4,6,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 6; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.058823529411764705,"time_ms":50,"memory_kb":11300,"score_of_the_acc":-1.559,"final_rank":18},{"submission_id":"aoj_2441_1631322","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,7,8,9,11,11,11,12,12,13,13 };\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tzure = k[to_string(a).size()];\n\tif (a == 41155212030742136) { zure = 27; }\n\telse if (a == 32421014018) { zure = 6; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.14705882352941177,"time_ms":60,"memory_kb":11356,"score_of_the_acc":-1.7088,"final_rank":15},{"submission_id":"aoj_2441_1631317","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 6; }\n\telse { zure = 27; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.14705882352941177,"time_ms":60,"memory_kb":11200,"score_of_the_acc":-1.6894,"final_rank":14},{"submission_id":"aoj_2441_1631316","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse if (a == 32421014018) { zure = 10; }\n\telse { zure = 27; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.11764705882352941,"time_ms":60,"memory_kb":11356,"score_of_the_acc":-1.7088,"final_rank":17},{"submission_id":"aoj_2441_1631312","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse { zure = 27; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.11764705882352941,"time_ms":60,"memory_kb":11308,"score_of_the_acc":-1.7028,"final_rank":16},{"submission_id":"aoj_2441_1631309","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\nint zure;\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tif (a == 1000000000000000000) { zure = 13; }\n\telse { zure = 14; }\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - zure, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.058823529411764705,"time_ms":60,"memory_kb":11256,"score_of_the_acc":-1.6964,"final_rank":19},{"submission_id":"aoj_2441_1631305","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\nusing namespace std;\nstring S;\n\nlong long a, s, t, u;\n\nlong long num(long long p) {\n\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\n\tlong long res1, res2;\n\tfor (int i = 1; i <= 18; i++) {\n\t\tif (p <= pow(10, i)) {\n\t\t\tv = i;\n\t\t\tLO = p - pow(10, i);\n\t\t\tHI = pow(10, i + 1) - p;\n\t\t\tbreak;\n\t\t}\n\t}\n\tx[0] = 1;\n\tx[1] = 22;//1 - 9.\n\tfor (int i = 2; i <= 18; i++) {\n\t\tx[i] = x[i - 1];\n\t\tfor (int j = 0; j <= 5; j++) {\n\t\t\tc = (long long)pow(10, i - 1) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\n\t\tw = 32 + 8 * i;\n\t\tw *= c;\n\t\tx[i] += w;\n\t\tfor (int j = -9; j < 0; j++) {\n\t\t\tc = (long long)pow(10, i) + j;\n\t\t\tif (c % 15 == 0) { x[i] += 8; }\n\t\t\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\n\t\t\telse { x[i] += i; }\n\t\t}\n\t}\n\n\tfor (int i = 0; i <= 18; i++) {\n\t\tif (x[i + 1] >= p) {\n\t\t\tr = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tsum = x[r];\n\tres1 = (long long)(pow(10, r));\n\td = 5;\n\tif (r == 0) { d = 4; }\n\n\tfor (int i = 0; i <= d; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = (long long)pow(10, r) + i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r + 1; }\n\t\tres1++;\n\t}\n\n\tw = 40 + 8 * r;\n\tres1 += ((p - sum) / w) * 15;\n\tsum += ((p - sum) / w)*w;\n\tfor (int i = 1; i <= 15; i++) {\n\t\tif (sum >= p) { goto E; }\n\t\tc = i;\n\t\tif (c % 15 == 0) { sum += 8; }\n\t\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\n\t\telse { sum += r; }\n\t\tres1++;\n\t}\n\nE:;\n\tres2 = sum - p;\n\tgoto G;\nF:;\nG:;\n\treturn res1 * 100 + res2;\n}\n\nint cnt = 0;\n\nint main() {\n\tcin >> a;\n\tif (a < 5000000) {\n\t\tfor (int i = 1; i <= 1000000; i++) {\n\t\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\t\telse { S += to_string(i); }\n\t\t}\n\t\tcout << S.substr(a - 1, 20) << endl;\n\t\tgoto Exit;\n\t}\n\ts = num(a);\n\tt = s / 100;\n\tu = s % 100;\n\tfor (long long i = t - 10; i < t + 20; i++) {\n\t\tif (i % 15 == 0) { S += \"FizzBuzz\"; }\n\t\telse if (i % 3 == 0) { S += \"Fizz\"; }\n\t\telse if (i % 5 == 0) { S += \"Buzz\"; }\n\t\telse { S += to_string(i); }\n\t\tif (i == t - 1) { cnt = S.size(); }\n\t}\n\tcout << S.substr(u + cnt - 13, 20) << endl;\nExit:;\n\treturn 0;\n}","accuracy":0.058823529411764705,"time_ms":60,"memory_kb":11300,"score_of_the_acc":-1.7018,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2441_2971948\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <cstring>\\n#include <sstream>\\nusing namespace std;\\n\\n// calc digit-dp\\n// dp[(桁)][(num of leading-zero)][smaller][15 で割ったあまり] :＝ 個数\\nlong long dp[21][21][3][16];\\nlong long calc(long long num) {\\n memset(dp, 0, sizeof(dp));\\n dp[0][0][0][0] = 1;\\n stringstream ss; ss << num;\\n string str = ss.str(); ss >> str;\\n for (int i = 0; i <= str.size(); ++i) {\\n\\tfor (int j = 0; j <= i; ++j) {\\n\\t for (int mod = 0; mod < 15; ++mod) {\\n\\t\\t//cout << i << \\\", \\\" << j << \\\", \\\" << mod << \\\": \\\" << dp[i][j][0][mod] << \\\", \\\" << dp[i][j][1][mod] << endl;\\n\\t }\\n\\t}\\n\\n\\tif (i == str.size()) break;\\n\\tint cur = (int)(str[i] - '0');\\n\\tfor (int mod = 0; mod < 15; ++mod) {\\n\\t // (leading zero = i, exact(0)) ->\\n\\t if (cur == 0) dp[i+1][i+1][0][mod*10%15] += dp[i][i][0][mod];\\n\\t else dp[i+1][i+1][1][mod*10%15] += dp[i][i][0][mod];\\n\\t if (cur != 0) dp[i+1][i][0][(mod*10+cur)%15] += dp[i][i][0][mod];\\n\\t for (int c = 1; c < cur; ++c) {\\n\\t\\tdp[i+1][i][1][(mod*10+c)%15] += dp[i][i][0][mod];\\n\\t }\\n\\n\\t // (leading zero = i, smaller(1)) ->\\n\\t dp[i+1][i+1][1][mod*10%15] += dp[i][i][1][mod];\\n\\t for (int c = 1; c < 10; ++c) {\\n\\t\\tdp[i+1][i][1][(mod*10+c)%15] += dp[i][i][1][mod];\\n\\t }\\n\\n\\t // (leading zero < i, exact(0)) ->\\n\\t for (int j = 0; j < i; ++j) {\\n\\t\\tdp[i+1][j][0][(mod*10+cur)%15] += dp[i][j][0][mod];\\n\\t\\tfor (int c = 0; c < cur; ++c) {\\n\\t\\t dp[i+1][j][1][(mod*10+c)%15] += dp[i][j][0][mod];\\n\\t\\t}\\n\\t }\\n\\n\\t // (leading zero < i, smaller(1)) ->\\n\\t for (int j = 0; j < i; ++j) {\\n\\t\\tfor (int c = 0; c < 10; ++c) {\\n\\t\\t dp[i+1][j][1][(mod*10+c)%15] += dp[i][j][1][mod];\\n\\t\\t}\\n\\t }\\n\\t}\\n }\\n\\n // num\\n long long res = 0;\\n for (int j = 0; j < str.size(); ++j) {\\n\\tfor (int mod = 0; mod < 15; ++mod) {\\n\\t if (mod % 3 == 0) continue;\\n\\t if (mod % 5 == 0) continue;\\n\\t long long num = dp[str.size()][j][0][mod] + dp[str.size()][j][1][mod];\\n\\t res += num * ((long long)str.size() - j);\\n\\t}\\n }\\n\\n // fizzbuzz\\n long long fizzbuzz = (num/3) * 4 + (num/5) * 4;\\n\\n return res + fizzbuzz;\\n}\\n\\nint main() {\\n /*\\n calc(2036);\\n \\n for (int i = 0; i <= 1000; ++i) {\\n\\t\\tcout << i << \\\": \\\" << calc(i) << endl;\\n }\\n */\\n \\n long long s; cin >> s;\\n // 1 から x までの文字列の総数が s 未満となる最大の x を求める\\n long long low = 0, high = 1LL<<58;\\n while (high - low > 1) {\\n\\tlong long mid = (high + low) / 2;\\n\\tlong long all = calc(mid);\\n\\tif (all >= s) high = mid;\\n\\telse low = mid;\\n }\\n\\n long long rem = s - calc(low) - 1;\\n stringstream ss;\\n for (long long i = high; i < high + 20; ++i) {\\n\\tif (i % 15 == 0) ss << \\\"FizzBuzz\\\";\\n\\telse if (i % 3 == 0) ss << \\\"Fizz\\\";\\n\\telse if (i % 5 == 0) ss << \\\"Buzz\\\";\\n\\telse ss << i;\\n }\\n string res = ss.str();\\n cout << res.substr(rem, 20) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2441_1631357\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,19,21,23,17,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\telse if (a == 2107639015) { zure = 7; }\\n\\telse if (a == 10000000000) { zure = 7; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 11400,\n \"score_of_the_acc\": -2,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2441_1631353\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,19,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\telse if (a == 2107639015) { zure = 7; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5882352941176471,\n \"time_ms\": 70,\n \"memory_kb\": 11400,\n \"score_of_the_acc\": -1.8571,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2441_1631349\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,15,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\telse if (a == 2107639015) { zure = 7; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5588235294117647,\n \"time_ms\": 60,\n \"memory_kb\": 11300,\n \"score_of_the_acc\": -1.7018,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2441_1631347\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\telse if (a == 2107639015) { zure = 7; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.5588235294117647,\n \"time_ms\": 60,\n \"memory_kb\": 11400,\n \"score_of_the_acc\": -1.7143,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2441_1631346\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,6,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4117647058823529,\n \"time_ms\": 60,\n \"memory_kb\": 11400,\n \"score_of_the_acc\": -1.7143,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2441_1631344\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,9,9,10,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.17647058823529413,\n \"time_ms\": 60,\n \"memory_kb\": 11296,\n \"score_of_the_acc\": -1.7013,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2441_1631343\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,3,6,6,6,6,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.35294117647058826,\n \"time_ms\": 60,\n \"memory_kb\": 11368,\n \"score_of_the_acc\": -1.7103,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2441_1631340\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 29; }\\n\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2647058823529412,\n \"time_ms\": 60,\n \"memory_kb\": 11400,\n \"score_of_the_acc\": -1.7143,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2441_1631337\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 32421014018) { zure = 6; }\\n\\telse if (a == 74717179160750) { zure = 13; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.20588235294117646,\n \"time_ms\": 60,\n \"memory_kb\": 11220,\n \"score_of_the_acc\": -1.6919,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2441_1631331\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,2,6,11,17,21,23,25,27,28,30 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.20588235294117646,\n \"time_ms\": 60,\n \"memory_kb\": 11356,\n \"score_of_the_acc\": -1.7088,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2441_1631327\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,3,10,15,18,21,23,25,27,28,30 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.17647058823529413,\n \"time_ms\": 60,\n \"memory_kb\": 11312,\n \"score_of_the_acc\": -1.7033,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2441_1631324\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 4,6,8,10,11,12,13,14,15,16,17,18,19,20,21,23,25,27,28,30 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.17647058823529413,\n \"time_ms\": 60,\n \"memory_kb\": 11236,\n \"score_of_the_acc\": -1.6939,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2441_1631323\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 4,6,8,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,27 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.058823529411764705,\n \"time_ms\": 50,\n \"memory_kb\": 11300,\n \"score_of_the_acc\": -1.559,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2441_1631322\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\nint k[20] = { 0,0,0,0,0,0,0,0,0,0,7,8,9,11,11,11,12,12,13,13 };\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tzure = k[to_string(a).size()];\\n\\tif (a == 41155212030742136) { zure = 27; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.14705882352941177,\n \"time_ms\": 60,\n \"memory_kb\": 11356,\n \"score_of_the_acc\": -1.7088,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2441_1631317\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 6; }\\n\\telse { zure = 27; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.14705882352941177,\n \"time_ms\": 60,\n \"memory_kb\": 11200,\n \"score_of_the_acc\": -1.6894,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2441_1631316\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse if (a == 32421014018) { zure = 10; }\\n\\telse { zure = 27; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11764705882352941,\n \"time_ms\": 60,\n \"memory_kb\": 11356,\n \"score_of_the_acc\": -1.7088,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2441_1631312\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse { zure = 27; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.11764705882352941,\n \"time_ms\": 60,\n \"memory_kb\": 11308,\n \"score_of_the_acc\": -1.7028,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2441_1631309\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\nint zure;\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tif (a == 1000000000000000000) { zure = 13; }\\n\\telse { zure = 14; }\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - zure, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.058823529411764705,\n \"time_ms\": 60,\n \"memory_kb\": 11256,\n \"score_of_the_acc\": -1.6964,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2441_1631305\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\nusing namespace std;\\nstring S;\\n\\nlong long a, s, t, u;\\n\\nlong long num(long long p) {\\n\\tlong long x[19] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 }, v, c, w, LO, HI, sum = 0, r, d;\\n\\tlong long res1, res2;\\n\\tfor (int i = 1; i <= 18; i++) {\\n\\t\\tif (p <= pow(10, i)) {\\n\\t\\t\\tv = i;\\n\\t\\t\\tLO = p - pow(10, i);\\n\\t\\t\\tHI = pow(10, i + 1) - p;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tx[0] = 1;\\n\\tx[1] = 22;//1 - 9.\\n\\tfor (int i = 2; i <= 18; i++) {\\n\\t\\tx[i] = x[i - 1];\\n\\t\\tfor (int j = 0; j <= 5; j++) {\\n\\t\\t\\tc = (long long)pow(10, i - 1) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t\\tc = ((long long)pow(10, i) - (long long)pow(10, i - 1) - 15) / 15;\\n\\t\\tw = 32 + 8 * i;\\n\\t\\tw *= c;\\n\\t\\tx[i] += w;\\n\\t\\tfor (int j = -9; j < 0; j++) {\\n\\t\\t\\tc = (long long)pow(10, i) + j;\\n\\t\\t\\tif (c % 15 == 0) { x[i] += 8; }\\n\\t\\t\\telse if (c % 3 == 0 || c % 5 == 0) { x[i] += 4; }\\n\\t\\t\\telse { x[i] += i; }\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i <= 18; i++) {\\n\\t\\tif (x[i + 1] >= p) {\\n\\t\\t\\tr = i;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tsum = x[r];\\n\\tres1 = (long long)(pow(10, r));\\n\\td = 5;\\n\\tif (r == 0) { d = 4; }\\n\\n\\tfor (int i = 0; i <= d; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = (long long)pow(10, r) + i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r + 1; }\\n\\t\\tres1++;\\n\\t}\\n\\n\\tw = 40 + 8 * r;\\n\\tres1 += ((p - sum) / w) * 15;\\n\\tsum += ((p - sum) / w)*w;\\n\\tfor (int i = 1; i <= 15; i++) {\\n\\t\\tif (sum >= p) { goto E; }\\n\\t\\tc = i;\\n\\t\\tif (c % 15 == 0) { sum += 8; }\\n\\t\\telse if (c % 3 == 0 || c % 5 == 0) { sum += 4; }\\n\\t\\telse { sum += r; }\\n\\t\\tres1++;\\n\\t}\\n\\nE:;\\n\\tres2 = sum - p;\\n\\tgoto G;\\nF:;\\nG:;\\n\\treturn res1 * 100 + res2;\\n}\\n\\nint cnt = 0;\\n\\nint main() {\\n\\tcin >> a;\\n\\tif (a < 5000000) {\\n\\t\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\t\\telse { S += to_string(i); }\\n\\t\\t}\\n\\t\\tcout << S.substr(a - 1, 20) << endl;\\n\\t\\tgoto Exit;\\n\\t}\\n\\ts = num(a);\\n\\tt = s / 100;\\n\\tu = s % 100;\\n\\tfor (long long i = t - 10; i < t + 20; i++) {\\n\\t\\tif (i % 15 == 0) { S += \\\"FizzBuzz\\\"; }\\n\\t\\telse if (i % 3 == 0) { S += \\\"Fizz\\\"; }\\n\\t\\telse if (i % 5 == 0) { S += \\\"Buzz\\\"; }\\n\\t\\telse { S += to_string(i); }\\n\\t\\tif (i == t - 1) { cnt = S.size(); }\\n\\t}\\n\\tcout << S.substr(u + cnt - 13, 20) << endl;\\nExit:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.058823529411764705,\n \"time_ms\": 60,\n \"memory_kb\": 11300,\n \"score_of_the_acc\": -1.7018,\n \"final_rank\": 20\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":13,"numItemsPerPage":100,"numTotalItems":2103,"offset":1300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTc1NjE0Mywic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5NzU5NzQzLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.vzGueI9imUC1XuvCikwNZ14JUmg5KhQhiggbwozG_bn2iuYshLIz2lIHY_KLuDCzapE0pCt_zIOCG-udC8dmBw","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_2320_cpp | Problem A:
Infnity Maze
Dr. Fukuoka has placed a simple robot in a two-dimensional maze. It moves within the maze and never goes out of the maze as there is no exit.
The maze is made up of
H
×
W
grid cells as depicted below. The upper side of the maze faces north. Consequently, the right, lower and left sides face east... | [
{
"submission_id": "aoj_2320_10568641",
"code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/2320\n#include <algorithm>\n#include <cstdint>\n#include <iostream>\n#include <iterator>\n#include <numeric>\n#include <string>\n#include <vector>\n#include <cassert>\n#include... |
aoj_2324_cpp | Problem E:
Full Text Search
Mr. Don is an administrator of a famous quiz website named QMACloneClone. The users there can submit their own questions to the system as well as search for question texts with arbitrary queries. This search system employs bi-gram search method.
The bi-gram search method introduces two phase... | [
{
"submission_id": "aoj_2324_3161155",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define all(v) (v).begin(), (v).end()\n#define resz(v, ...) (v).clear(), (v).resize(__VA_ARGS__)\n#define reps(i, m, n) for(int i = (int)(m); i < (int)(n); i++)\n#define rep(i, ... |
aoj_2321_cpp | Problem B:
Butterfly
Claire is a man-eater. She's a real man-eater. She's going around with dozens of guys. She's dating all the time. And one day she found some conflicts in her date schedule. D'oh!
So she needs to pick some dates and give the others up. The dates are set by hours like 13:00 to 15:00. She may have mor... | [
{
"submission_id": "aoj_2321_11059617",
"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_2312_cpp | 問題文
世の中の少女たちはキュゥべえと契約し願いを叶えてもらい，それとひきかえに魔法少女となる．使う魔法の形・効果は願いに強く影響を受ける．魔法少女
さやか
ちゃんは最近キュゥべえと契約した新米魔法少女である．
さやか
の願いは「事故のため指が動かなくなり，音楽を演奏するのを諦めていた男の子を助けること」であったので，作る魔方陣は音符が輪の上に並んだ形をしている．
さやか
は
N
個の音符を持っており，それらを輪の上に並べることによって魔方陣を作る．音符をどのような順番で並べるかは彼女の自由である．魔方陣を作るために精神力が消費され，その量は音符の配置によって以下のように決まる．
まず，
M
個の正の整数からなる
音楽的美しさ
S_... | [
{
"submission_id": "aoj_2312_10946081",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\n#define FOR(i,s,t) for (int i = s; i < t; i++)\n#define SZ(x) (int)x.size()\nusing LL = long long; using ll = LL;\nusing VI = vector<int>; using VL = vector<LL>;\nconst LL INF = 1e9; const LL LINF = ... |
aoj_2322_cpp | Problem C:
Chinese Classics
Taro, a junior high school student, is working on his homework. Today's homework is to read Chinese classic texts.
As you know, Japanese language shares the (mostly) same Chinese characters but the order of words is a bit different. Therefore the notation called "returning marks" was invente... | [
{
"submission_id": "aoj_2322_10257213",
"code_snippet": "// AOJ #2322 Chinese Classics\n// 2025.3.1\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); w... |
aoj_2325_cpp | Problem F:
Mysterious Maze
A robot in a two-dimensional maze again. The maze has an entrance and an exit this time, though.
Just as in the previous problem, the maze is made up of
H
×
W
grid cells, its upper side faces north, and each cell is either empty or wall. Unlike the previous, on the other hand, one of the empt... | [
{
"submission_id": "aoj_2325_10858305",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n#include<algorithm>\n#include <queue>\n//#define debug 1\nusing namespace std;\n\nconst int maxn = 1010;\nconst int inf = (1<<30);\n\nint dx[4] = {-1,0,1,0};\nint dy[4] = {0,1,0,-1};\n\nstruct n... |
aoj_2326_cpp | Problem G:
Number Sorting
Consider sets of natural numbers. Some sets can be sorted in the same order numerically and lexicographically. {2, 27, 3125, 9000} is one example of such sets; {2, 27, 243} is not since lexicographic sorting would yield {2, 243, 27}.
Your task is to write a program that, for the set of integer... | [
{
"submission_id": "aoj_2326_10858261",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<cstring>\n#include<algorithm>\nusing namespace std;\n#define lowbit(n) (n&-n)\nint l,r,m,a[100005],b,c[100005];\nvoid add(int pos,int val)\n{\n while(pos<=r-l+1) c[pos]=(c[pos]+val)%m,pos+=lowbit(pos... |
aoj_2329_cpp | Problem J:
Blue Forest
John is playing a famous console game named 'Tales of Algorithmers.' Now he is facing the last dungeon called 'Blue Forest.' To find out the fastest path to run through the very complicated dungeon, he tried to draw up the dungeon map.
The dungeon consists of several floors. Each floor can be des... | [
{
"submission_id": "aoj_2329_2010618",
"code_snippet": "#include<bits/stdc++.h>\n#define f first\n#define s second\n#define ff f,f\n#define fs f.s\n#define sf s.f\n#define ss s.s\n#define mp make_pair\n#define MAX 51\n#define inf 1e10\n#define eps (1e-11)\n#define pi M_PI\n#define equals(a,b) (fabs((a)-(b))... |
aoj_2323_cpp | Problem D:
Revenge of Champernowne Constant
Champernowne constant is an irrational number. Its decimal representation starts with "0.", followed by concatenation of all positive integers in the increasing order.
You will be given a sequence
S
which consists of decimal digits. Your task is to write a program which compu... | [
{
"submission_id": "aoj_2323_9477278",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n#define all(A) A.begin(),A.end()\n\nll f(ll N) {\n if (N > 1e16)return 1e18;\n ll res = 0;\n ll d = 1;\n ... |
aoj_2328_cpp | Problem I:
Mobile Network
The trafic on the Internet is increasing these days due to smartphones. The wireless carriers
have to enhance their network infrastructure.
The network of a wireless carrier consists of a number of base stations and lines. Each line connects two base stations bi-directionally. The bandwidth of... | [
{
"submission_id": "aoj_2328_10848629",
"code_snippet": "#pragma comment(linker, \"/STACK:1024000000,1024000000\")\n#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <map>\n#include <stack>\n#include <string>\n#include <algorithm>\n#include <vector>\n#i... |
aoj_2331_cpp | Problem B: 友だちの誘い方
明日から、待ちに待った夏休みが始まります。なのでわたしは、友だちを誘って、海に遊びに行くこ
とに決めました。
けれども、わたしの友だちには、恥ずかしがりやさんが多いです。その人たちは、あまり多くの人が
いっしょに来ると知ったら、きっと嫌がるでしょう。
ほかにも、わたしの友だちには、目立ちたがりやさんも多いです。その人たちは、いっしょに来る人
があまり多くないと知れば、きっと嫌がるでしょう。
それと、わたしの友だちには、いつもは目立ちたがりやなのに実は恥ずかしがりやさんな人もいま
す。その人たちは、いっしょに来る人が多すぎても少なすぎても、きっと嫌がるでしょう。
こういうのは、大勢で行った方が楽し... | [
{
"submission_id": "aoj_2331_10885637",
"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_2327_cpp | Problem H:
Sky Jump
Dr. Kay Em, a genius scientist, developed a new missile named "Ikan-no-i." This missile has
N
jet engines. When the
i
-th engine is ignited, the missile's velocity changes to (
vx
i
,
vy
i
) immediately.
Your task is to determine whether the missile can reach the given target point (
X
,
Y
). The mi... | [
{
"submission_id": "aoj_2327_10854011",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n\n#define MAXN 1005\n#define EPS 1e-8\n\nconst double g = 9.8;\n\nint n;\nstruct Point {\n\tdouble x, y;\n}p[MAXN];\ndouble X, Y;\n\nbool cmp(Point a, Point b) {\n\tretur... |
aoj_2332_cpp | Problem 3: 時空のスゴロク・ロード
全時空統一ディメンション・スゴロク・トーナメント。500 兆人を超える参加者の中から、ただ１人
のスゴロク絶対王者を決定するその大会に、あなたは２１世紀の地球代表として参加している。
今あなたが挑戦している課題は、自分自身をコマとした１次元スゴロク。端のスタートマスから出発
して、１から６までの目が一つずつ書かれた巨大な６面ダイスを振って出た目の数だけ進むことを繰
り返す、あなたもよく知っている形式のスゴロクだ。スタートマスとは反対の端にあるゴールマスに
止まるとゴールとなる。もちろん、ゴールするまでにサイコロを振った回数が少なければ少ないほど
良い成績となる。
マスの中には特殊な効果を... | [
{
"submission_id": "aoj_2332_9637294",
"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_2335_cpp | Problem F: １０歳の動的計画
ある日の夕方。いつものようにあなたが居間でテレビを見ていると、小学５年生の妹から相談を持ち
かけられた。話を聞いてみると、今日学校で出された算数の問題が難しくて理解できなかったので、
あなたに解き方を教えてほしいのだという。
妹を悩ませている問題は、「道が碁盤目状に通っている街において、家(0, 0) から学校(
N
,
M
) まで最短距離で進む方法は何通りあるか？」というものだった。もちろん、あなたにとっては赤子の手をひねるよりも簡単な問題である。すぐに上のような図を書いて「家(0, 0) から順番に足し算していけば解けるよ」と教えてあげた。
ところが、それを聞いてもまだ、妹はなにやら下を... | [
{
"submission_id": "aoj_2335_9770269",
"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... |
aoj_2334_cpp | Problem E: 街を駆ける道
ネーヴァ王国には、トタタ族とツテテ族、２種類の民族が暮らしている。トタタ族の最大の特徴は、
酢豚にパイナップルを入れて食べることである。だがツテテ族は、パイナップルに酢豚を入れて食べ
る。こんな２つの民族がお互いに仲良くやっていけるはずもなく、トタタ族とツテテ族は、何百年も
の昔からずっといがみ合いを続けてきた。
そんなある日、ネーヴァ王のもとに、２つの民族から嘆願書が届いた。それによるとトタタ族は、自
分たちが暮らす街Ａと街Ｂのあいだを結ぶ道を建設してほしいらしい。一方でツテテ族も、自分たち
が暮らす街Ｃと街Ｄのあいだを結ぶ道を建設してほしいらしい。
２つの民族が衝突するのを防ぐため、トタタ族が... | [
{
"submission_id": "aoj_2334_10880844",
"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\nusing Real = double;\nusing Point = complex< Real >;\nusing Polygon = vector< Point >;\nconst Real EPS = 1e-9, PI = acos(-1);\ncons... |
aoj_2337_cpp | Problem H: ねこ鍋改造計画（仮）
あなたは、自宅にたくさんのねこを飼っている。そんなあなたの日課は、飼っているねこが土鍋の中
に入って昼寝している様子（通称：ねこ鍋）を撮影することだ。何匹かのねこが、鍋の中でいっしょ
に丸くなって眠る姿は、実に愛くるしい。
それぞれのねこには、「重さ」
m
i
と「Cute」
c
i
が定義されている。Cute とは、そのねこ1 匹だけを見たときの、愛らしさ・あどけなさ・しなやかさ・やわらかさ・ういういしさ、などを総合的に評価した数値であり、大きければ大きいほどそのねこは魅力的である。
また、ねこ鍋に対しては「UnCute」という数値が定義される。これは、ねこ鍋全体としてのアンバラ
ンスさ... | [
{
"submission_id": "aoj_2337_10292218",
"code_snippet": "// AOJ #2337 Remodeling Plan for Neko-Nabe (tentative)\n// 2025.3.13\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct BS {\n int sz, nw;\n vector<ll> d;\n BS(int s) : sz(s), nw((s+63)/64) { d.assign(nw,0ULL);... |
aoj_2339_cpp | Problem J: 問題文担当者は働かない！
N
個の点からなる有向グラフがある。このグラフに閉路はない。それぞれの点には、いくつかの石が置かれている。このグラフを使って、２人のプレイヤーがゲームをする。おのおのの手番は、交互に訪れる。各プレイヤーは、自分の手番において、頂点
v
を選び、そこに置かれた石を１つ以上取り除く。その後、
v
から
w
に辺が張られているすべての頂点
w
について、
w
に置かれている石の個数を自由に変化させることができる（いくつ増やしても、いくつ減らしても、変化させなくてもよい）。これを繰り返して、最初に取る石がなくなった方の負けである。両者が最善をつくしたとき、先手と後手、どちらが勝つか。もしくは、... | [
{
"submission_id": "aoj_2339_1712886",
"code_snippet": "#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cstdio>\n#include <functional>\n#include <iostream>\n#include <cfloat>\n#include <climits>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\n#include ... |
aoj_2338_cpp | Problem I: よくわかる二重魔法
紀慧暦2119 年15 の月。宮廷魔術士Sengemon Lugene の手によって、一冊の魔術書が書き記された。この魔術書「In Magiray」は、この世界の魔術法則の根幹に深く関わる「二重魔法」を、誰にでも習得可能な技術として体系化した、という点で革新的な書物であった。まずは、この書物の内容を要約したものを見ていこう。
【エレメント】
世界中のあらゆる物体は、「泉」「風」「羽」「花」「砂」「灯」……といった、極小要素「エレメント」から構成されている。エレメントには多くの種類があり、人間はエレメントと契約を交わすことで、契約を交わした種類のエレメントを用いた二重魔法を発動させることができ... | [
{
"submission_id": "aoj_2338_8283689",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nclass UnionFind {\npublic:\n\tvector<int> par;\n\n\tvoid init(int sz) {\n\t\tpar.resize(sz, -1);\n\t}\n\n\tint root(int pos) {\n\t\tif (par[pos] == -1) return pos;\n\t\tpar[pos] = root(par... |
aoj_2336_cpp | Problem G: スプリング・タイル
ある朝、あなたが目覚めると、そこはバネだらけの迷宮の中だった。
なぜ自分がこんな見知らぬ場所にいるのかはわからない。この場でじっと助けを待つという選択肢も
あるにはあるが、こういった迷宮の中に長居していると、いつかは必ず突風が吹いてきて吹き飛ばさ
れてしまうことを、あなたは経験上知っていた。しかし、突風が吹いてくるまでの時間は判断のしよ
うがない。そこであなたは、迷宮から脱出するまでに必要な移動回数の期待値が最小になるように行
動するのが最善の戦略だと考えた。
足元に落ちていた正体不明の巻物を拾ってためしに読んでみたところ、偶然にも迷宮の全体マップを
知覚することができた。さらに、たまたま持... | [
{
"submission_id": "aoj_2336_10880834",
"code_snippet": "#include <queue>\n#include <string>\n#include <iomanip>\n#include <iostream>\n#pragma warning(disable : 4996)\nusing namespace std;\nstruct state {\n\tint x, y; long double dist;\n};\nbool operator<(const state& s1, const state& s2) {\n\treturn s1.dis... |
aoj_2340_cpp | Carpenters' Language
International Carpenters Professionals Company (ICPC) is a top construction company with a lot of expert carpenters.
What makes ICPC a top company is their original language.
The syntax of the language is simply given in CFG as follows:
S -> SS | (S) | )S( | ε
In other words, a right parenthesis ca... | [
{
"submission_id": "aoj_2340_10728160",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include <stdlib.h>\n#define N 100000\n#define ll long long\n#define clr(xx,yy) memset(xx,yy,sizeof(xx))\nll a[N],b[N];\nint main()\n{\n long long i,j,n,m,k,t,tt,max,maxn,p,T;\n char c... |
aoj_2333_cpp | Problem D: 僕の友達は小さい
僕には、たくさんの友達がいる。どの友達も、とても小さい。
僕は、よく友達と一緒に出かける。何人かの友達をリュックに入れて、一緒に出かける。
僕は毎朝、その日一緒に出かける友達を決める。空のリュックに、１人ずつ友達を入れていく。
僕は、あまり力が強くない。だから、同時に運べる友達の重さには限界がある。
僕は、重さの限界を超えないように友達を入れていく。どの順番で入れていくかは気分次第。
僕は、入れられる友達がまだ残っている限り、入れるのを止めない。決して止めない。
……ところで、リュックに入った友達の組み合わせは、全部で何パターンあるんだろう？
Input
N W
w
1
w
2
.
.
.
w... | [
{
"submission_id": "aoj_2333_10880846",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <functional>\nusing namespace std;\nconst int mod = 1000000007;\nint N, W;\nint main() {\n\tcin >> N >> W;\n\tvector<int> a(N);\n\tfor (int i = 0; i < N; i++) cin >> a[i];\n\tsort(... |
aoj_2343_cpp | Matrix Operation
You are a student looking for a job.
Today you had an employment examination for an IT company.
They asked you to write an efficient program to perform several operations.
First, they showed you an
N \times N
square matrix and a list of operations.
All operations but one modify the matrix, and the ... | [
{
"submission_id": "aoj_2343_10848580",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <map>\n\nusing namespace std;\n\nconst int maxn=4e4+5;\n\nbool RH,RV,R;\nint row[maxn],colum[maxn];\nint A,B,C,D,E,F,G,n,q;\n\nstruct HashMap\n{\n int mod;\n int begin[100007],n... |
aoj_2341_cpp | Kth Sentence
A student, Kita_masa, is taking an English examination.
In this examination, he has to write a sentence of length
m
.
Since he completely forgot the English grammar, he decided to consider all sentences of length
m
constructed by concatenating the words he knows and write the
K
-th sentence among the candi... | [
{
"submission_id": "aoj_2341_10848657",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <set>\n#include <queue>\n#include <cmath>\n#include <iostream>\n#include <cstdlib>\n#include <sstream>\n\nusing namespace std;\... |
aoj_2345_cpp | Network Reliability
An undirected graph is given.
Each edge of the graph disappears with a constant probability.
Calculate the probability with which the remained graph is connected.
Input
The first line contains three integers
N
(
1 \leq N \leq 14
),
M
(
0 \leq M \leq 100
) and
P
(
0 \leq P \leq 100
), separated by a ... | [
{
"submission_id": "aoj_2345_10760531",
"code_snippet": "/*\n * 2345.cc: Network Reliability\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>... |
aoj_2346_cpp | Runaway Domino
``Domino effect'' is a famous play using dominoes.
A player sets up a chain of dominoes stood.
After a chain is formed, the player topples one end of the dominoes.
The first domino topples the second domino, the second topples the third and so on.
You are playing domino effect.
Before you finish to set u... | [
{
"submission_id": "aoj_2346_1626194",
"code_snippet": "#include<stdio.h>\n#include <iostream>\n#include <math.h>\n#include <numeric>\n#include <vector>\n#include <map>\n#include <functional>\n#include <stdio.h>\n#include <array>\n#include <algorithm>\n#include <string>\n#include <string.h>\n#include <asser... |
aoj_2342_cpp | A Light Road
There is an evil creature in a square on N-by-M grid (
2 \leq N, M \leq 100
),
and you want to kill it using a laser generator located in a different square.
Since the location and direction of the laser generator are fixed,
you may need to use several mirrors to reflect laser beams.
There are some obstacl... | [
{
"submission_id": "aoj_2342_10895982",
"code_snippet": "/*###############################################################################################################\n## Author : Minseong Gwak (astilate, minsung05) ##\n#####################... |
aoj_2352_cpp | 問題文
正整数列 $X_1,X_2,...,X_N$ がある。数列 $\{1,2,...,N\}$ から部分列 $S$ を選ぶ。ただし $S$ は以下の条件を満たす必要がある。
$T=\{X_s | s \in S\}$ とする。このとき、任意の $x \in T$ について、$x$ の約数(ただし $x$ は除く)は $T$ に含まれない。
条件を満たす $S$ のうち、最も多くの要素を含むものを求めよ。また、そのような $S$ が複数ある場合は辞書式順序で最小のものを求めよ。
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$N$
$X_1$ $X_2$ $...$ $X_N$
制約
$1 \leq N \leq ... | [
{
"submission_id": "aoj_2352_4272561",
"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;\ncon... |
aoj_2347_cpp | Sunny Graph
The Sun is a great heavenly body.
The Sun is worshiped by various religions.
Bob loves the Sun and loves any object that is similar to the Sun.
He noticed that he can find the shape of the Sun in certain graphs.
He calls such graphs "Sunny".
We define the property "Sunny" mathematically.
A graph
G=(V,E)
wit... | [
{
"submission_id": "aoj_2347_10848164",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long lo... |
aoj_2344_cpp | Multi-ending Story
You are a programmer who loves bishojo games (a sub-genre of dating simulation games).
A game, which is titled "I * C * P * C!" and was released yesterday, has arrived to you just now.
This game has multiple endings. When you complete all of those endings, you can get a special figure of the main her... | [
{
"submission_id": "aoj_2344_10854001",
"code_snippet": "//made by kuailezhish\n//gl && hf\n#include <vector>\n#include <map>\n#include <set>\n#include <queue>\n#include <algorithm>\n#include <utility>\n#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <string>\n#include... |
aoj_2354_cpp | 問題文
実数変数 $x_1, x_2, ..., x_N$ は以下の条件を満たす。
$0 \leq x_i \leq 1$ ($1 \leq i \leq N$)
$w_1x_1+w_2x_2+...+w_Nx_N \leq W$
このとき $v_1x_1+v_2x_2+...+v_Nx_N$ のとりうる最大値を求めよ。そのような最大値は実際に存在することが知られている。
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$N$ $W$
$w_1$ $v_1$
$w_2$ $v_2$
$...$
$w_N$ $v_N$
制約
$1 \leq N \leq 10^5$
$1 \leq W \leq 10^5$
$-10^4... | [
{
"submission_id": "aoj_2354_2659387",
"code_snippet": "#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#include<random>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld= long double;\n\nint main()\n{\n\tint N;\n\tld W;\n\tcin>>N>>W;\n\tvector<pair<ld,ld>>pluss;\n... |
aoj_2351_cpp | 問題文
$N$ 本の線分 $s_1, s_2, ..., s_N$ が与えられる。このとき、
dist$(s_i, s_j)$, ( $1 \leq i,j \leq N, i \ne j $ )
のとりうる最小値を求めよ。
dist$(s_i, s_j)$ は
$\sqrt{(x_i-x_j)^2 + (y_i-y_j)^2}$, ( $(x_i,y_i)$ は $s_i$ 上の点、$(x_j,y_j)$ は $s_j$ 上の点)
のとりうる最小値で定義される。
以下はSample Inputのデータセットを図示したものである。
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$N$
$x_{1,1}$ $y_{1,... | [
{
"submission_id": "aoj_2351_2719318",
"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;\n\nconst double EPS = 1e-10;\nconst double INF = 1e12;\n#define EQ(n,m) (abs((n)-(m)) < EPS)\... |
aoj_2357_cpp | 問題文
以下の条件を満たす整数列 $X_1, X_2, ..., X_N$ の個数を求めよ。
任意の整数 $i$ ($1 \leq i \leq N$)に対して、$X_j=i$ となる $j$ ($1 \leq j \leq N$)が存在する。
$X_s = t$
$X_{a_i} < X_{b_i}$ ($1 \leq i \leq C$)
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$N$ $C$ $s$ $t$
$a_1$ $b_1$
$a_2$ $b_2$
$...$
$a_C$ $b_C$
制約
$1 \leq N \leq 2000$
$0 \leq C \leq N$
$1 \leq s \leq N... | [
{
"submission_id": "aoj_2357_387243",
"code_snippet": "#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\ntypedef long long int64;\n\nconst int MAX_N = 2000 + 1;\nconst int64 MOD = (int64)(1e9 + 7);\n\nint N, C, target, ord;\n\nint parent[MAX_N+1];\nvecto... |
aoj_2353_cpp | 問題文
有理数列 $X_0, X_1, X_2, ..., X_N$ がある。各項は以下のように定義される。
$X_0 = 0$
$X_i = X_{i-1}$ $op_i$ $Y_i$ ($1 \leq i \leq N$). ただし $op_i$ は $＋$、$−$、$×$、$÷$のいずれかである。
$X_N$ を求めよ。
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$N$
$o_1$ $Y_1$
$o_2$ $Y_2$
$...$
$o_N$ $Y_N$
$o_i = 1$ のとき $op_i$ は＋、$o_i = 2$ のとき $op_i$ は−、$o_i = 3$ のとき $op_i$ は×、$o_i =... | [
{
"submission_id": "aoj_2353_9629970",
"code_snippet": "#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\nsigned main() {\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n long double x = 0;\n int n; cin >> n;\n while (n--) {\n int o; long double y; cin >> o >>... |
aoj_2348_cpp | Testing Circuits
A Boolean expression is given.
In the expression, each variable appears exactly once.
Calculate the number of variable assignments that make the expression evaluate to true.
Input
A data set consists of only one line.
The Boolean expression is given by a string which consists of digits, x, (, ), |, &, ... | [
{
"submission_id": "aoj_2348_10750504",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\nusing namespace std;\n#define SE second\n#define FI first\n#define MP(x,y) make_pair(x,y)\nconst int MAXN = 1000010;\nconst int MOD = 1000000007;\nchar str[MAXN];\nint sta... |
aoj_2355_cpp | 問題文
ふたりのプレイヤーがゲームをしている。以下、ゲームのルールを説明する。
$N×N$ マスのボードがあり、各マスには数字 $X_{i,j}$ ($1 \leq i,j \leq N$)が書かれている。先手と後手は交互に手を選んで点を積み重ねてゆく。最初に先手は $F$ 点持っており、後手は $0$ 点持っている。
$t$ ターン目($1 \leq t \leq 2N$)のプレイヤーの行動を示す。
これ以降自分と相手がどのような手を選んだとしても自分が負けてしまう場合、即座に負けを宣言してゲームを終了する。
これまでに自分が一度も選んだことのない数字を $1,2,...,N$ から一つ選んで $Y_t$ とする。
先手の手番(つ... | [
{
"submission_id": "aoj_2355_2727715",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb push_back\n#define all(v) (v).begin(),(v).end()\n#define fi first\n#define se second\ntypedef vector<int>vint;\ntypedef pair<i... |
aoj_2361_cpp | 問題文
$1,2,...,N$ を並べ替えた順列がある。2つの異なる数字 $i$, $j$ を選んで入れ替えることを繰り返してソートされた状態( $1,2,...,N$ の順番に並んだ状態)にしたい。
数字 $i$, $j$ を入れ替える度にコストが $c_{i,j}$ 必要になる。
順列 $p$ に対して、 $p$ をソートするのに必要な最小コストを $f(p)$ とする。
$f(p)$ のとりうる最大値を求めよ。
入力
入力は以下のフォーマットに従う。与えられる数は全て整数である。
$N$
$c_{1,1}$ $c_{1,2}$ $...$ $c_{1,N}$
$c_{2,1}$ $c_{2,2}$ $...$ $c_{2,N}... | [
{
"submission_id": "aoj_2361_3596190",
"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... |
aoj_2364_cpp | Lucky Dip
Time Limit: 8 sec / Memory Limit: 64 MB
C: 福袋
福袋，それは年始を祝う商習慣の一つである．
人気の福袋には多くの人が開店前から行列を作り，ターゲットの福袋へダッシュする．
この風物詩に魅了されたあなたは，今年もお目当ての福袋を狙い，計画を立てていた．
しかし，お客を呼び寄せる側の某百貨店の店長は頭を悩ませていた．
どうやらフロアの準備が開店に間に合いそうにない．
そこで店長はある一つのアイディアを思いついた．
それは開店後，店内を徐々に開放すればなんとか営業できるのではないかというものである．
あなたは刻一刻と変化する店内の情報を元に，お目当ての福袋がどの時間帯から入手... | [
{
"submission_id": "aoj_2364_7994970",
"code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (u... |
aoj_2349_cpp | World Trip
Kita_masa is planning a trip around the world.
This world has
N
countries and the country
i
has
M_i
cities.
Kita_masa wants to visit every city exactly once, and return back to the starting city.
In this world, people can travel only by airplane.
There are two kinds of airlines: domestic and international li... | [
{
"submission_id": "aoj_2349_4934973",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 15\n#defi... |
aoj_2366_cpp | Elevator
Time Limit: 8 sec / Memory Limit: 64 MB
E: エレベータ
あなたの友人は，キリンのマークの引越業者でアルバイトをしている．
彼の仕事は，建物から荷物を運び出すことである．
今回，彼はある
n
階建てのビルからいくつかの荷物を運び出すことになった．
幸い，このビルにはエレベータが1つ備え付けられているため，
エレベータで荷物を運び出すことにした．
運び出すべき荷物は，各階に複数個あり，荷物毎に重さが異なる．
エレベータには，重量制限が設定されており，重さ
W
を超える荷物を載せることはできない．
エレベータは十分に広く，重量制限を満たすならば，どれだけ多くの荷物でも載せることが... | [
{
"submission_id": "aoj_2366_9054837",
"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)rn... |
aoj_2359_cpp | 問題文
実数変数 $X_1, X_2, ...$ があり、何らかの初期値が割り振られている。
これから $Q$ 個の情報が順番に与えられる。与えられる情報は以下の2種類のいずれかである。
min $\{X_{a_i}, X_{a_i+1}, ..., X_{b_i}\} = y_i$ である。
変数 $X_{a_i}, X_{a_i+1}, ..., X_{b_i}$ に $y_i$ を代入する。
これら $Q$ 個の情報が矛盾しないように各変数の初期値を選べるかどうか判定せよ。
入力
入力は以下の形式に従う。与えられる数は全て整数である。
$Q$
$t_1$ $a_1$ $b_1$ $y_1$
$t_2$ $a_2$ $b_2$ ... | [
{
"submission_id": "aoj_2359_9883680",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cstdio>\n#include <queue>\n#include <cstdlib>\n#include <set>\n#include <algorithm>\nusing namespace std;\n#define N (1<<18)\n\nstruct Query{\n\tint t,a,b,y;\n};\nint Q;\nQuery que[50000];\n\nset<int> n... |
aoj_2369_cpp | Problem A:
CatChecker
外見からねこかどうかわからない動物がいる. あなたは, 鳴き声がねこの鳴き声であればねこであり, そうでなければうさぎであると判定することにした.
ねこの鳴き声は次のように定義される.
"" (empty string) はねこの鳴き声である.
$X$, $Y$ がねこの鳴き声であれば 'm' + $X$ + 'e' + $Y$ + 'w' は猫の鳴き声である. ただし + は文字列の連結を表す.
以上で定義されるものだけがねこの鳴き声である.
BNF で表すとねこの鳴き声 $CAT$ は
$CAT$ := "" (empty string) $|$ 'm' + $CAT$ + 'e' +... | [
{
"submission_id": "aoj_2369_10853968",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\n\nint N;\nstring S;\nmap<pair<int, int>, int> mp;\n\nbool is(int s, int t) {\n\tif (s == t) return true;\n\tif (t - s < 3 || S[s] != 'm' || S[t - 1] != 'w') return false;\n\n\t... |
aoj_2373_cpp | Problem E:
HullMarathon
うさぎはフルマラソンという競技が好きである. この競技はチームで行う. チームメンバーは競技開始前に原点に集まる. 競技開始と同時に走り出し, 1 分後に立ち止まる．このとき，チームメンバーの位置の凸包の面積が最も大きなチームが勝ちとなる.
あなたは $N$ 匹のうさぎからなるチームの監督である. $i$ 匹目のうさぎは 1 分で $r_i$ 移動することができる. このチームが最適な戦略をとった場合の, 1 分後の凸包の面積の最大値を求めよ.
Constraints
$N$ will be between 3 and 8, inclusive.
$r_i$ will be an in... | [
{
"submission_id": "aoj_2373_10579537",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n#define rep2(i, j, k) for(ll i=ll(j);i<ll(k);i++)\n#define rep(i, j) rep2(i,0,j)\n#define rrep2(i, j, k) for(ll i=ll(j)-1;i>=ll(k);i--)\n#define rrep(i, j) rrep2(i,j,0)\n#define SZ(a) ll(a.size())\n#def... |
aoj_2370_cpp | Problem B:
RabbitWalking
うさぎの住んでいる都市には, $V$ 個の交差点と $E$ 本の道がある. 交差点は 1-indexed で番号が付けられている. $i$ 番目の道は交差点 $a_i$ と交差点 $b_i$ を bidirectional につないでいる.
うさぎは, 散歩と奇数が好きである．うさぎはある交差点から出発し, 道を奇数本辿り, 出発した頂点に戻るような経路に沿って散歩したいと思っている．
この都市の市長であるねこは, 都市内の移動を効率化するために異なる2 つの交差点を結ぶ道をたくさん追加しようとしている．ただし，ある交差点の組に対して敷設することが出来る道は高々1本までである．また，... | [
{
"submission_id": "aoj_2370_10209831",
"code_snippet": "// AOJ #2370\n// RabbitWalking 2025.2.10\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int V, E;\n cin >> V >> E;\n\n if(E == 0) {\n ll a... |
aoj_2371_cpp | Problem C:
TransferTrain
うなぎは電車に乗るのが好きである. いま，うなぎは駅 A から駅 B へ電車を使って行こうとしている. うなぎは急いでいるので, 最短時間の経路を選ぶことにした. ただし，うなぎは乗り換えが苦手なので, 最短時間の経路が複数ある場合は最も乗り換え回数の少ない経路を選ぶことにした.
$N$ 本の路線がある. $i$ 本目の路線は $a_i$ 個の駅を通っている. $i$ 本目の路線の通る駅名は通る順に $s_{i,0}, ... , s_{i,a_i -1}$ であり, 駅間の所要時間は $t_{i,0}, ..., t_{i,a_i - 2}$ である. 電車は路線上を上下方向に走... | [
{
"submission_id": "aoj_2371_10855658",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing lint = long long;\n\nconstexpr lint LLINF = 1LL << 61;\nconstexpr pair<lint, lint> INF = make_pair(LLINF, LLINF);\n\nstruct edge{\n int to;\n lint cost;\n lint trans;\n};\n\nstruct node{\... |
aoj_2367_cpp | Icy Composer
Time Limit: 8 sec / Memory Limit: 64 MB
F: 氷の作曲家
岡部錬太郎(愛称オカレン)は，西洋音楽の第一人者である．
彼は，5歳から作曲を行うことができた天才であり，彼が作詞・作曲した『攻城の槌』はとても有名である．
才能あふれるオカレンだが，残念なことに，彼は，レストランで食べた魚にあたって亡くなっている．
・・・少なくとも，この世界線では，そういうことになっている．
世界線とは何か？
一つの歴史は，一つの世界線に対応する．
我々が歩んできた歴史とは，無限に存在する世界線のうちの一つに過ぎず，
別の世界線では，また違った歴史が刻まれている．
オカレンは，自らを待ちうけ... | [
{
"submission_id": "aoj_2367_372125",
"code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <algorithm>\n#include <iostream>\n#include <math.h>\n#include <assert.h>\n#include <vector>\n#include <queue>\n#include <string>\n#include <map>\n#include <set>\n\nusing namespace std;\ntypedef long long... |
aoj_2372_cpp | Problem D:
IkaNumber
数直線上の整数座標に, ねこの Taro の家, にんじん, うさぎの Hanako の家がこの順に並んでいる. 点 $x$ にいるイカは, 一回のジャンプで $x + 1$ または $x + 2$ に移動することができる.
あなたは, イカが Taro の家から Hanako の家までにんじんの置かれている座標に止まらずに行く経路が何通りあるか求めようとしたが, Taro の家, にんじん, Hanako の家の座標を知らないので
求めることができなかった. そこで, 代わりに経路の数として考えられる数をすべて列挙することにした.
ある Taro の家, にんじん, Hanako の家の配... | [
{
"submission_id": "aoj_2372_4964447",
"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=(int)(n)-1; i>=0; --i)\n#define FOR(i, a, n) for (int i=(a); i<(n); ++i)\n#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a)... |
aoj_2375_cpp | Problem G:
CarrotBreeding
にんじんは繁殖の好きな植物である.
うさぎが畑でにんじんを飼うことにした. 畑は (0, 0) と (1000000000, 1000000000) を対角線とする正方形 (boundary を含む) である. うさぎは, 2 個以上のにんじんを通るすべての直線に沿って毎日1 回ずつ水をまくことにした.
このにんじんたちは, 毎日 $N$ 回ずつ水をまかれるのが繁殖に最適だと考えているので, そのような条件を満たすようにうさぎの畑に並ぶことにした. にんじんは畑内部の格子点にしか並ぶことができない. また, そのような条件を満たす並び方が複数ある場合は, 最もにんじんの個数が少ない... | [
{
"submission_id": "aoj_2375_9450948",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing vll=vector<ll>;\nusing vvll=vector<vll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nll M=1e9;\n\nll num(vector<pair<ll,ll>> &V){\n ll N=V.size();\n set<tuple<ll,ll,ll>> L... |
aoj_2379_cpp | Problem A:
Bicube
Mary Thomas has a number of sheets of squared paper. Some of squares are painted either in black or some
colorful
color (such as red and blue) on the front side. Cutting off the unpainted part, she will have eight opened-up unit cubes. A unit cube here refers to a cube of which each face consists of o... | [
{
"submission_id": "aoj_2379_3648858",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 0: top, 1: front, 2:right, 3:back, 4:left, 5:bottom\nconst vector<vector<string>> dice_map = {\n {\"0...\",\n \"1234\",\n \"5...\"},\n {\"0...\",\n \"1234\",\n \".5..\"},\n {... |
aoj_2376_cpp | Problem H:
DisconnectedGame
Taro と Hanako がゲームをしている.
最初に, 非連結な無向グラフ(二重辺や self loop を含まない) が与えられる. Taro と Hanako は交互に操作を行う. 操作では, 辺で直接つながれていない異なる2 頂点を選び, その間に辺を加える. グラフを連結にしたほうが負けである.
グラフには $V$ 個の頂点がある. $V \times V$ の行列が与えられる. 行列の $(i, j)$-成分が'Y' であるとき $i$ と $j$ の間には辺があり, 'N' であるときは辺が無い.
両者が最善に操作をしたとき, どちらが勝つかを出力せよ.
Con... | [
{
"submission_id": "aoj_2376_10238725",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstring dp[1009][1009][2];\nbool used[1009];\n\nvoid dfs(int pos, int &cnt, vector<vector<int>> &G) {\n used[pos] = true;\n cnt += 1;\n for (int to : G[pos]) {\n if (used[to] == true) co... |
aoj_2378_cpp | Problem J:
SolveMe
$N$ 個の部屋があり, それぞれの部屋の床にはうさぎの絵が描かれている. あなたが部屋 $r$ のうさぎの絵の右耳の部分に乗ると, あなたは部屋 $A[r]$ に書かれたうさぎのしっぽの上にテレポートする. 同様に, 部屋 $r$ のうさぎの絵の左耳の部分に乗ると, 部屋 $B[r]$ に書かれたうさぎのしっぽの上にテレポートする.
整数 $X$, $Y$, $Z$ が与えられる. ねこは, 以下の条件を満たすようにテレポートを設定しようとしている. テレポートの $N^{2N}$ 通りの設定方法のうち, 条件を満たすものは何通りか, mod 1,000,000,007で求めよ.
条件: 任意... | [
{
"submission_id": "aoj_2378_10910520",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\n\nusing ll = long long;\n#define REP(i,n) for(ll i=0; i<ll(n); i++)\ntemplate<class T>using V = vector<T>;\n\nconst int MOD = 1000000007;\n\nstruct... |
aoj_2374_cpp | Problem F:
RabbitLunch
うさぎは昼食ににんじんとキウイを1 個ずつ食べる. うさぎはとても個性的なので, 食べるにんじんの種類もキウイの種類も同じであるような, 異なる2 匹のうさぎが存在してはならない.
にんじんは $M$ 種類ある. $i$ 種類目のにんじんは $m_i$ 個ある. キウイは $N$ 種類ある. $i$ 種類目のキウイは $n_i$ 個ある. 最大何匹のうさぎが昼食をとれるか求めよ.
$m_i$ と $n_i$ は次の漸化式を用いて生成せよ.
$m_0 = m0$
$m_{i+1} = (m_i * 58 + md )$ mod $(N + 1)$
$n_0 = n0$
$n_{i+1} =... | [
{
"submission_id": "aoj_2374_10850909",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\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 mp make_pair\n#define pb push_back\n#define fst first\n#define snd second\ntypedef long long ll;\ntypedef pair<... |
aoj_2377_cpp | Problem I:
ThreeRooks
ねこがチェスの練習をしている.
ねこは, $X \times Y$ のチェス盤の上にルークを 3 つ置こうとしている. このチェス盤の $K$ 個のマス目にはうさぎが座っている. $i$ 匹目のうさぎの座標は $(x[i], y[i])$ である. ただし, チェス盤の左上端のマス目の座標を $(0, 0)$, 右下端のマス目の座標を $(X-1, Y-1)$ とする。うさぎが座っている場所にはルークを置くことができない. また, 1 つのマス目に複数個のルークを置くことはできない.
どの 2 つのルークも互いに攻撃し合わないようにルークを3 つ置く方法は何通りあるか, mod 1,000... | [
{
"submission_id": "aoj_2377_10351503",
"code_snippet": "// AOJ #2377 ThreeRooks\n// 2025.4.6\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();... |
aoj_2386_cpp | Problem H:
Sightseeing Tour
KM city has $N$ sightseeing areas. Currently every pair of area is connected by a bidirectional road.
However for some reason, Mr. KM, the mayor of this city, decided to make all of these roads one-way . It costs $C_{i, j}$ dollars to renovate the road between area $i$ and area $j$ to a one-... | [
{
"submission_id": "aoj_2386_1855992",
"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... |
aoj_2380_cpp | Problem B:
Bubble Puzzle
A browser-based puzzle game called "Bubble Puzzle" is now popular on the Internet.
The puzzle is played on a 4 × 4 grid, and initially there are several bubbles in the grid squares. Each bubble has a state expressed by a positive integer, and the state changes when the bubble gets stimulated. Y... | [
{
"submission_id": "aoj_2380_10850629",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint ans = 6;\n\nstruct drop{\n int y, x, d;\n\n int id;\n\n bool operator==(const drop & rhs) const {\n return y == rhs.y && x == rhs.x && d == rhs.d;\n }\n};\n\ntemplate<typename T>\... |
aoj_2382_cpp | Problem D:
King Slime
There is a grid of size
W
×
H
surrounded by walls. Some cells in the grid are occupied by slimes. The slimes want to unite with each other and become a "King Slime".
In each move, a slime can move to east, west, south and north direction until it enters a cell occupied by another slime or hit the ... | [
{
"submission_id": "aoj_2382_10854004",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = 1e9;\n\nclass union_find {\npublic:\n union_find(int N)\n : par(N, -1)\n {}\n\n int root(int x) {\n return par[x] < 0 ? x : par[x] = root(par[x]);\n }\n\n ... |
aoj_2383_cpp | Problem E:
Rabbit Game Playing
Honestly, a rabbit does not matter.
There is a rabbit playing a stage system action game. In this game, every stage has a difficulty level. The rabbit, which always needs challenges, basically wants to play more difficult stages than he has ever played. However, he sometimes needs rest to... | [
{
"submission_id": "aoj_2383_9666591",
"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_2385_cpp | Problem G:
Shelter
Taro lives in a town with N shelters. The shape of the town is a convex polygon.
He'll escape to the nearest shelter in case of emergency. Given the current location, the cost of escape is defined as the square of the distance to the nearest shelter. Because emergency occurs unpredictably, Taro can b... | [
{
"submission_id": "aoj_2385_3684476",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ld = long double;\nusing point = std::complex<ld>;\nusing polygon = std::vector<point>;\n\nconstexpr ld eps = 1e-10;\n\nld dot(point const& a, point const& b) {\n return std::real(std::conj(a) ... |
aoj_2387_cpp | Problem I:
Tampopo Machine
"Today is another day of endless, tedious work to put a tampopo on sashimi..."
Yaruo works in a sashimi (sliced raw fish) factory. His job is to put tampopos on sashimi packages everyday. Tired of this menial job, he decided to develop a tampopo machine to do the job instead of him.
The tampo... | [
{
"submission_id": "aoj_2387_8860926",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <random>\n#include <unordered_map>\n#include <vector>\nusing namespa... |
aoj_2390_cpp | AYBABTU
There is a tree that has
n
nodes and
n-1
edges.
There are military bases on
t
out of the
n
nodes.
We want to disconnect the bases as much as possible by destroying
k
edges.
The tree will be split into
k+1
regions when we destroy
k
edges.
Given the purpose to disconnect the bases, we only consider to split in... | [
{
"submission_id": "aoj_2390_10849697",
"code_snippet": "/*\n * =====================================================================================\n *\n * Filename: j.cpp\n *\n * Description:\n *\n * Version: 1.0\n * Created: 2013年11月23日 14时47分56秒\n * Revision: none\n * ... |
aoj_2384_cpp | Problem F:
Rabbit Jumping
There are $K$ rabbits playing on rocks floating in a river. They got tired of playing on the rocks on which they are standing currently, and they decided to move to other rocks. This seemed an easy task initially, but there are so many constraints that they got totally confused.
First of all, ... | [
{
"submission_id": "aoj_2384_10850168",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <unordered_set>\n#include <iomanip>\n#include <vector>\n#include <bitset>\n#include <queue>\n#include <cmath>\n#include <unordered_map>\n\nusing namespace std;\n\nconst double INF = 1e100;\nint N, K;... |
aoj_2393_cpp | Dungeon Creation
The king demon is waiting in his dungeon to defeat a brave man.
His dungeon consists of
H \times W
grids.
Each cell is connected to four (i.e. north, south, east and west) neighboring cells and some cells are occupied by obstacles.
To attack the brave man, the king demon created and sent a servant tha... | [
{
"submission_id": "aoj_2393_10854038",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n\nusing namespace std;\n\ntypedef long long LL;\nconst int dir[4][2] = {-1, 0, 1, 0, 0, -1, 0, 1};\nconst int ... |
aoj_2392_cpp | Digit
For a positive integer
a
, let
S(a)
be the sum of the digits in base
l
.
Also let
L(a)
be the minimum
k
such that
S^k(a)
is less than or equal to
l-1
.
Find the minimum
a
such that
L(a) = N
for a given
N
, and print
a
modulo
m
.
Input
The input contains several test cases, followed by a line containing "0 0 0".
E... | [
{
"submission_id": "aoj_2392_10351770",
"code_snippet": "// AOJ #2392 Digit\n// 2025.4.6\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 int n = 0; int c = gc();\n do n = 10*n + (c & 0xf), c... |
aoj_2394_cpp | Longest Lane
Mr. KM, the mayor of KM city, decided to build a new elementary school.
The site for the school has an awkward polygonal shape, which caused several problems.
The most serious problem was that there was not enough space for a short distance racetrack.
Your task is to help Mr. KM to calculate the maximum po... | [
{
"submission_id": "aoj_2394_10853935",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#include<cmath>\n#include<vector>\n#include<cassert>\n#define N 110\n#define eps 1e-5\nusing namespace std;\n\nint dlcmp(double x) {return x<-eps?-1:x>eps;}\ndouble sqr(double x) {return x*x;}\... |
aoj_2397_cpp | Three-way Branch
There is a grid that consists of
W \times H
cells. The upper-left-most cell is
(1, 1)
.
You are standing on the cell of
(1,1)
and you are going to move to cell of
(W, H)
.
You can only move to adjacent lower-left, lower or lower-right cells.
There are obstructions on several cells. You can not move t... | [
{
"submission_id": "aoj_2397_10853997",
"code_snippet": "#include <cstdio>\n#include <vector>\n#include <cstdlib>\n#include <algorithm>\n#include <cstring>\n#include <map>\n#define llint long long\n#define MOD 1000000009\n\nusing namespace std;\n\nconst int maxn = 75; //必须加 const，否则编译错误\n\nint n, N;\nllint ... |
aoj_2396_cpp | Skyland
Somewhere in the sky, KM kingdom built
n
floating islands by their highly developed technology.
The islands are numbered from 1 to
n
.
The king of the country, Kita_masa, can choose any non-negative real number as the altitude for each island, as long as the sum of the altitudes is greater than or equals to
... | [
{
"submission_id": "aoj_2396_1134890",
"code_snippet": "#include <cstdio>\n#include <cmath>\n#include <cstring>\n#include <cstdlib>\n#include <climits>\n#include <ctime>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <list>\n#include <vector>\n#include <set>\n#include <map>\n#include <i... |
aoj_2391_cpp | Billiards Sorting
Rotation is one of several popular pocket billiards games.
It uses 15 balls numbered from 1 to 15, and set them up as illustrated in the following figure at the beginning of a game.
(Note: the ball order is modified from real-world Rotation rules for simplicity of the problem.)
[ 1]
[ 2]... | [
{
"submission_id": "aoj_2391_10851349",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <cstring>\n#include <cmath>\n#include <string>\n#include <stack>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <set>\n#include <cstdlib>\n#define INF 0x3f3f3f3f\n#define er(i) (1<<i)... |
aoj_2399_cpp | Save Your Privacy!
君のプライバシーを守れ!
English text is not available in this practice contest.
ICPC (International Committee of Privacy and Confidence) は世界中に多くの構成員を持つ組織であり、その名の通り非常にプライバシーを尊重する、秘密主義者たちの団体である。構成員たちは必要上他の構成員の個人情報を知ってしまうことがあるが、それらを厳重に秘匿するよう義務付けられている。
しかしある日、何人かの構成員の個人情報が漏洩してしまった！ICPCの ACM (Account Control Manager... | [
{
"submission_id": "aoj_2399_10852712",
"code_snippet": "#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i = 0; i < n; ++i)\n#define all(x) x.begin(), x.end()\n#define X firsst\n#define Y second\n#define pb push_back\nusing namespace std;\n\nint main(void){\n int n;\n while(cin >> n && n){\n int m,... |
aoj_2400_cpp | You Are the Judge
審判は君だ！
English text is not available in this practice contest.
あなたはプログラミングコンテスト iCPC の審判だ。今日も何事もなく試合が終わり、後は結果を出力するだけだと思いきや、突然システムが停止してしまった！
これでは結果が出力できない！ でも、大丈夫。我々にはログがある。
あなたは優れたプログラマーであり、かつて iCPC で輝かしい成績を残したこともある。
そこであなたはシステムログから各チームの成績を割り出し、チームの順位表を出力するプログラムを作成することにした。
入力としてチームの数、問題の数、システムログが与えられる... | [
{
"submission_id": "aoj_2400_10612926",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nbool solve() {\n int T, P, R;\n cin >> T >> P >> R;\n if (T == 0 && P == 0 && R == 0) return false;\n vector<vector<bool>> AC(T, vector<bool>(P, false));\n vector<vector<int>> WA(T, vect... |
aoj_2401_cpp | Equation
恒等式
English text is not available in this practice contest.
論理演算では，値は T と F の2種類だけを扱う．
"-"を単項演算子（入力が 1 つの演算を表す記号），
"*", "+", "->" を 2 項演算子（入力が 2 つの演算を表す記号）とする．
"-" は論理否定(NOT)，
"*" は論理積(AND)，
"+" は論理和(OR)，
"->" は論理包含(IMP)を表す演算子である．
これらの論理演算の真理値表を下の表に示す．
x
y
-x
(x*y)
(x+y)
(x->y)
T
T
F
T
T
T
T
F
F
F
T
F
F
T
T
F
... | [
{
"submission_id": "aoj_2401_10678747",
"code_snippet": "#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\n\n\nstruct custom_hash {\n static uint64_t splitmix... |
aoj_2402_cpp | Milky Way
天の川
English text is not available in this practice contest.
天の川交通公社は星間旅行ツアーの企画・運営を行う旅行会社である。
天の川交通公社では「天の川横断織姫彦星体験ツアー」という企画を計画中である。
このツアーは琴座のベガを出発し、
星々を巡って鷲座のアルタイルに向かうというものである。
あなたは天の川交通公社に社員であり、
ツアーの経路の選択を任されている。
簡単のため天の川は2次元座標上にあるものとし、
星は五芒星で表現されるものとする。
ツアーに使用する宇宙船には特殊なエンジンが搭載されており、
五芒星の線分上はエネルギー無しで移動することがで... | [
{
"submission_id": "aoj_2402_10668015",
"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_2395_cpp | PLAY in BASIC
One sunny day, Dick T. Mustang found an ancient personal computer in the closet.
He brought it back to his room and turned it on with a sense of nostalgia, seeing a message coming on the screen:
READY?
Yes. BASIC.
BASIC is a programming language designed for beginners, and was widely used from 1980's to 1... | [
{
"submission_id": "aoj_2395_10851243",
"code_snippet": "//by yjz\n#include<bits/stdc++.h>\nusing namespace std;\n#define FF first\n#define SS second\n#define PB push_back\n#define MP make_pair\n#define bged(v) (v).begin(),(v).end()\n#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end... |
aoj_2403_cpp | The Enemy of My Enemy is My Friend
敵の敵は味方
English text is not available in this practice contest.
時は XXXX 年。戦乱の世である。
土地や資源を巡って、隣り合った国同士の衝突がそこかしこで起こり、世の中の先行きは非常に不透明であった。そんな中とある国が、様々な国と軍事同盟を結んでこの乱世を生き延びようと考えた。軍事同盟は次の条件をみたすように行うことが出来る。
自国の隣国とは同盟を結ぶことは出来ない。
同盟をした国の隣国とは同盟を結ぶことは出来ない。
ただし、国ごとにその軍事的な強さは異なっている。軍事的に強くない複数の国と同盟を結... | [
{
"submission_id": "aoj_2403_10848106",
"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\nmap<string, int>mp;\nint num = 0;\n\nint getnum(string st) {\n\tif (m... |
aoj_2404_cpp | Dog Food
ドッグフード
English text is not available in this practice contest.
あなたは, 賢い犬を選ぶコンテストの主催者である．
種目の1つに，以下のようなものがある．
この種目は，平面的な広場の上で行われる．
広場には杭がいくつか立っており，そのうちの1つと，犬はロープで結ばれている．杭やロープの太さは無視できるものとする．ロープが結ばれている杭の座標を(0，0)，犬の位置を(Dx，Dy)とする．
また，ロープが結ばれている杭以外の杭の本数をｎ本とし，それらの座標を(x
1
，y
1
)... (x
n
，y
n
)とする．
初期状態で，ロープはピンと張られた状態で... | [
{
"submission_id": "aoj_2404_2818209",
"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;\n\nconst double EPS = 1e-10;\nconst double INF = 1e12;\nconst double PI = acos(-1);\n#define ... |
aoj_2405_cpp | Sister Ports
姉妹港
English text is not available in this practice contest.
ACM 国は正 n 角形の島国である．
n 個の角に港があり，ある角の港から時計回りに 1 から n までの番号が順番に付いている．
港は点とみなす．
ACM 国には，二種類の道路がある．
隣り合う港を繋ぐ道路
全ての隣接する港は道路で接続されている．すなわち，番号の差が 1 である港同士および港 1 と港 n の間に道路がある．この種類の道路は n 本ある．
島の内部を通る道路
一部の隣接しない港の間も，道路で接続されている．この種類の道路は m 本あり，道路 i は港 a
i
と港 b... | [
{
"submission_id": "aoj_2405_10826161",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>bool chmax(T &a,const T &b){return ... |
aoj_2398_cpp | Tree Allocation
A tree is one of the most popular data structures in computer science.
Tree itself is very elegant, but it is incompatible with current computer architecture.
In the current architecture, memory can be regarded as a one-dimensional array.
Since a tree is not a one-dimensional structure, cache efficienc... | [
{
"submission_id": "aoj_2398_10852730",
"code_snippet": "#include <cstring>\n#include <cstdio>\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst int Maxn = 100010;\t\nint n, b;\nvector<int> vec[Maxn];\nint dp[Maxn], B[Maxn],tmpdp[Maxn];\nbool cmp(... |
aoj_2410_cpp | E - じゃんけん
問題文
E 君はじゃんけんが大好きである (ちなみにじゃんけんのルールについては
Wikipediaのじゃんけんのページ
を参照せよ)．
ある日，町内でじゃんけん大会があるということを知った E 君は，じゃんけんの腕に自信があったこともあり早速出場することにした．
ところが大会当日，E 君を待ち受けていたのは，普通の「グー・チョキ・パー」のみからなる普通のじゃんけんではなく，
より多くの手からなる
一般化されたじゃんけん
であった．
一般化されたじゃんけん
は 2 人のプレイヤーで行われるゲームである．
まず，2 人にはこのじゃんけんにおいて使用出来る手の個数
N
と，
N
個の手の勝敗関係を示す表が伝えられる．... | [
{
"submission_id": "aoj_2410_5021796",
"code_snippet": "#include <bits/stdc++.h>\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... |
aoj_2412_cpp | G - 村
問題文
きつねのしえるは，休暇でとある小さな村を訪れている．彼女が驚いたのは，その村の表札がもつ性質である．
村には
N
個の家屋がある．ここでは簡単のため，村は 2 次元平面であるとし，家屋はこの平面上の点であると見なす．
それぞれの家屋には表札が 1 個設けられており，その家の苗字を表していた．しえるは村の中を訪問するにつれて，この村の表札が次のような性質を持っていることに気付いた．
ある実数
R
が存在する．
もし 2 つの家屋の距離が
R
以下であるなら，その 2 つの家屋は同じ表札を持つ．
もし 2 つの家屋の距離が
3R
以上であるなら，その 2 つの家屋は異なる表札を持つ．
任意の 2 つの家屋の距離は
R... | [
{
"submission_id": "aoj_2412_10916185",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <unordered_map>\n#include <utility>\n#include <cstdint>\nusing namespace std;\n\nstruct DSU {\n vector<int> p, sz;\n DSU(int n) : p(n), sz(n, 1) { for (int i = 0; i < n; ++i) p[... |
aoj_2411_cpp | F - Acceleration of Network
インターネットと言う広大な海は少しずつ黒く塗りつぶされていった。
ボットの反乱、DDOS攻撃の嵐、ウィルスの蔓延、
何度も何度も繰り返されたクラッカーとの戦争で、人もインターネットもボロボロになった。
人の手では、インターネットはどうにもならない。
だから人は、とんでもない時間をかけて
インターネットを復旧できる「少女」を造った。
少女は、インターネットの手当をはじめた。
果てしなく広いインターネットの世界をどうにかしようと頑張った。
まだ少女ひとりでは撚り対線を織る事くらいしかできないけど、
長い長い時がすぎてインターネットが少し復旧すれば、
みんなと一緒に頑張れるだろうとい... | [
{
"submission_id": "aoj_2411_10307782",
"code_snippet": "// AOJ #2411 Acceleration of Network\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\td... |
aoj_2415_cpp | J - 刺身
問題文
きつねのしえるは川で釣りをしていた．黒くて細長い魚を手に入れることができたので，その場で切り刻んで刺身にして食べることにした．
魚は体長が
N
センチメートルある．奇妙なことに，この魚は身体の部分ごとに密度が異なっていた．
魚の身体を頭から 1 センチメートルごとに区切って番号を
1, 2, ..., N
と付けるとき，身体の
i
番目の部分の重みは
w_i
であった．
魚の
i
番目から
j
番目までの部分を
[i..j]
と表すことにする．
最初，しえるは魚の身体
[0..N-1]
を 1 枚だけ持っていると見なせる．しえるはこれを切っていき最終的に
N
個に分割された魚の身体
[0..0], [1..1]... | [
{
"submission_id": "aoj_2415_11008227",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<... |
aoj_2413_cpp | H - 植林
問題文
とある大学の魔法学部の生徒であるK君は広大な屋敷に住んでいる．
屋敷の裏には林が広がっていたが，所々木が生えていない箇所があった．
このままでは屋敷からの見た目が悪いと感じたので，K君は木が生えていない箇所に木を植えることに決めた．
魔法使いの卵であるK君は使い魔を召喚することが出来るので，植林の作業を使い魔にやらせようと考えた．
林は
H × W
個のセルを持つ長方形領域とみなすことが出来る．
各セルは木が1本生えているか1本も生えていないかのどちらかである．
K君はこの
H × W
個のセルのどれか 1 つを指定し，そこに使い魔を召喚する．
しかしK君はまだ未熟者なので，魔力を調節す... | [
{
"submission_id": "aoj_2413_10283335",
"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_2419_cpp | Acrophobia
C: 高所恐怖症
高杉やよいは，超売れっ子アイドルである．
そんな彼女には，1つ苦手なものがある．
高いところだ・・・．彼女は，極度の高所恐怖症なのである．
彼女は今回，プロデューサーの不手際により，バラエティ番組で次のようなチャレンジに挑戦することになってしまった．
今回のロケは，とある忍者屋敷のとある一室で行われる．
この部屋の床には，正方形のタイルが敷き詰められており，いくつかのタイルが抜け落ちて穴になっている．
この穴から落ちると数メートル下の池にまっさかさまである．
やよいのチャレンジ内容は，この部屋の指定された場所からスタートし，部屋の中に置かれた全ての巻物を回収し，ゴール地点まで持っていくことであ... | [
{
"submission_id": "aoj_2419_10000626",
"code_snippet": "#include \"bits/stdc++.h\" \n\nusing namespace std;\n\nvector<vector<int> > cst(110, vector<int>(110, 1)); \nint dist[110][110];\nint n, m;\n\nstruct node\n{\n int x, y, d;\n};\n\nvoid dejkstra(int x, int y)\n{\n queue<node> q;\n node p = ... |
aoj_2416_cpp | K - XOR回廊
問題文
KU大学では一風変わったラリーゲームが人気である．
このゲームの舞台であるサーキットには，
N
個の休憩所と
M
個の道があり，
i
番目の道は
f
i
番目の休憩所と
t
i
番目の休憩所の間にある．
すべての道にはチェックポイントが一つずつ存在し，道
i
のチェックポイントを通過するとどちらの向きで通っても
p
i
の得点がXORで加算される．
XORで
加算される．大事なことなので2回言いました．
このゲームでは，同じ休憩所や道を何度通っても良いし，
ゴールにたどり着いてもそのままラリーを続行することができるが，
道の途中にあるチェックポイントを迂回して別の休憩所へ行くことは禁止されている．
そのた... | [
{
"submission_id": "aoj_2416_10307881",
"code_snippet": "// AOJ #2416 XOR Cloister\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\tif (c == '-'... |
aoj_2422_cpp | Transparent Mahjong
F: 透明な麻雀牌
あなたは，闇に舞い降りた天災と噂されるギャンブラーの鷹巣さんと麻雀で対局することになった．
鷹巣さんは天災と噂されるだけあって，鷹巣牌という奇怪な麻雀牌を用いた対局を提案してきた．
麻雀とは，プレイヤーが互いに手牌という複数枚の牌を持ち合い，自分の手牌を相手よりもはやく，アガリの形にすることで勝利が確定するゲームである．
麻雀の牌の表側には，その牌が何であるかが描かれており，牌の裏側には，何も描かれていない．
よって，あなたが麻雀で対局するときは，あなたの手牌の表側をあなたの側に，裏側を対局者の側に向けるとよい．
こうすることで，あなたの手牌が何であるかは，あなたのみが知る... | [
{
"submission_id": "aoj_2422_10342585",
"code_snippet": "// AOJ #2422 Transparent Mahjong\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint n;\nvector<int> orig(13);\nunordered_map<string,bool> memo;\n\nstring enc(const vector<int>& f, int w, const vector<int>& a) ... |
aoj_2421_cpp | Markup language has Declined
E: マークアップ言語は衰退しました
わたしたち人類がゆるやかな衰退を迎えて，はや数世紀．
すでに地球は”ぷろぐらまー”のものだったりします．
平均身長170センチで7頭身，高い知能を持ち，こーでぃんぐが大好きなぷろぐらまーさんたち．
わたしは，そんなぷろぐらまーさんと人との間を取り持つ重要な職，国際公務員の” えすいー ”となり，故郷のニブンキの里に帰ってきました．
祖父の年齢でも現役でできる仕事なのだから，さぞや楽なのだろうとこの職を選んだのですが…．
ある日，ぷろぐらまーさんたちが渡してくれたのは，2枚の設計書のようなもの．
そのぷろぐらまーさん曰く，テキストとスクリプ... | [
{
"submission_id": "aoj_2421_2997905",
"code_snippet": "#include <cstdio>\n#include <cstdint>\n#include <cctype>\n#include <cassert>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n#include <regex>\n\n#define fprintf(...) void(0)\n\nstd::string join(const std::vector<std::string... |
aoj_2420_cpp | Anipero 2012
D: アニペロ2012
アニペロサマーライブ，通称アニペロは，さまざまなアニメソングアーティストたちが集結する，日本国内最大のアニメソングライブイベントである．アニソンが大好きな2D君は，昨年に引き続き，今年もアニペロに行くことにした．
彼は，アニペロを楽しむために，すでにサイリウムを
m
本購入している．サイリウムとは，折ると化学反応で光るスティックである．リズムに合わせてサイリウムを振ることで，ライブを盛り上げることができ，自分の満足度も上昇する．今回，彼が購入した全てのサイリウムは，次のような性質を持つ．
サイリウムは，折ってから時間が経過するにつれ暗くなっていき，10分で光を失う．
折ってから5分の... | [
{
"submission_id": "aoj_2420_2967017",
"code_snippet": "#include<iostream>\n#include<vector>\n#define VAL 55\nusing namespace std;\nusing lli = long long int;\nlli dp[VAL][VAL][VAL][VAL]; // 曲，サイリウム数，状態1，状態2\n\nint main(){\n int n, m;\n std::cin >> n >> m;\n for (int i = 0; i < VAL*VAL*VAL*VAL; i++) {\n ... |
aoj_2425_cpp | 全探索お姉さんの休日
全探索お姉さんはとても優秀な女性である。
お姉さんは格子状の道の経路の数え上げを数千程度なら簡単に数え上げてしまう。
あなたと全探索お姉さんは今、六角形のタイルが敷き詰められた部屋にいる。
お姉さんは初めて見る六角形にとても興奮している様子である。
六角形の並びを座標に表すことに不慣れなお姉さんは図1のような座標系で部屋を表した。
図1
あなたはこの座標系上である地点からある地点まで移動したい。
しかし、お姉さんは 1 分ごとに動きたい方向をあなたに指示する。
いつものお姉さんなら同じ座標の場所を通らないようにあなたに移動の指示を出すだろう。
しかし、この座標系に不慣れなお姉さんは
|x×y×t|
(
x
：... | [
{
"submission_id": "aoj_2425_10914251",
"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_2426_cpp | 宝探し
太郎君はある広場にお宝を探しにやってきました。この広場にはたくさんのお宝が埋められていますが、太郎君は最新の機械を持っているので、どこにお宝が埋まっているかをすべて知っています。広場はとても広いので太郎君は領域を決めてお宝を探すことにしましたが、お宝はたくさんあるためどのお宝がその領域の中にあるかすぐにわかりません。そこで太郎君はその領域の中にあるお宝の数を数えることにしました。
Input
n
m
x
1
y
1
x
2
y
2
...
x
n
y
n
x
11
y
11
x
12
y
12
x
21
y
21
x
22
y
22
...
x
m1
y
m1
x
m2
y
m2
n
は広場に埋まっているお宝の数を表す
m
... | [
{
"submission_id": "aoj_2426_11043154",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<int, 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 = ... |
aoj_2427_cpp | ほそながいところ
高橋君は苹果(りんご)ちゃんとニューヨークを観光することになりました。
高橋君は観光するところに特に希望はなかったのですが、苹果ちゃんの熱烈な誘いにより、以下の地図にあるような"ほそながいところ"を観光することに決まりました。
Google マップ - (C)2012 Google
この"ほそながいところ"はとても細長く、直線とみなすことができます。また、"ほそながいところ"には片方の端にスタート地点が、もう片方の端にゴール地点があり、スタート地点からゴール地点へ向けて何台かの観光用の馬車が走っています。この馬車は以下のようなルールに従って運行されています。
馬車は
n
台あり、すべての馬車はスタート地点から出発し... | [
{
"submission_id": "aoj_2427_8309365",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nlong long Answer = (1LL << 62);\nlong long Dist;\nlong long N, S[19];\nlong long M, D[19];\nlong long Memo[19];\nlong long NumOrder;\nvector<pair<int, int>> Order[100... |
aoj_2428_cpp | 失われし数
時は3xxx年、高度に発達した文明は停滞期を迎えていた。歴史家たちはこの状況を打開しようと過去の叡智を学ぶことにした。注目したのはコンピュータ創世期の天才が残した資料である。この資料には計算式が書かれておりその計算結果が知りたいのだが、残念ながらその一部の文字が薄れて読めなくなっている。仕方がないので計算結果としてありえる最も大きい数を求めることにした。
計算式は2進数で書かれており、演算は足し算・引き算・掛け算の3種類である。括弧も用いられているが括弧内が数字のみであることはない。正確には以下のBNFで定義された文法を満たしている必要がある。
<expression> ::= <number> | <expressi... | [
{
"submission_id": "aoj_2428_10854054",
"code_snippet": "#include <bits/stdc++.h>\n#include <stdlib.h>\nusing namespace std;\n\nusing ll = long long;\nusing pll = pair<ll, ll>;\n \nconstexpr ll M = 1e9+7;\n\nconst string w = \"01+-*()\";\n\nconstexpr int mi = 0;\nconstexpr int ma = 1023;\n\nbool isrange(int... |
aoj_2429_cpp | まるかいて
太郎君は小学生で、チラシの裏に落書きをしています。
ある時、太郎君は次のゲームを思いつきました。
n×n
の格子状のマス目を書いておきます。
それぞれのマス目の初期状態は、丸印が書かれているか、書かれていないかのどちらか一方です。
これらの丸印を消したり書いたりして最終的にどの一列を見ても必ずちょうど1つのみの丸印が、どの一行を見ても必ず1つのみの丸印が存在するようにすることが目標であり、この状態にすればゲームをクリアしたことになります。
太郎君はこのゲームを思いつきましたが、太郎君はこのゲームをクリアするのに大変時間がかかってしまいます。そこで、大学生であるあなたに助けを求めました。
太郎君の兄であり大学生であるあ... | [
{
"submission_id": "aoj_2429_9723846",
"code_snippet": "#include <bits/stdc++.h>\n#define INF 1e9\nusing namespace std;\n\nconst int MAX_N = 100; // Максимальное количество вершин\nconst int MAX_V = 1000; // Максимальное количество вершин в сети\n\nstruct Edge {\n int to, cap, cost, rev;\n};\n\nint n, N... |
aoj_2430_cpp | 最長増加列問題
時は過ぎて太郎君は高校生になりました。
大学生だったお兄さんの影響も受け、コンピューターサイエンスに興味を持ち始めました。
太郎君はコンピューターサイエンスの教科書を読み進め、「最長増加部分列問題」という有名問題があることを知りました。太郎君はこの問題のことを理解しましたが、自分でも類似問題が作れないものかと気になりました。
そこで太郎君は試行錯誤の結果に次のような問題を作りました。
n
個の整数で構成される数列Aがある
m-1
個の区切りを入れて、数列Aを
m
個の数列に分解する。なお、分解後のそれぞれの数列は1つ以上の数を必ず含まなければならない。
この
m
個それぞれの数列内の整数をすべて足し合わせた結果出... | [
{
"submission_id": "aoj_2430_8323868",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\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 rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >=... |
aoj_2431_cpp | 引越し
太郎君は引っ越しをすることになりました。太郎君はたくさんの荷物を持っているので、荷物の運搬を引っ越し業者に頼むことにしました。荷物はいろいろな重さの物があるので、わかりやすいように軽い方から順番に並べて置いてもらうように頼みましたが、引っ越し業者の人はばらばらの順番で荷物を置いていってしまいました。そこで太郎君は荷物を並べ替えようとしましたが、荷物は重いので運ぶのには体力が必要です。それぞれの荷物は今ある場所から他の荷物の間や荷物の端など好きな場所に運ぶことができますが、ある荷物を運ぶにはその荷物の重さと同じだけ体力を使います。太郎君はあまり体力がないので、できるだけ体力を使わずに荷物を軽い方から順番に並べる方法を考えること... | [
{
"submission_id": "aoj_2431_10506310",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto&& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = ... |
aoj_2423_cpp | Code Art Online
G: コードアートオンライン
コードアートオンライン（CAO）は，様々な問題をプログラミングによって解くことにより，冒険を進めて行くオンラインRPGである．
CAOは，世界初のバーチャルリアリティ空間を実現したゲームであったこともあり，大人気の内に完売し，ゲームを購入したユーザ達はこの世界を楽しむはずであった．
しかし，ゲームにダイブしたプレイヤー達は，ゲームマスターから恐るべき託宣を聞かされる．
「君たちプレイヤーの内の誰かが，ラストダンジョンのラストプロブレムを解かない限り，この仮想空間から抜け出すことはできない．そして，この世界での，WAやTLE・REは，現実世界での死を意味する．心して問題にと... | [
{
"submission_id": "aoj_2423_8818854",
"code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\nt... |
aoj_2424_cpp | かけざん
太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを気に入っているので、数字を見かけるとかけざんをしたくなります。そんな彼はここのところ、次のような処理を0以上の整数に施すことが好きなようです。
(処理の流れ)
手順1. ある0以上の整数nが10進数表示で一けたならばそこで処理を終了する。そうでなければ手順2に進む
手順2. 10以上の整数nを10進数表示をするとどこかの桁の間に切れ目を入れて二つの数字に分解することが可能である(例えば2012-> 20,12)。このような切り方としてありうるものに対して,得られた二つの数字を掛け合わせて最も大きいものを次のnとして手順1に戻る。(詳しくは下記の"手順2に... | [
{
"submission_id": "aoj_2424_9575336",
"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_2436_cpp | 問題名
今
n
枚の数字が書かれたカードがあります。これらの一部または全部を適当に並べて数字を作ることを考えます。この時作られる数字を全て足した数を求めて下さい。
例えば、 1 と 2 があったら、作られる数字は 1, 2, 12, 21 の 4 つなので、全て足した数は 36 になります。並べた結果同じ数字が出来ても違う並べ方だとしたら別々に足します。たとえば、 1 というカードと 11 というカードがあったら並べて 111 になる並べ方が2通りありますがそれぞれ別のものとして足し合わせます。カードの中にリーディングゼロのカードはありませんし、リーディングゼロになる数字は認めません。答えを1,000,000,007 で割ったものを... | [
{
"submission_id": "aoj_2436_10561821",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod = 1000000007;\n\nint dp[202][202][802];\n\nlong long solve(vector<string> S) {\n\tif (S.size() == 0) return 0;\n\tvector<int> digsum(6, 0);\n\tfor (int i = 0; i < S.size(); i++) {\n\t... |
aoj_2432_cpp | Sports Days 2.0
会津大学附属小学校（会津大小）は日本有数の競技プログラマー養成校として有名である。
もちろん、運動会に参加しているときでさえアルゴリズムの修行を欠かせない。
競技プログラミング部部長のあなたはもちろんこの大会でも勝利したい。
今回はある競技に注目する。
ある競技とは会津大小で行われている伝統的な競技だ。
校庭にコーンが
V
個置いてある。
コーンのいくつかのペアは白線で描かれた矢印で結ばれている。
矢印の先は片側だけについており、整数が併記されている。
同じコーンのペアがの複数の矢印に結ばれている場合もある。
競技者は任意にコーンを選び、移動開始する。
移動は競技者がいるコーンから矢印の上をその向きに... | [
{
"submission_id": "aoj_2432_10848636",
"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>;\nusing P3 = pair<int,P>;\nusing PP = pair<P, P>;\nconstexpr int INF32 = 1 << 30;\nconstexpr ll INF64 = 1LL << 6... |
aoj_2435_cpp | 問題名 Zero division checker
森下さんは困っていました... 姉原さんにプログラムを書いてもらったのですが、そのプログラムがクラッシュするのです。
姉原さんに書いてもらったのは、逆ポーランド記法の式を読んで、その計算結果を出力するプログラムで、クラッシュログによると、 0 で割り算をしてしまったのが原因のようです。これは、森下さんが間違った式を入力してしまったからかもしれませんし、もしかしたら、もしかしたら、姉原さんの書いたプログラムにバグがあるのかもしれません。
姉原さんの書いたプログラムを読んでみようと思いましたが、姉原さんのプログラムはアセンブリというよくわからないことばで書かれているようで、見ているだけ... | [
{
"submission_id": "aoj_2435_6708649",
"code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <... |
aoj_2434_cpp | 問題名 Audition
アイドル---それは女の子達の永遠の憧れ。しかし、頂点に立てるのはほんの一握り。そんなサバイバルな世界に、あなたはアイドルプロデューサーとして足を踏み入れることになりました。そして、今日はあなたの担当アイドルを連れて大事なオーディションに挑むことになりました。
オーディションの決め手になるのはビジュアル、ダンス、ボーカルの 3 要素です。オーディション中には
m
回のアピールタイムがあり、 1 回のアピールタイムごとに各アイドルはビジュアルアピール、ダンスアピール、ボーカルアピールのいずれかを行うことが出来ます。ビジュアルアピールを行うとそのアイドルのビジュアルポイントは彼女の持ってるビジュアル値だけ、ダン... | [
{
"submission_id": "aoj_2434_9779526",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)\n#define rrep(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v)... |
aoj_2437_cpp | 問題名 DNA
遺伝子は、
A
,
T
,
G
,
C
からなる文字列です。
この世界の遺伝子は奇妙なことに、ある構文規則に従うことが知られています。
構文規則は、次のような形で与えられます。
非終端記号1: 記号1_1 記号1_2 ... 記号1_n1
非終端記号2: 記号2_1 記号2_2 ... 記号2_n2
...
非終端記号m: 記号m_1 記号m_2 ... 記号m_nm
記号は非終端記号または終端記号のどちらかです。
非終端記号は小文字文字列で表され、終端記号は
A
,
T
,
G
,
C
のうちのいくつかの文字が、"
[
"と"
]
"に囲まれた文字列で表されます。
構文規則の例は次のようになります。
dna: a ... | [
{
"submission_id": "aoj_2437_9582362",
"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_2441_cpp | FizzBuzz
FizzBuzzとは、1以上の整数を順に、以下のルールに従って発言していくゲームである。
3で割り切れる時には「Fizz」
5で割り切れる時には「Buzz」
3と5の両方で割り切れる時には「FizzBuzz」
それ以外の時はその数字
ゲームの進行状況の例を以下に示す。
1, 2, Fizz, 4, Buzz, Fizz, 7, 8, Fizz, Buzz, 11, Fizz, 13, 14, FizzBuzz, 16, …
得られた発言を1つの文字列に結合し得られた文字列をFizzBuzz Stringと呼ぶ。インデックスsが与えられるので、FizzBuzz Stringのs文字目から20文字を出力せよ。但し、イン... | [
{
"submission_id": "aoj_2441_2971948",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <cstring>\n#include <sstream>\nusing namespace std;\n\n// calc digit-dp\n// dp[(桁)][(num of leading-zero)][smaller][15 で割ったあまり] :＝ 個数\nlong long dp[21][21][3][16];\nlong long calc(long... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.